---

CTBmap.hxx

Go to the documentation of this file.

#ifndef _CTBmap_HXX
#define _CTBmap_HXX 1

/*----------------------------------------------------------------------------*/
/* C Tool Box: Designed and implemented by:                                   */
/*    Walter F.J. Mueller   Gesellschaft fuer Schwerionenforschung (GSI)      */
/*                          Planckstrasse 1, D-64291 Darmstadt, Germany       */
/*                  Email:  W.F.J.Mueller@gsi.de                              */
/*                  WWW:    http://www-kp3.gsi.de/www/kp3/people/mueller.html */
/*------------------------------------------+---------------------------------*/

#include "CTBpair.hxx"
#include "CTBbtree.hxx"

template <class K, class V, class C>
class CTBmapNode;                           // forward declaration
template <class K, class V, class C>
class CTBmapIterator;                       // forward declaration
template <class K, class V, class C>
class CTBmapBrowser;                        // forward declaration

template <class K, class V, class C>
class CTBmap : private CTBbtree {
  public:

    typedef CTBmap<K,V,C>          Map;
    typedef CTBmapNode<K,V,C>      Node;
    typedef CTBmapIterator<K,V,C>  Iterator;
    typedef CTBmapBrowser<K,V,C>   Browser;

                    CTBmap();
                    CTBmap(const CTBmap<K,V,C>& rhs);

                    ~CTBmap();

    bool            Insert(const CTBpair<const K,V>& pair);
    bool            Insert(const K& key, const V& value);
    bool            Insert(const K& key);

    CTBmapIterator<K,V,C> Find(const K& key);
    CTBmapBrowser<K,V,C>  Find(const K& key) const;

    CTBmapIterator<K,V,C> FindLessEqual(const K& key, bool& b_found);
    CTBmapBrowser<K,V,C>  FindLessEqual(const K& key, bool& b_found) const;

    CTBmapIterator<K,V,C> FindGreaterEqual(const K& key, bool& b_found);
    CTBmapBrowser<K,V,C>  FindGreaterEqual(const K& key, bool& b_found) const;

    CTBmapIterator<K,V,C> FindOrCreate(const K& key, bool& b_found);

    bool            Rename(const K& keyold, const K& keynew);
    bool            Rename(const CTBmapIterator<K,V,C>& p, const K& keynew);

    bool            Delete(const K& key);
    bool            Delete(const CTBmapIterator<K,V,C>& p);
    void            Clear();

    CTBmapIterator<K,V,C> First();
    CTBmapBrowser<K,V,C>  First() const;

    CTBmapIterator<K,V,C> Last();
    CTBmapBrowser<K,V,C>  Last() const;

    CTBint          Size() const;

    void            Dump(int i_indent=0, ostream& os=cout,
                         const char* p_text=0) const;

    V&              operator[](const K& key);

    CTBmap<K,V,C>&  operator=(const CTBmap<K,V,C>& rhs);
   
                    operator bool() const;

  private:

    CTBmapNode<K,V,C>* LocateMatchOrBound(const K& key, int& i_mtype) const;

    CTBmapNode<K,V,C>* LocateMatchOrPrev(const K& key, bool& b_found) const;
    CTBmapNode<K,V,C>* LocateMatchOrNext(const K& key, bool& b_found) const;

    void            InsertNode(CTBmapNode<K,V,C>* p_node,
                               CTBmapNode<K,V,C>* p_parent, int i_ctype);

    void            RemoveNode(CTBmapNode<K,V,C>* p_node);
};

#include "CTBmapNode.hxx"
#include "CTBmapIterator.hxx"

#include "CTBmap.icc"

#endif

---