Sorted dictionary data structures based on red-black trees.
The rb-tree library is based on the SML/NJ library implementation of red-black trees, which is in turn based on Chris Okasaki's implementation of red-black trees. The delete function is based on the description in Cormen, Leiserson, and Rivest.
The present implementation code defines a persistent map yasos object that implements an ordered dictionary mapping of keys to values.
Looking up an arbitrary or the min/max keys, and deleting the min/max keys require no more key comparisons than the depth of the tree, which is O(log n) where n is the total number of keys in the tree.
The persistent map instance is created by procedure rb-tree-map:
where KEY-COMPARE-PROC is a user-supplied function that takes two keys and returns a negative, positive, or zero number depending on how the first key compares to the second.
The persistent-map object contains the following operations:
- empty? TREE
- returns #t if the given tree is empty
- get TREE
- returns a procedure of the form (LAMBDA KEY . DEFAULT-CLAUSE which searches the given tree for an association with a given KEY, and returns a (key . value) pair of the found association. If an association with KEY cannot be located in the tree, the procedure returns the result of evaluating the DEFAULT-CLAUSE. If the default clause is omitted, an error is signalled. KEY must be comparable to the keys in the tree by a key-compare predicate (which has been specified when the tree was created)
- get-value TREE
- returns a procedure of the form (LAMBDA KEY . DEFAULT-CLAUSE which searches the tree for an association with a given KEY, and returns the value of (key . value) pair of the found association. If an association with KEY cannot be located in the tree, the procedure returns the result of evaluating the DEFAULT-CLAUSE. If the default clause is omitted, an error is signalled. KEY must be comparable to the keys in the tree by a key-compare predicate (which has been specified when the tree was created)
- get-min TREE
- returns a (key . value) pair for an association in the tree with the smallest key. If the tree is empty, an error is signalled.
- get-max TREE
- returns a (key . value) pair for an association in the tree with the largest key. If the tree is empty, an error is signalled.
- size TREE
- returns the size (the number of associations) in the tree
- put TREE KEY VALUE
- returns a new tree object that contains the given association
- delete TREE KEY . DEFAULT-CLAUSE
- if the specified key is found, it returns a new tree object that no longer contains the association specified by that key, while the original tree object is unmodified. If the key is not found, the procedure returns the result of evaluating DEFAULT-CLAUSE
- for-each-ascending TREE
- returns a procedure LAMBDA PROC that will apply the given procedure PROC to each (key . value) association of the tree, from the one with the smallest key all the way to the one with the max key, in an ascending order of keys.
- for-each-descending TREE
- returns a procedure LAMBDA PROC that will apply the given procedure PROCto each (key . value) association of the tree, in the descending order of keys.
(import rb-tree) (define (++ x) (fx+ 1 x)) (define (-- x) (fx- x 1)) (let ((m (rb-tree-map (lambda (x y) (- x y))))) (let* ((compute-assoc (lambda (key) (cons key (++ key)))) (min-key -1) (max-key 10) (t (let recur ((m m) (i min-key)) (let ((t1 (put m i (cdr (compute-assoc i))))) (if (< i max-key) (recur t1 (++ i)) t1)))) ) (print (get m (++ min-key))) (print (get m (-- min-key) 'notfound)) ;; checking traversing in ascending order (let ((expected-key min-key)) ((for-each-ascending m) (lambda (association) (print (equal? association (compute-assoc expected-key))) (set! expected-key (++ expected-key))))) ) )
- Refactored to use yasos-based object interface and support for the operations defined by yasos-collections
- Ported to CHICKEN 5
- Using typeclass interface, discarded ephemeral map
- Ensure test script returns proper exit status
- Divided API in persistent and ephemeral maps
- Added get-value operation
- Ability to specify different predicates for lookup, insert, delete operations
- Documentation converted to wiki format
- Added matchable as dependency
- Bug fix in dispatch-on-key
- Ported to Chicken 4
- Fixes to for-each-ascending/descending
- Build script updated for better cross-platform compatibility
- Added fold-limit procedures
- Added fold-partial procedures
- Added side-effect-free put and delete procedures
- Initial release
Copyright 2007-2018 Ivan Raikov. This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. A full copy of the GPL license can be found at <http://www.gnu.org/licenses/>.