#include "GeomExport.h"#include "maxheap.h"#include <wtypes.h>#include <limits.h>#include "maxtypes.h"#include "assert1.h"Go to the source code of this file.
Classes |
|
| class | BitArrayCallback |
| class | BitArray |
| class | BitArray::NumberSetProxy |
Enumerations |
|
| enum | { LEFT_BITSHIFT = 0, RIGHT_BITSHIFT = 1 } |
Functions |
|
| template<typename T > | |
| T | operator+ (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| T | operator- (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| T | operator* (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| T | operator/ (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| T | operator% (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| bool | operator<= (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| bool | operator< (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| bool | operator> (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| bool | operator>= (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| bool | operator== (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| bool | operator!= (T n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| void | operator+= (T &n, const BitArray::NumberSetProxy &proxy) |
| template<typename T > | |
| void | operator-= (T &n, const BitArray::NumberSetProxy &proxy) |
| anonymous enum |
Definition at line 44 of file bitarray.h.
{
LEFT_BITSHIFT = 0,
RIGHT_BITSHIFT = 1,
};
| T operator+ | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 524 of file bitarray.h.
{
return n + proxy.operator int();
}
| T operator- | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 529 of file bitarray.h.
{
return n - proxy.operator int();
}
| T operator* | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 534 of file bitarray.h.
{
return proxy.operator *(n);
}
| T operator/ | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 539 of file bitarray.h.
{
return n / proxy.operator int();
}
| T operator% | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 544 of file bitarray.h.
{
return n % proxy.operator int();
}
| bool operator<= | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 549 of file bitarray.h.
{
return proxy.operator >=(n);
}
| bool operator< | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 554 of file bitarray.h.
{
return proxy.operator >(n);
}
| bool operator> | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 559 of file bitarray.h.
{
return proxy.operator <(n);
}
| bool operator>= | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 564 of file bitarray.h.
{
return proxy.operator <=(n);
}
| bool operator== | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 569 of file bitarray.h.
{
return proxy.operator ==(n);
}
| bool operator!= | ( | T | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 574 of file bitarray.h.
{
return proxy.operator !=(n);
}
| void operator+= | ( | T & | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 579 of file bitarray.h.
{
n += proxy.operator int();
}
| void operator-= | ( | T & | n, |
| const BitArray::NumberSetProxy & | proxy | ||
| ) | [inline] |
Definition at line 584 of file bitarray.h.
{
n -= proxy.operator int();
}