refactor: update all countdown loops

examples/hdom-canvas-particles/src/index.ts

@@ -37,7 +37,7 @@ const initCurves = () => [
 ];
 
 const updateCurves = (curves: Cubic[], t: number) => {
-    for (let i = curves.length; --i >= 0; ) {
+    for (let i = curves.length; i-- > 0; ) {
         const crv = curves[i];
         const pts = crv.points;
         const id = crv.attribs!.id;
@@ -57,7 +57,7 @@ const makeParticle = (curves: Cubic[]) => ({
 });
 
 const updateParticles = (particles: Particle[]) => {
-    for (let i = particles.length; --i >= 0; ) {
+    for (let i = particles.length; i-- > 0; ) {
         const p = particles[i];
         p.pos = wrap01(p.pos + p.vel);
     }

examples/hdom-local-render/src/index.ts

@@ -41,7 +41,7 @@ abstract class LocalReRenderable {
     localRender(...args: any[]) {
         const el = this.el!;
         const children = el.parentElement!.children;
-        for (let i = children.length; --i >= 0; ) {
+        for (let i = children.length; i-- > 0; ) {
             if (children[i] === el) {
                 replaceChild(
                     {},

examples/imgui-basics/src/index.ts

@@ -78,7 +78,7 @@ const smoothedVolume = tweenNumber(volume, 0, 0.2);
 
 // derived view for slider label
 const volumeLabel = smoothedVolume.map((x) => {
-    for (let i = PRESETS.length; --i >= 0; ) {
+    for (let i = PRESETS.length; i-- > 0; ) {
         if (x >= PRESETS[i][1]) return `${Math.round(x)} (${PRESETS[i][0]})`;
     }
     return "";

examples/pixel-sorting/src/index.ts

@@ -47,7 +47,7 @@ const pixelSortBuffer = (
     const { pixels, width, height } = buf;
     const row = closedOpen(0, width);
     const column = closedOpen(0, height);
-    for (let i = iter; --i >= 0; ) {
+    for (let i = iter; i-- > 0; ) {
         const num = SYSTEM.minmax(min, max) | 0;
         const n2 = num >> 1;
         // random start/pixel position in image

examples/xml-converter/src/format.ts

@@ -137,7 +137,7 @@ format.add("obj", (opts, res, x) => {
     } else {
         const outer = spaces(opts.indent);
         res += opts.prefix + "{" + opts.lineSep;
-        for (let i = keys.length; --i >= 0; ) {
+        for (let i = keys.length; i-- > 0; ) {
             const k = keys[i];
             res += formatPair(
                 k === "style"

packages/adjacency/src/binary.ts

@@ -22,7 +22,7 @@ export class AdjacencyBitMatrix implements IGraph<number> {
 
     *edges() {
         const directed = !this.undirected;
-        for (let i = this.mat.n; --i >= 0; ) {
+        for (let i = this.mat.n; i-- > 0; ) {
             for (let n of this.neighbors(i)) {
                 if (directed || n > i) {
                     yield <Edge>[i, n];

packages/adjacency/src/disjoint-set.ts

@@ -86,7 +86,7 @@ export class DisjointSet {
     subsets() {
         const sets: Map<number, number[]> = new Map();
         const roots = this.roots;
-        for (let i = roots.length; --i >= 0; ) {
+        for (let i = roots.length; i-- > 0; ) {
             const id = this.canonical(i);
             const s = sets.get(id);
             if (s) {

packages/adjacency/src/sparse.ts

@@ -96,17 +96,17 @@ export class AdjacencyMatrix extends CSR implements IGraph<number> {
         switch (deg) {
             case "out":
             default:
-                for (let i = this.m; --i >= 0; ) {
+                for (let i = this.m; i-- > 0; ) {
                     res.setAt(i, i, this.nnzRow(i));
                 }
                 break;
             case "in":
-                for (let i = this.m; --i >= 0; ) {
+                for (let i = this.m; i-- > 0; ) {
                     res.setAt(i, i, this.nnzCol(i));
                 }
                 break;
             case "inout":
-                for (let i = this.m; --i >= 0; ) {
+                for (let i = this.m; i-- > 0; ) {
                     res.setAt(i, i, this.nnzRow(i) + this.nnzCol(i));
                 }
                 break;

packages/api/src/mixins/inotify.ts

@@ -60,7 +60,7 @@ export const INotifyMixin = mixin(<INotify>{
 
     __listener(listeners: [Listener, any][], f: Listener, scope: any) {
         let i = listeners.length;
-        while (--i >= 0) {
+        while (i-- > 0) {
             const l = listeners[i];
             if (l[0] === f && l[1] === scope) {
                 break;

packages/arrays/src/ends-with.ts

@@ -24,6 +24,6 @@ export const endsWith = <T>(
     let i = buf.length;
     let j = needle.length;
     if (i < j) return false;
-    while ((--i, --j >= 0 && equiv(buf[i], needle[j]))) {}
+    while ((--i, j-- > 0 && equiv(buf[i], needle[j]))) {}
     return j < 0;
 };

packages/arrays/src/find.ts

@@ -31,7 +31,7 @@ export const findIndex = <T>(
     x: T,
     equiv: Predicate2<T> = _equiv
 ) => {
-    for (let i = buf.length; --i >= 0; ) {
+    for (let i = buf.length; i-- > 0; ) {
         if (equiv(x, buf[i])) return i;
     }
     return -1;

packages/arrays/src/shuffle.ts

@@ -31,7 +31,7 @@ export const shuffleRange = <T extends AnyArray>(
     let n = end - start;
     const l = n;
     if (l > 1) {
-        while (--n >= 0) {
+        while (n-- > 0) {
             const a = (start + rnd.float(l)) | 0;
             const b = (start + rnd.float(l)) | 0;
             const t = buf[a];

packages/arrays/src/swap.ts

@@ -69,7 +69,7 @@ export const multiSwap = (...xs: AnyArray[]): SwapFn => {
         default:
             return (a, x, y) => {
                 swap(a, x, y);
-                for (let i = n; --i >= 0; ) swap(xs[i], x, y);
+                for (let i = n; i-- > 0; ) swap(xs[i], x, y);
             };
     }
 };

packages/arrays/src/swizzle.ts

@@ -49,7 +49,7 @@ export const swizzle = <T>(order: string | PropertyKey[]): Fn<T, any[]> => {
         default:
             return (x: any) => {
                 const res = [];
-                for (let i = order.length; --i >= 0; ) {
+                for (let i = order.length; i-- > 0; ) {
                     res[i] = x[order[i]];
                 }
                 return res;

packages/associative/src/array-set.ts

@@ -104,7 +104,7 @@ export class ArraySet<T> extends Set<T> implements IEquivSet<T> {
 
     delete(key: T) {
         const { equiv, vals } = __private.get(this)!;
-        for (let i = vals.length; --i >= 0; ) {
+        for (let i = vals.length; i-- > 0; ) {
             if (equiv(vals[i], key)) {
                 vals.splice(i, 1);
                 return true;
@@ -131,7 +131,7 @@ export class ArraySet<T> extends Set<T> implements IEquivSet<T> {
      */
     forEach(fn: Fn3<T, T, Set<T>, void>, thisArg?: any) {
         const vals = __vals(this);
-        for (let i = vals.length; --i >= 0; ) {
+        for (let i = vals.length; i-- > 0; ) {
             const v = vals[i];
             fn.call(thisArg, v, v, this);
         }

packages/associative/src/sorted-map.ts

@@ -187,7 +187,7 @@ export class SortedMap<K, V> extends Map<K, V> {
             if (node.next[level] && code === 0) {
                 do {
                     node.next[level].v = v;
-                } while (--level >= 0);
+                } while (level-- > 0);
                 return this;
             }
             stack[level--] = node;

packages/associative/src/sparse-set.ts

@@ -59,7 +59,7 @@ export abstract class ASparseSet<T extends UIntArray>
         }
         const $this = __private.get(this)!;
         const d = $this.dense;
-        for (let i = $this.n; --i >= 0; ) {
+        for (let i = $this.n; i-- > 0; ) {
             if (!o.has(d[i])) {
                 return false;
             }

packages/base-n/src/base.ts

@@ -68,7 +68,7 @@ export class BaseN implements IBase {
         let y = this.decodeBigInt(x);
         const M = BigInt(255);
         const SHIFT = BigInt(8);
-        for (let i = buf.length; --i >= 0; ) {
+        for (let i = buf.length; i-- > 0; ) {
             buf[i] = Number(y & M);
             y >>= SHIFT;
         }

packages/bench/src/benchmark.ts

@@ -21,7 +21,7 @@ export const benchmark = (
     const t = benchResult(fn, warmup * size)[1];
     output && outputString(format!.warmup(t, _opts));
     const samples: number[] = [];
-    for (let i = iter!; --i >= 0; ) {
+    for (let i = iter!; i-- > 0; ) {
         samples.push(benchResult(fn, size)[1]);
     }
     samples.sort((a, b) => a - b);

packages/bencode/src/decode.ts

@@ -155,7 +155,7 @@ const readFloat = (iter: Iterator<number>) => {
 const readBytes = (iter: Iterator<number>, len: number) => {
     let i: IteratorResult<number>;
     let buf: number[] = [];
-    while (--len >= 0 && !(i = iter.next()).done) {
+    while (len-- > 0 && !(i = iter.next()).done) {
         buf.push(i.value);
     }
     return len < 0 ? buf : illegalState(`expected string, reached EOF`);

packages/bitfield/src/util.ts

@@ -24,7 +24,7 @@ export const binOp = (
     src: Uint32Array,
     op: Fn2<number, number, number>
 ) => {
-    for (let i = src.length; --i >= 0; ) dest[i] = op(src[i], dest[i]);
+    for (let i = src.length; i-- > 0; ) dest[i] = op(src[i], dest[i]);
 };
 
 /**

packages/bitstream/src/input.ts

@@ -76,7 +76,7 @@ export class BitInputStream {
 
     readWords(n: number, wordSize = 8) {
         let out = [];
-        while (--n >= 0) {
+        while (n-- > 0) {
             out.push(this.read(wordSize));
         }
         return out;

packages/color/src/color-range.ts

@@ -189,7 +189,7 @@ export function* colorsFromRange(
     opts: Partial<ColorRangeOpts> = {}
 ) {
     let num = opts.num != undefined ? opts.num : Infinity;
-    while (--num >= 0) yield colorFromRange(range, opts);
+    while (num-- > 0) yield colorFromRange(range, opts);
 }
 
 /** @internal */

packages/compose/src/juxt.ts

@@ -80,7 +80,7 @@ export function juxt<T>(...fns: Fn<any, any>[]) {
         default:
             return (x: T) => {
                 let res = new Array(fns.length);
-                for (let i = fns.length; --i >= 0; ) {
+                for (let i = fns.length; i-- > 0; ) {
                     res[i] = fns[i](x);
                 }
                 return res;

packages/diff/src/array.ts

@@ -198,7 +198,7 @@ const buildFullLog = <T>(
         aID = 1;
         dID = -1;
     }
-    for (; --i >= 0; ) {
+    for (; i-- > 0; ) {
         const e = epc[i];
         const ppx = pathPos[e];
         const ppy = pathPos[e + 1];
@@ -235,7 +235,7 @@ const buildLinearLog = <T>(
     let i = epc.length,
         px = 0,
         py = 0;
-    for (; --i >= 0; ) {
+    for (; i-- > 0; ) {
         const e = epc[i];
         const ppx = pathPos[e];
         const ppy = pathPos[e + 1];

packages/dsp/src/delay.ts

@@ -50,7 +50,7 @@ export class Delay<T> extends AProc<T, T> implements IClear, ILength, IReset {
     clear() {
         const { _buf, _empty } = this;
         if (isFunction(_empty)) {
-            for (let i = _buf.length; --i >= 0; ) {
+            for (let i = _buf.length; i-- > 0; ) {
                 this._buf[i] = _empty();
             }
         } else {
@@ -92,7 +92,7 @@ export class Delay<T> extends AProc<T, T> implements IClear, ILength, IReset {
      * returns it.
      */
     multiTap(t: ArrayLike<number>, out: T[] = []) {
-        for (let i = t.length; --i >= 0; ) {
+        for (let i = t.length; i-- > 0; ) {
             out[i] = this.tap(t[i]);
         }
         return out;

packages/dsp/src/fft.ts

@@ -152,7 +152,7 @@ const transform = (real: NumericArray, img: NumericArray, n: number) => {
     let ur: number, ui: number;
     let wr: number, wi: number;
     let t: number;
-    for (let b = Math.ceil(Math.log2(n)); --b >= 0; ) {
+    for (let b = Math.ceil(Math.log2(n)); b-- > 0; ) {
         prevStep = step;
         step <<= 1;
         ur = 1;

packages/dsp/src/filter-response.ts

@@ -47,7 +47,7 @@ export const freqRange: FnU3<number, number[]> = (fstart, fend, num) =>
 const convolve = (coeffs: NumericArray, w0: number) => {
     let c = 0;
     let s = 0;
-    for (let i = coeffs.length; --i >= 0; ) {
+    for (let i = coeffs.length; i-- > 0; ) {
         const k = cossin(w0 * i, coeffs[i]);
         c += k[0];
         s += k[1];

packages/dsp/src/internal/take.ts

@@ -6,7 +6,7 @@ export const __take = <T>(
     out: T[] = [],
     idx = 0
 ) => {
-    for (; --num >= 0; ) {
+    for (; num-- > 0; ) {
         out[idx++] = src.next();
     }
     return out;

packages/dsp/src/power.ts

@@ -10,7 +10,7 @@ import { isComplex } from "./complex.js";
  */
 export const integralT = (window: NumericArray) => {
     let sum = 0;
-    for (let i = window.length; --i >= 0; ) {
+    for (let i = window.length; i-- > 0; ) {
         sum += window[i];
     }
     return sum;
@@ -23,7 +23,7 @@ export const integralT = (window: NumericArray) => {
  */
 export const integralTSquared = (window: NumericArray) => {
     let sum = 0;
-    for (let i = window.length; --i >= 0; ) {
+    for (let i = window.length; i-- > 0; ) {
         sum += window[i] ** 2;
     }
     return sum;
@@ -36,7 +36,7 @@ export const integralTSquared = (window: NumericArray) => {
  */
 export const integralF = ([real, img]: ComplexArray) => {
     let sum = 0;
-    for (let i = real.length; --i >= 0; ) {
+    for (let i = real.length; i-- > 0; ) {
         sum += Math.hypot(real[i], img[i]);
     }
     return sum;
@@ -49,7 +49,7 @@ export const integralF = ([real, img]: ComplexArray) => {
  */
 export const integralFSquared = ([real, img]: ComplexArray) => {
     let sum = 0;
-    for (let i = real.length; --i >= 0; ) {
+    for (let i = real.length; i-- > 0; ) {
         sum += real[i] ** 2 + img[i] ** 2;
     }
     return sum;

packages/dsp/src/window.ts

@@ -40,7 +40,7 @@ export const applyWindow = (
     window: NumericArray,
     out = signal
 ) => {
-    for (let i = signal.length; --i >= 0; ) {
+    for (let i = signal.length; i-- > 0; ) {
         out[i] = signal[i] * window[i];
     }
     return out;