Very ingenious. That would use 2000 bytes for each key, to store 8
bytes of value, wouldn't it? I am willing to disregard that as a
practical application.
Henry Rich
On 4/4/2021 11:47 AM, Raul Miller wrote:
Interesting thought experiment:
LIM=:256
hash=: 1$.LIM#256
set=:{{
hash=:y (< LIM{.a.i.x)} hash
y
}}
get=:{{
(<LIM{.a.i.y){hash
}}
'dog' set 10
10
'frog' set 20
20
get 'dog'
10
--
This email has been checked for viruses by AVG.
https://www.avg.com
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
