A simple JavaScript tree data structure with just arrays.
- 0.1.1 - Added README
- 0.1.0 - Finished update and delete
- 0.0.2 - Changed findThenAction from an Object prototype to function
- 0.0.1 - Children field not required when addChild + Insert partent after child
- *1.0.0 - (Wrong versioning) Initial commit with basic insert
$ npm install array-tree
var ArrayTree = require('array-tree');
var tree = new ArrayTree();
var tree = new ArrayTree({ childrenName: 'subItems' });
// tree.data = > [{ id: 1, subItems: [] }]
tree.addChild({ id: '3' });
// tree.data => [{ id: '3' }]
tree.addChild({ id: '4' }, '3');
// tree.data => [{ id: '3', children: [{ id: '4' }] }]
tree.addChild({ id: '4' }, '3');
tree.addChild({ id: '3' });
// tree.data => [{ id: '3', children: [{ id: '4' }] }]
tree.updateChild({ id: '3' }, { name: 'Jeff Lee' });
// tree.data => [{ id: '3', name: 'Jeff Lee', children: [{ id: '4' }] }]
tree.updateChild({ name: 'Jeff Lee' }, { name: 'Jeff' });
// tree.data => [{ id: '3', name: 'Jeff', children: [{ id: '4' }] }]
tree.removeChild({ id: '4' });
// return true
// tree.data => [{ id: '3', name: 'Jeff', children: [] }]
tree.search({ id: '4' });
// return false
tree.search({ id: '3' });
// return { id: '3', name: 'Jeff', children: [] }