[<<][plt][>>][..]
Sun Sep 6 10:36:12 CEST 2009

Pure hash tables

I need an updatable (pure) finite function for identifier -> value
mapping to make it easier to add backtracking to a constraint
propagation algorithm.  I'm looking for `hash-update' described in
the PLT reference manual[1].

[1] http://docs.plt-scheme.org/reference/hashtables.html#%28def._%28%28lib._scheme/private/more-scheme..ss%29._hash-update%29%29




[Reply][About]
[<<][plt][>>][..]