7#ifndef DUNE_FUNCTIONS_COMMON_RESERVEDDEQUE_HH
8#define DUNE_FUNCTIONS_COMMON_RESERVEDDEQUE_HH
17#include <initializer_list>
19#include <dune/common/genericiterator.hh>
21#ifdef CHECK_RESERVEDDEQUE
22#define CHECKSIZE(X) assert(X)
24#define CHECKSIZE(X) {}
47 template<
class T,
int n>
67 typedef Dune::GenericIterator<ReservedDeque, value_type>
iterator;
69 typedef Dune::GenericIterator<const ReservedDeque, const value_type>
const_iterator;
83 assert(l.size() <= n);
85 std::copy_n(l.begin(), size_, data_);
110 data_[size_++ % n] = t;
118 first_ = (first_+(n-1)) % n;
135 first_ = (++first_) % n;
163 return data_[(first_ + i) % n];
170 return data_[(first_ + i) % n];
177 return data_[first_];
184 return data_[first_];
191 return data_[(first_ + size_-1) % n];
198 return data_[(first_ + size_-1) % n];
234 for (
size_t i=0; i<v.
size(); i++)
#define CHECKSIZE(X)
Definition reserveddeque.hh:24
Definition polynomial.hh:17
A double-ended queue (deque) class with statically reserved memory.
Definition reserveddeque.hh:49
void pop_front()
Erases the first element of the vector, O(1) time.
Definition reserveddeque.hh:130
static constexpr size_type capacity()
Returns current capacity (allocated memory) of the vector.
Definition reserveddeque.hh:218
void clear()
Erases all elements.
Definition reserveddeque.hh:93
Dune::GenericIterator< ReservedDeque, value_type > iterator
Iterator used to iterate through a vector.
Definition reserveddeque.hh:67
T value_type
The type of object, T, stored in the vector.
Definition reserveddeque.hh:55
ReservedDeque()
Constructor.
Definition reserveddeque.hh:76
bool empty() const
Returns true if vector has no elements.
Definition reserveddeque.hh:212
const_reference back() const
Returns const reference to last element of vector.
Definition reserveddeque.hh:195
friend std::ostream & operator<<(std::ostream &s, const ReservedDeque &v)
Send ReservedDeque to an output stream.
Definition reserveddeque.hh:232
void push_front(const T &t)
Prepends an element to the begin of a deque if size<capacity, O(1) time.
Definition reserveddeque.hh:114
reference operator[](size_type i)
Returns reference to the i'th element.
Definition reserveddeque.hh:160
reference front()
Returns reference to first element of vector.
Definition reserveddeque.hh:174
T * pointer
Pointer to T.
Definition reserveddeque.hh:57
const_reference front() const
Returns const reference to first element of vector.
Definition reserveddeque.hh:181
iterator end()
Returns an iterator pointing to the end of the vector.
Definition reserveddeque.hh:150
reference back()
Returns reference to last element of vector.
Definition reserveddeque.hh:188
void pop_back()
Erases the last element of the vector, O(1) time.
Definition reserveddeque.hh:123
const T & const_reference
Const reference to T.
Definition reserveddeque.hh:61
static constexpr size_type max_size()
Returns the maximum length of the vector.
Definition reserveddeque.hh:224
std::ptrdiff_t difference_type
A signed integral type.
Definition reserveddeque.hh:65
T & reference
Reference to T.
Definition reserveddeque.hh:59
Dune::GenericIterator< const ReservedDeque, const value_type > const_iterator
Const iterator used to iterate through a vector.
Definition reserveddeque.hh:69
size_type size() const
Returns number of elements in the vector.
Definition reserveddeque.hh:206
const_iterator end() const
Returns a const_iterator pointing to the end of the vector.
Definition reserveddeque.hh:155
void resize(size_t s)
Specifies a new size for the vector.
Definition reserveddeque.hh:100
iterator begin()
Returns a iterator pointing to the beginning of the vector.
Definition reserveddeque.hh:140
const_iterator begin() const
Returns a const_iterator pointing to the beginning of the vector.
Definition reserveddeque.hh:145
ReservedDeque(std::initializer_list< T > const &l)
Definition reserveddeque.hh:81
size_t size_type
An unsigned integral type.
Definition reserveddeque.hh:63
void push_back(const T &t)
Appends an element to the end of a vector, up to the maximum size n, O(1) time.
Definition reserveddeque.hh:107