-
Notifications
You must be signed in to change notification settings - Fork 6
/
collection.js
201 lines (176 loc) · 4.42 KB
/
collection.js
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
/*
Pitchfork Music Player Daemon Client
Copyright (C) 2007 Roger Bystrøm
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; version 2 of the License.
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.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
/* HashMap implementation, guess it's more of a key-lookup-linked-list though */
function HashNode(key, val) {
this.key = key;
this.value = val;
this.next = null;
}
function HashMap() {
this.header = null;
}
/*
* Usage: var it = hashmap.iterator();
* var tmp;
* while(tmp = it.next());
*/
function HashMapIterator(first) {
this.c = first;
}
HashMapIterator.prototype.next = function() {
var ret = this.c;
if(this.c != null) {
ret = ret.value;
this.c = this.c.next;
}
return ret;
}
/* get an entry from the list */
HashMap.prototype.get = function(key) {
var n = this.header;
while(n!=null) {
if(n.key==key)
return n.value;
n = n.next;
}
return null;
}
/* Removes an entry from the list and returns it */
HashMap.prototype.remove = function(key) {
if(this.header==null)
debug("wops, header null");
if(key==this.header.key) {
var tmp = this.header;
this.header = this.header.next;
return tmp.value;
}
else {
var n = this.header;
while(n.next != null) {
if(n.next.key == key) {
var ret = n.next;
n.next = n.next.next;
return ret.value;
}
n = n.next;
}
}
return null;
}
/* put a new entry in the list */
HashMap.prototype.put = function(key, value) {
var node = new HashNode(key,value);
var next = this.header;
if(next==null) {
this.header = node;
}
else {
while(next.next!=null)
next = next.next;
next.next = node;
}
}
HashMap.prototype.insert = function(key, value) {
var node = new HashNode(key,value);
node.next = this.header;
this.header = node;
}
HashMap.prototype.iterator = function() {
return new HashMapIterator(this.header);
}
/* A proper hashtable implementation
*/
function Hashtable() {
this.data = new Object();
this._size = 0;
}
/* clears the hashtable */
Hashtable.prototype.clear = function() {
for(var key in this.data)
delete this.data[key];
this._size = 0;
}
/* tests whether the specified value is in this hashtable
returns true if it does, falseotherwise */
Hashtable.prototype.contains = function(obj) {
if(obj==null) return false;
for(var opt in this.data) {
if(obj == this.data[opt])
return true;
}
return false;
}
/* Tests whether the specified key is in this hashtable
returns true if it does, false otherwise*/
Hashtable.prototype.containsKey = function(key) {
return typeof this.data[key] != "undefined" && this.data[key] != null;
}
Hashtable.prototype.put = function (key, value) {
this.data[key] = value;
this._size++;
}
/** puts all the in to this hashtable */
Hashtable.prototype.putAll = function(map) {
for(var key in map) {
this.data[key] = map[key];
this._size++;
}
}
Hashtable.prototype.get = function (key) {
return this.data[key];
}
Hashtable.prototype.isEmpty = function() {
return this._size == 0;
}
/**
remove the object and key from this hashtable,
returns the object if it's there, null otherwise
*/
Hashtable.prototype.remove = function(key) {
if(!this.containsKey(key))
return null;
var ret = this.data[key];
delete this.data[key];
this._size--;
return ret;
}
/** Returns the number of keys in this hashtable */
Hashtable.prototype.size = function() {
return this._size;
}
/** Returns an array with all the values in this hashtable */
Hashtable.prototype.elements = function() {
var ret = new Array();
for (var key in this.data) {
ret.push(this.data[key]);
}
return ret;
}
/** Returns an array with all the keys in this hashtable */
Hashtable.prototype.keys = function() {
var ret = new Array();
for (var key in this.data) {
ret.push(key);
}
return ret;
}
/** Returns a string with the keys and values */
Hashtable.prototype.toString = function() {
var ret = "";
for(var key in this.data) {
ret +="{" + key + "," + value + "}";
}
return ret;
}