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
|
//
// zug: transducers for C++
// Copyright (C) 2019 Juan Pedro Bolivar Puente
//
// This software is distributed under the Boost Software License, Version 1.0.
// See accompanying file LICENSE or copy at http://boost.org/LICENSE_1_0.txt
//
#include <catch2/catch.hpp>
#include <zug/reducing/first.hpp>
#include <zug/reducing/last.hpp>
#include <zug/reductor.hpp>
#include <zug/transducer/enumerate.hpp>
#include <zug/transducer/take.hpp>
#include "spies.hpp"
using namespace zug;
TEST_CASE("reductor, reductor")
{
auto r = make_reductor(std::plus<>{}, 0, 1);
r(2);
r(3);
r(4);
CHECK(r.complete() == 10);
}
TEST_CASE("reductor, empty reductor")
{
auto r = make_empty_reductor<int>(std::plus<>{}, 0);
r(2);
r(3);
r(4);
CHECK(r.complete() == 9);
}
TEST_CASE("reductor, reductor no move")
{
auto r = make_reductor(std::plus<>{}, std::string{}, "");
r("hello");
r(" ");
r("world");
CHECK(r.complete() == "hello world");
CHECK(r.complete() == "hello world");
}
TEST_CASE("reductor, reductor chaining")
{
auto result = make_reductor(std::plus<>{}, std::string{}, "")("hello")(" ")(
"my")(" ")("friend")("!")
.complete();
CHECK(result == "hello my friend!");
}
TEST_CASE("reductor, reductor move")
{
auto s = testing::copy_spy<>{};
auto r = make_reductor(first, std::move(s), 0);
r(1);
r(2);
r(3);
auto c = std::move(r).complete();
CHECK(c.copied.count() == 0);
}
TEST_CASE("reductor, generator")
{
auto r = make_reductor(enumerate(last), -1);
CHECK(r.complete() == 0);
r();
CHECK(r.complete() == 1);
r();
CHECK(r.complete() == 2);
}
TEST_CASE("reductor, generator empty")
{
auto r = make_empty_reductor(enumerate(last), std::size_t{42});
CHECK(r.complete() == 42u);
r();
CHECK(r.complete() == 0u);
r();
CHECK(r.complete() == 1u);
}
TEST_CASE("reductor, termination")
{
auto r = make_reductor(take(4)(enumerate(last)), 0);
CHECK(r());
CHECK(r());
CHECK(!r());
CHECK(!r);
}
TEST_CASE("reductor, termination empty")
{
auto r = make_empty_reductor(take(4)(enumerate(last)), 0);
CHECK(r());
CHECK(r());
CHECK(r());
CHECK(!r());
CHECK(!r);
}
TEST_CASE("reductor, current")
{
auto r = make_empty_reductor(take(4)(enumerate(last)), std::size_t{0});
CHECK(r());
CHECK(r.current() == 0);
r.current(std::size_t{10});
CHECK(r.current() == 10);
CHECK(r());
CHECK(r.current() == 1);
CHECK(r());
CHECK(r.current() == 2);
CHECK(!r());
CHECK(!r);
}
TEST_CASE("reductor, constant")
{
const auto r1 = make_reductor(enumerate(last), 0);
const auto r2 = r1();
const auto r2_ = r1();
const auto r3 = r2();
CHECK(r2.complete() == 1);
CHECK(r2_.complete() == 1);
CHECK(r3.complete() == 2);
}
|
