@angular/cdk 7.1.1 → 7.2.0

package/bundles/cdk-tree.umd.min.js.map

@@ -1 +1 @@
-{"version":3,"file":"cdk-tree.umd.min.js","sources":["../../node_modules/tslib/tslib.es6.js","../../src/cdk/tree/tree-errors.ts","../../src/cdk/tree/control/base-tree-control.ts","../../src/cdk/tree/control/flat-tree-control.ts","../../src/cdk/tree/control/nested-tree-control.ts","../../src/cdk/tree/node.ts","../../src/cdk/tree/outlet.ts","../../src/cdk/tree/tree.ts","../../src/cdk/tree/nested-node.ts","../../src/cdk/tree/padding.ts","../../src/cdk/tree/toggle.ts","../../src/cdk/tree/tree-module.ts"],"sourcesContent":["/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation. All rights reserved.\r\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\r\nthis file except in compliance with the License. You may obtain a copy of the\r\nLicense at http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\r\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\r\nMERCHANTABLITY OR NON-INFRINGEMENT.\r\n\r\nSee the Apache Version 2.0 License for specific language governing permissions\r\nand limitations under the License.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) if (e.indexOf(p[i]) < 0)\r\n            t[p[i]] = s[p[i]];\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    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;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : new P(function (resolve) { resolve(result.value); }).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\n            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;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport function __exportStar(m, exports) {\r\n    for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}\r\n\r\nexport function __values(o) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\r\n    if (m) return m.call(o);\r\n    return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    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); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    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; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    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);\r\n    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); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\r\n    result.default = mod;\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\n/**\n * Returns an error to be thrown when there is no usable data.\n * @docs-private\n */\nexport function getTreeNoValidDataSourceError() {\n  return Error(`A valid data source must be provided.`);\n}\n\n/**\n * Returns an error to be thrown when there are multiple nodes that are missing a when function.\n * @docs-private\n */\nexport function getTreeMultipleDefaultNodeDefsError() {\n  return Error(`There can only be one default row without a when predicate function.`);\n}\n\n/**\n * Returns an error to be thrown when there are no matching node defs for a particular set of data.\n * @docs-private\n */\nexport function getTreeMissingMatchingNodeDefError() {\n  return Error(`Could not find a matching node definition for the provided node data.`);\n}\n\n/**\n * Returns an error to be thrown when there are tree control.\n * @docs-private\n */\nexport function getTreeControlMissingError() {\n  return Error(`Could not find a tree control for the tree.`);\n}\n\n/**\n * Returns an error to be thrown when tree control did not implement functions for flat/nested node.\n * @docs-private\n */\nexport function getTreeControlFunctionsMissingError() {\n  return Error(`Could not find functions for nested/flat tree in tree control.`);\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\nimport {SelectionModel} from '@angular/cdk/collections';\nimport {Observable} from 'rxjs';\nimport {TreeControl} from './tree-control';\n\n/** Base tree control. It has basic toggle/expand/collapse operations on a single data node. */\nexport abstract class BaseTreeControl<T> implements TreeControl<T> {\n\n  /** Gets a list of descendent data nodes of a subtree rooted at given data node recursively. */\n  abstract getDescendants(dataNode: T): T[];\n\n  /** Expands all data nodes in the tree. */\n  abstract expandAll(): void;\n\n  /** Saved data node for `expandAll` action. */\n  dataNodes: T[];\n\n  /** A selection model with multi-selection to track expansion status. */\n  expansionModel: SelectionModel<T> = new SelectionModel<T>(true);\n\n  /** Get depth of a given data node, return the level number. This is for flat tree node. */\n  getLevel: (dataNode: T) => number;\n\n  /**\n   * Whether the data node is expandable. Returns true if expandable.\n   * This is for flat tree node.\n   */\n  isExpandable: (dataNode: T) => boolean;\n\n  /** Gets a stream that emits whenever the given data node's children change. */\n  getChildren: (dataNode: T) => (Observable<T[]> | T[]);\n\n  /** Toggles one single data node's expanded/collapsed state. */\n  toggle(dataNode: T): void {\n    this.expansionModel.toggle(dataNode);\n  }\n\n  /** Expands one single data node. */\n  expand(dataNode: T): void {\n    this.expansionModel.select(dataNode);\n  }\n\n  /** Collapses one single data node. */\n  collapse(dataNode: T): void {\n    this.expansionModel.deselect(dataNode);\n  }\n\n  /** Whether a given data node is expanded or not. Returns true if the data node is expanded. */\n  isExpanded(dataNode: T): boolean {\n    return this.expansionModel.isSelected(dataNode);\n  }\n\n  /** Toggles a subtree rooted at `node` recursively. */\n  toggleDescendants(dataNode: T): void {\n    this.expansionModel.isSelected(dataNode)\n        ? this.collapseDescendants(dataNode)\n        : this.expandDescendants(dataNode);\n  }\n\n  /** Collapse all dataNodes in the tree. */\n  collapseAll(): void {\n    this.expansionModel.clear();\n  }\n\n  /** Expands a subtree rooted at given data node recursively. */\n  expandDescendants(dataNode: T): void {\n    let toBeProcessed = [dataNode];\n    toBeProcessed.push(...this.getDescendants(dataNode));\n    this.expansionModel.select(...toBeProcessed);\n  }\n\n  /** Collapses a subtree rooted at given data node recursively. */\n  collapseDescendants(dataNode: T): void {\n    let toBeProcessed = [dataNode];\n    toBeProcessed.push(...this.getDescendants(dataNode));\n    this.expansionModel.deselect(...toBeProcessed);\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {BaseTreeControl} from './base-tree-control';\n\n/** Flat tree control. Able to expand/collapse a subtree recursively for flattened tree. */\nexport class FlatTreeControl<T> extends BaseTreeControl<T> {\n\n  /** Construct with flat tree data node functions getLevel and isExpandable. */\n  constructor(public getLevel: (dataNode: T) => number,\n              public isExpandable: (dataNode: T) => boolean) {\n    super();\n  }\n\n  /**\n   * Gets a list of the data node's subtree of descendent data nodes.\n   *\n   * To make this working, the `dataNodes` of the TreeControl must be flattened tree nodes\n   * with correct levels.\n   */\n  getDescendants(dataNode: T): T[] {\n    const startIndex = this.dataNodes.indexOf(dataNode);\n    const results: T[] = [];\n\n    // Goes through flattened tree nodes in the `dataNodes` array, and get all descendants.\n    // The level of descendants of a tree node must be greater than the level of the given\n    // tree node.\n    // If we reach a node whose level is equal to the level of the tree node, we hit a sibling.\n    // If we reach a node whose level is greater than the level of the tree node, we hit a\n    // sibling of an ancestor.\n    for (let i = startIndex + 1;\n        i < this.dataNodes.length && this.getLevel(dataNode) < this.getLevel(this.dataNodes[i]);\n        i++) {\n      results.push(this.dataNodes[i]);\n    }\n    return results;\n  }\n\n  /**\n   * Expands all data nodes in the tree.\n   *\n   * To make this working, the `dataNodes` variable of the TreeControl must be set to all flattened\n   * data nodes of the tree.\n   */\n  expandAll(): void {\n    this.expansionModel.select(...this.dataNodes);\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\nimport {Observable} from 'rxjs';\nimport {take} from 'rxjs/operators';\nimport {BaseTreeControl} from './base-tree-control';\n\n/** Nested tree control. Able to expand/collapse a subtree recursively for NestedNode type. */\nexport class NestedTreeControl<T> extends BaseTreeControl<T> {\n\n  /** Construct with nested tree function getChildren. */\n  constructor(public getChildren: (dataNode: T) => (Observable<T[]> | T[])) {\n    super();\n  }\n\n  /**\n   * Expands all dataNodes in the tree.\n   *\n   * To make this working, the `dataNodes` variable of the TreeControl must be set to all root level\n   * data nodes of the tree.\n   */\n  expandAll(): void {\n    this.expansionModel.clear();\n    const allNodes = this.dataNodes.reduce((accumulator: T[], dataNode) =>\n        [...accumulator, ...this.getDescendants(dataNode), dataNode], []);\n    this.expansionModel.select(...allNodes);\n  }\n\n  /** Gets a list of descendant dataNodes of a subtree rooted at given data node recursively. */\n  getDescendants(dataNode: T): T[] {\n    const descendants: T[] = [];\n\n    this._getDescendants(descendants, dataNode);\n    // Remove the node itself\n    return descendants.splice(1);\n  }\n\n  /** A helper function to get descendants recursively. */\n  protected _getDescendants(descendants: T[], dataNode: T): void {\n    descendants.push(dataNode);\n    const childrenNodes = this.getChildren(dataNode);\n    if (Array.isArray(childrenNodes)) {\n      childrenNodes.forEach((child: T) => this._getDescendants(descendants, child));\n    } else if (childrenNodes instanceof Observable) {\n      childrenNodes.pipe(take(1)).subscribe(children => {\n        children.forEach((child: T) => this._getDescendants(descendants, child));\n      });\n    }\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {Directive, TemplateRef} from '@angular/core';\n\n\n/** Context provided to the tree node component. */\nexport class CdkTreeNodeOutletContext<T> {\n  /** Data for the node. */\n  $implicit: T;\n\n  /** Depth of the node. */\n  level: number;\n\n  /** Index location of the node. */\n  index?: number;\n\n  /** Length of the number of total dataNodes. */\n  count?: number;\n\n  constructor(data: T) {\n    this.$implicit = data;\n  }\n}\n\n/**\n * Data node definition for the CdkTree.\n * Captures the node's template and a when predicate that describes when this node should be used.\n */\n@Directive({\n  selector: '[cdkTreeNodeDef]',\n  inputs: [\n    'when: cdkTreeNodeDefWhen'\n  ],\n})\nexport class CdkTreeNodeDef<T> {\n  /**\n   * Function that should return true if this node template should be used for the provided node\n   * data and index. If left undefined, this node will be considered the default node template to\n   * use when no other when functions return true for the data.\n   * For every node, there must be at least one when function that passes or an undefined to\n   * default.\n   */\n  when: (index: number, nodeData: T) => boolean;\n\n  /** @docs-private */\n  constructor(public template: TemplateRef<any>) {}\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\nimport {\n  Directive,\n  ViewContainerRef,\n} from '@angular/core';\n\n/**\n * Outlet for nested CdkNode. Put `[cdkTreeNodeOutlet]` on a tag to place children dataNodes\n * inside the outlet.\n */\n@Directive({\n  selector: '[cdkTreeNodeOutlet]'\n})\nexport class CdkTreeNodeOutlet {\n  constructor(public viewContainer: ViewContainerRef) {}\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\nimport {FocusableOption} from '@angular/cdk/a11y';\nimport {CollectionViewer, DataSource} from '@angular/cdk/collections';\nimport {\n  AfterContentChecked,\n  ChangeDetectionStrategy,\n  ChangeDetectorRef,\n  Component,\n  ContentChildren,\n  Directive,\n  ElementRef,\n  Input,\n  IterableChangeRecord,\n  IterableDiffer,\n  IterableDiffers,\n  OnDestroy,\n  OnInit,\n  QueryList,\n  ViewChild,\n  ViewContainerRef,\n  ViewEncapsulation,\n  TrackByFunction\n} from '@angular/core';\nimport {BehaviorSubject, Observable, of as observableOf, Subject, Subscription} from 'rxjs';\nimport {takeUntil} from 'rxjs/operators';\nimport {TreeControl} from './control/tree-control';\nimport {CdkTreeNodeDef, CdkTreeNodeOutletContext} from './node';\nimport {CdkTreeNodeOutlet} from './outlet';\nimport {\n  getTreeControlFunctionsMissingError,\n  getTreeControlMissingError,\n  getTreeMissingMatchingNodeDefError,\n  getTreeMultipleDefaultNodeDefsError,\n  getTreeNoValidDataSourceError\n} from './tree-errors';\n\n/**\n * CDK tree component that connects with a data source to retrieve data of type `T` and renders\n * dataNodes with hierarchy. Updates the dataNodes when new data is provided by the data source.\n */\n@Component({\n  moduleId: module.id,\n  selector: 'cdk-tree',\n  exportAs: 'cdkTree',\n  template: `<ng-container cdkTreeNodeOutlet></ng-container>`,\n  host: {\n    'class': 'cdk-tree',\n    'role': 'tree',\n  },\n  encapsulation: ViewEncapsulation.None,\n  changeDetection: ChangeDetectionStrategy.OnPush\n})\nexport class CdkTree<T>\n    implements AfterContentChecked, CollectionViewer, OnDestroy, OnInit {\n  /** Subject that emits when the component has been destroyed. */\n  private _onDestroy = new Subject<void>();\n\n  /** Differ used to find the changes in the data provided by the data source. */\n  private _dataDiffer: IterableDiffer<T>;\n\n  /** Stores the node definition that does not have a when predicate. */\n  private _defaultNodeDef: CdkTreeNodeDef<T> | null;\n\n  /** Data subscription */\n  private _dataSubscription: Subscription | null;\n\n  /** Level of nodes */\n  private _levels: Map<T, number> = new Map<T, number>();\n\n  /**\n   * Provides a stream containing the latest data array to render. Influenced by the tree's\n   * stream of view window (what dataNodes are currently on screen).\n   * Data source can be an observable of data array, or a data array to render.\n   */\n  @Input()\n  get dataSource(): DataSource<T> | Observable<T[]> | T[] { return this._dataSource; }\n  set dataSource(dataSource: DataSource<T> | Observable<T[]> | T[]) {\n    if (this._dataSource !== dataSource) {\n      this._switchDataSource(dataSource);\n    }\n  }\n  private _dataSource: DataSource<T> | Observable<T[]> | T[];\n\n  /** The tree controller */\n  @Input() treeControl: TreeControl<T>;\n\n  /**\n   * Tracking function that will be used to check the differences in data changes. Used similarly\n   * to `ngFor` `trackBy` function. Optimize node operations by identifying a node based on its data\n   * relative to the function to know if a node should be added/removed/moved.\n   * Accepts a function that takes two parameters, `index` and `item`.\n   */\n  @Input() trackBy: TrackByFunction<T>;\n\n  // Outlets within the tree's template where the dataNodes will be inserted.\n  @ViewChild(CdkTreeNodeOutlet) _nodeOutlet: CdkTreeNodeOutlet;\n\n  /** The tree node template for the tree */\n  @ContentChildren(CdkTreeNodeDef) _nodeDefs: QueryList<CdkTreeNodeDef<T>>;\n\n  // TODO(tinayuangao): Setup a listener for scrolling, emit the calculated view to viewChange.\n  //     Remove the MAX_VALUE in viewChange\n  /**\n   * Stream containing the latest information on what rows are being displayed on screen.\n   * Can be used by the data source to as a heuristic of what data should be provided.\n   */\n  viewChange =\n    new BehaviorSubject<{start: number, end: number}>({start: 0, end: Number.MAX_VALUE});\n\n  constructor(private _differs: IterableDiffers,\n              private _changeDetectorRef: ChangeDetectorRef) {}\n\n  ngOnInit() {\n    this._dataDiffer = this._differs.find([]).create(this.trackBy);\n    if (!this.treeControl) {\n      throw getTreeControlMissingError();\n    }\n  }\n\n  ngOnDestroy() {\n    this._nodeOutlet.viewContainer.clear();\n\n    this._onDestroy.next();\n    this._onDestroy.complete();\n\n    if (this._dataSource && typeof (this._dataSource as DataSource<T>).disconnect === 'function') {\n      (this.dataSource as DataSource<T>).disconnect(this);\n    }\n\n    if (this._dataSubscription) {\n      this._dataSubscription.unsubscribe();\n      this._dataSubscription = null;\n    }\n  }\n\n  ngAfterContentChecked() {\n    const defaultNodeDefs = this._nodeDefs.filter(def => !def.when);\n    if (defaultNodeDefs.length > 1) {\n      throw getTreeMultipleDefaultNodeDefsError();\n    }\n    this._defaultNodeDef = defaultNodeDefs[0];\n\n    if (this.dataSource && this._nodeDefs && !this._dataSubscription) {\n      this._observeRenderChanges();\n    }\n  }\n\n\n  // TODO(tinayuangao): Work on keyboard traversal and actions, make sure it's working for RTL\n  //     and nested trees.\n\n  /**\n   * Switch to the provided data source by resetting the data and unsubscribing from the current\n   * render change subscription if one exists. If the data source is null, interpret this by\n   * clearing the node outlet. Otherwise start listening for new data.\n   */\n  private _switchDataSource(dataSource: DataSource<T> | Observable<T[]> | T[]) {\n    if (this._dataSource && typeof (this._dataSource as DataSource<T>).disconnect === 'function') {\n      (this.dataSource as DataSource<T>).disconnect(this);\n    }\n\n    if (this._dataSubscription) {\n      this._dataSubscription.unsubscribe();\n      this._dataSubscription = null;\n    }\n\n    // Remove the all dataNodes if there is now no data source\n    if (!dataSource) {\n      this._nodeOutlet.viewContainer.clear();\n    }\n\n    this._dataSource = dataSource;\n    if (this._nodeDefs) {\n      this._observeRenderChanges();\n    }\n  }\n\n  /** Set up a subscription for the data provided by the data source. */\n  private _observeRenderChanges() {\n    let dataStream: Observable<T[] | ReadonlyArray<T>> | undefined;\n\n    // Cannot use `instanceof DataSource` since the data source could be a literal with\n    // `connect` function and may not extends DataSource.\n    if (typeof (this._dataSource as DataSource<T>).connect === 'function') {\n      dataStream = (this._dataSource as DataSource<T>).connect(this);\n    } else if (this._dataSource instanceof Observable) {\n      dataStream = this._dataSource;\n    } else if (Array.isArray(this._dataSource)) {\n      dataStream = observableOf(this._dataSource);\n    }\n\n    if (dataStream) {\n      this._dataSubscription = dataStream.pipe(takeUntil(this._onDestroy))\n        .subscribe(data => this.renderNodeChanges(data));\n    } else {\n      throw getTreeNoValidDataSourceError();\n    }\n  }\n\n  /** Check for changes made in the data and render each change (node added/removed/moved). */\n  renderNodeChanges(data: T[] | ReadonlyArray<T>, dataDiffer: IterableDiffer<T> = this._dataDiffer,\n                    viewContainer: ViewContainerRef = this._nodeOutlet.viewContainer,\n                    parentData?: T) {\n    const changes = dataDiffer.diff(data);\n    if (!changes) { return; }\n\n    changes.forEachOperation((item: IterableChangeRecord<T>,\n                              adjustedPreviousIndex: number | null,\n                              currentIndex: number | null) => {\n        if (item.previousIndex == null) {\n          this.insertNode(data[currentIndex!], currentIndex!, viewContainer, parentData);\n        } else if (currentIndex == null) {\n          viewContainer.remove(adjustedPreviousIndex!);\n          this._levels.delete(item.item);\n        } else {\n          const view = viewContainer.get(adjustedPreviousIndex!);\n          viewContainer.move(view!, currentIndex);\n        }\n      });\n\n    this._changeDetectorRef.detectChanges();\n  }\n\n  /**\n   * Finds the matching node definition that should be used for this node data. If there is only\n   * one node definition, it is returned. Otherwise, find the node definition that has a when\n   * predicate that returns true with the data. If none return true, return the default node\n   * definition.\n   */\n  _getNodeDef(data: T, i: number): CdkTreeNodeDef<T> {\n    if (this._nodeDefs.length === 1) { return this._nodeDefs.first; }\n\n    const nodeDef =\n      this._nodeDefs.find(def => def.when && def.when(i, data)) || this._defaultNodeDef;\n    if (!nodeDef) { throw getTreeMissingMatchingNodeDefError(); }\n\n    return nodeDef;\n  }\n\n  /**\n   * Create the embedded view for the data node template and place it in the correct index location\n   * within the data node view container.\n   */\n  insertNode(nodeData: T, index: number, viewContainer?: ViewContainerRef, parentData?: T) {\n    const node = this._getNodeDef(nodeData, index);\n\n    // Node context that will be provided to created embedded view\n    const context = new CdkTreeNodeOutletContext<T>(nodeData);\n\n    // If the tree is flat tree, then use the `getLevel` function in flat tree control\n    // Otherwise, use the level of parent node.\n    if (this.treeControl.getLevel) {\n      context.level = this.treeControl.getLevel(nodeData);\n    } else if (typeof parentData !== 'undefined' && this._levels.has(parentData)) {\n      context.level = this._levels.get(parentData)! + 1;\n    } else {\n      context.level = 0;\n    }\n    this._levels.set(nodeData, context.level);\n\n    // Use default tree nodeOutlet, or nested node's nodeOutlet\n    const container = viewContainer ? viewContainer : this._nodeOutlet.viewContainer;\n    container.createEmbeddedView(node.template, context, index);\n\n    // Set the data to just created `CdkTreeNode`.\n    // The `CdkTreeNode` created from `createEmbeddedView` will be saved in static variable\n    //     `mostRecentTreeNode`. We get it from static variable and pass the node data to it.\n    if (CdkTreeNode.mostRecentTreeNode) {\n      CdkTreeNode.mostRecentTreeNode.data = nodeData;\n    }\n  }\n}\n\n\n/**\n * Tree node for CdkTree. It contains the data in the tree node.\n */\n@Directive({\n  selector: 'cdk-tree-node',\n  exportAs: 'cdkTreeNode',\n  host: {\n    '[attr.aria-expanded]': 'isExpanded',\n    '[attr.aria-level]': 'role === \"treeitem\" ? level : null',\n    '[attr.role]': 'role',\n    'class': 'cdk-tree-node',\n  },\n})\nexport class CdkTreeNode<T> implements FocusableOption, OnDestroy {\n  /**\n   * The most recently created `CdkTreeNode`. We save it in static variable so we can retrieve it\n   * in `CdkTree` and set the data to it.\n   */\n  static mostRecentTreeNode: CdkTreeNode<any> | null = null;\n\n  /** Subject that emits when the component has been destroyed. */\n  protected _destroyed = new Subject<void>();\n\n  /** The tree node's data. */\n  get data(): T { return this._data; }\n  set data(value: T) {\n    this._data = value;\n    this._setRoleFromData();\n  }\n  protected _data: T;\n\n  get isExpanded(): boolean {\n    return this._tree.treeControl.isExpanded(this._data);\n  }\n\n  get level(): number {\n    return this._tree.treeControl.getLevel ? this._tree.treeControl.getLevel(this._data) : 0;\n  }\n\n  /**\n   * The role of the node should be 'group' if it's an internal node,\n   * and 'treeitem' if it's a leaf node.\n   */\n  @Input() role: 'treeitem' | 'group' = 'treeitem';\n\n  constructor(protected _elementRef: ElementRef<HTMLElement>,\n              protected _tree: CdkTree<T>) {\n    CdkTreeNode.mostRecentTreeNode = this as CdkTreeNode<T>;\n  }\n\n  ngOnDestroy() {\n    // If this is the last tree node being destroyed,\n    // clear out the reference to avoid leaking memory.\n    if (CdkTreeNode.mostRecentTreeNode === this) {\n      CdkTreeNode.mostRecentTreeNode = null;\n    }\n\n    this._destroyed.next();\n    this._destroyed.complete();\n  }\n\n  /** Focuses the menu item. Implements for FocusableOption. */\n  focus(): void {\n    this._elementRef.nativeElement.focus();\n  }\n\n  protected _setRoleFromData(): void {\n    if (this._tree.treeControl.isExpandable) {\n      this.role = this._tree.treeControl.isExpandable(this._data) ? 'group' : 'treeitem';\n    } else {\n      if (!this._tree.treeControl.getChildren) {\n        throw getTreeControlFunctionsMissingError();\n      }\n      const childrenNodes = this._tree.treeControl.getChildren(this._data);\n      if (Array.isArray(childrenNodes)) {\n        this._setRoleFromChildren(childrenNodes as T[]);\n      } else if (childrenNodes instanceof Observable) {\n        childrenNodes.pipe(takeUntil(this._destroyed))\n            .subscribe(children => this._setRoleFromChildren(children));\n      }\n    }\n  }\n\n  protected _setRoleFromChildren(children: T[]) {\n    this.role = children && children.length ? 'group' : 'treeitem';\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\nimport {\n  AfterContentInit,\n  ContentChildren,\n  Directive,\n  ElementRef,\n  IterableDiffers,\n  IterableDiffer,\n  OnDestroy,\n  QueryList,\n} from '@angular/core';\nimport {Observable} from 'rxjs';\nimport {takeUntil} from 'rxjs/operators';\n\nimport {CdkTree, CdkTreeNode} from './tree';\nimport {CdkTreeNodeOutlet} from './outlet';\nimport {getTreeControlFunctionsMissingError} from './tree-errors';\n\n/**\n * Nested node is a child of `<cdk-tree>`. It works with nested tree.\n * By using `cdk-nested-tree-node` component in tree node template, children of the parent node will\n * be added in the `cdkTreeNodeOutlet` in tree node template.\n * For example:\n *   ```html\n *   <cdk-nested-tree-node>\n *     {{node.name}}\n *     <ng-template cdkTreeNodeOutlet></ng-template>\n *   </cdk-nested-tree-node>\n *   ```\n * The children of node will be automatically added to `cdkTreeNodeOutlet`, the result dom will be\n * like this:\n *   ```html\n *   <cdk-nested-tree-node>\n *     {{node.name}}\n *      <cdk-nested-tree-node>{{child1.name}}</cdk-nested-tree-node>\n *      <cdk-nested-tree-node>{{child2.name}}</cdk-nested-tree-node>\n *   </cdk-nested-tree-node>\n *   ```\n */\n@Directive({\n  selector: 'cdk-nested-tree-node',\n  exportAs: 'cdkNestedTreeNode',\n  host: {\n    '[attr.aria-expanded]': 'isExpanded',\n    '[attr.role]': 'role',\n    'class': 'cdk-tree-node cdk-nested-tree-node',\n  },\n  providers: [{provide: CdkTreeNode, useExisting: CdkNestedTreeNode}]\n})\nexport class CdkNestedTreeNode<T> extends CdkTreeNode<T> implements AfterContentInit, OnDestroy {\n  /** Differ used to find the changes in the data provided by the data source. */\n  private _dataDiffer: IterableDiffer<T>;\n\n  /** The children data dataNodes of current node. They will be placed in `CdkTreeNodeOutlet`. */\n  protected _children: T[];\n\n  /** The children node placeholder. */\n  @ContentChildren(CdkTreeNodeOutlet) nodeOutlet: QueryList<CdkTreeNodeOutlet>;\n\n  constructor(protected _elementRef: ElementRef<HTMLElement>,\n              protected _tree: CdkTree<T>,\n              protected _differs: IterableDiffers) {\n    super(_elementRef, _tree);\n  }\n\n  ngAfterContentInit() {\n    this._dataDiffer = this._differs.find([]).create(this._tree.trackBy);\n    if (!this._tree.treeControl.getChildren) {\n      throw getTreeControlFunctionsMissingError();\n    }\n    const childrenNodes = this._tree.treeControl.getChildren(this.data);\n    if (Array.isArray(childrenNodes)) {\n      this.updateChildrenNodes(childrenNodes as T[]);\n    } else if (childrenNodes instanceof Observable) {\n      childrenNodes.pipe(takeUntil(this._destroyed))\n        .subscribe(result => this.updateChildrenNodes(result));\n    }\n    this.nodeOutlet.changes.pipe(takeUntil(this._destroyed))\n        .subscribe(() => this.updateChildrenNodes());\n  }\n\n  ngOnDestroy() {\n    this._clear();\n    super.ngOnDestroy();\n  }\n\n  /** Add children dataNodes to the NodeOutlet */\n  protected updateChildrenNodes(children?: T[]): void {\n    if (children) {\n      this._children = children;\n    }\n    if (this.nodeOutlet.length && this._children) {\n      const viewContainer = this.nodeOutlet.first.viewContainer;\n      this._tree.renderNodeChanges(this._children, this._dataDiffer, viewContainer, this._data);\n    } else {\n      // Reset the data differ if there's no children nodes displayed\n      this._dataDiffer.diff([]);\n    }\n  }\n\n  /** Clear the children dataNodes. */\n  protected _clear(): void {\n    if (this.nodeOutlet && this.nodeOutlet.first) {\n      this.nodeOutlet.first.viewContainer.clear();\n      this._dataDiffer.diff([]);\n    }\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {Directionality} from '@angular/cdk/bidi';\nimport {coerceNumberProperty} from '@angular/cdk/coercion';\nimport {Directive, ElementRef, Input, OnDestroy, Optional, Renderer2} from '@angular/core';\nimport {takeUntil} from 'rxjs/operators';\nimport {Subject} from 'rxjs';\nimport {CdkTree, CdkTreeNode} from './tree';\n\n/** Regex used to split a string on its CSS units. */\nconst cssUnitPattern = /([A-Za-z%]+)$/;\n\n/**\n * Indent for the children tree dataNodes.\n * This directive will add left-padding to the node to show hierarchy.\n */\n@Directive({\n  selector: '[cdkTreeNodePadding]',\n})\nexport class CdkTreeNodePadding<T> implements OnDestroy {\n  /** Subject that emits when the component has been destroyed. */\n  private _destroyed = new Subject<void>();\n\n  /** CSS units used for the indentation value. */\n  indentUnits = 'px';\n\n  /** The level of depth of the tree node. The padding will be `level * indent` pixels. */\n  @Input('cdkTreeNodePadding')\n  get level(): number { return this._level; }\n  set level(value: number) {\n    this._level = coerceNumberProperty(value);\n    this._setPadding();\n  }\n  _level: number;\n\n  /**\n   * The indent for each level. Can be a number or a CSS string.\n   * Default number 40px from material design menu sub-menu spec.\n   */\n  @Input('cdkTreeNodePaddingIndent')\n  get indent(): number | string { return this._indent; }\n  set indent(indent: number | string) {\n    let value = indent;\n    let units = 'px';\n\n    if (typeof indent === 'string') {\n      const parts = indent.split(cssUnitPattern);\n      value = parts[0];\n      units = parts[1] || units;\n    }\n\n    this.indentUnits = units;\n    this._indent = coerceNumberProperty(value);\n    this._setPadding();\n  }\n  _indent: number = 40;\n\n  constructor(private _treeNode: CdkTreeNode<T>,\n              private _tree: CdkTree<T>,\n              private _renderer: Renderer2,\n              private _element: ElementRef<HTMLElement>,\n              @Optional() private _dir: Directionality) {\n    this._setPadding();\n    if (this._dir) {\n      this._dir.change.pipe(takeUntil(this._destroyed)).subscribe(() => this._setPadding());\n    }\n  }\n\n  ngOnDestroy() {\n    this._destroyed.next();\n    this._destroyed.complete();\n  }\n\n  /** The padding indent value for the tree node. Returns a string with px numbers if not null. */\n  _paddingIndent(): string|null {\n    const nodeLevel = (this._treeNode.data && this._tree.treeControl.getLevel)\n      ? this._tree.treeControl.getLevel(this._treeNode.data)\n      : null;\n    const level = this._level || nodeLevel;\n    return level ? `${level * this._indent}${this.indentUnits}` : null;\n  }\n\n  _setPadding() {\n    const padding = this._paddingIndent();\n    const paddingProp = this._dir && this._dir.value === 'rtl' ? 'paddingRight' : 'paddingLeft';\n\n    this._renderer.setStyle(this._element.nativeElement, paddingProp, padding);\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {coerceBooleanProperty} from '@angular/cdk/coercion';\nimport {\n  Directive,\n  Input,\n} from '@angular/core';\nimport {CdkTree, CdkTreeNode} from './tree';\n\n/**\n * Node toggle to expand/collapse the node.\n */\n@Directive({\n  selector: '[cdkTreeNodeToggle]',\n  host: {\n    '(click)': '_toggle($event)',\n  }\n})\nexport class CdkTreeNodeToggle<T> {\n  /** Whether expand/collapse the node recursively. */\n  @Input('cdkTreeNodeToggleRecursive')\n  get recursive(): boolean { return this._recursive; }\n  set recursive(value: boolean) { this._recursive = coerceBooleanProperty(value); }\n  protected _recursive = false;\n\n  constructor(protected _tree: CdkTree<T>,\n              protected _treeNode: CdkTreeNode<T>) {}\n\n  _toggle(event: Event): void {\n    this.recursive\n      ? this._tree.treeControl.toggleDescendants(this._treeNode.data)\n      : this._tree.treeControl.toggle(this._treeNode.data);\n\n    event.stopPropagation();\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {FocusMonitor} from '@angular/cdk/a11y';\nimport {CommonModule} from '@angular/common';\nimport {NgModule} from '@angular/core';\nimport {CdkTreeNodeOutlet} from './outlet';\nimport {CdkTreeNodePadding} from './padding';\nimport {CdkTreeNodeToggle} from './toggle';\nimport {CdkTree, CdkTreeNode} from './tree';\nimport {CdkTreeNodeDef} from './node';\nimport {CdkNestedTreeNode} from './nested-node';\n\nconst EXPORTED_DECLARATIONS = [\n  CdkNestedTreeNode,\n  CdkTreeNodeDef,\n  CdkTreeNodePadding,\n  CdkTreeNodeToggle,\n  CdkTree,\n  CdkTreeNode,\n  CdkTreeNodeOutlet,\n];\n\n@NgModule({\n  imports: [CommonModule],\n  exports: EXPORTED_DECLARATIONS,\n  declarations: EXPORTED_DECLARATIONS,\n  providers: [FocusMonitor, CdkTreeNodeDef]\n})\nexport class CdkTreeModule {}\n"],"names":["__extends","d","b","__","this","constructor","extendStatics","prototype","Object","create","getTreeNoValidDataSourceError","Error","getTreeMultipleDefaultNodeDefsError","getTreeMissingMatchingNodeDefError","getTreeControlMissingError","getTreeControlFunctionsMissingError","setPrototypeOf","__proto__","Array","p","hasOwnProperty","BaseTreeControl","expansionModel","SelectionModel","toggle","dataNode","expand","select","collapse","deselect","isExpanded","isSelected","toggleDescendants","collapseDescendants","expandDescendants","collapseAll","clear","toBeProcessed","push","apply","getDescendants","_a","FlatTreeControl","getLevel","isExpandable","_this","_super","call","tslib_1.__extends","startIndex","dataNodes","indexOf","results","i","length","expandAll","NestedTreeControl","getChildren","allNodes","reduce","accumulator","concat","descendants","_getDescendants","splice","childrenNodes","isArray","forEach","child","Observable","pipe","take","subscribe","children","CdkTreeNodeOutletContext","data","$implicit","CdkTreeNodeDef","template","type","Directive","args","selector","inputs","TemplateRef","CdkTreeNodeOutlet","viewContainer","ViewContainerRef","CdkTree","_differs","_changeDetectorRef","_onDestroy","Subject","_levels","Map","viewChange","BehaviorSubject","start","end","Number","MAX_VALUE","defineProperty","_dataSource","dataSource","_switchDataSource","ngOnInit","_dataDiffer","find","trackBy","treeControl","ngOnDestroy","_nodeOutlet","next","complete","disconnect","_dataSubscription","unsubscribe","ngAfterContentChecked","defaultNodeDefs","_nodeDefs","filter","def","when","_defaultNodeDef","_observeRenderChanges","dataStream","connect","observableOf","takeUntil","renderNodeChanges","dataDiffer","parentData","changes","diff","forEachOperation","item","adjustedPreviousIndex","currentIndex","previousIndex","insertNode","remove","delete","view","get","move","detectChanges","_getNodeDef","first","nodeDef","nodeData","index","node","context","level","has","set","createEmbeddedView","CdkTreeNode","mostRecentTreeNode","Component","exportAs","host","class","role","encapsulation","ViewEncapsulation","None","changeDetection","ChangeDetectionStrategy","OnPush","propDecorators","Input","ViewChild","ContentChildren","_elementRef","_tree","_setRoleFromData","enumerable","configurable","_destroyed","_data","_setRoleFromChildren","[attr.aria-expanded]","[attr.aria-level]","[attr.role]","CdkNestedTreeNode","ngAfterContentInit","updateChildrenNodes","result","nodeOutlet","_clear","_children","providers","provide","useExisting","ElementRef","IterableDiffers","cssUnitPattern","CdkTreeNodePadding","_treeNode","_renderer","_element","_dir","indentUnits","_indent","_setPadding","change","_level","value","coerceNumberProperty","indent","units","parts","split","_paddingIndent","nodeLevel","padding","paddingProp","setStyle","nativeElement","Renderer2","Directionality","decorators","Optional","CdkTreeNodeToggle","_recursive","coerceBooleanProperty","_toggle","event","recursive","stopPropagation","(click)","EXPORTED_DECLARATIONS","CdkTreeModule","NgModule","imports","CommonModule","exports","declarations","FocusMonitor"],"mappings":";;;;;;;0uBAuBA,SAAgBA,GAAUC,EAAGC,GAEzB,QAASC,KAAOC,KAAKC,YAAcJ,EADnCK,EAAcL,EAAGC,GAEjBD,EAAEM,UAAkB,OAANL,EAAaM,OAAOC,OAAOP,IAAMC,EAAGI,UAAYL,EAAEK,UAAW,GAAIJ,ICdnF,QAAgBO,KACd,MAAOC,OAAM,yCAOf,QAAgBC,KACd,MAAOD,OAAM,wEAOf,QAAgBE,KACd,MAAOF,OAAM,yEAOf,QAAgBG,KACd,MAAOH,OAAM,+CAOf,QAAgBI,KACd,MAAOJ,OAAM,kED7Bf,GAAIL,GAAgB,SAASL,EAAGC,GAI5B,OAHAI,EAAgBE,OAAOQ,iBAChBC,uBAA2BC,QAAS,SAAUjB,EAAGC,GAAKD,EAAEgB,UAAYf,IACvE,SAAUD,EAAGC,GAAK,IAAK,GAAIiB,KAAKjB,GAAOA,EAAEkB,eAAeD,KAAIlB,EAAEkB,GAAKjB,EAAEiB,MACpDlB,EAAGC,iBER5B,QAAAmB,KAYEjB,KAAFkB,eAAsC,GAAIC,GAAAA,gBAAkB,GA2D5D,MA5CEF,GAAFd,UAAAiB,OAAE,SAAOC,GACLrB,KAAKkB,eAAeE,OAAOC,IAI7BJ,EAAFd,UAAAmB,OAAE,SAAOD,GACLrB,KAAKkB,eAAeK,OAAOF,IAI7BJ,EAAFd,UAAAqB,SAAE,SAASH,GACPrB,KAAKkB,eAAeO,SAASJ,IAI/BJ,EAAFd,UAAAuB,WAAE,SAAWL,GACT,MAAOrB,MAAKkB,eAAeS,WAAWN,IAIxCJ,EAAFd,UAAAyB,kBAAE,SAAkBP,GAChBrB,KAAKkB,eAAeS,WAAWN,GACzBrB,KAAK6B,oBAAoBR,GACzBrB,KAAK8B,kBAAkBT,IAI/BJ,EAAFd,UAAA4B,YAAE,WACE/B,KAAKkB,eAAec,SAItBf,EAAFd,UAAA2B,kBAAE,SAAkBT,SACZY,GAAiBZ,EACrBY,GAAcC,KAAlBC,MAAIF,EAAsBjC,KAAKoC,eAAef,KAC1CgB,EAAArC,KAAKkB,gBAAeK,OAAxBY,MAAAE,EAAkCJ,IAIhChB,EAAFd,UAAA0B,oBAAE,SAAoBR,SACdY,GAAiBZ,EACrBY,GAAcC,KAAlBC,MAAIF,EAAsBjC,KAAKoC,eAAef,KAC1CgB,EAAArC,KAAKkB,gBAAeO,SAAxBU,MAAAE,EAAoCJ,IAEpChB,mBCrEE,QAAFqB,GAAqBC,EACAC,GADnB,GAAFC,GAEIC,EAFJC,KAAA3C,OAAAA,WAAqByC,GAArBF,SAAqBA,EACAE,EAArBD,aAAqBA,IAqCrB,MAzCwCI,GAAxCN,EAAAI,GAcEJ,EAAFnC,UAAAiC,eAAE,SAAef,GAUb,IAAK,GATCwB,GAAa7C,KAAK8C,UAAUC,QAAQ1B,GACpC2B,KAQGC,EAAIJ,EAAa,EACtBI,EAAIjD,KAAK8C,UAAUI,QAAUlD,KAAKuC,SAASlB,GAAYrB,KAAKuC,SAASvC,KAAK8C,UAAUG,IACpFA,IACFD,EAAQd,KAAKlC,KAAK8C,UAAUG,GAE9B,OAAOD,IASTV,EAAFnC,UAAAgD,UAAE,kBACEd,EAAArC,KAAKkB,gBAAeK,OAAxBY,MAAAE,EAAkCrC,KAAK8C,YAEvCR,GAzCwCrB,iBCItC,QAAFmC,GAAqBC,GAAnB,GAAFZ,GACIC,EADJC,KAAA3C,OAAAA,WAAqByC,GAArBY,YAAqBA,IAsCrB,MAzC0CT,GAA1CQ,EAAAV,GAaEU,EAAFjD,UAAAgD,UAAE,WAAA,MAAFV,EAAAzC,IACIA,MAAKkB,eAAec,OACxB,IAAUsB,GAAWtD,KAAK8C,UAAUS,OAAO,SAACC,EAAkBnC,GACtD,MAAImC,GAAZC,OAA4BhB,EAAKL,eAAef,IAAWA,UACvDgB,EAAArC,KAAKkB,gBAAeK,OAAxBY,MAAAE,EAAkCiB,IAIhCF,EAAFjD,UAAAiC,eAAE,SAAef,GACjB,GAAUqC,KAIN,OAFA1D,MAAK2D,gBAAgBD,EAAarC,GAE3BqC,EAAYE,OAAO,IAIlBR,EAAZjD,UAAAwD,gBAAE,SAA0BD,EAAkBrC,GAA5C,GAAFoB,GAAAzC,IACI0D,GAAYxB,KAAKb,EACrB,IAAUwC,GAAgB7D,KAAKqD,YAAYhC,EACnCP,OAAMgD,QAAQD,GAChBA,EAAcE,QAAQ,SAACC,GAAa,MAAAvB,GAAKkB,gBAAgBD,EAAaM,KAC7DH,YAAyBI,GAAAA,YAClCJ,EAAcK,KAAKC,EAAAA,KAAK,IAAIC,UAAU,SAAAC,GACpCA,EAASN,QAAQ,SAACC,GAAa,MAAAvB,GAAKkB,gBAAgBD,EAAaM,QAIzEZ,GAzC0CnC,gBCaxC,QAAFqD,GAAcC,GACVvE,KAAKwE,UAAYD,EAErB,MAAAD,MAMAG,EAAA,WAiBE,QAAFA,GAAqBC,GAAA1E,KAArB0E,SAAqBA,EACrB,sBAlBAC,KAACC,EAAAA,UAADC,OACEC,SAAU,mBACVC,QACE,oEA7BJJ,KAAmBK,EAAAA,eA4CnBP,KCpCAQ,EAAA,WAIE,QAAFA,GAAqBC,GAAAlF,KAArBkF,cAAqBA,EACrB,sBALAP,KAACC,EAAAA,UAADC,OACEC,SAAU,8DARZH,KAAEQ,EAAAA,oBAYFF,KCyBAG,EAAA,WAqEE,QAAFA,GAAsBC,EACAC,GADAtF,KAAtBqF,SAAsBA,EACArF,KAAtBsF,mBAAsBA,EAvDZtF,KAAVuF,WAAuB,GAAIC,GAAAA,QAYjBxF,KAAVyF,QAAoC,GAAIC,KAuCtC1F,KAAF2F,WACI,GAAIC,GAAAA,iBAA+CC,MAAO,EAAGC,IAAKC,OAAOC,YAT7E,MAxBE5F,QAAF6F,eACMb,EADNjF,UAAA,kBAAE,WAC0D,MAAOH,MAAKkG,iBACtE,SAAeC,GACTnG,KAAKkG,cAAgBC,GACvBnG,KAAKoG,kBAAkBD,oCAkC3Bf,EAAFjF,UAAAkG,SAAE,WAEE,GADArG,KAAKsG,YAActG,KAAKqF,SAASkB,SAASlG,OAAOL,KAAKwG,UACjDxG,KAAKyG,YACR,KAAM/F,MAIV0E,EAAFjF,UAAAuG,YAAE,WACE1G,KAAK2G,YAAYzB,cAAclD,QAE/BhC,KAAKuF,WAAWqB,OAChB5G,KAAKuF,WAAWsB,WAEZ7G,KAAKkG,aAAyE,kBAAlDlG,MAAgB,YAAmB8G,YAChE9G,KAAe,WAAmB8G,WAAW9G,MAG5CA,KAAK+G,oBACP/G,KAAK+G,kBAAkBC,cACvBhH,KAAK+G,kBAAoB,OAI7B3B,EAAFjF,UAAA8G,sBAAE,WACF,GAAUC,GAAkBlH,KAAKmH,UAAUC,OAAO,SAAAC,GAAO,OAACA,EAAIC,MAC1D,IAAIJ,EAAgBhE,OAAS,EAC3B,KAAM1C,IAERR,MAAKuH,gBAAkBL,EAAgB,GAEnClH,KAAKmG,YAAcnG,KAAKmH,YAAcnH,KAAK+G,mBAC7C/G,KAAKwH,yBAaDpC,EAAVjF,UAAAiG,kBAAE,SAA0BD,GACpBnG,KAAKkG,aAAyE,kBAAlDlG,MAAgB,YAAmB8G,YAChE9G,KAAe,WAAmB8G,WAAW9G,MAG5CA,KAAK+G,oBACP/G,KAAK+G,kBAAkBC,cACvBhH,KAAK+G,kBAAoB,MAItBZ,GACHnG,KAAK2G,YAAYzB,cAAclD,QAGjChC,KAAKkG,YAAcC,EACfnG,KAAKmH,WACPnH,KAAKwH,yBAKDpC,EAAVjF,UAAAqH,sBAAE,WAAA,GACMC,GADRhF,EAAAzC,IAaI,IAR2D,kBAA/CA,MAAgB,YAAmB0H,QAC7CD,EAAczH,KAAgB,YAAmB0H,QAAQ1H,MAChDA,KAAKkG,sBAAuBjC,GAAAA,WACrCwD,EAAazH,KAAKkG,YACTpF,MAAMgD,QAAQ9D,KAAKkG,eAC5BuB,EAAaE,EAAAA,GAAa3H,KAAKkG,eAG7BuB,EAIF,KAAMnH,IAHNN,MAAK+G,kBAAoBU,EAAWvD,KAAK0D,EAAAA,UAAU5H,KAAKuF,aACrDnB,UAAU,SAAAG,GAAQ,MAAA9B,GAAKoF,kBAAkBtD,MAOhDa,EAAFjF,UAAA0H,kBAAE,SAAkBtD,EAA8BuD,EAC9B5C,EACA6C,GAFlB,GAAFtF,GAAAzC,SAAA,KAAA8H,IAAkDA,EAAgC9H,KAAKsG,iBACvF,KAAApB,IAAoBA,EAAkClF,KAAK2G,YAAYzB,cAEvE,IAAU8C,GAAUF,EAAWG,KAAK1D,EAC3ByD,KAELA,EAAQE,iBAAiB,SAACC,EACAC,EACAC,GACtB,GAA0B,MAAtBF,EAAKG,cACP7F,EAAK8F,WAAWhE,EAAI,GAAe,EAAiBW,EAAe6C,OAC9D,IAAoB,MAAhBM,EACTnD,EAAcsD,OAAM,GACpB/F,EAAKgD,QAAQgD,OAAON,EAAKA,UACpB,CACf,GAAgBO,GAAOxD,EAAcyD,IAAG,EAC9BzD,GAAc0D,KAAI,EAAQP,MAIhCrI,KAAKsF,mBAAmBuD,kBAS1BzD,EAAFjF,UAAA2I,YAAE,SAAYvE,EAAStB,GACnB,GAA8B,IAA1BjD,KAAKmH,UAAUjE,OAAgB,MAAOlD,MAAKmH,UAAU4B,KAE7D,IAAUC,GACJhJ,KAAKmH,UAAUZ,KAAK,SAAAc,GAAO,MAAAA,GAAIC,MAAQD,EAAIC,KAAKrE,EAAGsB,MAAUvE,KAAKuH,eACpE,KAAKyB,EAAW,KAAMvI,IAEtB,OAAOuI,IAOT5D,EAAFjF,UAAAoI,WAAE,SAAWU,EAAaC,EAAehE,EAAkC6C,GAC3E,GAAUoB,GAAOnJ,KAAK8I,YAAYG,EAAUC,GAGlCE,EAAU,GAAI9E,GAA4B2E,EAI5CjJ,MAAKyG,YAAYlE,SACnB6G,EAAQC,MAAQrJ,KAAKyG,YAAYlE,SAAS0G,OACX,KAAflB,GAA8B/H,KAAKyF,QAAQ6D,IAAIvB,GAC/DqB,EAAQC,MAAQrJ,KAAKyF,QAAQkD,IAAIZ,GAAe,EAEhDqB,EAAQC,MAAQ,EAElBrJ,KAAKyF,QAAQ8D,IAAIN,EAAUG,EAAQC,QAGjBnE,GAAgClF,KAAK2G,YAAYzB,eACzDsE,mBAAmBL,EAAKzE,SAAU0E,EAASF,GAKjDO,EAAYC,qBACdD,EAAYC,mBAAmBnF,KAAO0E,mBApO5CtE,KAACgF,EAAAA,UAAD9E,OAAAC,SAAA,WACE8E,SAAU,UACVlF,SAAU,kDACVmF,MACFC,MAAA,WACMC,KAAN,QAEAC,cAAAC,EAAAA,kBAAAC,KACAC,gBAAAC,EAAAA,wBAAAC,oGA1CAjF,EAAAkF,yEAoEA9D,UAAA7B,KAAA4F,EAAAA,QAUA5D,cAAAhC,KAAG6F,EAAAA,UAAH3F,MAAAI,KAQAkC,YAAAxC,KAAA8F,EAAAA,gBAAA5F,MAAAJ,MAMAW,kCAmLApF,KAAA0K,YAAAA,EA0CA1K,KAAA2K,MAAAA,+EAFA,MAIAvK,QAAA6F,eAAAwD,EAAkCtJ,UAAlC,QAvBAwI,+DACA3I,KAAA4K,oBAEAC,YAAA,EACEC,cAAF,oDAJAnC,qEAQAkC,YAAA,EACEC,cAAF,+CAAAnC,qGAGAkC,YAAA,EACEC,cAAF,uCAcArB,EAAAC,qBAAA1J,OACAyJ,EAAAC,mBAAA,MAEA1J,KAAA+K,WAAkBnE,OAClB5G,KAAA+K,WAAAlE,mIAWA,IAAA7G,KAAA2K,MAAAlE,YAAAjE,aAAAxC,KAAA+J,KAAA/J,KAAA2K,MAAAlE,YAAAjE,aAAAxC,KAAAgL,OAAA,QAAA,eAEA,CACA,IAAAhL,KAAA2K,MAAAlE,YAAApD,YAAA,KAAA1C,IAGA,IAAAkD,GAAA7D,KAAA2K,MAAAlE,YAAApD,YAAArD,KAAAgL,wBACYhL,KAAZiL,qBAAA,GAEapH,YAAbI,GAAAA,YACAJ,EAAAK,KAAA0D,EAAAA,UAAA5H,KAAA+K,aAAiB3G,UAAjB,SAAAC,GAAA,MAAA5B,GAAAwI,qBAAA5G,uIA1DAM,KAAAC,EAAAA,UAAAC,gCAfA+E,SAAA,cACEC,MACFqB,uBAAA,aACMC,oBAAN,qCACIC,cAAJ,OACItB,MAAJ,uFAsCAL,EAA+Ba,uCAH/Bb,KCtRA4B,EAAA,SAAA3I,GAoBE,QAAF2I,GAAwBX,EACAC,EACAtF,GAFtB,GAAF5C,GAGIC,EAHJC,KAAA3C,KAGU0K,EAAaC,IAHvB3K,WAAwByC,GAAxBiI,YAAwBA,EACAjI,EAAxBkI,MAAwBA,EACAlI,EAAxB4C,SAAwBA,IA8CxB,MA1D0CzC,GAA1CyI,EAAA3I,GAgBE2I,EAAFlL,UAAAmL,mBAAE,WAAA,GAAF7I,GAAAzC,IAEI,IADAA,KAAKsG,YAActG,KAAKqF,SAASkB,SAASlG,OAAOL,KAAK2K,MAAMnE,UACvDxG,KAAK2K,MAAMlE,YAAYpD,YAC1B,KAAM1C,IAEZ,IAAUkD,GAAgB7D,KAAK2K,MAAMlE,YAAYpD,YAAYrD,KAAKuE,KAC1DzD,OAAMgD,QAAQD,GAChB7D,KAAKuL,oBAAmB,GACf1H,YAAyBI,GAAAA,YAClCJ,EAAcK,KAAK0D,EAAAA,UAAU5H,KAAK+K,aAC/B3G,UAAU,SAAAoH,GAAU,MAAA/I,GAAK8I,oBAAoBC,KAElDxL,KAAKyL,WAAWzD,QAAQ9D,KAAK0D,EAAAA,UAAU5H,KAAK+K,aACvC3G,UAAU,WAAM,MAAA3B,GAAK8I,yBAG5BF,EAAFlL,UAAAuG,YAAE,WACE1G,KAAK0L,SACLhJ,EAAJvC,UAAUuG,YAAV/D,KAAA3C,OAIYqL,EAAZlL,UAAAoL,oBAAE,SAA8BlH,GAI5B,GAHIA,IACFrE,KAAK2L,UAAYtH,GAEfrE,KAAKyL,WAAWvI,QAAUlD,KAAK2L,UAAW,CAClD,GAAYzG,GAAgBlF,KAAKyL,WAAW1C,MAAM7D,aAC5ClF,MAAK2K,MAAM9C,kBAAkB7H,KAAK2L,UAAW3L,KAAKsG,YAAapB,EAAelF,KAAKgL,WAGnFhL,MAAKsG,YAAY2B,UAKXoD,EAAZlL,UAAAuL,OAAE,WACM1L,KAAKyL,YAAczL,KAAKyL,WAAW1C,QACrC/I,KAAKyL,WAAW1C,MAAM7D,cAAclD,QACpChC,KAAKsG,YAAY2B,0BAjEvBtD,KAACC,EAAAA,UAADC,OACEC,SAAU,uBACV8E,SAAU,oBACVC,MACEqB,uBAAwB,aACxBE,cAAe,OACftB,MAAS,sCAEX8B,YAAaC,QAASpC,EAAaqC,YAAaT,4CA1ClD1G,KAAEoH,EAAAA,aASFpH,KAAQS,IARRT,KAAEqH,EAAAA,qCAmDFP,aAAA9G,KAAG8F,EAAAA,gBAAH5F,MAAmBI,MAkDnBoG,GA1D0C5B,GCvCpCwC,EAAiB,gBAMvBC,EAAA,WAyCE,QAAFA,GAAsBC,EACAxB,EACAyB,EACAC,EACYC,GAJhC,GAAF7J,GAAAzC,IAAsBA,MAAtBmM,UAAsBA,EACAnM,KAAtB2K,MAAsBA,EACA3K,KAAtBoM,UAAsBA,EACApM,KAAtBqM,SAAsBA,EACYrM,KAAlCsM,KAAkCA,EAxCxBtM,KAAV+K,WAAuB,GAAIvF,GAAAA,QAGzBxF,KAAFuM,YAAgB,KA+BdvM,KAAFwM,QAAoB,GAOhBxM,KAAKyM,cACDzM,KAAKsM,MACPtM,KAAKsM,KAAKI,OAAOxI,KAAK0D,EAAAA,UAAU5H,KAAK+K,aAAa3G,UAAU,WAAM,MAAA3B,GAAKgK,gBAwB7E,MA7DErM,QAAF6F,eACMiG,EADN/L,UAAA,aAAE,WACsB,MAAOH,MAAK2M,YAClC,SAAUC,GACR5M,KAAK2M,OAASE,EAAAA,qBAAqBD,GACnC5M,KAAKyM,+CAQPrM,OAAF6F,eACMiG,EADN/L,UAAA,cAAE,WACgC,MAAOH,MAAKwM,aAC5C,SAAWM,GACb,GAAQF,GAAQE,EACRC,EAAQ,IAEZ,IAAsB,gBAAXD,GAAqB,CACpC,GAAYE,GAAQF,EAAOG,MAAMhB,EAC3BW,GAAQI,EAAM,GACdD,EAAQC,EAAM,IAAMD,EAGtB/M,KAAKuM,YAAcQ,EACnB/M,KAAKwM,QAAUK,EAAAA,qBAAqBD,GACpC5M,KAAKyM,+CAePP,EAAF/L,UAAAuG,YAAE,WACE1G,KAAK+K,WAAWnE,OAChB5G,KAAK+K,WAAWlE,YAIlBqF,EAAF/L,UAAA+M,eAAE,WACF,GAAUC,GAAanN,KAAKmM,UAAU5H,MAAQvE,KAAK2K,MAAMlE,YAAYlE,SAC7DvC,KAAK2K,MAAMlE,YAAYlE,SAASvC,KAAKmM,UAAU5H,MAC/C,KACE8E,EAAQrJ,KAAK2M,QAAUQ,CAC7B,OAAO9D,GAAQ,GAAGA,EAAQrJ,KAAKwM,QAAUxM,KAAKuM,YAAgB,MAGhEL,EAAF/L,UAAAsM,YAAE,WACF,GAAUW,GAAUpN,KAAKkN,iBACfG,EAAcrN,KAAKsM,MAA4B,QAApBtM,KAAKsM,KAAKM,MAAkB,eAAiB,aAE9E5M,MAAKoM,UAAUkB,SAAStN,KAAKqM,SAASkB,cAAeF,EAAaD,mBAtEtEzI,KAACC,EAAAA,UAADC,OACEC,SAAU,+DAVZH,KAAiB8E,IAAjB9E,KAAQS,IAHRT,KAA2D6I,EAAAA,YAA3D7I,KAAmBoH,EAAAA,aAFnBpH,KAAQ8I,EAAAA,eAARC,aAAA/I,KA2DegJ,EAAAA,gCAlCftE,QAAA1E,KAAG4F,EAAAA,MAAH1F,MAAS,wBAYTiI,SAAAnI,KAAG4F,EAAAA,MAAH1F,MAAS,+BAiDTqH,KC5EA0B,EAAA,WAaE,QAAFA,GAAwBjD,EACAwB,GADAnM,KAAxB2K,MAAwBA,EACA3K,KAAxBmM,UAAwBA,EAHZnM,KAAZ6N,YAAyB,EAYzB,MAfEzN,QAAF6F,eACM2H,EADNzN,UAAA,iBAAE,WAC2B,MAAOH,MAAK6N,gBACvC,SAAcjB,GAAkB5M,KAAK6N,WAAaC,EAAAA,sBAAsBlB,oCAMxEgB,EAAFzN,UAAA4N,QAAE,SAAQC,GACNhO,KAAKiO,UACDjO,KAAK2K,MAAMlE,YAAY7E,kBAAkB5B,KAAKmM,UAAU5H,MACxDvE,KAAK2K,MAAMlE,YAAYrF,OAAOpB,KAAKmM,UAAU5H,MAEjDyJ,EAAME,kCArBVvJ,KAACC,EAAAA,UAADC,OACEC,SAAU,sBACV+E,MACEsE,UAAW,2DARfxJ,KAAQS,IAART,KAAiB8E,uBAajBwE,YAAAtJ,KAAG4F,EAAAA,MAAH1F,MAAS,iCAeT+I,KCvBMQ,GACJ/C,EACA5G,EACAyH,EACA0B,EACAxI,EACAqE,EACAxE,GAGFoJ,EAAA,WAAA,QAAAA,MAM4B,sBAN5B1J,KAAC2J,EAAAA,SAADzJ,OACE0J,SAAUC,EAAAA,cACVC,QAASL,EACTM,aAAcN,EACdxC,WAAY+C,EAAAA,aAAclK,OAE5B4J"}
+{"version":3,"file":"cdk-tree.umd.min.js","sources":["../../node_modules/tslib/tslib.es6.js","../../src/cdk/tree/tree-errors.ts","../../src/cdk/tree/control/base-tree-control.ts","../../src/cdk/tree/control/flat-tree-control.ts","../../src/cdk/tree/control/nested-tree-control.ts","../../src/cdk/tree/node.ts","../../src/cdk/tree/outlet.ts","../../src/cdk/tree/tree.ts","../../src/cdk/tree/nested-node.ts","../../src/cdk/tree/padding.ts","../../src/cdk/tree/toggle.ts","../../src/cdk/tree/tree-module.ts"],"sourcesContent":["/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation. All rights reserved.\r\nLicensed under the Apache License, Version 2.0 (the \"License\"); you may not use\r\nthis file except in compliance with the License. You may obtain a copy of the\r\nLicense at http://www.apache.org/licenses/LICENSE-2.0\r\n\r\nTHIS CODE IS PROVIDED ON AN *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY\r\nKIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED\r\nWARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,\r\nMERCHANTABLITY OR NON-INFRINGEMENT.\r\n\r\nSee the Apache Version 2.0 License for specific language governing permissions\r\nand limitations under the License.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) if (e.indexOf(p[i]) < 0)\r\n            t[p[i]] = s[p[i]];\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    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;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : new P(function (resolve) { resolve(result.value); }).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\n            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;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport function __exportStar(m, exports) {\r\n    for (var p in m) if (!exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}\r\n\r\nexport function __values(o) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\r\n    if (m) return m.call(o);\r\n    return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    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); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    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; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    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);\r\n    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); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\r\n    result.default = mod;\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\n/**\n * Returns an error to be thrown when there is no usable data.\n * @docs-private\n */\nexport function getTreeNoValidDataSourceError() {\n  return Error(`A valid data source must be provided.`);\n}\n\n/**\n * Returns an error to be thrown when there are multiple nodes that are missing a when function.\n * @docs-private\n */\nexport function getTreeMultipleDefaultNodeDefsError() {\n  return Error(`There can only be one default row without a when predicate function.`);\n}\n\n/**\n * Returns an error to be thrown when there are no matching node defs for a particular set of data.\n * @docs-private\n */\nexport function getTreeMissingMatchingNodeDefError() {\n  return Error(`Could not find a matching node definition for the provided node data.`);\n}\n\n/**\n * Returns an error to be thrown when there are tree control.\n * @docs-private\n */\nexport function getTreeControlMissingError() {\n  return Error(`Could not find a tree control for the tree.`);\n}\n\n/**\n * Returns an error to be thrown when tree control did not implement functions for flat/nested node.\n * @docs-private\n */\nexport function getTreeControlFunctionsMissingError() {\n  return Error(`Could not find functions for nested/flat tree in tree control.`);\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\nimport {SelectionModel} from '@angular/cdk/collections';\nimport {Observable} from 'rxjs';\nimport {TreeControl} from './tree-control';\n\n/** Base tree control. It has basic toggle/expand/collapse operations on a single data node. */\nexport abstract class BaseTreeControl<T> implements TreeControl<T> {\n\n  /** Gets a list of descendent data nodes of a subtree rooted at given data node recursively. */\n  abstract getDescendants(dataNode: T): T[];\n\n  /** Expands all data nodes in the tree. */\n  abstract expandAll(): void;\n\n  /** Saved data node for `expandAll` action. */\n  dataNodes: T[];\n\n  /** A selection model with multi-selection to track expansion status. */\n  expansionModel: SelectionModel<T> = new SelectionModel<T>(true);\n\n  /** Get depth of a given data node, return the level number. This is for flat tree node. */\n  getLevel: (dataNode: T) => number;\n\n  /**\n   * Whether the data node is expandable. Returns true if expandable.\n   * This is for flat tree node.\n   */\n  isExpandable: (dataNode: T) => boolean;\n\n  /** Gets a stream that emits whenever the given data node's children change. */\n  getChildren: (dataNode: T) => (Observable<T[]> | T[]);\n\n  /** Toggles one single data node's expanded/collapsed state. */\n  toggle(dataNode: T): void {\n    this.expansionModel.toggle(dataNode);\n  }\n\n  /** Expands one single data node. */\n  expand(dataNode: T): void {\n    this.expansionModel.select(dataNode);\n  }\n\n  /** Collapses one single data node. */\n  collapse(dataNode: T): void {\n    this.expansionModel.deselect(dataNode);\n  }\n\n  /** Whether a given data node is expanded or not. Returns true if the data node is expanded. */\n  isExpanded(dataNode: T): boolean {\n    return this.expansionModel.isSelected(dataNode);\n  }\n\n  /** Toggles a subtree rooted at `node` recursively. */\n  toggleDescendants(dataNode: T): void {\n    this.expansionModel.isSelected(dataNode)\n        ? this.collapseDescendants(dataNode)\n        : this.expandDescendants(dataNode);\n  }\n\n  /** Collapse all dataNodes in the tree. */\n  collapseAll(): void {\n    this.expansionModel.clear();\n  }\n\n  /** Expands a subtree rooted at given data node recursively. */\n  expandDescendants(dataNode: T): void {\n    let toBeProcessed = [dataNode];\n    toBeProcessed.push(...this.getDescendants(dataNode));\n    this.expansionModel.select(...toBeProcessed);\n  }\n\n  /** Collapses a subtree rooted at given data node recursively. */\n  collapseDescendants(dataNode: T): void {\n    let toBeProcessed = [dataNode];\n    toBeProcessed.push(...this.getDescendants(dataNode));\n    this.expansionModel.deselect(...toBeProcessed);\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {BaseTreeControl} from './base-tree-control';\n\n/** Flat tree control. Able to expand/collapse a subtree recursively for flattened tree. */\nexport class FlatTreeControl<T> extends BaseTreeControl<T> {\n\n  /** Construct with flat tree data node functions getLevel and isExpandable. */\n  constructor(public getLevel: (dataNode: T) => number,\n              public isExpandable: (dataNode: T) => boolean) {\n    super();\n  }\n\n  /**\n   * Gets a list of the data node's subtree of descendent data nodes.\n   *\n   * To make this working, the `dataNodes` of the TreeControl must be flattened tree nodes\n   * with correct levels.\n   */\n  getDescendants(dataNode: T): T[] {\n    const startIndex = this.dataNodes.indexOf(dataNode);\n    const results: T[] = [];\n\n    // Goes through flattened tree nodes in the `dataNodes` array, and get all descendants.\n    // The level of descendants of a tree node must be greater than the level of the given\n    // tree node.\n    // If we reach a node whose level is equal to the level of the tree node, we hit a sibling.\n    // If we reach a node whose level is greater than the level of the tree node, we hit a\n    // sibling of an ancestor.\n    for (let i = startIndex + 1;\n        i < this.dataNodes.length && this.getLevel(dataNode) < this.getLevel(this.dataNodes[i]);\n        i++) {\n      results.push(this.dataNodes[i]);\n    }\n    return results;\n  }\n\n  /**\n   * Expands all data nodes in the tree.\n   *\n   * To make this working, the `dataNodes` variable of the TreeControl must be set to all flattened\n   * data nodes of the tree.\n   */\n  expandAll(): void {\n    this.expansionModel.select(...this.dataNodes);\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\nimport {Observable} from 'rxjs';\nimport {take, filter} from 'rxjs/operators';\nimport {BaseTreeControl} from './base-tree-control';\n\n/** Nested tree control. Able to expand/collapse a subtree recursively for NestedNode type. */\nexport class NestedTreeControl<T> extends BaseTreeControl<T> {\n\n  /** Construct with nested tree function getChildren. */\n  constructor(public getChildren: (dataNode: T) => (Observable<T[]> | T[])) {\n    super();\n  }\n\n  /**\n   * Expands all dataNodes in the tree.\n   *\n   * To make this working, the `dataNodes` variable of the TreeControl must be set to all root level\n   * data nodes of the tree.\n   */\n  expandAll(): void {\n    this.expansionModel.clear();\n    const allNodes = this.dataNodes.reduce((accumulator: T[], dataNode) =>\n        [...accumulator, ...this.getDescendants(dataNode), dataNode], []);\n    this.expansionModel.select(...allNodes);\n  }\n\n  /** Gets a list of descendant dataNodes of a subtree rooted at given data node recursively. */\n  getDescendants(dataNode: T): T[] {\n    const descendants: T[] = [];\n\n    this._getDescendants(descendants, dataNode);\n    // Remove the node itself\n    return descendants.splice(1);\n  }\n\n  /** A helper function to get descendants recursively. */\n  protected _getDescendants(descendants: T[], dataNode: T): void {\n    descendants.push(dataNode);\n    const childrenNodes = this.getChildren(dataNode);\n    if (Array.isArray(childrenNodes)) {\n      childrenNodes.forEach((child: T) => this._getDescendants(descendants, child));\n    } else if (childrenNodes instanceof Observable) {\n      childrenNodes.pipe(take(1), filter(Boolean)).subscribe(children => {\n        children.forEach((child: T) => this._getDescendants(descendants, child));\n      });\n    }\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {Directive, TemplateRef} from '@angular/core';\n\n\n/** Context provided to the tree node component. */\nexport class CdkTreeNodeOutletContext<T> {\n  /** Data for the node. */\n  $implicit: T;\n\n  /** Depth of the node. */\n  level: number;\n\n  /** Index location of the node. */\n  index?: number;\n\n  /** Length of the number of total dataNodes. */\n  count?: number;\n\n  constructor(data: T) {\n    this.$implicit = data;\n  }\n}\n\n/**\n * Data node definition for the CdkTree.\n * Captures the node's template and a when predicate that describes when this node should be used.\n */\n@Directive({\n  selector: '[cdkTreeNodeDef]',\n  inputs: [\n    'when: cdkTreeNodeDefWhen'\n  ],\n})\nexport class CdkTreeNodeDef<T> {\n  /**\n   * Function that should return true if this node template should be used for the provided node\n   * data and index. If left undefined, this node will be considered the default node template to\n   * use when no other when functions return true for the data.\n   * For every node, there must be at least one when function that passes or an undefined to\n   * default.\n   */\n  when: (index: number, nodeData: T) => boolean;\n\n  /** @docs-private */\n  constructor(public template: TemplateRef<any>) {}\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\nimport {\n  Directive,\n  ViewContainerRef,\n} from '@angular/core';\n\n/**\n * Outlet for nested CdkNode. Put `[cdkTreeNodeOutlet]` on a tag to place children dataNodes\n * inside the outlet.\n */\n@Directive({\n  selector: '[cdkTreeNodeOutlet]'\n})\nexport class CdkTreeNodeOutlet {\n  constructor(public viewContainer: ViewContainerRef) {}\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\nimport {FocusableOption} from '@angular/cdk/a11y';\nimport {CollectionViewer, DataSource} from '@angular/cdk/collections';\nimport {\n  AfterContentChecked,\n  ChangeDetectionStrategy,\n  ChangeDetectorRef,\n  Component,\n  ContentChildren,\n  Directive,\n  ElementRef,\n  Input,\n  IterableChangeRecord,\n  IterableDiffer,\n  IterableDiffers,\n  OnDestroy,\n  OnInit,\n  QueryList,\n  ViewChild,\n  ViewContainerRef,\n  ViewEncapsulation,\n  TrackByFunction\n} from '@angular/core';\nimport {BehaviorSubject, Observable, of as observableOf, Subject, Subscription} from 'rxjs';\nimport {takeUntil} from 'rxjs/operators';\nimport {TreeControl} from './control/tree-control';\nimport {CdkTreeNodeDef, CdkTreeNodeOutletContext} from './node';\nimport {CdkTreeNodeOutlet} from './outlet';\nimport {\n  getTreeControlFunctionsMissingError,\n  getTreeControlMissingError,\n  getTreeMissingMatchingNodeDefError,\n  getTreeMultipleDefaultNodeDefsError,\n  getTreeNoValidDataSourceError\n} from './tree-errors';\n\n/**\n * CDK tree component that connects with a data source to retrieve data of type `T` and renders\n * dataNodes with hierarchy. Updates the dataNodes when new data is provided by the data source.\n */\n@Component({\n  moduleId: module.id,\n  selector: 'cdk-tree',\n  exportAs: 'cdkTree',\n  template: `<ng-container cdkTreeNodeOutlet></ng-container>`,\n  host: {\n    'class': 'cdk-tree',\n    'role': 'tree',\n  },\n  encapsulation: ViewEncapsulation.None,\n  changeDetection: ChangeDetectionStrategy.OnPush\n})\nexport class CdkTree<T>\n    implements AfterContentChecked, CollectionViewer, OnDestroy, OnInit {\n  /** Subject that emits when the component has been destroyed. */\n  private _onDestroy = new Subject<void>();\n\n  /** Differ used to find the changes in the data provided by the data source. */\n  private _dataDiffer: IterableDiffer<T>;\n\n  /** Stores the node definition that does not have a when predicate. */\n  private _defaultNodeDef: CdkTreeNodeDef<T> | null;\n\n  /** Data subscription */\n  private _dataSubscription: Subscription | null;\n\n  /** Level of nodes */\n  private _levels: Map<T, number> = new Map<T, number>();\n\n  /**\n   * Provides a stream containing the latest data array to render. Influenced by the tree's\n   * stream of view window (what dataNodes are currently on screen).\n   * Data source can be an observable of data array, or a data array to render.\n   */\n  @Input()\n  get dataSource(): DataSource<T> | Observable<T[]> | T[] { return this._dataSource; }\n  set dataSource(dataSource: DataSource<T> | Observable<T[]> | T[]) {\n    if (this._dataSource !== dataSource) {\n      this._switchDataSource(dataSource);\n    }\n  }\n  private _dataSource: DataSource<T> | Observable<T[]> | T[];\n\n  /** The tree controller */\n  @Input() treeControl: TreeControl<T>;\n\n  /**\n   * Tracking function that will be used to check the differences in data changes. Used similarly\n   * to `ngFor` `trackBy` function. Optimize node operations by identifying a node based on its data\n   * relative to the function to know if a node should be added/removed/moved.\n   * Accepts a function that takes two parameters, `index` and `item`.\n   */\n  @Input() trackBy: TrackByFunction<T>;\n\n  // Outlets within the tree's template where the dataNodes will be inserted.\n  @ViewChild(CdkTreeNodeOutlet) _nodeOutlet: CdkTreeNodeOutlet;\n\n  /** The tree node template for the tree */\n  @ContentChildren(CdkTreeNodeDef) _nodeDefs: QueryList<CdkTreeNodeDef<T>>;\n\n  // TODO(tinayuangao): Setup a listener for scrolling, emit the calculated view to viewChange.\n  //     Remove the MAX_VALUE in viewChange\n  /**\n   * Stream containing the latest information on what rows are being displayed on screen.\n   * Can be used by the data source to as a heuristic of what data should be provided.\n   */\n  viewChange =\n    new BehaviorSubject<{start: number, end: number}>({start: 0, end: Number.MAX_VALUE});\n\n  constructor(private _differs: IterableDiffers,\n              private _changeDetectorRef: ChangeDetectorRef) {}\n\n  ngOnInit() {\n    this._dataDiffer = this._differs.find([]).create(this.trackBy);\n    if (!this.treeControl) {\n      throw getTreeControlMissingError();\n    }\n  }\n\n  ngOnDestroy() {\n    this._nodeOutlet.viewContainer.clear();\n\n    this._onDestroy.next();\n    this._onDestroy.complete();\n\n    if (this._dataSource && typeof (this._dataSource as DataSource<T>).disconnect === 'function') {\n      (this.dataSource as DataSource<T>).disconnect(this);\n    }\n\n    if (this._dataSubscription) {\n      this._dataSubscription.unsubscribe();\n      this._dataSubscription = null;\n    }\n  }\n\n  ngAfterContentChecked() {\n    const defaultNodeDefs = this._nodeDefs.filter(def => !def.when);\n    if (defaultNodeDefs.length > 1) {\n      throw getTreeMultipleDefaultNodeDefsError();\n    }\n    this._defaultNodeDef = defaultNodeDefs[0];\n\n    if (this.dataSource && this._nodeDefs && !this._dataSubscription) {\n      this._observeRenderChanges();\n    }\n  }\n\n\n  // TODO(tinayuangao): Work on keyboard traversal and actions, make sure it's working for RTL\n  //     and nested trees.\n\n  /**\n   * Switch to the provided data source by resetting the data and unsubscribing from the current\n   * render change subscription if one exists. If the data source is null, interpret this by\n   * clearing the node outlet. Otherwise start listening for new data.\n   */\n  private _switchDataSource(dataSource: DataSource<T> | Observable<T[]> | T[]) {\n    if (this._dataSource && typeof (this._dataSource as DataSource<T>).disconnect === 'function') {\n      (this.dataSource as DataSource<T>).disconnect(this);\n    }\n\n    if (this._dataSubscription) {\n      this._dataSubscription.unsubscribe();\n      this._dataSubscription = null;\n    }\n\n    // Remove the all dataNodes if there is now no data source\n    if (!dataSource) {\n      this._nodeOutlet.viewContainer.clear();\n    }\n\n    this._dataSource = dataSource;\n    if (this._nodeDefs) {\n      this._observeRenderChanges();\n    }\n  }\n\n  /** Set up a subscription for the data provided by the data source. */\n  private _observeRenderChanges() {\n    let dataStream: Observable<T[] | ReadonlyArray<T>> | undefined;\n\n    // Cannot use `instanceof DataSource` since the data source could be a literal with\n    // `connect` function and may not extends DataSource.\n    if (typeof (this._dataSource as DataSource<T>).connect === 'function') {\n      dataStream = (this._dataSource as DataSource<T>).connect(this);\n    } else if (this._dataSource instanceof Observable) {\n      dataStream = this._dataSource;\n    } else if (Array.isArray(this._dataSource)) {\n      dataStream = observableOf(this._dataSource);\n    }\n\n    if (dataStream) {\n      this._dataSubscription = dataStream.pipe(takeUntil(this._onDestroy))\n        .subscribe(data => this.renderNodeChanges(data));\n    } else {\n      throw getTreeNoValidDataSourceError();\n    }\n  }\n\n  /** Check for changes made in the data and render each change (node added/removed/moved). */\n  renderNodeChanges(data: T[] | ReadonlyArray<T>, dataDiffer: IterableDiffer<T> = this._dataDiffer,\n                    viewContainer: ViewContainerRef = this._nodeOutlet.viewContainer,\n                    parentData?: T) {\n    const changes = dataDiffer.diff(data);\n    if (!changes) { return; }\n\n    changes.forEachOperation((item: IterableChangeRecord<T>,\n                              adjustedPreviousIndex: number | null,\n                              currentIndex: number | null) => {\n        if (item.previousIndex == null) {\n          this.insertNode(data[currentIndex!], currentIndex!, viewContainer, parentData);\n        } else if (currentIndex == null) {\n          viewContainer.remove(adjustedPreviousIndex!);\n          this._levels.delete(item.item);\n        } else {\n          const view = viewContainer.get(adjustedPreviousIndex!);\n          viewContainer.move(view!, currentIndex);\n        }\n      });\n\n    this._changeDetectorRef.detectChanges();\n  }\n\n  /**\n   * Finds the matching node definition that should be used for this node data. If there is only\n   * one node definition, it is returned. Otherwise, find the node definition that has a when\n   * predicate that returns true with the data. If none return true, return the default node\n   * definition.\n   */\n  _getNodeDef(data: T, i: number): CdkTreeNodeDef<T> {\n    if (this._nodeDefs.length === 1) { return this._nodeDefs.first; }\n\n    const nodeDef =\n      this._nodeDefs.find(def => def.when && def.when(i, data)) || this._defaultNodeDef;\n    if (!nodeDef) { throw getTreeMissingMatchingNodeDefError(); }\n\n    return nodeDef;\n  }\n\n  /**\n   * Create the embedded view for the data node template and place it in the correct index location\n   * within the data node view container.\n   */\n  insertNode(nodeData: T, index: number, viewContainer?: ViewContainerRef, parentData?: T) {\n    const node = this._getNodeDef(nodeData, index);\n\n    // Node context that will be provided to created embedded view\n    const context = new CdkTreeNodeOutletContext<T>(nodeData);\n\n    // If the tree is flat tree, then use the `getLevel` function in flat tree control\n    // Otherwise, use the level of parent node.\n    if (this.treeControl.getLevel) {\n      context.level = this.treeControl.getLevel(nodeData);\n    } else if (typeof parentData !== 'undefined' && this._levels.has(parentData)) {\n      context.level = this._levels.get(parentData)! + 1;\n    } else {\n      context.level = 0;\n    }\n    this._levels.set(nodeData, context.level);\n\n    // Use default tree nodeOutlet, or nested node's nodeOutlet\n    const container = viewContainer ? viewContainer : this._nodeOutlet.viewContainer;\n    container.createEmbeddedView(node.template, context, index);\n\n    // Set the data to just created `CdkTreeNode`.\n    // The `CdkTreeNode` created from `createEmbeddedView` will be saved in static variable\n    //     `mostRecentTreeNode`. We get it from static variable and pass the node data to it.\n    if (CdkTreeNode.mostRecentTreeNode) {\n      CdkTreeNode.mostRecentTreeNode.data = nodeData;\n    }\n  }\n}\n\n\n/**\n * Tree node for CdkTree. It contains the data in the tree node.\n */\n@Directive({\n  selector: 'cdk-tree-node',\n  exportAs: 'cdkTreeNode',\n  host: {\n    '[attr.aria-expanded]': 'isExpanded',\n    '[attr.aria-level]': 'role === \"treeitem\" ? level : null',\n    '[attr.role]': 'role',\n    'class': 'cdk-tree-node',\n  },\n})\nexport class CdkTreeNode<T> implements FocusableOption, OnDestroy {\n  /**\n   * The most recently created `CdkTreeNode`. We save it in static variable so we can retrieve it\n   * in `CdkTree` and set the data to it.\n   */\n  static mostRecentTreeNode: CdkTreeNode<any> | null = null;\n\n  /** Subject that emits when the component has been destroyed. */\n  protected _destroyed = new Subject<void>();\n\n  /** The tree node's data. */\n  get data(): T { return this._data; }\n  set data(value: T) {\n    this._data = value;\n    this._setRoleFromData();\n  }\n  protected _data: T;\n\n  get isExpanded(): boolean {\n    return this._tree.treeControl.isExpanded(this._data);\n  }\n\n  get level(): number {\n    return this._tree.treeControl.getLevel ? this._tree.treeControl.getLevel(this._data) : 0;\n  }\n\n  /**\n   * The role of the node should be 'group' if it's an internal node,\n   * and 'treeitem' if it's a leaf node.\n   */\n  @Input() role: 'treeitem' | 'group' = 'treeitem';\n\n  constructor(protected _elementRef: ElementRef<HTMLElement>,\n              protected _tree: CdkTree<T>) {\n    CdkTreeNode.mostRecentTreeNode = this as CdkTreeNode<T>;\n  }\n\n  ngOnDestroy() {\n    // If this is the last tree node being destroyed,\n    // clear out the reference to avoid leaking memory.\n    if (CdkTreeNode.mostRecentTreeNode === this) {\n      CdkTreeNode.mostRecentTreeNode = null;\n    }\n\n    this._destroyed.next();\n    this._destroyed.complete();\n  }\n\n  /** Focuses the menu item. Implements for FocusableOption. */\n  focus(): void {\n    this._elementRef.nativeElement.focus();\n  }\n\n  protected _setRoleFromData(): void {\n    if (this._tree.treeControl.isExpandable) {\n      this.role = this._tree.treeControl.isExpandable(this._data) ? 'group' : 'treeitem';\n    } else {\n      if (!this._tree.treeControl.getChildren) {\n        throw getTreeControlFunctionsMissingError();\n      }\n      const childrenNodes = this._tree.treeControl.getChildren(this._data);\n      if (Array.isArray(childrenNodes)) {\n        this._setRoleFromChildren(childrenNodes as T[]);\n      } else if (childrenNodes instanceof Observable) {\n        childrenNodes.pipe(takeUntil(this._destroyed))\n            .subscribe(children => this._setRoleFromChildren(children));\n      }\n    }\n  }\n\n  protected _setRoleFromChildren(children: T[]) {\n    this.role = children && children.length ? 'group' : 'treeitem';\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\nimport {\n  AfterContentInit,\n  ContentChildren,\n  Directive,\n  ElementRef,\n  IterableDiffers,\n  IterableDiffer,\n  OnDestroy,\n  QueryList,\n} from '@angular/core';\nimport {Observable} from 'rxjs';\nimport {takeUntil} from 'rxjs/operators';\n\nimport {CdkTree, CdkTreeNode} from './tree';\nimport {CdkTreeNodeOutlet} from './outlet';\nimport {getTreeControlFunctionsMissingError} from './tree-errors';\n\n/**\n * Nested node is a child of `<cdk-tree>`. It works with nested tree.\n * By using `cdk-nested-tree-node` component in tree node template, children of the parent node will\n * be added in the `cdkTreeNodeOutlet` in tree node template.\n * For example:\n *   ```html\n *   <cdk-nested-tree-node>\n *     {{node.name}}\n *     <ng-template cdkTreeNodeOutlet></ng-template>\n *   </cdk-nested-tree-node>\n *   ```\n * The children of node will be automatically added to `cdkTreeNodeOutlet`, the result dom will be\n * like this:\n *   ```html\n *   <cdk-nested-tree-node>\n *     {{node.name}}\n *      <cdk-nested-tree-node>{{child1.name}}</cdk-nested-tree-node>\n *      <cdk-nested-tree-node>{{child2.name}}</cdk-nested-tree-node>\n *   </cdk-nested-tree-node>\n *   ```\n */\n@Directive({\n  selector: 'cdk-nested-tree-node',\n  exportAs: 'cdkNestedTreeNode',\n  host: {\n    '[attr.aria-expanded]': 'isExpanded',\n    '[attr.role]': 'role',\n    'class': 'cdk-tree-node cdk-nested-tree-node',\n  },\n  providers: [{provide: CdkTreeNode, useExisting: CdkNestedTreeNode}]\n})\nexport class CdkNestedTreeNode<T> extends CdkTreeNode<T> implements AfterContentInit, OnDestroy {\n  /** Differ used to find the changes in the data provided by the data source. */\n  private _dataDiffer: IterableDiffer<T>;\n\n  /** The children data dataNodes of current node. They will be placed in `CdkTreeNodeOutlet`. */\n  protected _children: T[];\n\n  /** The children node placeholder. */\n  @ContentChildren(CdkTreeNodeOutlet) nodeOutlet: QueryList<CdkTreeNodeOutlet>;\n\n  constructor(protected _elementRef: ElementRef<HTMLElement>,\n              protected _tree: CdkTree<T>,\n              protected _differs: IterableDiffers) {\n    super(_elementRef, _tree);\n  }\n\n  ngAfterContentInit() {\n    this._dataDiffer = this._differs.find([]).create(this._tree.trackBy);\n    if (!this._tree.treeControl.getChildren) {\n      throw getTreeControlFunctionsMissingError();\n    }\n    const childrenNodes = this._tree.treeControl.getChildren(this.data);\n    if (Array.isArray(childrenNodes)) {\n      this.updateChildrenNodes(childrenNodes as T[]);\n    } else if (childrenNodes instanceof Observable) {\n      childrenNodes.pipe(takeUntil(this._destroyed))\n        .subscribe(result => this.updateChildrenNodes(result));\n    }\n    this.nodeOutlet.changes.pipe(takeUntil(this._destroyed))\n        .subscribe(() => this.updateChildrenNodes());\n  }\n\n  ngOnDestroy() {\n    this._clear();\n    super.ngOnDestroy();\n  }\n\n  /** Add children dataNodes to the NodeOutlet */\n  protected updateChildrenNodes(children?: T[]): void {\n    if (children) {\n      this._children = children;\n    }\n    if (this.nodeOutlet.length && this._children) {\n      const viewContainer = this.nodeOutlet.first.viewContainer;\n      this._tree.renderNodeChanges(this._children, this._dataDiffer, viewContainer, this._data);\n    } else {\n      // Reset the data differ if there's no children nodes displayed\n      this._dataDiffer.diff([]);\n    }\n  }\n\n  /** Clear the children dataNodes. */\n  protected _clear(): void {\n    if (this.nodeOutlet && this.nodeOutlet.first) {\n      this.nodeOutlet.first.viewContainer.clear();\n      this._dataDiffer.diff([]);\n    }\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {Directionality} from '@angular/cdk/bidi';\nimport {coerceNumberProperty} from '@angular/cdk/coercion';\nimport {Directive, ElementRef, Input, OnDestroy, Optional, Renderer2} from '@angular/core';\nimport {takeUntil} from 'rxjs/operators';\nimport {Subject} from 'rxjs';\nimport {CdkTree, CdkTreeNode} from './tree';\n\n/** Regex used to split a string on its CSS units. */\nconst cssUnitPattern = /([A-Za-z%]+)$/;\n\n/**\n * Indent for the children tree dataNodes.\n * This directive will add left-padding to the node to show hierarchy.\n */\n@Directive({\n  selector: '[cdkTreeNodePadding]',\n})\nexport class CdkTreeNodePadding<T> implements OnDestroy {\n  /** Subject that emits when the component has been destroyed. */\n  private _destroyed = new Subject<void>();\n\n  /** CSS units used for the indentation value. */\n  indentUnits = 'px';\n\n  /** The level of depth of the tree node. The padding will be `level * indent` pixels. */\n  @Input('cdkTreeNodePadding')\n  get level(): number { return this._level; }\n  set level(value: number) {\n    this._level = coerceNumberProperty(value);\n    this._setPadding();\n  }\n  _level: number;\n\n  /**\n   * The indent for each level. Can be a number or a CSS string.\n   * Default number 40px from material design menu sub-menu spec.\n   */\n  @Input('cdkTreeNodePaddingIndent')\n  get indent(): number | string { return this._indent; }\n  set indent(indent: number | string) {\n    let value = indent;\n    let units = 'px';\n\n    if (typeof indent === 'string') {\n      const parts = indent.split(cssUnitPattern);\n      value = parts[0];\n      units = parts[1] || units;\n    }\n\n    this.indentUnits = units;\n    this._indent = coerceNumberProperty(value);\n    this._setPadding();\n  }\n  _indent: number = 40;\n\n  constructor(private _treeNode: CdkTreeNode<T>,\n              private _tree: CdkTree<T>,\n              private _renderer: Renderer2,\n              private _element: ElementRef<HTMLElement>,\n              @Optional() private _dir: Directionality) {\n    this._setPadding();\n    if (this._dir) {\n      this._dir.change.pipe(takeUntil(this._destroyed)).subscribe(() => this._setPadding());\n    }\n  }\n\n  ngOnDestroy() {\n    this._destroyed.next();\n    this._destroyed.complete();\n  }\n\n  /** The padding indent value for the tree node. Returns a string with px numbers if not null. */\n  _paddingIndent(): string|null {\n    const nodeLevel = (this._treeNode.data && this._tree.treeControl.getLevel)\n      ? this._tree.treeControl.getLevel(this._treeNode.data)\n      : null;\n    const level = this._level || nodeLevel;\n    return level ? `${level * this._indent}${this.indentUnits}` : null;\n  }\n\n  _setPadding() {\n    const padding = this._paddingIndent();\n    const paddingProp = this._dir && this._dir.value === 'rtl' ? 'paddingRight' : 'paddingLeft';\n\n    this._renderer.setStyle(this._element.nativeElement, paddingProp, padding);\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {coerceBooleanProperty} from '@angular/cdk/coercion';\nimport {\n  Directive,\n  Input,\n} from '@angular/core';\nimport {CdkTree, CdkTreeNode} from './tree';\n\n/**\n * Node toggle to expand/collapse the node.\n */\n@Directive({\n  selector: '[cdkTreeNodeToggle]',\n  host: {\n    '(click)': '_toggle($event)',\n  }\n})\nexport class CdkTreeNodeToggle<T> {\n  /** Whether expand/collapse the node recursively. */\n  @Input('cdkTreeNodeToggleRecursive')\n  get recursive(): boolean { return this._recursive; }\n  set recursive(value: boolean) { this._recursive = coerceBooleanProperty(value); }\n  protected _recursive = false;\n\n  constructor(protected _tree: CdkTree<T>,\n              protected _treeNode: CdkTreeNode<T>) {}\n\n  _toggle(event: Event): void {\n    this.recursive\n      ? this._tree.treeControl.toggleDescendants(this._treeNode.data)\n      : this._tree.treeControl.toggle(this._treeNode.data);\n\n    event.stopPropagation();\n  }\n}\n","/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {FocusMonitor} from '@angular/cdk/a11y';\nimport {CommonModule} from '@angular/common';\nimport {NgModule} from '@angular/core';\nimport {CdkTreeNodeOutlet} from './outlet';\nimport {CdkTreeNodePadding} from './padding';\nimport {CdkTreeNodeToggle} from './toggle';\nimport {CdkTree, CdkTreeNode} from './tree';\nimport {CdkTreeNodeDef} from './node';\nimport {CdkNestedTreeNode} from './nested-node';\n\nconst EXPORTED_DECLARATIONS = [\n  CdkNestedTreeNode,\n  CdkTreeNodeDef,\n  CdkTreeNodePadding,\n  CdkTreeNodeToggle,\n  CdkTree,\n  CdkTreeNode,\n  CdkTreeNodeOutlet,\n];\n\n@NgModule({\n  imports: [CommonModule],\n  exports: EXPORTED_DECLARATIONS,\n  declarations: EXPORTED_DECLARATIONS,\n  providers: [FocusMonitor, CdkTreeNodeDef]\n})\nexport class CdkTreeModule {}\n"],"names":["__extends","d","b","__","this","constructor","extendStatics","prototype","Object","create","getTreeNoValidDataSourceError","Error","getTreeMultipleDefaultNodeDefsError","getTreeMissingMatchingNodeDefError","getTreeControlMissingError","getTreeControlFunctionsMissingError","setPrototypeOf","__proto__","Array","p","hasOwnProperty","BaseTreeControl","expansionModel","SelectionModel","toggle","dataNode","expand","select","collapse","deselect","isExpanded","isSelected","toggleDescendants","collapseDescendants","expandDescendants","collapseAll","clear","toBeProcessed","push","apply","getDescendants","_a","FlatTreeControl","getLevel","isExpandable","_this","_super","call","tslib_1.__extends","startIndex","dataNodes","indexOf","results","i","length","expandAll","NestedTreeControl","getChildren","allNodes","reduce","accumulator","concat","descendants","_getDescendants","splice","childrenNodes","isArray","forEach","child","Observable","pipe","take","filter","Boolean","subscribe","children","CdkTreeNodeOutletContext","data","$implicit","CdkTreeNodeDef","template","type","Directive","args","selector","inputs","TemplateRef","CdkTreeNodeOutlet","viewContainer","ViewContainerRef","CdkTree","_differs","_changeDetectorRef","_onDestroy","Subject","_levels","Map","viewChange","BehaviorSubject","start","end","Number","MAX_VALUE","defineProperty","_dataSource","dataSource","_switchDataSource","ngOnInit","_dataDiffer","find","trackBy","treeControl","ngOnDestroy","_nodeOutlet","next","complete","disconnect","_dataSubscription","unsubscribe","ngAfterContentChecked","defaultNodeDefs","_nodeDefs","def","when","_defaultNodeDef","_observeRenderChanges","dataStream","connect","observableOf","takeUntil","renderNodeChanges","dataDiffer","parentData","changes","diff","forEachOperation","item","adjustedPreviousIndex","currentIndex","previousIndex","insertNode","remove","delete","view","get","move","detectChanges","_getNodeDef","first","nodeDef","nodeData","index","node","context","level","has","set","createEmbeddedView","CdkTreeNode","mostRecentTreeNode","Component","exportAs","host","class","role","encapsulation","ViewEncapsulation","None","changeDetection","ChangeDetectionStrategy","OnPush","propDecorators","Input","ViewChild","ContentChildren","_elementRef","_tree","_setRoleFromData","enumerable","configurable","_destroyed","_data","_setRoleFromChildren","[attr.aria-expanded]","[attr.aria-level]","[attr.role]","CdkNestedTreeNode","ngAfterContentInit","updateChildrenNodes","result","nodeOutlet","_clear","_children","providers","provide","useExisting","ElementRef","IterableDiffers","cssUnitPattern","CdkTreeNodePadding","_treeNode","_renderer","_element","_dir","indentUnits","_indent","_setPadding","change","_level","value","coerceNumberProperty","indent","units","parts","split","_paddingIndent","nodeLevel","padding","paddingProp","setStyle","nativeElement","Renderer2","Directionality","decorators","Optional","CdkTreeNodeToggle","_recursive","coerceBooleanProperty","_toggle","event","recursive","stopPropagation","(click)","EXPORTED_DECLARATIONS","CdkTreeModule","NgModule","imports","CommonModule","exports","declarations","FocusMonitor"],"mappings":";;;;;;;0uBAuBA,SAAgBA,GAAUC,EAAGC,GAEzB,QAASC,KAAOC,KAAKC,YAAcJ,EADnCK,EAAcL,EAAGC,GAEjBD,EAAEM,UAAkB,OAANL,EAAaM,OAAOC,OAAOP,IAAMC,EAAGI,UAAYL,EAAEK,UAAW,GAAIJ,ICdnF,QAAgBO,KACd,MAAOC,OAAM,yCAOf,QAAgBC,KACd,MAAOD,OAAM,wEAOf,QAAgBE,KACd,MAAOF,OAAM,yEAOf,QAAgBG,KACd,MAAOH,OAAM,+CAOf,QAAgBI,KACd,MAAOJ,OAAM,kED7Bf,GAAIL,GAAgB,SAASL,EAAGC,GAI5B,OAHAI,EAAgBE,OAAOQ,iBAChBC,uBAA2BC,QAAS,SAAUjB,EAAGC,GAAKD,EAAEgB,UAAYf,IACvE,SAAUD,EAAGC,GAAK,IAAK,GAAIiB,KAAKjB,GAAOA,EAAEkB,eAAeD,KAAIlB,EAAEkB,GAAKjB,EAAEiB,MACpDlB,EAAGC,iBER5B,QAAAmB,KAYEjB,KAAFkB,eAAsC,GAAIC,GAAAA,gBAAkB,GA2D5D,MA5CEF,GAAFd,UAAAiB,OAAE,SAAOC,GACLrB,KAAKkB,eAAeE,OAAOC,IAI7BJ,EAAFd,UAAAmB,OAAE,SAAOD,GACLrB,KAAKkB,eAAeK,OAAOF,IAI7BJ,EAAFd,UAAAqB,SAAE,SAASH,GACPrB,KAAKkB,eAAeO,SAASJ,IAI/BJ,EAAFd,UAAAuB,WAAE,SAAWL,GACT,MAAOrB,MAAKkB,eAAeS,WAAWN,IAIxCJ,EAAFd,UAAAyB,kBAAE,SAAkBP,GAChBrB,KAAKkB,eAAeS,WAAWN,GACzBrB,KAAK6B,oBAAoBR,GACzBrB,KAAK8B,kBAAkBT,IAI/BJ,EAAFd,UAAA4B,YAAE,WACE/B,KAAKkB,eAAec,SAItBf,EAAFd,UAAA2B,kBAAE,SAAkBT,SACZY,GAAiBZ,EACrBY,GAAcC,KAAlBC,MAAIF,EAAsBjC,KAAKoC,eAAef,KAC1CgB,EAAArC,KAAKkB,gBAAeK,OAAxBY,MAAAE,EAAkCJ,IAIhChB,EAAFd,UAAA0B,oBAAE,SAAoBR,SACdY,GAAiBZ,EACrBY,GAAcC,KAAlBC,MAAIF,EAAsBjC,KAAKoC,eAAef,KAC1CgB,EAAArC,KAAKkB,gBAAeO,SAAxBU,MAAAE,EAAoCJ,IAEpChB,mBCrEE,QAAFqB,GAAqBC,EACAC,GADnB,GAAFC,GAEIC,EAFJC,KAAA3C,OAAAA,WAAqByC,GAArBF,SAAqBA,EACAE,EAArBD,aAAqBA,IAqCrB,MAzCwCI,GAAxCN,EAAAI,GAcEJ,EAAFnC,UAAAiC,eAAE,SAAef,GAUb,IAAK,GATCwB,GAAa7C,KAAK8C,UAAUC,QAAQ1B,GACpC2B,KAQGC,EAAIJ,EAAa,EACtBI,EAAIjD,KAAK8C,UAAUI,QAAUlD,KAAKuC,SAASlB,GAAYrB,KAAKuC,SAASvC,KAAK8C,UAAUG,IACpFA,IACFD,EAAQd,KAAKlC,KAAK8C,UAAUG,GAE9B,OAAOD,IASTV,EAAFnC,UAAAgD,UAAE,kBACEd,EAAArC,KAAKkB,gBAAeK,OAAxBY,MAAAE,EAAkCrC,KAAK8C,YAEvCR,GAzCwCrB,iBCItC,QAAFmC,GAAqBC,GAAnB,GAAFZ,GACIC,EADJC,KAAA3C,OAAAA,WAAqByC,GAArBY,YAAqBA,IAsCrB,MAzC0CT,GAA1CQ,EAAAV,GAaEU,EAAFjD,UAAAgD,UAAE,WAAA,MAAFV,EAAAzC,IACIA,MAAKkB,eAAec,OACxB,IAAUsB,GAAWtD,KAAK8C,UAAUS,OAAO,SAACC,EAAkBnC,GACtD,MAAImC,GAAZC,OAA4BhB,EAAKL,eAAef,IAAWA,UACvDgB,EAAArC,KAAKkB,gBAAeK,OAAxBY,MAAAE,EAAkCiB,IAIhCF,EAAFjD,UAAAiC,eAAE,SAAef,GACjB,GAAUqC,KAIN,OAFA1D,MAAK2D,gBAAgBD,EAAarC,GAE3BqC,EAAYE,OAAO,IAIlBR,EAAZjD,UAAAwD,gBAAE,SAA0BD,EAAkBrC,GAA5C,GAAFoB,GAAAzC,IACI0D,GAAYxB,KAAKb,EACrB,IAAUwC,GAAgB7D,KAAKqD,YAAYhC,EACnCP,OAAMgD,QAAQD,GAChBA,EAAcE,QAAQ,SAACC,GAAa,MAAAvB,GAAKkB,gBAAgBD,EAAaM,KAC7DH,YAAyBI,GAAAA,YAClCJ,EAAcK,KAAKC,EAAAA,KAAK,GAAIC,EAAAA,OAAOC,UAAUC,UAAU,SAAAC,GACrDA,EAASR,QAAQ,SAACC,GAAa,MAAAvB,GAAKkB,gBAAgBD,EAAaM,QAIzEZ,GAzC0CnC,gBCaxC,QAAFuD,GAAcC,GACVzE,KAAK0E,UAAYD,EAErB,MAAAD,MAMAG,EAAA,WAiBE,QAAFA,GAAqBC,GAAA5E,KAArB4E,SAAqBA,EACrB,sBAlBAC,KAACC,EAAAA,UAADC,OACEC,SAAU,mBACVC,QACE,oEA7BJJ,KAAmBK,EAAAA,eA4CnBP,KCpCAQ,EAAA,WAIE,QAAFA,GAAqBC,GAAApF,KAArBoF,cAAqBA,EACrB,sBALAP,KAACC,EAAAA,UAADC,OACEC,SAAU,8DARZH,KAAEQ,EAAAA,oBAYFF,KCyBAG,EAAA,WAqEE,QAAFA,GAAsBC,EACAC,GADAxF,KAAtBuF,SAAsBA,EACAvF,KAAtBwF,mBAAsBA,EAvDZxF,KAAVyF,WAAuB,GAAIC,GAAAA,QAYjB1F,KAAV2F,QAAoC,GAAIC,KAuCtC5F,KAAF6F,WACI,GAAIC,GAAAA,iBAA+CC,MAAO,EAAGC,IAAKC,OAAOC,YAT7E,MAxBE9F,QAAF+F,eACMb,EADNnF,UAAA,kBAAE,WAC0D,MAAOH,MAAKoG,iBACtE,SAAeC,GACTrG,KAAKoG,cAAgBC,GACvBrG,KAAKsG,kBAAkBD,oCAkC3Bf,EAAFnF,UAAAoG,SAAE,WAEE,GADAvG,KAAKwG,YAAcxG,KAAKuF,SAASkB,SAASpG,OAAOL,KAAK0G,UACjD1G,KAAK2G,YACR,KAAMjG,MAIV4E,EAAFnF,UAAAyG,YAAE,WACE5G,KAAK6G,YAAYzB,cAAcpD,QAE/BhC,KAAKyF,WAAWqB,OAChB9G,KAAKyF,WAAWsB,WAEZ/G,KAAKoG,aAAyE,kBAAlDpG,MAAgB,YAAmBgH,YAChEhH,KAAe,WAAmBgH,WAAWhH,MAG5CA,KAAKiH,oBACPjH,KAAKiH,kBAAkBC,cACvBlH,KAAKiH,kBAAoB,OAI7B3B,EAAFnF,UAAAgH,sBAAE,WACF,GAAUC,GAAkBpH,KAAKqH,UAAUjD,OAAO,SAAAkD,GAAO,OAACA,EAAIC,MAC1D,IAAIH,EAAgBlE,OAAS,EAC3B,KAAM1C,IAERR,MAAKwH,gBAAkBJ,EAAgB,GAEnCpH,KAAKqG,YAAcrG,KAAKqH,YAAcrH,KAAKiH,mBAC7CjH,KAAKyH,yBAaDnC,EAAVnF,UAAAmG,kBAAE,SAA0BD,GACpBrG,KAAKoG,aAAyE,kBAAlDpG,MAAgB,YAAmBgH,YAChEhH,KAAe,WAAmBgH,WAAWhH,MAG5CA,KAAKiH,oBACPjH,KAAKiH,kBAAkBC,cACvBlH,KAAKiH,kBAAoB,MAItBZ,GACHrG,KAAK6G,YAAYzB,cAAcpD,QAGjChC,KAAKoG,YAAcC,EACfrG,KAAKqH,WACPrH,KAAKyH,yBAKDnC,EAAVnF,UAAAsH,sBAAE,WAAA,GACMC,GADRjF,EAAAzC,IAaI,IAR2D,kBAA/CA,MAAgB,YAAmB2H,QAC7CD,EAAc1H,KAAgB,YAAmB2H,QAAQ3H,MAChDA,KAAKoG,sBAAuBnC,GAAAA,WACrCyD,EAAa1H,KAAKoG,YACTtF,MAAMgD,QAAQ9D,KAAKoG,eAC5BsB,EAAaE,EAAAA,GAAa5H,KAAKoG,eAG7BsB,EAIF,KAAMpH,IAHNN,MAAKiH,kBAAoBS,EAAWxD,KAAK2D,EAAAA,UAAU7H,KAAKyF,aACrDnB,UAAU,SAAAG,GAAQ,MAAAhC,GAAKqF,kBAAkBrD,MAOhDa,EAAFnF,UAAA2H,kBAAE,SAAkBrD,EAA8BsD,EAC9B3C,EACA4C,GAFlB,GAAFvF,GAAAzC,SAAA,KAAA+H,IAAkDA,EAAgC/H,KAAKwG,iBACvF,KAAApB,IAAoBA,EAAkCpF,KAAK6G,YAAYzB,cAEvE,IAAU6C,GAAUF,EAAWG,KAAKzD,EAC3BwD,KAELA,EAAQE,iBAAiB,SAACC,EACAC,EACAC,GACtB,GAA0B,MAAtBF,EAAKG,cACP9F,EAAK+F,WAAW/D,EAAI,GAAe,EAAiBW,EAAe4C,OAC9D,IAAoB,MAAhBM,EACTlD,EAAcqD,OAAM,GACpBhG,EAAKkD,QAAQ+C,OAAON,EAAKA,UACpB,CACf,GAAgBO,GAAOvD,EAAcwD,IAAG,EAC9BxD,GAAcyD,KAAI,EAAQP,MAIhCtI,KAAKwF,mBAAmBsD,kBAS1BxD,EAAFnF,UAAA4I,YAAE,SAAYtE,EAASxB,GACnB,GAA8B,IAA1BjD,KAAKqH,UAAUnE,OAAgB,MAAOlD,MAAKqH,UAAU2B,KAE7D,IAAUC,GACJjJ,KAAKqH,UAAUZ,KAAK,SAAAa,GAAO,MAAAA,GAAIC,MAAQD,EAAIC,KAAKtE,EAAGwB,MAAUzE,KAAKwH,eACpE,KAAKyB,EAAW,KAAMxI,IAEtB,OAAOwI,IAOT3D,EAAFnF,UAAAqI,WAAE,SAAWU,EAAaC,EAAe/D,EAAkC4C,GAC3E,GAAUoB,GAAOpJ,KAAK+I,YAAYG,EAAUC,GAGlCE,EAAU,GAAI7E,GAA4B0E,EAI5ClJ,MAAK2G,YAAYpE,SACnB8G,EAAQC,MAAQtJ,KAAK2G,YAAYpE,SAAS2G,OACX,KAAflB,GAA8BhI,KAAK2F,QAAQ4D,IAAIvB,GAC/DqB,EAAQC,MAAQtJ,KAAK2F,QAAQiD,IAAIZ,GAAe,EAEhDqB,EAAQC,MAAQ,EAElBtJ,KAAK2F,QAAQ6D,IAAIN,EAAUG,EAAQC,QAGjBlE,GAAgCpF,KAAK6G,YAAYzB,eACzDqE,mBAAmBL,EAAKxE,SAAUyE,EAASF,GAKjDO,EAAYC,qBACdD,EAAYC,mBAAmBlF,KAAOyE,mBApO5CrE,KAAC+E,EAAAA,UAAD7E,OAAAC,SAAA,WACE6E,SAAU,UACVjF,SAAU,kDACVkF,MACFC,MAAA,WACMC,KAAN,QAEAC,cAAAC,EAAAA,kBAAAC,KACAC,gBAAAC,EAAAA,wBAAAC,oGA1CAhF,EAAAiF,yEAoEA7D,UAAA7B,KAAA2F,EAAAA,QAUA3D,cAAAhC,KAAG4F,EAAAA,UAAH1F,MAAAI,KAQAkC,YAAAxC,KAAA6F,EAAAA,gBAAA3F,MAAAJ,MAMAW,kCAmLAtF,KAAA2K,YAAAA,EA0CA3K,KAAA4K,MAAAA,+EAFA,MAIAxK,QAAA+F,eAAAuD,EAAkCvJ,UAAlC,QAvBAyI,+DACA5I,KAAA6K,oBAEAC,YAAA,EACEC,cAAF,oDAJAnC,qEAQAkC,YAAA,EACEC,cAAF,+CAAAnC,qGAGAkC,YAAA,EACEC,cAAF,uCAcArB,EAAAC,qBAAA3J,OACA0J,EAAAC,mBAAA,MAEA3J,KAAAgL,WAAkBlE,OAClB9G,KAAAgL,WAAAjE,mIAWA,IAAA/G,KAAA4K,MAAAjE,YAAAnE,aAAAxC,KAAAgK,KAAAhK,KAAA4K,MAAAjE,YAAAnE,aAAAxC,KAAAiL,OAAA,QAAA,eAEA,CACA,IAAAjL,KAAA4K,MAAAjE,YAAAtD,YAAA,KAAA1C,IAGA,IAAAkD,GAAA7D,KAAA4K,MAAAjE,YAAAtD,YAAArD,KAAAiL,wBACYjL,KAAZkL,qBAAA,GAEarH,YAAbI,GAAAA,YACAJ,EAAAK,KAAA2D,EAAAA,UAAA7H,KAAAgL,aAAiB1G,UAAjB,SAAAC,GAAA,MAAA9B,GAAAyI,qBAAA3G,uIA1DAM,KAAAC,EAAAA,UAAAC,gCAfA8E,SAAA,cACEC,MACFqB,uBAAA,aACMC,oBAAN,qCACIC,cAAJ,OACItB,MAAJ,uFAsCAL,EAA+Ba,uCAH/Bb,KCtRA4B,EAAA,SAAA5I,GAoBE,QAAF4I,GAAwBX,EACAC,EACArF,GAFtB,GAAF9C,GAGIC,EAHJC,KAAA3C,KAGU2K,EAAaC,IAHvB5K,WAAwByC,GAAxBkI,YAAwBA,EACAlI,EAAxBmI,MAAwBA,EACAnI,EAAxB8C,SAAwBA,IA8CxB,MA1D0C3C,GAA1C0I,EAAA5I,GAgBE4I,EAAFnL,UAAAoL,mBAAE,WAAA,GAAF9I,GAAAzC,IAEI,IADAA,KAAKwG,YAAcxG,KAAKuF,SAASkB,SAASpG,OAAOL,KAAK4K,MAAMlE,UACvD1G,KAAK4K,MAAMjE,YAAYtD,YAC1B,KAAM1C,IAEZ,IAAUkD,GAAgB7D,KAAK4K,MAAMjE,YAAYtD,YAAYrD,KAAKyE,KAC1D3D,OAAMgD,QAAQD,GAChB7D,KAAKwL,oBAAmB,GACf3H,YAAyBI,GAAAA,YAClCJ,EAAcK,KAAK2D,EAAAA,UAAU7H,KAAKgL,aAC/B1G,UAAU,SAAAmH,GAAU,MAAAhJ,GAAK+I,oBAAoBC,KAElDzL,KAAK0L,WAAWzD,QAAQ/D,KAAK2D,EAAAA,UAAU7H,KAAKgL,aACvC1G,UAAU,WAAM,MAAA7B,GAAK+I,yBAG5BF,EAAFnL,UAAAyG,YAAE,WACE5G,KAAK2L,SACLjJ,EAAJvC,UAAUyG,YAAVjE,KAAA3C,OAIYsL,EAAZnL,UAAAqL,oBAAE,SAA8BjH,GAI5B,GAHIA,IACFvE,KAAK4L,UAAYrH,GAEfvE,KAAK0L,WAAWxI,QAAUlD,KAAK4L,UAAW,CAClD,GAAYxG,GAAgBpF,KAAK0L,WAAW1C,MAAM5D,aAC5CpF,MAAK4K,MAAM9C,kBAAkB9H,KAAK4L,UAAW5L,KAAKwG,YAAapB,EAAepF,KAAKiL,WAGnFjL,MAAKwG,YAAY0B,UAKXoD,EAAZnL,UAAAwL,OAAE,WACM3L,KAAK0L,YAAc1L,KAAK0L,WAAW1C,QACrChJ,KAAK0L,WAAW1C,MAAM5D,cAAcpD,QACpChC,KAAKwG,YAAY0B,0BAjEvBrD,KAACC,EAAAA,UAADC,OACEC,SAAU,uBACV6E,SAAU,oBACVC,MACEqB,uBAAwB,aACxBE,cAAe,OACftB,MAAS,sCAEX8B,YAAaC,QAASpC,EAAaqC,YAAaT,4CA1ClDzG,KAAEmH,EAAAA,aASFnH,KAAQS,IARRT,KAAEoH,EAAAA,qCAmDFP,aAAA7G,KAAG6F,EAAAA,gBAAH3F,MAAmBI,MAkDnBmG,GA1D0C5B,GCvCpCwC,EAAiB,gBAMvBC,EAAA,WAyCE,QAAFA,GAAsBC,EACAxB,EACAyB,EACAC,EACYC,GAJhC,GAAF9J,GAAAzC,IAAsBA,MAAtBoM,UAAsBA,EACApM,KAAtB4K,MAAsBA,EACA5K,KAAtBqM,UAAsBA,EACArM,KAAtBsM,SAAsBA,EACYtM,KAAlCuM,KAAkCA,EAxCxBvM,KAAVgL,WAAuB,GAAItF,GAAAA,QAGzB1F,KAAFwM,YAAgB,KA+BdxM,KAAFyM,QAAoB,GAOhBzM,KAAK0M,cACD1M,KAAKuM,MACPvM,KAAKuM,KAAKI,OAAOzI,KAAK2D,EAAAA,UAAU7H,KAAKgL,aAAa1G,UAAU,WAAM,MAAA7B,GAAKiK,gBAwB7E,MA7DEtM,QAAF+F,eACMgG,EADNhM,UAAA,aAAE,WACsB,MAAOH,MAAK4M,YAClC,SAAUC,GACR7M,KAAK4M,OAASE,EAAAA,qBAAqBD,GACnC7M,KAAK0M,+CAQPtM,OAAF+F,eACMgG,EADNhM,UAAA,cAAE,WACgC,MAAOH,MAAKyM,aAC5C,SAAWM,GACb,GAAQF,GAAQE,EACRC,EAAQ,IAEZ,IAAsB,gBAAXD,GAAqB,CACpC,GAAYE,GAAQF,EAAOG,MAAMhB,EAC3BW,GAAQI,EAAM,GACdD,EAAQC,EAAM,IAAMD,EAGtBhN,KAAKwM,YAAcQ,EACnBhN,KAAKyM,QAAUK,EAAAA,qBAAqBD,GACpC7M,KAAK0M,+CAePP,EAAFhM,UAAAyG,YAAE,WACE5G,KAAKgL,WAAWlE,OAChB9G,KAAKgL,WAAWjE,YAIlBoF,EAAFhM,UAAAgN,eAAE,WACF,GAAUC,GAAapN,KAAKoM,UAAU3H,MAAQzE,KAAK4K,MAAMjE,YAAYpE,SAC7DvC,KAAK4K,MAAMjE,YAAYpE,SAASvC,KAAKoM,UAAU3H,MAC/C,KACE6E,EAAQtJ,KAAK4M,QAAUQ,CAC7B,OAAO9D,GAAQ,GAAGA,EAAQtJ,KAAKyM,QAAUzM,KAAKwM,YAAgB,MAGhEL,EAAFhM,UAAAuM,YAAE,WACF,GAAUW,GAAUrN,KAAKmN,iBACfG,EAActN,KAAKuM,MAA4B,QAApBvM,KAAKuM,KAAKM,MAAkB,eAAiB,aAE9E7M,MAAKqM,UAAUkB,SAASvN,KAAKsM,SAASkB,cAAeF,EAAaD,mBAtEtExI,KAACC,EAAAA,UAADC,OACEC,SAAU,+DAVZH,KAAiB6E,IAAjB7E,KAAQS,IAHRT,KAA2D4I,EAAAA,YAA3D5I,KAAmBmH,EAAAA,aAFnBnH,KAAQ6I,EAAAA,eAARC,aAAA9I,KA2De+I,EAAAA,gCAlCftE,QAAAzE,KAAG2F,EAAAA,MAAHzF,MAAS,wBAYTgI,SAAAlI,KAAG2F,EAAAA,MAAHzF,MAAS,+BAiDToH,KC5EA0B,EAAA,WAaE,QAAFA,GAAwBjD,EACAwB,GADApM,KAAxB4K,MAAwBA,EACA5K,KAAxBoM,UAAwBA,EAHZpM,KAAZ8N,YAAyB,EAYzB,MAfE1N,QAAF+F,eACM0H,EADN1N,UAAA,iBAAE,WAC2B,MAAOH,MAAK8N,gBACvC,SAAcjB,GAAkB7M,KAAK8N,WAAaC,EAAAA,sBAAsBlB,oCAMxEgB,EAAF1N,UAAA6N,QAAE,SAAQC,GACNjO,KAAKkO,UACDlO,KAAK4K,MAAMjE,YAAY/E,kBAAkB5B,KAAKoM,UAAU3H,MACxDzE,KAAK4K,MAAMjE,YAAYvF,OAAOpB,KAAKoM,UAAU3H,MAEjDwJ,EAAME,kCArBVtJ,KAACC,EAAAA,UAADC,OACEC,SAAU,sBACV8E,MACEsE,UAAW,2DARfvJ,KAAQS,IAART,KAAiB6E,uBAajBwE,YAAArJ,KAAG2F,EAAAA,MAAHzF,MAAS,iCAeT8I,KCvBMQ,GACJ/C,EACA3G,EACAwH,EACA0B,EACAvI,EACAoE,EACAvE,GAGFmJ,EAAA,WAAA,QAAAA,MAM4B,sBAN5BzJ,KAAC0J,EAAAA,SAADxJ,OACEyJ,SAAUC,EAAAA,cACVC,QAASL,EACTM,aAAcN,EACdxC,WAAY+C,EAAAA,aAAcjK,OAE5B2J"}

package/bundles/cdk.umd.js

@@ -19,7 +19,7 @@
  * Current version of the Angular Component Development Kit.
  * @type {?}
  */
-var VERSION = new core.Version('7.1.1');
+var VERSION = new core.Version('7.2.0');
 
 exports.VERSION = VERSION;
 

package/bundles/cdk.umd.js.map

@@ -1 +1 @@
-{"version":3,"file":"cdk.umd.js","sources":["../../src/cdk/version.ts"],"sourcesContent":["/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {Version} from '@angular/core';\n\n/** Current version of the Angular Component Development Kit. */\nexport const VERSION = new Version('7.1.1');\n"],"names":["Version"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAWA,AAAA,IAAa,OAAO,GAAG,IAAIA,YAAO,CAAC,mBAAmB,CAAC;;;;;;;;;;;;"}
+{"version":3,"file":"cdk.umd.js","sources":["../../src/cdk/version.ts"],"sourcesContent":["/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {Version} from '@angular/core';\n\n/** Current version of the Angular Component Development Kit. */\nexport const VERSION = new Version('7.2.0');\n"],"names":["Version"],"mappings":";;;;;;;;;;;;;;;;;;;;;AAWA,AAAA,IAAa,OAAO,GAAG,IAAIA,YAAO,CAAC,mBAAmB,CAAC;;;;;;;;;;;;"}

package/bundles/cdk.umd.min.js

@@ -5,5 +5,5 @@
  * 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
  */
-!function(e,n){"object"==typeof exports&&"undefined"!=typeof module?n(exports,require("@angular/core")):"function"==typeof define&&define.amd?define("@angular/cdk",["exports","@angular/core"],n):n((e.ng=e.ng||{},e.ng.cdk={}),e.ng.core)}(this,function(e,n){"use strict";var o=new n.Version("7.1.1");e.VERSION=o,Object.defineProperty(e,"__esModule",{value:!0})});
+!function(e,n){"object"==typeof exports&&"undefined"!=typeof module?n(exports,require("@angular/core")):"function"==typeof define&&define.amd?define("@angular/cdk",["exports","@angular/core"],n):n((e.ng=e.ng||{},e.ng.cdk={}),e.ng.core)}(this,function(e,n){"use strict";var o=new n.Version("7.2.0");e.VERSION=o,Object.defineProperty(e,"__esModule",{value:!0})});
 //# sourceMappingURL=cdk.umd.min.js.map

package/bundles/cdk.umd.min.js.map

@@ -1 +1 @@
-{"version":3,"file":"cdk.umd.min.js","sources":["../../src/cdk/version.ts"],"sourcesContent":["/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {Version} from '@angular/core';\n\n/** Current version of the Angular Component Development Kit. */\nexport const VERSION = new Version('7.1.1');\n"],"names":["VERSION","Version"],"mappings":";;;;;;;4QAWA,IAAaA,GAAU,GAAIC,GAAAA,QAAQ"}
+{"version":3,"file":"cdk.umd.min.js","sources":["../../src/cdk/version.ts"],"sourcesContent":["/**\n * @license\n * Copyright Google LLC All Rights Reserved.\n *\n * Use of this source code is governed by an MIT-style license that can be\n * found in the LICENSE file at https://angular.io/license\n */\n\nimport {Version} from '@angular/core';\n\n/** Current version of the Angular Component Development Kit. */\nexport const VERSION = new Version('7.2.0');\n"],"names":["VERSION","Version"],"mappings":";;;;;;;4QAWA,IAAaA,GAAU,GAAIC,GAAAA,QAAQ"}

package/drag-drop/typings/directives/drag.d.ts

@@ -0,0 +1,108 @@
+/**
+ * @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
+ */
+import { Directionality } from '@angular/cdk/bidi';
+import { ViewportRuler } from '@angular/cdk/scrolling';
+import { AfterViewInit, ElementRef, EventEmitter, InjectionToken, NgZone, OnDestroy, QueryList, ViewContainerRef } from '@angular/core';
+import { Observable } from 'rxjs';
+import { DragDropRegistry } from '../drag-drop-registry';
+import { CdkDragDrop, CdkDragEnd, CdkDragEnter, CdkDragExit, CdkDragMove, CdkDragStart, CdkDragRelease } from '../drag-events';
+import { CdkDragHandle } from './drag-handle';
+import { CdkDragPlaceholder } from './drag-placeholder';
+import { CdkDragPreview } from './drag-preview';
+import { DragRef, DragRefConfig } from '../drag-ref';
+import { DropListRef } from '../drop-list-ref';
+import { CdkDropListInternal as CdkDropList } from './drop-list';
+/** Injection token that can be used to configure the behavior of `CdkDrag`. */
+export declare const CDK_DRAG_CONFIG: InjectionToken<DragRefConfig>;
+/** @docs-private */
+export declare function CDK_DRAG_CONFIG_FACTORY(): DragRefConfig;
+/** Element that can be moved inside a CdkDropList container. */
+export declare class CdkDrag<T = any> implements AfterViewInit, OnDestroy {
+    /** Element that the draggable is attached to. */
+    element: ElementRef<HTMLElement>;
+    /** Droppable container that the draggable is a part of. */
+    dropContainer: CdkDropList;
+    private _document;
+    private _ngZone;
+    private _viewContainerRef;
+    private _viewportRuler;
+    private _dragDropRegistry;
+    private _config;
+    private _dir;
+    /** Subscription to the stream that initializes the root element. */
+    private _rootElementInitSubscription;
+    /** Reference to the underlying drag instance. */
+    _dragRef: DragRef<CdkDrag<T>>;
+    /** Elements that can be used to drag the draggable item. */
+    _handles: QueryList<CdkDragHandle>;
+    /** Element that will be used as a template to create the draggable item's preview. */
+    _previewTemplate: CdkDragPreview;
+    /** Template for placeholder element rendered to show where a draggable would be dropped. */
+    _placeholderTemplate: CdkDragPlaceholder;
+    /** Arbitrary data to attach to this drag instance. */
+    data: T;
+    /** Locks the position of the dragged element along the specified axis. */
+    lockAxis: 'x' | 'y';
+    /**
+     * Selector that will be used to determine the root draggable element, starting from
+     * the `cdkDrag` element and going up the DOM. Passing an alternate root element is useful
+     * when trying to enable dragging on an element that you might not have access to.
+     */
+    rootElementSelector: string;
+    /**
+     * Selector that will be used to determine the element to which the draggable's position will
+     * be constrained. Matching starts from the element's parent and goes up the DOM until a matching
+     * element has been found.
+     */
+    boundaryElementSelector: string;
+    /** Whether starting to drag this element is disabled. */
+    disabled: boolean;
+    private _disabled;
+    /** Emits when the user starts dragging the item. */
+    started: EventEmitter<CdkDragStart>;
+    /** Emits when the user has released a drag item, before any animations have started. */
+    released: EventEmitter<CdkDragRelease>;
+    /** Emits when the user stops dragging an item in the container. */
+    ended: EventEmitter<CdkDragEnd>;
+    /** Emits when the user has moved the item into a new container. */
+    entered: EventEmitter<CdkDragEnter<any>>;
+    /** Emits when the user removes the item its container by dragging it into another container. */
+    exited: EventEmitter<CdkDragExit<any>>;
+    /** Emits when the user drops the item inside a container. */
+    dropped: EventEmitter<CdkDragDrop<any>>;
+    /**
+     * Emits as the user is dragging the item. Use with caution,
+     * because this event will fire for every pixel that the user has dragged.
+     */
+    moved: Observable<CdkDragMove<T>>;
+    constructor(
+    /** Element that the draggable is attached to. */
+    element: ElementRef<HTMLElement>, 
+    /** Droppable container that the draggable is a part of. */
+    dropContainer: CdkDropList, _document: any, _ngZone: NgZone, _viewContainerRef: ViewContainerRef, _viewportRuler: ViewportRuler, _dragDropRegistry: DragDropRegistry<DragRef, DropListRef>, _config: DragRefConfig, _dir: Directionality);
+    /**
+     * Returns the element that is being used as a placeholder
+     * while the current element is being dragged.
+     */
+    getPlaceholderElement(): HTMLElement;
+    /** Returns the root draggable element. */
+    getRootElement(): HTMLElement;
+    /** Resets a standalone drag item to its initial position. */
+    reset(): void;
+    ngAfterViewInit(): void;
+    ngOnDestroy(): void;
+    /** Gets the root draggable element, based on the `rootElementSelector`. */
+    private _getRootElement;
+    /** Gets the boundary element, based on the `boundaryElementSelector`. */
+    private _getBoundaryElement;
+    /**
+     * Proxies the events from a DragRef to events that
+     * match the interfaces of the CdkDrag outputs.
+     */
+    private _proxyEvents;
+}

package/{typings/esm5/drag-drop → drag-drop/typings/directives}/drop-list-group.d.ts

@@ -15,5 +15,8 @@ import { OnDestroy } from '@angular/core';
 export declare class CdkDropListGroup<T> implements OnDestroy {
     /** Drop lists registered inside the group. */
     readonly _items: Set<T>;
+    /** Whether starting a dragging sequence from inside this group is disabled. */
+    disabled: boolean;
+    private _disabled;
     ngOnDestroy(): void;
 }

package/drag-drop/typings/directives/drop-list.d.ts

@@ -0,0 +1,135 @@
+/**
+ * @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
+ */
+import { ElementRef, EventEmitter, OnDestroy, QueryList, ChangeDetectorRef } from '@angular/core';
+import { Directionality } from '@angular/cdk/bidi';
+import { CdkDrag } from './drag';
+import { DragDropRegistry } from '../drag-drop-registry';
+import { CdkDragDrop, CdkDragEnter, CdkDragExit, CdkDragSortEvent } from '../drag-events';
+import { CdkDropListContainer } from '../drop-list-container';
+import { CdkDropListGroup } from './drop-list-group';
+import { DropListRef } from '../drop-list-ref';
+import { DragRef } from '../drag-ref';
+/**
+ * Internal compile-time-only representation of a `CdkDropList`.
+ * Used to avoid circular import issues between the `CdkDropList` and the `CdkDrag`.
+ * @docs-private
+ */
+export interface CdkDropListInternal extends CdkDropList {
+}
+/** Container that wraps a set of draggable items. */
+export declare class CdkDropList<T = any> implements CdkDropListContainer, OnDestroy {
+    element: ElementRef<HTMLElement>;
+    private _changeDetectorRef;
+    private _group?;
+    /** Keeps track of the drop lists that are currently on the page. */
+    private static _dropLists;
+    /** Reference to the underlying drop list instance. */
+    _dropListRef: DropListRef<CdkDropList<T>>;
+    /** Draggable items in the container. */
+    _draggables: QueryList<CdkDrag>;
+    /**
+     * Other draggable containers that this container is connected to and into which the
+     * container's items can be transferred. Can either be references to other drop containers,
+     * or their unique IDs.
+     */
+    connectedTo: (CdkDropList | string)[] | CdkDropList | string;
+    /** Arbitrary data to attach to this container. */
+    data: T;
+    /** Direction in which the list is oriented. */
+    orientation: 'horizontal' | 'vertical';
+    /**
+     * Unique ID for the drop zone. Can be used as a reference
+     * in the `connectedTo` of another `CdkDropList`.
+     */
+    id: string;
+    /** Locks the position of the draggable elements inside the container along the specified axis. */
+    lockAxis: 'x' | 'y';
+    /** Whether starting a dragging sequence from this container is disabled. */
+    disabled: boolean;
+    private _disabled;
+    /**
+     * Function that is used to determine whether an item
+     * is allowed to be moved into a drop container.
+     */
+    enterPredicate: (drag: CdkDrag, drop: CdkDropList) => boolean;
+    /** Emits when the user drops an item inside the container. */
+    dropped: EventEmitter<CdkDragDrop<T, any>>;
+    /**
+     * Emits when the user has moved a new drag item into this container.
+     */
+    entered: EventEmitter<CdkDragEnter<T>>;
+    /**
+     * Emits when the user removes an item from the container
+     * by dragging it into another container.
+     */
+    exited: EventEmitter<CdkDragExit<T>>;
+    /** Emits as the user is swapping items while actively dragging. */
+    sorted: EventEmitter<CdkDragSortEvent<T>>;
+    constructor(element: ElementRef<HTMLElement>, dragDropRegistry: DragDropRegistry<DragRef, DropListRef>, _changeDetectorRef: ChangeDetectorRef, dir?: Directionality, _group?: CdkDropListGroup<CdkDropList<any>> | undefined, _document?: any);
+    ngOnDestroy(): void;
+    /** Starts dragging an item. */
+    start(): void;
+    /**
+     * Drops an item into this container.
+     * @param item Item being dropped into the container.
+     * @param currentIndex Index at which the item should be inserted.
+     * @param previousContainer Container from which the item got dragged in.
+     * @param isPointerOverContainer Whether the user's pointer was over the
+     *    container when the item was dropped.
+     */
+    drop(item: CdkDrag, currentIndex: number, previousContainer: Partial<CdkDropListContainer>, isPointerOverContainer: boolean): void;
+    /**
+     * Emits an event to indicate that the user moved an item into the container.
+     * @param item Item that was moved into the container.
+     * @param pointerX Position of the item along the X axis.
+     * @param pointerY Position of the item along the Y axis.
+     */
+    enter(item: CdkDrag, pointerX: number, pointerY: number): void;
+    /**
+     * Removes an item from the container after it was dragged into another container by the user.
+     * @param item Item that was dragged out.
+     */
+    exit(item: CdkDrag): void;
+    /**
+     * Figures out the index of an item in the container.
+     * @param item Item whose index should be determined.
+     */
+    getItemIndex(item: CdkDrag): number;
+    /**
+     * Sorts an item inside the container based on its position.
+     * @param item Item to be sorted.
+     * @param pointerX Position of the item along the X axis.
+     * @param pointerY Position of the item along the Y axis.
+     * @param pointerDelta Direction in which the pointer is moving along each axis.
+     */
+    _sortItem(item: CdkDrag, pointerX: number, pointerY: number, pointerDelta: {
+        x: number;
+        y: number;
+    }): void;
+    /**
+     * Figures out whether an item should be moved into a sibling
+     * drop container, based on its current position.
+     * @param item Drag item that is being moved.
+     * @param x Position of the item along the X axis.
+     * @param y Position of the item along the Y axis.
+     */
+    _getSiblingContainerFromPosition(item: CdkDrag, x: number, y: number): CdkDropListContainer | null;
+    /**
+     * Checks whether the user's pointer is positioned over the container.
+     * @param x Pointer position along the X axis.
+     * @param y Pointer position along the Y axis.
+     */
+    _isOverContainer(x: number, y: number): boolean;
+    /** Syncs the inputs of the CdkDropList with the options of the underlying DropListRef. */
+    private _syncInputs;
+    /**
+     * Proxies the events from a DropListRef to events that
+     * match the interfaces of the CdkDropList outputs.
+     */
+    private _proxyEvents;
+}

package/drag-drop/typings/drag-drop-registry.d.ts

@@ -54,13 +54,18 @@ export declare class DragDropRegistry<I, C extends {
     stopDragging(drag: I): void;
     /** Gets whether a drag item instance is currently being dragged. */
     isDragging(drag: I): boolean;
-    /** Gets a drop container by its id. */
+    /**
+     * Gets a drop container by its id.
+     * @deprecated No longer being used. To be removed.
+     * @breaking-change 8.0.0
+     */
     getDropContainer(id: string): C | undefined;
     ngOnDestroy(): void;
     /**
-     * Listener used to prevent `touchmove` and `wheel` events while the element is being dragged.
+     * Event listener that will prevent the default browser action while the user is dragging.
+     * @param event Event whose default action should be prevented.
      */
-    private _preventScrollListener;
+    private _preventDefaultWhileDragging;
     /** Clears out the global event listeners from the `document`. */
     private _clearGlobalListeners;
 }