BitArray.cpp 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123
  1. #include "utils/BitArray.h"
  2. #include "utils/Utils.h"
  3. static int roundUpDivide(int a, int b) {
  4. if(a % b == 0) {
  5. return a / b;
  6. }
  7. return a / b + 1;
  8. }
  9. static constexpr int INT_BITS = sizeof(int) * 8;
  10. static constexpr int DIVIDE_BITS = Utils::roundUpLog2(INT_BITS);
  11. static int readBits(const int* data, int index, int bits) {
  12. int dataIndexA = (index * bits) >> DIVIDE_BITS;
  13. int dataIndexB = ((index + 1) * bits) >> DIVIDE_BITS;
  14. int shifts = (index * bits) & (INT_BITS - 1);
  15. if(dataIndexA == dataIndexB) {
  16. return (data[dataIndexA] >> shifts) & ((1 << bits) - 1);
  17. }
  18. int bitsInA = INT_BITS - shifts;
  19. int r = (data[dataIndexA] >> shifts) & ((1 << bitsInA) - 1);
  20. r |= (data[dataIndexB] & ((1 << (bits - bitsInA)) - 1)) << bitsInA;
  21. return r;
  22. }
  23. static void setBits(int* data, int index, int bits, int value) {
  24. int mask = (1 << bits) - 1;
  25. value &= mask;
  26. int dataIndexA = (index * bits) >> DIVIDE_BITS;
  27. int dataIndexB = ((index + 1) * bits) >> DIVIDE_BITS;
  28. int shifts = (index * bits) & (INT_BITS - 1);
  29. data[dataIndexA] &= ~(mask << shifts);
  30. data[dataIndexA] |= (value << shifts);
  31. if(dataIndexA != dataIndexB) {
  32. int leftBits = bits - (INT_BITS - shifts);
  33. int mask = (1 << leftBits) - 1;
  34. data[dataIndexB] &= ~mask;
  35. data[dataIndexB] |= (value >> (INT_BITS - shifts));
  36. }
  37. }
  38. BitArray::BitArray(int length, int bits)
  39. : length(length), bits(bits), data(new int[roundUpDivide(length * bits, sizeof(int))]) {
  40. }
  41. BitArray::~BitArray() {
  42. delete[] data;
  43. }
  44. BitArray::BitArray(const BitArray& other) : BitArray(other.length, other.bits) {
  45. copyData(other);
  46. }
  47. BitArray::BitArray(BitArray&& other) : length(other.length), bits(other.bits), data(other.data) {
  48. other.reset();
  49. }
  50. BitArray& BitArray::operator=(const BitArray& other) {
  51. if(this == &other) {
  52. return *this;
  53. } else if(length == other.length && bits == other.bits) {
  54. copyData(other);
  55. return *this;
  56. }
  57. delete[] data;
  58. length = other.length;
  59. bits = other.bits;
  60. data = new int[roundUpDivide(length * bits, sizeof(int))];
  61. copyData(other);
  62. return *this;
  63. }
  64. BitArray& BitArray::operator=(BitArray&& other) {
  65. if(this == &other) {
  66. return *this;
  67. }
  68. delete[] data;
  69. length = other.length;
  70. bits = other.bits;
  71. data = other.data;
  72. other.reset();
  73. return *this;
  74. }
  75. BitArray& BitArray::set(int index, int value) {
  76. setBits(data, index, bits, value);
  77. return *this;
  78. }
  79. int BitArray::get(int index) const {
  80. return readBits(data, index, bits);
  81. }
  82. int BitArray::getLength() const {
  83. return length;
  84. }
  85. int BitArray::getBits() const {
  86. return bits;
  87. }
  88. void BitArray::resize(int newBits) {
  89. int* newData = new int[roundUpDivide(length * newBits, sizeof(int))];
  90. for(int i = 0; i < length; i++) {
  91. setBits(newData, i, newBits, get(i));
  92. }
  93. delete[] data;
  94. data = newData;
  95. bits = newBits;
  96. }
  97. void BitArray::copyData(const BitArray& other) {
  98. for(int i = 0; i < length; i++) {
  99. set(i, other.get(i));
  100. }
  101. }
  102. void BitArray::reset() {
  103. length = 0;
  104. bits = 0;
  105. data = nullptr;
  106. }