记录》使用队列排序生成TreeNode或其他组件，可以替代遍历和递归。提高生成的性能

原

`` const loopTitle = (data) =>
data.map((item, index) => {

    if (item.children && item.children.length) {
      return (
        <TreeNode
          // key={item.id}
          title={title}
          titleOnWritten={item.title}
          //   foldKey={item.isFolder}
          fkModuleId={item.fkModuleId}
          icon={item.icon}
          id={item.id}
          key={item.key}
          item={item.item}
          pkey={item.pkey}
          isDisplay={item.isDisplay}
        >
          {loopTitle(item.children)}
        </TreeNode>
      );
    }
    return (
      <TreeNode
        title={title}
        //   foldKey={item.isFolder}
        titleOnWritten={item.title}
        fkModuleId={item.fkModuleId}
        icon={item.icon}
        id={item.id}
        key={item.key}
        item={item.item}
        pkey={item.pkey}
        isDisplay={item.isDisplay}
        //   foldKey={item.isFolder}
      />
    );
  });

在这里插入代码片

  const LoopTitle = (data) => {
      const treeNodes = [];
      const queue = [...data];

      while (queue.length) {
        const item = queue.shift();
        const {
          title,
          isDisplay,
          fkModuleId,
          icon,
          children,
          id,
          key,
          pkey,
        } = item;

 
        const node = (
          <TreeNode
            title={title}
            fkModuleId={fkModuleId}
            icon={icon}
            id={id}
            key={key}
            item={item}
            pkey={pkey}
            isDisplay={isDisplay}
          >
            {LoopTitle(children)}
          </TreeNode>
        );
        treeNodes.push(node);
      }

      return treeNodes;
    };