BitArray::NumberSetProxy Class Reference

#include <bitarray.h>

Public Member Functions
	operator bool () const
bool	operator! () const
	operator int () const
	operator unsigned long () const
	operator uint64_t () const
	operator float () const
bool	operator< (int n) const
bool	operator<= (int n) const
bool	operator> (int n) const
bool	operator>= (int n) const
bool	operator== (int n) const
bool	operator!= (int n) const
int	operator+ (int n) const
int	operator- (int n) const
int	operator* (int n) const
int	operator/ (int n) const
int	operator% (int n) const
int	operator+ (const NumberSetProxy &proxy) const
int	operator- (const NumberSetProxy &proxy) const
int	operator* (const NumberSetProxy &proxy) const

Friends
class	BitArray

Member Function Documentation

operator bool()

operator bool ( ) const

inline

        {
            return !mArray.IsEmpty();
        }

operator!()

bool operator! ( ) const

inline

        {
            return mArray.IsEmpty();
        }

operator int()

operator int ( ) const

inline

        {
            return mArray.NumberSetImpl();
        }

operator unsigned long()

operator unsigned long ( ) const

inline

        {
            return mArray.NumberSetImpl();
        }

operator uint64_t()

operator uint64_t ( ) const

inline

        {
            return mArray.NumberSetImpl();
        }

operator float()

operator float ( ) const

inline

        {
            return (float)mArray.NumberSetImpl();
        }

operator<()

bool operator< ( int  n ) const

inline

        {
            // if( NumberSet() < 0 ) or a negative, always returns false.
            // if( NumberSet() < 1 ), basically mean "IsEmpty()".
            // if( NumberSet() < n ), we use !(NumberSet() >= n)
            return (n <= 0) ? false : ((n == 1) ? mArray.IsEmpty() : !mArray.NumberSetAtLeastImpl(n));
        }

operator<=()

bool operator<= ( int  n ) const

inline

        {
            // if( x <= n ) ==> if( !(x >= (n+1)) )
            return !mArray.NumberSetAtLeastImpl(n + 1);
        }

operator>()

bool operator> ( int  n ) const

inline

        {
            // if( x > 0 ) ==> !IsEmpty()
            // if( x > n ) ==> if( x >= (n+1) )
            return n ? mArray.NumberSetAtLeastImpl(n + 1) : !mArray.IsEmpty();
        }

operator>=()

bool operator>= ( int  n ) const

inline

        {
            return mArray.NumberSetAtLeastImpl(n);
        }

operator==()

bool operator== ( int  n ) const

inline

        {
            return n?mArray.NumberSetEqualImpl(n): mArray.IsEmpty();
        }

operator!=()

bool operator!= ( int  n ) const

inline

        {
            return n?!mArray.NumberSetEqualImpl(n):mArray.AnyBitSet();
        }

operator+() [1/2]

int operator+ ( int  n ) const

inline

        {
            return mArray.NumberSetImpl() + n;
        }

operator-() [1/2]

int operator- ( int  n ) const

inline

        {
            return mArray.NumberSetImpl() - n;
        }

operator*() [1/2]

int operator* ( int  n ) const

inline

        {
            return mArray.NumberSetImpl() * n;
        }

operator/()

int operator/ ( int  n ) const

inline

        {
            return mArray.NumberSetImpl() / n;
        }

operator%()

int operator% ( int  n ) const

inline

        {
            return mArray.NumberSetImpl() % n;
        }

operator+() [2/2]

int operator+ ( const NumberSetProxy &  proxy ) const

inline

        {
            return mArray.NumberSetImpl() + int(proxy);
        }

operator-() [2/2]

int operator- ( const NumberSetProxy &  proxy ) const

inline

        {
            return mArray.NumberSetImpl() - int(proxy);
        }

operator*() [2/2]

int operator* ( const NumberSetProxy &  proxy ) const

inline

        {
            return mArray.NumberSetImpl() * int(proxy);
        }

Friends And Related Function Documentation

BitArray

friend class BitArray

friend