Deque3.hpp

Vá para a documentação deste arquivo.

#ifndef PERSISTENCE_DEQUE3_HPP_
#define PERSISTENCE_DEQUE3_HPP_

#include "Deque2.hpp"

namespace persistence {

namespace deque3 {

template<class T> class SubDeque {
public:
    inline int size() const;
    inline bool empty() const;
    inline void clear();

    void push_back(const T &x);
    void push_front(const T &x);

    void pop_back();
    void pop_front();

    const T& front() const;
    const T& back() const;


    const T& operator [](int i) const;

    SubDeque();

private:
    T v[5];

    int i;

    int size_;
};

using any = deque2::any;

class Node {
public:
    SubDeque<any*> prefix;
    Node *child;
    SubDeque<any*> suffix;

    Node *next;

    int size;

    int level;
    int ref_ct;
    inline void add_ref();
    template<class T> inline void rem_ref();
    inline void safe_rem_ref();

    Node();

    Node(const Node &o);
    ~Node();
};

template<class T> class Deque {
public:
    Node *node;

    Deque();


    const T& Front() const;

    const T& Back() const;

    const T& K_th(int k) const;



    Deque<T> PushFront(const T& x) const;

    Deque<T> PushBack(const T& x) const;

    Deque<T> PopFront() const;

    Deque<T> PopBack() const;


    ~Deque();
    Deque(const Deque &o);
    Deque& operator=(const Deque &o);

private:
    Deque(Node *u);
};


void Check(Node *a);

Node* Copy(const Node *a);

int Digit(const Node *a, bool last);

void Fix(Node *a);

void FixDeques(SubDeque<any*> &l, SubDeque<any*> &r,
               SubDeque<any*> &L, SubDeque<any*> &R);


} // namespace deque3

} // namespace persistence

#include "Deque3.tpp"

#endif // PERSISTENCE_DEQUE3_HPP_