Associative array/Creation: Difference between revisions
→A persistent associative array from scratch
Line 4,314:
(export avl-empty?)
(export avl-insert)
(export avl-search-values)
(export avl-check-usage)
Line 4,347 ⟶ 4,346:
"avl-empty? expects an AVL tree as argument")
(not (%bal tree)))
(define (avl-search-values pred<? tree key)
Line 4,530 ⟶ 4,514:
;; having a hash function that *always* collides. At a nearly
;; opposite extreme are ideal hash trees, which never have
;; collisions, but which,
;; ‘grow’ on the fly.
;;
;; Perhaps the simplest form of associative array having all three
| |||