forked from UnlegitDqrk/unlegitlibrary
87 lines
2.4 KiB
Java
87 lines
2.4 KiB
Java
/*
|
|
* Copyright (C) 2024 UnlegitDqrk - All Rights Reserved
|
|
*
|
|
* You are unauthorized to remove this copyright.
|
|
* You have to give Credits to the Author in your project and link this GitHub site: https://github.com/UnlegitDqrk
|
|
* See LICENSE-File if exists
|
|
*/
|
|
|
|
package me.finn.unlegitlibrary.number.bit;
|
|
|
|
import java.util.Arrays;
|
|
|
|
public class Pow2BitArray implements BitArray {
|
|
|
|
/**
|
|
* Array used to store data
|
|
*/
|
|
private final int[] words;
|
|
|
|
/**
|
|
* Palette version information
|
|
*/
|
|
private final BitArrayVersion version;
|
|
|
|
/**
|
|
* Number of entries in this palette (<b>not</b> the length of the words array that internally backs this palette)
|
|
*/
|
|
private final int size;
|
|
|
|
Pow2BitArray(BitArrayVersion version, int size, int[] words) {
|
|
this.size = size;
|
|
this.version = version;
|
|
this.words = words;
|
|
int expectedWordsLength = PaddedBitArray.ceil((float) size / version.entriesPerWord);
|
|
|
|
if (words.length != expectedWordsLength) {
|
|
throw new IllegalArgumentException("Invalid length given for storage, got: " + words.length + " but expected: " + expectedWordsLength);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Sets the entry at the given location to the given value
|
|
*/
|
|
public final void set(int index, int value) {
|
|
int bitIndex = index * this.version.bits;
|
|
int arrayIndex = bitIndex >> 5;
|
|
int offset = bitIndex & 31;
|
|
this.words[arrayIndex] = this.words[arrayIndex] & ~(this.version.maxEntryValue << offset) | (value & this.version.maxEntryValue) << offset;
|
|
}
|
|
|
|
/**
|
|
* Gets the entry at the given index
|
|
*/
|
|
public final int get(int index) {
|
|
int bitIndex = index * this.version.bits;
|
|
int arrayIndex = bitIndex >> 5;
|
|
int wordOffset = bitIndex & 31;
|
|
|
|
return this.words[arrayIndex] >>> wordOffset & this.version.maxEntryValue;
|
|
}
|
|
|
|
/**
|
|
* Gets the long array that is used to store the data in this BitArray. This is useful for sending packet data.
|
|
*/
|
|
public final int size() {
|
|
return this.size;
|
|
}
|
|
|
|
/**
|
|
* {@inheritDoc}
|
|
*
|
|
* @return {@inheritDoc}
|
|
*/
|
|
@Override
|
|
public final int[] getWords() {
|
|
return this.words;
|
|
}
|
|
|
|
public final BitArrayVersion getVersion() {
|
|
return version;
|
|
}
|
|
|
|
@Override
|
|
public final BitArray copy() {
|
|
return new Pow2BitArray(this.version, this.size, Arrays.copyOf(this.words, this.words.length));
|
|
}
|
|
} |