UNPKG

vat-tree

Version:

A tree data structure with ordered branches

53 lines (34 loc) 1.14 kB
var assert = require('assert'); var Node = require('..').Node; describe('Tree', function () { describe('handle children', function () { it('Add child', function () { var tree = new Node({}, true); tree.addChild(new Node()) assert.equal(tree.hasChildren(), true); }); it('Add children\'s children', function () { var tree = new Node({}, true); var child = new Node() tree.addChild(child) child.addChild(new Node()) assert.equal(child.hasChildren(), true); }); it('Get next sibling', function () { var tree = new Node({}, true); var child1 = new Node() var child2 = new Node() tree.addChild(child1) tree.addChild(child2) assert.equal(child1.getNextSibling(), child2); }); it('Add child returns child', function () { var tree = new Node({}, true); var child1 = new Node() var child2 = new Node() tree.addChild(child1) var myReturnedVal = tree.addChild(child2) assert.equal(child1.getNextSibling(), myReturnedVal); }); }); });