4 ms·
And... then? You would essentially need a homomorphic hash function for that to work. I.e.: [ a, b, c ].map(hash) produces the same order. where hash: A -> B
by hurril 3y ago
And... then? You would essentially need a homomorphic hash function for that to work.
I.e.:
[ a, b, c ].map(hash) produces the same order.
where hash: A -> B, where p, q in A. p < q => x, y in B. x < y.
- misja111 3y agoTrue and even then, you would only have a sorted list of the object's properties. But not a sorted list of the objects themselves.
- mjburgess 3y ago`ord` is a hash function which preserves alphabetical ordering, etc. It's not that hard, in many cases, to find an `f : DataDomain -> Int` st. `f(x1) < f(x2)` where `hash(x1) < hash(x2)`