表格加入横向滚动事件

8 years ago · 924bcc734d
3 changed files with 12 additions and 6 deletions
--- a/bi/widget.js
+++ b/bi/widget.js
@ -17790,16 +17790,18 @@ BI.shortcut('bi.all_value_chooser_pane', BI.AllValueChooserPane);BI.AbstractTree
        var name = values[values.length - 1];
        var p = values.slice(0, values.length - 1);
        var pNode = this._getNode(selectedValues, p);
-        if (pNode[name]) {
+        if (pNode != null && pNode[name]) {
            delete pNode[name];
            //递归删掉空父节点
            while (p.length > 0 && BI.isEmpty(pNode)) {
                name = p[p.length - 1];
                p = p.slice(0, p.length - 1);
                pNode = this._getNode(selectedValues, p);
+                if (pNode != null) {
                    delete pNode[name];
                }
            }
+        }
    },

    _buildTree: function (jo, values) {
--- a/docs/widget.js
+++ b/docs/widget.js
@ -17790,16 +17790,18 @@ BI.shortcut('bi.all_value_chooser_pane', BI.AllValueChooserPane);BI.AbstractTree
        var name = values[values.length - 1];
        var p = values.slice(0, values.length - 1);
        var pNode = this._getNode(selectedValues, p);
-        if (pNode[name]) {
+        if (pNode != null && pNode[name]) {
            delete pNode[name];
            //递归删掉空父节点
            while (p.length > 0 && BI.isEmpty(pNode)) {
                name = p[p.length - 1];
                p = p.slice(0, p.length - 1);
                pNode = this._getNode(selectedValues, p);
+                if (pNode != null) {
                    delete pNode[name];
                }
            }
+        }
    },

    _buildTree: function (jo, values) {
--- a/src/component/treevaluechooser/abstract.treevaluechooser.js
+++ b/src/component/treevaluechooser/abstract.treevaluechooser.js
@ -551,16 +551,18 @@ BI.AbstractTreeValueChooser = BI.inherit(BI.Widget, {
        var name = values[values.length - 1];
        var p = values.slice(0, values.length - 1);
        var pNode = this._getNode(selectedValues, p);
-        if (pNode[name]) {
+        if (pNode != null && pNode[name]) {
            delete pNode[name];
            //递归删掉空父节点
            while (p.length > 0 && BI.isEmpty(pNode)) {
                name = p[p.length - 1];
                p = p.slice(0, p.length - 1);
                pNode = this._getNode(selectedValues, p);
+                if (pNode != null) {
                    delete pNode[name];
                }
            }
+        }
    },

    _buildTree: function (jo, values) {