npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

@any86/array-to-tree

v0.1.1

Published

数组转树

Downloads

25

Readme

@any86/array-to-tree NPM Version Node CI

🌲 数组转树

安装

npm i -S @any86/array-to-tree

快速开始

const tree = arr2tree(array);

数组(array)

//  ======= 输入数组 🍔:=======
const array = [
  {
    id: 1,
    name: "蔬菜",
    order: 1,
  },
  {
    id: 2,
    name: "土豆",
    pid: 1,
    order: 2,
  },
  {
    id: 3,
    name: "豆角",
    pid: 1,
    order: 1,
  },
  {
    id: 4,
    name: "水果",
    order: 2,
  },
];

树(tree)

//  ======= 输出 🌲:=======
[
  {
    id: 1,
    name: "蔬菜",
    order: 1,
    children: [
      {
        id: 3,
        name: "豆角",
        pid: 1,
        order: 1,
      },
      {
        id: 2,
        name: "土豆",
        pid: 1,
        order: 2,
      },
    ],
  },
  {
    id: 4,
    name: "水果",
    order: 2,
  },
];

进阶

兼容不同的键值

我们可以通过参数来兼容不同业务下的键值:

const arr = [
  { xxid: 1, xxorder: 1 },
  { xxid: 2, xxpid: 1, xxorder: 2 },
];

arr2tree(arr, {
  KEY_ID: "xxid",
  KEY_PID: "xxpid",
});

自定义返回节点结构

注意不要删除或者结构node, 这里只可以对他附加属性, 否则无法形成树. 这里相当于遍历节点, 所以一些需要虚幻的操作可以放在这里.

const array = [
  { id: 1, order: 1 },
  { id: 2, pid: 1, order: 2 },
];
function transform(node: any) {
  if (2 === node.id) {
    node.category = "植物";
  }
  return node;
}

// 输出
// [{ id: 1, order: 1, children: [{ id: 2, pid: 1, order: 2, category: '植物' }] }]

自定义根节点的判断条件

默认情况下arr2tree通过判断"节点上的KEY_PID对应的属性是否 false"来区分根/子节点. 也就是值为空或者小于 1 的值都会当做父节点.

内部逻辑:

const isRoot = (node) => !node[KEY_PID];

如果不满足也可通过自定义isRoot来设置判断函数:

arr2tree(arr, {
  isRoot: (node) => node.iAmRoot,
});

自定义排序

默认根据节点的 order 字段倒序排列,比如:

arr2tree([
  { id: 1, order: 1 },
  { id: 2, order: 2 },
]); // [{id:2,order:2},{id:1,order:1}]

现实中你可能需要正序, 更可能没有 order 字段, 所以通过compareOrder函数可以调整.

// 根据"x"排序, 并且正序.
arr2tree(
  [
    { id: 2, x: 2 },
    { id: 1, x: 1 },
  ],
  {
    compareOrder(a, b) {
      return b.x - a.x;
    },
  }
); // [{id:1,x:1},{id:2,x:2}]