aboutsummaryrefslogtreecommitdiffstats
path: root/hashtab.scm
diff options
context:
space:
mode:
authorBryan Newbold <bnewbold@robocracy.org>2017-02-20 00:05:25 -0800
committerBryan Newbold <bnewbold@robocracy.org>2017-02-20 00:05:25 -0800
commit8ffbc2df0fde83082610149d24e594c1cd879f4a (patch)
treea2be9aad5101c5e450ad141d15c514bc9c2a2963 /hashtab.scm
downloadslib-8ffbc2df0fde83082610149d24e594c1cd879f4a.tar.gz
slib-8ffbc2df0fde83082610149d24e594c1cd879f4a.zip
Import Upstream version 2a6upstream/2a6
Diffstat (limited to 'hashtab.scm')
-rw-r--r--hashtab.scm79
1 files changed, 79 insertions, 0 deletions
diff --git a/hashtab.scm b/hashtab.scm
new file mode 100644
index 0000000..317efe2
--- /dev/null
+++ b/hashtab.scm
@@ -0,0 +1,79 @@
+; "hashtab.scm", hash tables for Scheme.
+; Copyright (c) 1992, 1993 Aubrey Jaffer
+;
+;Permission to copy this software, to redistribute it, and to use it
+;for any purpose is granted, subject to the following restrictions and
+;understandings.
+;
+;1. Any copy made of this software must include this copyright notice
+;in full.
+;
+;2. I have made no warrantee or representation that the operation of
+;this software will be error-free, and I am under no obligation to
+;provide any services, by way of maintenance, update, or otherwise.
+;
+;3. In conjunction with products arising from the use of this
+;material, there shall be no use of my name in any advertising,
+;promotional, or sales literature without prior written consent in
+;each case.
+
+(require 'hash)
+(require 'alist)
+
+(define (predicate->hash pred)
+ (cond ((eq? pred eq?) hashq)
+ ((eq? pred eqv?) hashv)
+ ((eq? pred equal?) hash)
+ ((eq? pred =) hashv)
+ ((eq? pred char=?) hashv)
+ ((eq? pred char-ci=?) hashv)
+ ((eq? pred string=?) hash)
+ ((eq? pred string-ci=?) hash)
+ (else (slib:error "unknown predicate for hash" pred))))
+
+(define (make-hash-table k) (make-vector k '()))
+
+(define (predicate->hash-asso pred)
+ (let ((hashfun (predicate->hash pred))
+ (asso (predicate->asso pred)))
+ (lambda (key hashtab)
+ (asso key
+ (vector-ref hashtab (hashfun key (vector-length hashtab)))))))
+
+(define (hash-inquirer pred)
+ (let ((hashfun (predicate->hash pred))
+ (ainq (alist-inquirer pred)))
+ (lambda (hashtab key)
+ (ainq (vector-ref hashtab (hashfun key (vector-length hashtab)))
+ key))))
+
+(define (hash-associator pred)
+ (let ((hashfun (predicate->hash pred))
+ (asso (alist-associator pred)))
+ (lambda (hashtab key val)
+ (let* ((num (hashfun key (vector-length hashtab))))
+ (vector-set! hashtab num
+ (asso (vector-ref hashtab num) key val)))
+ hashtab)))
+
+(define (hash-remover pred)
+ (let ((hashfun (predicate->hash pred))
+ (arem (alist-remover pred)))
+ (lambda (hashtab key)
+ (let* ((num (hashfun key (vector-length hashtab))))
+ (vector-set! hashtab num
+ (arem (vector-ref hashtab num) key)))
+ hashtab)))
+
+(define (hash-map proc ht)
+ (define nht (make-vector (vector-length ht)))
+ (do ((i (+ -1 (vector-length ht)) (+ -1 i)))
+ ((negative? i) nht)
+ (vector-set!
+ nht i
+ (alist-map proc (vector-ref ht i)))))
+
+(define (hash-for-each proc ht)
+ (do ((i (+ -1 (vector-length ht)) (+ -1 i)))
+ ((negative? i))
+ (alist-for-each proc (vector-ref ht i))))