Debian Codegraph @

yo/classtemplates/examples/cirquepartial.h

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