Open CASCADE Technology
7.2.0
|
#include <TColStd_PackedMapOfInteger.hxx>
Protected Member Functions | |
Standard_Integer | InternalExtent () const |
Optimized Map of integer values. Each block of 32 integers is stored in 8 bytes in memory.
|
inline |
Constructor.
|
inline |
Copy constructor.
|
inline |
Standard_Boolean TColStd_PackedMapOfInteger::Add | ( | const Standard_Integer | aKey | ) |
TColStd_PackedMapOfInteger& TColStd_PackedMapOfInteger::Assign | ( | const TColStd_PackedMapOfInteger & | ) |
void TColStd_PackedMapOfInteger::Clear | ( | ) |
Standard_Boolean TColStd_PackedMapOfInteger::Contains | ( | const Standard_Integer | aKey | ) | const |
Standard_Boolean TColStd_PackedMapOfInteger::Differ | ( | const TColStd_PackedMapOfInteger & | ) |
Apply to this Map the symmetric difference (aka exclusive disjunction, boolean XOR) operation with another (given) Map. The result contains the values that are contained only in this or the operand map, but not in both. This algorithm is similar to method Difference().
void TColStd_PackedMapOfInteger::Difference | ( | const TColStd_PackedMapOfInteger & | , |
const TColStd_PackedMapOfInteger & | |||
) |
Sets this Map to be the result of symmetric difference (aka exclusive disjunction, boolean XOR) operation between two given Maps. The new Map contains the values that are contained only in the first or the second operand maps but not in both. All previous contents of this Map is cleared. This map (result of the boolean operation) can also be used as one of operands.
|
inline |
Standard_Integer TColStd_PackedMapOfInteger::GetMaximalMapped | ( | ) | const |
Query the maximal contained key value.
Standard_Integer TColStd_PackedMapOfInteger::GetMinimalMapped | ( | ) | const |
Query the minimal contained key value.
Standard_Boolean TColStd_PackedMapOfInteger::HasIntersection | ( | const TColStd_PackedMapOfInteger & | ) | const |
Returns True if this map has common items with the given one.
|
inlineprotected |
Standard_Boolean TColStd_PackedMapOfInteger::Intersect | ( | const TColStd_PackedMapOfInteger & | ) |
Apply to this Map the intersection operation (aka multiplication, common, boolean AND) with another (given) Map. The result contains only the values that are contained in both this and the given maps. This algorithm is similar to method Intersection().
void TColStd_PackedMapOfInteger::Intersection | ( | const TColStd_PackedMapOfInteger & | , |
const TColStd_PackedMapOfInteger & | |||
) |
Sets this Map to be the result of intersection (aka multiplication, common, boolean AND) operation between two given Maps. The new Map contains only the values that are contained in both map operands. All previous contents of this Map is cleared. This same map (result of the boolean operation) can also be used as one of operands. The order of operands makes no difference; the method minimizes internally the number of iterations using the smallest map for the loop.
|
inline |
Standard_Boolean TColStd_PackedMapOfInteger::IsEqual | ( | const TColStd_PackedMapOfInteger & | ) | const |
Returns True if this map is equal to the given one, i.e. they contain the same sets of elements
Standard_Boolean TColStd_PackedMapOfInteger::IsSubset | ( | const TColStd_PackedMapOfInteger & | ) | const |
Returns True if this map is subset of the given one, i.e. all elements contained in this map is contained also in the operand map. if this map is empty that this method returns true for any operand map.
|
inline |
|
inline |
Overloaded operator version of Intersect().
|
inline |
Overloaded operator version of Subtract().
|
inline |
Overloaded operator version of IsSubset().
|
inline |
|
inline |
Overloaded operator version of IsEqual().
|
inline |
Overloaded operator version of Differ().
|
inline |
Overloaded operator version of Unite().
Standard_Boolean TColStd_PackedMapOfInteger::Remove | ( | const Standard_Integer | aKey | ) |
void TColStd_PackedMapOfInteger::ReSize | ( | const Standard_Integer | NbBuckets | ) |
|
inline |
Standard_Boolean TColStd_PackedMapOfInteger::Subtract | ( | const TColStd_PackedMapOfInteger & | ) |
Apply to this Map the subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation with another (given) Map. The result contains only the values that were previously contained in this map and not contained in this map. This algorithm is similar to method Subtract() with two operands.
void TColStd_PackedMapOfInteger::Subtraction | ( | const TColStd_PackedMapOfInteger & | , |
const TColStd_PackedMapOfInteger & | |||
) |
Sets this Map to be the result of subtraction (aka set-theoretic difference, relative complement, exclude, cut, boolean NOT) operation between two given Maps. The new Map contains only the values that are contained in the first map operands and not contained in the second one. All previous contents of this Map is cleared. This map (result of the boolean operation) can also be used as the first operand.
void TColStd_PackedMapOfInteger::Union | ( | const TColStd_PackedMapOfInteger & | , |
const TColStd_PackedMapOfInteger & | |||
) |
Sets this Map to be the result of union (aka addition, fuse, merge, boolean OR) operation between two given Maps. The new Map contains the values that are contained either in the first map or in the second map or in both. All previous contents of this Map is cleared. This map (result of the boolean operation) can also be passed as one of operands.
Standard_Boolean TColStd_PackedMapOfInteger::Unite | ( | const TColStd_PackedMapOfInteger & | ) |
Apply to this Map the boolean operation union (aka addition, fuse, merge, boolean OR) with another (given) Map. The result contains the values that were previously contained in this map or contained in the given (operand) map. This algorithm is similar to method Union().