bitarray.h File Reference

#include "GeomExport.h"
#include "maxheap.h"
#include "WindowsDefines.h"
#include <limits.h>
#include "maxtypes.h"
#include "assert1.h"

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)

Enumeration Type Documentation

anonymous enum

anonymous enum

Enumerator
LEFT_BITSHIFT
RIGHT_BITSHIFT

{
    LEFT_BITSHIFT = 0,
    RIGHT_BITSHIFT = 1,
};

Function Documentation

operator+()

T operator+ ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return n + proxy.operator int();
}

operator-()

T operator- ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return n - proxy.operator int();
}

operator*()

T operator* ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return proxy.operator*(n);
}

operator/()

T operator/ ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return n / proxy.operator int();
}

operator%()

T operator% ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return n % proxy.operator int();
}

operator<=()

bool operator<= ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return proxy.operator>=(n);
}

operator<()

bool operator< ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return proxy.operator>(n);
}

operator>()

bool operator> ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return proxy.operator<(n);
}

operator>=()

bool operator>= ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return proxy.operator<=(n);
}

operator==()

bool operator== ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return proxy.operator==(n);
}

operator!=()

bool operator!= ( T  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    return proxy.operator!=(n);
}

operator+=()

void operator+= ( T &  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    n += proxy.operator int();
}

operator-=()

void operator-= ( T &  n, const BitArray::NumberSetProxy &  proxy  )

inline

{
    n -= proxy.operator int();
}