|
|
@ -115,6 +115,7 @@ BI.AsyncTree = BI.inherit(BI.TreeView, { |
|
|
|
var name = this._getNodeValue(treeNode); |
|
|
|
var name = this._getNodeValue(treeNode); |
|
|
|
// var values = parentValues.concat([name]);
|
|
|
|
// var values = parentValues.concat([name]);
|
|
|
|
if (treeNode.checked === true) { |
|
|
|
if (treeNode.checked === true) { |
|
|
|
|
|
|
|
this._addTreeNode(this.options.paras.selectedValues, parentValues, name, {}); |
|
|
|
} else { |
|
|
|
} else { |
|
|
|
var tNode = treeNode; |
|
|
|
var tNode = treeNode; |
|
|
|
var pNode = this._getTree(this.options.paras.selectedValues, parentValues); |
|
|
|
var pNode = this._getTree(this.options.paras.selectedValues, parentValues); |
|
|
@ -185,7 +186,7 @@ BI.AsyncTree = BI.inherit(BI.TreeView, { |
|
|
|
if (BI.isNull(compare[n])) { |
|
|
|
if (BI.isNull(compare[n])) { |
|
|
|
self._addTreeNode(map, parent, n, item); |
|
|
|
self._addTreeNode(map, parent, n, item); |
|
|
|
} else if (BI.isEmpty(compare[n])) { |
|
|
|
} else if (BI.isEmpty(compare[n])) { |
|
|
|
self._addTreeNode(map, parent, n, {}); |
|
|
|
self._addTreeNode(map, parent, n, item); |
|
|
|
} else { |
|
|
|
} else { |
|
|
|
track(parent.concat([n]), node[n], compare[n]); |
|
|
|
track(parent.concat([n]), node[n], compare[n]); |
|
|
|
} |
|
|
|
} |
|
|
|