如何使用 JavaScript/Prototype 1.7 递归搜索对象树并根据键/值返回匹配对象

How do I recursively search an object tree and return the matching object based on a key/value using JavaScript/Prototype 1.7

提问by Devin McQueeney

I've got some nested object data and I want to search it and return the matching object based on the id.

我有一些嵌套的对象数据，我想搜索它并根据 id 返回匹配的对象。

var data = [{id: 0, name: 'Template 0', subComponents:[
        {id: 1, name: 'Template 1', subItems:[
            {id: 2, name: 'Template 2', subComponents:[{id: 3, name: 'Template 3'}], subItems: [{id: 4, name: 'Template 4'}]}
        ]}
    ]}
];

So I want to do something like this

所以我想做这样的事情

getObjectByKeyValue({id: 3}) 

and have it return

并让它返回

{id: 3, name: 'Template 3'}

It's sort of got to be done generically because I have subItems, AND subComponents which could each have children.

这有点必须一般地完成，因为我有子项和子组件，每个子组件都可以有子项。

I tried this using Prototype 1.7 and no luck - I think this just searches an array, and not a tree with it's sub nodes:

我使用 Prototype 1.7 尝试了这个，但没有运气 - 我认为这只是搜索一个数组，而不是带有子节点的树：

data.find(function(s){return s.id == 4;})

Thanks in advance!!!!!!

提前致谢！！！！！！

采纳答案by mVChr

I went a slightly different route and made the findKeymethod an Object protype:

我走了一条稍微不同的路线，并将该findKey方法设为 Object 原型：

Object.prototype.findKey = function(keyObj) {
    var p, key, val, tRet;
    for (p in keyObj) {
        if (keyObj.hasOwnProperty(p)) {
            key = p;
            val = keyObj[p];
        }
    }

    for (p in this) {
        if (p == key) {
            if (this[p] == val) {
                return this;
            }
        } else if (this[p] instanceof Object) {
            if (this.hasOwnProperty(p)) {
                tRet = this[p].findKey(keyObj);
                if (tRet) { return tRet; }
            }
        }
    }

    return false;
};

Which you would call directly on the data object, passing in the key/value you're looking for:

您将直接在数据对象上调用，传入您要查找的键/值：

data.findKey({ id: 3 });

Note that this function allows you to find an object based on any key:

请注意，此函数允许您根据任意键查找对象：

data.findKey({ name: 'Template 0' });

See example →(open console to view result)

查看示例→（打开控制台查看结果）

回答by Vishwanath

Not the best of the and final solution. But can get you a start for what you are looking...

不是最好的和最终的解决方案。但是可以让你开始寻找你正在寻找的东西......

var data = [{id: 0, name: 'Template 0', subComponents:[
        {id: 1, name: 'Template 1', subItems:[
            {id: 2, name: 'Template 2', subComponents:[{id: 3, name: 'Template 3'}], subItems: [{id: 4, name: 'Template 4'}]}
        ]}
    ]}
];


function returnObject(data,key,parent){
    for(var v in data){

        var d = data[v];
        if(d==key){
            return parent[0];
        }
        if(d instanceof Object){
            return returnObject(d,key,data);
        };

    }
}

function returnObjectWrapper(datavar,key){
    return returnObject(datavar,key.id)
}

returnObjectWrapper(data,{id:3})

回答by ebaranov

Please see my solution below or http://jsfiddle.net/8Y6zq/:

请在下面查看我的解决方案或http://jsfiddle.net/8Y6zq/：

var findByKey = function (obj, key) {
var j, key = key || '', obj = obj || {}, keys = key.split("."), 
    sObj = [], ssObj = [], isSelector = !!(keys.length > 0);

    var findKey = function (obj, key) {
        var k;
        for (k in obj) {
            if (k === key) {
                sObj.push(obj[k]);
            } else if (typeof obj[k] == 'object') {
                findKey(obj[k], key);
            }
        }
    };

    if (isSelector) {
        var nKey = keys.shift();
        findKey(obj, nKey);

        while (keys.length > 0) {
            nKey = keys.shift();

            if (sObj.length > 0) {
                ssObj = sObj.slice(0), sObj = [];
                for (j in ssObj) {
                    findKey(ssObj[j], nKey);
                }
            }
        }
    } else {
        findKey(obj, key);
    }

    // return occurrences of key in array
    return (sObj.length === 1) ? sObj.pop() : sObj;
};

var data = [
    {id: 0, name: 'Template 0', subComponents: [
            {id: 1, name: 'Template 1', subItems: [
            {id: 2, name: 'Template 2', subComponents: [
                {id: 3, name: 'Template 3'}
            ], subItems: [
                {id: 4, name: 'Template 4'}
            ]}
        ]}
    ]},
    {subComponents:{
        comp1:'comp1 value',
        comp2:'comp2 value',
    }}
];

alert(JSON.stringify(findByKey(data, 'subComponents')));
alert(JSON.stringify(findByKey(data, 'subComponents.comp1')));
alert(JSON.stringify(findByKey(data, 'subComponents.comp2')));

In this implementation we can use search by KEY or SELECTOR (eg. "<paren_key>.<child_key_1>.<child_key_2>. ... <child_key_N>")

在这个实现中，我们可以使用 KEY 或 SELECTOR 搜索（例如。"<paren_key>.<child_key_1>.<child_key_2>. ... <child_key_N>"）

回答by offspringer

In case you really need a search through your tree data return all results (not a unique key), here is a little modified version of mVChr's answer:

如果您真的需要搜索树数据并返回所有结果（不是唯一键），这里是 MVChr 答案的一些修改版本：

Object.prototype.findKey = function (keyObj) {
var p, key, val, tRet;
var arr = [];

for (p in keyObj) {
    if (keyObj.hasOwnProperty(p)) {
        key = p;
        val = keyObj[p];
    }
}

for (p in this) {
    if (p == key) {
        if (this[p] == val) {
            arr.push(this);
        }
    } else if (this[p] instanceof Object) {
        if (this.hasOwnProperty(p)) {
            tRet = this[p].findKey(keyObj);
            if (tRet) {
                for (var i = 0; i < tRet.length; i++)
                    arr.push(tRet[i]);
            }
        }
    }
}

if (arr.length > 0)
    return arr;
else
    return false;
};