-
The current Trie implementation allocates 128 entries for child nodes at each node, but in practice, C function names only consist of 63 distinct characters ('_', '0'-'9', 'a'-'z', 'A'-'Z'). This lead…
-
I see the trie data structure is not implemented. Are there any plans that want to implement that in future or I can create one.
-
### Describe the feature
# Overview
Scroll uses a binary Markle Patricia trie (BMPT) to represent it's state. This is different to the standard MPT that ethereum and reth uses. As such we will nee…
-
The prefix search as currently done in `GreatestLowerBoundIterator` is a clumsy data structure despite its recent improvement. We need a true `trie` data structure.
Requirements:
* Fast checking o…
-
## Description
Cannon's memory is currently structured as a binary merkle tree of depth 27 with 32 byte leaf values, representing a 32-bit address space. There are some performance bottlenecks wit…
-
Our current implementation of the decentralized blockchain messaging system faces scalability challenges:
1. As users exchange more messages, the `chatAccount.messages` array grows unbounded.
2. L…
-
Currently Macaw makes use of various maps whose keys are qualified entities that are themselves represented by maps.
For example, the parameters passed to `replace-names`:
```clojure
{:columns…
-
As implemented currently the Trie enum has two major variants: Leaf, which contains K, and V, and a Node which contains 255 pointers in a trie. Each pointer in the Node variant is either Leaf pointer …
-
We currently have a binary trie data structure. Make it generic and use a n-trie where n is configurable
-
A [Patricia Trie](https://en.wikipedia.org/wiki/Radix_tree) is a data structure that is optimal for string autocompletion. Cytopia could greatly benefit from such a data structure. Notably:
+ In a se…
ghost updated
4 years ago