-
Notifications
You must be signed in to change notification settings - Fork 3
/
solist.dylan
202 lines (182 loc) · 7.03 KB
/
solist.dylan
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
module: self-organizing-list
author: Robert Stockton ([email protected])
synopsis: Provides "self-organizing lists". These explicit key
collections provide roughly the semantics of hash tables, but
use a probabilistic implementation which provides O(n) worst
case performance but can provide very fast constant time
access in the best case.
//======================================================================
//
// Copyright (c) 1994 Carnegie Mellon University
// Copyright (c) 1998, 1999, 2000 Gwydion Dylan Maintainers
// All rights reserved.
//
// Use and copying of this software and preparation of derivative
// works based on this software are permitted, including commercial
// use, provided that the following conditions are observed:
//
// 1. This copyright notice must be retained in full on any copies
// and on appropriate parts of any derivative works.
// 2. Documentation (paper or online) accompanying any system that
// incorporates this software, or any part of it, must acknowledge
// the contribution of the Gwydion Project at Carnegie Mellon
// University, and the Gwydion Dylan Maintainers.
//
// This software is made available "as is". Neither the authors nor
// Carnegie Mellon University make any warranty about the software,
// its performance, or its conformity to any specification.
//
// Bug reports should be sent to <[email protected]>; questions,
// comments and suggestions are welcome at <[email protected]>.
// Also, see http://www.gwydiondylan.org/ for updates and documentation.
//
//======================================================================
//======================================================================
// The "Self Organizing List" is a "poor man's hash table". More
// precisely, <self-organizing-list> is a subclass of <dictionary> for
// which addition and retrieval are both linear in the worst case, but
// which use a probabilistic strategy which yields nearly constant
// time in the best case.
//
// Because they have a very low overhead, self-organizing lists may
// provide better performance than hash tables in cases where
// references have a high degree of temporal locality. They may also
// be useful in situations where it is difficult to create a proper
// hash function.
//
// Define new self-organizing-lists with
//
// make(<self-organizing-list>, test: test)
//
// Test is expected to be an equality function. In particular, it is
// expected to satisfy the identity and transitivity requirements
// described in chapter 5. If not specified, test defaults to \==.
//======================================================================
define class <self-organizing-list>
(<mutable-explicit-key-collection>, <stretchy-collection>)
slot data :: <list>, init-value: #();
// slot accessor provides method for standard collection op "key-test"
sealed slot key-test :: <function>, init-value: \==, init-keyword: test:;
end class;
define sealed domain make (singleton(<self-organizing-list>));
define sealed domain initialize (<self-organizing-list>);
define inline function sol-fip-next-state
(list :: <self-organizing-list>, state :: <list>)
=> (result :: <list>);
tail(state);
end function;
define inline function sol-fip-finished-state?
(list :: <self-organizing-list>, state :: <list>, limit)
=> result :: <boolean>;
state == #();
end function;
define inline function sol-fip-current-key
(list :: <self-organizing-list>, state :: <list>)
=> (result :: <object>);
head(head(state));
end function;
define inline function sol-fip-current-element
(list :: <self-organizing-list>, state :: <list>)
=> (result :: <object>);
tail(head(state));
end function;
define inline function sol-fip-current-element-setter
(value :: <object>, list :: <self-organizing-list>, state :: <list>)
=> (result :: <object>);
tail(head(state)) := value;
end function;
define inline function sol-fip-copy-state
(list :: <self-organizing-list>, state :: <list>)
=> (result :: <list>);
state;
end function;
define sealed inline method forward-iteration-protocol
(table :: <self-organizing-list>)
=> (initial-state :: <object>,
limit :: <object>,
next-state :: <function>,
finished-state? :: <function>,
current-key :: <function>,
current-element :: <function>,
current-element-setter :: <function>,
copy-state :: <function>);
values(table.data, #f, sol-fip-next-state, sol-fip-finished-state?,
sol-fip-current-key, sol-fip-current-element,
sol-fip-current-element-setter, sol-fip-copy-state);
end method forward-iteration-protocol;
define constant sol-no-default = pair(#f, #f);
// Auxiliary function for element. Search the tail of the list for an element
// for which test(elem, key) is true, and then return the pair which
// *precedes* that element (or #() if not found)
//
define function elem-search (prev :: <list>, test :: <function>, key)
let list = prev.tail;
if (list == #())
#();
else
let elem = list.head;
if (test(elem.head, key))
prev;
else
elem-search(list, test, key);
end if;
end if;
end function elem-search;
define method element(table :: <self-organizing-list>, key :: <object>,
#key default: default = sol-no-default)
=> res :: <object>;
let list :: <list> = table.data;
let test :: <function> = table.key-test;
let first = list.head; // depend upon head(#()) being defined
case
list == #() =>
if (default == sol-no-default)
error("Key %= not in %=", key, table)
else
default
end if;
test(first.head, key) =>
first.tail;
otherwise =>
let cell :: <list> = elem-search(list, test, key);
if (cell ~= #())
// Move the matching element to the beginning
let next = cell.tail;
cell.tail := next.tail;
next.tail := list;
table.data := next;
// Return the actual value
next.head.tail;
elseif (default == sol-no-default)
error("Key %= not in %=", key, table)
else
default;
end if;
end case;
end method element;
define constant sol-no-value = pair(#f, #f);
define method element-setter(value, table :: <self-organizing-list>,
key :: <object>)
=> value :: <object>;
// Bring the existing element (if any) to the front of the list
if (element(table, key, default: sol-no-value) == sol-no-value)
// It wasn't there, so add it
table.data := pair(pair(key, value), table.data);
else
// It was there, so change the value of the first element.
tail(head(table.data)) := value;
end if;
value;
end method element-setter;
define method remove-key!
(table :: <self-organizing-list>, key :: <object>)
=> (nuked? :: <boolean>);
// Bring the existing element (if any) to the front of the list
if (element(table, key, default: sol-no-value) ~= sol-no-value)
// It was there, so remove it.
table.data := table.data.tail;
#t;
else
#f;
end if;
end method remove-key!;