Efficient sampling across large ranges
The tool does not build an array containing every integer from the minimum to the maximum. It draws positions in the eligible pool and maps those positions around the sorted exclusion list. In unique mode, a sparse partial shuffle remembers only the positions needed for the requested batch. Integer arithmetic preserves exact endpoints even when the span between them exceeds the safe size of an ordinary JavaScript integer. Work is bounded by the requested output and the exclusion list, rather than by the total width of the range.