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

tree.io

v1.2.4

Published

JS Tree shim for browser or nodejs enhance

Downloads

12

Readme

Tree.io

JS Tree shim for browser or nodejs enhance

build status Coverage Status

Usage

Install

npm install tree.io --save

Import

import Tree from 'tree.io';
let nestedTree = {
  name: 'root',
  children: [{
    name: 'childA',
    children: []
  },{
    name: 'childB',
    children: []
  }]
}
let tree = new Tree(nestedTree);

or init Tree with options:

//Tree.io use "children" key to visit tree
//and "name" key to visit the tree node id
let tree = new Tree(nestedTree, {
  childrenPropName: 'children',
  identification: 'name'
})

may be it's a normalize tree:

let flagTree = {
  root: {
    name: 'root',
    children: ['childA', 'childB']
  },
  childA: {
    name: 'childA',
    children: []
  },
  childB: {
    name: 'childB',
    children: []
  }
}

//Tree.io will detect nestedTree or flagTree
//by visiting the "children" key of it
let tree = new Tree(flagTree);

Attenation: There must be a 'root' tree node in the tree data passed to Tree.io.

API


Tree.io export serval simple methods just fit your need.

#getTree

return tree object data

//return normalize/flag tree by default
tree.getTree()

//return nested tree
tree.getTree(true)

#traversal(processor, order)

traversal the hold tree, order can be preOrder(default) and inOrder, visit wiki for more detail.

//may be you want to print the children of tree
tree.traversal((tree, node) => {
  console.log(node.name);
}, 'inOrder');

#removeNode(id)

remove a tree node by identification specified to construcotr, you may have more operation of node by #filter method specified below

tree.removeNode('1.1');

#updateNode(obj)

update tree node, obj must contain the identification of the node being update.

tree.updateNode({
  name: '1.1',
  age: 23
})

#insertAfter(node, id)

insert a tree node after the node of spec id

tree.insertAfter({
  name: '1.3',
  children: []
}, '1.2');

#insertBefore(node, id)

the same as above;

#filter(fn)

like the Array.filter but with more power

#keyWordFilter(key, keyWord)

In common use implement of #filter, filter keyWord by spec word in tree node.

implement:

keyWordFilter(key, keyWord){
  this.filter((tree, node) => {
    if(node[key] === keyWord || (node[this.childrenPropName] && node[this.childrenPropName].length!=0)){
    return true;
   }
    return false;
  })
}

usage:

tree.keyWordFilter('name', 'childA');

License

MIT