@angular/core 15.0.2 → 15.0.3

package/fesm2015/core.mjs

@@ -1,5 +1,5 @@
 /**
- * @license Angular v15.0.2
+ * @license Angular v15.0.3
  * (c) 2010-2022 Google LLC. https://angular.io/
  * License: MIT
  */
@@ -1439,7 +1439,7 @@ const MOVED_VIEWS = 9;
 const CONTAINER_HEADER_OFFSET = 10;
 // Note: This hack is necessary so we don't erroneously get a circular dependency
 // failure based on types.
-const unusedValueExportToPlacateAjd$8 = 1;
+const unusedValueExportToPlacateAjd$4 = 1;
 
 /**
  * @license
@@ -1484,7 +1484,7 @@ const EMBEDDED_VIEW_INJECTOR = 21;
 const HEADER_OFFSET = 22;
 // Note: This hack is necessary so we don't erroneously get a circular dependency
 // failure based on types.
-const unusedValueExportToPlacateAjd$7 = 1;
+const unusedValueExportToPlacateAjd$3 = 1;
 
 /**
  * @license
@@ -1569,11 +1569,6 @@ function assertHasParent(tNode) {
     assertDefined(tNode, 'currentTNode should exist!');
     assertDefined(tNode.parent, 'currentTNode should have a parent');
 }
-function assertDataNext(lView, index, arr) {
-    if (arr == null)
-        arr = lView;
-    assertEqual(arr.length, index, `index ${index} expected to be at the end of arr (length ${arr.length})`);
-}
 function assertLContainer(value) {
     assertDefined(value, 'LContainer must be defined');
     assertEqual(isLContainer(value), true, 'Expecting LContainer');
@@ -1822,14 +1817,7 @@ const profiler = function (event, instance, hookOrListener) {
  * found in the LICENSE file at https://angular.io/license
  */
 const SVG_NAMESPACE = 'svg';
-const SVG_NAMESPACE_URI = 'http://www.w3.org/2000/svg';
 const MATH_ML_NAMESPACE = 'math';
-const MATH_ML_NAMESPACE_URI = 'http://www.w3.org/1998/MathML/';
-function getNamespaceUri(namespace) {
-    const name = namespace.toLowerCase();
-    return name === SVG_NAMESPACE ? SVG_NAMESPACE_URI :
-        (name === MATH_ML_NAMESPACE ? MATH_ML_NAMESPACE_URI : null);
-}
 
 /**
  * @license
@@ -1878,20 +1866,6 @@ function unwrapLView(value) {
     }
     return null;
 }
-/**
- * Returns `LContainer` or `null` if not found.
- * @param value wrapped value of `RNode`, `LView`, `LContainer`
- */
-function unwrapLContainer(value) {
-    while (Array.isArray(value)) {
-        // This check is same as `isLContainer()` but we don't call at as we don't want to call
-        // `Array.isArray()` twice and give JITer more work for inlining.
-        if (value[TYPE] === true)
-            return value;
-        value = value[HOST];
-    }
-    return null;
-}
 /**
  * Retrieves an element value from the provided `viewData`, by unwrapping
  * from any containers, component views, or style contexts.
@@ -2151,9 +2125,6 @@ function isCurrentTNodeParent() {
 function setCurrentTNodeAsNotParent() {
     instructionState.lFrame.isParent = false;
 }
-function setCurrentTNodeAsParent() {
-    instructionState.lFrame.isParent = true;
-}
 function getContextLView() {
     const contextLView = instructionState.lFrame.contextLView;
     ngDevMode && assertDefined(contextLView, 'contextLView must be defined.');
@@ -2876,7 +2847,7 @@ function isFactory(obj) {
 }
 // Note: This hack is necessary so we don't erroneously get a circular dependency
 // failure based on types.
-const unusedValueExportToPlacateAjd$6 = 1;
+const unusedValueExportToPlacateAjd$2 = 1;
 
 /**
  * Converts `TNodeType` into human readable text.
@@ -2895,7 +2866,7 @@ function toTNodeTypeAsString(tNodeType) {
 }
 // Note: This hack is necessary so we don't erroneously get a circular dependency
 // failure based on types.
-const unusedValueExportToPlacateAjd$5 = 1;
+const unusedValueExportToPlacateAjd$1 = 1;
 /**
  * Returns `true` if the `TNode` has a directive which has `@Input()` for `class` binding.
  *
@@ -4378,17 +4349,6 @@ function isType(v) {
  * 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
  */
-/**
- * Equivalent to ES6 spread, add each item to an array.
- *
- * @param items The items to add
- * @param arr The array to which you want to add the items
- */
-function addAllToArray(items, arr) {
-    for (let i = 0; i < items.length; i++) {
-        arr.push(items[i]);
-    }
-}
 /**
  * Determines if the contents of two arrays is identical
  *
@@ -4416,25 +4376,8 @@ function arrayEquals(a, b, identityAccessor) {
 /**
  * Flattens an array.
  */
-function flatten(list, dst) {
-    if (dst === undefined)
-        dst = list;
-    for (let i = 0; i < list.length; i++) {
-        let item = list[i];
-        if (Array.isArray(item)) {
-            // we need to inline it.
-            if (dst === list) {
-                // Our assumption that the list was already flat was wrong and
-                // we need to clone flat since we need to write to it.
-                dst = list.slice(0, i);
-            }
-            flatten(item, dst);
-        }
-        else if (dst !== list) {
-            dst.push(item);
-        }
-    }
-    return dst;
+function flatten(list) {
+    return list.flat(Number.POSITIVE_INFINITY);
 }
 function deepForEach(input, fn) {
     input.forEach(value => Array.isArray(value) ? deepForEach(value, fn) : fn(value));
@@ -4544,46 +4487,6 @@ function arrayInsert2(array, index, value1, value2) {
         array[index + 1] = value2;
     }
 }
-/**
- * Insert a `value` into an `array` so that the array remains sorted.
- *
- * NOTE:
- * - Duplicates are not allowed, and are ignored.
- * - This uses binary search algorithm for fast inserts.
- *
- * @param array A sorted array to insert into.
- * @param value The value to insert.
- * @returns index of the inserted value.
- */
-function arrayInsertSorted(array, value) {
-    let index = arrayIndexOfSorted(array, value);
-    if (index < 0) {
-        // if we did not find it insert it.
-        index = ~index;
-        arrayInsert(array, index, value);
-    }
-    return index;
-}
-/**
- * Remove `value` from a sorted `array`.
- *
- * NOTE:
- * - This uses binary search algorithm for fast removals.
- *
- * @param array A sorted array to remove from.
- * @param value The value to remove.
- * @returns index of the removed value.
- *   - positive index if value found and removed.
- *   - negative index if value not found. (`~index` to get the value where it should have been
- *     inserted)
- */
-function arrayRemoveSorted(array, value) {
-    const index = arrayIndexOfSorted(array, value);
-    if (index >= 0) {
-        arraySplice(array, index, 1);
-    }
-    return index;
-}
 /**
  * Get an index of an `value` in a sorted `array`.
  *
@@ -6036,28 +5939,6 @@ function ensureIcuContainerVisitorLoaded(loader) {
     }
 }
 
-/**
- * @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
- */
-// Note: This hack is necessary so we don't erroneously get a circular dependency
-// failure based on types.
-const unusedValueExportToPlacateAjd$4 = 1;
-
-/**
- * @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
- */
-// Note: This hack is necessary so we don't erroneously get a circular dependency
-// failure based on types.
-const unusedValueExportToPlacateAjd$3 = 1;
-
 /**
  * @license
  * Copyright Google LLC All Rights Reserved.
@@ -6129,7 +6010,6 @@ function getNearestLContainer(viewOrContainer) {
  * 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
  */
-const unusedValueToPlacateAjd$2 = unusedValueExportToPlacateAjd$8 + unusedValueExportToPlacateAjd$5 + unusedValueExportToPlacateAjd$4 + unusedValueExportToPlacateAjd$3 + unusedValueExportToPlacateAjd$7;
 /**
  * NOTE: for performance reasons, the possible actions are inlined within the function instead of
  * being passed as an argument.
@@ -9111,7 +8991,7 @@ class Version {
 /**
  * @publicApi
  */
-const VERSION = new Version('15.0.2');
+const VERSION = new Version('15.0.3');
 
 /**
  * @license
@@ -9432,7 +9312,6 @@ function classIndexOf(className, classToSearch, startingIndex) {
  * 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
  */
-const unusedValueToPlacateAjd$1 = unusedValueExportToPlacateAjd$5 + unusedValueExportToPlacateAjd$4;
 const NG_TEMPLATE_SELECTOR = 'ng-template';
 /**
  * Search the `TAttributes` to see if it contains `cssClassToMatch` (case insensitive)
@@ -11892,6 +11771,12 @@ function lastSelectedElementIdx(hostBindingOpCodes) {
 function instantiateAllDirectives(tView, lView, tNode, native) {
     const start = tNode.directiveStart;
     const end = tNode.directiveEnd;
+    // The component view needs to be created before creating the node injector
+    // since it is used to inject some special symbols like `ChangeDetectorRef`.
+    if (isComponentHost(tNode)) {
+        ngDevMode && assertTNodeType(tNode, 3 /* TNodeType.AnyRNode */);
+        addComponentLogic(lView, tNode, tView.data[start + tNode.componentOffset]);
+    }
     if (!tView.firstCreatePass) {
         getOrCreateNodeInjectorForNode(tNode, lView);
     }
@@ -11899,19 +11784,14 @@ function instantiateAllDirectives(tView, lView, tNode, native) {
     const initialInputs = tNode.initialInputs;
     for (let i = start; i < end; i++) {
         const def = tView.data[i];
-        const isComponent = isComponentDef(def);
-        if (isComponent) {
-            ngDevMode && assertTNodeType(tNode, 3 /* TNodeType.AnyRNode */);
-            addComponentLogic(lView, tNode, def);
-        }
         const directive = getNodeInjectable(lView, tView, i, tNode);
         attachPatchData(directive, lView);
         if (initialInputs !== null) {
             setInputsFromAttrs(lView, i - start, directive, def, tNode, initialInputs);
         }
-        if (isComponent) {
+        if (isComponentDef(def)) {
             const componentView = getComponentLViewByIndex(tNode.index, lView);
-            componentView[CONTEXT] = directive;
+            componentView[CONTEXT] = getNodeInjectable(lView, tView, i, tNode);
         }
     }
 }
@@ -18815,7 +18695,7 @@ var I18nCreateOpCode;
 })(I18nCreateOpCode || (I18nCreateOpCode = {}));
 // Note: This hack is necessary so we don't erroneously get a circular dependency
 // failure based on types.
-const unusedValueExportToPlacateAjd$2 = 1;
+const unusedValueExportToPlacateAjd = 1;
 
 /**
  * @license
@@ -22813,29 +22693,6 @@ function createContainerRef(hostTNode, hostLView) {
  * 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
  */
-// Note: This hack is necessary so we don't erroneously get a circular dependency
-// failure based on types.
-const unusedValueExportToPlacateAjd$1 = 1;
-
-/**
- * @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
- */
-// Note: This hack is necessary so we don't erroneously get a circular dependency
-// failure based on types.
-const unusedValueExportToPlacateAjd = 1;
-
-/**
- * @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
- */
-const unusedValueToPlacateAjd = unusedValueExportToPlacateAjd$1 + unusedValueExportToPlacateAjd$6 + unusedValueExportToPlacateAjd$5 + unusedValueExportToPlacateAjd;
 class LQuery_ {
     constructor(queryList) {
         this.queryList = queryList;