https://github.com/distributed-ledger-technology/tries
Tries and PATRICIA Tries Data Structures
https://github.com/distributed-ledger-technology/tries
data-structures patricia-trie tries
Last synced: about 1 month ago
JSON representation
Tries and PATRICIA Tries Data Structures
- Host: GitHub
- URL: https://github.com/distributed-ledger-technology/tries
- Owner: distributed-ledger-technology
- License: gpl-3.0
- Created: 2021-11-11T18:17:20.000Z (over 4 years ago)
- Default Branch: main
- Last Pushed: 2022-01-07T10:11:02.000Z (about 4 years ago)
- Last Synced: 2026-02-05T20:28:19.544Z (about 2 months ago)
- Topics: data-structures, patricia-trie, tries
- Language: TypeScript
- Homepage:
- Size: 27.3 KB
- Stars: 2
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Tries
[Tries](https://www.youtube.com/watch?v=3CbFFVHQrk4) are data structures that can be used to store sequences - e.g. words as sequences of letters.
Tries support faster and more precise query executions related to those sequences.
## Classical Tries
### Usage Examples
```ts
import { Trie } from "https://deno.land/x/tries/mod.ts"
const trie = new Trie()
const exampleSequence1 = "be"
const exampleSequence2 = "bet"
const exampleSequence3 = "bed"
const exampleSequence4 = "bed and breakfast"
const exampleSequence5 = "justice"
trie.insert(exampleSequence1)
trie.insert(exampleSequence3)
trie.insert(exampleSequence2)
trie.insert(exampleSequence5)
trie.insert(exampleSequence4)
console.log(trie.hasSequence(exampleSequence3)) // true
console.log(trie.hasSequence(exampleSequence4)) // true
console.log(trie.hasSequence("breakfast")) // false because it is not added as a discrete sequence
console.log(trie.hasSequence("missing")) // false
```
## Letters and Words Prediction Tries
```ts
import { LettersWordsPredictionTrie } from "https://deno.land/x/tries/mod-letters-and-word-prediction.ts"
const lettersWordsPredictionTrie = new LettersWordsPredictionTrie()
lettersWordsPredictionTrie.learn(['ether', 'eth', 'ethereum', 'super'])
const brain = lettersWordsPredictionTrie.getBrain()
console.log(JSON.stringify(brain, undefined, 2))
```
## Radix Tree
A Radix Tree is a compressed version of a trie - see [this introduction](https://www.youtube.com/watch?v=E8ZGt2i3xkw)
There are several variations of Radix Trees. In some cases there is no consistent naming / definition to be found (yet?).
A rather famous variation of a Radix Tree is the PATRICIA Trie:
**P** Practical
**A** Algorithm
**T** To
**R** Retrieve
**I** Information
**C** Coded
**I** In
**A** Alphanumeric
PATRICIA Tries are Radix Trees with the [radix 2](https://cs.stackexchange.com/questions/63048/what-is-the-difference-between-radix-trees-and-patricia-tries).
[Merkle PATRICIA Tries aka Merkle PATRICIA Trees](https://www.skypack.dev/view/merkle-patricia-tree) became especially famous as in the Ethereum Blockchain pretty much everything (state trie, transaction trie, receipt trie, ...) is stored in those kinds of data structures. For details I can recommend [this video](https://www.youtube.com/watch?v=OxofT39TJgg). Keep in mind that (currently) some people use different words for the same thing and some people use the same word for different things in these contexts.
## Merkle PATRICIA Trie / Tree
```ts
import merklePatriciaTree from 'https://cdn.skypack.dev/merkle-patricia-tree'
// For specific usage examples you might check https://www.skypack.dev/view/merkle-patricia-tree
```
### Usage Examples
... Under Construction ...
## Unit Tests
For further usage examples etc. please check the [unit tests](https://github.com/distributed-ledger-technology/tries/blob/main/src/trie.spec.ts).
## Contribute
Contributions / Pull Requests are welcome.