PHP 8.2.30
Preview: context.js Size: 3.16 KB
/home/byroehnu/easepay.easetack.com/node_modules/@babel/traverse/lib/context.js

"use strict";

Object.defineProperty(exports, "__esModule", {
  value: true
});
exports.default = void 0;
var _index = require("./path/index.js");
var _t = require("@babel/types");
var _context = require("./path/context.js");
var _hub = require("./hub.js");
const {
  VISITOR_KEYS
} = _t;
class TraversalContext {
  constructor(scope, opts, state, parentPath) {
    this.queue = null;
    this.priorityQueue = null;
    this.parentPath = parentPath;
    this.scope = scope;
    this.state = state;
    this.opts = opts;
  }
  shouldVisit(node) {
    const opts = this.opts;
    if (opts.enter || opts.exit) return true;
    if (opts[node.type]) return true;
    const keys = VISITOR_KEYS[node.type];
    if (!(keys != null && keys.length)) return false;
    for (const key of keys) {
      if (node[key]) {
        return true;
      }
    }
    return false;
  }
  create(node, container, key, listKey) {
    const {
      parentPath
    } = this;
    const hub = parentPath == null ? node.type === "Program" || node.type === "File" ? new _hub.default() : undefined : parentPath.hub;
    return _index.default.get({
      parentPath,
      parent: node,
      container,
      key: key,
      listKey,
      hub
    });
  }
  maybeQueue(path, notPriority) {
    if (this.queue) {
      if (notPriority) {
        this.queue.push(path);
      } else {
        this.priorityQueue.push(path);
      }
    }
  }
  visitMultiple(container, parent, listKey) {
    if (container.length === 0) return false;
    const queue = [];
    for (let key = 0; key < container.length; key++) {
      const node = container[key];
      if (node && this.shouldVisit(node)) {
        queue.push(this.create(parent, container, key, listKey));
      }
    }
    return this.visitQueue(queue);
  }
  visitSingle(node, key) {
    if (this.shouldVisit(node[key])) {
      return this.visitQueue([this.create(node, node, key)]);
    } else {
      return false;
    }
  }
  visitQueue(queue) {
    this.queue = queue;
    this.priorityQueue = [];
    const visited = new WeakSet();
    let stop = false;
    let visitIndex = 0;
    for (; visitIndex < queue.length;) {
      const path = queue[visitIndex];
      visitIndex++;
      _context.resync.call(path);
      if (path.contexts.length === 0 || path.contexts[path.contexts.length - 1] !== this) {
        _context.pushContext.call(path, this);
      }
      if (path.key === null) continue;
      const {
        node
      } = path;
      if (visited.has(node)) continue;
      if (node) visited.add(node);
      if (path.visit()) {
        stop = true;
        break;
      }
      if (this.priorityQueue.length) {
        stop = this.visitQueue(this.priorityQueue);
        this.priorityQueue = [];
        this.queue = queue;
        if (stop) break;
      }
    }
    for (let i = 0; i < visitIndex; i++) {
      _context.popContext.call(queue[i]);
    }
    this.queue = null;
    return stop;
  }
  visit(node, key) {
    const nodes = node[key];
    if (!nodes) return false;
    if (Array.isArray(nodes)) {
      return this.visitMultiple(nodes, node, key);
    } else {
      return this.visitSingle(node, key);
    }
  }
}
exports.default = TraversalContext;

//# sourceMappingURL=context.js.map

Directory Contents

Dirs: 2 × Files: 15

Name Size Perms Modified Actions
path DIR
- drwxr-xr-x 2026-03-14 01:49:05
Edit Download
scope DIR
- drwxr-xr-x 2026-03-14 01:49:05
Edit Download
127 B lr--r--r-- 2026-03-14 01:49:05
Edit Download
895 B lrw-r--r-- 2026-02-28 00:26:54
Edit Download
1.99 KB lrw-r--r-- 2026-02-28 00:27:06
Edit Download
3.16 KB lrw-r--r-- 2026-02-28 00:27:14
Edit Download
9.64 KB lrw-r--r-- 2026-02-28 00:27:26
Edit Download
373 B lrw-r--r-- 2026-02-28 00:27:34
Edit Download
1.12 KB lrw-r--r-- 2026-02-28 00:27:38
Edit Download
2.57 KB lrw-r--r-- 2026-02-28 00:27:46
Edit Download
6.60 KB lrw-r--r-- 2026-02-28 00:27:58
Edit Download
3.88 KB lrw-r--r-- 2026-02-28 00:29:22
Edit Download
11.05 KB lrw-r--r-- 2026-02-28 00:29:28
Edit Download
49 B lrw-r--r-- 2026-02-28 00:29:30
Edit Download
3.10 KB lrw-r--r-- 2026-02-28 00:29:32
Edit Download
7.70 KB lrw-r--r-- 2026-02-28 00:29:32
Edit Download
22.80 KB lrw-r--r-- 2026-02-28 00:29:34
Edit Download

If ZipArchive is unavailable, a .tar will be created (no compression).