easyui tree treegrid 前端搜索实现

最新推荐文章于 2021-09-10 15:28:09 发布

原创最新推荐文章于 2021-09-10 15:28:09 发布 · 726 阅读

0 ·

CC 4.0 BY-SA版权

js 同时被 2 个专栏收录

11 篇文章

订阅专栏

easyui

3 篇文章

订阅专栏

本文介绍了一种在树形结构中进行关键词搜索的算法实现，包括初始化搜索计数器、设置关键字、增加搜索步进等功能。该算法适用于前端开发中的树形数据结构搜索，如Easyui TreeGrid组件。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

function search() {
        var searchCount = {key: '', step: 0};
        var setKey = function (key) {
            searchCount.key = key;
        };
        var addStep = function (step) {
            searchCount.step = step;
        };

        clearSearchWords = function () {
            setKey('');
            addStep(0);
        };
        return function (keywords) {
            if (searchCount.key != keywords) {
                setKey(!keywords ? '' : keywords);
                addStep(0);
            }
            function getSearchData(){
                var roots = $('#tt').tree('getRoots');
                var a = [];
                function find(d){
                    for (var i = 0; i < d.length; i++) {
                        if (d[i].text.indexOf(keywords)!=-1) {
                            a.push(d[i]);
                        }
                        find($('#tt').tree('getChildren',d[i].target) || []);
                    }
                }
                find(roots);
                return a;
            }
            var nodes = getSearchData();
            if (nodes.length > 0) {
                if (searchCount.step + 1 > nodes.length) {
                    addStep(0);
                }
                $('#tt').tree('select',nodes[searchCount.step].target);
                addStep(searchCount.step + 1);
            }
        };
    }

    var searchNodes = search();

treegrid代码

function search() {
        var searchCount = {key: '', step: 0};
        var setKey = function (key) {
            searchCount.key = key;
        };
        var addStep = function (step) {
            searchCount.step = step;
        };

        clearSearchWords = function () {
            setKey('');
            addStep(0);
        };
        return function (keywords) {
            if (searchCount.key != keywords) {
                setKey(!keywords ? '' : keywords);
                addStep(0);
            }
            function getSearchData(){
                var roots = $('#tt').treegrid('getRoots');
                var a = [];
                function find(d){
                    for (var i = 0; i < d.length; i++) {
                        if (d[i].text.indexOf(keywords)!=-1) {
                            a.push(d[i]);
                        }
                        find($('#tt').treegrid('getChildren',d[i].id) || {});
                    }
                }
                find(roots);
                return a;
            }
            var nodes = getSearchData();
            if (nodes.length > 0) {
                if (searchCount.step + 1 > nodes.length) {
                    addStep(0);
                }
                $('#tt').treegrid('select',nodes[searchCount.step].id);
                addStep(searchCount.step + 1);
            }
        };
    }
	var searchNodes = search();