2

我有一个未确定级别的 json 树,如下所示:

var nodeset = {
    "name" : "FORM",
    "attributes" : {
        "IDFORM" : "59",
        "NOMDOC" : "1",
        "VERSFORM" : "1.01",
        "DATEREPORT" : "10.10.1988"
    },
    "nodes" : [{
            "name" : "PART1",
            "persist" : true,
            "nodes" : [{
                    "name" : "FTYPE",
                    "persist" : true,
                    "value" : "1",
                    "weight" : 1
                }, {
                    "name" : "STARTDATE",
                    "persist" : true,
                    "value" : "01.10.2011",
                    "weight" : 1
                }, {
                    "name" : "ENDDATE",
                    "persist" : true,
                    "value" : "31.12.2011",
                    "weight" : 1
                }
            ],
            "value" : "31.12.2011",
            "weight" : 3
        }, {
            "name" : "PART2",
            "persist" : true,
            "nodes" : [{
                    "name" : "F203",
                    "persist" : true,
                    "value" : 12,
                    "weight" : 1
                }, {
                    "name" : "F204",
                    "persist" : true,
                    "value" : 12,
                    "weight" : 1
                }, {
                    "name" : "STI059DETAIL",
                    "persist" : false,
                    "nodes" : [{
                            "name" : "F1",
                            "persist" : false,
                            "value" : "asd",
                            "weight" : 1
                        }, {
                            "name" : "F2",
                            "persist" : false,
                            "value" : "asd",
                            "weight" : 1
                        }, {
                            "name" : "F3",
                            "persist" : false,
                            "value" : 0,
                            "weight" : 0
                        }, {
                            "name" : "F4",
                            "persist" : false,
                            "value" : 0,
                            "weight" : 0
                        }
                    ],
                    "value" : 0,
                    "weight" : 2
                }, {
                    "name" : "STI059DETAIL",
                    "persist" : false,
                    "nodes" : [{
                            "name" : "F1",
                            "persist" : false,
                            "value" : null,
                            "weight" : 0
                        }, {
                            "name" : "F2",
                            "persist" : false,
                            "value" : null,
                            "weight" : 0
                        }, {
                            "name" : "F3",
                            "persist" : false,
                            "value" : 0,
                            "weight" : 0
                        }, {
                            "name" : "F4",
                            "persist" : false,
                            "value" : 0,
                            "weight" : 0
                        }
                    ],
                    "value" : 0,
                    "weight" : 0
                }, {
                    "name" : "STI059DETAIL",
                    "persist" : false,
                    "nodes" : [{
                            "name" : "F1",
                            "persist" : false,
                            "value" : null,
                            "weight" : 0
                        }, {
                            "name" : "F2",
                            "persist" : false,
                            "value" : null,
                            "weight" : 0
                        }, {
                            "name" : "F3",
                            "persist" : false,
                            "value" : 0,
                            "weight" : 0
                        }, {
                            "name" : "F4",
                            "persist" : false,
                            "value" : 0,
                            "weight" : 0
                        }
                    ],
                    "value" : 0,
                    "weight" : 0
                }
            ],
            "value" : 0,
            "weight" : 4
        }
    ],
    "weight" : 7
};

weight我的任务是从其中删除所有节点0以及nodes属性存在的位置。

因为它是一棵树,所以我尝试使用这样的递归函数:

function clean(index, owner){
    var node    = owner[index],
        weight  = node.weight;

    delete node.weight;

    if(typeof node.persist != 'undefined'){
        delete node.persist;
    }

    if(!node.nodes)return;

    if(!weight){
        owner.splice(index, 1);
    }

    for(var i = 0; i < node.nodes.length; i++){
        clean(i, node.nodes);
    }
}

for(var i = 0; i < nodeset.nodes.length; i++){
    clean(i, nodeset.nodes);
}

splice()不知何故,并没有从那里删除任何东西。我已将其替换为delete owner[index],这会导致null这些节点的位置出现值(我不想在那里看到:()。

我的问题:为什么该splice()功能没有按我的预期工作(不删除节点)?另外,我采取了正确的方法吗?如果没有,那么任何其他建议将不胜感激。

问候。

在这里测试小提琴,如果它可能会有所帮助。

4

1 回答 1

4

您可以使用Array.filterandArray.forEach过滤掉权重为 0 的节点。首先,定义一个谓词:

var keepNode = function(node) {
    return !(node.weight == 0 && node.hasOwnProperty("nodes"));
};

然后是一个清理不需要的子节点的函数,然后对剩余的子节点进行递归:

function clean(tree) {
    if (tree.nodes) {
         tree.nodes = tree.nodes.filter(keepNode);
         tree.nodes.forEach(clean);
    }
}

最后,处理整个数据结构:

clean(nodeset);

几乎可以肯定有一种更优雅的方式可以在过滤时递归,但这应该可以完成工作。

编辑(因为我没有注意到 IE8 标签)

对于 IE8(不支持filter),您有几个选择。您可以使用将大多数 EcmaScript 函数添加到旧版 JS 引擎的ES5 shim 包。或者,您可以使用此 shim(可在上面链接的文档页面上进一步获取filter):

if (!Array.prototype.filter)
{
  Array.prototype.filter = function(fun /*, thisp*/)
  {
    "use strict";

    if (this == null)
      throw new TypeError();

    var t = Object(this);
    var len = t.length >>> 0;
    if (typeof fun != "function")
      throw new TypeError();

    var res = [];
    var thisp = arguments[1];
    for (var i = 0; i < len; i++)
    {
      if (i in t)
      {
        var val = t[i]; // in case fun mutates this
        if (fun.call(thisp, val, i, t))
          res.push(val);
      }
    }

    return res;
  };
}
于 2013-07-10T03:42:55.003 回答