-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathVarHolder.js
More file actions
82 lines (77 loc) · 1.99 KB
/
VarHolder.js
File metadata and controls
82 lines (77 loc) · 1.99 KB
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
"use strict";
/*
Copyright 2016 Andrew S
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
const FastMap = require('quickmap');
module.exports = class VarHolder {
constructor(main,varn) {
this.main = main;
this.varn = varn;
this.allnodes = new FastMap()
this.allNodes = new FastMap()
}
clear() {
this.allnodes.forEach((node)=>{
var ind = node.vars.forEach(this.varn)
if (ind != -1) node.vars.slice(ind,1)
})
this.allnodes.clear();
this.allNodes.clear();
this.main.clearVar(this.varn);
}
set(id,node) {
this["length"] = this.allnodes.length
var setn = function(id,node) {
var n = this.main.allnodes.get(id);
if (n && n.node == node) {
if (n.QTree != this.main) n.QTree[this.varn].set(id,node);
if (n.vars.indexOf(this.varn) == -1) n.vars.push(this.varn);
this.allnodes.set(id,n);
this.allNodes.set(id,n.node);
}
else {
this.main.setNode(id,node)
setn(id,node)
}
}.bind(this);
return setn(id,node);
}
forEach(c) {
return this.allNodes.forEach(c)
}
some(c) {
return this.allNodes.some(c)
}
every(c) {
return this.allNodes.every(c)
}
get(id) {
return this.allNodes.get(id);
}
delete(id) {
this["length"] = this.allnodes.length
this.allnodes.delete(id);
this.allNodes.delete(id);
var n = this.main.allnodes.get(id);
if (n) {
if (n.QTree != this.main) n.QTree[this.varn].delete(id);
var i = n.vars.indexOf(this.varn);
if (i != -1) n.vars.slice(i,1)
}
}
toArray() {
return this.allNodes.toArray()
}
getNodes(progressive,keep) {
if (keep) return this.allnodes; else return this.allNodes;
}
}