queue-typed 2.2.3 → 2.2.6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (34) hide show
  1. package/dist/cjs/index.cjs +0 -34
  2. package/dist/cjs/index.cjs.map +1 -1
  3. package/dist/cjs-legacy/index.cjs +0 -34
  4. package/dist/cjs-legacy/index.cjs.map +1 -1
  5. package/dist/esm/index.mjs +0 -34
  6. package/dist/esm/index.mjs.map +1 -1
  7. package/dist/esm-legacy/index.mjs +0 -34
  8. package/dist/esm-legacy/index.mjs.map +1 -1
  9. package/dist/types/data-structures/base/iterable-entry-base.d.ts +6 -0
  10. package/dist/types/data-structures/binary-tree/avl-tree-counter.d.ts +2 -2
  11. package/dist/types/data-structures/binary-tree/avl-tree-multi-map.d.ts +5 -5
  12. package/dist/types/data-structures/binary-tree/avl-tree.d.ts +2 -3
  13. package/dist/types/data-structures/binary-tree/binary-tree.d.ts +14 -57
  14. package/dist/types/data-structures/binary-tree/bst.d.ts +151 -117
  15. package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +2 -2
  16. package/dist/types/data-structures/binary-tree/tree-counter.d.ts +4 -5
  17. package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +5 -5
  18. package/dist/types/types/data-structures/binary-tree/bst.d.ts +5 -5
  19. package/dist/umd/queue-typed.js +0 -31
  20. package/dist/umd/queue-typed.js.map +1 -1
  21. package/dist/umd/queue-typed.min.js +1 -1
  22. package/dist/umd/queue-typed.min.js.map +1 -1
  23. package/package.json +2 -2
  24. package/src/common/index.ts +2 -4
  25. package/src/data-structures/base/iterable-entry-base.ts +9 -0
  26. package/src/data-structures/binary-tree/avl-tree-counter.ts +1 -2
  27. package/src/data-structures/binary-tree/avl-tree-multi-map.ts +9 -8
  28. package/src/data-structures/binary-tree/avl-tree.ts +4 -5
  29. package/src/data-structures/binary-tree/binary-tree.ts +67 -0
  30. package/src/data-structures/binary-tree/bst.ts +724 -108
  31. package/src/data-structures/binary-tree/red-black-tree.ts +1 -2
  32. package/src/data-structures/binary-tree/tree-counter.ts +5 -7
  33. package/src/data-structures/binary-tree/tree-multi-map.ts +7 -8
  34. package/src/types/data-structures/binary-tree/bst.ts +5 -5
@@ -1700,38 +1700,6 @@ var rangeCheck = /* @__PURE__ */ __name((index, min, max, message = "Index out o
1700
1700
  if (index < min || index > max) throw new RangeError(message);
1701
1701
  }, "rangeCheck");
1702
1702
  var calcMinUnitsRequired = /* @__PURE__ */ __name((totalQuantity, unitSize) => Math.floor((totalQuantity + unitSize - 1) / unitSize), "calcMinUnitsRequired");
1703
- function isPrimitiveComparable(value) {
1704
- const valueType = typeof value;
1705
- if (valueType === "number") return true;
1706
- return valueType === "bigint" || valueType === "string" || valueType === "boolean";
1707
- }
1708
- __name(isPrimitiveComparable, "isPrimitiveComparable");
1709
- function tryObjectToPrimitive(obj) {
1710
- if (typeof obj.valueOf === "function") {
1711
- const valueOfResult = obj.valueOf();
1712
- if (valueOfResult !== obj) {
1713
- if (isPrimitiveComparable(valueOfResult)) return valueOfResult;
1714
- if (typeof valueOfResult === "object" && valueOfResult !== null) return tryObjectToPrimitive(valueOfResult);
1715
- }
1716
- }
1717
- if (typeof obj.toString === "function") {
1718
- const stringResult = obj.toString();
1719
- if (stringResult !== "[object Object]") return stringResult;
1720
- }
1721
- return null;
1722
- }
1723
- __name(tryObjectToPrimitive, "tryObjectToPrimitive");
1724
- function isComparable(value, isForceObjectComparable = false) {
1725
- if (value === null || value === void 0) return false;
1726
- if (isPrimitiveComparable(value)) return true;
1727
- if (typeof value !== "object") return false;
1728
- if (value instanceof Date) return true;
1729
- if (isForceObjectComparable) return true;
1730
- const comparableValue = tryObjectToPrimitive(value);
1731
- if (comparableValue === null || comparableValue === void 0) return false;
1732
- return isPrimitiveComparable(comparableValue);
1733
- }
1734
- __name(isComparable, "isComparable");
1735
1703
 
1736
1704
  // src/data-structures/queue/deque.ts
1737
1705
  var Deque = class extends LinearBase {
@@ -2473,8 +2441,6 @@ var Range = class {
2473
2441
  this.high = high;
2474
2442
  this.includeLow = includeLow;
2475
2443
  this.includeHigh = includeHigh;
2476
- if (!(isComparable(low) && isComparable(high))) throw new RangeError("low or high is not comparable");
2477
- if (low > high) throw new RangeError("low must be less than or equal to high");
2478
2444
  }
2479
2445
  static {
2480
2446
  __name(this, "Range");