mirror of
https://github.com/GeyserMC/Geyser.git
synced 2024-08-14 23:57:35 +00:00
Remove unused NibbleArray class
This commit is contained in:
parent
24b0f83742
commit
b7de1b668f
1 changed files with 0 additions and 92 deletions
|
@ -1,92 +0,0 @@
|
||||||
/*
|
|
||||||
* Copyright (c) 2019-2022 GeyserMC. http://geysermc.org
|
|
||||||
*
|
|
||||||
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
||||||
* of this software and associated documentation files (the "Software"), to deal
|
|
||||||
* in the Software without restriction, including without limitation the rights
|
|
||||||
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
||||||
* copies of the Software, and to permit persons to whom the Software is
|
|
||||||
* furnished to do so, subject to the following conditions:
|
|
||||||
*
|
|
||||||
* The above copyright notice and this permission notice shall be included in
|
|
||||||
* all copies or substantial portions of the Software.
|
|
||||||
*
|
|
||||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
||||||
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
||||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
||||||
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
||||||
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
||||||
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
||||||
* THE SOFTWARE.
|
|
||||||
*
|
|
||||||
* @author GeyserMC
|
|
||||||
* @link https://github.com/GeyserMC/Geyser
|
|
||||||
*/
|
|
||||||
|
|
||||||
package org.geysermc.geyser.level.chunk;
|
|
||||||
|
|
||||||
import com.nukkitx.network.util.Preconditions;
|
|
||||||
|
|
||||||
public class NibbleArray implements Cloneable {
|
|
||||||
|
|
||||||
private final byte[] data;
|
|
||||||
|
|
||||||
public NibbleArray(int length) {
|
|
||||||
data = new byte[length / 2];
|
|
||||||
}
|
|
||||||
|
|
||||||
public NibbleArray(byte[] array) {
|
|
||||||
data = array;
|
|
||||||
}
|
|
||||||
|
|
||||||
public byte get(int index) {
|
|
||||||
Preconditions.checkElementIndex(index, data.length * 2);
|
|
||||||
byte val = data[index / 2];
|
|
||||||
if ((index & 1) == 0) {
|
|
||||||
return (byte) (val & 0x0f);
|
|
||||||
} else {
|
|
||||||
return (byte) ((val & 0xf0) >>> 4);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void set(int index, byte value) {
|
|
||||||
Preconditions.checkArgument(value >= 0 && value < 16, "Nibbles must have a value between 0 and 15.");
|
|
||||||
Preconditions.checkElementIndex(index, data.length * 2);
|
|
||||||
value &= 0xf;
|
|
||||||
int half = index / 2;
|
|
||||||
byte previous = data[half];
|
|
||||||
if ((index & 1) == 0) {
|
|
||||||
data[half] = (byte) (previous & 0xf0 | value);
|
|
||||||
} else {
|
|
||||||
data[half] = (byte) (previous & 0x0f | value << 4);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void fill(byte value) {
|
|
||||||
Preconditions.checkArgument(value >= 0 && value < 16, "Nibbles must have a value between 0 and 15.");
|
|
||||||
value &= 0xf;
|
|
||||||
for (int i = 0; i < data.length; i++) {
|
|
||||||
data[i] = (byte) ((value << 4) | value);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
public void copyFrom(byte[] bytes) {
|
|
||||||
Preconditions.checkNotNull(bytes, "bytes");
|
|
||||||
Preconditions.checkArgument(bytes.length == data.length, "length of provided byte array is %s but expected %s", bytes.length,
|
|
||||||
data.length);
|
|
||||||
System.arraycopy(bytes, 0, data, 0, data.length);
|
|
||||||
}
|
|
||||||
|
|
||||||
public void copyFrom(NibbleArray array) {
|
|
||||||
Preconditions.checkNotNull(array, "array");
|
|
||||||
copyFrom(array.data);
|
|
||||||
}
|
|
||||||
|
|
||||||
public byte[] getData() {
|
|
||||||
return data;
|
|
||||||
}
|
|
||||||
|
|
||||||
public NibbleArray copy() {
|
|
||||||
return new NibbleArray(getData().clone());
|
|
||||||
}
|
|
||||||
}
|
|
Loading…
Reference in a new issue