❤
npm
Sign UpSign In

lumberjack-tree

0.0.2 • Public • Published

Lumberjack

A library for working with trees.

API

Tree

Suppose you have a tree:

var someTree = {
  name: 'Jake',
  id: 1,
  children: { // by default, Lumberjack looks for a 'children' property;
              // you can override this in the options hash
    b: {
      name: 'Todd',
      id: 2,
      children: {
        c: { 
          name: 'Mary',
          id: 3
        }
      }
    },
    d: {
      name: 'Tricia',
      id: 4
    }
  }
};

And suppose you need to find something in that tree:

var Tree = require('lumberjack-tree').Tree;
var tree = new Tree(someTree, /*options*/);

You can search breadth-first:

// breadth-first search
tree.breadthFirst(tree.tree, { name: 'Mary' }, function(err, node) {
  console.log(node); // { name: 'Mary', id: 3 }
});

or depth-first:

// depth-first search
tree.depthFirst(tree.tree, { id: 4 }, function(err, node) {
  console.log(node); // { name: 'Tricia', id: 4 }
});

You can flatten the tree:

// flatten
tree.flatten(tree.tree);
console.log(tree.flattened);           // { '1': 
                                       //    { name: 'Jake',
                                       //      id: 1,
                                       //      children: [ 2, 4 ] },
                                       //   '2': 
                                       //    { name: 'Todd',
                                       //      id: 2,
                                       //      children: [ 3 ] },
                                       //   '3': { name: 'Mary', id: 3, children: [] },
                                       //   '4': { name: 'Tricia', id: 4, children: [] } }

And you can rebuild it:

// rebuild
tree.rebuild(tree.flattened['1'], { id: 1 });
console.log(tree.tree);       // { name: 'Jake',
                              //   id: 1,
                              //   children: 
                              //   [ { name: 'Todd',
                              //       id: 2,
                              //       children: [ { name: 'Mary', id: 3, children: [] } ] },
                              //     { name: 'Tricia', id: 4, children: [] } ] }

Options

  • children (String; default: 'children'): The name of subnodes in your tree

    • The value of this property should be an Array; however, if you flatten and then rebuild your tree, it will be made into an Array for you.

  • flat (Boolean; default: false): If you pass a flat tree to the Tree constructor, mark this flag as true so the constructor can build the nested tree for you. (It takes as root the 0th item in the Object or Array that it receives.)

  • identifier (String; default: 'id'): The key that uniquely identifies each node in your tree

  • rememberPath (Boolean; default: false): Instructs the Lumberjack instance to return its traversal path for your search. If true, provider your callback with a third parameter:

    var tree = new Tree(someTree, { rememberPath: true });

tree.breadthFirst(tree.tree, { id: 3 }, function(err, node, path) {
  console.log(path); // [ { name: 'Jake', id: 1, children: { b: [Object], d: [Object] } },
                     //   { name: 'Todd', id: 2, children: { c: [Object] } },
                     //   { name: 'Tricia', id: 4 },
                     //   { name: 'Mary', id: 3 } ]
});

tree.depthFirst(tree.tree, { id: 3 }, function(err, node, path) {
  console.log(path); // [ { name: 'Jake', id: 1, children: { b: [Object], d: [Object] } },
                     //   { name: 'Todd', id: 2, children: { c: [Object] } },
                     //   { name: 'Mary', id: 3 } ]
})

Lumberjack

Lumberjack can compare two trees:

var Tree = require('lumberjack-tree').Tree;
var Lumberjack = require('lumberjack-tree').Lumberjack;

var someTree = {
  name: 'Jake',
  id: 1,
  children: [
    {
      name: 'Todd',
      id: 2,
      children: [
        { 
          name: 'Mary',
          id: 3
        }
      ]
    },
    {
      name: 'Tricia',
      id: 4
    }
  ]
};

var anotherTree = {
  name: 'Jake',
  id: 1,
  children: [
    {
      name: 'Todd',
      id: 2,
      children: [
        { 
          name: 'Mary',
          id: 3
        },
        {
          name: 'Bill',
          id: 5
        }
      ]
    }
  ]
};

var tree1 = new Tree(someTree);
var tree2 = new Tree(anotherTree);
var lumberjack = new Lumberjack(/*options*/);

lumberjack.compare(tree1, tree2, { id: 1 }, function(err, markedTree) {
  // `added` and `removed` properties are with respect to the first tree parameter passed to
  // the `compare` function.
  console.log(markedTree);  //  { name: 'Jake',
                            //    id: 1,
                            //    children: [ 
                            //      { 
                            //        name: 'Todd', 
                            //        id: 2,
                            //        children: [
                            //          { 
                            //            name: 'Mary',
                            //            id: 3
                            //          },
                            //          {
                            //            name: 'Bill',
                            //            id: 5,
                            //            added: true
                            //          }
                            //        ], 
                            //        parent: 1 
                            //      },
                            //      { name: 'Tricia', id: 4, parent: 1, removed: true } ] }
});

TODO

  1. Make Tree.rebuild properly asynchronous

Tests

cd [lumberjack_root_directory]
make test

Readme

Keywords

none

Package Sidebar

Install

npm i lumberjack-tree

Weekly Downloads

1

Version

0.0.2

License

MIT

Last publish

Collaborators

  • pletcher
Try on RunKit
Report malware