You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
911 lines
45 KiB
911 lines
45 KiB
(function (global, factory) {
|
|
typeof exports === 'object' && typeof module !== 'undefined' ? factory(require('@angular/core'),require('@angular/cdk/tree'),require('@angular/material/core'),exports, require('@angular/cdk/tree'), require('@angular/core'), require('@angular/material/core'), require('@angular/cdk/coercion'), require('@angular/cdk/collections'), require('rxjs'), require('rxjs/operators')) :
|
|
typeof define === 'function' && define.amd ? define('@angular/material/tree', ['@angular/core','@angular/cdk/tree','@angular/material/core','exports', '@angular/cdk/tree', '@angular/core', '@angular/material/core', '@angular/cdk/coercion', '@angular/cdk/collections', 'rxjs', 'rxjs/operators'], factory) :
|
|
(global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global.ng.core,global.ng.cdk.tree,global.ng.material.core,(global.ng = global.ng || {}, global.ng.material = global.ng.material || {}, global.ng.material.tree = {}), global.ng.cdk.tree, global.ng.core, global.ng.material.core, global.ng.cdk.coercion, global.ng.cdk.collections, global.rxjs, global.rxjs.operators));
|
|
}(this, (function (ɵngcc0,ɵngcc1,ɵngcc2,exports, tree, core$1, core, coercion, collections, rxjs, operators) { 'use strict';
|
|
|
|
/*! *****************************************************************************
|
|
Copyright (c) Microsoft Corporation.
|
|
|
|
Permission to use, copy, modify, and/or distribute this software for any
|
|
purpose with or without fee is hereby granted.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
|
|
REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
|
|
AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
|
|
INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
|
|
LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
|
|
OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
|
|
PERFORMANCE OF THIS SOFTWARE.
|
|
***************************************************************************** */
|
|
/* global Reflect, Promise */
|
|
var extendStatics = function (d, b) {
|
|
extendStatics = Object.setPrototypeOf ||
|
|
({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
|
|
function (d, b) { for (var p in b)
|
|
if (Object.prototype.hasOwnProperty.call(b, p))
|
|
d[p] = b[p]; };
|
|
return extendStatics(d, b);
|
|
};
|
|
function __extends(d, b) {
|
|
if (typeof b !== "function" && b !== null)
|
|
throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
|
|
extendStatics(d, b);
|
|
function __() { this.constructor = d; }
|
|
d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
|
|
}
|
|
var __assign = function () {
|
|
__assign = Object.assign || function __assign(t) {
|
|
for (var s, i = 1, n = arguments.length; i < n; i++) {
|
|
s = arguments[i];
|
|
for (var p in s)
|
|
if (Object.prototype.hasOwnProperty.call(s, p))
|
|
t[p] = s[p];
|
|
}
|
|
return t;
|
|
};
|
|
return __assign.apply(this, arguments);
|
|
};
|
|
function __rest(s, e) {
|
|
var t = {};
|
|
for (var p in s)
|
|
if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)
|
|
t[p] = s[p];
|
|
if (s != null && typeof Object.getOwnPropertySymbols === "function")
|
|
for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {
|
|
if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))
|
|
t[p[i]] = s[p[i]];
|
|
}
|
|
return t;
|
|
}
|
|
function __decorate(decorators, target, key, desc) {
|
|
var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;
|
|
if (typeof Reflect === "object" && typeof Reflect.decorate === "function")
|
|
r = Reflect.decorate(decorators, target, key, desc);
|
|
else
|
|
for (var i = decorators.length - 1; i >= 0; i--)
|
|
if (d = decorators[i])
|
|
r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;
|
|
return c > 3 && r && Object.defineProperty(target, key, r), r;
|
|
}
|
|
function __param(paramIndex, decorator) {
|
|
return function (target, key) { decorator(target, key, paramIndex); };
|
|
}
|
|
function __metadata(metadataKey, metadataValue) {
|
|
if (typeof Reflect === "object" && typeof Reflect.metadata === "function")
|
|
return Reflect.metadata(metadataKey, metadataValue);
|
|
}
|
|
function __awaiter(thisArg, _arguments, P, generator) {
|
|
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
|
|
return new (P || (P = Promise))(function (resolve, reject) {
|
|
function fulfilled(value) { try {
|
|
step(generator.next(value));
|
|
}
|
|
catch (e) {
|
|
reject(e);
|
|
} }
|
|
function rejected(value) { try {
|
|
step(generator["throw"](value));
|
|
}
|
|
catch (e) {
|
|
reject(e);
|
|
} }
|
|
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
|
|
step((generator = generator.apply(thisArg, _arguments || [])).next());
|
|
});
|
|
}
|
|
function __generator(thisArg, body) {
|
|
var _ = { label: 0, sent: function () { if (t[0] & 1)
|
|
throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
|
|
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function () { return this; }), g;
|
|
function verb(n) { return function (v) { return step([n, v]); }; }
|
|
function step(op) {
|
|
if (f)
|
|
throw new TypeError("Generator is already executing.");
|
|
while (_)
|
|
try {
|
|
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done)
|
|
return t;
|
|
if (y = 0, t)
|
|
op = [op[0] & 2, t.value];
|
|
switch (op[0]) {
|
|
case 0:
|
|
case 1:
|
|
t = op;
|
|
break;
|
|
case 4:
|
|
_.label++;
|
|
return { value: op[1], done: false };
|
|
case 5:
|
|
_.label++;
|
|
y = op[1];
|
|
op = [0];
|
|
continue;
|
|
case 7:
|
|
op = _.ops.pop();
|
|
_.trys.pop();
|
|
continue;
|
|
default:
|
|
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
|
|
_ = 0;
|
|
continue;
|
|
}
|
|
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) {
|
|
_.label = op[1];
|
|
break;
|
|
}
|
|
if (op[0] === 6 && _.label < t[1]) {
|
|
_.label = t[1];
|
|
t = op;
|
|
break;
|
|
}
|
|
if (t && _.label < t[2]) {
|
|
_.label = t[2];
|
|
_.ops.push(op);
|
|
break;
|
|
}
|
|
if (t[2])
|
|
_.ops.pop();
|
|
_.trys.pop();
|
|
continue;
|
|
}
|
|
op = body.call(thisArg, _);
|
|
}
|
|
catch (e) {
|
|
op = [6, e];
|
|
y = 0;
|
|
}
|
|
finally {
|
|
f = t = 0;
|
|
}
|
|
if (op[0] & 5)
|
|
throw op[1];
|
|
return { value: op[0] ? op[1] : void 0, done: true };
|
|
}
|
|
}
|
|
var __createBinding = Object.create ? (function (o, m, k, k2) {
|
|
if (k2 === undefined)
|
|
k2 = k;
|
|
Object.defineProperty(o, k2, { enumerable: true, get: function () { return m[k]; } });
|
|
}) : (function (o, m, k, k2) {
|
|
if (k2 === undefined)
|
|
k2 = k;
|
|
o[k2] = m[k];
|
|
});
|
|
function __exportStar(m, o) {
|
|
for (var p in m)
|
|
if (p !== "default" && !Object.prototype.hasOwnProperty.call(o, p))
|
|
__createBinding(o, m, p);
|
|
}
|
|
function __values(o) {
|
|
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
|
|
if (m)
|
|
return m.call(o);
|
|
if (o && typeof o.length === "number")
|
|
return {
|
|
next: function () {
|
|
if (o && i >= o.length)
|
|
o = void 0;
|
|
return { value: o && o[i++], done: !o };
|
|
}
|
|
};
|
|
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
|
|
}
|
|
function __read(o, n) {
|
|
var m = typeof Symbol === "function" && o[Symbol.iterator];
|
|
if (!m)
|
|
return o;
|
|
var i = m.call(o), r, ar = [], e;
|
|
try {
|
|
while ((n === void 0 || n-- > 0) && !(r = i.next()).done)
|
|
ar.push(r.value);
|
|
}
|
|
catch (error) {
|
|
e = { error: error };
|
|
}
|
|
finally {
|
|
try {
|
|
if (r && !r.done && (m = i["return"]))
|
|
m.call(i);
|
|
}
|
|
finally {
|
|
if (e)
|
|
throw e.error;
|
|
}
|
|
}
|
|
return ar;
|
|
}
|
|
/** @deprecated */
|
|
function __spread() {
|
|
for (var ar = [], i = 0; i < arguments.length; i++)
|
|
ar = ar.concat(__read(arguments[i]));
|
|
return ar;
|
|
}
|
|
/** @deprecated */
|
|
function __spreadArrays() {
|
|
for (var s = 0, i = 0, il = arguments.length; i < il; i++)
|
|
s += arguments[i].length;
|
|
for (var r = Array(s), k = 0, i = 0; i < il; i++)
|
|
for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)
|
|
r[k] = a[j];
|
|
return r;
|
|
}
|
|
function __spreadArray(to, from, pack) {
|
|
if (pack || arguments.length === 2)
|
|
for (var i = 0, l = from.length, ar; i < l; i++) {
|
|
if (ar || !(i in from)) {
|
|
if (!ar)
|
|
ar = Array.prototype.slice.call(from, 0, i);
|
|
ar[i] = from[i];
|
|
}
|
|
}
|
|
return to.concat(ar || from);
|
|
}
|
|
function __await(v) {
|
|
return this instanceof __await ? (this.v = v, this) : new __await(v);
|
|
}
|
|
function __asyncGenerator(thisArg, _arguments, generator) {
|
|
if (!Symbol.asyncIterator)
|
|
throw new TypeError("Symbol.asyncIterator is not defined.");
|
|
var g = generator.apply(thisArg, _arguments || []), i, q = [];
|
|
return i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i;
|
|
function verb(n) { if (g[n])
|
|
i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }
|
|
function resume(n, v) { try {
|
|
step(g[n](v));
|
|
}
|
|
catch (e) {
|
|
settle(q[0][3], e);
|
|
} }
|
|
function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }
|
|
function fulfill(value) { resume("next", value); }
|
|
function reject(value) { resume("throw", value); }
|
|
function settle(f, v) { if (f(v), q.shift(), q.length)
|
|
resume(q[0][0], q[0][1]); }
|
|
}
|
|
function __asyncDelegator(o) {
|
|
var i, p;
|
|
return i = {}, verb("next"), verb("throw", function (e) { throw e; }), verb("return"), i[Symbol.iterator] = function () { return this; }, i;
|
|
function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === "return" } : f ? f(v) : v; } : f; }
|
|
}
|
|
function __asyncValues(o) {
|
|
if (!Symbol.asyncIterator)
|
|
throw new TypeError("Symbol.asyncIterator is not defined.");
|
|
var m = o[Symbol.asyncIterator], i;
|
|
return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i);
|
|
function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }
|
|
function settle(resolve, reject, d, v) { Promise.resolve(v).then(function (v) { resolve({ value: v, done: d }); }, reject); }
|
|
}
|
|
function __makeTemplateObject(cooked, raw) {
|
|
if (Object.defineProperty) {
|
|
Object.defineProperty(cooked, "raw", { value: raw });
|
|
}
|
|
else {
|
|
cooked.raw = raw;
|
|
}
|
|
return cooked;
|
|
}
|
|
;
|
|
var __setModuleDefault = Object.create ? (function (o, v) {
|
|
Object.defineProperty(o, "default", { enumerable: true, value: v });
|
|
}) : function (o, v) {
|
|
o["default"] = v;
|
|
};
|
|
function __importStar(mod) {
|
|
if (mod && mod.__esModule)
|
|
return mod;
|
|
var result = {};
|
|
if (mod != null)
|
|
for (var k in mod)
|
|
if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k))
|
|
__createBinding(result, mod, k);
|
|
__setModuleDefault(result, mod);
|
|
return result;
|
|
}
|
|
function __importDefault(mod) {
|
|
return (mod && mod.__esModule) ? mod : { default: mod };
|
|
}
|
|
function __classPrivateFieldGet(receiver, state, kind, f) {
|
|
if (kind === "a" && !f)
|
|
throw new TypeError("Private accessor was defined without a getter");
|
|
if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver))
|
|
throw new TypeError("Cannot read private member from an object whose class did not declare it");
|
|
return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
|
|
}
|
|
function __classPrivateFieldSet(receiver, state, value, kind, f) {
|
|
if (kind === "m")
|
|
throw new TypeError("Private method is not writable");
|
|
if (kind === "a" && !f)
|
|
throw new TypeError("Private accessor was defined without a setter");
|
|
if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver))
|
|
throw new TypeError("Cannot write private member to an object whose class did not declare it");
|
|
return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
|
|
}
|
|
|
|
var _MatTreeNodeBase = core.mixinTabIndex(core.mixinDisabled(tree.CdkTreeNode));
|
|
/**
|
|
* Wrapper for the CdkTree node with Material design styles.
|
|
*/
|
|
var MatTreeNode = /** @class */ (function (_super) {
|
|
__extends(MatTreeNode, _super);
|
|
function MatTreeNode(elementRef, tree, tabIndex) {
|
|
var _this = _super.call(this, elementRef, tree) || this;
|
|
_this.tabIndex = Number(tabIndex) || 0;
|
|
// The classes are directly added here instead of in the host property because classes on
|
|
// the host property are not inherited with View Engine. It is not set as a @HostBinding because
|
|
// it is not set by the time it's children nodes try to read the class from it.
|
|
// TODO: move to host after View Engine deprecation
|
|
elementRef.nativeElement.classList.add('mat-tree-node');
|
|
return _this;
|
|
}
|
|
// This is a workaround for https://github.com/angular/angular/issues/23091
|
|
// In aot mode, the lifecycle hooks from parent class are not called.
|
|
MatTreeNode.prototype.ngOnInit = function () {
|
|
_super.prototype.ngOnInit.call(this);
|
|
};
|
|
MatTreeNode.prototype.ngDoCheck = function () {
|
|
_super.prototype.ngDoCheck.call(this);
|
|
};
|
|
MatTreeNode.prototype.ngOnDestroy = function () {
|
|
_super.prototype.ngOnDestroy.call(this);
|
|
};
|
|
MatTreeNode.ɵfac = function MatTreeNode_Factory(t) { return new (t || MatTreeNode)(ɵngcc0.ɵɵdirectiveInject(ɵngcc0.ElementRef), ɵngcc0.ɵɵdirectiveInject(ɵngcc1.CdkTree), ɵngcc0.ɵɵinjectAttribute('tabindex')); };
|
|
MatTreeNode.ɵdir = /*@__PURE__*/ ɵngcc0.ɵɵdefineDirective({ type: MatTreeNode, selectors: [["mat-tree-node"]], inputs: { role: "role", disabled: "disabled", tabIndex: "tabIndex" }, exportAs: ["matTreeNode"], features: [ɵngcc0.ɵɵProvidersFeature([{ provide: tree.CdkTreeNode, useExisting: MatTreeNode }]), ɵngcc0.ɵɵInheritDefinitionFeature] });
|
|
(function () { (typeof ngDevMode === "undefined" || ngDevMode) && ɵngcc0.ɵsetClassMetadata(MatTreeNode, [{
|
|
type: core$1.Directive,
|
|
args: [{
|
|
selector: 'mat-tree-node',
|
|
exportAs: 'matTreeNode',
|
|
inputs: ['role', 'disabled', 'tabIndex'],
|
|
providers: [{ provide: tree.CdkTreeNode, useExisting: MatTreeNode }]
|
|
}]
|
|
}], function () { return [{ type: ɵngcc0.ElementRef }, { type: ɵngcc1.CdkTree }, { type: String, decorators: [{
|
|
type: core$1.Attribute,
|
|
args: ['tabindex']
|
|
}] }]; }, null); })();
|
|
return MatTreeNode;
|
|
}(_MatTreeNodeBase));
|
|
MatTreeNode.ctorParameters = function () { return [
|
|
{ type: core$1.ElementRef },
|
|
{ type: tree.CdkTree },
|
|
{ type: String, decorators: [{ type: core$1.Attribute, args: ['tabindex',] }] }
|
|
]; };
|
|
/**
|
|
* Wrapper for the CdkTree node definition with Material design styles.
|
|
* Captures the node's template and a when predicate that describes when this node should be used.
|
|
*/
|
|
var MatTreeNodeDef = /** @class */ (function (_super) {
|
|
__extends(MatTreeNodeDef, _super);
|
|
function MatTreeNodeDef() {
|
|
return _super !== null && _super.apply(this, arguments) || this;
|
|
}
|
|
MatTreeNodeDef.ɵfac = /*@__PURE__*/ function () { var ɵMatTreeNodeDef_BaseFactory; return function MatTreeNodeDef_Factory(t) { return (ɵMatTreeNodeDef_BaseFactory || (ɵMatTreeNodeDef_BaseFactory = ɵngcc0.ɵɵgetInheritedFactory(MatTreeNodeDef)))(t || MatTreeNodeDef); }; }();
|
|
MatTreeNodeDef.ɵdir = /*@__PURE__*/ ɵngcc0.ɵɵdefineDirective({ type: MatTreeNodeDef, selectors: [["", "matTreeNodeDef", ""]], inputs: { when: ["matTreeNodeDefWhen", "when"], data: ["matTreeNode", "data"] }, features: [ɵngcc0.ɵɵProvidersFeature([{ provide: tree.CdkTreeNodeDef, useExisting: MatTreeNodeDef }]), ɵngcc0.ɵɵInheritDefinitionFeature] });
|
|
(function () { (typeof ngDevMode === "undefined" || ngDevMode) && ɵngcc0.ɵsetClassMetadata(MatTreeNodeDef, [{
|
|
type: core$1.Directive,
|
|
args: [{
|
|
selector: '[matTreeNodeDef]',
|
|
inputs: [
|
|
'when: matTreeNodeDefWhen'
|
|
],
|
|
providers: [{ provide: tree.CdkTreeNodeDef, useExisting: MatTreeNodeDef }]
|
|
}]
|
|
}], null, { data: [{
|
|
type: core$1.Input,
|
|
args: ['matTreeNode']
|
|
}] }); })();
|
|
return MatTreeNodeDef;
|
|
}(tree.CdkTreeNodeDef));
|
|
MatTreeNodeDef.propDecorators = {
|
|
data: [{ type: core$1.Input, args: ['matTreeNode',] }]
|
|
};
|
|
/**
|
|
* Wrapper for the CdkTree nested node with Material design styles.
|
|
*/
|
|
var MatNestedTreeNode = /** @class */ (function (_super) {
|
|
__extends(MatNestedTreeNode, _super);
|
|
function MatNestedTreeNode(elementRef, tree, differs, tabIndex) {
|
|
var _this = _super.call(this, elementRef, tree, differs) || this;
|
|
_this._disabled = false;
|
|
_this.tabIndex = Number(tabIndex) || 0;
|
|
// The classes are directly added here instead of in the host property because classes on
|
|
// the host property are not inherited with View Engine. It is not set as a @HostBinding because
|
|
// it is not set by the time it's children nodes try to read the class from it.
|
|
// TODO: move to host after View Engine deprecation
|
|
elementRef.nativeElement.classList.add('mat-nested-tree-node');
|
|
return _this;
|
|
}
|
|
Object.defineProperty(MatNestedTreeNode.prototype, "disabled", {
|
|
/** Whether the node is disabled. */
|
|
get: function () { return this._disabled; },
|
|
set: function (value) { this._disabled = coercion.coerceBooleanProperty(value); },
|
|
enumerable: false,
|
|
configurable: true
|
|
});
|
|
Object.defineProperty(MatNestedTreeNode.prototype, "tabIndex", {
|
|
/** Tabindex for the node. */
|
|
get: function () { return this.disabled ? -1 : this._tabIndex; },
|
|
set: function (value) {
|
|
// If the specified tabIndex value is null or undefined, fall back to the default value.
|
|
this._tabIndex = value != null ? value : 0;
|
|
},
|
|
enumerable: false,
|
|
configurable: true
|
|
});
|
|
// This is a workaround for https://github.com/angular/angular/issues/19145
|
|
// In aot mode, the lifecycle hooks from parent class are not called.
|
|
// TODO(tinayuangao): Remove when the angular issue #19145 is fixed
|
|
MatNestedTreeNode.prototype.ngOnInit = function () {
|
|
_super.prototype.ngOnInit.call(this);
|
|
};
|
|
MatNestedTreeNode.prototype.ngDoCheck = function () {
|
|
_super.prototype.ngDoCheck.call(this);
|
|
};
|
|
MatNestedTreeNode.prototype.ngAfterContentInit = function () {
|
|
_super.prototype.ngAfterContentInit.call(this);
|
|
};
|
|
MatNestedTreeNode.prototype.ngOnDestroy = function () {
|
|
_super.prototype.ngOnDestroy.call(this);
|
|
};
|
|
MatNestedTreeNode.ɵfac = function MatNestedTreeNode_Factory(t) { return new (t || MatNestedTreeNode)(ɵngcc0.ɵɵdirectiveInject(ɵngcc0.ElementRef), ɵngcc0.ɵɵdirectiveInject(ɵngcc1.CdkTree), ɵngcc0.ɵɵdirectiveInject(ɵngcc0.IterableDiffers), ɵngcc0.ɵɵinjectAttribute('tabindex')); };
|
|
MatNestedTreeNode.ɵdir = /*@__PURE__*/ ɵngcc0.ɵɵdefineDirective({ type: MatNestedTreeNode, selectors: [["mat-nested-tree-node"]], inputs: { role: "role", disabled: "disabled", tabIndex: "tabIndex", node: ["matNestedTreeNode", "node"] }, exportAs: ["matNestedTreeNode"], features: [ɵngcc0.ɵɵProvidersFeature([
|
|
{ provide: tree.CdkNestedTreeNode, useExisting: MatNestedTreeNode },
|
|
{ provide: tree.CdkTreeNode, useExisting: MatNestedTreeNode },
|
|
{ provide: tree.CDK_TREE_NODE_OUTLET_NODE, useExisting: MatNestedTreeNode }
|
|
]), ɵngcc0.ɵɵInheritDefinitionFeature] });
|
|
(function () { (typeof ngDevMode === "undefined" || ngDevMode) && ɵngcc0.ɵsetClassMetadata(MatNestedTreeNode, [{
|
|
type: core$1.Directive,
|
|
args: [{
|
|
selector: 'mat-nested-tree-node',
|
|
exportAs: 'matNestedTreeNode',
|
|
inputs: ['role', 'disabled', 'tabIndex'],
|
|
providers: [
|
|
{ provide: tree.CdkNestedTreeNode, useExisting: MatNestedTreeNode },
|
|
{ provide: tree.CdkTreeNode, useExisting: MatNestedTreeNode },
|
|
{ provide: tree.CDK_TREE_NODE_OUTLET_NODE, useExisting: MatNestedTreeNode }
|
|
]
|
|
}]
|
|
}], function () { return [{ type: ɵngcc0.ElementRef }, { type: ɵngcc1.CdkTree }, { type: ɵngcc0.IterableDiffers }, { type: String, decorators: [{
|
|
type: core$1.Attribute,
|
|
args: ['tabindex']
|
|
}] }]; }, { disabled: [{
|
|
type: core$1.Input
|
|
}], tabIndex: [{
|
|
type: core$1.Input
|
|
}], node: [{
|
|
type: core$1.Input,
|
|
args: ['matNestedTreeNode']
|
|
}] }); })();
|
|
return MatNestedTreeNode;
|
|
}(tree.CdkNestedTreeNode));
|
|
MatNestedTreeNode.ctorParameters = function () { return [
|
|
{ type: core$1.ElementRef },
|
|
{ type: tree.CdkTree },
|
|
{ type: core$1.IterableDiffers },
|
|
{ type: String, decorators: [{ type: core$1.Attribute, args: ['tabindex',] }] }
|
|
]; };
|
|
MatNestedTreeNode.propDecorators = {
|
|
node: [{ type: core$1.Input, args: ['matNestedTreeNode',] }],
|
|
disabled: [{ type: core$1.Input }],
|
|
tabIndex: [{ type: core$1.Input }]
|
|
};
|
|
|
|
/**
|
|
* Wrapper for the CdkTree padding with Material design styles.
|
|
*/
|
|
var MatTreeNodePadding = /** @class */ (function (_super) {
|
|
__extends(MatTreeNodePadding, _super);
|
|
function MatTreeNodePadding() {
|
|
return _super !== null && _super.apply(this, arguments) || this;
|
|
}
|
|
Object.defineProperty(MatTreeNodePadding.prototype, "level", {
|
|
/** The level of depth of the tree node. The padding will be `level * indent` pixels. */
|
|
get: function () { return this._level; },
|
|
set: function (value) { this._setLevelInput(value); },
|
|
enumerable: false,
|
|
configurable: true
|
|
});
|
|
Object.defineProperty(MatTreeNodePadding.prototype, "indent", {
|
|
/** The indent for each level. Default number 40px from material design menu sub-menu spec. */
|
|
get: function () { return this._indent; },
|
|
set: function (indent) { this._setIndentInput(indent); },
|
|
enumerable: false,
|
|
configurable: true
|
|
});
|
|
MatTreeNodePadding.ɵfac = /*@__PURE__*/ function () { var ɵMatTreeNodePadding_BaseFactory; return function MatTreeNodePadding_Factory(t) { return (ɵMatTreeNodePadding_BaseFactory || (ɵMatTreeNodePadding_BaseFactory = ɵngcc0.ɵɵgetInheritedFactory(MatTreeNodePadding)))(t || MatTreeNodePadding); }; }();
|
|
MatTreeNodePadding.ɵdir = /*@__PURE__*/ ɵngcc0.ɵɵdefineDirective({ type: MatTreeNodePadding, selectors: [["", "matTreeNodePadding", ""]], inputs: { level: ["matTreeNodePadding", "level"], indent: ["matTreeNodePaddingIndent", "indent"] }, features: [ɵngcc0.ɵɵProvidersFeature([{ provide: tree.CdkTreeNodePadding, useExisting: MatTreeNodePadding }]), ɵngcc0.ɵɵInheritDefinitionFeature] });
|
|
(function () { (typeof ngDevMode === "undefined" || ngDevMode) && ɵngcc0.ɵsetClassMetadata(MatTreeNodePadding, [{
|
|
type: core$1.Directive,
|
|
args: [{
|
|
selector: '[matTreeNodePadding]',
|
|
providers: [{ provide: tree.CdkTreeNodePadding, useExisting: MatTreeNodePadding }]
|
|
}]
|
|
}], null, { level: [{
|
|
type: core$1.Input,
|
|
args: ['matTreeNodePadding']
|
|
}], indent: [{
|
|
type: core$1.Input,
|
|
args: ['matTreeNodePaddingIndent']
|
|
}] }); })();
|
|
return MatTreeNodePadding;
|
|
}(tree.CdkTreeNodePadding));
|
|
MatTreeNodePadding.propDecorators = {
|
|
level: [{ type: core$1.Input, args: ['matTreeNodePadding',] }],
|
|
indent: [{ type: core$1.Input, args: ['matTreeNodePaddingIndent',] }]
|
|
};
|
|
|
|
/**
|
|
* @license
|
|
* Copyright Google LLC All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by an MIT-style license that can be
|
|
* found in the LICENSE file at https://angular.io/license
|
|
*/
|
|
/**
|
|
* Outlet for nested CdkNode. Put `[matTreeNodeOutlet]` on a tag to place children dataNodes
|
|
* inside the outlet.
|
|
*/
|
|
var MatTreeNodeOutlet = /** @class */ (function () {
|
|
function MatTreeNodeOutlet(viewContainer, _node) {
|
|
this.viewContainer = viewContainer;
|
|
this._node = _node;
|
|
}
|
|
MatTreeNodeOutlet.ɵfac = function MatTreeNodeOutlet_Factory(t) { return new (t || MatTreeNodeOutlet)(ɵngcc0.ɵɵdirectiveInject(ɵngcc0.ViewContainerRef), ɵngcc0.ɵɵdirectiveInject(tree.CDK_TREE_NODE_OUTLET_NODE, 8)); };
|
|
MatTreeNodeOutlet.ɵdir = /*@__PURE__*/ ɵngcc0.ɵɵdefineDirective({ type: MatTreeNodeOutlet, selectors: [["", "matTreeNodeOutlet", ""]], features: [ɵngcc0.ɵɵProvidersFeature([{
|
|
provide: tree.CdkTreeNodeOutlet,
|
|
useExisting: MatTreeNodeOutlet
|
|
}])] });
|
|
(function () { (typeof ngDevMode === "undefined" || ngDevMode) && ɵngcc0.ɵsetClassMetadata(MatTreeNodeOutlet, [{
|
|
type: core$1.Directive,
|
|
args: [{
|
|
selector: '[matTreeNodeOutlet]',
|
|
providers: [{
|
|
provide: tree.CdkTreeNodeOutlet,
|
|
useExisting: MatTreeNodeOutlet
|
|
}]
|
|
}]
|
|
}], function () { return [{ type: ɵngcc0.ViewContainerRef }, { type: undefined, decorators: [{
|
|
type: core$1.Inject,
|
|
args: [tree.CDK_TREE_NODE_OUTLET_NODE]
|
|
}, {
|
|
type: core$1.Optional
|
|
}] }]; }, null); })();
|
|
return MatTreeNodeOutlet;
|
|
}());
|
|
MatTreeNodeOutlet.ctorParameters = function () { return [
|
|
{ type: core$1.ViewContainerRef },
|
|
{ type: undefined, decorators: [{ type: core$1.Inject, args: [tree.CDK_TREE_NODE_OUTLET_NODE,] }, { type: core$1.Optional }] }
|
|
]; };
|
|
|
|
/**
|
|
* Wrapper for the CdkTable with Material design styles.
|
|
*/
|
|
var MatTree = /** @class */ (function (_super) {
|
|
__extends(MatTree, _super);
|
|
function MatTree() {
|
|
return _super !== null && _super.apply(this, arguments) || this;
|
|
}
|
|
MatTree.ɵfac = /*@__PURE__*/ function () { var ɵMatTree_BaseFactory; return function MatTree_Factory(t) { return (ɵMatTree_BaseFactory || (ɵMatTree_BaseFactory = ɵngcc0.ɵɵgetInheritedFactory(MatTree)))(t || MatTree); }; }();
|
|
MatTree.ɵcmp = /*@__PURE__*/ ɵngcc0.ɵɵdefineComponent({ type: MatTree, selectors: [["mat-tree"]], viewQuery: function MatTree_Query(rf, ctx) { if (rf & 1) {
|
|
ɵngcc0.ɵɵviewQuery(MatTreeNodeOutlet, 7);
|
|
} if (rf & 2) {
|
|
var _t;
|
|
ɵngcc0.ɵɵqueryRefresh(_t = ɵngcc0.ɵɵloadQuery()) && (ctx._nodeOutlet = _t.first);
|
|
} }, hostAttrs: ["role", "tree", 1, "mat-tree", "cdk-tree"], exportAs: ["matTree"], features: [ɵngcc0.ɵɵProvidersFeature([{ provide: tree.CdkTree, useExisting: MatTree }]), ɵngcc0.ɵɵInheritDefinitionFeature], decls: 1, vars: 0, consts: [["matTreeNodeOutlet", ""]], template: function MatTree_Template(rf, ctx) { if (rf & 1) {
|
|
ɵngcc0.ɵɵelementContainer(0, 0);
|
|
} }, directives: [MatTreeNodeOutlet], styles: [".mat-tree{display:block}.mat-tree-node{display:flex;align-items:center;flex:1;word-wrap:break-word}.mat-nested-tree-node{border-bottom-width:0}\n"], encapsulation: 2 });
|
|
(function () { (typeof ngDevMode === "undefined" || ngDevMode) && ɵngcc0.ɵsetClassMetadata(MatTree, [{
|
|
type: core$1.Component,
|
|
args: [{
|
|
selector: 'mat-tree',
|
|
exportAs: 'matTree',
|
|
template: "<ng-container matTreeNodeOutlet></ng-container>",
|
|
host: {
|
|
// The 'cdk-tree' class needs to be included here because classes set in the host in the
|
|
// parent class are not inherited with View Engine. The 'cdk-tree' class in CdkTreeNode has
|
|
// to be set in the host because:
|
|
// if it is set as a @HostBinding it is not set by the time the tree nodes try to read the
|
|
// class from it.
|
|
// the ElementRef is not available in the constructor so the class can't be applied directly
|
|
// without a breaking constructor change.
|
|
'class': 'mat-tree cdk-tree',
|
|
'role': 'tree'
|
|
},
|
|
encapsulation: core$1.ViewEncapsulation.None,
|
|
// See note on CdkTree for explanation on why this uses the default change detection strategy.
|
|
// tslint:disable-next-line:validate-decorators
|
|
changeDetection: core$1.ChangeDetectionStrategy.Default,
|
|
providers: [{ provide: tree.CdkTree, useExisting: MatTree }],
|
|
styles: [".mat-tree{display:block}.mat-tree-node{display:flex;align-items:center;flex:1;word-wrap:break-word}.mat-nested-tree-node{border-bottom-width:0}\n"]
|
|
}]
|
|
}], null, { _nodeOutlet: [{
|
|
type: core$1.ViewChild,
|
|
args: [MatTreeNodeOutlet, { static: true }]
|
|
}] }); })();
|
|
return MatTree;
|
|
}(tree.CdkTree));
|
|
MatTree.propDecorators = {
|
|
_nodeOutlet: [{ type: core$1.ViewChild, args: [MatTreeNodeOutlet, { static: true },] }]
|
|
};
|
|
|
|
/**
|
|
* Wrapper for the CdkTree's toggle with Material design styles.
|
|
*/
|
|
// tslint:disable-next-line: coercion-types
|
|
var MatTreeNodeToggle = /** @class */ (function (_super) {
|
|
__extends(MatTreeNodeToggle, _super);
|
|
function MatTreeNodeToggle() {
|
|
return _super !== null && _super.apply(this, arguments) || this;
|
|
}
|
|
Object.defineProperty(MatTreeNodeToggle.prototype, "recursive", {
|
|
get: function () { return this._recursive; },
|
|
set: function (value) {
|
|
// TODO: when we remove support for ViewEngine, change this setter to an input
|
|
// alias in the decorator metadata.
|
|
this._recursive = coercion.coerceBooleanProperty(value);
|
|
},
|
|
enumerable: false,
|
|
configurable: true
|
|
});
|
|
MatTreeNodeToggle.ɵfac = /*@__PURE__*/ function () { var ɵMatTreeNodeToggle_BaseFactory; return function MatTreeNodeToggle_Factory(t) { return (ɵMatTreeNodeToggle_BaseFactory || (ɵMatTreeNodeToggle_BaseFactory = ɵngcc0.ɵɵgetInheritedFactory(MatTreeNodeToggle)))(t || MatTreeNodeToggle); }; }();
|
|
MatTreeNodeToggle.ɵdir = /*@__PURE__*/ ɵngcc0.ɵɵdefineDirective({ type: MatTreeNodeToggle, selectors: [["", "matTreeNodeToggle", ""]], inputs: { recursive: ["matTreeNodeToggleRecursive", "recursive"] }, features: [ɵngcc0.ɵɵProvidersFeature([{ provide: tree.CdkTreeNodeToggle, useExisting: MatTreeNodeToggle }]), ɵngcc0.ɵɵInheritDefinitionFeature] });
|
|
(function () { (typeof ngDevMode === "undefined" || ngDevMode) && ɵngcc0.ɵsetClassMetadata(MatTreeNodeToggle, [{
|
|
type: core$1.Directive,
|
|
args: [{
|
|
selector: '[matTreeNodeToggle]',
|
|
providers: [{ provide: tree.CdkTreeNodeToggle, useExisting: MatTreeNodeToggle }]
|
|
}]
|
|
}], null, { recursive: [{
|
|
type: core$1.Input,
|
|
args: ['matTreeNodeToggleRecursive']
|
|
}] }); })();
|
|
return MatTreeNodeToggle;
|
|
}(tree.CdkTreeNodeToggle));
|
|
MatTreeNodeToggle.propDecorators = {
|
|
recursive: [{ type: core$1.Input, args: ['matTreeNodeToggleRecursive',] }]
|
|
};
|
|
|
|
/**
|
|
* @license
|
|
* Copyright Google LLC All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by an MIT-style license that can be
|
|
* found in the LICENSE file at https://angular.io/license
|
|
*/
|
|
var MAT_TREE_DIRECTIVES = [
|
|
MatNestedTreeNode,
|
|
MatTreeNodeDef,
|
|
MatTreeNodePadding,
|
|
MatTreeNodeToggle,
|
|
MatTree,
|
|
MatTreeNode,
|
|
MatTreeNodeOutlet
|
|
];
|
|
var MatTreeModule = /** @class */ (function () {
|
|
function MatTreeModule() {
|
|
}
|
|
MatTreeModule.ɵfac = function MatTreeModule_Factory(t) { return new (t || MatTreeModule)(); };
|
|
MatTreeModule.ɵmod = /*@__PURE__*/ ɵngcc0.ɵɵdefineNgModule({ type: MatTreeModule });
|
|
MatTreeModule.ɵinj = /*@__PURE__*/ ɵngcc0.ɵɵdefineInjector({ imports: [[tree.CdkTreeModule, core.MatCommonModule], ɵngcc2.MatCommonModule] });
|
|
(function () { (typeof ngDevMode === "undefined" || ngDevMode) && ɵngcc0.ɵsetClassMetadata(MatTreeModule, [{
|
|
type: core$1.NgModule,
|
|
args: [{
|
|
imports: [tree.CdkTreeModule, core.MatCommonModule],
|
|
exports: [core.MatCommonModule, MAT_TREE_DIRECTIVES],
|
|
declarations: MAT_TREE_DIRECTIVES
|
|
}]
|
|
}], function () { return []; }, null); })();
|
|
(function () { (typeof ngJitMode === "undefined" || ngJitMode) && ɵngcc0.ɵɵsetNgModuleScope(MatTreeModule, { declarations: [MatNestedTreeNode, MatTreeNodeDef, MatTreeNodePadding, MatTreeNodeToggle, MatTree, MatTreeNode, MatTreeNodeOutlet], imports: [ɵngcc1.CdkTreeModule, ɵngcc2.MatCommonModule], exports: [ɵngcc2.MatCommonModule, MatNestedTreeNode, MatTreeNodeDef, MatTreeNodePadding, MatTreeNodeToggle, MatTree, MatTreeNode, MatTreeNodeOutlet] }); })();
|
|
return MatTreeModule;
|
|
}());
|
|
|
|
/**
|
|
* Tree flattener to convert a normal type of node to node with children & level information.
|
|
* Transform nested nodes of type `T` to flattened nodes of type `F`.
|
|
*
|
|
* For example, the input data of type `T` is nested, and contains its children data:
|
|
* SomeNode: {
|
|
* key: 'Fruits',
|
|
* children: [
|
|
* NodeOne: {
|
|
* key: 'Apple',
|
|
* },
|
|
* NodeTwo: {
|
|
* key: 'Pear',
|
|
* }
|
|
* ]
|
|
* }
|
|
* After flattener flatten the tree, the structure will become
|
|
* SomeNode: {
|
|
* key: 'Fruits',
|
|
* expandable: true,
|
|
* level: 1
|
|
* },
|
|
* NodeOne: {
|
|
* key: 'Apple',
|
|
* expandable: false,
|
|
* level: 2
|
|
* },
|
|
* NodeTwo: {
|
|
* key: 'Pear',
|
|
* expandable: false,
|
|
* level: 2
|
|
* }
|
|
* and the output flattened type is `F` with additional information.
|
|
*/
|
|
var MatTreeFlattener = /** @class */ (function () {
|
|
function MatTreeFlattener(transformFunction, getLevel, isExpandable, getChildren) {
|
|
this.transformFunction = transformFunction;
|
|
this.getLevel = getLevel;
|
|
this.isExpandable = isExpandable;
|
|
this.getChildren = getChildren;
|
|
}
|
|
MatTreeFlattener.prototype._flattenNode = function (node, level, resultNodes, parentMap) {
|
|
var _this = this;
|
|
var flatNode = this.transformFunction(node, level);
|
|
resultNodes.push(flatNode);
|
|
if (this.isExpandable(flatNode)) {
|
|
var childrenNodes = this.getChildren(node);
|
|
if (childrenNodes) {
|
|
if (Array.isArray(childrenNodes)) {
|
|
this._flattenChildren(childrenNodes, level, resultNodes, parentMap);
|
|
}
|
|
else {
|
|
childrenNodes.pipe(operators.take(1)).subscribe(function (children) {
|
|
_this._flattenChildren(children, level, resultNodes, parentMap);
|
|
});
|
|
}
|
|
}
|
|
}
|
|
return resultNodes;
|
|
};
|
|
MatTreeFlattener.prototype._flattenChildren = function (children, level, resultNodes, parentMap) {
|
|
var _this = this;
|
|
children.forEach(function (child, index) {
|
|
var childParentMap = parentMap.slice();
|
|
childParentMap.push(index != children.length - 1);
|
|
_this._flattenNode(child, level + 1, resultNodes, childParentMap);
|
|
});
|
|
};
|
|
/**
|
|
* Flatten a list of node type T to flattened version of node F.
|
|
* Please note that type T may be nested, and the length of `structuredData` may be different
|
|
* from that of returned list `F[]`.
|
|
*/
|
|
MatTreeFlattener.prototype.flattenNodes = function (structuredData) {
|
|
var _this = this;
|
|
var resultNodes = [];
|
|
structuredData.forEach(function (node) { return _this._flattenNode(node, 0, resultNodes, []); });
|
|
return resultNodes;
|
|
};
|
|
/**
|
|
* Expand flattened node with current expansion status.
|
|
* The returned list may have different length.
|
|
*/
|
|
MatTreeFlattener.prototype.expandFlattenedNodes = function (nodes, treeControl) {
|
|
var _this = this;
|
|
var results = [];
|
|
var currentExpand = [];
|
|
currentExpand[0] = true;
|
|
nodes.forEach(function (node) {
|
|
var expand = true;
|
|
for (var i = 0; i <= _this.getLevel(node); i++) {
|
|
expand = expand && currentExpand[i];
|
|
}
|
|
if (expand) {
|
|
results.push(node);
|
|
}
|
|
if (_this.isExpandable(node)) {
|
|
currentExpand[_this.getLevel(node) + 1] = treeControl.isExpanded(node);
|
|
}
|
|
});
|
|
return results;
|
|
};
|
|
return MatTreeFlattener;
|
|
}());
|
|
/**
|
|
* Data source for flat tree.
|
|
* The data source need to handle expansion/collapsion of the tree node and change the data feed
|
|
* to `MatTree`.
|
|
* The nested tree nodes of type `T` are flattened through `MatTreeFlattener`, and converted
|
|
* to type `F` for `MatTree` to consume.
|
|
*/
|
|
var MatTreeFlatDataSource = /** @class */ (function (_super) {
|
|
__extends(MatTreeFlatDataSource, _super);
|
|
function MatTreeFlatDataSource(_treeControl, _treeFlattener, initialData) {
|
|
var _this = _super.call(this) || this;
|
|
_this._treeControl = _treeControl;
|
|
_this._treeFlattener = _treeFlattener;
|
|
_this._flattenedData = new rxjs.BehaviorSubject([]);
|
|
_this._expandedData = new rxjs.BehaviorSubject([]);
|
|
_this._data = new rxjs.BehaviorSubject([]);
|
|
if (initialData) {
|
|
// Assign the data through the constructor to ensure that all of the logic is executed.
|
|
_this.data = initialData;
|
|
}
|
|
return _this;
|
|
}
|
|
Object.defineProperty(MatTreeFlatDataSource.prototype, "data", {
|
|
get: function () { return this._data.value; },
|
|
set: function (value) {
|
|
this._data.next(value);
|
|
this._flattenedData.next(this._treeFlattener.flattenNodes(this.data));
|
|
this._treeControl.dataNodes = this._flattenedData.value;
|
|
},
|
|
enumerable: false,
|
|
configurable: true
|
|
});
|
|
MatTreeFlatDataSource.prototype.connect = function (collectionViewer) {
|
|
var _this = this;
|
|
return rxjs.merge(collectionViewer.viewChange, this._treeControl.expansionModel.changed, this._flattenedData).pipe(operators.map(function () {
|
|
_this._expandedData.next(_this._treeFlattener.expandFlattenedNodes(_this._flattenedData.value, _this._treeControl));
|
|
return _this._expandedData.value;
|
|
}));
|
|
};
|
|
MatTreeFlatDataSource.prototype.disconnect = function () {
|
|
// no op
|
|
};
|
|
return MatTreeFlatDataSource;
|
|
}(collections.DataSource));
|
|
|
|
/**
|
|
* Data source for nested tree.
|
|
*
|
|
* The data source for nested tree doesn't have to consider node flattener, or the way to expand
|
|
* or collapse. The expansion/collapsion will be handled by TreeControl and each non-leaf node.
|
|
*/
|
|
var MatTreeNestedDataSource = /** @class */ (function (_super) {
|
|
__extends(MatTreeNestedDataSource, _super);
|
|
function MatTreeNestedDataSource() {
|
|
var _this = _super.apply(this, __spreadArray([], __read(arguments))) || this;
|
|
_this._data = new rxjs.BehaviorSubject([]);
|
|
return _this;
|
|
}
|
|
Object.defineProperty(MatTreeNestedDataSource.prototype, "data", {
|
|
/**
|
|
* Data for the nested tree
|
|
*/
|
|
get: function () { return this._data.value; },
|
|
set: function (value) { this._data.next(value); },
|
|
enumerable: false,
|
|
configurable: true
|
|
});
|
|
MatTreeNestedDataSource.prototype.connect = function (collectionViewer) {
|
|
var _this = this;
|
|
return rxjs.merge.apply(void 0, [collectionViewer.viewChange, this._data]).pipe(operators.map(function () { return _this.data; }));
|
|
};
|
|
MatTreeNestedDataSource.prototype.disconnect = function () {
|
|
// no op
|
|
};
|
|
return MatTreeNestedDataSource;
|
|
}(collections.DataSource));
|
|
|
|
/**
|
|
* @license
|
|
* Copyright Google LLC All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by an MIT-style license that can be
|
|
* found in the LICENSE file at https://angular.io/license
|
|
*/
|
|
|
|
/**
|
|
* Generated bundle index. Do not edit.
|
|
*/
|
|
|
|
exports.MatNestedTreeNode = MatNestedTreeNode;
|
|
exports.MatTree = MatTree;
|
|
exports.MatTreeFlatDataSource = MatTreeFlatDataSource;
|
|
exports.MatTreeFlattener = MatTreeFlattener;
|
|
exports.MatTreeModule = MatTreeModule;
|
|
exports.MatTreeNestedDataSource = MatTreeNestedDataSource;
|
|
exports.MatTreeNode = MatTreeNode;
|
|
exports.MatTreeNodeDef = MatTreeNodeDef;
|
|
exports.MatTreeNodeOutlet = MatTreeNodeOutlet;
|
|
exports.MatTreeNodePadding = MatTreeNodePadding;
|
|
exports.MatTreeNodeToggle = MatTreeNodeToggle;
|
|
|
|
Object.defineProperty(exports, '__esModule', { value: true });
|
|
|
|
})));
|
|
|
|
//# sourceMappingURL=material-tree.umd.js.map
|