Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion quest/m3/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -33,5 +33,5 @@ generic std gap is planned here even when moq never calls it.
- [Cow of a slice, and Wrapping](/quest/m3/ts-cow-slices.md) - `Cow<[T]>` and `Wrapping<T>` translate, `PartialEq` included
- [LinkedList](/quest/m3/ts-linked-list.md) - `LinkedList` and its methods translate
- [Zip's next_back in constant time](/quest/m3/ts-zip-back.md) - a reversed zip of random-access iterators skips the longer side's excess at once
- [Unbounded ranges as iterators adaptors take](/quest/m3/ts-range-from-iter.md) - `iter.zip(0..)` and other adaptors taking a `start..` type-check
- [Cloning std's iterators](/quest/m3/ts-iter-clone.md) - `clone` of std's iterators and adaptors translates, each clone reading on independently
- [Comparing iterators](/quest/m3/ts-iter-compare.md) - `eq`, `cmp`, `lt`, and the rest of `Iterator`'s comparisons translate against any `IntoIterator`
5 changes: 3 additions & 2 deletions quest/m3/ts-iter-clone.md
Original file line number Diff line number Diff line change
Expand Up @@ -3,8 +3,9 @@
## Goal

[rust2-ts](/ts/README.md) translates `clone` of std's iterators and adaptors, such as a
`zip`, a `map`, a `chars`, and a set operation's iterator, the clone reading on from where
the original was, independently of it, proven by differential tests against native Rust.
`zip`, a `map`, a `chars`, a `start..`, and a set operation's iterator, the clone reading
on from where the original was, independently of it, proven by differential tests against
native Rust.

## Plan

Expand Down
20 changes: 20 additions & 0 deletions quest/m3/ts-iter-compare.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
# [S] Comparing iterators

## Goal

[rust2-ts](/ts/README.md) translates `Iterator::eq`, `ne`, `lt`, `le`, `gt`, `ge`, `cmp`,
and `partial_cmp`, and their `_by` forms, against any `IntoIterator`, ranges included,
reading each side as far as std's does, proven by differential tests against native Rust.

## Plan

Found while auditing what takes a `start..` as its `IntoIterator`: each refuses today
whatever the iterators are. Planned without a moq consumer, under the maintainer's
2026-10-27 decision that rust2 aims to support all of std.

- std's `eq` of two `TrustedLen` iterators decides by their size hints before reading
any item where they differ; test it beside a pair that is not both `TrustedLen`.
- Test where a side ends first, where one never ends, and where comparing an item
panics, as stepping a `start..` past its type's maximum does.

Public API: the translator's output.
16 changes: 0 additions & 16 deletions quest/m3/ts-range-from-iter.md

This file was deleted.

5 changes: 5 additions & 0 deletions ts/MIGRATE.md
Original file line number Diff line number Diff line change
Expand Up @@ -2,6 +2,11 @@

## Unreleased

- A `start..` is an `rt.RangeFrom`, an iterator as `rt.Range` is, rather than
`{ start }`: a caller passes one as `new rt.RangeFrom(start, rt.u64Step)`, with its
integer type's `Step`, or `rt.charStep`, and none for other types. A binding taking one
still reads its `start`. An `rt.Range` or `rt.RangeInclusive` of `char`s takes
`rt.charStep` too, to step past the surrogates.
- A closure, a `fn` pointer, a `dyn Fn`, or a function item as a value returns
`undefined` for `()`, not `void`, as in `(a0: rt.u8) => undefined`: a caller passes such
a parameter a function typed `=> undefined`.
Expand Down
4 changes: 2 additions & 2 deletions ts/fixtures/bind/expected/harness.ts
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@ export function run(input: rt.ByteSlice): rt.ByteVec {
const bytes: Blob.Blob = Blob.copyFromSlice(input);
const mid: rt.usize = rt.usizeDiv(Blob.len(bytes), 2);
const head: Blob.Blob = Blob.slice(bytes, { end: mid });
const tail: Blob.Blob = Blob.slice(bytes, { start: mid });
const tail: Blob.Blob = Blob.slice(bytes, new rt.RangeFrom(mid, rt.usizeStep));
const _16: rt.Range<rt.usize> = new rt.Range(rt.min(1, mid), mid);
const inner: Blob.Blob = Blob.slice(bytes, _16);
const _20: rt.u8 = Blob.len(head) & 0xff;
Expand Down Expand Up @@ -110,7 +110,7 @@ export function keys(input: rt.ByteSlice, bytes: Blob.Blob, out: rt.ByteVec): vo
rt.byteVecPush(out, unwrapOr$0r2bmpr(rt.hashGet(counts, probe), 0));
rt.byteVecPush(out, rt.btreeContains(sorted, probe) ? 1 : 0);
rt.byteVecPush(out, unwrapOr$0r2bmpr(rt.btreeGet(firsts, probe), 255));
const _81: { start: Blob.Blob } = { start: Blob.clone$Clone(probe) };
const _81: rt.RangeFrom<Blob.Blob> = new rt.RangeFrom(Blob.clone$Clone(probe));
rt.byteVecPush(out, rt.iterCount(rt.btreeRangeKeys(sorted, _81, Blob.eq$PartialEq, rt.cmpGt(Blob.partialCmp$PartialOrd))) & 0xff);
const iter2: rt.Iter<[Blob.Blob, rt.u8]> = rt.btreeIter(firsts);
while (true) {
Expand Down
15 changes: 14 additions & 1 deletion ts/fixtures/lang/caller.ts
Original file line number Diff line number Diff line change
Expand Up @@ -558,4 +558,17 @@ const unlikeEqs = [[], [5], [1, 2], [0, 7, 2, 9], [3, 3, 3, 3, 3, 3, 3, 3, 3]].f
const ownNesOp = op("collections::own_nes");
const ownNes = unlikeEqs.map((input) => Uint8Array.of(ownNesOp, ...input.subarray(1)));

export const cases: Uint8Array[] = [...loops, ...durations, ...ints(), ...utf8, ...floats, ...formats, ...parsed, ...singlesCases, ...singlesFormats, ...singlesParsed, ...dyns, ...cells, ...shared, ...locks, ...onces, ...bounds, ...unsafeCells, ...edits, ...subslices, ...consumers, ...closures, ...elements, ...ranges, ...reducers, ...sliceEdits, ...drains, ...iters, ...hinted, ...peekedOthers, ...hints, ...reserves, ...setOps, ...zeros, ...floatsMulAdds, ...singlesMulAdds, ...unlikeEqs, ...ownNes];
/**
* `iters::range_froms` of each case, each way its zips read the range, from each distance
* below its type's last value and from 250, on up to nine bytes: each length its zips
* panic at.
*/
const rangeFromsOp = op("iters::range_froms");
const rangeFroms = Array.from({ length: 16 * 4 * 4 * 10 }, (_, i) => {
const kind = (i % 16) | ((Math.floor(i / 16) % 4) << 6);
const a = [0, 1, 3, 250][Math.floor(i / 64) % 4];
const data = Array.from({ length: Math.floor(i / 256) }, (_, j) => (j === 0 ? a : (j * 37) & 0xff));
return Uint8Array.of(rangeFromsOp, kind, ...data);
});

export const cases: Uint8Array[] = [...loops, ...durations, ...ints(), ...utf8, ...floats, ...formats, ...parsed, ...singlesCases, ...singlesFormats, ...singlesParsed, ...dyns, ...cells, ...shared, ...locks, ...onces, ...bounds, ...unsafeCells, ...edits, ...subslices, ...consumers, ...closures, ...elements, ...ranges, ...reducers, ...sliceEdits, ...drains, ...iters, ...hinted, ...peekedOthers, ...hints, ...reserves, ...setOps, ...zeros, ...floatsMulAdds, ...singlesMulAdds, ...unlikeEqs, ...ownNes, ...rangeFroms];
10 changes: 5 additions & 5 deletions ts/fixtures/lang/expected/collections.ts
Original file line number Diff line number Diff line change
Expand Up @@ -685,7 +685,7 @@ export function btreeMaps(kind: rt.u8, data: rt.ByteSlice, out: rt.ByteVec): voi
rt.byteVecPush(out, _73[0]);
rt.byteVecPush(out, _73[1]);
}
const iter3: rt.Iter<[rt.u8, rt.u8]> = rt.iterRev(rt.btreeRange(map, { start: 10 }));
const iter3: rt.Iter<[rt.u8, rt.u8]> = rt.iterRev(rt.btreeRange(map, new rt.RangeFrom(10, rt.u8Step)));
while (true) {
const _88: [rt.u8, rt.u8] | rt.Done = iter3.next();
if (_88 === rt.DONE) {
Expand All @@ -711,7 +711,7 @@ export function btreeMaps(kind: rt.u8, data: rt.ByteSlice, out: rt.ByteVec): voi
rt.byteVecPush(out, mapOr$0mmpeqx(rt.iterToOption(rt.btreeIter(map).next()), 255, (_229: [rt.u8, rt.u8]): rt.u8 => {
return _229[0] ^ _229[1];
}));
rt.byteVecPush(out, mapOr$0mmpeqx(rt.iterToOption(rt.btreeRange(map, { start: 4 }).nextBack()), 255, (_230: [rt.u8, rt.u8]): rt.u8 => {
rt.byteVecPush(out, mapOr$0mmpeqx(rt.iterToOption(rt.btreeRange(map, new rt.RangeFrom(4, rt.u8Step)).nextBack()), 255, (_230: [rt.u8, rt.u8]): rt.u8 => {
return _230[0] ^ _230[1];
}));
rt.byteVecPush(out, mapOr$1surhce(rt.iterMax(rt.btreeValues(map), rt.lt), 255, (v6: rt.u8): rt.u8 => {
Expand All @@ -733,7 +733,7 @@ export function btreeMaps(kind: rt.u8, data: rt.ByteSlice, out: rt.ByteVec): voi
return _235[0];
}), "next");
} else {
within = rt.iterToByteVec(rt.iterMap(rt.btreeRange(map, { start: lo }), (_234: [rt.u8, rt.u8]): rt.u8 => {
within = rt.iterToByteVec(rt.iterMap(rt.btreeRange(map, new rt.RangeFrom(lo, rt.u8Step)), (_234: [rt.u8, rt.u8]): rt.u8 => {
return _234[0];
}), "next");
}
Expand Down Expand Up @@ -797,7 +797,7 @@ export function btreeMaps(kind: rt.u8, data: rt.ByteSlice, out: rt.ByteVec): voi
rt.byteVecPush(out, rt.u8Shl(_276[0][0], 4) | _276[0][1]);
rt.byteVecPush(out, _276[1]);
}
const _290: { start: rt.u64 } = { start: 4503599627370496 };
const _290: rt.RangeFrom<rt.u64> = new rt.RangeFrom(4503599627370496, rt.u64Step);
const iter9: rt.Iter<[rt.u64, rt.u8]> = rt.btreeRange(wides, _290);
while (true) {
const _295: [rt.u64, rt.u8] | rt.Done = iter9.next();
Expand Down Expand Up @@ -1032,7 +1032,7 @@ export function deques(data: rt.ByteSlice, out: rt.ByteVec): void {
} else if (_201 === 2) {
drained2 = rt.iterToByteVec(rt.dequeDrain(q2, { end: b2 }), "next");
} else {
drained2 = rt.iterToByteVec(rt.dequeDrain(q2, { start: a }), "next");
drained2 = rt.iterToByteVec(rt.dequeDrain(q2, new rt.RangeFrom(a, rt.usizeStep)), "next");
}
rt.byteVecExtendFromSlice(out, rt.byteVecSlice(drained2));
rt.iterExtendBytes(out, rt.dequeIter(q2), undefined, true);
Expand Down
7 changes: 7 additions & 0 deletions ts/fixtures/lang/expected/core/option.ts
Original file line number Diff line number Diff line change
Expand Up @@ -870,6 +870,13 @@ export function mapOr$0atjiti(self: rt.char | undefined, default_: rt.u32, _: (a
return self as rt.u32;
}

export function mapOr$0okqj9y(self: rt.char | undefined, default_: rt.u8, f: (a0: rt.char) => rt.u8): rt.u8 {
if (self === undefined) {
return default_;
}
return f(self);
}

export function mapOr$141aobk(self: rt.char[] | undefined, default_: rt.u8, f: (a0: rt.char[]) => rt.u8): rt.u8 {
if (self === undefined) {
return default_;
Expand Down
14 changes: 7 additions & 7 deletions ts/fixtures/lang/expected/fmt.ts
Original file line number Diff line number Diff line change
Expand Up @@ -616,14 +616,14 @@ export function wrapped(data: rt.ByteSlice, out: rt.ByteVec): void {
const w: rt.usize = rt.u8Rem(at(2), 10) as rt.usize;
const _33: rt.Range<rt.i32> = new rt.Range(a, b);
const _35: rt.RangeInclusive<rt.i32> = new rt.RangeInclusive(a, b, rt.i32Step);
const _37: { start: rt.i32 } = { start: a };
const _37: rt.RangeFrom<rt.i32> = new rt.RangeFrom(a, rt.i32Step);
const _39: { end: rt.i32 } = { end: b };
const _41: { end: rt.i32; inclusive: true } = { end: b, inclusive: true };
const args2: rt.Fmt[] = [(f: rt.Formatter) => rt.fmtRange(_33, f, rt.i32Debug), (f: rt.Formatter) => rt.fmtRangeInclusive(_35, f, rt.i32Debug), (f: rt.Formatter) => rt.fmtRangeFrom(_37, f, rt.i32Debug), (f: rt.Formatter) => rt.fmtRangeTo(_39, f, rt.i32Debug), (f: rt.Formatter) => rt.fmtRangeToInclusive(_41, f, rt.i32Debug), (f: rt.Formatter) => rt.fmtRangeFull(undefined, f)];
put(out, rt.fmtFormat([args2[0], " ", args2[1], " ", args2[2], " ", args2[3], " ", args2[4], " ", args2[5]]));
const _60: rt.Range<rt.i32> = new rt.Range(a, b);
const _62: rt.RangeInclusive<rt.i32> = new rt.RangeInclusive(a, b, rt.i32Step);
const _64: { start: rt.i32 } = { start: a };
const _64: rt.RangeFrom<rt.i32> = new rt.RangeFrom(a, rt.i32Step);
const _66: { end: rt.i32 } = { end: b };
const _68: { end: rt.i32; inclusive: true } = { end: b, inclusive: true };
const _70: rt.Range<rt.i32> = new rt.Range(a, b);
Expand All @@ -646,7 +646,7 @@ export function wrapped(data: rt.ByteSlice, out: rt.ByteVec): void {
const _127: rt.Range<Clip.Clip> = new rt.Range(lo, hi);
const _129: rt.RangeInclusive<Clip.Clip> = new rt.RangeInclusive(lo, hi);
const _131: { end: Clip.Clip } = { end: hi };
const _133: { start: Clip.Clip } = { start: lo };
const _133: rt.RangeFrom<Clip.Clip> = new rt.RangeFrom(lo);
const _135: { end: Clip.Clip; inclusive: true } = { end: lo, inclusive: true };
const args6: rt.Fmt[] = [(f: rt.Formatter) => rt.fmtRange(_127, f, (value: Clip.Clip, f: rt.Formatter) => Clip.fmt$Debug(value, f)), (f: rt.Formatter) => rt.fmtRangeInclusive(_129, f, (value: Clip.Clip, f: rt.Formatter) => Clip.fmt$Debug(value, f)), (f: rt.Formatter) => rt.fmtRangeTo(_131, f, (value: Clip.Clip, f: rt.Formatter) => Clip.fmt$Debug(value, f)), (f: rt.Formatter) => rt.fmtRangeFrom(_133, f, (value: Clip.Clip, f: rt.Formatter) => Clip.fmt$Debug(value, f)), rt.fmtCount(w), (f: rt.Formatter) => rt.fmtRangeToInclusive(_135, f, (value: Clip.Clip, f: rt.Formatter) => Clip.fmt$Debug(value, f))];
put(out, rt.fmtFormat([args6[0], "|", rt.fmtSpec({ width: 8, precision: 2 }, args6[1]), "|", rt.fmtSpec({ alternate: true }, args6[2]), "|", rt.fmtSpec({ fill: "_", align: ">", width: rt.fmtCountOf(args6[4]), precision: 1 }, args6[3]), "|", rt.fmtSpec({ alternate: true, width: 4 }, args6[5])]));
Expand Down Expand Up @@ -837,7 +837,7 @@ export function iters(data: rt.ByteSlice, out: rt.ByteVec): void {
put(out, rt.fmtFormat([rt.fmtSpec({ debugHex: "x" }, args8[0])]));
const it4: rt.Iter<Hex.Hex> = ends$Drain_Hex(rt.vecDrain(rt.iterToArray(rt.iterMap(rt.iterTake(rt.iterSlice(rt.byteSliceView(data)), 5), (_23: rt.u8): Hex.Hex => {
return { _0: rt.u32Mul(_23 as rt.u32, 257) };
}), undefined, 4, true), { start: 1 }), front, back);
}), undefined, 4, true), new rt.RangeFrom(1, rt.usizeStep)), front, back);
const args10: rt.Fmt[] = [(f: rt.Formatter) => rt.fmtIter(it4, f, (value: Hex.Hex, f: rt.Formatter) => Hex.fmt$Debug(value, f), ["Drain"])];
put(out, rt.fmtFormat([args10[0], "|", rt.fmtSpec({ alternate: true, debugHex: "x" }, args10[0])]));
rt.drop(it4);
Expand Down Expand Up @@ -913,7 +913,7 @@ export function iters(data: rt.ByteSlice, out: rt.ByteVec): void {
const args36: rt.Fmt[] = [(f: rt.Formatter) => rt.fmtIter(_335, f, rt.u8Debug), (f: rt.Formatter) => rt.fmtIter(_339, f, (value: rt.u8 | undefined, f: rt.Formatter) => rt.fmtOption(value, f, rt.u8Debug))];
put(out, rt.fmtFormat([args36[0], "|", args36[1]]));
const lo: rt.u8 = rt.u8Rem(at(2), 16);
const _360: rt.Iter<[rt.u8, rt.u8 | undefined]> = ends$Range_u8_Option_u8(rt.btreeRange(map, { start: lo }), front, back);
const _360: rt.Iter<[rt.u8, rt.u8 | undefined]> = ends$Range_u8_Option_u8(rt.btreeRange(map, new rt.RangeFrom(lo, rt.u8Step)), front, back);
const _365: rt.Iter<[rt.u8, rt.u8 | undefined]> = ends$Range_u8_Option_u8(rt.btreeRange(map, { end: lo, inclusive: true }), front, back);
const args38: rt.Fmt[] = [(f: rt.Formatter) => rt.fmtIter(_360, f, (value: [rt.u8, rt.u8 | undefined], f: rt.Formatter) => rt.fmtTuple([(f: rt.Formatter) => rt.u8Debug(value[0], f), (f: rt.Formatter) => rt.fmtOption(value[1], f, rt.u8Debug)], f)), (f: rt.Formatter) => rt.fmtIter(_365, f, (value: [rt.u8, rt.u8 | undefined], f: rt.Formatter) => rt.fmtTuple([(f: rt.Formatter) => rt.u8Debug(value[0], f), (f: rt.Formatter) => rt.fmtOption(value[1], f, rt.u8Debug)], f))];
put(out, rt.fmtFormat([args38[0], "|", args38[1]]));
Expand All @@ -923,7 +923,7 @@ export function iters(data: rt.ByteSlice, out: rt.ByteVec): void {
const part14 = ends$ValuesMut_u8_Option_u8(rt.btreeValuesMut(map), front, back);
const args42: rt.Fmt[] = [(f: rt.Formatter) => rt.fmtIter(part14, f, (value: rt.u8 | undefined, f: rt.Formatter) => rt.fmtOption(value, f, rt.u8Debug))];
put(out, rt.fmtFormat([args42[0]]));
const part15 = ends$RangeMut_u8_Option_u8(rt.btreeRangeMut(map, { start: lo }), front, back);
const part15 = ends$RangeMut_u8_Option_u8(rt.btreeRangeMut(map, new rt.RangeFrom(lo, rt.u8Step)), front, back);
const args44: rt.Fmt[] = [(f: rt.Formatter) => rt.fmtIter(part15, f, (value: [rt.u8, rt.u8 | undefined], f: rt.Formatter) => rt.fmtTuple([(f: rt.Formatter) => rt.u8Debug(value[0], f), (f: rt.Formatter) => rt.fmtOption(value[1], f, rt.u8Debug)], f))];
put(out, rt.fmtFormat([args44[0]]));
const part16 = ends$IntoIter_u8_Option_u8(rt.btreeIter(rt.btreeClone(map, undefined, undefined)), front, back);
Expand Down Expand Up @@ -957,7 +957,7 @@ export function iters(data: rt.ByteSlice, out: rt.ByteVec): void {
const part19 = ends$Iter_u8$2(rt.btreeKeys(set), front, back);
const args54: rt.Fmt[] = [(f: rt.Formatter) => rt.fmtIter(part19, f, rt.u8Debug, ["Iter"])];
put(out, rt.fmtFormat([args54[0], "|", rt.fmtSpec({ alternate: true }, args54[0])]));
const part20 = ends$Range_u8(rt.btreeRangeKeys(set, { start: lo }), front, back);
const part20 = ends$Range_u8(rt.btreeRangeKeys(set, new rt.RangeFrom(lo, rt.u8Step)), front, back);
const args56: rt.Fmt[] = [(f: rt.Formatter) => rt.fmtIter(part20, f, rt.fmtSetVal(rt.u8Debug), [["Range", "iter"]])];
put(out, rt.fmtFormat([args56[0], "|", rt.fmtSpec({ alternate: true }, args56[0]), "|", rt.fmtSpec({ debugHex: "x" }, args56[0])]));
const part21 = ends$IntoIter_u8$2(rt.btreeKeys(set), front, back);
Expand Down
4 changes: 2 additions & 2 deletions ts/fixtures/lang/expected/harness.ts
Original file line number Diff line number Diff line change
Expand Up @@ -26,7 +26,7 @@ import { values, random, bytes as hashes_bytes } from "./hashes.ts";
import { hints, reserves } from "./hints.ts";
import { holds } from "./holds.ts";
import { u8Op, u16Op, u32Op, u64Op, u128Op, usizeOp, i8Op, i16Op, i32Op, i64Op, i128Op, isizeOp, i8Neg, i16Neg, i32Neg, i64Neg, i128Neg, isizeNeg, cast as ints_cast, convert, parses as ints_parses, widenings } from "./ints.ts";
import { adaptors, consumers, reducers, peekedOthers, skips, ranked, ranges, options, own, values as iters_values, returned, zips, zipsBack } from "./iters.ts";
import { adaptors, consumers, reducers, peekedOthers, skips, ranked, ranges, options, own, values as iters_values, returned, zips, zipsBack, rangeFroms } from "./iters.ts";
import { keys, overrides, bytes as keys_bytes, lentKeys, lentValues, arrays } from "./keys.ts";
import { locals } from "./locals.ts";
import { locks, relock, rwlocks } from "./locks.ts";
Expand Down Expand Up @@ -196,7 +196,7 @@ export function cases(): [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec)
collections(data71, out72);
}] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["collections::unlike_eqs", unlikeEqs as (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["zeros::impls", impls as (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["zeros::keys", zeros_keys as (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["keys::arrays", arrays as (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["iters::zips", zips as (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["iters::zips_back", zipsBack as (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["collections::own_nes", ownNes as (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["fmt::iters", (_2172: rt.u8, data72: rt.ByteSlice, out73: rt.ByteVec): undefined => {
iters(data72, out73);
}] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["zeros::unread", unread as (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined]];
}] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["zeros::unread", unread as (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined], ["iters::range_froms", rangeFroms as (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined] as [string, (a0: rt.u8, a1: rt.ByteSlice, a2: rt.ByteVec) => undefined]];
}

/** Run one case. */
Expand Down
Loading