@rickosborne/rebound/integer-generator.mjs

Rick Osborne's utilities for working with bounded numbers

var __defProp = Object.defineProperty;
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
import { validateBounded } from "./guard-bounded.mjs";
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 (!validateBounded(isLowerInc, lower, isInt, upper, isUpperInc, false, start) || !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");
export {
  integerGenerator
};
//# sourceMappingURL=integer-generator.mjs.map