2016-05-24 16:57:51 -04:00
|
|
|
import {Tree, TreeNode} from '../../src/utils/tree';
|
2016-05-20 16:56:52 -04:00
|
|
|
|
|
|
|
describe('tree', () => {
|
|
|
|
it("should return the root of the tree", () => {
|
|
|
|
const t = new Tree<any>(new TreeNode<number>(1, []));
|
|
|
|
expect(t.root).toEqual(1);
|
|
|
|
});
|
|
|
|
|
|
|
|
it("should return the parent of a node", () => {
|
|
|
|
const t = new Tree<any>(new TreeNode<number>(1, [new TreeNode<number>(2, [])]));
|
|
|
|
expect(t.parent(1)).toEqual(null);
|
|
|
|
expect(t.parent(2)).toEqual(1);
|
|
|
|
});
|
|
|
|
|
|
|
|
it("should return the children of a node", () => {
|
|
|
|
const t = new Tree<any>(new TreeNode<number>(1, [new TreeNode<number>(2, [])]));
|
|
|
|
expect(t.children(1)).toEqual([2]);
|
|
|
|
expect(t.children(2)).toEqual([]);
|
|
|
|
});
|
|
|
|
|
|
|
|
it("should return the first child of a node", () => {
|
|
|
|
const t = new Tree<any>(new TreeNode<number>(1, [new TreeNode<number>(2, [])]));
|
|
|
|
expect(t.firstChild(1)).toEqual(2);
|
|
|
|
expect(t.firstChild(2)).toEqual(null);
|
|
|
|
});
|
|
|
|
|
2016-05-24 16:46:50 -04:00
|
|
|
it("should return the siblings of a node", () => {
|
|
|
|
const t = new Tree<any>(new TreeNode<number>(1, [new TreeNode<number>(2, []), new TreeNode<number>(3, [])]));
|
|
|
|
expect(t.siblings(2)).toEqual([3]);
|
|
|
|
expect(t.siblings(1)).toEqual([]);
|
|
|
|
});
|
|
|
|
|
2016-05-20 16:56:52 -04:00
|
|
|
it("should return the path to the root", () => {
|
|
|
|
const t = new Tree<any>(new TreeNode<number>(1, [new TreeNode<number>(2, [])]));
|
|
|
|
expect(t.pathFromRoot(2)).toEqual([1, 2]);
|
|
|
|
});
|
|
|
|
|
|
|
|
describe("contains", () => {
|
|
|
|
it("should work", () => {
|
|
|
|
const tree = new Tree<any>(
|
|
|
|
new TreeNode<number>(1, [new TreeNode<number>(2, []), new TreeNode<number>(3, [])]));
|
|
|
|
const subtree1 = new Tree<any>(new TreeNode<number>(1, []));
|
|
|
|
const subtree2 = new Tree<any>(new TreeNode<number>(1, [new TreeNode<number>(2, [])]));
|
|
|
|
const subtree3 = new Tree<any>(new TreeNode<number>(1, [new TreeNode<number>(3, [])]));
|
|
|
|
const notSubtree1 = new Tree<any>(new TreeNode<number>(1, [new TreeNode<number>(4, [])]));
|
|
|
|
const notSubtree2 = new Tree<any>(
|
|
|
|
new TreeNode<number>(1, [new TreeNode<number>(2, [new TreeNode<number>(4, [])])]));
|
|
|
|
|
|
|
|
expect(tree.contains(subtree1)).toEqual(true);
|
|
|
|
expect(tree.contains(subtree2)).toEqual(true);
|
|
|
|
expect(tree.contains(subtree3)).toEqual(true);
|
|
|
|
expect(tree.contains(notSubtree1)).toEqual(false);
|
|
|
|
expect(tree.contains(notSubtree2)).toEqual(false);
|
|
|
|
});
|
|
|
|
});
|
|
|
|
});
|