8e18e85288
* Aristo: Reorg `hashify()` using different schedule algorithm why: Directly calculating the search tree top down from the roots turns out to be faster than using the cached structures left over by `merge()` and `delete()`. Time gains is short of 20% * Aristo: Remove `lTab[]` leaf entry object type why: Not used anymore. It was previously needed to build the schedule for `hashify()`. * Aristo: Avoid unnecessary re-org of the vertex ID recycling list why: This list can become quite large so a heuristic is employed whether it makes sense to re-org. Also, re-org check is only done by `delete()` functions. * Aristo: Remove key/reverse lookup table from tx layers why: It is ignored except for handling proof nodes and costs unnecessary run time resources. This feature was originally needed to accommodate the mental transition from the legacy MPT to the `Aristo` trie :). * Fix copyright year |
||
|---|---|---|
| .. | ||
| aristo | ||
| core_db | ||
| kvt | ||
| ledger | ||
| notused | ||
| state_db | ||
| access_list.nim | ||
| aristo.nim | ||
| core_db.nim | ||
| distinct_tries.nim | ||
| geth_db.nim | ||
| incomplete_db.nim | ||
| kvstore_rocksdb.nim | ||
| kvt.nim | ||
| ledger.nim | ||
| state_db.nim | ||
| storage_types.nim | ||
| transient_storage.nim | ||
| trie_get_branch.nim | ||
| values_from_bytes.nim | ||