blob: 6c51f4963116671d44dff40e033fde939517d8cf (
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
|
/* Copyright (C) 2024 Aryadev Chavali
* This program is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
* FOR A PARTICULAR PURPOSE. See the GNU General Public License Version 2 for
* details.
* You may distribute and modify this code under the terms of the GNU General
* Public License Version 2, which you should have received a copy of along with
* this program. If not, please go to <https://www.gnu.org/licenses/>.
* Created: 2024-07-25
* Author: Aryadev Chavali
* Description: Entrypoint
*/
#include <cstdio>
#include "./numerics.hpp"
int main(void)
{
NodeAllocator allocator{256};
std::queue<word_t> to_iterate;
word_t root = allocator.alloc_node({{1, 2}});
to_iterate.push(root);
for (int i = 0; i < 10; ++i)
{
iterate(to_iterate, allocator);
printf("step[%d]:\n%s\n\n", i, to_string(allocator, root).c_str());
}
return 0;
}
|
