Lines Matching refs:currentNodeId
250 return this.currentNodeId
687 this.currentNodeId = e.currentNodeId;
840 return this.currentNodeId
884 return this.currentNodeId
975 this._root.currentNodeId = -1
1020 if (e.currentNodeId == i) {
1033 if (o.currentNodeId == e) {
1047 this._root.currentNodeId = -1
1051 if (t.currentNodeId == e) {
1062 s.currentNodeId = t;
1076 for (let i = 0, s = e.length;i < s; i++) if (e[i].currentNodeId === t) {
1090 t.push(e.currentNodeId);
1098 if (e.currentNodeId == t) {
1126 if (o.currentNodeId == e) {
1173 if (o.currentNodeId == e) {
1184 … for (let e = 0;e < t.children.length && e < o.length; e++) o[e] = t.children[e].currentNodeId;
1194 if (o.currentNodeId == e) {
1206 o[e].itemId = t.children[e].currentNodeId;
2869 let e = { currentNodeId: a };
3250 let e = { currentNodeId: a };
3637 …if (e.currentNodeId === this.ROOT_NODE_ID || null === e.currentNodeId) throw new Error("ListTreeNo…
3638 this.nodeIdList.push(e.currentNodeId);
3639 this.listNodeUtils.addNode(e.parentNodeId, e.currentNodeId, e);
3647 …if (e.currentNodeId === this.ROOT_NODE_ID || null === e.currentNodeId) throw new Error("ListTreeNo…
3648 this.nodeIdList.push(e.currentNodeId);
3649 this.listNodeUtils.addNode(e.parentNodeId, e.currentNodeId, e);