@coolon/angular-ui-powerups 11.0.0-alpha.5 → 11.0.0-alpha.6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (9) hide show
  1. package/bundles/coolon-angular-ui-powerups.umd.js +19 -24
  2. package/bundles/coolon-angular-ui-powerups.umd.js.map +1 -1
  3. package/bundles/coolon-angular-ui-powerups.umd.min.js +1 -1
  4. package/bundles/coolon-angular-ui-powerups.umd.min.js.map +1 -1
  5. package/esm2015/lib/components/tree-table/decorated-tree-node.js +19 -22
  6. package/esm2015/lib/components/tree-table/decorated-tree-node.js.map +1 -1
  7. package/fesm2015/coolon-angular-ui-powerups.js +19 -22
  8. package/fesm2015/coolon-angular-ui-powerups.js.map +1 -1
  9. package/package.json +1 -1
package/esm2015/lib/components/tree-table/decorated-tree-node.js CHANGED
@@ -8,26 +8,26 @@ class DecoratedTreeNodeMixin {
8
8
  this.node = node;
9
9
  }
10
10
  get decoratedSelf() {
11
- return this.memoize("decoratedSelf", () => {
11
+ return this.memoize('decoratedSelf', () => {
12
12
  return this.parent ? this.parent.children.find(child => child.node === this.node) : DecoratedTreeNode.createRoot(this.node);
13
13
  });
14
14
  }
15
15
  get children() {
16
- return this.memoize("children", () => {
16
+ return this.memoize('children', () => {
17
17
  return this.node.children ? this.node.children.map(child => {
18
18
  return Mixin.createProxy(child, new DecoratedTreeNodeMixin(this.decoratedSelf, child));
19
19
  }) : [];
20
20
  });
21
21
  }
22
22
  descendants() {
23
- return this.memoize("descendants", () => {
23
+ return this.memoize('descendants', () => {
24
24
  const result = [];
25
25
  this.visitDescendants(child => result.push(child));
26
26
  return result;
27
27
  });
28
28
  }
29
29
  selfAndDescendants() {
30
- return this.memoize("selfAndDescendants", () => {
30
+ return this.memoize('selfAndDescendants', () => {
31
31
  const result = [];
32
32
  this.visitSelfAndDescendants(child => result.push(child));
33
33
  return result;
@@ -90,27 +90,24 @@ class DecoratedTreeNodeMixin {
90
90
  });
91
91
  }
92
92
  ancestorsAndSelf() {
93
- return this.memoize("ancestorsAndSelf", () => {
93
+ return this.memoize('ancestorsAndSelf', () => {
94
94
  return this.ancestors().concat([(this.decoratedSelf)]);
95
95
  });
96
96
  }
97
97
  pathToParent(parent) {
98
- return this.memoize("pathToParent", () => {
99
- if (this.node === parent.node) {
100
- return [];
101
- }
102
- else if (this.parent) {
103
- return this.parent.pathToParent(parent).concat([this.parent]);
104
- }
105
- else {
106
- throw new Error('parent is not an ancestor');
107
- }
108
- });
98
+ if (this.node === parent.node) {
99
+ return [];
100
+ }
101
+ else if (this.parent) {
102
+ const pathToParent = this.parent.pathToParent(parent);
103
+ return pathToParent.concat([this.parent]);
104
+ }
105
+ else {
106
+ throw new Error('parent is not an ancestor');
107
+ }
109
108
  }
110
109
  pathToParentAndSelf(parent) {
111
- return this.memoize("pathToParentAndSelf", () => {
112
- return this.pathToParent(parent).concat([this.decoratedSelf]);
113
- });
110
+ return this.pathToParent(parent).concat([this.decoratedSelf]);
114
111
  }
115
112
  isRoot() {
116
113
  return !this.parent;
@@ -122,18 +119,18 @@ class DecoratedTreeNodeMixin {
122
119
  return !this.isRoot() && this.node.children.length < 1;
123
120
  }
124
121
  hasChildren() {
125
- return this.node.children.length > 0;
122
+ return this.node.children && this.node.children.length > 0;
126
123
  }
127
124
  depthFromParent(parent) {
128
125
  return this.pathToParent(parent).length;
129
126
  }
130
127
  treeDepth() {
131
- return this.memoize("treeDepth", () => {
128
+ return this.memoize('treeDepth', () => {
132
129
  return 1 + this.descendants().map(child => child.depthFromParent(this)).reduce((prev, current) => Math.max(prev, current));
133
130
  });
134
131
  }
135
132
  flatten() {
136
- return this.memoize("flatten", () => {
133
+ return this.memoize('flatten', () => {
137
134
  return this.flattenInto([]);
138
135
  });
139
136
  }
package/esm2015/lib/components/tree-table/decorated-tree-node.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"decorated-tree-node.js","sourceRoot":"","sources":["../../../../../../../libs/angular-ui-powerups/src/lib/components/tree-table/decorated-tree-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAa,MAAM,gBAAgB,CAAC;AACnD,OAAO,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AAErD,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,yBAAyB,EAAW,MAAM,mBAAmB,CAAC;AAEvE,MAAM,sBAAsB;IAE1B,YAAqB,MAAwC,EAAW,IAAO;QAA1D,WAAM,GAAN,MAAM,CAAkC;QAAW,SAAI,GAAJ,IAAI,CAAG;IAC/E,CAAC;IAED,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,EAAE;YACxC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9H,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,EAAE;YACnC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;gBACzD,OAAO,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,sBAAsB,CAAI,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC,CAAC;YAC5F,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACV,CAAC,CAAC,CAAC;IACL,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,EAAE;YACtC,MAAM,MAAM,GAAG,EAAE,CAAC;YAClB,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACnD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;IACL,CAAC;IAED,kBAAkB;QAChB,OAAO,IAAI,CAAC,OAAO,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7C,MAAM,MAAM,GAAG,EAAE,CAAC;YAClB,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC1D,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;IACL,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzC,IAAI,IAAI,CAAC,MAAM,EAAE;gBACf,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;aACtD;iBAAM;gBACL,OAAO,EAAE,CAAC;aACX;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,EAAE;YACxC,IAAI,IAAI,CAAC,MAAM,EAAE;gBACf,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;aACvD;iBAAM;gBACL,OAAO,EAAE,CAAC;aACX;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAChG,CAAC;IAED,YAAY;QACV,OAAO,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACxF,CAAC;IAES,OAAO;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,EAAE;YAClC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;YAClF,MAAM,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,EAAE,0CAA0C,CAAC,CAAC;YAC1E,OAAO,OAAO,CAAC;QACjB,CAAC,CAAC,CAAC;IACL,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,EAAE;YACtC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAClF,CAAC,CAAC,CAAC;IACL,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAC7D,CAAC;IAED,IAAI,CAAC,SAA0C;QAC7C,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,SAAS,CAAC,CAAC;IAC/C,CAAC;IAED,MAAM,CAAC,SAA0C;QAC/C,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,SAAS,CAAC,CAAC;IACjD,CAAC;IAED,WAAW,CAAC,KAA6B;QACvC,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,GAAG,EAAE;YACpC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,CAAC,CAAC,CAAC;IACL,CAAC;IAED,gBAAgB;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3C,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC,CAAC,CAAA;IACJ,CAAC;IAED,YAAY,CAAC,MAA4B;QACvC,OAAO,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,EAAE;YACvC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,EAAE;gBAC7B,OAAO,EAAE,CAAC;aACX;iBAAM,IAAI,IAAI,CAAC,MAAM,EAAE;gBACtB,OAAO,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;aAC/D;iBAAM;gBACL,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;aAC9C;QACH,CAAC,CAAC,CAAA;IACJ,CAAC;IAED,mBAAmB,CAAC,MAAM;QACxB,OAAO,IAAI,CAAC,OAAO,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC9C,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC,CAAC;IACL,CAAC;IAED,MAAM;QACJ,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;IACtB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;IACnD,CAAC;IAED,MAAM;QACJ,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACzD,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACvC,CAAC;IAED,eAAe,CAAC,MAAM;QACpB,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;IAC1C,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,GAAG,EAAE;YACpC,OAAO,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;QAC7H,CAAC,CAAC,CAAA;IACJ,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,EAAE;YAClC,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAA;IACJ,CAAC;IAED,KAAK,CAA0C,OAAU;QACvD,OAAO,CAAC,KAAK,CAAC,IAAmC,CAAC,CAAC;QACnD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,aAAa,CAA0C,OAAU;QAC/D,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QACrD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,uBAAuB,CAAC,QAA4C;QAClE,IAAI,CAAC,KAAK,CAAC,IAAI,yBAAyB,CAAC,IAAI,CAAuB,QAAQ,CAAC,CAAC,CAAC;IACjF,CAAC;IAED,gBAAgB,CAAC,QAA4C;QAC3D,IAAI,CAAC,aAAa,CAAC,IAAI,yBAAyB,CAAC,IAAI,CAAuB,QAAQ,CAAC,CAAC,CAAC;IACzF,CAAC;IAGS,OAAO,CAAI,QAAgB,EAAE,OAAgB;QACrD,MAAM,GAAG,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;YACtB,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC;SACvB;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;CAEF;AAID,MAAM,KAAW,iBAAiB,CAIjC;AAJD,WAAiB,iBAAiB;IAChC,SAAgB,UAAU,CAAwB,IAAO;QACvD,OAAO,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,sBAAsB,CAAI,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;IACjF,CAAC;IAFe,4BAAU,aAEzB,CAAA;AACH,CAAC,EAJgB,iBAAiB,KAAjB,iBAAiB,QAIjC","sourcesContent":["import { assert, Predicate } from '@coolon/pectin';\nimport { Mixin } from '@coolon/typescript-utilities';\nimport { Memoize } from '@typescript-plus/fast-memoize-decorator/dist/src';\nimport * as _ from 'lodash';\nimport { TreeNode } from './tree-node';\nimport { SelfAndDescendantsVisitor, Visitor } from './visitable.class';\n\nclass DecoratedTreeNodeMixin<T extends TreeNode<T>> {\n\n constructor(readonly parent: DecoratedTreeNode<T> | undefined, readonly node: T) {\n }\n\n get decoratedSelf(): DecoratedTreeNode<T> {\n return this.memoize(\"decoratedSelf\", () => {\n return this.parent ? this.parent.children.find(child => child.node === this.node) : DecoratedTreeNode.createRoot(this.node);\n });\n }\n\n get children(): DecoratedTreeNode<T>[] {\n return this.memoize(\"children\", () => {\n return this.node.children ? this.node.children.map(child => {\n return Mixin.createProxy(child, new DecoratedTreeNodeMixin<T>(this.decoratedSelf, child));\n }) : [];\n });\n }\n\n descendants(): DecoratedTreeNode<T>[] {\n return this.memoize(\"descendants\", () => {\n const result = [];\n this.visitDescendants(child => result.push(child));\n return result;\n });\n }\n\n selfAndDescendants(): DecoratedTreeNode<T>[] {\n return this.memoize(\"selfAndDescendants\", () => {\n const result = [];\n this.visitSelfAndDescendants(child => result.push(child));\n return result;\n });\n }\n\n siblingsBefore(): DecoratedTreeNode<T>[] {\n return this.memoize('siblingsBefore', () => {\n if (this.parent) {\n return this.parent.children.slice(0, this.myIndex());\n } else {\n return [];\n }\n });\n }\n\n siblingsAfter(): DecoratedTreeNode<T>[] {\n return this.memoize('siblingsAfter', () => {\n if (this.parent) {\n return this.parent.children.slice(1 + this.myIndex());\n } else {\n return [];\n }\n });\n }\n\n siblings(): DecoratedTreeNode<T>[] {\n return this.memoize('siblings', () => [].concat(this.siblingsBefore(), this.siblingsAfter()));\n }\n\n isFirstChild(): boolean {\n return this.memoize('isFirstChild', () => this.parent ? this.myIndex() === 0 : false);\n }\n\n protected myIndex() {\n return this.memoize('myIndex', () => {\n const myIndex = this.parent.children.findIndex(child => child.node === this.node);\n assert.isTruthy(myIndex >= 0, 'illegal state, expected index to be >= 0');\n return myIndex;\n });\n }\n\n isLastChild(): boolean {\n return this.memoize('isLastChild', () => {\n return this.parent ? this.myIndex() === this.parent.children.length - 1 : false;\n });\n }\n\n hasSiblings(): boolean {\n return this.parent ? this.node.children.length > 1 : false;\n }\n\n find(predicate: Predicate<DecoratedTreeNode<T>>): DecoratedTreeNode<T> {\n return _.find(this.descendants(), predicate);\n }\n\n select(predicate: Predicate<DecoratedTreeNode<T>>): DecoratedTreeNode<T>[] {\n return _.filter(this.descendants(), predicate);\n }\n\n flattenInto(array: DecoratedTreeNode<T>[]): DecoratedTreeNode<T>[] {\n this.visitSelfAndDescendants(child => array.push(child));\n return array;\n }\n\n ancestors(): DecoratedTreeNode<T>[] {\n return this.memoize('ancestors', () => {\n return this.parent ? this.parent.ancestors().concat([this.parent]) : [];\n });\n }\n\n ancestorsAndSelf(): DecoratedTreeNode<T>[] {\n return this.memoize(\"ancestorsAndSelf\", () => {\n return this.ancestors().concat([(this.decoratedSelf)]);\n })\n }\n\n pathToParent(parent: DecoratedTreeNode<T>): DecoratedTreeNode<T>[] {\n return this.memoize(\"pathToParent\", () => {\n if (this.node === parent.node) {\n return [];\n } else if (this.parent) {\n return this.parent.pathToParent(parent).concat([this.parent]);\n } else {\n throw new Error('parent is not an ancestor');\n }\n })\n }\n\n pathToParentAndSelf(parent): DecoratedTreeNode<T>[] {\n return this.memoize(\"pathToParentAndSelf\", () => {\n return this.pathToParent(parent).concat([this.decoratedSelf]);\n });\n }\n\n isRoot(): boolean {\n return !this.parent;\n }\n\n get depth(): number {\n return this.isRoot() ? 0 : this.parent.depth + 1;\n }\n\n isLeaf(): boolean {\n return !this.isRoot() && this.node.children.length < 1;\n }\n\n hasChildren(): boolean {\n return this.node.children.length > 0;\n }\n\n depthFromParent(parent): number {\n return this.pathToParent(parent).length;\n }\n\n treeDepth(): number {\n return this.memoize(\"treeDepth\", () => {\n return 1 + this.descendants().map(child => child.depthFromParent(this)).reduce((prev, current) => Math.max(prev, current));\n })\n }\n\n flatten(): DecoratedTreeNode<T>[] {\n return this.memoize(\"flatten\", () => {\n return this.flattenInto([]);\n })\n }\n\n visit<V extends Visitor<DecoratedTreeNode<T>>>(visitor: V): V {\n visitor.visit(this as any as DecoratedTreeNode<T>);\n return visitor;\n }\n\n visitChildren<V extends Visitor<DecoratedTreeNode<T>>>(visitor: V): V {\n _.each(this.children, child => child.visit(visitor));\n return visitor;\n }\n\n visitSelfAndDescendants(callback: (it: DecoratedTreeNode<T>) => void) {\n this.visit(new SelfAndDescendantsVisitor.Each<DecoratedTreeNode<T>>(callback));\n }\n\n visitDescendants(callback: (it: DecoratedTreeNode<T>) => void) {\n this.visitChildren(new SelfAndDescendantsVisitor.Each<DecoratedTreeNode<T>>(callback));\n }\n\n\n protected memoize<V>(property: string, factory: () => V) {\n const key = `__${property}`;\n if (_.isNil(this[key])) {\n this[key] = factory();\n }\n return this[key];\n }\n\n}\n\nexport type DecoratedTreeNode<T extends TreeNode<T>> = Omit<T, 'children'> & DecoratedTreeNodeMixin<T>;\n\nexport namespace DecoratedTreeNode {\n export function createRoot<T extends TreeNode<T>>(node: T): DecoratedTreeNode<T> {\n return Mixin.createProxy(node, new DecoratedTreeNodeMixin<T>(undefined, node));\n }\n}\n"]}
1
+ {"version":3,"file":"decorated-tree-node.js","sourceRoot":"","sources":["../../../../../../../libs/angular-ui-powerups/src/lib/components/tree-table/decorated-tree-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAa,MAAM,gBAAgB,CAAC;AACnD,OAAO,EAAE,KAAK,EAAE,MAAM,8BAA8B,CAAC;AACrD,OAAO,KAAK,CAAC,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,yBAAyB,EAAW,MAAM,mBAAmB,CAAC;AAEvE,MAAM,sBAAsB;IAE1B,YAAqB,MAAwC,EAAW,IAAO;QAA1D,WAAM,GAAN,MAAM,CAAkC;QAAW,SAAI,GAAJ,IAAI,CAAG;IAC/E,CAAC;IAED,IAAI,aAAa;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,EAAE;YACxC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9H,CAAC,CAAC,CAAC;IACL,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,EAAE;YACnC,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;gBACzD,OAAO,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,sBAAsB,CAAI,IAAI,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC,CAAC;YAC5F,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACV,CAAC,CAAC,CAAC;IACL,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,EAAE;YACtC,MAAM,MAAM,GAAG,EAAE,CAAC;YAClB,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YACnD,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;IACL,CAAC;IAED,kBAAkB;QAChB,OAAO,IAAI,CAAC,OAAO,CAAC,oBAAoB,EAAE,GAAG,EAAE;YAC7C,MAAM,MAAM,GAAG,EAAE,CAAC;YAClB,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAC1D,OAAO,MAAM,CAAC;QAChB,CAAC,CAAC,CAAC;IACL,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACzC,IAAI,IAAI,CAAC,MAAM,EAAE;gBACf,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;aACtD;iBAAM;gBACL,OAAO,EAAE,CAAC;aACX;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,aAAa;QACX,OAAO,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,GAAG,EAAE;YACxC,IAAI,IAAI,CAAC,MAAM,EAAE;gBACf,OAAO,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;aACvD;iBAAM;gBACL,OAAO,EAAE,CAAC;aACX;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAChG,CAAC;IAED,YAAY;QACV,OAAO,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACxF,CAAC;IAES,OAAO;QACf,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,EAAE;YAClC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;YAClF,MAAM,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,EAAE,0CAA0C,CAAC,CAAC;YAC1E,OAAO,OAAO,CAAC;QACjB,CAAC,CAAC,CAAC;IACL,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,EAAE,GAAG,EAAE;YACtC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAClF,CAAC,CAAC,CAAC;IACL,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAC7D,CAAC;IAED,IAAI,CAAC,SAA0C;QAC7C,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,SAAS,CAAC,CAAC;IAC/C,CAAC;IAED,MAAM,CAAC,SAA0C;QAC/C,OAAO,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,SAAS,CAAC,CAAC;IACjD,CAAC;IAED,WAAW,CAAC,KAA6B;QACvC,IAAI,CAAC,uBAAuB,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACzD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,GAAG,EAAE;YACpC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,CAAC,CAAC,CAAC;IACL,CAAC;IAED,gBAAgB;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC3C,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;IACL,CAAC;IAED,YAAY,CAAC,MAA4B;QACvC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,EAAE;YAC7B,OAAO,EAAE,CAAC;SACX;aAAM,IAAI,IAAI,CAAC,MAAM,EAAE;YACtB,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YACtD,OAAO,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;SAC3C;aAAM;YACL,MAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;SAC9C;IACH,CAAC;IAED,mBAAmB,CAAC,MAAM;QACxB,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,MAAM;QACJ,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;IACtB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC;IACnD,CAAC;IAED,MAAM;QACJ,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IACzD,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7D,CAAC;IAED,eAAe,CAAC,MAAM;QACpB,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC;IAC1C,CAAC;IAED,SAAS;QACP,OAAO,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE,GAAG,EAAE;YACpC,OAAO,CAAC,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC;QAC7H,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,EAAE;YAClC,OAAO,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAA0C,OAAU;QACvD,OAAO,CAAC,KAAK,CAAC,IAAmC,CAAC,CAAC;QACnD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,aAAa,CAA0C,OAAU;QAC/D,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QACrD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,uBAAuB,CAAC,QAA4C;QAClE,IAAI,CAAC,KAAK,CAAC,IAAI,yBAAyB,CAAC,IAAI,CAAuB,QAAQ,CAAC,CAAC,CAAC;IACjF,CAAC;IAED,gBAAgB,CAAC,QAA4C;QAC3D,IAAI,CAAC,aAAa,CAAC,IAAI,yBAAyB,CAAC,IAAI,CAAuB,QAAQ,CAAC,CAAC,CAAC;IACzF,CAAC;IAGS,OAAO,CAAI,QAAgB,EAAE,OAAgB;QACrD,MAAM,GAAG,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE;YACtB,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC;SACvB;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;CAEF;AAID,MAAM,KAAW,iBAAiB,CAIjC;AAJD,WAAiB,iBAAiB;IAChC,SAAgB,UAAU,CAAwB,IAAO;QACvD,OAAO,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,sBAAsB,CAAI,SAAS,EAAE,IAAI,CAAC,CAAC,CAAC;IACjF,CAAC;IAFe,4BAAU,aAEzB,CAAA;AACH,CAAC,EAJgB,iBAAiB,KAAjB,iBAAiB,QAIjC","sourcesContent":["import { assert, Predicate } from '@coolon/pectin';\nimport { Mixin } from '@coolon/typescript-utilities';\nimport * as _ from 'lodash';\nimport { TreeNode } from './tree-node';\nimport { SelfAndDescendantsVisitor, Visitor } from './visitable.class';\n\nclass DecoratedTreeNodeMixin<T extends TreeNode<T>> {\n\n constructor(readonly parent: DecoratedTreeNode<T> | undefined, readonly node: T) {\n }\n\n get decoratedSelf(): DecoratedTreeNode<T> {\n return this.memoize('decoratedSelf', () => {\n return this.parent ? this.parent.children.find(child => child.node === this.node) : DecoratedTreeNode.createRoot(this.node);\n });\n }\n\n get children(): DecoratedTreeNode<T>[] {\n return this.memoize('children', () => {\n return this.node.children ? this.node.children.map(child => {\n return Mixin.createProxy(child, new DecoratedTreeNodeMixin<T>(this.decoratedSelf, child));\n }) : [];\n });\n }\n\n descendants(): DecoratedTreeNode<T>[] {\n return this.memoize('descendants', () => {\n const result = [];\n this.visitDescendants(child => result.push(child));\n return result;\n });\n }\n\n selfAndDescendants(): DecoratedTreeNode<T>[] {\n return this.memoize('selfAndDescendants', () => {\n const result = [];\n this.visitSelfAndDescendants(child => result.push(child));\n return result;\n });\n }\n\n siblingsBefore(): DecoratedTreeNode<T>[] {\n return this.memoize('siblingsBefore', () => {\n if (this.parent) {\n return this.parent.children.slice(0, this.myIndex());\n } else {\n return [];\n }\n });\n }\n\n siblingsAfter(): DecoratedTreeNode<T>[] {\n return this.memoize('siblingsAfter', () => {\n if (this.parent) {\n return this.parent.children.slice(1 + this.myIndex());\n } else {\n return [];\n }\n });\n }\n\n siblings(): DecoratedTreeNode<T>[] {\n return this.memoize('siblings', () => [].concat(this.siblingsBefore(), this.siblingsAfter()));\n }\n\n isFirstChild(): boolean {\n return this.memoize('isFirstChild', () => this.parent ? this.myIndex() === 0 : false);\n }\n\n protected myIndex() {\n return this.memoize('myIndex', () => {\n const myIndex = this.parent.children.findIndex(child => child.node === this.node);\n assert.isTruthy(myIndex >= 0, 'illegal state, expected index to be >= 0');\n return myIndex;\n });\n }\n\n isLastChild(): boolean {\n return this.memoize('isLastChild', () => {\n return this.parent ? this.myIndex() === this.parent.children.length - 1 : false;\n });\n }\n\n hasSiblings(): boolean {\n return this.parent ? this.node.children.length > 1 : false;\n }\n\n find(predicate: Predicate<DecoratedTreeNode<T>>): DecoratedTreeNode<T> {\n return _.find(this.descendants(), predicate);\n }\n\n select(predicate: Predicate<DecoratedTreeNode<T>>): DecoratedTreeNode<T>[] {\n return _.filter(this.descendants(), predicate);\n }\n\n flattenInto(array: DecoratedTreeNode<T>[]): DecoratedTreeNode<T>[] {\n this.visitSelfAndDescendants(child => array.push(child));\n return array;\n }\n\n ancestors(): DecoratedTreeNode<T>[] {\n return this.memoize('ancestors', () => {\n return this.parent ? this.parent.ancestors().concat([this.parent]) : [];\n });\n }\n\n ancestorsAndSelf(): DecoratedTreeNode<T>[] {\n return this.memoize('ancestorsAndSelf', () => {\n return this.ancestors().concat([(this.decoratedSelf)]);\n });\n }\n\n pathToParent(parent: DecoratedTreeNode<T>): DecoratedTreeNode<T>[] {\n if (this.node === parent.node) {\n return [];\n } else if (this.parent) {\n const pathToParent = this.parent.pathToParent(parent);\n return pathToParent.concat([this.parent]);\n } else {\n throw new Error('parent is not an ancestor');\n }\n }\n\n pathToParentAndSelf(parent): DecoratedTreeNode<T>[] {\n return this.pathToParent(parent).concat([this.decoratedSelf]);\n }\n\n isRoot(): boolean {\n return !this.parent;\n }\n\n get depth(): number {\n return this.isRoot() ? 0 : this.parent.depth + 1;\n }\n\n isLeaf(): boolean {\n return !this.isRoot() && this.node.children.length < 1;\n }\n\n hasChildren(): boolean {\n return this.node.children && this.node.children.length > 0;\n }\n\n depthFromParent(parent): number {\n return this.pathToParent(parent).length;\n }\n\n treeDepth(): number {\n return this.memoize('treeDepth', () => {\n return 1 + this.descendants().map(child => child.depthFromParent(this)).reduce((prev, current) => Math.max(prev, current));\n });\n }\n\n flatten(): DecoratedTreeNode<T>[] {\n return this.memoize('flatten', () => {\n return this.flattenInto([]);\n });\n }\n\n visit<V extends Visitor<DecoratedTreeNode<T>>>(visitor: V): V {\n visitor.visit(this as any as DecoratedTreeNode<T>);\n return visitor;\n }\n\n visitChildren<V extends Visitor<DecoratedTreeNode<T>>>(visitor: V): V {\n _.each(this.children, child => child.visit(visitor));\n return visitor;\n }\n\n visitSelfAndDescendants(callback: (it: DecoratedTreeNode<T>) => void) {\n this.visit(new SelfAndDescendantsVisitor.Each<DecoratedTreeNode<T>>(callback));\n }\n\n visitDescendants(callback: (it: DecoratedTreeNode<T>) => void) {\n this.visitChildren(new SelfAndDescendantsVisitor.Each<DecoratedTreeNode<T>>(callback));\n }\n\n\n protected memoize<V>(property: string, factory: () => V) {\n const key = `__${property}`;\n if (_.isNil(this[key])) {\n this[key] = factory();\n }\n return this[key];\n }\n\n}\n\nexport type DecoratedTreeNode<T extends TreeNode<T>> = Omit<T, 'children'> & DecoratedTreeNodeMixin<T>;\n\nexport namespace DecoratedTreeNode {\n export function createRoot<T extends TreeNode<T>>(node: T): DecoratedTreeNode<T> {\n return Mixin.createProxy(node, new DecoratedTreeNodeMixin<T>(undefined, node));\n }\n}\n"]}
package/fesm2015/coolon-angular-ui-powerups.js CHANGED
@@ -3095,26 +3095,26 @@ class DecoratedTreeNodeMixin {
3095
3095
  this.node = node;
3096
3096
  }
3097
3097
  get decoratedSelf() {
3098
- return this.memoize("decoratedSelf", () => {
3098
+ return this.memoize('decoratedSelf', () => {
3099
3099
  return this.parent ? this.parent.children.find(child => child.node === this.node) : DecoratedTreeNode.createRoot(this.node);
3100
3100
  });
3101
3101
  }
3102
3102
  get children() {
3103
- return this.memoize("children", () => {
3103
+ return this.memoize('children', () => {
3104
3104
  return this.node.children ? this.node.children.map(child => {
3105
3105
  return Mixin.createProxy(child, new DecoratedTreeNodeMixin(this.decoratedSelf, child));
3106
3106
  }) : [];
3107
3107
  });
3108
3108
  }
3109
3109
  descendants() {
3110
- return this.memoize("descendants", () => {
3110
+ return this.memoize('descendants', () => {
3111
3111
  const result = [];
3112
3112
  this.visitDescendants(child => result.push(child));
3113
3113
  return result;
3114
3114
  });
3115
3115
  }
3116
3116
  selfAndDescendants() {
3117
- return this.memoize("selfAndDescendants", () => {
3117
+ return this.memoize('selfAndDescendants', () => {
3118
3118
  const result = [];
3119
3119
  this.visitSelfAndDescendants(child => result.push(child));
3120
3120
  return result;
@@ -3177,27 +3177,24 @@ class DecoratedTreeNodeMixin {
3177
3177
  });
3178
3178
  }
3179
3179
  ancestorsAndSelf() {
3180
- return this.memoize("ancestorsAndSelf", () => {
3180
+ return this.memoize('ancestorsAndSelf', () => {
3181
3181
  return this.ancestors().concat([(this.decoratedSelf)]);
3182
3182
  });
3183
3183
  }
3184
3184
  pathToParent(parent) {
3185
- return this.memoize("pathToParent", () => {
3186
- if (this.node === parent.node) {
3187
- return [];
3188
- }
3189
- else if (this.parent) {
3190
- return this.parent.pathToParent(parent).concat([this.parent]);
3191
- }
3192
- else {
3193
- throw new Error('parent is not an ancestor');
3194
- }
3195
- });
3185
+ if (this.node === parent.node) {
3186
+ return [];
3187
+ }
3188
+ else if (this.parent) {
3189
+ const pathToParent = this.parent.pathToParent(parent);
3190
+ return pathToParent.concat([this.parent]);
3191
+ }
3192
+ else {
3193
+ throw new Error('parent is not an ancestor');
3194
+ }
3196
3195
  }
3197
3196
  pathToParentAndSelf(parent) {
3198
- return this.memoize("pathToParentAndSelf", () => {
3199
- return this.pathToParent(parent).concat([this.decoratedSelf]);
3200
- });
3197
+ return this.pathToParent(parent).concat([this.decoratedSelf]);
3201
3198
  }
3202
3199
  isRoot() {
3203
3200
  return !this.parent;
@@ -3209,18 +3206,18 @@ class DecoratedTreeNodeMixin {
3209
3206
  return !this.isRoot() && this.node.children.length < 1;
3210
3207
  }
3211
3208
  hasChildren() {
3212
- return this.node.children.length > 0;
3209
+ return this.node.children && this.node.children.length > 0;
3213
3210
  }
3214
3211
  depthFromParent(parent) {
3215
3212
  return this.pathToParent(parent).length;
3216
3213
  }
3217
3214
  treeDepth() {
3218
- return this.memoize("treeDepth", () => {
3215
+ return this.memoize('treeDepth', () => {
3219
3216
  return 1 + this.descendants().map(child => child.depthFromParent(this)).reduce((prev, current) => Math.max(prev, current));
3220
3217
  });
3221
3218
  }
3222
3219
  flatten() {
3223
- return this.memoize("flatten", () => {
3220
+ return this.memoize('flatten', () => {
3224
3221
  return this.flattenInto([]);
3225
3222
  });
3226
3223
  }