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
1 change: 0 additions & 1 deletion quest/m2/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -33,7 +33,6 @@ The fork's feature quests folded into the [exporter](/quest/m1/ffi-export.md);
- [Drop in the TypeScript translator](/quest/m2/ts-drop.md) - every value that drops in moq-net and kio drops where Rust drops it
- [Async in the TypeScript translator](/quest/m2/ts-async.md) - moq-net's and kio's async code translates with Rust's lazy futures
- [Shared ownership](/quest/m2/ts-shared.md) - `Arc`/`Rc`/`Weak` keep exact counts, and locks and atomics become plain values
- [Copy what a container stores](/quest/m2/ts-store-alias.md) - `push` and other stores of a `Copy` aggregate copy it instead of sharing it
- [Share a held-back read across a call](/quest/m2/ts-shared-read.md) - `leading-ones` decode recovers what #83's copy fix cost
- [Output tsc accepts for writes through Result and Poll compares](/quest/m2/ts-tsc-shapes.md) - two shapes whose output fails `tsc` type-check
- [Translate moq-net's model to TypeScript](/quest/m2/ts-model.md) - the driver grows from moq-net's codec to its model, for moq to compare against WASM
Expand Down
23 changes: 0 additions & 23 deletions quest/m2/ts-store-alias.md

This file was deleted.

5 changes: 3 additions & 2 deletions ts/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -338,8 +338,9 @@ built natively for wasm32 and run beside its translation on the same inputs by
Bun bundles a caller of `Decoder.u8` and `Decoder.new` through `import * as Decoder`,
which must keep only those and what they call.
- `lang` covers every integer width's arithmetic and casts, `char`s next to each
encoding's edges and the surrogates, control flow, patterns, `Copy` aggregates,
formatting, methods on generic types, iterators, with closures that log what each
encoding's edges and the surrogates, control flow, patterns, `Copy` aggregates, those
a container stores included, formatting, methods on generic types, iterators, with
closures that log what each
adaptor reads, and std's collections, over keys whose own `Hash`, `Eq`, and `Ord`
disagree with JS's, and `vec![x; n]` of types whose `Clone` counts its clones. Its differential test runs through `caller.ts`, a
hand-written caller that also prints a `printable` error nothing translated prints,
Expand Down
2 changes: 1 addition & 1 deletion ts/fixtures/codec/expected/coding/decode.Decoder.ts
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@ export interface Decoder {

/** Read `buf`, with varints in the given form. */
function new_(buf: Uint8Array, form: Form.Form): Decoder {
return { buf, form, len: buf.length, need: 0, control: undefined, uncounted: 0 };
return { buf, form: copy$Form(form), len: buf.length, need: 0, control: undefined, uncounted: 0 };
}

/**
Expand Down
3 changes: 2 additions & 1 deletion ts/fixtures/codec/expected/coding/encode.Encoder.ts
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
// Generated by rust2-ts. Do not edit.

import * as rt from "../rt.ts";
import { copy$Form } from "../lib.ts";
import * as EncodeError from "../coding/encode.EncodeError.ts";
import type * as Prefix from "../coding/encode.Prefix.ts";
import type * as PrefixKind from "../coding/encode.PrefixKind.ts";
Expand All @@ -22,7 +23,7 @@ export interface Encoder {

/** Append to `buf`, with varints in the given form. */
function new_(buf: rt.ByteVec, form: Form.Form): Encoder {
return { buf, form, control: undefined };
return { buf, form: copy$Form(form), control: undefined };
}

/** Write raw bytes. */
Expand Down
5 changes: 3 additions & 2 deletions ts/fixtures/codec/expected/coding/version.Versions.ts
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,8 @@ export function decodeSlice$Decode_Form(buf: Uint8Array, version: Form.Form): rt
const _6: rt.Result<Versions, DecodeError.DecodeError> = decode$Decode_Form(r, version);
if (_6.ok) {
const val: Versions = _6.value;
const _0: rt.Result<[Versions, rt.usize], DecodeError.DecodeError> = rt.Ok([val, rt.usizeSub(buf.length, Decoder.remaining(r))]);
const value: Versions = val;
const _0: rt.Result<[Versions, rt.usize], DecodeError.DecodeError> = rt.Ok([value, rt.usizeSub(buf.length, Decoder.remaining(r))]);
return _0;
}
return _6;
Expand All @@ -41,7 +42,7 @@ export function decode$Decode_Form(r: Decoder.Decoder, version: Form.Form): rt.R
}
const _15: rt.Result<Version.Version, DecodeError.DecodeError> = Version.decode$Decode_Form(r, version);
if (_15.ok) {
vs.push(_15.value);
vs.push(copy$Version(_15.value));
} else {
return _15;
}
Expand Down
10 changes: 10 additions & 0 deletions ts/fixtures/lang/expected/collections.Holder.ts
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
// Generated by rust2-ts. Do not edit.

import * as rt from "./rt.ts";

/** A struct that is not `Copy` holding a `Copy` aggregate by value. */
export interface Holder {
pair: [rt.u8, rt.u8];
}

//# sourceMappingURL=collections.Holder.ts.map
161 changes: 146 additions & 15 deletions ts/fixtures/lang/expected/collections.ts
Original file line number Diff line number Diff line change
@@ -1,11 +1,12 @@
// Generated by rust2-ts. Do not edit.

import * as rt from "./rt.ts";
import { copy$Bumped, copy$Clash, copy$Rank, copy$Tally, copy$u8_Tally, copy$u8_u16, copy$u8_u8 } from "./lib.ts";
import { copy$Bumped, copy$Clash, copy$Pair, copy$Rank, copy$Tally, copy$u8_Tally, copy$u8_str, copy$u8_u16, copy$u8_u16s, copy$u8_u8, copy$u8_u8s } from "./lib.ts";
import * as Clash from "./collections.Clash.ts";
import * as Cloned from "./collections.Cloned.ts";
import * as Dir from "./collections.Dir.ts";
import * as Fussy from "./collections.Fussy.ts";
import type * as Holder from "./collections.Holder.ts";
import * as Nibble from "./collections.Nibble.ts";
import * as Pair from "./collections.Pair.ts";
import * as Rank from "./collections.Rank.ts";
Expand Down Expand Up @@ -162,14 +163,14 @@ export function hashMaps(kind: rt.u8, data: Uint8Array, out: rt.ByteVec): void {
const b3: rt.u8 = _167[1];
rt.byteVecPush(out, rt.optionUnwrapOr(rt.hashInsert(map3, { _0: a }, b3), 204));
const pair: Pair.Pair = { a: rt.u8Rem(a, 4), b: rt.u16Rem(b3 as rt.u16, 3) };
const t: Tally.Tally = rt.entryOrInsertWith(rt.entry(pairs, pair), Tally.default$Default);
const t: Tally.Tally = rt.entryOrInsertWith(rt.entry(pairs, copy$Pair(pair)), Tally.default$Default);
t.n = rt.u16Add(t.n, 1);
const r: Rank.Rank = rank(a, b3);
const _192: Tally.Tally | undefined = rt.hashGet(ranks, r);
if (_192 !== undefined) {
_192.n = rt.u16Add(_192.n, 1);
} else {
rt.hashInsert(ranks, r, { n: i3 & 0xffff });
rt.hashInsert(ranks, copy$Rank(r), { n: i3 & 0xffff });
}
const _203: rt.u8 = rt.u8Rem(a, 3);
const _207: rt.usize = rt.usizeRem(b3 as rt.usize, ["", "a", "ab", "b", "é", "", "￿", "𐀀"].length);
Expand All @@ -179,7 +180,7 @@ export function hashMaps(kind: rt.u8, data: Uint8Array, out: rt.ByteVec): void {
const t2: [rt.u8, string] = [_203, ["", "a", "ab", "b", "é", "", "￿", "𐀀"][_207]];
rt.byteVecPush(out, rt.optionUnwrapOr(rt.hashRemove(tuples, t2), 187));
if (rt.u8Rem(a, 2) === 0) {
rt.hashInsert(tuples, t2, a);
rt.hashInsert(tuples, copy$u8_str(t2), a);
}
}
const _225: rt.Iter<[rt.u8, rt.u8]> = rt.iterMap(rt.hashIter(map3), (_214: [Nibble.Nibble, rt.u8]): [rt.u8, rt.u8] => {
Expand All @@ -198,7 +199,8 @@ export function hashMaps(kind: rt.u8, data: Uint8Array, out: rt.ByteVec): void {
}
const key: Pair.Pair = { a: 9, b: 9 };
const local: Tally.Tally = { n: 7 };
rt.hashInsert(pairs, key, copy$Tally(local));
const _241: Tally.Tally = copy$Tally(local);
rt.hashInsert(pairs, copy$Pair(key), _241);
local.n = 8;
const before: Tally.Tally = copy$Tally(rt.hashIndex(pairs, key));
const _246: Tally.Tally | undefined = rt.hashGet(pairs, key);
Expand Down Expand Up @@ -232,15 +234,15 @@ export function hashMaps(kind: rt.u8, data: Uint8Array, out: rt.ByteVec): void {
const _292: [rt.u8, rt.u8] = [_293, data[i4]];
const a2: rt.u8 = _293;
const b4: rt.u8 = _292[1];
const _305: Rank.Rank = rank(b4, a2);
const _305: Rank.Rank = copy$Rank(rank(b4, a2));
const t4: Tally.Tally = rt.entryOrInsertWith(rt.entryAndModify(rt.entry(ranks, _305), (t9: Tally.Tally): void => {
t9.n = t9.n ^ 3;
}), (): Tally.Tally => {
return { n: b4 as rt.u16 };
});
t4.n = rt.u16WrappingAdd(t4.n, t4.n);
rt.idx(data, i4);
const _313: Rank.Rank = rank(data[i4], 0);
const _313: Rank.Rank = copy$Rank(rank(data[i4], 0));
const e: rt.Entry<Rank.Rank, Tally.Tally> = rt.entry(ranks, _313);
rt.byteVecPush(out, rankByte(rt.entryKey(e)));
rt.byteVecPush(out, rt.entryOrInsertWith(e, (k9: Rank.Rank): Tally.Tally => {
Expand Down Expand Up @@ -418,7 +420,7 @@ export function hashMaps(kind: rt.u8, data: Uint8Array, out: rt.ByteVec): void {
return t6.n & 0xff;
}));
} else {
rt.byteVecPush(out, rt.optionMapOr(rt.hashInsert(clashes, k6, { n: i5 & 0xffff }), 204, (t5: Tally.Tally): rt.u8 => {
rt.byteVecPush(out, rt.optionMapOr(rt.hashInsert(clashes, copy$Clash(k6), { n: i5 & 0xffff }), 204, (t5: Tally.Tally): rt.u8 => {
return t5.n & 0xff;
}));
}
Expand Down Expand Up @@ -450,7 +452,7 @@ export function countedHasher(h: rt.Hasher, counted: Tally.Tally): rt.Hasher {

/** Inserts a key, and gives back the map. */
export function stamp(map: rt.HashMap<rt.u8, Tally.Tally>): rt.HashMap<rt.u8, Tally.Tally> {
rt.hashInsert(map, rt.hashLen(map) & 0xff, Tally.default$Default());
rt.hashInsert(map, rt.hashLen(map) & 0xff, copy$Tally(Tally.default$Default()));
return map;
}

Expand Down Expand Up @@ -724,7 +726,7 @@ export function btreeMaps(kind: rt.u8, data: Uint8Array, out: rt.ByteVec): void
const _170: [rt.u8, rt.u8] = [_171, data[i2]];
const a: rt.u8 = _171;
const b: rt.u8 = _170[1];
const _182: Rank.Rank = rank(a, b);
const _182: Rank.Rank = copy$Rank(rank(a, b));
const t: Tally.Tally = rt.entryOrInsertWith(rt.entry(ranks, _182), Tally.default$Default);
t.n = rt.u16WrappingAdd(t.n, b as rt.u16);
const _188: [rt.u8, rt.u8] = [rt.u8Rem(a, 4), rt.u8Rem(b, 4)];
Expand All @@ -745,7 +747,7 @@ export function btreeMaps(kind: rt.u8, data: Uint8Array, out: rt.ByteVec): void
}
const b2: rt.u8 = _205;
const r: Rank.Rank = rank(b2, rt.u8Div(b2, 3));
const _212: rt.Entry<Rank.Rank, Tally.Tally> = rt.entry(ranks, r);
const _212: rt.Entry<Rank.Rank, Tally.Tally> = rt.entry(ranks, copy$Rank(r));
if (!rt.entryOccupied(_212)) {
const e: rt.Entry<Rank.Rank, Tally.Tally> = _212;
rt.byteVecPush(out, rankByte(rt.entryKey(e)));
Expand Down Expand Up @@ -1031,7 +1033,7 @@ export function vecs(data: Uint8Array, out: rt.ByteVec): void {
name = "?";
}
rt.byteVecExtendFromSlice(out, rt.byteVecView(rt.byteVecFrom(Uint8Array.of(a, b, 66))));
const pairs: [rt.u8, rt.u16][] = [[a, b as rt.u16] as [rt.u8, rt.u16]].map(copy$u8_u16);
const pairs: [rt.u8, rt.u16][] = copy$u8_u16s([[a, b as rt.u16] as [rt.u8, rt.u16]]).map(copy$u8_u16);
pairs.push([b, a as rt.u16] as [rt.u8, rt.u16]);
const at = rt.idx(pairs, 0);
pairs[at][0] = pairs[at][0] ^ 255;
Expand All @@ -1052,7 +1054,7 @@ export function vecs(data: Uint8Array, out: rt.ByteVec): void {
rt.iterExtendBytes(out, rt.iterMap(rt.iterSlice(rt.vecFromElem(rt.u16Mul(a as rt.u16, 257), n, undefined)), (w: rt.u16): rt.u8 => {
return rt.u16Shr(w, 4) & 0xff;
}));
const tuples: [rt.u8, rt.u8][] = rt.vecFromElem(copy$u8_u8([a, b] as [rt.u8, rt.u8]), n, copy$u8_u8);
const tuples: [rt.u8, rt.u8][] = rt.vecFromElem([a, b] as [rt.u8, rt.u8], n, copy$u8_u8);
if (n > 0) {
const at3 = rt.idx(tuples, 0);
tuples[at3][0] = 238;
Expand All @@ -1069,12 +1071,12 @@ export function vecs(data: Uint8Array, out: rt.ByteVec): void {
rt.byteVecPush(out, rt.iterAll(_113, (c2: Cloned.Cloned): boolean => {
return rt.stringLen(c2.name) === data.length;
}) ? 1 : 0);
rt.iterExtendBytes(out, rt.iterMap(rt.iterSlice(rt.vecFromElem(copy$Bumped({ _0: b }), n, Bumped.clone$Clone)), (o: Bumped.Bumped): rt.u8 => {
rt.iterExtendBytes(out, rt.iterMap(rt.iterSlice(rt.vecFromElem({ _0: b }, n, Bumped.clone$Clone)), (o: Bumped.Bumped): rt.u8 => {
return o._0;
}));
const pair: [rt.u8, rt.u8] = [a, b];
const held: Bumped.Bumped = { _0: a };
const listed: [rt.u8, rt.u8][] = [pair, pair].map(copy$u8_u8);
const listed: [rt.u8, rt.u8][] = copy$u8_u8s([pair, pair]).map(copy$u8_u8);
const at4 = rt.idx(listed, 0);
listed[at4][0] = listed[at4][0] ^ 255;
const repeated: [rt.u8, rt.u8][] = rt.vecFromElem(copy$u8_u8(pair), n, copy$u8_u8);
Expand All @@ -1101,4 +1103,133 @@ export function vecs(data: Uint8Array, out: rt.ByteVec): void {
}));
}

/** Stores `p` by value in `v`. */
export function keep(v: [rt.u8, rt.u8][], p: [rt.u8, rt.u8]): void {
v.push(copy$u8_u8(p));
}

/** Gives back what it was given. */
export function same(p: [rt.u8, rt.u8]): [rt.u8, rt.u8] {
return p;
}

/** Changes what it was given in place, which is its own. */
export function bump(h: Holder.Holder): rt.u8 {
h.pair[0] = h.pair[0] ^ 1;
return h.pair[0];
}

/** Holds `pair`, for its caller to change. */
export function hold(pair: [rt.u8, rt.u8]): Holder.Holder {
return { pair: copy$u8_u8(pair) };
}

/**
* A `Copy` aggregate a std call stores by value is the container's own copy: changing
* one stored element leaves the value it came from and the other elements as they were.
*/
export function stores(data: Uint8Array, out: rt.ByteVec): void {
const a: rt.u8 = rt.optionUnwrapOr(rt.sliceFirst(data), 0);
const b: rt.u8 = rt.optionUnwrapOr(rt.sliceGet(data, 1), 0);
const pair: [rt.u8, rt.u8] = same([a, b] as [rt.u8, rt.u8]);
const changed: [rt.u8, rt.u8] = [b, a];
changed[0] = changed[0] ^ 16;
const v: [rt.u8, rt.u8][] = [];
v.push(copy$u8_u8(pair));
v.push(copy$u8_u8(pair));
const at = rt.idx(v, 0);
v[at][0] = v[at][0] ^ 1;
v.push(copy$u8_u8(changed));
changed[1] = changed[1] ^ 32;
const at2 = rt.idx(v, 2);
v[at2][0] = v[at2][0] ^ 4;
keep(v, pair);
const at3 = rt.idx(v, 3);
v[at3][1] = v[at3][1] ^ 8;
const _30: [rt.u8, rt.u8] = copy$u8_u8(same(pair));
v.push(_30);
const at4 = rt.idx(v, 4);
v[at4][0] = v[at4][0] ^ 64;
const _36: [rt.u8, rt.u8] = copy$u8_u8(changed);
rt.iterExtend(v, rt.iterSlice([copy$u8_u8(pair), _36]));
const at5 = rt.idx(v, 5);
v[at5][1] = v[at5][1] ^ 128;
const at6 = rt.idx(v, 6);
v[at6][0] = v[at6][0] ^ 128;
const at7 = rt.idx(v, 0);
const old2 = v[at7];
v[at7] = copy$u8_u8(pair);
const old: [rt.u8, rt.u8] = old2;
const at8 = rt.idx(v, 0);
v[at8][1] = v[at8][1] ^ 16;
rt.iterExtendBytes(out, rt.iterFlatMap(rt.iterSlice(v), (p: [rt.u8, rt.u8]): Uint8Array => {
return Uint8Array.of(p[0], p[1]);
}, (value: Uint8Array) => rt.iterSlice(value)));
rt.byteVecExtendFromSlice(out, Uint8Array.of(changed[0], changed[1], old[0], old[1]));
const tally: Tally.Tally = { n: a as rt.u16 };
const q: rt.VecDeque<Tally.Tally> = rt.dequeNew() as rt.VecDeque<Tally.Tally>;
rt.dequePushBack(q, copy$Tally(tally));
rt.dequePushFront(q, copy$Tally(tally));
rt.dequeInsert(q, 1, copy$Tally(tally));
const _68: Tally.Tally | undefined = rt.dequeEnd(q);
if (_68 !== undefined) {
_68.n = _68.n ^ 1;
}
const _72: Tally.Tally | undefined = rt.dequeEnd(q, true);
if (_72 !== undefined) {
_72.n = _72.n ^ 2;
}
rt.iterExtendBytes(out, rt.iterMap(rt.dequeIter(q), (t: Tally.Tally): rt.u8 => {
return t.n & 0xff;
}));
rt.byteVecPush(out, tally.n & 0xff);
const hash: rt.HashMap<rt.u8, [rt.u8, rt.u8]> = rt.hashNew() as rt.HashMap<rt.u8, [rt.u8, rt.u8]>;
rt.hashInsert(hash, 0, copy$u8_u8(pair));
rt.hashInsert(hash, 1, copy$u8_u8(pair));
const _88: rt.Place<[rt.u8, rt.u8]> | undefined = rt.hashGetMut(hash, 0);
if (_88 !== undefined) {
_88.v[0] = _88.v[0] ^ 1;
}
const place = rt.entryOrInsertMut(rt.entry(hash, 2), copy$u8_u8(pair));
place.v[1] = place.v[1] ^ 2;
rt.iterExtendBytes(out, rt.iterFlatMap(new rt.Range(0, 3), (k: rt.u8): Uint8Array => {
return rt.optionMapOr(rt.hashGet(hash, k), rt.bytes(2).fill(255), (p2: [rt.u8, rt.u8]): Uint8Array => {
return Uint8Array.of(p2[0], p2[1]);
});
}, (value: Uint8Array) => rt.iterSlice(value)));
const tree: rt.BTreeMap<rt.u8, [rt.u8, rt.u8]> = rt.btreeNew(rt.cmp) as rt.BTreeMap<rt.u8, [rt.u8, rt.u8]>;
rt.btreeInsert(tree, 0, copy$u8_u8(pair));
rt.btreeInsert(tree, 1, copy$u8_u8(pair));
const _106: rt.Place<[rt.u8, rt.u8]> | undefined = rt.btreeGetMut(tree, 1);
if (_106 !== undefined) {
_106.v[1] = _106.v[1] ^ 1;
}
rt.iterExtendBytes(out, rt.iterFlatMap(rt.btreeValues(tree), (p3: [rt.u8, rt.u8]): Uint8Array => {
return Uint8Array.of(p3[0], p3[1]);
}, (value: Uint8Array) => rt.iterSlice(value)));
const boxed: [rt.u8, rt.u8] = copy$u8_u8(pair);
boxed[0] = boxed[0] ^ 1;
const holders: Holder.Holder[] = [{ pair: copy$u8_u8(pair) }];
holders.push({ pair: copy$u8_u8(pair) });
const at9 = rt.idx(holders, 1);
holders[at9].pair[1] = holders[at9].pair[1] ^ 2;
const _128: rt.u8 = boxed[0];
const _129: rt.u8 = boxed[1];
const at10 = rt.idx(holders, 0);
const _130: rt.u8 = holders[at10].pair[1];
const at11 = rt.idx(holders, 1);
rt.byteVecExtendFromSlice(out, Uint8Array.of(_128, _129, _130, holders[at11].pair[1]));
rt.byteVecPush(out, bump({ pair: copy$u8_u8(pair) }));
const held: Holder.Holder = hold(pair);
held.pair[1] = held.pair[1] ^ 4;
const _142: Holder.Holder = hold(pair);
holders.push(_142);
const at12 = rt.idx(holders, 2);
holders[at12].pair[0] = holders[at12].pair[0] ^ 8;
const _149: rt.u8 = held.pair[1];
const at13 = rt.idx(holders, 2);
rt.byteVecExtendFromSlice(out, Uint8Array.of(_149, holders[at13].pair[0]));
rt.byteVecExtendFromSlice(out, Uint8Array.of(pair[0], pair[1]));
}

//# sourceMappingURL=collections.ts.map
8 changes: 4 additions & 4 deletions ts/fixtures/lang/expected/fmt.ts
Original file line number Diff line number Diff line change
@@ -1,7 +1,7 @@
// Generated by rust2-ts. Do not edit.

import * as rt from "./rt.ts";
import { copy$Pair } from "./lib.ts";
import { copy$Pair$2 } from "./lib.ts";
import * as Bare from "./fmt.Bare.ts";
import * as Braced from "./fmt.Braced.ts";
import * as Fails from "./fmt.Fails.ts";
Expand Down Expand Up @@ -212,7 +212,7 @@ export function nested(data: Uint8Array): Nested.Nested {
_22 = { tag: "Rect", corner: { x: 0, y: 0 }, width: at(3) as rt.u16, height: 9 } as Shape.Shape;
}
const _35: rt.ByteVec = rt.sliceToByteVec(rt.sliceRange(data, 0, rt.min(data.length, 4)));
const _40: Pair.Pair[] = [{ _0: at(4), _1: -1 }, { _0: 2, _1: { hi: -0x80000000, lo: 0 } as rt.i64 }].map(copy$Pair);
const _40: Pair.Pair[] = [{ _0: at(4), _1: -1 }, { _0: 2, _1: { hi: -0x80000000, lo: 0 } as rt.i64 }].map(copy$Pair$2);
if (!(rt.u8Rem(at(5), 2) === 0)) {
_49 = undefined;
} else {
Expand Down Expand Up @@ -309,8 +309,8 @@ export function written(data: Uint8Array, out: rt.ByteVec): void {
const arg3 = { id: 0, list: [] };
const args6: rt.Fmt[] = [_66, (f: rt.Formatter) => Manual.fmt$Debug(arg3, f)];
put(out, rt.fmtFormat([args6[0], " ", rt.fmtSpec({ alternate: true }, args6[0]), " ", args6[1]]));
[{ _0: [{ _0: at(3), _1: 0 }, { _0: 1, _1: -1 }].map(copy$Pair) }, { _0: [] }] as [Seq.Seq, Seq.Seq];
const arg4 = { _0: [{ _0: at(3), _1: 0 }, { _0: 1, _1: -1 }].map(copy$Pair) };
[{ _0: [{ _0: at(3), _1: 0 }, { _0: 1, _1: -1 }].map(copy$Pair$2) }, { _0: [] }] as [Seq.Seq, Seq.Seq];
const arg4 = { _0: [{ _0: at(3), _1: 0 }, { _0: 1, _1: -1 }].map(copy$Pair$2) };
const _92: rt.Fmt = (f: rt.Formatter) => Seq.fmt$Debug(arg4, f);
const arg5 = { _0: [] };
const args8: rt.Fmt[] = [_92, (f: rt.Formatter) => Seq.fmt$Debug(arg5, f)];
Expand Down
Loading