chunkedseq
container library for large in-memory data sets
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
chunkedseq_2.cpp
Go to the documentation of this file.
1 
16 #include <iostream>
18 #include <string>
19 #include <assert.h>
20 
21 #include "chunkedseq.hpp"
22 
23 int main(int argc, const char * argv[]) {
24 
26 
27  const int nb = 5;
28 
29  mydeque_type mydeque;
30 
31  for (int i = 0; i < nb; i++)
32  mydeque.push_back(i);
33  for (int i = 0; i < nb; i++)
34  mydeque.push_front(nb+i);
35 
36  assert(mydeque.size() == 2*nb);
37 
38  std::cout << "mydeque contains:";
39  for (int i = 0; i < 2*nb; i++) {
40  int v = (i % 2) ? mydeque.pop_front() : mydeque.pop_back();
41  std::cout << " " << v;
42  }
43  std::cout << std::endl;
44 
45  assert(mydeque.empty());
46 
47  return 0;
48 
49 }
void push_front(const value_type &x)
Adds item at the beginning.
void push_back(const value_type &x)
Adds item at the end.
size_type size() const
Returns size.
value_type pop_front()
Deletes first item.
value_type pop_back()
Deletes last item.
int main(int argc, const char *argv[])
[deque_example]
bool empty() const
Test whether the container is empty.
Chunked-sequence functor.