Commit cb975cb6020d087d022e6505e90ca937ac462bf9
Update spec.md
wanderer authored on 1/21/2018, 1:49:41 AMGitHub committed on 1/21/2018, 1:49:41 AM
Parent: b0094bf5d7c4780675dd5379018431540837353c
Files changed
| docs/spec.md | changed |
| docs/spec.md | ||
|---|---|---|
| @@ -1,6 +1,6 @@ | ||
| 1 | 1 … | This documnet provides the structure of the [Dfinity's Radix Tree.](https://ipfs.io/ipns/QmdJiuMWp2FxyaerfLrtdLF6Nr1EWpL7dPAxA9oKSPYYgV/wiki/Radix_tree.html) |
| 2 | -Our radix tree data structure stores the key-valus; the tree nsists of Nodes that contains the value and the key is the path to the node in the tree. | |
| 2 … | +The radix tree data structure stores the key-values; the tree is an instances of nodes that contains the value and the key is the path to the node in the tree. | |
| 3 | 3 … | |
| 4 | 4 … | ## Node |
| 5 | 5 … | Each node has a type and contains at most four elements: |
| 6 | 6 … | "extension", "left branch", "right branch" and "value". |
| @@ -9,9 +9,9 @@ | ||
| 9 | 9 … | node : = TYPE | EXTENSION | LBRANCH | RBRANCH | VALUE |
| 10 | 10 … | ``` |
| 11 | 11 … | |
| 12 | 12 … | ### Type |
| 13 | -The type feild contains a byte. The first 4 bits are paded to zero while the Node is stored in the tree. These bits are reserved as insicators of type when sending the nodes to other clients which we will describe later. The last 4 bits are used to signify which elements a node contains. The bit field is defined a the following | |
| 13 … | +The type field contains a byte. The first 4 bits are paded to zero while the Node is stored in the tree. These bits are reserved as insicators of type when sending the nodes to other clients which we will describe later. The last 4 bits are used to signify which elements a node contains. The bit field is defined a the following | |
| 14 | 14 … | |
| 15 | 15 … | ``` |
| 16 | 16 … | Type := 0 | 0 | 0 | 0 | HasEXTENSION | HasLBRANCH | HasRBRANCH | HasVALUE |
| 17 | 17 … | ``` |
Built with git-ssb-web