-
> This lookup table works with no collisions because each mansion seed has a unique lower 32 bits, somehow. I don't understand why that's true, it's fascinating. You'd think it wouldn't work. But I th…
-
Just a random drive-by so that I don't forget about it ;).
Inspired by https://github.com/ArtifexSoftware/mupdf/commit/6bbfe286fd602aeedd674473a08221251d9c09b6 in MµPDF, I'm wondering if we couldn'…
-
Les options --phand-typing et --phmod-typing echouent.
```
Runtime error: Abstract method `poset` called on `MTypeHasher` (../src/layout_builders.nit:57)
```
C'est les seuls bench qui echouent http:…
-
An attempt was made a while back by Jasper Neumann(https://lists.llvm.org/pipermail/llvm-dev/2014-January/069676.html). Before the patch gets lost i'm putting it here for reference in case anyone want…
-
**This is a(n):**
- [x] New algorithm
- [ ] Update to an existing algorithm
- [ ] Error
- [ ] Proposal to the Repository
**Details:**
Add Cichelli's Perfect Hashing Algorithm in Ja…
-
Smhasher could mention that there is https://github.com/skeeto/hash-prospector which helps discovering nice constants and simple, but quite high quality hashes.
-
since there are only 200 odd values, there should be some hash function that can compactly represent the current mapping. Likely this would need to be used in conjunction with a bloom filter to know i…
-
# Hash, displace, and compress: Perfect hashing with Java | andreinc
An implementation of a perfection hashing algorithm in Java
[https://www.andreinc.net/2022/03/15/perfect-hashing-with-java](https…
-
In order to scale to a large number of trust anchors, it may be worthwhile to use [rust-phf](https://github.com/sfackler/rust-phf) or similar to look up the trust anchor very quickly for static sets o…
-
# Current approach
Switch case over an integer is implemented using binary search algorithm for a discontinuous set of integer labels. Binary search is a O(log(N)), which can be suboptimal for large …