基于antd3 Tree实现树节点 查询

基于antd3 Tree实现树节点 查询

基于antd Tree,实现了可编辑菜单树,支持以下功能:
树节点 查询


提示:以下代码,可参考

一、效果

在这里插入图片描述

二、完整代码

1.引入库

代码如下(示例):

import * as React from 'react';
import { Modal, Input, Tree, Icon } from 'antd';
const { Search } = Input;
const { TreeNode } = Tree;
var tempKey: any = '1000';

const App = (props) => {
    const { onHandleCancel = () => { }, onHandleOk = () => { }, data = {} } = props;
    var datavalue = [
        {
            value: "0",
            defaultValue: "0",
            key: "0",
            parentKey: '0',
            isEditable: false,
            children: [
                {
                    value: "0-1",
                    key: "0-1",
                    defaultValue: "0-1",
                    isEditable: false,
                },
                {
                    value: "0-2",
                    key: "0-2",
                    defaultValue: "0-2",
                    isEditable: false,
                },
            ],
        },
        {
            value: "1",
            defaultValue: "1",
            key: "1",
            parentKey: '1',
            isEditable: false,
            children: [
                {
                    value: "0-1-1",
                    key: "0-1-1",
                    defaultValue: "0-1-1",
                    isEditable: false,
                },
                {
                    value: "0-2-1",
                    key: "0-2-1",
                    defaultValue: "0-2-1",
                    isEditable: false,
                },
            ],
        },
    ]
    const [treeData, setTreeData] = React.useState(datavalue);
    const [treeLoading, settreeLoading] = React.useState(false);
    const [expandedKeys, setexpandedKeys] = React.useState<any>([]);
    const [searchValue, setsearchValue] = React.useState('');
    const [autoExpandParent, setautoExpandParent] = React.useState(true);

    const onDragEnter = (info) => {
        console.log(info);
    };

    
    const DragEnter = (info) => {
        console.log(info);
    };
    // 拖拽
    const onDrop = (info) => {
        console.log(info);
        const dropKey = info.node.props.eventKey;
        const dragKey = info.dragNode.props.eventKey;
        const dropPos = info.node.props.pos.split('-');
        const dropPosition = info.dropPosition - Number(dropPos[dropPos.length - 1]);

        const loop = (data, key, callback) => {
            for (let i = 0; i < data.length; i++) {
                if (data[i].key === key) {
                    return callback(data[i], i, data);
                }
                if (data[i].children) {
                    loop(data[i].children, key, callback);
                }
            }
        };

        const data = [...treeData];

        let dragObj;
        loop(data, dragKey, (item, index, arr) => {
            arr.splice(index, 1);
            dragObj = item;
        });
        if (!info.dropToGap) {
            // Drop on the content
            loop(data, dropKey, (item) => {
                item.children = item.children || [];
                // where to insert 示例添加到尾部,可以是随意位置
                item.children.push(dragObj);
            });
        } else if (
            (info.node.props.children || []).length > 0 && // Has children
            info.node.props.expanded && // Is expanded
            dropPosition === 1 // On the bottom gap
        ) {
            loop(data, dropKey, (item) => {
                item.children = item.children || [];
                // where to insert 示例添加到头部,可以是随意位置
                item.children.unshift(dragObj);
            });
        } else {
            let ar;
            let i;
            loop(data, dropKey, (item, index, arr) => {
                ar = arr;
                i = index;
            });
            if (dropPosition === -1) {
                ar.splice(i, 0, dragObj);
            } else {
                ar.splice(i + 1, 0, dragObj);
            }
        }
        setTreeData(data);
    };


    //新增
    const onAdd = (key) => {
        console.log('onAdd', key);
        var treeDataOld = JSON.parse(JSON.stringify(treeData));
        var treeDataNew = addNode(key, treeDataOld);
        setTreeData(treeDataNew);

        tempKey++;
        function addNode(key, data) {
            data.forEach((item) => {
                if (item.key === key) {
                    item.children
                        ? item.children.push({
                            value: `默认值${tempKey}`,
                            key: `${tempKey}`
                        })
                        : (item.children = [
                            {
                                value: `默认值${tempKey}`,
                                key: `${tempKey}`
                            }
                        ]);
                } else {
                    if (item.children) {
                        addNode(key, item.children);
                    }
                }
            });
            return data;
        }

    };
    //删除
    const onDelete = (key) => {
        console.log('onAdd', key);
        var treeDataOld = JSON.parse(JSON.stringify(treeData));
        var treeDataNew = deleteNode(key, treeDataOld);
        setTreeData(treeDataNew);

        function deleteNode(key, arr) {
            arr.map((item, index) => {
                if (item.key == key) {
                    arr.splice(index, 1);
                }
                if (item.children) {
                    deleteNode(key, item.children);
                }
            });
            return arr;
        }
    };

    // const onChange = (e, key) => {
    //     console.log('onChange', e, key);
    //     var treeDataOld = JSON.parse(JSON.stringify(treeData));
    //     var treeDataNew = editNode(key, treeDataOld, e.target.value);
    //     setTreeData(treeDataNew);

    //     function editNode(key, data, val) {
    //         data.forEach((item) => {
    //             if (item.key === key) {
    //                 item.title = val;
    //             } else {
    //                 if (item.children) {
    //                     editNode(key, item.children, val);
    //                 }
    //             }
    //         });
    //         return data;
    //     }
    // };
    const onChange = (e, key) => {
        changeNode(key, e.target.value, treeData);
        setTreeData(treeData.slice());
    };

    const changeNode = (key, value, data) =>
        data.forEach((item) => {
            if (item.key === key) {
                item.value = value;
            }
            if (item.children) {
                changeNode(key, value, item.children);
            }
        });

    const onEdit = (key) => {
        editNode(key, treeData);
        setTreeData(treeData.slice());
    };

    const editNode = (key, data) =>
        data.forEach((item) => {
            if (item.key === key) {
                item.isEditable = true;
            } else {
                item.isEditable = false;
            }
            // item.value = item.defaultValue; // 当某节点处于编辑状态,并改变数据,点击编辑其他节点时,此节点变成不可编辑状态,value 需要回退到 defaultvalue
            if (item.children) {
                editNode(key, item.children);
            }
        });

    //编辑树节点时直接选中
    const callbackRef = React.useCallback((node) => {
        node && node.focus();
        node && node.select();
    }, []);

    const handleBlur = (e, item) => {
        // let arr = _.cloneDeep(dataSource)
        // const value = e.target.value;
        // if (value) {//更改右侧树对应节点的值
        //     setDataSource(treeLip(arr, item.associativeId, e.target.value))
        // }
        // setEditType({ edit: false, id: item.associativeId })
    }
    const onSave = (key) => {
        saveNode(key, treeData);
        setTreeData(treeData.slice());
    };

    const saveNode = (key, data) =>
        data.forEach((item) => {
            if (item.key === key) {
                item.defaultValue = item.value;
            }
            if (item.children) {
                saveNode(key, item.children);
            }
            item.isEditable = false;
        });

    const InputCopy = (item) => {
        return <Input autoFocus={true} onBlur={(e) => handleBlur(e, item)} ref={callbackRef} maxLength={40} />
    }
    const renderTreeNodes = (data) => {
        let nodeArr = data.map((item) => {
            const index = item.value.indexOf(searchValue);
            const beforeStr = item.value.substr(0, index);
            const afterStr = item.value.substr(index + searchValue.length);
            if (item.isEditable) {

                item.title = (
                    <div>
                        <input value={item.value || ''} onChange={(e) => onChange(e, item.key)} />
                        <Icon type="close" style={{ marginLeft: 10 }} onClick={() => onDelete(item.key)} />
                        <Icon type="check-circle" style={{ marginLeft: 10 }} onClick={() => onSave(item.key)} />
                    </div>
                );
            } else {
                item.title = (
                    <div>
                        {index > -1 ? (
                            <span>
                                {beforeStr}
                                <span style={{ color: '#f50' }}>{searchValue}</span>
                                {afterStr}
                            </span>
                        ) : <span>{item.value}</span>}
                        <span>
                            <Icon type="plus" style={{ marginLeft: 10 }} onClick={() => onAdd(item.key)} />
                            <Icon type="form" style={{ marginLeft: 10 }} onClick={() => onEdit(item.key)} />
                            <Icon type="close" style={{ marginLeft: 10 }} onClick={() => onDelete(item.key)} />
                        </span>
                    </div>
                );
            }


            if (item.children) {
                return (
                    <TreeNode title={item.title} key={item.key} dataRef={item}>
                        {renderTreeNodes(item.children)}
                    </TreeNode>
                );
            }

            return <TreeNode title={item.title} key={item.key} />;
        });

        return nodeArr;
    };

    const iconRender = (node: any) => {
        let htmlNode = <i className="icon iconfont icon-yuandian" />;
        if (!node.isLeaf) {
            htmlNode = (
                <i style={{ color: '#F2B223' }} className="icon iconfont icon-tree-folder-close" />
            );
            if (node.expanded) {
                htmlNode = (
                    <i style={{ color: '#F2B223' }} className="icon iconfont icon-tree-folder-open" />
                );
            }
        }
        return <React.Fragment>{htmlNode}</React.Fragment>;
    }
    // 数组去重
    const unique = arr => {
        return Array.from(new Set(arr))
    }
    // 搜索父级ID。此处没有使用上。当树的数据每一项数据中没返回父级id时,就需要使用该方法获取父级id
    const getParentKey = (key, tree) => {
        let parentKey;
        for (let i = 0; i < tree.length; i++) {
            const node = tree[i];
            if (node.children) {
                if (node.children.some(item => item.treeId === key)) {
                    parentKey = node.treeId;
                } else if (getParentKey(key, node.children)) {
                    parentKey = getParentKey(key, node.children);
                }
            }
        }
        return parentKey;
    };

    const onSearch = value => {
        let expandedKeys: any = [];
        // 搜索时,寻找需展开的节点
        const getExpandKeys = arr => {
            arr.forEach(item => {

                if (item.value.indexOf(value) > -1) {
                    expandedKeys.push(item.key); // 此处每一项的数据就有父级id,所以直接把父级id塞进展开数组即可
                    // 倘若每一项的数据中不包含父级id。则需要执行下面的方法
                    // expandedKeys.push(getParentKey(item.treeId,this.state.treeList));
                }
                if (item.children && item.children.length > 0) {
                    getExpandKeys(item.children);
                }
            })
        }
        // 此处想实现的效果是搜索为空时,不展开树。若想搜索为空时,全部树都展开,则去掉这层if包装即可
        if (value) {
            getExpandKeys(treeData);
            let value = unique(expandedKeys);
            setexpandedKeys(value)
            setautoExpandParent(true)
        }
        console.log(expandedKeys)
        getExpandKeys(treeData);
        setsearchValue(value)
        setautoExpandParent(true)
        setexpandedKeys(expandedKeys)
    }

    const onExpand = expandedKeys => {
        setexpandedKeys(expandedKeys)
        setautoExpandParent(false)
    };
    return (
        <>
            <Modal
                title={data?.header}
                visible={true}
                onOk={() => onHandleOk()}
                onCancel={() => onHandleCancel(false)}
                okText="确认"
                cancelText="取消"
                maskClosable={false}
            >
                <Search className='Search'
                    placeholder="请输入搜索关键词"
                    allowClear
                    // bordered={false}
                    onSearch={onSearch} />
                <Tree
                    className="draggable-tree"
                    defaultExpandAll={true}
                    showLine
                    showIcon
                    onExpand={onExpand}
                    expandedKeys={expandedKeys}
                    // icon={iconRender}
                    draggable
                    onDragEnter={onDragEnter}
                    onDrop={onDrop}
                    autoExpandParent={autoExpandParent}
                >
                    {treeData?.length && renderTreeNodes(treeData)}

                </Tree>
            </Modal>
        </>
    );
};

export default App;



  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值