Utilities for navigating flat trees
Go to file
Luke Murphy bf54dfa4cd
All checks were successful
continuous-integration/drone/push Build is passing
Fix up README example
2020-08-05 08:19:41 +02:00
.github Use existing file (doh) 2019-11-20 09:57:26 +07:00
flat_tree Remove setuptools_scm cruft 2020-07-07 14:37:48 +02:00
test Remove old test 2020-07-07 15:23:44 +02:00
.drone.yml Reduce package boilerplate 2020-05-16 18:15:47 +02:00
.gitignore Migrate to pyproject configuration 2020-07-07 14:33:47 +02:00
CHANGELOG.md Clarify version fumbling 2020-07-07 15:18:58 +02:00
LICENSE Follow the Hypercore protocol rename 2020-05-16 17:58:44 +02:00
poetry.lock Migrate to pyproject configuration 2020-07-07 14:33:47 +02:00
pyproject.toml Small case it 2020-07-07 15:56:01 +02:00
README.md Fix up README example 2020-08-05 08:19:41 +02:00

flat-tree

Build Status

Utilities for navigating flat trees

Flat Trees are the core data structure that power Hypercore feeds. They allow us to deterministically represent a tree structure as a vector. This is particularly useful because vectors map elegantly to disk and memory. Because Flat Trees are deterministic and pre-computed, there is no overhead to using them. In effect this means that Flat Trees are a specific way of indexing into a vector more than they are their own data structure. This makes them uniquely efficient and convenient to implement in a wide range of languages.

Install

$ pip install flat-tree

Example

from flat_tree import FlatTreeIterator

tree_iter = FlatTreeIterator()

print("tree index: ", tree_iter.index)
print("tree first parent: ", tree_iter.parent())
print("tree next parent", tree_iter.parent())

Output:

tree index:  0
tree first parent:  1
tree next parent 3