-
I recently improved the badly chosen load factor (old: 0.9, new: 0.75) and the table initial bucket count (old: 1024, new: 1031). Experiments have shown this gave a major speedup, but it is still unkn…
-
I recently wrote some stuff receiving lots of dicts from python which I would then transform to turn the string hashtable keys into lisp keywords. It would be nice if I could do that on the hashtable…
-
Similar to `ConvertFrom-Json`, it would be nice to have parameter to natively cast the `OrderedDictionary` to an `OrderedHashtable` type.
```powershell
# EZPZ typecast from OrderedDictionary to Ha…
-
This somewhat surprised me. Shouldn't the value of a string terminating in ";" be null?
```m2
i1 : value "new HashTable from {}"
o1 = HashTable{}
o1 : HashTable
i2 : value "new HashTable fr…
-
So, as we discussed during the meeting...How should we design the tables then? Since the program needs to be able to print the data unsorted, sorted by URL, and sorted by names, how should we implemen…
-
The standard ConvertFrom/To modules work with PSCustomObjects (with options to fallback to Hashtables if needed for some reason). It would be great to have parity with them.
-
https://github.com/ipfs-haskell/kademlia/blob/c23a8a553d3de5bbe2680fd30ad741747ce6504d/src/Spec.hs#L19
Currently, you are using ordered Map. Use HashTable instead. insertion, query both are faster …
-
**Summary**
We’ve encountered a coverage issue related to two classes, HashTable and TimSorter, which is impacting the overall code coverage in our project. Despite the current PR achieving 100% cove…
-
Since maps are implemented as arrays in Clickhouse, doing lookups (via `[]` indexer, using `mapContains` etc) is taking linear time.
Is there any way to "convert" key-value pairs into a hashtable-…
yard updated
2 months ago
-
If you remove an entry using hashtable_remove, you set its key = NULL. But if you then call hashtable_find_slot, and it linearly probes to the site of the deleted entry, seeing key = NULL will make th…