forked from mikeal/jstree
-
Notifications
You must be signed in to change notification settings - Fork 1
/
jstree.js
184 lines (172 loc) · 4.66 KB
/
jstree.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
var sys = require('sys')
// Basic structure
// {root:node, size:587, }
// node structure
// Parent reference must be lazy loaded on deserialized trees and must be funciton to avoid
// circular references during serialization.
// {left:{}, right:{}, values:[], key:'saf', size:59,
// parent: function (){return parent;},
// range: function (end) {return [array of nodes]},
//
// }
// tree methods
// range(start, end) // returns array of nodes
// store(tree)
// insert(key, value) // if key already exists it will be added.
// bulkInsert([[key, value], [key, value]]) // perform bulk add, can be optimized for the least amount of traversal
// find(key) // returns node
// remove(key, value) // remove this value from this key
// removeNode(key) // remove and entire node regardless of the number of values
// node methods
// parent()
// range(end) // return array of nodes
var i= 0;
var createNode = function (parent, node) {
var node = node || {};
node.values = node.values || [];
node.size = 1;
node.insertNode = function (n) {
if (n.key === node.key) {
throw "Node with identical key cannot be inserted."
}
if (n.key < node.key) {
if (!node.left) {
node.left = n;
n.reParent(node);
} else {
if (node.left.key === n.key) {
throw "Node with identical key cannot be inserted."
}
if (node.left.key > n.key) {
node.left.insertNode(n);
} else {
n.insertNode(node.left);
node.left = n;
n.reParent(node)
node.left;
}
}
} else {
if (!node.right) {
node.right = n;
n.reParent(node);
} else {
if (node.right.key === n.key) {
throw "Node with identical key cannot be inserted."
}
if (node.right.key < n.key) {
node.right.insertNode(n);
} else {
n.insertNode(node.right);
node.right = n;
n.reParent(node);
node.right;
}
}
}
n.size = 1;
if (node.left) {n.size += node.left.size}
if (node.right) {n.size += node.right.size}
var p = n.parent();
while (p) {
p.size = 1;
if (p.left) {p.size += p.left.size}
if (p.right) {p.size += p.right.size}
p = p.parent();
}
}
node.reParent = function (p) {
node.parent = function (){return p};
}
node.parent = function (){return parent;};
node.range = function (end) {
var results = [];
var traverse = function (key, n) {
if (n.key <= key) {
results.push(n);
} else if (n.left < key) {
traverse(key, n.left);
} else if (n.right < key) {
traverse(key, n.right)
}
}
traverse(end, node);
return node;
};
return node;
}
var createTree = function (tree) {
tree = tree || {};
tree.insert = tree.insert || function (key, value) {
if (!tree.root) {
tree.root = createNode(null, {key:key,values:[value]});
return tree.root;
}
var traverse = function (key, n) {
if (n.key === key) {return n;};
if (n.left) {
if (n.left > key) {
return n;
} else {
return traverse(key, n.left)
}
} else {
return n;
}
}
var node = traverse(key, tree.root)
if (node.key === key) {
node.values.push(value);
return node;
}
var n = createNode(node, {key:key,values:[value]});
node.insertNode(n);
return n;
}
tree.find = tree.find || function (key) {
if (!tree.root) {return null;}
var n = tree.root
while (n.key !== key && n !== null) {
if (node.key > key) {
next = node.left || null;
} else {
next = node.right || null;
}
if (!next.parent) {
next.parent = function () {return n;};
}
}
return n;
}
tree.remove = tree.remove || function (key, value) {
var node = tree.find(key);
if (node) {
if (node.indexOf(value) !== -1) {
node.values.splice(node.values.indexOf(value), 1);
}
}
}
tree.remove = tree.remove || function (key, value) {
var node = tree.find(key);
if (node) {
if (node.indexOf(value) !== -1) {
node.values.splice(node.values.indexOf(value), 1);
}
}
}
tree.removeNode = tree.removeNode || function (key) {
var node = tree.find(key);
if (node) {
if (node.indexOf(value) !== -1) {
node.values.splice(node.values.indexOf(value), 1);
}
}
}
tree.range = tree.range || function (start, end) {
if (!tree.root) {return []};
return traverse(start, tree.root).range(end);
}
return tree;
}
exports.createTree = createTree;
exports.createNode = createNode;