-
Notifications
You must be signed in to change notification settings - Fork 3
/
jaylist.js
250 lines (197 loc) · 7.42 KB
/
jaylist.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
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
// Jaylist v2.2
// Copyright (C) 2011 by Ben Brooks Scholz. MIT Licensed.
var list = function () {
var _table = {};
var _next;
var _isList = function (item) {
return item._table && item.next;
};
var _isArray = function (item) {
if (item && typeof item === 'object' && item.constructor === Array)
return true;
else if (Object.prototype.toString.call(item) == '[object Array]')
return true;
else
return false;
};
var _zipArray = function (a, b) {
var i,
zipped = [];
for (i = 0; i < a.length; i += 1)
zipped.push([a[i], b[i]]);
return zipped
};
var _deepEquals = function (a_obj, b_obj) {
var i,
key,
atype = typeof a_obj,
btype = typeof b_obj;
if (a_obj === b_obj)
return true;
if (atype !== btype)
return false;
if (_isArray(a_obj) && _isArray(b_obj)) {
if (a_obj.length !== b_obj.length)
return false;
for (i = 0; i < a_obj.length; i += 1)
if (a_obj[i] !== b_obj[i])
return false;
return true;
}
if (atype !== "object")
return false;
if (Object.keys(a_obj).length !== Object.keys(b_obj).length)
return false;
for (key in a_obj) {
if (!b_obj.hasOwnProperty(key))
return false;
if (a_obj.hasOwnProperty(key) && b_obj.hasOwnProperty(key))
return _deepEquals(a_obj[key], b_obj[key]);
}
return true;
};
var _deepCopy = function (obj) {
var entry,
copied = {};
if (_isList(obj))
copied = list();
else if (_isArray(obj))
copied = [];
for (entry in obj) {
if (obj.hasOwnProperty(entry)) {
if (typeof obj[entry] === 'string' ||
typeof obj[entry] === 'number' ||
typeof obj[entry] === 'boolean')
copied[entry] = obj[entry];
else if (typeof obj[entry] === 'object' || _isArray(obj))
copied[entry] = _deepCopy(obj[entry]);
}
}
return copied;
};
return {
_table : _table,
_next : _next,
// get: Returns the value attached to the given key or undefined
// if it isn't found.
get : function (key) {
if (this._table.hasOwnProperty(key))
return this._table[key];
else
return undefined;
},
// add: Inserts an object into the list, assigning it to the given key.
// It returns the value upon successful addition to the list. If a value
// is inserted with a key that exists in the list already, the old value
// is overwritten. Add throws an error if the key passed is an internal
// property like 'hasOwnProperty'.
add : function (key, value) {
try {
if (this._table.hasOwnProperty(key) === !!this._table[key])
return (this._table[key] = value);
else
throw "Error: key " + key + " is a built-in property.";
} catch (ex) {
console.log(ex);
return undefined;
};
},
// remove: Removes an object from the list with the given key. It
// returns undefined if no object with the given key exists in the
// list. Otherwise, it returns the value removed. A list or array
// of keys may also be passed.
remove : function (item) {
var nitem;
if (_isList(item)) {
while ((nitem = item.next()))
delete this._table[nitem];
} else if (_isArray(item)) {
while (item.length !== 0)
delete this._table[item.pop()];
} else {
var val = this._table[item];
delete this._table[item];
return val;
}
},
// keys: Returns an array of the keys in the list.
keys : function () {
return Object.keys(this._table);
},
// values: Returns an array of the values in the list. Duplicate values
// are only displayed once.
values : function () {
var i,
self = this,
values = [];
this.each(function (key) {
values.push(self.get(key));
});
return values;
},
// items: Returns an array of key-value pairs: [[key, value]]
items : function () {
return _zipArray(this.keys(), this.values());
},
// len: Returns the number of items in the list. Returns zero if empty.
len : function () {
var len = 0;
this.each(function () {
len = len + 1;
});
return len;
},
// clear: Removes the items from the list.
clear : function () {
this._table = {};
},
// hasKey: Returns true if the list contains the given key and false if
// if does not.
hasKey : function (key) {
return (this.get(key) !== undefined);
},
// update: Adds all the entries from the input list to the list.
update : function (list) {
var self = this;
list.each(function (key) {
self._table[key] = list.get(key);
});
},
// copy: Returns a deep copy of the list.
copy : function () {
var copy = list();
copy.update(_deepCopy(this));
return copy;
},
// each: Iterates over each entry in the list, calling the callback
// with the parameter 'key'.
each : function (callback) {
for (var key in this._table)
if (this._table.hasOwnProperty(key))
callback(key);
},
// next: Iterates over the list, returning the key of next entry
// on each call. Returns undefined when the iteration is complete.
next : function () {
if (this._next !== undefined && this._next.length !== 0)
return this._next.pop();
else if (this._next === undefined) {
this._next = this.keys().reverse();
return this._next.pop();
} else if (this._next.length === 0) {
this._next = undefined;
return this._next;
}
},
// object: Return the key-value list as an object.
object : function () {
return this._table;
},
// isEqual: Returns true if the lists are equivalent and false otherwise.
isEqual : function (list) {
if (!(_isList(list)))
return false;
return _deepEquals(this._table, list._table);
}
};
};