@bablr/agast-vm 0.8.0 → 0.9.0

package/lib/context.js

@@ -1,88 +0,0 @@
-import { reifyExpression } from '@bablr/agast-vm-helpers';
-import { sourceTextFor as sourceTextForTree } from '@bablr/agast-helpers/tree';
-
-import { allTagPathsFor } from './path.js';
-import { facades, actuals } from './facades.js';
-
-export const ContextFacade = class AgastContextFacade {
-  getPreviousTagPath(token) {
-    return actuals.get(this).prevTags.get(token);
-  }
-
-  getNextTagPath(token) {
-    return actuals.get(this).nextTags.get(token);
-  }
-
-  allTagsFor(range) {
-    return actuals.get(this).allTagsFor(range);
-  }
-
-  reifyExpression(range) {
-    return actuals.get(this).reifyExpression(range);
-  }
-
-  sourceTextFor(range) {
-    return actuals.get(this).sourceTextFor(range);
-  }
-
-  buildRange(tags) {
-    return actuals.get(this).buildRange(tags);
-  }
-
-  nodeForTag(tag) {
-    return actuals.get(this).nodeForTag(tag);
-  }
-};
-
-export const Context = class AgastContext {
-  static create() {
-    return new Context();
-  }
-
-  constructor() {
-    this.tagNodes = new WeakMap();
-    this.facade = new ContextFacade();
-
-    facades.set(this, this.facade);
-  }
-
-  allTagsFor(range) {
-    return allTagPathsFor(range);
-  }
-
-  allTagsReverseFor(range) {
-    throw new Error('not implemented');
-  }
-
-  nodeForTag(tag) {
-    return this.tagNodes.get(tag);
-  }
-
-  sourceTextFor(node) {
-    return sourceTextForTree(node);
-  }
-
-  buildRange(tags) {
-    const { prevTags, nextTags } = this;
-
-    let start, end;
-    for (const tag of tags) {
-      if (prevTags.has(tag) || nextTags.has(tag)) {
-        throw new Error('buildRange must not overwrite linkages');
-      }
-
-      if (end) {
-        prevTags.set(tag, end);
-        nextTags.set(end, tag);
-      }
-
-      start = start || tag;
-      end = tag || end;
-    }
-    return start ? [start, end] : null;
-  }
-
-  reifyExpression(value) {
-    return reifyExpression(value);
-  }
-};

package/lib/utils/array.js

@@ -1,7 +0,0 @@
-export const findRight = (arr, predicate) => {
-  for (let i = arr.length - 1; i >= 0; i--) {
-    const value = arr[i];
-    if (predicate(value)) return value;
-  }
-  return null;
-};

package/lib/utils/iterable.js

@@ -1,13 +0,0 @@
-export function first(iter) {
-  for (const value of iter) {
-    return value;
-  }
-}
-
-export function* drop(n, iterable) {
-  let i = -1;
-  for (const value of iterable) {
-    ++i;
-    if (i >= n) yield value;
-  }
-}

package/lib/utils/skip.js

@@ -1,39 +0,0 @@
-import { findRight } from './array.js';
-
-const skipLevels = 3;
-const skipShiftExponentGrowth = 4;
-const skipAmounts = new Array(skipLevels)
-  .fill(null)
-  .map((_, i) => 2 >> (i * skipShiftExponentGrowth));
-const skipsByFrame = new WeakMap();
-
-export const buildSkips = (frame) => {
-  let skipIdx = 0;
-  let skipAmount = skipAmounts[skipIdx];
-  let skips;
-  while ((frame.depth & skipAmount) === skipAmount) {
-    if (!skips) {
-      skips = [];
-      skipsByFrame.set(frame, skips);
-    }
-
-    skips[skipIdx] = frame.at(frame.depth - skipAmount);
-
-    skipIdx++;
-    skipAmount = skipAmounts[skipIdx];
-  }
-};
-
-export const skipToDepth = (depth, frame) => {
-  let parent = frame;
-
-  if (depth > frame.depth) throw new Error();
-
-  let d = frame.depth;
-  for (; d > depth; ) {
-    const skips = skipsByFrame.get(frame);
-    parent = (skips && findRight(skips, (skip) => d - skip > depth)) || parent.parent;
-    d = parent.depth;
-  }
-  return parent;
-};