|
| size_t | MR::heapBytes (const BitSet &bs) |
| | returns the amount of memory given BitSet occupies on heap
|
| |
| MRMESH_API bool | MR::operator== (const BitSet &a, const BitSet &b) |
| | compare that two bit sets have the same set bits (they can be equal even if sizes are distinct but last bits are off)
|
| |
| template<typename I > |
| bool | MR::operator== (const TypedBitSet< I > &a, const TypedBitSet< I > &b) |
| |
| template<typename T , typename U > |
| void | MR::operator== (const TypedBitSet< T > &a, const TypedBitSet< U > &b)=delete |
| | prohibit comparison of unrelated sets
|
| |
| template<typename I > |
| std::function< bool(I)> | MR::makePredicate (const TypedBitSet< I > *bitset) |
| |
| template<typename I > |
| std::function< bool(I)> | MR::makePredicate (const TypedBitSet< I > &bitset) |
| |
| template<typename I > |
| bool | MR::contains (const TypedBitSet< I > *bitset, I id) |
| |
| template<typename I > |
| bool | MR::contains (const TypedBitSet< I > &bitset, I id) |
| |
| MR_BIND_IGNORE auto | MR::begin (const BitSet &a) |
| |
| MR_BIND_IGNORE auto | MR::end (const BitSet &) |
| |
| template<typename I > |
| MR_BIND_IGNORE auto | MR::begin (const TypedBitSet< I > &a) |
| |
| template<typename I > |
| MR_BIND_IGNORE auto | MR::end (const TypedBitSet< I > &) |
| |
| template<typename I > |
| Vector< int, I > | MR::makeVectorWithSeqNums (const TypedBitSet< I > &bs) |
| | creates a Vector where for each set bit of input bitset its sequential number starting from 0 is returned; and -1 for reset bits
|
| |
| template<typename I > |
| HashMap< I, int > | MR::makeHashMapWithSeqNums (const TypedBitSet< I > &bs) |
| | creates a HashMap where for each set bit of input bitset its sequential number starting from 0 is returned
|
| |
| BitSet | MR::operator& (const BitSet &a, const BitSet &b) |
| |
| BitSet | MR::operator| (const BitSet &a, const BitSet &b) |
| |
| BitSet | MR::operator^ (const BitSet &a, const BitSet &b) |
| |
| BitSet | MR::operator- (const BitSet &a, const BitSet &b) |
| |