@rickosborne/rebound/integer-generator.cjs

Rick Osborne's utilities for working with bounded numbers

"use strict";
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);
var integer_generator_exports = {};
__export(integer_generator_exports, {
  integerGenerator: () => integerGenerator
});
module.exports = __toCommonJS(integer_generator_exports);
var import_guard_bounded = require("./guard-bounded.cjs");
function* integerGenerator(bounds, options = {}) {
  var _a;
  const { isLowerInc, isUpperInc, isInt, upper, lower } = bounds;
  const prefix = ((_a = options.typeName) == null ? void 0 : _a.concat(": ")) ?? "";
  const step = options.step ?? 1;
  const start = options.start ?? (step < 0 ? upper : lower);
  const end = options.end ?? (step < 0 ? lower : upper);
  if (!Number.isFinite(start)) {
    throw new RangeError(`${prefix}Unbounded start`);
  }
  if (!(0, import_guard_bounded.validateBounded)(isLowerInc, lower, isInt, upper, isUpperInc, false, start) || !(0, import_guard_bounded.validateBounded)(isLowerInc, lower, isInt, upper, isUpperInc, false, end) || step > 0 && start > end || step < 0 && start < end) {
    return;
  }
  let more;
  if (step > 0) {
    if (isUpperInc) more = /* @__PURE__ */ __name((n) => n <= end, "more");
    else more = /* @__PURE__ */ __name((n) => n < end, "more");
  } else if (step < 0) {
    if (isLowerInc) more = /* @__PURE__ */ __name((n) => n >= end, "more");
    else more = /* @__PURE__ */ __name((n) => n > end, "more");
  } else {
    more = /* @__PURE__ */ __name(() => true, "more");
  }
  for (let n = start; more(n); n = n + step) {
    yield n;
  }
}
__name(integerGenerator, "integerGenerator");
//# sourceMappingURL=integer-generator.cjs.map