goscript 0.1.1 → 0.1.2

package/dist/gs/runtime/pprof/index.d.ts

@@ -0,0 +1,20 @@
+import * as $ from '@goscript/builtin/index.js';
+import * as io from '@goscript/io/index.js';
+type WriterArg = io.Writer | $.VarRef<io.Writer> | null | undefined;
+export declare class Profile {
+    name: string;
+    constructor(name?: string);
+    Name(): string;
+    Count(): number;
+    WriteTo(w: WriterArg, debug: number): $.GoError;
+}
+export declare function Lookup(name: string): Profile | null;
+export declare function Profiles(): $.Slice<Profile | null>;
+export declare function StartCPUProfile(w: WriterArg): $.GoError;
+export declare function StopCPUProfile(): void;
+export declare function SetGoroutineLabels(_ctx: unknown): void;
+export declare function Do(_ctx: unknown, _labels: unknown, fn: (() => void) | null): void;
+export declare function ForLabels(_ctx: unknown, _f: unknown): void;
+export declare function WithLabels(ctx: unknown, _labels: unknown): unknown;
+export declare function Labels(...args: string[]): Map<string, string>;
+export {};

package/dist/gs/runtime/pprof/index.js

@@ -0,0 +1,85 @@
+import * as $ from '@goscript/builtin/index.js';
+import * as errors from '@goscript/errors/index.js';
+let activeCPUWriter = null;
+export class Profile {
+    name;
+    constructor(name = '') {
+        this.name = name;
+    }
+    Name() {
+        return this.name;
+    }
+    Count() {
+        return this.name === '' ? 0 : 1;
+    }
+    WriteTo(w, debug) {
+        return writeProfile(w, `goscript pprof ${this.name} debug=${debug}\n`);
+    }
+}
+export function Lookup(name) {
+    switch (name) {
+        case 'heap':
+        case 'allocs':
+        case 'goroutine':
+        case 'threadcreate':
+        case 'block':
+        case 'mutex':
+            return new Profile(name);
+        default:
+            return null;
+    }
+}
+export function Profiles() {
+    return $.arrayToSlice([
+        new Profile('allocs'),
+        new Profile('block'),
+        new Profile('goroutine'),
+        new Profile('heap'),
+        new Profile('mutex'),
+        new Profile('threadcreate'),
+    ]);
+}
+export function StartCPUProfile(w) {
+    const writer = writerFromArg(w);
+    if (writer == null) {
+        return errors.New('runtime/pprof: nil profile writer');
+    }
+    if (activeCPUWriter != null) {
+        return errors.New('runtime/pprof: CPU profiling already active');
+    }
+    activeCPUWriter = writer;
+    return writeProfile(writer, 'goscript cpu profile start\n');
+}
+export function StopCPUProfile() {
+    if (activeCPUWriter != null) {
+        writeProfile(activeCPUWriter, 'goscript cpu profile stop\n');
+        activeCPUWriter = null;
+    }
+}
+export function SetGoroutineLabels(_ctx) { }
+export function Do(_ctx, _labels, fn) {
+    fn?.();
+}
+export function ForLabels(_ctx, _f) { }
+export function WithLabels(ctx, _labels) {
+    return ctx;
+}
+export function Labels(...args) {
+    const labels = new Map();
+    for (let i = 0; i + 1 < args.length; i += 2) {
+        labels.set(args[i], args[i + 1]);
+    }
+    return labels;
+}
+function writerFromArg(w) {
+    return $.pointerValueOrNil(w);
+}
+function writeProfile(w, text) {
+    const writer = writerFromArg(w);
+    if (writer == null) {
+        return errors.New('runtime/pprof: nil profile writer');
+    }
+    const [, err] = writer.Write($.stringToBytes(text));
+    return err;
+}
+//# sourceMappingURL=index.js.map

package/dist/gs/runtime/pprof/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../gs/runtime/pprof/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,4BAA4B,CAAA;AAC/C,OAAO,KAAK,MAAM,MAAM,2BAA2B,CAAA;AAKnD,IAAI,eAAe,GAAqB,IAAI,CAAA;AAE5C,MAAM,OAAO,OAAO;IACX,IAAI,CAAQ;IAEnB,YAAY,IAAI,GAAG,EAAE;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IAClB,CAAC;IAEM,IAAI;QACT,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;IAEM,KAAK;QACV,OAAO,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACjC,CAAC;IAEM,OAAO,CAAC,CAAY,EAAE,KAAa;QACxC,OAAO,YAAY,CAAC,CAAC,EAAE,kBAAkB,IAAI,CAAC,IAAI,UAAU,KAAK,IAAI,CAAC,CAAA;IACxE,CAAC;CACF;AAED,MAAM,UAAU,MAAM,CAAC,IAAY;IACjC,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,MAAM,CAAC;QACZ,KAAK,QAAQ,CAAC;QACd,KAAK,WAAW,CAAC;QACjB,KAAK,cAAc,CAAC;QACpB,KAAK,OAAO,CAAC;QACb,KAAK,OAAO;YACV,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAA;QAC1B;YACE,OAAO,IAAI,CAAA;IACf,CAAC;AACH,CAAC;AAED,MAAM,UAAU,QAAQ;IACtB,OAAO,CAAC,CAAC,YAAY,CAAC;QACpB,IAAI,OAAO,CAAC,QAAQ,CAAC;QACrB,IAAI,OAAO,CAAC,OAAO,CAAC;QACpB,IAAI,OAAO,CAAC,WAAW,CAAC;QACxB,IAAI,OAAO,CAAC,MAAM,CAAC;QACnB,IAAI,OAAO,CAAC,OAAO,CAAC;QACpB,IAAI,OAAO,CAAC,cAAc,CAAC;KAC5B,CAAC,CAAA;AACJ,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,CAAY;IAC1C,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAA;IAC/B,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;QACnB,OAAO,MAAM,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAA;IACxD,CAAC;IACD,IAAI,eAAe,IAAI,IAAI,EAAE,CAAC;QAC5B,OAAO,MAAM,CAAC,GAAG,CAAC,6CAA6C,CAAC,CAAA;IAClE,CAAC;IACD,eAAe,GAAG,MAAM,CAAA;IACxB,OAAO,YAAY,CAAC,MAAM,EAAE,8BAA8B,CAAC,CAAA;AAC7D,CAAC;AAED,MAAM,UAAU,cAAc;IAC5B,IAAI,eAAe,IAAI,IAAI,EAAE,CAAC;QAC5B,YAAY,CAAC,eAAe,EAAE,6BAA6B,CAAC,CAAA;QAC5D,eAAe,GAAG,IAAI,CAAA;IACxB,CAAC;AACH,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,IAAa,IAAS,CAAC;AAE1D,MAAM,UAAU,EAAE,CAAC,IAAa,EAAE,OAAgB,EAAE,EAAuB;IACzE,EAAE,EAAE,EAAE,CAAA;AACR,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,IAAa,EAAE,EAAW,IAAS,CAAC;AAE9D,MAAM,UAAU,UAAU,CAAC,GAAY,EAAE,OAAgB;IACvD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,MAAM,UAAU,MAAM,CAAC,GAAG,IAAc;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAA;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAClC,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,aAAa,CAAC,CAAY;IACjC,OAAO,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAA;AAC/B,CAAC;AAED,SAAS,YAAY,CAAC,CAAY,EAAE,IAAY;IAC9C,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,CAAC,CAAA;IAC/B,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;QACnB,OAAO,MAAM,CAAC,GAAG,CAAC,mCAAmC,CAAC,CAAA;IACxD,CAAC;IACD,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAA;IACnD,OAAO,GAAG,CAAA;AACZ,CAAC"}

package/dist/gs/runtime/trace/index.d.ts

@@ -0,0 +1,19 @@
+import * as $ from '@goscript/builtin/index.js';
+import * as context from '@goscript/context/index.js';
+import * as io from '@goscript/io/index.js';
+export declare class Task {
+    id: number;
+    constructor(id?: number);
+    End(): void;
+}
+export declare class Region {
+    End(): void;
+}
+export declare function NewTask(pctx: context.Context | null, _taskType: string): [context.Context | null, Task];
+export declare function Log(_ctx: context.Context | null, category: string, message: string): void;
+export declare function Logf(_ctx: context.Context | null, _category: string, _format: string, ..._args: unknown[]): void;
+export declare function WithRegion(_ctx: context.Context | null, _regionType: string, fn: (() => void) | null): void;
+export declare function StartRegion(_ctx: context.Context | null, _regionType: string): Region;
+export declare function IsEnabled(): boolean;
+export declare function Start(w: io.Writer | $.VarRef<io.Writer> | null): $.GoError;
+export declare function Stop(): void;

package/dist/gs/runtime/trace/index.js

@@ -0,0 +1,64 @@
+import * as $ from '@goscript/builtin/index.js';
+import * as context from '@goscript/context/index.js';
+import * as errors from '@goscript/errors/index.js';
+class traceContextKey {
+}
+const traceState = {
+    activeWriter: null,
+    nextTaskID: 0,
+};
+export class Task {
+    id;
+    constructor(id = 0) {
+        this.id = id;
+    }
+    End() { }
+}
+export class Region {
+    End() { }
+}
+export function NewTask(pctx, _taskType) {
+    const parent = pctx ?? context.Background();
+    const task = new Task(++traceState.nextTaskID);
+    return [
+        context.WithValue(parent, $.interfaceValue(new traceContextKey(), 'trace.traceContextKey'), $.interfaceValue(task, '*trace.Task')),
+        task,
+    ];
+}
+export function Log(_ctx, category, message) {
+    writeTrace(`log ${category} ${message}\n`);
+}
+export function Logf(_ctx, _category, _format, ..._args) { }
+export function WithRegion(_ctx, _regionType, fn) {
+    fn?.();
+}
+export function StartRegion(_ctx, _regionType) {
+    return new Region();
+}
+export function IsEnabled() {
+    return false;
+}
+export function Start(w) {
+    const writer = $.pointerValueOrNil(w);
+    if (writer == null) {
+        return errors.New('runtime/trace: nil trace writer');
+    }
+    if (traceState.activeWriter != null) {
+        return errors.New('runtime/trace: trace already active');
+    }
+    traceState.activeWriter = writer;
+    return writeTrace('goscript trace start\n');
+}
+export function Stop() {
+    writeTrace('goscript trace stop\n');
+    traceState.activeWriter = null;
+}
+function writeTrace(text) {
+    const writer = traceState.activeWriter;
+    if (writer == null) {
+        return null;
+    }
+    const [, err] = writer.Write($.stringToBytes(text));
+    return err;
+}
+//# sourceMappingURL=index.js.map

package/dist/gs/runtime/trace/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../gs/runtime/trace/index.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,4BAA4B,CAAA;AAC/C,OAAO,KAAK,OAAO,MAAM,4BAA4B,CAAA;AACrD,OAAO,KAAK,MAAM,MAAM,2BAA2B,CAAA;AAGnD,MAAM,eAAe;CAAG;AAExB,MAAM,UAAU,GAAG;IACjB,YAAY,EAAE,IAAwB;IACtC,UAAU,EAAE,CAAC;CACd,CAAA;AAED,MAAM,OAAO,IAAI;IACR,EAAE,CAAQ;IAEjB,YAAY,EAAE,GAAG,CAAC;QAChB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;IACd,CAAC;IAEM,GAAG,KAAU,CAAC;CACtB;AAED,MAAM,OAAO,MAAM;IACV,GAAG,KAAU,CAAC;CACtB;AAED,MAAM,UAAU,OAAO,CACrB,IAA4B,EAC5B,SAAiB;IAEjB,MAAM,MAAM,GAAG,IAAI,IAAI,OAAO,CAAC,UAAU,EAAE,CAAA;IAC3C,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,EAAE,UAAU,CAAC,UAAU,CAAC,CAAA;IAC9C,OAAO;QACL,OAAO,CAAC,SAAS,CACf,MAAM,EACN,CAAC,CAAC,cAAc,CAAC,IAAI,eAAe,EAAE,EAAE,uBAAuB,CAAC,EAChE,CAAC,CAAC,cAAc,CAAC,IAAI,EAAE,aAAa,CAAC,CACtC;QACD,IAAI;KACL,CAAA;AACH,CAAC;AAED,MAAM,UAAU,GAAG,CAAC,IAA4B,EAAE,QAAgB,EAAE,OAAe;IACjF,UAAU,CAAC,OAAO,QAAQ,IAAI,OAAO,IAAI,CAAC,CAAA;AAC5C,CAAC;AAED,MAAM,UAAU,IAAI,CAClB,IAA4B,EAC5B,SAAiB,EACjB,OAAe,EACf,GAAG,KAAgB,IACZ,CAAC;AAEV,MAAM,UAAU,UAAU,CACxB,IAA4B,EAC5B,WAAmB,EACnB,EAAuB;IAEvB,EAAE,EAAE,EAAE,CAAA;AACR,CAAC;AAED,MAAM,UAAU,WAAW,CACzB,IAA4B,EAC5B,WAAmB;IAEnB,OAAO,IAAI,MAAM,EAAE,CAAA;AACrB,CAAC;AAED,MAAM,UAAU,SAAS;IACvB,OAAO,KAAK,CAAA;AACd,CAAC;AAED,MAAM,UAAU,KAAK,CAAC,CAAyC;IAC7D,MAAM,MAAM,GAAG,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAA;IACrC,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;QACnB,OAAO,MAAM,CAAC,GAAG,CAAC,iCAAiC,CAAC,CAAA;IACtD,CAAC;IACD,IAAI,UAAU,CAAC,YAAY,IAAI,IAAI,EAAE,CAAC;QACpC,OAAO,MAAM,CAAC,GAAG,CAAC,qCAAqC,CAAC,CAAA;IAC1D,CAAC;IACD,UAAU,CAAC,YAAY,GAAG,MAAM,CAAA;IAChC,OAAO,UAAU,CAAC,wBAAwB,CAAC,CAAA;AAC7C,CAAC;AAED,MAAM,UAAU,IAAI;IAClB,UAAU,CAAC,uBAAuB,CAAC,CAAA;IACnC,UAAU,CAAC,YAAY,GAAG,IAAI,CAAA;AAChC,CAAC;AAED,SAAS,UAAU,CAAC,IAAY;IAC9B,MAAM,MAAM,GAAG,UAAU,CAAC,YAAY,CAAA;IACtC,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;QACnB,OAAO,IAAI,CAAA;IACb,CAAC;IACD,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAA;IACnD,OAAO,GAAG,CAAA;AACZ,CAAC"}

package/dist/gs/slices/slices.d.ts

@@ -1,6 +1,10 @@
 import * as $ from '@goscript/builtin/index.js';
 import * as cmp from '../cmp/index.js';
 import * as iter from '../iter/index.js';
+type SyncCallbackResult<T> = T | globalThis.Promise<T>;
+type CompareCallback<T, U = T> = ((v1: T, v2: U) => SyncCallbackResult<number>) | null;
+type PredicateCallback<T> = ((value: T) => SyncCallbackResult<boolean>) | null;
+type EqualCallback<T, U = T> = ((v1: T, v2: U) => SyncCallbackResult<boolean>) | null;
 /**
  * Compare compares the elements of s1 and s2 using cmp.Compare.
  * The elements are compared sequentially, starting at index 0,
@@ -14,23 +18,28 @@ import * as iter from '../iter/index.js';
  * @returns -1, 0, or 1
  */
 export declare function Compare<T extends string | number>(s1: $.Slice<T>, s2: $.Slice<T>): number;
+export declare function CompareFunc<T, U>(s1: $.Slice<T>, s2: $.Slice<U>, compare: CompareCallback<T, U>): number;
 /**
  * Clone returns a shallow copy of s while preserving nilness.
  * @param s The slice to clone
  * @returns A new slice with the same elements, or null for a nil slice
  */
 export declare function Clone<T>(s: $.Slice<T>): $.Slice<T>;
+export declare function Concat<T>(...slices: $.Slice<T>[]): $.Slice<T>;
 /**
  * All returns an iterator over index-value pairs in the slice.
  * This is equivalent to Go's slices.All function.
  * @param s The slice to iterate over
  * @returns An iterator function that yields index-value pairs
  */
-export declare function All<T>(s: $.Slice<T>): (yieldFunc: (index: number, value: T) => boolean) => void;
+export declare function All<T>(s: $.Slice<T>): (yieldFunc: (index: number, value: T) => iter.YieldResult) => void | globalThis.Promise<void>;
 export declare function Backward<T>(s: $.Slice<T>): (_yield: (index: number, value: T) => boolean | globalThis.Promise<boolean>) => void | globalThis.Promise<void>;
 export declare function Sort<T extends string | number>(s: $.Slice<T>): void;
 export declare function IsSorted<T extends string | number>(x: $.Slice<T>): boolean;
 export declare function Max<T extends cmp.Ordered>(x: $.Slice<T>): T;
+export declare function Min<T extends cmp.Ordered>(x: $.Slice<T>): T;
+export declare function MaxFunc<T>(x: $.Slice<T>, compare: CompareCallback<T>): T;
+export declare function MinFunc<T>(x: $.Slice<T>, compare: CompareCallback<T>): T;
 export declare function Collect<T>(seq: iter.Seq<T>): $.Slice<T>;
 export declare function Sorted<T extends string | number>(seq: iter.Seq<T>): $.Slice<T>;
 /**
@@ -43,13 +52,17 @@ export declare function Sorted<T extends string | number>(seq: iter.Seq<T>): $.S
  * @returns The modified slice
  */
 export declare function Delete<T>(s: $.Slice<T>, i: number, j: number): $.Slice<T>;
-export declare function DeleteFunc<T>(s: $.Slice<T>, del: (value: T) => boolean): $.Slice<T>;
+export declare function DeleteFunc<T>(s: $.Slice<T>, del: PredicateCallback<T>): $.Slice<T>;
+export declare function Replace<T>(s: $.Slice<T>, i: number, j: number, ...v: T[]): $.Slice<T>;
+export declare function Compact<T>(s: $.Slice<T>): $.Slice<T>;
+export declare function CompactFunc<T>(s: $.Slice<T>, eq: EqualCallback<T>): $.Slice<T>;
+export declare function Clip<T>(s: $.Slice<T>): $.Slice<T>;
 export declare function Equal<T>(s1: $.Slice<T>, s2: $.Slice<T>): boolean;
-export declare function EqualFunc<T, U>(s1: $.Slice<T>, s2: $.Slice<U>, eq: (v1: T, v2: U) => boolean): boolean;
+export declare function EqualFunc<T, U>(s1: $.Slice<T>, s2: $.Slice<U>, eq: EqualCallback<T, U>): boolean;
 export declare function Index<T>(s: $.Slice<T>, v: T): number;
-export declare function IndexFunc<T>(s: $.Slice<T>, f: (v: T) => boolean): number;
+export declare function IndexFunc<T>(s: $.Slice<T>, f: PredicateCallback<T>): number;
 export declare function Contains<T>(s: $.Slice<T>, v: T): boolean;
-export declare function ContainsFunc<T>(s: $.Slice<T>, f: (v: T) => boolean): boolean;
+export declare function ContainsFunc<T>(s: $.Slice<T>, f: PredicateCallback<T>): boolean;
 export declare function Insert<T>(s: $.Slice<T>, i: number, ...v: T[]): $.Slice<T>;
 export declare function Reverse<T>(s: $.Slice<T>): void;
 /**
@@ -70,9 +83,9 @@ export declare function Grow<T>(s: $.Slice<T>, n: number): $.Slice<T>;
  * @param s The slice to sort in place
  * @param cmp Comparison function
  */
-export declare function SortFunc<T>(s: $.Slice<T>, cmp: (a: T, b: T) => number): void;
-export declare function IsSortedFunc<T>(x: $.Slice<T>, cmp: (a: T, b: T) => number): boolean;
-export declare function SortStableFunc<T>(s: $.Slice<T>, cmp: (a: T, b: T) => number): void;
+export declare function SortFunc<T>(s: $.Slice<T>, cmp: CompareCallback<T>): void;
+export declare function IsSortedFunc<T>(x: $.Slice<T>, cmp: CompareCallback<T>): boolean;
+export declare function SortStableFunc<T>(s: $.Slice<T>, cmp: CompareCallback<T>): void;
 /**
  * BinarySearchFunc works like BinarySearch, but uses a custom comparison function.
  * The slice must be sorted in increasing order, where "increasing" is defined by cmp.
@@ -85,4 +98,6 @@ export declare function SortStableFunc<T>(s: $.Slice<T>, cmp: (a: T, b: T) => nu
  * @param cmp Comparison function
  * @returns A tuple of [index, found] where index is the position and found indicates if target was found
  */
-export declare function BinarySearchFunc<E, T>(x: $.Slice<E>, target: T, cmp: (a: E, b: T) => number): [number, boolean];
+export declare function BinarySearchFunc<E, T>(x: $.Slice<E>, target: T, cmp: CompareCallback<E, T>): [number, boolean];
+export declare function BinarySearch<T extends cmp.Ordered>(x: $.Slice<T>, target: T): [number, boolean];
+export {};

package/dist/gs/slices/slices.js

@@ -34,6 +34,27 @@ export function Compare(s1, s2) {
     }
     return 0;
 }
+export function CompareFunc(s1, s2, compare) {
+    if (compare == null) {
+        throw new Error('slices.CompareFunc: nil comparison function');
+    }
+    const len1 = $.len(s1);
+    const len2 = $.len(s2);
+    const minLen = len1 < len2 ? len1 : len2;
+    for (let i = 0; i < minLen; i++) {
+        const result = syncNumber(compare(s1[i], s2[i]));
+        if (result !== 0) {
+            return result;
+        }
+    }
+    if (len1 < len2) {
+        return -1;
+    }
+    if (len1 > len2) {
+        return 1;
+    }
+    return 0;
+}
 /**
  * Clone returns a shallow copy of s while preserving nilness.
  * @param s The slice to clone
@@ -50,6 +71,38 @@ export function Clone(s) {
     }
     return out;
 }
+export function Concat(...slices) {
+    let size = 0;
+    let byteSlice = false;
+    for (const slice of slices) {
+        size += $.len(slice);
+        byteSlice = byteSlice || slice instanceof Uint8Array;
+    }
+    if (size === 0) {
+        return null;
+    }
+    if (byteSlice) {
+        const out = new Uint8Array(size);
+        let pos = 0;
+        for (const slice of slices) {
+            const length = $.len(slice);
+            for (let i = 0; i < length; i++) {
+                out[pos++] = slice[i];
+            }
+        }
+        return out;
+    }
+    const out = $.makeSlice(size);
+    let pos = 0;
+    for (const slice of slices) {
+        const length = $.len(slice);
+        for (let i = 0; i < length; i++) {
+            ;
+            out[pos++] = slice[i];
+        }
+    }
+    return out;
+}
 /**
  * All returns an iterator over index-value pairs in the slice.
  * This is equivalent to Go's slices.All function.
@@ -59,12 +112,23 @@ export function Clone(s) {
 export function All(s) {
     return function (_yield) {
         const length = $.len(s);
-        for (let i = 0; i < length; i++) {
-            const value = s[i]; // Use proper indexing to avoid type issues
-            if (!_yield(i, value)) {
-                break;
+        const walk = (i) => {
+            for (; i < length; i++) {
+                const value = s[i]; // Use proper indexing to avoid type issues
+                const keepGoing = _yield(i, value);
+                if (keepGoing instanceof Promise) {
+                    return keepGoing.then((next) => {
+                        if (next) {
+                            return walk(i + 1);
+                        }
+                    });
+                }
+                if (!keepGoing) {
+                    return;
+                }
             }
-        }
+        };
+        return walk(0);
     };
 }
 export function Backward(s) {
@@ -115,6 +179,51 @@ export function Max(x) {
     }
     return max;
 }
+export function Min(x) {
+    if ($.len(x) === 0) {
+        throw new Error('slices.Min: empty list');
+    }
+    let min = x[0];
+    for (let i = 1; i < $.len(x); i++) {
+        const value = x[i];
+        if (cmp.Compare(value, min) < 0) {
+            min = value;
+        }
+    }
+    return min;
+}
+export function MaxFunc(x, compare) {
+    if (compare == null) {
+        throw new Error('slices.MaxFunc: nil comparison function');
+    }
+    if ($.len(x) === 0) {
+        throw new Error('slices.MaxFunc: empty list');
+    }
+    let max = x[0];
+    for (let i = 1; i < $.len(x); i++) {
+        const value = x[i];
+        if (syncNumber(compare(max, value)) < 0) {
+            max = value;
+        }
+    }
+    return max;
+}
+export function MinFunc(x, compare) {
+    if (compare == null) {
+        throw new Error('slices.MinFunc: nil comparison function');
+    }
+    if ($.len(x) === 0) {
+        throw new Error('slices.MinFunc: empty list');
+    }
+    let min = x[0];
+    for (let i = 1; i < $.len(x); i++) {
+        const value = x[i];
+        if (syncNumber(compare(value, min)) < 0) {
+            min = value;
+        }
+    }
+    return min;
+}
 export function Collect(seq) {
     const out = [];
     seq((value) => {
@@ -160,13 +269,16 @@ export function Delete(s, i, j) {
     return $.goSlice(s, 0, length - deleteCount);
 }
 export function DeleteFunc(s, del) {
+    if (del == null) {
+        throw new Error('slices.DeleteFunc: nil delete function');
+    }
     if (s === null || s === undefined) {
         return s;
     }
     let w = 0;
     for (let i = 0; i < s.length; i++) {
         const value = s[i];
-        if (!del(value)) {
+        if (!syncBoolean(del(value))) {
             ;
             s[w] = value;
             w++;
@@ -178,6 +290,77 @@ export function DeleteFunc(s, del) {
     }
     return $.goSlice(s, 0, w);
 }
+export function Replace(s, i, j, ...v) {
+    const length = $.len(s);
+    if (i < 0 || j < i || j > length) {
+        throw new Error(`slice bounds out of range [${i}:${j}] with length ${length}`);
+    }
+    const out = $.makeSlice(length - (j - i) + v.length);
+    let pos = 0;
+    for (let idx = 0; idx < i; idx++) {
+        ;
+        out[pos++] = s[idx];
+    }
+    for (const value of v) {
+        ;
+        out[pos++] = value;
+    }
+    for (let idx = j; idx < length; idx++) {
+        ;
+        out[pos++] = s[idx];
+    }
+    return out;
+}
+export function Compact(s) {
+    if (s === null || s === undefined || $.len(s) < 2) {
+        return s;
+    }
+    let w = 1;
+    for (let i = 1; i < $.len(s); i++) {
+        if (s[i] !== s[i - 1]) {
+            ;
+            s[w] = s[i];
+            w++;
+        }
+    }
+    for (let i = w; i < $.len(s); i++) {
+        ;
+        s[i] = clearValue(s);
+    }
+    return $.goSlice(s, 0, w);
+}
+export function CompactFunc(s, eq) {
+    if (eq == null) {
+        throw new Error('slices.CompactFunc: nil equality function');
+    }
+    if (s === null || s === undefined || $.len(s) < 2) {
+        return s;
+    }
+    let w = 1;
+    for (let i = 1; i < $.len(s); i++) {
+        if (!syncBoolean(eq(s[i - 1], s[i]))) {
+            ;
+            s[w] = s[i];
+            w++;
+        }
+    }
+    for (let i = w; i < $.len(s); i++) {
+        ;
+        s[i] = clearValue(s);
+    }
+    return $.goSlice(s, 0, w);
+}
+export function Clip(s) {
+    if (s == null) {
+        return null;
+    }
+    const out = $.makeSlice($.len(s), $.len(s));
+    for (let i = 0; i < $.len(s); i++) {
+        ;
+        out[i] = s[i];
+    }
+    return out;
+}
 export function Equal(s1, s2) {
     const len1 = $.len(s1);
     if (len1 !== $.len(s2)) {
@@ -191,12 +374,15 @@ export function Equal(s1, s2) {
     return true;
 }
 export function EqualFunc(s1, s2, eq) {
+    if (eq == null) {
+        throw new Error('slices.EqualFunc: nil equality function');
+    }
     const len1 = $.len(s1);
     if (len1 !== $.len(s2)) {
         return false;
     }
     for (let i = 0; i < len1; i++) {
-        if (!eq(s1[i], s2[i])) {
+        if (!syncBoolean(eq(s1[i], s2[i]))) {
             return false;
         }
     }
@@ -211,8 +397,11 @@ export function Index(s, v) {
     return -1;
 }
 export function IndexFunc(s, f) {
+    if (f == null) {
+        throw new Error('slices.IndexFunc: nil predicate function');
+    }
     for (let i = 0; i < $.len(s); i++) {
-        if (f(s[i])) {
+        if (syncBoolean(f(s[i]))) {
             return i;
         }
     }
@@ -295,37 +484,35 @@ export function Grow(s, n) {
  * @param cmp Comparison function
  */
 export function SortFunc(s, cmp) {
+    if (cmp == null) {
+        throw new Error('slices.SortFunc: nil comparison function');
+    }
     if (s === null || s === undefined) {
         return;
     }
     const arr = s;
-    arr.sort(cmp);
+    arr.sort((a, b) => syncNumber(cmp(a, b)));
 }
 export function IsSortedFunc(x, cmp) {
+    if (cmp == null) {
+        throw new Error('slices.IsSortedFunc: nil comparison function');
+    }
     for (let i = $.len(x) - 1; i > 0; i--) {
-        if (cmp(x[i], x[i - 1]) < 0) {
+        if (syncNumber(cmp(x[i], x[i - 1])) < 0) {
             return false;
         }
     }
     return true;
 }
 export function SortStableFunc(s, cmp) {
+    if (cmp == null) {
+        throw new Error('slices.SortStableFunc: nil comparison function');
+    }
     if (s === null || s === undefined) {
         return;
     }
-    const sorted = s
-        .map((value, index) => ({ value, index }))
-        .sort((a, b) => {
-        const result = cmp(a.value, b.value);
-        if (result !== 0) {
-            return result;
-        }
-        return a.index - b.index;
-    });
-    for (let i = 0; i < sorted.length; i++) {
-        ;
-        s[i] = sorted[i].value;
-    }
+    ;
+    s.sort((a, b) => syncNumber(cmp(a, b)));
 }
 function clearValue(s) {
     if (s instanceof Uint8Array) {
@@ -359,11 +546,14 @@ function clearValue(s) {
  * @returns A tuple of [index, found] where index is the position and found indicates if target was found
  */
 export function BinarySearchFunc(x, target, cmp) {
+    if (cmp == null) {
+        throw new Error('slices.BinarySearchFunc: nil comparison function');
+    }
     let left = 0;
     let right = $.len(x);
     while (left < right) {
         const mid = Math.floor((left + right) / 2);
-        const result = cmp(x[mid], target);
+        const result = syncNumber(cmp(x[mid], target));
         if (result < 0) {
             left = mid + 1;
         }
@@ -376,4 +566,19 @@ export function BinarySearchFunc(x, target, cmp) {
     }
     return [left, false];
 }
+function syncNumber(value) {
+    if (value instanceof Promise) {
+        throw new Error('slices: asynchronous callback result is not supported');
+    }
+    return value;
+}
+function syncBoolean(value) {
+    if (value instanceof Promise) {
+        throw new Error('slices: asynchronous callback result is not supported');
+    }
+    return value;
+}
+export function BinarySearch(x, target) {
+    return BinarySearchFunc(x, target, cmp.Compare);
+}
 //# sourceMappingURL=slices.js.map