This commit is contained in:
parent
126cadd0ed
commit
2e086644c4
19
README.md
19
README.md
@ -4,17 +4,14 @@
|
||||
|
||||
## Utilities for navigating flat trees
|
||||
|
||||
```bash
|
||||
```sh
|
||||
$ pip install flat-tree
|
||||
```
|
||||
|
||||
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.
|
||||
> 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.
|
||||
|
Loading…
Reference in New Issue
Block a user