This repository has been archived by the owner on Feb 3, 2023. It is now read-only.

use a collection that allows more efficient inserting of pairs into source chains #35

Closed

thedavidmeister opened this issue Jun 21, 2018 · 0 comments · Fixed by #136

Contributor

thedavidmeister commented Jun 21, 2018

currently we insert new pairs at the start of a vector, which is O(n)

other collection types can do O(1) or O(log n) for inserts

https://doc.rust-lang.org/std/collections/#sequences

Slavoj mentioned this issue

reversed in-memory representation and iterator of SourceChain #38

Closed

thedavidmeister mentioned this issue

use collection that allows more efficient get() in source chain #50

Closed

thedavidmeister mentioned this issue

WIP: 128 hash table mock #136

Merged

thedavidmeister closed this as completed in #136

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.