TreeIn.h

Go to the documentation of this file.

#ifndef TreeIn_H
#define TreeIn_H

template <class R, class N, class K, int n = 0> class TreeInNode;
template <class R, class N, class K, int n = 0> class TreeInRoot;

template <class R, class N, class K, int n> class TreeInRoot {
    friend  class TreeInNode<R, N, K, n>;
    typedef class TreeInRoot<R, N, K, n> Root;   
    typedef class TreeInNode<R, N, K, n> Node;   
protected:
    TreeInRoot();
    ~TreeInRoot();

    // These two member functions to be provided by the user.
    int compare(N const& node1, N const& node2) const;
    int compareKey(N const& node, K key) const;

    virtual void add(N& node);
    void add(N* node);
    void remove(N& node);
    void remove(N* node);
    N* find(K key) const;

    N* base() const { return base_; }
    N* first() const;
    N* last() const;

    void check() const;
private:
#if __cplusplus < 201101L
    TreeInRoot(TreeInRoot const&);      
    void operator =(TreeInRoot const&);  
#else
    TreeInRoot(TreeInRoot const&) = delete;      
    void operator =(TreeInRoot const&) = delete;  
#endif
    N* base_;                            
};

template <class R, class N, class K, int n> class TreeInNode {
    friend  class TreeInRoot<R, N, K, n>;
    typedef class TreeInRoot<R, N, K, n> Root;   
    typedef class TreeInNode<R, N, K, n> Node;   
protected:
    TreeInNode(); // No default add as that needs our Parent already constructed
    ~TreeInNode();

    void addTo(R& root);
    void addTo(R* root);
    virtual void remove();           // Virtual so "fancier" trees can rebalence

    R* root() const { return root_; }    
    N* parent() const { return parent_; }
    N* left() const { return left_; }
    N* right() const { return right_; }
    N* next() const;
    N* prev() const;

    void check() const;

private:
#if __cplusplus < 201101L
    TreeInNode(TreeInNode const&);      
    void operator =(TreeInNode const&);  
#else
    TreeInNode(TreeInNode const&) = delete;      
    void operator =(TreeInNode const&) = delete;  
#endif
    R*    root_;                          
    N*    parent_;                        
    N*    left_;                          
    N*    right_;                          
};

#endif