| 1 | "use strict";
|
|---|
| 2 | /**
|
|---|
| 3 | * @license
|
|---|
| 4 | * Copyright Google LLC All Rights Reserved.
|
|---|
| 5 | *
|
|---|
| 6 | * Use of this source code is governed by an MIT-style license that can be
|
|---|
| 7 | * found in the LICENSE file at https://angular.io/license
|
|---|
| 8 | */
|
|---|
| 9 | var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
|
|---|
| 10 | if (k2 === undefined) k2 = k;
|
|---|
| 11 | Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });
|
|---|
| 12 | }) : (function(o, m, k, k2) {
|
|---|
| 13 | if (k2 === undefined) k2 = k;
|
|---|
| 14 | o[k2] = m[k];
|
|---|
| 15 | }));
|
|---|
| 16 | var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
|
|---|
| 17 | Object.defineProperty(o, "default", { enumerable: true, value: v });
|
|---|
| 18 | }) : function(o, v) {
|
|---|
| 19 | o["default"] = v;
|
|---|
| 20 | });
|
|---|
| 21 | var __importStar = (this && this.__importStar) || function (mod) {
|
|---|
| 22 | if (mod && mod.__esModule) return mod;
|
|---|
| 23 | var result = {};
|
|---|
| 24 | if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
|
|---|
| 25 | __setModuleDefault(result, mod);
|
|---|
| 26 | return result;
|
|---|
| 27 | };
|
|---|
| 28 | var __exportStar = (this && this.__exportStar) || function(m, exports) {
|
|---|
| 29 | for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
|
|---|
| 30 | };
|
|---|
| 31 | Object.defineProperty(exports, "__esModule", { value: true });
|
|---|
| 32 | exports.Tree = exports.workflow = exports.formats = exports.SchematicsException = void 0;
|
|---|
| 33 | const formats = __importStar(require("./formats/index"));
|
|---|
| 34 | exports.formats = formats;
|
|---|
| 35 | const interface_1 = require("./tree/interface");
|
|---|
| 36 | const static_1 = require("./tree/static");
|
|---|
| 37 | const workflow = __importStar(require("./workflow/index"));
|
|---|
| 38 | exports.workflow = workflow;
|
|---|
| 39 | var exception_1 = require("./exception/exception");
|
|---|
| 40 | Object.defineProperty(exports, "SchematicsException", { enumerable: true, get: function () { return exception_1.SchematicsException; } });
|
|---|
| 41 | __exportStar(require("./tree/action"), exports);
|
|---|
| 42 | __exportStar(require("./engine/index"), exports);
|
|---|
| 43 | __exportStar(require("./exception/exception"), exports);
|
|---|
| 44 | __exportStar(require("./tree/interface"), exports);
|
|---|
| 45 | __exportStar(require("./rules/base"), exports);
|
|---|
| 46 | __exportStar(require("./rules/call"), exports);
|
|---|
| 47 | __exportStar(require("./rules/move"), exports);
|
|---|
| 48 | __exportStar(require("./rules/random"), exports);
|
|---|
| 49 | __exportStar(require("./rules/schematic"), exports);
|
|---|
| 50 | __exportStar(require("./rules/template"), exports);
|
|---|
| 51 | __exportStar(require("./rules/url"), exports);
|
|---|
| 52 | __exportStar(require("./tree/delegate"), exports);
|
|---|
| 53 | __exportStar(require("./tree/empty"), exports);
|
|---|
| 54 | __exportStar(require("./tree/host-tree"), exports);
|
|---|
| 55 | __exportStar(require("./engine/schematic"), exports);
|
|---|
| 56 | __exportStar(require("./sink/dryrun"), exports);
|
|---|
| 57 | __exportStar(require("./sink/host"), exports);
|
|---|
| 58 | __exportStar(require("./sink/sink"), exports);
|
|---|
| 59 | exports.Tree = {
|
|---|
| 60 | empty() {
|
|---|
| 61 | return static_1.empty();
|
|---|
| 62 | },
|
|---|
| 63 | branch(tree) {
|
|---|
| 64 | return static_1.branch(tree);
|
|---|
| 65 | },
|
|---|
| 66 | merge(tree, other, strategy = interface_1.MergeStrategy.Default) {
|
|---|
| 67 | return static_1.merge(tree, other, strategy);
|
|---|
| 68 | },
|
|---|
| 69 | partition(tree, predicate) {
|
|---|
| 70 | return static_1.partition(tree, predicate);
|
|---|
| 71 | },
|
|---|
| 72 | optimize(tree) {
|
|---|
| 73 | return tree;
|
|---|
| 74 | },
|
|---|
| 75 | };
|
|---|
