-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolving.cpp
More file actions
59 lines (46 loc) · 1.52 KB
/
solving.cpp
File metadata and controls
59 lines (46 loc) · 1.52 KB
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
#include "lambda_lib/lambda_lib.hpp"
using namespace lambda;
int main(void) {
std::unique_ptr<LambdaBase> node = //
APPLICATION( //
FIRST(), //
APPLICATION( //
SECOND(), //
LIST( //
NATURAL_NUMBER(0), //
NATURAL_NUMBER(1), //
NATURAL_NUMBER(2) //
) //
) //
); //
std::cout << "original (" << getSize(node) << " bytes): ";
print(node);
std::cout << "\n";
rename(node);
std::cout << "renamed: ";
print(node);
std::cout << "\n";
std::size_t maxSize = getSize(node);
std::size_t minSize = getSize(node);
std::size_t totalSize = getSize(node);
std::size_t step = 0;
bool isReduced = !reduceOnce(node);
while (!isReduced) {
std::size_t size = getSize(node);
maxSize = std::max(maxSize, size);
minSize = std::min(minSize, size);
totalSize += size;
std::cout << "step " << ++step << " (" << getSize(node) << " bytes): ";
print(node);
std::cout << "\n";
isReduced = !reduceOnce(node);
}
std::cout << "result (" << getSize(node) << " bytes): ";
print(node);
std::cout << "\n";
if (step)
std::cout << "info: steps(" << step << ") minSize(" << minSize
<< ") maxSize(" << maxSize << ") avrgSize("
<< (double)totalSize / step << ")\n";
return 0;
}