Scarfski/filament
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Improve Binary Tree Array by getting rid of the recursion

Browse Source 
We use a stack instead, it’s not terribly different
from the recursion but it saves function calls
which use a lot more stack than needed.
This commit is contained in:
Mathias Agopian
2018-08-21 23:26:32 -07:00
committed by Mathias Agopian
parent 38de58007c
commit 1f3dad48b6
3 changed files with 83 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
libs/utils/test/test_BinaryTreeArray.cpp
View File

@@ -30,10 +30,10 @@ TEST(BinaryTreeArray, basic) {
Node array[256];
BinaryTreeArray::traverse(1,
[&array](size_t index, size_t parent, size_t col, size_t next) {
[&array](size_t index, size_t col, size_t next) {
array[index] = Node{ index, next };
},
[&array](size_t index, size_t parent, size_t l, size_t r, size_t next) {
[&array](size_t index, size_t l, size_t r, size_t next) {
array[index] = Node{ index, next };
});
@@ -42,10 +42,10 @@ TEST(BinaryTreeArray, basic) {
BinaryTreeArray::traverse(2,
[&array](size_t index, size_t parent, size_t col, size_t next) {
[&array](size_t index, size_t col, size_t next) {
array[index] = Node{ index, next };
},
[&array](size_t index, size_t parent, size_t l, size_t r, size_t next) {
[&array](size_t index, size_t l, size_t r, size_t next) {
array[index] = Node{ index, next };
});
@@ -60,10 +60,10 @@ TEST(BinaryTreeArray, basic) {
BinaryTreeArray::traverse(3,
[&array](size_t index, size_t parent, size_t col, size_t next) {
[&array](size_t index, size_t col, size_t next) {
array[index] = Node{ index, next };
},
[&array](size_t index, size_t parent, size_t l, size_t r, size_t next) {
[&array](size_t index, size_t l, size_t r, size_t next) {
array[index] = Node{ index, next };
});
@@ -90,10 +90,10 @@ TEST(BinaryTreeArray, basic) {
BinaryTreeArray::traverse(4,
[&array](size_t index, size_t parent, size_t col, size_t next) {
[&array](size_t index, size_t col, size_t next) {
array[index] = Node{ index, next };
},
[&array](size_t index, size_t parent, size_t l, size_t r, size_t next) {
[&array](size_t index, size_t l, size_t r, size_t next) {
array[index] = Node{ index, next };
});