ember-source 7.1.0-alpha.4 → 7.1.0-beta.1

package/dist/prod/packages/shared-chunks/cache-BIlOoPA7.js

@@ -0,0 +1,371 @@
+import { scheduleRevalidate } from '../@glimmer/global-context/index.js';
+
+// eslint-disable-next-line @typescript-eslint/no-explicit-any
+
+function unwrap(val) {
+  if (val === null || val === undefined) throw new Error(`Expected value to be present`);
+  return val;
+}
+
+//////////
+
+const CONSTANT = 0;
+const INITIAL = 1;
+const VOLATILE = NaN;
+let $REVISION = INITIAL;
+function bump() {
+  $REVISION++;
+}
+
+//////////
+
+const DIRYTABLE_TAG_ID = 0;
+const UPDATABLE_TAG_ID = 1;
+const COMBINATOR_TAG_ID = 2;
+const CONSTANT_TAG_ID = 3;
+
+//////////
+
+const COMPUTE = Symbol('TAG_COMPUTE');
+Reflect.set(globalThis, 'COMPUTE_SYMBOL', COMPUTE);
+
+//////////
+
+/**
+ * `value` receives a tag and returns an opaque Revision based on that tag. This
+ * snapshot can then later be passed to `validate` with the same tag to
+ * determine if the tag has changed at all since the time that `value` was
+ * called.
+ *
+ * @param tag
+ */
+function valueForTag(tag) {
+  return tag[COMPUTE]();
+}
+
+/**
+ * `validate` receives a tag and a snapshot from a previous call to `value` with
+ * the same tag, and determines if the tag is still valid compared to the
+ * snapshot. If the tag's state has changed at all since then, `validate` will
+ * return false, otherwise it will return true. This is used to determine if a
+ * calculation related to the tags should be rerun.
+ *
+ * @param tag
+ * @param snapshot
+ */
+function validateTag(tag, snapshot) {
+  return snapshot >= tag[COMPUTE]();
+}
+
+//////////
+
+const TYPE = Symbol('TAG_TYPE');
+
+// this is basically a const
+let ALLOW_CYCLES;
+class MonomorphicTagImpl {
+  static combine(tags) {
+    switch (tags.length) {
+      case 0:
+        return CONSTANT_TAG;
+      case 1:
+        return tags[0];
+      default:
+        {
+          let tag = new MonomorphicTagImpl(COMBINATOR_TAG_ID);
+          tag.subtag = tags;
+          return tag;
+        }
+    }
+  }
+  revision = INITIAL;
+  lastChecked = INITIAL;
+  lastValue = INITIAL;
+  isUpdating = false;
+  subtag = null;
+  subtagBufferCache = null;
+  constructor(type) {
+    this[TYPE] = type;
+  }
+  [COMPUTE]() {
+    let {
+      lastChecked
+    } = this;
+    if (this.isUpdating) {
+      this.lastChecked = ++$REVISION;
+    } else if (lastChecked !== $REVISION) {
+      this.isUpdating = true;
+      this.lastChecked = $REVISION;
+      try {
+        let {
+          subtag,
+          revision
+        } = this;
+        if (subtag !== null) {
+          if (Array.isArray(subtag)) {
+            for (const tag of subtag) {
+              let value = tag[COMPUTE]();
+              revision = Math.max(value, revision);
+            }
+          } else {
+            let subtagValue = subtag[COMPUTE]();
+            if (subtagValue === this.subtagBufferCache) {
+              revision = Math.max(revision, this.lastValue);
+            } else {
+              // Clear the temporary buffer cache
+              this.subtagBufferCache = null;
+              revision = Math.max(revision, subtagValue);
+            }
+          }
+        }
+        this.lastValue = revision;
+      } finally {
+        this.isUpdating = false;
+      }
+    }
+    return this.lastValue;
+  }
+  static updateTag(_tag, _subtag) {
+
+    // TODO: TS 3.7 should allow us to do this via assertion
+    let tag = _tag;
+    let subtag = _subtag;
+    if (subtag === CONSTANT_TAG) {
+      tag.subtag = null;
+    } else {
+      // There are two different possibilities when updating a subtag:
+      //
+      // 1. subtag[COMPUTE]() <= tag[COMPUTE]();
+      // 2. subtag[COMPUTE]() > tag[COMPUTE]();
+      //
+      // The first possibility is completely fine within our caching model, but
+      // the second possibility presents a problem. If the parent tag has
+      // already been read, then it's value is cached and will not update to
+      // reflect the subtag's greater value. Next time the cache is busted, the
+      // subtag's value _will_ be read, and it's value will be _greater_ than
+      // the saved snapshot of the parent, causing the resulting calculation to
+      // be rerun erroneously.
+      //
+      // In order to prevent this, when we first update to a new subtag we store
+      // its computed value, and then check against that computed value on
+      // subsequent updates. If its value hasn't changed, then we return the
+      // parent's previous value. Once the subtag changes for the first time,
+      // we clear the cache and everything is finally in sync with the parent.
+      tag.subtagBufferCache = subtag[COMPUTE]();
+      tag.subtag = subtag;
+    }
+  }
+  static dirtyTag(tag, disableConsumptionAssertion) {
+    tag.revision = ++$REVISION;
+    scheduleRevalidate();
+  }
+}
+const DIRTY_TAG = MonomorphicTagImpl.dirtyTag;
+const UPDATE_TAG = MonomorphicTagImpl.updateTag;
+
+//////////
+
+function createTag() {
+  return new MonomorphicTagImpl(DIRYTABLE_TAG_ID);
+}
+function createUpdatableTag() {
+  return new MonomorphicTagImpl(UPDATABLE_TAG_ID);
+}
+
+//////////
+
+const CONSTANT_TAG = new MonomorphicTagImpl(CONSTANT_TAG_ID);
+function isConstTag(tag) {
+  return tag === CONSTANT_TAG;
+}
+
+//////////
+
+const VOLATILE_TAG_ID = 100;
+class VolatileTag {
+  [TYPE] = VOLATILE_TAG_ID;
+  [COMPUTE]() {
+    return VOLATILE;
+  }
+}
+const VOLATILE_TAG = new VolatileTag();
+
+//////////
+
+const CURRENT_TAG_ID = 101;
+class CurrentTag {
+  [TYPE] = CURRENT_TAG_ID;
+  [COMPUTE]() {
+    return $REVISION;
+  }
+}
+const CURRENT_TAG = new CurrentTag();
+
+//////////
+
+const combine = MonomorphicTagImpl.combine;
+
+// Warm
+
+let tag1 = createUpdatableTag();
+let tag2 = createUpdatableTag();
+let tag3 = createUpdatableTag();
+valueForTag(tag1);
+DIRTY_TAG(tag1);
+valueForTag(tag1);
+UPDATE_TAG(tag1, combine([tag2, tag3]));
+valueForTag(tag1);
+DIRTY_TAG(tag2);
+valueForTag(tag1);
+DIRTY_TAG(tag3);
+valueForTag(tag1);
+UPDATE_TAG(tag1, tag3);
+valueForTag(tag1);
+DIRTY_TAG(tag3);
+valueForTag(tag1);
+
+/**
+ * An object that that tracks @tracked properties that were consumed.
+ */
+class Tracker {
+  tags = new Set();
+  last = null;
+  add(tag) {
+    if (tag === CONSTANT_TAG) return;
+    this.tags.add(tag);
+    this.last = tag;
+  }
+  combine() {
+    let {
+      tags
+    } = this;
+    if (tags.size === 0) {
+      return CONSTANT_TAG;
+    } else if (tags.size === 1) {
+      return this.last;
+    } else {
+      return combine(Array.from(this.tags));
+    }
+  }
+}
+
+/**
+ * Whenever a tracked computed property is entered, the current tracker is
+ * saved off and a new tracker is replaced.
+ *
+ * Any tracked properties consumed are added to the current tracker.
+ *
+ * When a tracked computed property is exited, the tracker's tags are
+ * combined and added to the parent tracker.
+ *
+ * The consequence is that each tracked computed property has a tag
+ * that corresponds to the tracked properties consumed inside of
+ * itself, including child tracked computed properties.
+ */
+let CURRENT_TRACKER = null;
+const OPEN_TRACK_FRAMES = [];
+function beginTrackFrame(debuggingContext) {
+  OPEN_TRACK_FRAMES.push(CURRENT_TRACKER);
+  CURRENT_TRACKER = new Tracker();
+}
+function endTrackFrame() {
+  let current = CURRENT_TRACKER;
+  CURRENT_TRACKER = OPEN_TRACK_FRAMES.pop() || null;
+  return unwrap(current).combine();
+}
+function beginUntrackFrame() {
+  OPEN_TRACK_FRAMES.push(CURRENT_TRACKER);
+  CURRENT_TRACKER = null;
+}
+function endUntrackFrame() {
+  CURRENT_TRACKER = OPEN_TRACK_FRAMES.pop() || null;
+}
+
+// This function is only for handling errors and resetting to a valid state
+function resetTracking() {
+  while (OPEN_TRACK_FRAMES.length > 0) {
+    OPEN_TRACK_FRAMES.pop();
+  }
+  CURRENT_TRACKER = null;
+}
+function isTracking() {
+  return CURRENT_TRACKER !== null;
+}
+function consumeTag(tag) {
+  if (CURRENT_TRACKER !== null) {
+    CURRENT_TRACKER.add(tag);
+  }
+}
+
+// public interface
+
+const FN = Symbol('FN');
+const LAST_VALUE = Symbol('LAST_VALUE');
+const TAG = Symbol('TAG');
+const SNAPSHOT = Symbol('SNAPSHOT');
+function createCache(fn, debuggingLabel) {
+  let cache = {
+    [FN]: fn,
+    [LAST_VALUE]: undefined,
+    [TAG]: undefined,
+    [SNAPSHOT]: -1
+  };
+  return cache;
+}
+function getValue(cache) {
+  let fn = cache[FN];
+  let tag = cache[TAG];
+  let snapshot = cache[SNAPSHOT];
+  if (tag === undefined || !validateTag(tag, snapshot)) {
+    beginTrackFrame();
+    try {
+      cache[LAST_VALUE] = fn();
+    } finally {
+      tag = endTrackFrame();
+      cache[TAG] = tag;
+      cache[SNAPSHOT] = valueForTag(tag);
+      consumeTag(tag);
+    }
+  } else {
+    consumeTag(tag);
+  }
+  return cache[LAST_VALUE];
+}
+function isConst(cache) {
+  let tag = cache[TAG];
+  return isConstTag(tag);
+}
+
+//////////
+
+// Legacy tracking APIs
+
+// track() shouldn't be necessary at all in the VM once the autotracking
+// refactors are merged, and we should generally be moving away from it. It may
+// be necessary in Ember for a while longer, but I think we'll be able to drop
+// it in favor of cache sooner rather than later.
+function track(block, debugLabel) {
+  beginTrackFrame();
+  let tag;
+  try {
+    block();
+  } finally {
+    tag = endTrackFrame();
+  }
+  return tag;
+}
+
+// untrack() is currently mainly used to handle places that were previously not
+// tracked, and that tracking now would cause backtracking rerender assertions.
+// I think once we move everyone forward onto modern APIs, we'll probably be
+// able to remove it, but I'm not sure yet.
+function untrack(callback) {
+  beginUntrackFrame();
+  try {
+    return callback();
+  } finally {
+    endUntrackFrame();
+  }
+}
+
+export { ALLOW_CYCLES as A, CONSTANT_TAG as C, DIRTY_TAG as D, INITIAL as I, UPDATE_TAG as U, VOLATILE as V, consumeTag as a, createCache as b, createUpdatableTag as c, valueForTag as d, combine as e, COMPUTE as f, getValue as g, CONSTANT as h, CURRENT_TAG as i, CurrentTag as j, VOLATILE_TAG as k, VolatileTag as l, beginTrackFrame as m, beginUntrackFrame as n, bump as o, createTag as p, endTrackFrame as q, endUntrackFrame as r, isConst as s, track as t, untrack as u, validateTag as v, isConstTag as w, isTracking as x, resetTracking as y };

package/dist/prod/packages/shared-chunks/{capabilities-DXA-L0iT.js → capabilities-_5e35539.js}

@@ -1,6 +1,3 @@
-import './fragment-D7nBU9ae.js';
-import '../@glimmer/validator/index.js';
-import './reference-BNqcwZWH.js';
 import { I as InternalComponentCapabilities } from './flags-B9qxc-pB.js';
 
 function buildCapabilities(capabilities) {

package/dist/prod/packages/shared-chunks/chain-tags-C9rFtQ_x.js

@@ -0,0 +1,178 @@
+import { peekMeta, meta } from '../@ember/-internals/meta/lib/meta.js';
+import { i as isObject } from './spec-BXl1reqK.js';
+import { C as CONSTANT_TAG, e as combine, v as validateTag, c as createUpdatableTag, U as UPDATE_TAG } from './cache-BIlOoPA7.js';
+import { t as tagFor, d as dirtyTagFor, a as tagMetaFor } from './meta-B9mldqPL.js';
+import { g as getCustomTagFor } from './args-proxy-BDXbXCF9.js';
+
+function objectAt(array, index) {
+  if (Array.isArray(array)) {
+    return array[index];
+  } else {
+    return array.objectAt(index);
+  }
+}
+
+/////////
+
+// This is exported for `@tracked`, but should otherwise be avoided. Use `tagForObject`.
+const SELF_TAG = Symbol('SELF_TAG');
+function tagForProperty(obj, propertyKey, addMandatorySetter = false, meta) {
+  let customTagFor = getCustomTagFor(obj);
+  if (customTagFor !== undefined) {
+    return customTagFor(obj, propertyKey, addMandatorySetter);
+  }
+  let tag = tagFor(obj, propertyKey, meta);
+  return tag;
+}
+function tagForObject(obj) {
+  if (isObject(obj)) {
+    return tagFor(obj, SELF_TAG);
+  }
+  return CONSTANT_TAG;
+}
+function markObjectAsDirty(obj, propertyKey) {
+  dirtyTagFor(obj, propertyKey);
+  dirtyTagFor(obj, SELF_TAG);
+}
+
+const CHAIN_PASS_THROUGH = new WeakSet();
+function finishLazyChains(meta, key, value) {
+  let lazyTags = meta.readableLazyChainsFor(key);
+  if (lazyTags === undefined) {
+    return;
+  }
+  if (isObject(value)) {
+    for (let [tag, deps] of lazyTags) {
+      UPDATE_TAG(tag, getChainTagsForKey(value, deps, tagMetaFor(value), peekMeta(value)));
+    }
+  }
+  lazyTags.length = 0;
+}
+function getChainTagsForKeys(obj, keys, tagMeta, meta) {
+  let tags = [];
+  for (let key of keys) {
+    getChainTags(tags, obj, key, tagMeta, meta);
+  }
+  return combine(tags);
+}
+function getChainTagsForKey(obj, key, tagMeta, meta) {
+  return combine(getChainTags([], obj, key, tagMeta, meta));
+}
+function getChainTags(chainTags, obj, path, tagMeta, meta$1) {
+  let current = obj;
+  let currentTagMeta = tagMeta;
+  let currentMeta = meta$1;
+  let pathLength = path.length;
+  let segmentEnd = -1;
+  // prevent closures
+  let segment, descriptor;
+  while (true) {
+    let lastSegmentEnd = segmentEnd + 1;
+    segmentEnd = path.indexOf('.', lastSegmentEnd);
+    if (segmentEnd === -1) {
+      segmentEnd = pathLength;
+    }
+    segment = path.slice(lastSegmentEnd, segmentEnd);
+
+    // If the segment is an @each, we can process it and then break
+    if (segment === '@each' && segmentEnd !== pathLength) {
+      lastSegmentEnd = segmentEnd + 1;
+      segmentEnd = path.indexOf('.', lastSegmentEnd);
+      let arrLength = current.length;
+      if (typeof arrLength !== 'number' ||
+      // TODO: should the second test be `isEmberArray` instead?
+      !(Array.isArray(current) || 'objectAt' in current)) {
+        // If the current object isn't an array, there's nothing else to do,
+        // we don't watch individual properties. Break out of the loop.
+        break;
+      } else if (arrLength === 0) {
+        // Fast path for empty arrays
+        chainTags.push(tagForProperty(current, '[]'));
+        break;
+      }
+      if (segmentEnd === -1) {
+        segment = path.slice(lastSegmentEnd);
+      } else {
+        // Deprecated, remove once we turn the deprecation into an assertion
+        segment = path.slice(lastSegmentEnd, segmentEnd);
+      }
+
+      // Push the tags for each item's property
+      for (let i = 0; i < arrLength; i++) {
+        let item = objectAt(current, i);
+        if (item) {
+          chainTags.push(tagForProperty(item, segment, true));
+          currentMeta = peekMeta(item);
+          descriptor = currentMeta !== null ? currentMeta.peekDescriptors(segment) : undefined;
+
+          // If the key is an alias, we need to bootstrap it
+          if (descriptor !== undefined && typeof descriptor.altKey === 'string') {
+            // eslint-disable-next-line @typescript-eslint/no-unused-expressions
+            item[segment];
+          }
+        }
+      }
+
+      // Push the tag for the array length itself
+      chainTags.push(tagForProperty(current, '[]', true, currentTagMeta));
+      break;
+    }
+    let propertyTag = tagForProperty(current, segment, true, currentTagMeta);
+    descriptor = currentMeta !== null ? currentMeta.peekDescriptors(segment) : undefined;
+    chainTags.push(propertyTag);
+
+    // If we're at the end of the path, processing the last segment, and it's
+    // not an alias, we should _not_ get the last value, since we already have
+    // its tag. There's no reason to access it and do more work.
+    if (segmentEnd === pathLength) {
+      // If the key was an alias, we should always get the next value in order to
+      // bootstrap the alias. This is because aliases, unlike other CPs, should
+      // always be in sync with the aliased value.
+      if (CHAIN_PASS_THROUGH.has(descriptor)) {
+        // eslint-disable-next-line @typescript-eslint/no-unused-expressions
+        current[segment];
+      }
+      break;
+    }
+    if (descriptor === undefined) {
+      // If the descriptor is undefined, then its a normal property, so we should
+      // lookup the value to chain off of like normal.
+
+      if (!(segment in current) && typeof current.unknownProperty === 'function') {
+        current = current.unknownProperty(segment);
+      } else {
+        current = current[segment];
+      }
+    } else if (CHAIN_PASS_THROUGH.has(descriptor)) {
+      current = current[segment];
+    } else {
+      // If the descriptor is defined, then its a normal CP (not an alias, which
+      // would have been handled earlier). We get the last revision to check if
+      // the CP is still valid, and if so we use the cached value. If not, then
+      // we create a lazy chain lookup, and the next time the CP is calculated,
+      // it will update that lazy chain.
+      let instanceMeta = currentMeta.source === current ? currentMeta : meta(current);
+      let lastRevision = instanceMeta.revisionFor(segment);
+      if (lastRevision !== undefined && validateTag(propertyTag, lastRevision)) {
+        current = instanceMeta.valueFor(segment);
+      } else {
+        // use metaFor here to ensure we have the meta for the instance
+        let lazyChains = instanceMeta.writableLazyChainsFor(segment);
+        let rest = path.substring(segmentEnd + 1);
+        let placeholderTag = createUpdatableTag();
+        lazyChains.push([placeholderTag, rest]);
+        chainTags.push(placeholderTag);
+        break;
+      }
+    }
+    if (!isObject(current)) {
+      // we've hit the end of the chain for now, break out
+      break;
+    }
+    currentTagMeta = tagMetaFor(current);
+    currentMeta = peekMeta(current);
+  }
+  return chainTags;
+}
+
+export { CHAIN_PASS_THROUGH as C, SELF_TAG as S, tagForProperty as a, getChainTagsForKeys as b, finishLazyChains as f, getChainTagsForKey as g, markObjectAsDirty as m, objectAt as o, tagForObject as t };