LinkedListIterator/test-main.cpp at main · dwmckee/LinkedListIterator · 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
148
149
#include "linkedlistiterator.h"
#include <stdlib.h>

extern "C" {
#include "c_deque.h"
#include "c_stack.h"
}

#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <vector>

using namespace lli;

// Can you traverse the container using the iterators
template <typename ITER>
bool manual_iteration(ITER first, ITER last, const std::vector<int>& comp_data) {
  size_t i = comp_data.size();
  while (first != last)
    {
      --i;
      if (first->payload != comp_data[i])
        return false;

      ++first;
  }
  return (i == 0);
}

// Can you use the container with (at elast some of) the algorithms header
template <typename ITER, typename VALUE_T>
ITER find_in_list(ITER begin, ITER end, VALUE_T val)
{
  auto it = std::find_if(begin, end, [val](typename ITER::value_type &n) {
    return n.payload == val;
  });

  return it;
}

///////////////////////////////////////////////////////////////////////////////
// Try some iterator operation on the naive stack
bool test_stack()
{
  const auto test_data = std::vector<int>{2, 3, 5, 7, 11, 13};

  std::cout << "Testing against the naive stack..." << std::endl;
  stack_node *stack = nullptr;
  assert(begin<stack_node>(stack) == end<stack_node>(stack));
  for (size_t i = 0; i < test_data.size(); ++i) {
    stack_push(test_data[i], &stack);
  }
  assert(begin<stack_node>(stack) != end<stack_node>(stack));

  assert(manual_iteration(begin<stack_node>(stack), end<stack_node>(stack),
                          test_data));

  const auto it_13 =
      find_in_list(begin<stack_node>(stack), end<stack_node>(stack), 13);
  assert(it_13 == stack);

  const auto it_9 = find_in_list(begin<stack_node>(stack), end<stack_node>(stack), 9);
  assert(it_9 == end<stack_node>(stack));

  auto it_2 =
          find_in_list(begin<stack_node>(stack), end<stack_node>(stack), 2);
  assert(it_2 != stack);
  assert(it_2 != end<stack_node>(stack));
  assert(++it_2 == end<stack_node>(stack));

  return true;
}

///////////////////////////////////////////////////////////////////////////////
// The various default operations on won't work for the deque because it have a
// more complex structure (exception the default next and previous functors
// _will_ work). To that end, we write specialized templates here before
// defining the deque tests
template <>
LinkedListIterator<deque_node> lli::begin(dl_deque &list) {
  default_next<deque_node> next;
  return LinkedListIterator<deque_node>(next(list.sentinal));
}

template <>
LinkedListIterator<deque_node, default_prev<deque_node>>
lli::rbegin(dl_deque &list)
{
  default_prev<deque_node> next;
  return LinkedListIterator<deque_node, default_prev<deque_node>>(
      next(list.sentinal));
}

template <>
LinkedListIterator<deque_node> lli::end(dl_deque &list) {
  return LinkedListIterator<deque_node>(list.sentinal);
}

template <>
LinkedListIterator<deque_node, default_prev<deque_node>>
lli::rend(dl_deque &list)
{
  return LinkedListIterator<deque_node, default_prev<deque_node>>(
      list.sentinal);
}

///////////////////////////////////////////////////////////////////////////////
// Try operations against the deque
bool test_deque()
{
  const auto test_data = std::vector<int>{2, 3, 5, 7, 11, 13};

  std::cout << "Testing against the more structured deque..." << std::endl;
  dl_deque deque;
  init_deque_in_place(&deque);
  assert(begin<deque_node>(deque) == end<deque_node>(deque));
  for (size_t i = 0; i < test_data.size(); ++i) {
    deque_push_front(test_data[i], &deque);
  }
  assert(begin<deque_node>(deque) != end<deque_node>(deque));

  assert(manual_iteration(begin<deque_node>(deque), end<deque_node>(deque),
                          test_data));

  const std::vector<int> reversed_data(test_data.rbegin(), test_data.rend());
  assert(manual_iteration(rbegin<deque_node>(deque), rend<deque_node>(deque),
                          reversed_data));

  const auto it_13 =
    find_in_list(begin<deque_node>(deque), end<deque_node>(deque), 13);
  assert(it_13 == begin<deque_node>(deque));

  const auto it_9 = find_in_list(begin<deque_node>(deque), end<deque_node>(deque), 9);
  assert(it_9 == end<deque_node>(deque));

  auto it_2 =
          find_in_list(begin<deque_node>(deque), end<deque_node>(deque), 2);
  assert(it_2 != begin<deque_node>(deque));
  assert(it_2 != end<deque_node>(deque));
  assert(++it_2 == end<deque_node>(deque));

  return true;
}

int main()
{
  return ( test_stack() && test_deque() ) ? EXIT_SUCCESS : EXIT_FAILURE;
}