Not really, it's just a binary tree with a macro that allows you to hard code how many dimensions you can put into a binary tree.
I'm still trying to figure out how to move() in many dimensions, so each node would have an array of an array of an array of an array etc and these things would go in infinitely, this is good for filling up space in a parallel fashion, the hard part is timing and input/output
if you can implement a binary tree in php or javascript, it could be easily utilized in the phornix test suite, if possible id like "by unidef" =)
-
Does this library do anything yet? When quickly checking out the code, it doesn't seem to be complete.Leave a comment:
-
c library that utilizes binary trees to high dimensions of like to contribute
git clone https://github.com/unidef/quantum quantum.work/
im on my phone so I can’t do a full write up unless it’s really needed
feel free to fork
Leave a comment: