deque-implementation-cpp/main.cpp at master · Smoren/deque-implementation-cpp · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
#include <iostream>
#include "printer.h"
#include "profiler.h"
#include "deque.h"


using namespace std;
using namespace Smoren::Containers;
using namespace Smoren::Tools;

void printDequeVerbose(const Deque<int>& d);
void testMyDeque();
void testMyDequeBench();

int main() {
    testMyDeque();
    testMyDequeBench();

    return 0;
}

void printDequeVerbose(const Deque<int>& d) {
    cout << d << endl;
    cout << "SIZE: " << d.size() << endl;
    d.printData();
    cout << "==========" << endl << endl;
}


void testMyDeque() {
    {
        Deque<int> d(3);
        printDequeVerbose(d);

        d.push_front(-1);
        printDequeVerbose(d);

        d.push_front(-2);
        printDequeVerbose(d);

        d.push_back(1);
        printDequeVerbose(d);

        d.push_back(2);
        printDequeVerbose(d);

        d.push_front(-3);
        printDequeVerbose(d);

        d.push_front(-4);
        printDequeVerbose(d);

        d.push_back(3);
        printDequeVerbose(d);

        d.push_back(4);
        printDequeVerbose(d);

        d.push_back(5);
        printDequeVerbose(d);

        d.push_back(6);
        printDequeVerbose(d);

        for(int i=0; i<5; i++) {
            d.pop_back();
            printDequeVerbose(d);
        }

        for(int i=0; i<2; i++) {
            d.pop_front();
            printDequeVerbose(d);
        }

        for(size_t i=0; i<d.size(); i++) {
            cout << d[i] << ", ";
        }
        cout << endl;

        for(auto it = d.begin(); it != d.end(); it++) {
            cout << *it << ", ";
        }
        cout << endl;

        for(auto it = d.rbegin(); it != d.rend(); it--) {
            cout << *it << ", ";
        }
        cout << endl;

        for(int& x : d) {
            cout << x << ", ";
        }
        cout << endl;
    }
}

void testMyDequeBench() {
    size_t SIZE = 1000000;
    {
        LOG_DURATION("Deque");
        Deque<int> d(100);
        for(size_t i=0; i<SIZE; i++) {
            d.push_back(1);
        }
        for(size_t i=0; i<SIZE; i++) {
            d.push_front(-1);
        }
        for(size_t i=0; i<SIZE*2; i++) {
            int& a = d[i];
        }
        for(auto& x : d) {

        }
        cout << "Deque size: " << d.size() << endl;
        cout << "Deque chunks: " << d.chunksCount() << endl;
        for(size_t i=0; i<SIZE; i++) {
            d.pop_back();
            d.pop_front();
        }
        cout << "Deque size after pop: " << d.size() << endl;
        cout << "Deque chunks after pop: " << d.chunksCount() << endl;
    }
    cout << endl;
    {
        LOG_DURATION("Deque");
        deque<int> d;
        for(size_t i=0; i<SIZE; i++) {
            d.push_back(1);
        }
        for(size_t i=0; i<SIZE; i++) {
            d.push_front(-1);
        }
        for(size_t i=0; i<SIZE*2; i++) {
            int& a = d[i];
        }
        for(auto& x : d) {

        }
        cout << "Deque size: " << d.size() << endl;
        for(size_t i=0; i<SIZE; i++) {
            d.pop_back();
            d.pop_front();
        }
        cout << "Deque size after pop: " << d.size() << endl;
    }
    cout << endl;
}