blob: 19d17e9b210112c5ed6a0c8ebc76104bd7fc42d8 (
plain)
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
|
#include "memory-classes.hpp"
#include <iostream>
lifo::lifo(std::size_t max_size_) : max_size(max_size_) {
m_storage = new int[max_size];
}
lifo::~lifo() {
if (m_storage != nullptr)
delete m_storage;
}
void lifo::push(int v) {
if (m_top >= max_size)
return;
m_storage[m_top++] = v;
}
int lifo::pop() {
if (m_top <= 0)
return 0;
return m_storage[--m_top];
}
int main(int argc, char *argv[]) {
// the lifo allocates a memory buffer
lifo stack(5);
stack.push(1);
stack.push(2);
stack.push(3);
stack.push(4);
stack.push(5);
std::cout << stack.pop() << std::endl;
std::cout << stack.pop() << std::endl;
std::cout << stack.pop() << std::endl;
std::cout << stack.pop() << std::endl;
std::cout << stack.pop() << std::endl;
return 0;
// here, when the scope ends the stack object is destroyed
// as it goes *out of scope*, and so the destructor is called
// which frees the memory
}
|
