note to self
parent
f90fa12878
commit
dfd4dc9e74
@ -1,2 +1,13 @@
|
||||
#lang debug racket/base
|
||||
|
||||
#|
|
||||
|
||||
My idea here is that instead of comparing attrs by using eq? with a hash,
|
||||
we can use eq? (not equal?) on an association list
|
||||
the idea being that if only update the attrs by consing onto the front,
|
||||
then the process is strictly accretive, that is:
|
||||
we are never allocating a fresh list to hold existing values
|
||||
For instance, the top-level attrs represent a list object
|
||||
that will eventually be the tail of the attrs in every atomized quad.
|
||||
|#
|
||||
|
||||
|
Loading…
Reference in New Issue