KeyMutableSet< T, _Compare > Class Template Reference

#include <key_mutable_set.h>

Inheritance diagram for KeyMutableSet< T, _Compare >:

Public Member Functions
void	checkSet ()
	This just checks the order of the set for testing purposes.. More...
void	changeKey (typename SUPER::iterator &iter, const T &newKey, typename SUPER::iterator &templess, typename SUPER::iterator &rettempmore)
	Given an iterator you can alter that iterator's key to be the one passed in. More...
SUPER::iterator	insert (const T &newKey, typename SUPER::iterator hint)
SUPER::iterator	insert (const T &newKey)
SUPER::iterator	changeKey (typename SUPER::iterator iter, const T &newKey)

Detailed Description

template<class T, class _Compare = std::less< MutableShell< T > >>
class KeyMutableSet< T, _Compare >

This set inherits from the STL multiset, with a slight variation: The value is nonconst–that means you are allowed to change things but must not alter the key. This set inherits from the STL multiset, with a slight variation: You are allowed to update the key of a particular iterator that you have obtained. Note: T is the type that each element is pointing to.

Definition at line 39 of file key_mutable_set.h.

Member Function Documentation

template<class T , class _Compare = std::less< MutableShell< T > >>

void KeyMutableSet< T, _Compare >::changeKey ( typename SUPER::iterator &  iter, const T &  newKey, typename SUPER::iterator &  templess, typename SUPER::iterator &  rettempmore  )

inline

Given an iterator you can alter that iterator's key to be the one passed in.

The type must have a function called changeKey(const Key &newKey) that changes its key to the specified new key.

Definition at line 56 of file key_mutable_set.h.

References KeyMutableSet< T, _Compare >::insert().

Referenced by KeyMutableSet< T, _Compare >::changeKey().

    {
        MutableShell< T >newKeyShell( newKey );
        templess = rettempmore = iter;
        ++rettempmore;
        typename SUPER::iterator tempmore = rettempmore;
        if ( tempmore == this->end() )
            --tempmore;
        if ( templess != this->begin() )
            --templess;
        _Compare comparator;

        //O(1) amortized time on the insertion - Yippie!
        bool     byebye = false;
        if ( comparator( newKeyShell, *templess ) ) {
            rettempmore = templess = this->insert( newKeyShell, templess );
            byebye = true;
        } else if ( comparator( *tempmore, newKeyShell ) ) {
            rettempmore = templess = this->insert( newKeyShell, tempmore );
            byebye = true;
        } else {(*iter).get() = newKey; } if (byebye) {
            this->erase( iter );
            iter = templess;
            ++rettempmore;
            if ( templess != this->begin() )
                --templess;
        }
    }

template<class T , class _Compare = std::less< MutableShell< T > >>

SUPER::iterator KeyMutableSet< T, _Compare >::changeKey ( typename SUPER::iterator  iter, const T &  newKey  )

inline

Definition at line 95 of file key_mutable_set.h.

References KeyMutableSet< T, _Compare >::changeKey().

    {
        typename SUPER::iterator templess = iter, tempmore = iter;
        changeKey( iter, newKey, templess, tempmore );
        return iter;
    }

template<class T , class _Compare = std::less< MutableShell< T > >>

void KeyMutableSet< T, _Compare >::checkSet ( )

inline

This just checks the order of the set for testing purposes..

Definition at line 44 of file key_mutable_set.h.

    {
        _Compare comparator;
        if ( this->begin() != this->end() )
            for (typename SUPER::iterator newiter = this->begin(), iter = newiter++; newiter != this->end(); iter = newiter++)
                assert( !comparator( *newiter, *iter ) );
    }

template<class T , class _Compare = std::less< MutableShell< T > >>

SUPER::iterator KeyMutableSet< T, _Compare >::insert ( const T &  newKey, typename SUPER::iterator  hint  )

inline

Definition at line 87 of file key_mutable_set.h.

Referenced by KeyMutableSet< T, _Compare >::changeKey().

    {
        return this->SUPER::insert( hint, newKey );
    }

template<class T , class _Compare = std::less< MutableShell< T > >>

SUPER::iterator KeyMutableSet< T, _Compare >::insert ( const T &  newKey)

inline

Definition at line 91 of file key_mutable_set.h.

    {
        return this->SUPER::insert( newKey );
    }

---

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

• src/cmd/key_mutable_set.h