5 * Created by Christian Brunschen on 09/05/2008.
6 * Copyright 2008 Google UK. All rights reserved.
8 * Licensed under the Apache License, Version 2.0 (the "License");
9 * you may not use this file except in compliance with the License.
10 * You may obtain a copy of the License at
12 * http://www.apache.org/licenses/LICENSE-2.0
14 * Unless required by applicable law or agreed to in writing, software
15 * distributed under the License is distributed on an "AS IS" BASIS,
16 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
17 * See the License for the specific language governing permissions and
18 * limitations under the License.
21 #include <zxing/common/BitArray.h>
27 static unsigned int logDigits(unsigned digits) {
30 while (val < digits) {
36 const unsigned int BitArray::bitsPerWord_ = sizeof(unsigned int)*8;
37 const unsigned int BitArray::logBits_ = logDigits(bitsPerWord_);
38 const unsigned int BitArray::bitsMask_ = (1 << logBits_) - 1;
39 size_t BitArray::wordsForBits(size_t bits) {
40 int arraySize = bits >> logBits_;
41 if (bits - (arraySize << logBits_) != 0) {
46 BitArray::BitArray() {
47 cout << "hey! don't use this BitArrayConstructor!\n";
50 BitArray::BitArray(size_t size) :
51 size_(size), bits_(wordsForBits(size), (const unsigned int)0) {
53 BitArray::~BitArray() {
55 size_t BitArray::getSize() {
58 bool BitArray::get(size_t i) {
59 return (bits_[i >> logBits_] & (1 << (i & bitsMask_))) != 0;
61 void BitArray::set(size_t i) {
62 bits_[i >> logBits_] |= 1 << (i & bitsMask_);
64 void BitArray::setBulk(size_t i, unsigned int newBits) {
65 bits_[i >> logBits_] = newBits;
67 void BitArray::clear() {
68 size_t max = bits_.size();
69 for (size_t i = 0; i < max; i++) {
73 bool BitArray::isRange(size_t start, size_t end, bool value) {
75 throw IllegalArgumentException("end must be after start");
80 // treat the 'end' as inclusive, rather than exclusive
82 size_t firstWord = start >> logBits_;
83 size_t lastWord = end >> logBits_;
84 for (size_t i = firstWord; i <= lastWord; i++) {
85 size_t firstBit = i > firstWord ? 0 : start & bitsMask_;
86 size_t lastBit = i < lastWord ? logBits_ : end & bitsMask_;
88 if (firstBit == 0 && lastBit == logBits_) {
89 mask = numeric_limits<unsigned int>::max();
92 for (size_t j = firstBit; j <= lastBit; j++) {
97 if ((bits_[i] & mask) != mask) {
101 if ((bits_[i] & mask) != 0) {
108 vector<unsigned int>& BitArray::getBitArray() {
111 void BitArray::reverse() {
112 unsigned int allBits = numeric_limits<unsigned int>::max();
113 size_t max = bits_.size();
114 for (size_t i = 0; i < max; i++) {
115 bits_[i] = bits_[i] ^ allBits;