#include <stl_bids.h>

Inheritance diagram for TArrayAsVector< T >:

Collaboration diagram for TArrayAsVector< T >:

Public Member Functions
	TArrayAsVector (size_type upper, size_type lower=0, int delta=0)

	~TArrayAsVector ()

int	Add (const T &item)

int	AddAt (const T &item, size_type index)

size_type	ArraySize ()

size_type	BoundBase (size_type location) const

void	Detach (size_type index)

void	Detach (const T &item)

void	Destroy (size_type index)

void	Destroy (const T &item)

size_type	Find (const T &item) const

size_type	GetItemsInContainer ()

void	Grow (size_type index)

int	HasMember (const T &item)

int	IsEmpty ()

int	IsFull ()

size_type	LowerBound ()

T &	operator[] (size_type index)

const T &	operator[] (size_type index) const

void	Flush ()

void	Reallocate (size_type sz, size_type offset=0)

void	RemoveEntry (size_type index)

void	SetData (size_type index, const T &item)

size_type	UpperBound ()

size_type	ZeroBase (size_type index) const

TArrayAsVector &	operator= (const TArrayAsVector &v)

Private Types
typedef size_t	size_type

typedef vector< T >::const_iterator	const_iterator

Private Attributes
const unsigned int	growable

const size_type	lowerbound

Detailed Description

template<class T>
class TArrayAsVector< T >

Definition at line 18 of file stl_bids.h.

Member Typedef Documentation

◆ const_iterator

template<class T >

typedef vector<T>::const_iterator TArrayAsVector< T >::const_iterator

private

Definition at line 22 of file stl_bids.h.

◆ size_type

template<class T >

typedef size_t TArrayAsVector< T >::size_type

private

Definition at line 21 of file stl_bids.h.

Constructor & Destructor Documentation

◆ TArrayAsVector()

template<class T >

TArrayAsVector< T >::TArrayAsVector	(	size_type	upper,
		size_type	lower = `0`,
		int	delta = `0`
	)

inline

Definition at line 25 of file stl_bids.h.

                       :
    vector<T>( ),
        growable(delta),
        lowerbound(lower)
    { vector<T>::reserve(upper-lower + 1);}

◆ ~TArrayAsVector()

template<class T >

TArrayAsVector< T >::~TArrayAsVector ( )

inline

Definition at line 33 of file stl_bids.h.

    { // This call is unnecessary?  (Paul Brannan 5/7/98)
        // vector<T>::~vector( );
    }

Member Function Documentation

◆ Add()

template<class T >

int TArrayAsVector< T >::Add ( const T & item )

inline

Definition at line 38 of file stl_bids.h.

    { if(!growable && vector<T>::size( ) == vector<T>::capacity( ))
    return 0;
    else
        vector<T>::insert(vector<T>::end( ), item);
    return 1; }

Referenced by KeyTranslator::AddGlobalDef(), KeyTranslator::AddKeyDef(), and TMapLoader::Load().

◆ AddAt()

template<class T >

int TArrayAsVector< T >::AddAt	(	const T &	item,
		size_type	index
	)

inline

Definition at line 45 of file stl_bids.h.

    { if(!growable &&
    ((vector<T>::size( ) == vector<T>::capacity( )) ||
    (ZeroBase(index > vector<T>::capacity( )) )))
    return 0;
    if(ZeroBase(index) > vector<T>::capacity( )) // out of bounds
    { vector<T>::insert(vector<T>::end( ),
    ZeroBase(index) - vector<T>::size( ), T( ));
    vector<T>::insert(vector<T>::end( ), item); }
    else
    { vector<T>::insert(vector<T>::begin( ) + ZeroBase(index), item); }
    return 1;
    }

◆ ArraySize()

template<class T >

size_type TArrayAsVector< T >::ArraySize ( )

inline

Definition at line 59 of file stl_bids.h.

60 { return vector<T>::capacity( ); }

vector::capacity

size_type capacity() const

Definition: _vector.h:199

Referenced by TArrayAsVector< T >::Grow().

◆ BoundBase()

template<class T >

size_type TArrayAsVector< T >::BoundBase ( size_type location ) const

inline

Definition at line 62 of file stl_bids.h.

    { if(location == UINT_MAX)
    return INT_MAX;
    else
        return location + lowerbound; }

Referenced by TArrayAsVector< T >::Find(), TArrayAsVector< T >::Grow(), and TArrayAsVector< T >::UpperBound().

◆ Destroy() [1/2]

template<class T >

void TArrayAsVector< T >::Destroy ( const T & item )

inline

Definition at line 76 of file stl_bids.h.

77 { Destroy(Find(item)); }

TArrayAsVector::Destroy

void Destroy(size_type index)

Definition: stl_bids.h:73

TArrayAsVector::Find

size_type Find(const T &item) const

Definition: stl_bids.h:79

◆ Destroy() [2/2]

template<class T >

void TArrayAsVector< T >::Destroy ( size_type index )

inline

Definition at line 73 of file stl_bids.h.

74 { vector<T>::erase(vector<T>::begin( ) + ZeroBase(index)); }

vector::erase

iterator erase(iterator __pos)

Definition: _vector.h:623

Referenced by KeyTranslator::DeleteKeyDef(), TArrayAsVector< T >::Destroy(), and TArrayAsVector< T >::Detach().

◆ Detach() [1/2]

template<class T >

void TArrayAsVector< T >::Detach ( const T & item )

inline

Definition at line 70 of file stl_bids.h.

71 { Destroy(Find(item)); }

◆ Detach() [2/2]

template<class T >

void TArrayAsVector< T >::Detach ( size_type index )

inline

Definition at line 67 of file stl_bids.h.

68 { vector<T>::erase(vector<T>::begin( ) + ZeroBase(index)); }

Referenced by TArrayAsVector< T >::RemoveEntry().

◆ Find()

template<class T >

size_type TArrayAsVector< T >::Find ( const T & item ) const

inline

Definition at line 79 of file stl_bids.h.

    { const_iterator location = find(vector<T>::begin( ),
    vector<T>::end( ), item);
    if(location != vector<T>::end( ))
        return BoundBase(size_type(location -
        vector<T>::begin( )));
    else
        return INT_MAX; }

Referenced by KeyTranslator::AddKeyDef(), KeyTranslator::DeleteKeyDef(), TArrayAsVector< T >::Destroy(), TArrayAsVector< T >::Detach(), TArrayAsVector< T >::HasMember(), KeyTranslator::switchMap(), and KeyTranslator::TranslateKey().

◆ Flush()

template<class T >

void TArrayAsVector< T >::Flush ( )

inline

Definition at line 126 of file stl_bids.h.

    {
        vector<T>::clear();
    }

Referenced by KeyTranslator::DeleteAllDefs().

◆ GetItemsInContainer()

template<class T >

size_type TArrayAsVector< T >::GetItemsInContainer ( )

inline

Definition at line 88 of file stl_bids.h.

89 { return vector<T>::size( ); }

vector::size

size_type size() const

Definition: _vector.h:192

Referenced by KeyTranslator::AddGlobalDef(), KeyTranslator::DeleteAllDefs(), TMapLoader::Display(), TMapLoader::Load(), KeyTranslator::LookOnGlobal(), and KeyTranslator::SwitchTo().

◆ Grow()

template<class T >

void TArrayAsVector< T >::Grow ( size_type index )

inline

Definition at line 91 of file stl_bids.h.

    { if( index < lowerbound )
    Reallocate(ArraySize( ) + (index -
    lowerbound));
    else if( index >= BoundBase(vector<T>::size( )))
        Reallocate(ZeroBase(index) ); }

◆ HasMember()

template<class T >

int TArrayAsVector< T >::HasMember ( const T & item )

inline

Definition at line 98 of file stl_bids.h.

    { if(Find(item) != INT_MAX)
    return 1;
    else
        return 0; }

◆ IsEmpty()

template<class T >

int TArrayAsVector< T >::IsEmpty ( )

inline

Definition at line 104 of file stl_bids.h.

105 { return vector<T>::empty( ); }

vector::empty

bool empty() const

Definition: _vector.h:200

Referenced by KeyTranslator::AddGlobalDef(), KeyTranslator::DeleteAllDefs(), KeyTranslator::DeleteKeyDef(), TMapLoader::Load(), KeyTranslator::LookOnGlobal(), KeyTranslator::switchMap(), and KeyTranslator::TranslateKey().

◆ IsFull()

template<class T >

int TArrayAsVector< T >::IsFull ( )

inline

Definition at line 107 of file stl_bids.h.

    { if(growable)
    return 0;
    if(vector<T>::size( ) == vector<T>::capacity( ))
        return 1;
    else
        return 0; }

◆ LowerBound()

template<class T >

size_type TArrayAsVector< T >::LowerBound ( )

inline

Definition at line 115 of file stl_bids.h.

116 { return lowerbound; }

◆ operator=()

template<class T >

TArrayAsVector & TArrayAsVector< T >::operator= ( const TArrayAsVector< T > & v )

inline

Definition at line 151 of file stl_bids.h.

                                                       {
        vector<T>::operator=(v);
        // should growable and lowerbound be copied as well?
        return *this;
    }

◆ operator[]() [1/2]

template<class T >

T & TArrayAsVector< T >::operator[] ( size_type index )

inline

Definition at line 118 of file stl_bids.h.

119 { return vector<T>::

120 operator[](ZeroBase(index)); }

vector::operator[]

reference operator[](size_type __n)

Definition: _vector.h:202

◆ operator[]() [2/2]

template<class T >

const T & TArrayAsVector< T >::operator[] ( size_type index ) const

inline

Definition at line 122 of file stl_bids.h.

123 { return vector<T>::

124 operator[](ZeroBase(index)); }

◆ Reallocate()

template<class T >

void TArrayAsVector< T >::Reallocate	(	size_type	sz,
		size_type	offset = `0`
	)

inline

Definition at line 131 of file stl_bids.h.

    { if(offset)
    vector<T>::insert(vector<T>::begin( ), offset, T( ));
    vector<T>::reserve(sz);
    vector<T>::erase(vector<T>::end( ) - offset, vector<T>::end( )); }

Referenced by TArrayAsVector< T >::Grow().

◆ RemoveEntry()

template<class T >

void TArrayAsVector< T >::RemoveEntry ( size_type index )

inline

Definition at line 138 of file stl_bids.h.

139 { Detach(index); }

TArrayAsVector::Detach

void Detach(size_type index)

Definition: stl_bids.h:67

◆ SetData()

template<class T >

void TArrayAsVector< T >::SetData	(	size_type	index,
		const T &	item
	)

inline

Definition at line 141 of file stl_bids.h.

142 { (*this)[index] = item; }

index

#define index(s, c)

Definition: various.h:29

◆ UpperBound()

template<class T >

size_type TArrayAsVector< T >::UpperBound ( )

inline

Definition at line 144 of file stl_bids.h.

145 { return BoundBase(vector<T>::capacity( )) - 1; }

◆ ZeroBase()

template<class T >

size_type TArrayAsVector< T >::ZeroBase ( size_type index ) const

inline

Definition at line 147 of file stl_bids.h.

148 { return index - lowerbound; }

Referenced by TArrayAsVector< T >::AddAt(), TArrayAsVector< T >::Destroy(), TArrayAsVector< T >::Detach(), TArrayAsVector< T >::Grow(), and TArrayAsVector< T >::operator[]().

Member Data Documentation

◆ growable

template<class T >

const unsigned int TArrayAsVector< T >::growable

private

Definition at line 20 of file stl_bids.h.

Referenced by TArrayAsVector< T >::Add(), TArrayAsVector< T >::AddAt(), and TArrayAsVector< T >::IsFull().

◆ lowerbound

template<class T >

const size_type TArrayAsVector< T >::lowerbound

private

Definition at line 23 of file stl_bids.h.

Referenced by TArrayAsVector< T >::BoundBase(), TArrayAsVector< T >::Grow(), TArrayAsVector< T >::LowerBound(), and TArrayAsVector< T >::ZeroBase().

The documentation for this class was generated from the following file:

base/applications/network/telnet/src/stl_bids.h

Public Member Functions

Private Types

Private Attributes

Detailed Description

Member Typedef Documentation

◆ const_iterator

◆ size_type

Constructor & Destructor Documentation

◆ TArrayAsVector()

◆ ~TArrayAsVector()

Member Function Documentation

◆ Add()

◆ AddAt()

◆ ArraySize()

◆ BoundBase()

◆ Destroy() [1/2]

◆ Destroy() [2/2]

◆ Detach() [1/2]

◆ Detach() [2/2]

◆ Find()

◆ Flush()

◆ GetItemsInContainer()

◆ Grow()

◆ HasMember()

◆ IsEmpty()

◆ IsFull()

◆ LowerBound()

◆ operator=()

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ Reallocate()

◆ RemoveEntry()

◆ SetData()

◆ UpperBound()

◆ ZeroBase()

Member Data Documentation

◆ growable

◆ lowerbound