Files
ortools-clone/ortools/base/bitmap.h

88 lines
2.8 KiB
C
Raw Normal View History

// Copyright 2010-2021 Google LLC
2010-09-15 12:42:33 +00:00
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
2011-05-11 16:05:15 +00:00
#ifndef OR_TOOLS_BASE_BITMAP_H_
#define OR_TOOLS_BASE_BITMAP_H_
2010-09-15 12:42:33 +00:00
#include <string.h>
#include "ortools/base/basictypes.h"
2010-09-15 12:42:33 +00:00
namespace operations_research {
2017-03-21 12:41:31 -04:00
namespace internal {
2021-04-01 12:13:35 +02:00
inline uint64_t OneBit64(int pos) { return uint64_t{1} << pos; }
inline uint64_t BitPos64(uint64_t pos) { return (pos & 63); }
inline uint64_t BitOffset64(uint64_t pos) { return (pos >> 6); }
inline uint64_t BitLength64(uint64_t size) { return ((size + 63) >> 6); }
inline bool IsBitSet64(const uint64_t* const bitset, uint64_t pos) {
return (bitset[BitOffset64(pos)] & OneBit64(BitPos64(pos)));
}
2021-04-01 12:13:35 +02:00
inline void SetBit64(uint64_t* const bitset, uint64_t pos) {
bitset[BitOffset64(pos)] |= OneBit64(BitPos64(pos));
}
2021-04-01 12:13:35 +02:00
inline void ClearBit64(uint64_t* const bitset, uint64_t pos) {
bitset[BitOffset64(pos)] &= ~OneBit64(BitPos64(pos));
}
2020-10-22 23:36:58 +02:00
} // namespace internal
2010-09-15 12:42:33 +00:00
class Bitmap {
2020-10-22 23:36:58 +02:00
public:
// Constructor : This allocates on a uint32_t boundary.
// fill: true = initialize with 1's, false = initialize with 0's.
explicit Bitmap(uint32_t size, bool fill = false)
2020-10-22 23:36:58 +02:00
: max_size_(size),
array_size_(internal::BitLength64(size)),
2021-04-01 12:13:35 +02:00
map_(new uint64_t[array_size_]) {
2010-09-15 12:42:33 +00:00
// initialize all of the bits
SetAll(fill);
}
// Destructor: clean up.
2014-01-08 12:01:58 +00:00
~Bitmap() { delete[] map_; }
2010-09-15 12:42:33 +00:00
// Resizes the bitmap.
// If size < bits(), the extra bits will be discarded.
// If size > bits(), the extra bits will be filled with the fill value.
void Resize(uint32_t size, bool fill = false);
2010-09-15 12:42:33 +00:00
bool Get(uint32_t index) const {
2010-10-15 09:12:01 +00:00
assert(max_size_ == 0 || index < max_size_);
2017-03-21 12:41:31 -04:00
return internal::IsBitSet64(map_, index);
2010-09-15 12:42:33 +00:00
}
void Set(uint32_t index, bool value) {
2010-10-15 09:12:01 +00:00
assert(max_size_ == 0 || index < max_size_);
2014-01-08 12:01:58 +00:00
if (value) {
2017-03-21 12:41:31 -04:00
internal::SetBit64(map_, index);
2010-09-15 12:42:33 +00:00
} else {
2017-03-21 12:41:31 -04:00
internal::ClearBit64(map_, index);
2010-09-15 12:42:33 +00:00
}
}
// Sets all the bits to true or false
void SetAll(bool value) {
memset(map_, (value ? 0xFF : 0x00), array_size_ * sizeof(*map_));
}
// Clears all bits in the bitmap
void Clear() { SetAll(false); }
2020-10-22 23:36:58 +02:00
private:
uint32_t max_size_; // the upper bound of the bitmap
uint32_t array_size_;
2021-04-01 12:13:35 +02:00
uint64_t* map_; // the bitmap
2010-09-15 12:42:33 +00:00
};
2020-10-22 23:36:58 +02:00
} // namespace operations_research
2010-09-15 12:42:33 +00:00
2020-10-22 23:36:58 +02:00
#endif // OR_TOOLS_BASE_BITMAP_H_