Debian Codegraph @

yo/classtemplates/examples/cirquevector.h

raw
1 #ifndef INCLUDED_CIRQUEVECTOR_H_
2 #define INCLUDED_CIRQUEVECTOR_H_
3
4 #include <vector>
5 #include "cirque.h"
6
7 template<>
8 class CirQue<std::vector<int>>
9 {
10 using IntVect = std::vector<int>;
11
12 IntVect d_data;
13 size_t d_size;
14
15 using iterator = IntVect::iterator;
16 iterator d_front;
17 iterator d_back;
18
19 public:
20 using value_type = int;
21 using const_reference = value_type const &;
22
23 enum Exception
24 {
25 EMPTY,
26 FULL
27 };
28
29 CirQue();
30 CirQue(IntVect const &iv);
31 CirQue(CirQue<IntVect> const &other);
32
33 CirQue &operator=(CirQue<IntVect> const &other);
34
35 int &back();
36 int &front();
37 bool empty() const;
38 bool full() const;
39 size_t maxSize() const;
40 size_t size() const;
41 void pop_front();
42 void push_back(int const &object);
43 void swap(CirQue<IntVect> &other);
44
45 private:
46 iterator inc(iterator const &iter);
47 };
48
49 CirQue<std::vector<int>>::CirQue()
50 :
51 d_size(0)
52 {}
53 CirQue<std::vector<int>>::CirQue(IntVect const &iv)
54 :
55 d_data(iv),
56 d_size(iv.size()),
57 d_front(d_data.begin()),
58 d_back(d_data.begin())
59 {}
60 CirQue<std::vector<int>>::CirQue(CirQue<IntVect> const &other)
61 :
62 d_data(other.d_data),
63 d_size(other.d_size),
64 d_front(d_data.begin() + (other.d_front - other.d_data.begin())),
65 d_back(d_data.begin() + (other.d_back - other.d_data.begin()))
66 {}
67 CirQue<std::vector<int>> &CirQue<std::vector<int>>::operator=(
68 CirQue<IntVect> const &rhs)
69 {
70 CirQue<IntVect> tmp(rhs);
71 swap(tmp);
72 }
73 void CirQue<std::vector<int>>::swap(CirQue<IntVect> &other)
74 {
75 char tmp[sizeof(CirQue<IntVect>)];
76 memcpy(tmp, &other, sizeof(CirQue<IntVect>));
77 memcpy(reinterpret_cast<char *>(&other), this, sizeof(CirQue<IntVect>));
78 memcpy(reinterpret_cast<char *>(this), tmp, sizeof(CirQue<IntVect>));
79 }
80 void CirQue<std::vector<int>>::pop_front()
81 {
82 if (d_size == 0)
83 throw EMPTY;
84
85 d_front = inc(d_front);
86 --d_size;
87 }
88 void CirQue<std::vector<int>>::push_back(int const &object)
89 {
90 if (d_size == d_data.size())
91 throw FULL;
92
93 *d_back = object;
94 d_back = inc(d_back);
95 ++d_size;
96 }
97 inline int &CirQue<std::vector<int>>::back()
98 {
99 return d_back == d_data.begin() ? d_data.back() : d_back[-1];
100 }
101 inline int &CirQue<std::vector<int>>::front()
102 {
103 return *d_front;
104 }
105 CirQue<std::vector<int>>::iterator CirQue<std::vector<int>>::inc(
106 CirQue<std::vector<int>>::iterator const &iter)
107 {
108 iterator tmp(iter + 1);
109 tmp = tmp == d_data.end() ? d_data.begin() : tmp;
110 return tmp;
111 }
112
113 #endif