ListIn.h

Go to the documentation of this file.

#ifndef LISTIN_H
#define LISTIN_H

// L a class derived from ListInRoot<L,N,n>
// N a class derived from ListInNode<L,N,n>

template<class R, class N, int n = 0> class ListInRoot;
template<class R, class N, int n = 0> class ListInNode;

template<class R, class N, int n> class ListInRoot {
    friend ListInNode<R, N, n>;
    friend N;
    typedef ListInRoot<R, N, n> Root;    
    typedef ListInNode<R, N, n> Node;    
protected:
    ListInRoot();
    ~ListInRoot();
    void add(N& node);
    void add(N* node);
    void addFirst(N& node);
    void addFirst(N* node);
    void addLast(N& node);
    void addLast(N* node);
    void remove(N& node);
    void remove(N* node);
    N* first() const { return first_; }   
private:
#if __cplusplus < 201101L
    ListInRoot(ListInRoot const&);      
    void operator =(ListInRoot const&); 
#else
    ListInRoot(ListInRoot const&) = delete;      
    void operator =(ListInRoot const&) = delete; 
#endif
    N* first_;                          
};

template<class R, class N, int n> class ListInNode {
    friend ListInRoot<R, N, n>;
    friend R;
    typedef ListInNode<R, N, n> Node;    
    typedef ListInRoot<R, N, n> Root;    
protected:
    ListInNode(R& root);
    ListInNode(R* root = 0);
    ~ListInNode();

    void addTo(R& root);
    void addTo(R* root);
    void addToFront(R& root);
    void addToFront(R* root);
    void addToEnd(R& root);
    void addToEnd(R* root);
    void addAfter(N& node);
    void addAfter(N* node);
    void remove();

    R* root() const { return root_; }   
    N* next() const { return next_; }   
private:
#if __cplusplus < 201101L
    ListInNode(ListInNode const& );      
    void operator =(ListInNode const& ); 
#else
    ListInNode(ListInNode const& ) = delete;      
    void operator =(ListInNode const& ) = delete; 
#endif
    R* root_;                           
    N* next_;                           
};

#endif