-
The current implementation of hasherlife uses `ID`s as handles to the actual `Node`s in the `HashMap`. Instead it would be sufficient to use references (`&Node`) into a `HashSet`.
The largest probl…
-
Currently our main indexing structure, which maps kmer hashes to their PRGs and locations, is a `std::unordered_map`. There are better alternatives, like `boost::unordered_flat_map` (a review here: ht…
-
In Erlang it often ends up being useful to model the state invariants as pattern matches of expectations of complex types.
For instance, an IRC chat room that is empty the first user to join it becom…
dreid updated
10 years ago
-
Please add here tests that you would like to see on [perfjs.info](http://perfjs.info)
-
It should be easy to compare two things or sub-components (value, link, etc.).
=> Override `==` operator and hashcode.
-
`hb_unicode_funcs_t` marked immutable has HarfBuzz-provided atomic refcounting for multithreaded use. Also, the ICU4X data structures themselves that are held within `DataPayload` should be fine to re…
-
Fork in the road on the TSInsts data structures:
a) Make TimeSeries, TimeSeriesInstance, and TimeSeriesInstances all *mutable*
- This complicates the code somewhat as we have to assume data ha…
-
In #6 gates' parameters are being stored in the gates themselves. Which is convenient, but not optimal.
The reason why it is not the best option is that, in this way, we need to navigate the struct…
-
### Background and motivation
We added `GetAlternateLookup()` to many collection types, including `Dictionary` and `HashSet`. We should add it to `SortedSet` as well, for symmetry. In my case, I ofte…
-
Pydantic primary purpose is data validation. This is great for things like parsing and validating JSON, but we don't need to do data validation for internal data structures and pydantic will have an u…