Could you use something like Redis? Use hashes as keys, fake immutability
by 'popping' kv pairs and inserting new ones keyed to the (presumably
different) hash of the updated map.
On Thursday, August 13, 2015 at 7:52:06 AM UTC-4, Christian Weilbach wrote:
>
> -BEGIN PGP SIGNED MESSAGE-
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Atamert,
sorry for replying late.
On 11.08.2015 10:29, Atamert Ölçgen wrote:
> Hi Christian,
>
> hasch looks nice, I might end up just using it. I will be hashing
> smaller collections (maps where keys are keywords and values are
> atomic data li
Hi Christian,
hasch looks nice, I might end up just using it. I will be hashing smaller
collections
(maps where keys are keywords and values are atomic data like integers).
Collisions BTW are not such a big deal for my use case. I will have a
limited number
of fragments (buckets, index pages, etc
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
I am the author of https://github.com/whilo/hasch
Would calling hasch.core/edn-hash satisfy your performance
requirements? I tried hard to make the recursion of the protocol
performant, but hashing a value is slower than the time needed to
write
Hi,
I need a way to reduce a compound value, say {:foo "bar"}, into a number
(like 693d9a0698aff95c in hex). I don't necessarily need a very large hash
space, 7 hex digits is good enough for my purposes. But I need
this hash to be consistent between runs and JVM versions etc. So I guess
that rules
