-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSTL_Main.cpp
More file actions
154 lines (121 loc) · 3.12 KB
/
STL_Main.cpp
File metadata and controls
154 lines (121 loc) · 3.12 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
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
150
151
152
153
154
// ===========================================================================
// STL_Main.cpp // Introductionary Examples for STL
// ===========================================================================
#include <algorithm>
#include <iostream>
#include <vector>
// ===========================================================================
// Simple Devils sequence
static void printToConsole(int value) {
std::cout << ">: " << value << std::endl;
}
static void testDevilsSequence()
{
std::vector<int> devilsSequence;
int start = 7;
devilsSequence.push_back(start);
while (start != 1)
{
// compute numbers of sequence
start = (start % 2 == 0) ? (start / 2) : (start * 3 + 1);
devilsSequence.push_back(start);
}
// read-only traversal
std::for_each(
devilsSequence.begin(),
devilsSequence.end(),
printToConsole
);
}
// ===========================================================================
// Devils sequence with callable object
class DevilsSequence
{
private:
int m_start;
public:
DevilsSequence() {
m_start = 7;
}
DevilsSequence(int start) {
m_start = start;
}
int operator() () {
if (m_start != 1) {
m_start = (m_start % 2 == 0) ? (m_start / 2) : (m_start * 3 + 1);
return m_start;
}
else {
return 0;
}
}
};
static void testDevilsSequenceAdvanced()
{
std::vector<int> devilsSequence;
devilsSequence.resize(30);
// set start value
const int Start = 7;
devilsSequence[0] = Start;
DevilsSequence sequenceGenerator(Start);
std::generate(
std::next(devilsSequence.begin()),
devilsSequence.end(),
sequenceGenerator
);
// read-only traversal
std::for_each(
devilsSequence.begin(),
devilsSequence.end(),
printToConsole
);
}
// ===========================================================================
// Fibonacci sequence with callable object
class FibonacciSequence
{
private:
int m_first;
int m_second;
public:
FibonacciSequence() : m_first(0), m_second(1) {}
int operator() ()
{
// store current Fibonacci number
int last = m_first;
// calculate next pair
int tmp = m_first + m_second;
m_first = m_second;
m_second = tmp;
return last;
}
void operator() (int elem)
{
std::cout << ">: " << elem << std::endl;
}
};
static void testFibonacci()
{
std::vector<int> sequence(20);
FibonacciSequence fibonacci;
std::generate(
sequence.begin(),
sequence.end(),
fibonacci
);
std::for_each(
sequence.begin(),
sequence.end(),
fibonacci
);
}
// ===========================================================================
void exerciseSTL()
{
testDevilsSequence();
testDevilsSequenceAdvanced();
testFibonacci();
}
// ===========================================================================
// End-of-File
// ===========================================================================