goscript 0.0.39 → 0.0.40

package/dist/gs/sort/sort.gs.js

@@ -0,0 +1,203 @@
+import * as $ from '../builtin/builtin.js';
+// IntSlice type for sorting integers
+export class IntSlice {
+    _value;
+    constructor(_value) {
+        this._value = _value;
+    }
+    Len() {
+        return $.len(this._value);
+    }
+    Less(i, j) {
+        return $.index(this._value, i) < $.index(this._value, j);
+    }
+    Swap(i, j) {
+        const temp = $.index(this._value, i);
+        if (Array.isArray(this._value)) {
+            this._value[i] = $.index(this._value, j);
+            this._value[j] = temp;
+        }
+        else if (this._value && typeof this._value === 'object' && '__meta__' in this._value) {
+            const meta = this._value.__meta__;
+            const backing = meta.backing;
+            backing[meta.offset + i] = $.index(this._value, j);
+            backing[meta.offset + j] = temp;
+        }
+    }
+}
+// Float64Slice type for sorting float64s
+export class Float64Slice {
+    _value;
+    constructor(_value) {
+        this._value = _value;
+    }
+    Len() {
+        return $.len(this._value);
+    }
+    Less(i, j) {
+        return $.index(this._value, i) < $.index(this._value, j);
+    }
+    Swap(i, j) {
+        const temp = $.index(this._value, i);
+        if (Array.isArray(this._value)) {
+            this._value[i] = $.index(this._value, j);
+            this._value[j] = temp;
+        }
+        else if (this._value && typeof this._value === 'object' && '__meta__' in this._value) {
+            const meta = this._value.__meta__;
+            const backing = meta.backing;
+            backing[meta.offset + i] = $.index(this._value, j);
+            backing[meta.offset + j] = temp;
+        }
+    }
+}
+// StringSlice type for sorting strings
+export class StringSlice {
+    _value;
+    constructor(_value) {
+        this._value = _value;
+    }
+    Len() {
+        return $.len(this._value);
+    }
+    Less(i, j) {
+        return $.index(this._value, i) < $.index(this._value, j);
+    }
+    Swap(i, j) {
+        const temp = $.index(this._value, i);
+        if (Array.isArray(this._value)) {
+            this._value[i] = $.index(this._value, j);
+            this._value[j] = temp;
+        }
+        else if (this._value && typeof this._value === 'object' && '__meta__' in this._value) {
+            const meta = this._value.__meta__;
+            const backing = meta.backing;
+            backing[meta.offset + i] = $.index(this._value, j);
+            backing[meta.offset + j] = temp;
+        }
+    }
+}
+// Sort sorts data in ascending order as determined by the Less method
+export function Sort(data) {
+    // Use a simple insertion sort for now - can be optimized later
+    const n = data.Len();
+    for (let i = 1; i < n; i++) {
+        for (let j = i; j > 0 && data.Less(j, j - 1); j--) {
+            data.Swap(j, j - 1);
+        }
+    }
+}
+// Stable sorts data while keeping the original order of equal elements
+export function Stable(data) {
+    // For simplicity, use the same sort - can be improved later
+    Sort(data);
+}
+// IsSorted reports whether data is sorted
+export function IsSorted(data) {
+    const n = data.Len();
+    for (let i = n - 1; i > 0; i--) {
+        if (data.Less(i, i - 1)) {
+            return false;
+        }
+    }
+    return true;
+}
+// Reverse returns the reverse order for data
+export function Reverse(data) {
+    return {
+        Len: () => data.Len(),
+        Less: (i, j) => data.Less(j, i),
+        Swap: (i, j) => data.Swap(i, j)
+    };
+}
+// Helper function to swap elements in a slice
+function swapInSlice(slice, i, j) {
+    if (!slice)
+        return;
+    const temp = $.index(slice, i);
+    if (Array.isArray(slice)) {
+        const val_j = $.index(slice, j);
+        const val_i = temp;
+        slice[i] = val_j;
+        slice[j] = val_i;
+    }
+    else if (typeof slice === 'object' && '__meta__' in slice) {
+        const meta = slice.__meta__;
+        const backing = meta.backing;
+        backing[meta.offset + i] = $.index(slice, j);
+        backing[meta.offset + j] = temp;
+    }
+}
+// Ints sorts a slice of ints in increasing order
+export function Ints(x) {
+    if (!x)
+        return;
+    const n = $.len(x);
+    // Simple insertion sort
+    for (let i = 1; i < n; i++) {
+        for (let j = i; j > 0 && $.index(x, j) < $.index(x, j - 1); j--) {
+            swapInSlice(x, j, j - 1);
+        }
+    }
+}
+// IntsAreSorted reports whether the slice x is sorted in increasing order
+export function IntsAreSorted(x) {
+    if (!x)
+        return true;
+    const n = $.len(x);
+    for (let i = n - 1; i > 0; i--) {
+        if ($.index(x, i) < $.index(x, i - 1)) {
+            return false;
+        }
+    }
+    return true;
+}
+// Float64s sorts a slice of float64s in increasing order
+export function Float64s(x) {
+    if (!x)
+        return;
+    const n = $.len(x);
+    // Simple insertion sort
+    for (let i = 1; i < n; i++) {
+        for (let j = i; j > 0 && $.index(x, j) < $.index(x, j - 1); j--) {
+            swapInSlice(x, j, j - 1);
+        }
+    }
+}
+// Float64sAreSorted reports whether the slice x is sorted in increasing order
+export function Float64sAreSorted(x) {
+    if (!x)
+        return true;
+    const n = $.len(x);
+    for (let i = n - 1; i > 0; i--) {
+        if ($.index(x, i) < $.index(x, i - 1)) {
+            return false;
+        }
+    }
+    return true;
+}
+// Strings sorts a slice of strings in increasing order
+export function Strings(x) {
+    if (!x)
+        return;
+    const n = $.len(x);
+    // Simple insertion sort
+    for (let i = 1; i < n; i++) {
+        for (let j = i; j > 0 && $.index(x, j) < $.index(x, j - 1); j--) {
+            swapInSlice(x, j, j - 1);
+        }
+    }
+}
+// StringsAreSorted reports whether the slice x is sorted in increasing order
+export function StringsAreSorted(x) {
+    if (!x)
+        return true;
+    const n = $.len(x);
+    for (let i = n - 1; i > 0; i--) {
+        if ($.index(x, i) < $.index(x, i - 1)) {
+            return false;
+        }
+    }
+    return true;
+}
+//# sourceMappingURL=sort.gs.js.map

package/dist/gs/sort/sort.gs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sort.gs.js","sourceRoot":"","sources":["../../../gs/sort/sort.gs.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,CAAC,MAAM,uBAAuB,CAAA;AAiB1C,qCAAqC;AACrC,MAAM,OAAO,QAAQ;IACC;IAApB,YAAoB,MAAuB;QAAvB,WAAM,GAAN,MAAM,CAAiB;IAAG,CAAC;IAE/C,GAAG;QACD,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC3B,CAAC;IAED,IAAI,CAAC,CAAS,EAAE,CAAS;QACvB,OAAQ,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAY,GAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAY,CAAA;IAClF,CAAC;IAED,IAAI,CAAC,CAAS,EAAE,CAAS;QACvB,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAW,CAAA;QAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAW,CAAA;YAClD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QACvB,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvF,MAAM,IAAI,GAAI,IAAI,CAAC,MAAc,CAAC,QAAiC,CAAA;YACnE,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAA;YAC5B,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAW,CAAA;YAC5D,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;QACjC,CAAC;IACH,CAAC;CACF;AAED,yCAAyC;AACzC,MAAM,OAAO,YAAY;IACH;IAApB,YAAoB,MAAuB;QAAvB,WAAM,GAAN,MAAM,CAAiB;IAAG,CAAC;IAE/C,GAAG;QACD,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC3B,CAAC;IAED,IAAI,CAAC,CAAS,EAAE,CAAS;QACvB,OAAQ,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAY,GAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAY,CAAA;IAClF,CAAC;IAED,IAAI,CAAC,CAAS,EAAE,CAAS;QACvB,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAW,CAAA;QAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAW,CAAA;YAClD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QACvB,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvF,MAAM,IAAI,GAAI,IAAI,CAAC,MAAc,CAAC,QAAiC,CAAA;YACnE,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAA;YAC5B,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAW,CAAA;YAC5D,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;QACjC,CAAC;IACH,CAAC;CACF;AAED,uCAAuC;AACvC,MAAM,OAAO,WAAW;IACF;IAApB,YAAoB,MAAuB;QAAvB,WAAM,GAAN,MAAM,CAAiB;IAAG,CAAC;IAE/C,GAAG;QACD,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC3B,CAAC;IAED,IAAI,CAAC,CAAS,EAAE,CAAS;QACvB,OAAQ,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAY,GAAI,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAY,CAAA;IAClF,CAAC;IAED,IAAI,CAAC,CAAS,EAAE,CAAS;QACvB,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAW,CAAA;QAC9C,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAW,CAAA;YAClD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QACvB,CAAC;aAAM,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,UAAU,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACvF,MAAM,IAAI,GAAI,IAAI,CAAC,MAAc,CAAC,QAAiC,CAAA;YACnE,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAA;YAC5B,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAW,CAAA;YAC5D,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAA;QACjC,CAAC;IACH,CAAC;CACF;AAED,sEAAsE;AACtE,MAAM,UAAU,IAAI,CAAC,IAAe;IAClC,+DAA+D;IAC/D,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QACrB,CAAC;IACH,CAAC;AACH,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,MAAM,CAAC,IAAe;IACpC,4DAA4D;IAC5D,IAAI,CAAC,IAAI,CAAC,CAAA;AACZ,CAAC;AAED,0CAA0C;AAC1C,MAAM,UAAU,QAAQ,CAAC,IAAe;IACtC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAA;IACpB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YACxB,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,OAAO,CAAC,IAAe;IACrC,OAAO;QACL,GAAG,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE;QACrB,IAAI,EAAE,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/C,IAAI,EAAE,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;KAChD,CAAA;AACH,CAAC;AAED,8CAA8C;AAC9C,SAAS,WAAW,CAAI,KAAiB,EAAE,CAAS,EAAE,CAAS;IAC7D,IAAI,CAAC,KAAK;QAAE,OAAM;IAElB,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IAC9B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAA;QAClB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAU,CAAA;QACrB,KAAK,CAAC,CAAC,CAAC,GAAG,KAAU,CAAA;IACvB,CAAC;SAAM,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,UAAU,IAAI,KAAK,EAAE,CAAC;QAC5D,MAAM,IAAI,GAAI,KAAa,CAAC,QAA4B,CAAA;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAA;QAC5B,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAM,CAAA;QACjD,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAS,CAAA;IACtC,CAAC;AACH,CAAC;AAED,iDAAiD;AACjD,MAAM,UAAU,IAAI,CAAC,CAAkB;IACrC,IAAI,CAAC,CAAC;QAAE,OAAM;IAEd,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAClB,wBAAwB;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAY,GAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YACxF,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,CAAC;IACH,CAAC;AACH,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,aAAa,CAAC,CAAkB;IAC9C,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAA;IAEnB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAY,GAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAY,EAAE,CAAC;YAC9D,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,yDAAyD;AACzD,MAAM,UAAU,QAAQ,CAAC,CAAkB;IACzC,IAAI,CAAC,CAAC;QAAE,OAAM;IAEd,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAClB,wBAAwB;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAY,GAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YACxF,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,CAAC;IACH,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,MAAM,UAAU,iBAAiB,CAAC,CAAkB;IAClD,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAA;IAEnB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAY,GAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAY,EAAE,CAAC;YAC9D,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,uDAAuD;AACvD,MAAM,UAAU,OAAO,CAAC,CAAkB;IACxC,IAAI,CAAC,CAAC;QAAE,OAAM;IAEd,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAClB,wBAAwB;IACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,IAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAY,GAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAY,EAAE,CAAC,EAAE,EAAE,CAAC;YACxF,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAA;QAC1B,CAAC;IACH,CAAC;AACH,CAAC;AAED,6EAA6E;AAC7E,MAAM,UAAU,gBAAgB,CAAC,CAAkB;IACjD,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAA;IAEnB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAClB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAY,GAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAY,EAAE,CAAC;YAC9D,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC"}

package/gs/builtin/builtin.ts

@@ -422,6 +422,23 @@ export function max(a: number, b: number): number {
   return Math.max(a, b)
 }
 
+/**
+ * Converts a rune (number) or string to a string.
+ * This is used to replace String.fromCharCode() in Go string(rune) conversions.
+ * Since sometimes single-char rune literals are compiled to strings, this function
+ * needs to handle both numbers (runes) and strings.
+ * 
+ * @param runeOrString A rune (Unicode code point as number) or a string
+ * @returns The resulting string
+ */
+export function runeOrStringToString(runeOrString: number | string): string {
+  if (typeof runeOrString === 'string') {
+    return runeOrString
+  }
+  // For numbers, use String.fromCharCode to convert the rune to a string
+  return String.fromCharCode(runeOrString)
+}
+
 // Panic recovery function (simplified implementation)
 export function recover(): any {
   // In a real implementation, this would interact with Go's panic/recover mechanism

package/gs/builtin/slice.ts

@@ -192,6 +192,11 @@ export const makeSlice = <T>(
   // The rest of backingArr (from length to actualCapacity-1) remains uninitialized (undefined),
   // representing available capacity.
 
+  // OPTIMIZATION: If length equals capacity, return backing array directly
+  if (length === actualCapacity) {
+    return backingArr as Slice<T>
+  }
+
   // The proxyTargetArray serves as the shell for the proxy.
   // Its elements up to 'length' should reflect the initialized part of the slice.
   const proxyTargetArray = new Array<T>(length)
@@ -252,7 +257,7 @@ export const makeSlice = <T>(
     },
   }
 
-  return new Proxy(proxy, handler) as Slice<T>
+  return new Proxy(proxy, handler) as unknown as SliceProxy<T>
 }
 
 /**
@@ -454,6 +459,11 @@ export const goSlice = <T>( // T can be number for Uint8Array case
   const newLength = high - low
   const newOffset = oldOffset + low
 
+  // OPTIMIZATION: If the result would have offset=0 and length=capacity, return backing directly
+  if (newOffset === 0 && newLength === newCap) {
+    return backing as Slice<T>
+  }
+
   // Create an array-like target with the correct length
   const proxyTargetArray = new Array<T>(newLength)
   // Note: We don't need to initialize the values here since the proxy handler
@@ -487,6 +497,12 @@ export const arrayToSlice = <T>(
 
   if (arr.length === 0) return arr
 
+  // OPTIMIZATION: For arrays where offset=0 and length=capacity, return the array directly
+  // if we're not doing deep conversion
+  if (depth === 1) {
+    return arr as Slice<T>
+  }
+
   const target = {
     __meta__: {
       backing: arr,

package/gs/bytes/bytes.gs.ts

@@ -488,8 +488,36 @@ export function HasSuffix(s: $.Bytes, suffix: $.Bytes): boolean {
 // dropped from the byte slice with no replacement. The characters in s and the
 // output are interpreted as UTF-8-encoded code points.
 export function Map(mapping: ((r: number) => number) | null, s: $.Bytes): $.Bytes {
-	// TODO: Implement Map function with proper UTF-8 handling
-	throw new Error("Map: not implemented")
+	if (s === null || $.len(s) === 0 || mapping === null) {
+		return s === null ? null : new Uint8Array(0)
+	}
+	
+	const result: number[] = []
+	
+	for (let i = 0; i < $.len(s); ) {
+		const [r, size] = utf8.DecodeRune($.goSlice(s, i, undefined))
+		if (size <= 0) {
+			// Invalid UTF-8, copy the byte as-is
+			result.push(s![i])
+			i++
+		} else {
+			const mappedR = mapping(r)
+			if (mappedR >= 0) {
+				// Encode the mapped rune back to bytes
+				const runeBytes = new Uint8Array(utf8.UTFMax)
+				const n = utf8.EncodeRune(runeBytes, mappedR)
+				
+				// Add the encoded bytes to result
+				for (let j = 0; j < n; j++) {
+					result.push(runeBytes[j])
+				}
+			}
+			
+			i += size
+		}
+	}
+	
+	return new Uint8Array(result)
 }
 
 // Repeat returns a new byte slice consisting of count copies of b.
@@ -607,29 +635,51 @@ export function ToTitle(s: $.Bytes): $.Bytes {
 // ToUpperSpecial treats s as UTF-8-encoded bytes and returns a copy with all the Unicode letters mapped to their
 // upper case, giving priority to the special casing rules.
 export function ToUpperSpecial(c: unicode.SpecialCase, s: $.Bytes): $.Bytes {
-	// TODO: Fix SpecialCase method calls
-	throw new Error("ToUpperSpecial: not implemented")
+	// For now, ignore special case and fall back to regular ToUpper
+	return ToUpper(s)
 }
 
 // ToLowerSpecial treats s as UTF-8-encoded bytes and returns a copy with all the Unicode letters mapped to their
 // lower case, giving priority to the special casing rules.
 export function ToLowerSpecial(c: unicode.SpecialCase, s: $.Bytes): $.Bytes {
-	// TODO: Fix SpecialCase method calls
-	throw new Error("ToLowerSpecial: not implemented")
+	// For now, ignore special case and fall back to regular ToLower
+	return ToLower(s)
 }
 
 // ToTitleSpecial treats s as UTF-8-encoded bytes and returns a copy with all the Unicode letters mapped to their
 // title case, giving priority to the special casing rules.
 export function ToTitleSpecial(c: unicode.SpecialCase, s: $.Bytes): $.Bytes {
-	// TODO: Fix SpecialCase method calls
-	throw new Error("ToTitleSpecial: not implemented")
+	// For now, ignore special case and fall back to regular ToTitle
+	return ToTitle(s)
 }
 
 // ToValidUTF8 treats s as UTF-8-encoded bytes and returns a copy with each run of bytes
 // representing invalid UTF-8 replaced with the bytes in replacement, which may be empty.
 export function ToValidUTF8(s: $.Bytes, replacement: $.Bytes): $.Bytes {
-	// TODO: Implement ToValidUTF8 with proper UTF-8 validation
-	throw new Error("ToValidUTF8: not implemented")
+	if (s === null || $.len(s) === 0) {
+		return s === null ? null : new Uint8Array(0)
+	}
+	
+	const result: number[] = []
+	const replacementArr = replacement ? $.bytesToArray(replacement) : []
+	
+	for (let i = 0; i < $.len(s); ) {
+		const [r, size] = utf8.DecodeRune($.goSlice(s, i, undefined))
+		if (size <= 0 || r === utf8.RuneError) {
+			// Invalid UTF-8, replace with replacement bytes
+			for (const b of replacementArr) {
+				result.push(b)
+			}
+			i++
+		} else {
+			for (let j = 0; j < size; j++) {
+				result.push(s![i + j])
+			}
+			i += size
+		}
+	}
+	
+	return new Uint8Array(result)
 }
 
 // isSeparator reports whether the rune could mark a word boundary.
@@ -659,8 +709,41 @@ export function isSeparator(r: number): boolean {
 // Deprecated: The rule Title uses for word boundaries does not handle Unicode
 // punctuation properly. Use golang.org/x/text/cases instead.
 export function Title(s: $.Bytes): $.Bytes {
-	// TODO: Implement Title function properly
-	throw new Error("Title: not implemented")
+	if (s === null || $.len(s) === 0) {
+		return s === null ? null : new Uint8Array(0)
+	}
+	
+	const result: number[] = []
+	let prevIsSep = true  // Start of string counts as separator
+	
+	for (let i = 0; i < $.len(s); ) {
+		const [r, size] = utf8.DecodeRune($.goSlice(s, i, undefined))
+		if (size <= 0) {
+			// Invalid UTF-8, copy the byte as-is
+			result.push(s![i])
+			i++
+			prevIsSep = true
+		} else {
+			let transformedR = r
+			if (prevIsSep && unicode.IsLetter(r)) {
+				transformedR = unicode.ToTitle(r)
+			}
+			
+			// Encode the (possibly transformed) rune back to bytes
+			const runeBytes = new Uint8Array(utf8.UTFMax)
+			const n = utf8.EncodeRune(runeBytes, transformedR)
+			
+			// Add the encoded bytes to result
+			for (let j = 0; j < n; j++) {
+				result.push(runeBytes[j])
+			}
+			
+			prevIsSep = isSeparator(r)
+			i += size
+		}
+	}
+	
+	return new Uint8Array(result)
 }
 
 // TrimLeftFunc treats s as UTF-8-encoded bytes and returns a subslice of s by slicing off
@@ -1119,8 +1202,33 @@ export function ReplaceAll(s: $.Bytes, old: $.Bytes, _new: $.Bytes): $.Bytes {
 // are equal under simple Unicode case-folding, which is a more general
 // form of case-insensitivity.
 export function EqualFold(s: $.Bytes, t: $.Bytes): boolean {
-	// TODO: Implement EqualFold function properly (complex Unicode folding logic)
-	throw new Error("EqualFold: not implemented")
+	if (s === null && t === null) return true
+	if (s === null || t === null) return false
+	
+	let si = 0, ti = 0
+	
+	while (si < $.len(s) && ti < $.len(t)) {
+		const [sr, ssize] = utf8.DecodeRune($.goSlice(s, si, undefined))
+		const [tr, tsize] = utf8.DecodeRune($.goSlice(t, ti, undefined))
+		
+		if (ssize <= 0 || tsize <= 0) {
+			// Invalid UTF-8, fall back to byte comparison
+			if (s![si] !== t![ti]) return false
+			si++
+			ti++
+		} else {
+			// Convert both to lowercase for comparison
+			const sLower = unicode.ToLower(sr)
+			const tLower = unicode.ToLower(tr)
+			
+			if (sLower !== tLower) return false
+			
+			si += ssize
+			ti += tsize
+		}
+	}
+	
+	return si === $.len(s) && ti === $.len(t)
 }
 
 // Index returns the index of the first instance of sep in s, or -1 if sep is not present in s.

package/gs/bytes/metadata.go

@@ -0,0 +1,12 @@
+package bytes
+
+// GsDependencies lists the import paths that this gs/ package requires
+// These dependencies will be automatically copied when this package is included
+var GsDependencies = []string{
+	"errors",
+	"io",
+	"iter",
+	"unicode",
+	"unicode/utf8",
+	"unsafe",
+}