openpinescript 0.1.1__py3-none-any.whl

openpinescript/_engine/node_modules/antlr4ng/dist/misc/OrderedHashSet.mjs

@@ -0,0 +1,450 @@
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+
+// src/utils/MurmurHash.ts
+var c1 = 3432918353;
+var c2 = 461845907;
+var r1 = 15;
+var r2 = 13;
+var m = 5;
+var n = 3864292196;
+var MurmurHash = class _MurmurHash {
+  static {
+    __name(this, "MurmurHash");
+  }
+  static defaultSeed = 701;
+  constructor() {
+  }
+  /**
+   * Initialize the hash using the specified {@code seed}.
+   *
+   * @param seed the seed
+   *
+   * @returns the intermediate hash value
+   */
+  static initialize(seed = _MurmurHash.defaultSeed) {
+    return seed;
+  }
+  static updateFromComparable(hash, value) {
+    return this.update(hash, value?.hashCode() ?? 0);
+  }
+  /**
+   * Update the intermediate hash value for the next input {@code value}.
+   *
+   * @param hash The intermediate hash value.
+   * @param value the value to add to the current hash.
+   *
+   * @returns the updated intermediate hash value
+   */
+  static update(hash, value) {
+    value = Math.imul(value, c1);
+    value = value << r1 | value >>> 32 - r1;
+    value = Math.imul(value, c2);
+    hash = hash ^ value;
+    hash = hash << r2 | hash >>> 32 - r2;
+    hash = Math.imul(hash, m) + n;
+    return hash;
+  }
+  /**
+   * Apply the final computation steps to the intermediate value {@code hash}
+   * to form the final result of the MurmurHash 3 hash function.
+   *
+   * @param hash The intermediate hash value.
+   * @param entryCount The number of values added to the hash.
+   *
+   * @returns the final hash result
+   */
+  static finish(hash, entryCount) {
+    hash ^= entryCount * 4;
+    hash ^= hash >>> 16;
+    hash = Math.imul(hash, 2246822507);
+    hash ^= hash >>> 13;
+    hash = Math.imul(hash, 3266489909);
+    hash ^= hash >>> 16;
+    return hash;
+  }
+  /**
+   * An all-in-one convenience method to compute a hash for a single value.
+   *
+   * @param value The value to hash.
+   * @param seed The seed for the hash value.
+   *
+   * @returns The computed hash.
+   */
+  static hashCode(value, seed) {
+    return _MurmurHash.finish(_MurmurHash.update(seed ?? _MurmurHash.defaultSeed, value), 1);
+  }
+};
+
+// src/misc/ObjectEqualityComparator.ts
+var ObjectEqualityComparator = class _ObjectEqualityComparator {
+  static {
+    __name(this, "ObjectEqualityComparator");
+  }
+  static instance = new _ObjectEqualityComparator();
+  hashCode(obj) {
+    if (obj == null) {
+      return 0;
+    }
+    return obj.hashCode();
+  }
+  equals(a, b) {
+    if (a == null) {
+      return b == null;
+    }
+    return a.equals(b);
+  }
+};
+
+// src/misc/DefaultEqualityComparator.ts
+var DefaultEqualityComparator = class _DefaultEqualityComparator {
+  static {
+    __name(this, "DefaultEqualityComparator");
+  }
+  static instance = new _DefaultEqualityComparator();
+  hashCode(obj) {
+    if (obj == null) {
+      return 0;
+    }
+    return ObjectEqualityComparator.instance.hashCode(obj);
+  }
+  equals(a, b) {
+    if (a == null) {
+      return b == null;
+    }
+    if (typeof a === "string" || typeof a === "number") {
+      return a === b;
+    }
+    return ObjectEqualityComparator.instance.equals(a, b);
+  }
+};
+
+// src/misc/HashSet.ts
+var HashSet = class _HashSet {
+  static {
+    __name(this, "HashSet");
+  }
+  static defaultLoadFactor = 0.75;
+  static initialCapacity = 16;
+  // must be power of 2
+  comparator;
+  buckets;
+  threshold;
+  /** How many elements in set */
+  itemCount = 0;
+  constructor(comparatorOrSet, initialCapacity = _HashSet.initialCapacity) {
+    if (comparatorOrSet instanceof _HashSet) {
+      this.comparator = comparatorOrSet.comparator;
+      this.buckets = comparatorOrSet.buckets.slice(0);
+      for (let i = 0; i < this.buckets.length; i++) {
+        const bucket = this.buckets[i];
+        if (bucket) {
+          this.buckets[i] = bucket.slice(0);
+        }
+      }
+      this.itemCount = comparatorOrSet.itemCount;
+      this.threshold = comparatorOrSet.threshold;
+    } else {
+      this.comparator = comparatorOrSet ?? DefaultEqualityComparator.instance;
+      this.buckets = this.createBuckets(initialCapacity);
+      this.threshold = Math.floor(_HashSet.initialCapacity * _HashSet.defaultLoadFactor);
+    }
+  }
+  /**
+   * Add `o` to set if not there; return existing value if already
+   * there. This method performs the same operation as {@link #add} aside from
+   * the return value.
+   *
+   * @param o the object to add to the set.
+   *
+   * @returns An existing element that equals to `o` if already in set, otherwise `o`.
+   */
+  getOrAdd(o) {
+    if (this.itemCount > this.threshold) {
+      this.expand();
+    }
+    const b = this.getBucket(o);
+    let bucket = this.buckets[b];
+    if (!bucket) {
+      bucket = [o];
+      this.buckets[b] = bucket;
+      ++this.itemCount;
+      return o;
+    }
+    for (const existing of bucket) {
+      if (this.comparator.equals(existing, o)) {
+        return existing;
+      }
+    }
+    bucket.push(o);
+    ++this.itemCount;
+    return o;
+  }
+  get(o) {
+    if (o == null) {
+      return o;
+    }
+    const b = this.getBucket(o);
+    const bucket = this.buckets[b];
+    if (!bucket) {
+      return void 0;
+    }
+    for (const e of bucket) {
+      if (this.comparator.equals(e, o)) {
+        return e;
+      }
+    }
+    return void 0;
+  }
+  /**
+   * Removes the specified element from this set if it is present.
+   *
+   * @param o object to be removed from this set, if present.
+   *
+   * @returns `true` if the set contained the specified element.
+   */
+  remove(o) {
+    if (o == null) {
+      return false;
+    }
+    const b = this.getBucket(o);
+    const bucket = this.buckets[b];
+    if (!bucket) {
+      return false;
+    }
+    for (let i = 0; i < bucket.length; i++) {
+      const existing = bucket[i];
+      if (this.comparator.equals(existing, o)) {
+        bucket.splice(i, 1);
+        --this.itemCount;
+        return true;
+      }
+    }
+    return false;
+  }
+  hashCode() {
+    let hash = MurmurHash.initialize();
+    for (const bucket of this.buckets) {
+      if (bucket == null) {
+        continue;
+      }
+      for (const o of bucket) {
+        if (o == null) {
+          break;
+        }
+        hash = MurmurHash.update(hash, this.comparator.hashCode(o));
+      }
+    }
+    hash = MurmurHash.finish(hash, this.size);
+    return hash;
+  }
+  equals(o) {
+    if (o === this) {
+      return true;
+    }
+    if (!(o instanceof _HashSet)) {
+      return false;
+    }
+    if (o.size !== this.size) {
+      return false;
+    }
+    return this.containsAll(o);
+  }
+  add(t) {
+    const existing = this.getOrAdd(t);
+    return existing === t;
+  }
+  contains(o) {
+    return this.containsFast(o);
+  }
+  containsFast(obj) {
+    if (obj == null) {
+      return false;
+    }
+    return this.get(obj) !== void 0;
+  }
+  *[Symbol.iterator]() {
+    yield* this.toArray();
+  }
+  toArray() {
+    const a = new Array(this.size);
+    let i = 0;
+    for (const bucket of this.buckets) {
+      if (bucket == null) {
+        continue;
+      }
+      for (const o of bucket) {
+        if (o == null) {
+          break;
+        }
+        a[i++] = o;
+      }
+    }
+    return a;
+  }
+  containsAll(collection) {
+    if (collection instanceof _HashSet) {
+      for (const bucket of collection.buckets) {
+        if (bucket == null) {
+          continue;
+        }
+        for (const o of bucket) {
+          if (o == null) {
+            break;
+          }
+          if (!this.containsFast(o)) {
+            return false;
+          }
+        }
+      }
+    } else {
+      for (const o of collection) {
+        if (!this.containsFast(o)) {
+          return false;
+        }
+      }
+    }
+    return true;
+  }
+  addAll(c) {
+    let changed = false;
+    for (const o of c) {
+      const existing = this.getOrAdd(o);
+      if (existing !== o) {
+        changed = true;
+      }
+    }
+    return changed;
+  }
+  clear() {
+    this.buckets = this.createBuckets(_HashSet.initialCapacity);
+    this.itemCount = 0;
+    this.threshold = Math.floor(_HashSet.initialCapacity * _HashSet.defaultLoadFactor);
+  }
+  toString() {
+    if (this.size === 0) {
+      return "{}";
+    }
+    let buf = "{";
+    let first = true;
+    for (const bucket of this.buckets) {
+      if (bucket == null) {
+        continue;
+      }
+      for (const o of bucket) {
+        if (o == null) {
+          break;
+        }
+        if (first) {
+          first = false;
+        } else {
+          buf += ", ";
+        }
+        buf += o.toString();
+      }
+    }
+    buf += "}";
+    return buf;
+  }
+  toTableString() {
+    let buf = "";
+    for (const bucket of this.buckets) {
+      if (bucket == null) {
+        buf += "null\n";
+        continue;
+      }
+      buf += "[";
+      let first = true;
+      for (const o of bucket) {
+        if (first) {
+          first = false;
+        } else {
+          buf += " ";
+        }
+        if (o == null) {
+          buf += "_";
+        } else {
+          buf += o.toString();
+        }
+      }
+      buf += "]\n";
+    }
+    return buf;
+  }
+  getBucket(o) {
+    const hash = this.comparator.hashCode(o);
+    const b = hash & this.buckets.length - 1;
+    return b;
+  }
+  expand() {
+    const old = this.buckets;
+    const newCapacity = this.buckets.length * 2;
+    const newTable = this.createBuckets(newCapacity);
+    this.buckets = newTable;
+    this.threshold = Math.floor(newCapacity * _HashSet.defaultLoadFactor);
+    for (const bucket of old) {
+      if (!bucket) {
+        continue;
+      }
+      for (const o of bucket) {
+        const b = this.getBucket(o);
+        let newBucket = this.buckets[b];
+        if (!newBucket) {
+          newBucket = [];
+          this.buckets[b] = newBucket;
+        }
+        newBucket.push(o);
+      }
+    }
+  }
+  get size() {
+    return this.itemCount;
+  }
+  get isEmpty() {
+    return this.itemCount === 0;
+  }
+  /**
+   * Return an array of `T[]` with length `capacity`.
+   *
+   * @param capacity the length of the array to return
+   * @returns the newly constructed array
+   */
+  createBuckets(capacity) {
+    return new Array(capacity);
+  }
+};
+
+// src/misc/OrderedHashSet.ts
+var OrderedHashSet = class _OrderedHashSet extends HashSet {
+  static {
+    __name(this, "OrderedHashSet");
+  }
+  elements = [];
+  getOrAdd(o) {
+    const oldSize = this.size;
+    const result = super.getOrAdd(o);
+    if (this.size > oldSize) {
+      this.elements.push(o);
+    }
+    return result;
+  }
+  equals(o) {
+    if (!(o instanceof _OrderedHashSet)) {
+      return false;
+    }
+    return super.equals(o);
+  }
+  clear() {
+    super.clear();
+    this.elements = [];
+  }
+  *[Symbol.iterator]() {
+    yield* this.elements;
+  }
+  toArray() {
+    return this.elements.slice(0);
+  }
+};
+export {
+  OrderedHashSet
+};

openpinescript/_engine/node_modules/antlr4ng/dist/misc/ParseCancellationException.cjs

@@ -0,0 +1,34 @@
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/misc/ParseCancellationException.ts
+var ParseCancellationException_exports = {};
+__export(ParseCancellationException_exports, {
+  ParseCancellationException: () => ParseCancellationException
+});
+module.exports = __toCommonJS(ParseCancellationException_exports);
+var ParseCancellationException = class extends Error {
+  static {
+    __name(this, "ParseCancellationException");
+  }
+  constructor(e) {
+    super();
+    this.cause = e;
+  }
+};

openpinescript/_engine/node_modules/antlr4ng/dist/misc/ParseCancellationException.js

@@ -0,0 +1,34 @@
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/misc/ParseCancellationException.ts
+var ParseCancellationException_exports = {};
+__export(ParseCancellationException_exports, {
+  ParseCancellationException: () => ParseCancellationException
+});
+module.exports = __toCommonJS(ParseCancellationException_exports);
+var ParseCancellationException = class extends Error {
+  static {
+    __name(this, "ParseCancellationException");
+  }
+  constructor(e) {
+    super();
+    this.cause = e;
+  }
+};

openpinescript/_engine/node_modules/antlr4ng/dist/misc/ParseCancellationException.mjs

@@ -0,0 +1,16 @@
+var __defProp = Object.defineProperty;
+var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
+
+// src/misc/ParseCancellationException.ts
+var ParseCancellationException = class extends Error {
+  static {
+    __name(this, "ParseCancellationException");
+  }
+  constructor(e) {
+    super();
+    this.cause = e;
+  }
+};
+export {
+  ParseCancellationException
+};