/**
 * True if `a` is strictly newer than `b` accounting for 32-bit wraparound.
 *
 * Inputs must be unsigned 32-bit integers (0..2^32-1). Use Number arithmetic,
 * not bitwise comparison, because JS bitwise operators sign-extend at bit 31.
 *
 * @param {number} a
 * @param {number} b
 * @returns {boolean}
 */
export function seq32_greater_than(a: number, b: number): boolean;
/**
 * Signed forward distance from `from` to `to` accounting for 32-bit wraparound.
 * Result range: -2^31..2^31-1.
 *
 * @param {number} from
 * @param {number} to
 * @returns {number}
 */
export function seq32_distance(from: number, to: number): number;
/**
 * Advance a sequence by `delta` (which may be negative) with 32-bit wraparound.
 *
 * @param {number} seq
 * @param {number} [delta=1]
 * @returns {number}
 */
export function seq32_advance(seq: number, delta?: number): number;
/**
 * 32-bit modular sequence arithmetic.
 *
 * Mirrors {@link ./seq16.js} but in a 32-bit modular space (wraps at 2^32).
 * Use this when 16 bits are not enough headroom — e.g. for frame counters that
 * tick at 60+ Hz over many hours, where 16 bits (~18 minutes) wraps too quickly
 * for safe comparison even with the half-range rule.
 *
 * All functions are pure.
 *
 * @author Alex Goldring
 * @copyright Company Named Limited (c) 2026
 */
/**
 * @type {number}
 */
export const SEQ32_MAX: number;
/**
 * Modular range as a Number. 2^32 is exactly representable as a Number.
 * @type {number}
 */
export const SEQ32_RANGE: number;
/**
 * @type {number}
 */
export const SEQ32_HALF_RANGE: number;
//# sourceMappingURL=seq32.d.ts.map