|
|
@ -6,7 +6,7 @@ |
|
|
|
*/ |
|
|
|
*/ |
|
|
|
BI.AsyncTree = BI.inherit(BI.TreeView, { |
|
|
|
BI.AsyncTree = BI.inherit(BI.TreeView, { |
|
|
|
_defaultConfig: function () { |
|
|
|
_defaultConfig: function () { |
|
|
|
return BI.extend(BI.AsyncTree.superclass._defaultConfig.apply(this, arguments), {}) |
|
|
|
return BI.extend(BI.AsyncTree.superclass._defaultConfig.apply(this, arguments), {}); |
|
|
|
}, |
|
|
|
}, |
|
|
|
_init: function () { |
|
|
|
_init: function () { |
|
|
|
BI.AsyncTree.superclass._init.apply(this, arguments); |
|
|
|
BI.AsyncTree.superclass._init.apply(this, arguments); |
|
|
@ -65,7 +65,7 @@ BI.AsyncTree = BI.inherit(BI.TreeView, { |
|
|
|
ch.halfCheck = false; |
|
|
|
ch.halfCheck = false; |
|
|
|
track(ch.children); |
|
|
|
track(ch.children); |
|
|
|
} |
|
|
|
} |
|
|
|
}) |
|
|
|
}); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
track(treeNode.children); |
|
|
|
track(treeNode.children); |
|
|
@ -74,7 +74,7 @@ BI.AsyncTree = BI.inherit(BI.TreeView, { |
|
|
|
var nodes = treeObj.getSelectedNodes(); |
|
|
|
var nodes = treeObj.getSelectedNodes(); |
|
|
|
BI.each(nodes, function (index, node) { |
|
|
|
BI.each(nodes, function (index, node) { |
|
|
|
node.halfCheck = false; |
|
|
|
node.halfCheck = false; |
|
|
|
}) |
|
|
|
}); |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
@ -153,7 +153,9 @@ BI.AsyncTree = BI.inherit(BI.TreeView, { |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
if (!treeNode.children) { |
|
|
|
if (!treeNode.children) { |
|
|
|
o.itemsCreator(op, complete) |
|
|
|
setTimeout(function () { |
|
|
|
|
|
|
|
o.itemsCreator(op, complete); |
|
|
|
|
|
|
|
}, 17); |
|
|
|
} |
|
|
|
} |
|
|
|
}, |
|
|
|
}, |
|
|
|
|
|
|
|
|
|
|
@ -171,7 +173,7 @@ BI.AsyncTree = BI.inherit(BI.TreeView, { |
|
|
|
} else { |
|
|
|
} else { |
|
|
|
track(parent.concat([n]), node[n], compare[n]); |
|
|
|
track(parent.concat([n]), node[n], compare[n]); |
|
|
|
} |
|
|
|
} |
|
|
|
}) |
|
|
|
}); |
|
|
|
} |
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
return map; |
|
|
|
return map; |
|
|
|