@e280/stz 0.0.0-8 → 0.0.0

package/s/pipe.ts

@@ -1,20 +1,19 @@
 
-export type PipeFun<I, O> = (input: I) => O
+export type Piper<I, O> = (input: I) => O
 
-export class Pipe<I> {
-
-	static with<I>(input: I) {
-		return new this(input)
-	}
+export function pipe<I>(input: I) {
+	return new Pipe(input)
+}
 
+export class Pipe<I> {
 	#input: I
 
 	constructor(input: I) {
 		this.#input = input
 	}
 
-	to<O>(fun: PipeFun<I, O>) {
-		return new Pipe(fun(this.#input))
+	to<O>(fn: Piper<I, O>) {
+		return new Pipe(fn(this.#input))
 	}
 
 	done() {

package/s/pubsub.ts

@@ -1,19 +1,35 @@
 
-import {deferPromise} from "./defer-promise.js"
+import {defer} from "./defer.js"
 
 export type Listener<A extends any[]> = (...a: A) => (void | Promise<void>)
 
 export interface Xub<A extends any[] = []> {
+
+	/** publish to all subscribed listeners. */
 	pub(...a: A): Promise<void>
+
+	/** subscribe a listener function. */
 	sub(fn: Listener<A>): () => void
-	once(): Promise<A>
+
+	/**
+	 * subscribe a listener function.
+	 * @alias sub
+	 */
+	on(fn: Listener<A>): () => void
+
+	/** wait for the next published value */
+	next(): Promise<A>
+
+	/** wipe all listeners attached to this. */
 	clear(): void
 }
 
+/** subscriber fn that can be published to. */
 export interface Sub<A extends any[] = []> extends Xub<A> {
 	(fn: Listener<A>): () => void
 }
 
+/** publisher fn that can be published to. */
 export interface Pub<A extends any[] = []> extends Xub<A> {
 	(...a: A): Promise<void>
 }
@@ -30,8 +46,8 @@ export function xub<A extends any[] = []>() {
 		await Promise.all([...set].map(fn => fn(...a)))
 	}
 
-	async function once() {
-		const {promise, resolve} = deferPromise<A>()
+	async function next() {
+		const {promise, resolve} = defer<A>()
 		const unsubscribe = sub((...a) => {
 			resolve(a)
 			unsubscribe()
@@ -45,12 +61,14 @@ export function xub<A extends any[] = []>() {
 
 	sub.pub = pub
 	sub.sub = sub
-	sub.once = once
+	sub.on = sub
+	sub.next = next
 	sub.clear = clear
 
 	pub.pub = pub
 	pub.sub = sub
-	pub.once = once
+	pub.on = sub
+	pub.next = next
 	pub.clear = clear
 
 	return [pub, sub] as [Pub<A>, Sub<A>]

package/s/queue/queue.test.ts

@@ -0,0 +1,67 @@
+
+import {Science, expect} from "@e280/science"
+
+import {nap} from "../nap.js"
+import {queue} from "./queue.js"
+
+export default Science.suite({
+	"job runs": Science.test(async() => {
+		let concurrent = 0
+		const job = queue(async() => {
+			concurrent++
+			await nap(100)
+			concurrent--
+		})
+		const promise1 = job()
+		await nap(50)
+		expect(concurrent).is(1)
+		await promise1
+		expect(concurrent).is(0)
+	}),
+
+	"sequencing is enforced": Science.test(async() => {
+		let concurrent = 0
+		const job = queue(async() => {
+			concurrent++
+			await nap(100)
+			concurrent--
+		})
+
+		const promise1 = job()
+		const promise2 = job()
+
+		await nap(50)
+		expect(concurrent).is(1)
+
+		await promise1
+		await nap(50)
+		expect(concurrent).is(1)
+
+		await promise2
+		expect(concurrent).is(0)
+	}),
+
+	"params and return values seem to work": Science.test(async() => {
+		const add = queue(async(a: number, b: number) => {
+			await nap(100)
+			return a + b
+		})
+		const promise1 = add(1, 2)
+		const promise2 = add(10, 20)
+		expect(await promise1).is(3)
+		expect(await promise2).is(30)
+	}),
+
+	"first job throws, second job unaffected": Science.test(async() => {
+		let run = 0
+		const job = queue(async() => {
+			run++
+			await nap(100)
+			if (run === 1)
+				throw new Error("first job failed")
+		})
+		expect(async() => job()).throwsAsync()
+		expect(async() => job()).not.throwsAsync()
+	}),
+})
+

package/s/queue/queue.ts

@@ -0,0 +1,21 @@
+
+/**
+ * create a job queue that ensures the given fn is always called in sequence (not concurrently).
+ */
+export function queue<Args extends any[], Result>(
+		fn: (...args: Args) => Promise<Result>
+	): (...args: Args) => Promise<Result> {
+
+	let last: Promise<any> = Promise.resolve()
+
+	return (...args: Args): Promise<Result> => {
+		const job = () => fn(...args)
+		const current = last.then(job)
+
+		// prevent unhandled rejection breaking the chain
+		last = current.catch(() => {})
+
+		return current
+	}
+}
+

package/s/repeat.ts

@@ -0,0 +1,25 @@
+
+/**
+ * repeat the given async function over and over.
+ *  - consider using `nap` in your fn to create a delay
+ */
+export function repeat(fn: (stop: () => void) => Promise<void>) {
+	let timeout: any
+	let stopped = false
+
+	const stop = () => {
+		stopped = true
+		clearTimeout(timeout)
+	}
+
+	const tick = async() => {
+		if (stopped) return
+		await fn(stop)
+		if (stopped) return
+		timeout = setTimeout(tick, 0)
+	}
+
+	tick()
+	return stop
+}
+

package/s/scope.ts

@@ -0,0 +1,108 @@
+
+import {Constructor} from "./constructor.js"
+
+export type Scoped<Item> = [item: Item, dispose: () => void]
+export type Disposable = {dispose(): void}
+
+export function scoped<Item>(item: Item, dispose: () => void) {
+	return [item, dispose] as Scoped<Item>
+}
+
+/**
+ * a trashcan you can fill with garbage, then call `scope.dispose()` to dump it all
+ *  - `add/stow/scoped` methods are for dealing with disposer fns
+ *  - `keep` methods are for dealing with disposable objects (with a dispose method)
+ *  - `sub` for creating nested sub-scopes
+ */
+export class Scope implements Disposable {
+	#disposers: (() => void)[] = []
+
+	/** add disposer fn */
+	add(dispose: () => void) {
+		this.#disposers.push(dispose)
+		return this
+	}
+
+	/** add disposer, return item */
+	stow<Item>(item: Item, dispose: () => void) {
+		this.add(dispose)
+		return item
+	}
+
+	/** add scoped disposer, return item */
+	scoped<Item>([item, dispose]: Scoped<Item>) {
+		this.add(dispose)
+		return item
+	}
+
+	/** add and return a disposable object */
+	keep<D extends Disposable>(disposable: D) {
+		this.add(() => disposable.dispose())
+		return disposable
+	}
+
+	/** wrap a fn, auto-add returned disposers */
+	scopedFn<Params extends any[], Item>(
+			fn: (...params: Params) => Scoped<Item>
+		) {
+		return (...a: Params) => {
+			const scoped = fn(...a)
+			return this.scoped(scoped)
+		}
+	}
+
+	/** wrap an async fn, auto-add returned disposers */
+	scopedFnAsync<Params extends any[], Item>(
+			fn: (...params: Params) => Promise<Scoped<Item>>
+		) {
+		return async(...a: Params) => {
+			const scoped = await fn(...a)
+			return this.scoped(scoped)
+		}
+	}
+
+	/** wrap a fn, auto-add returned disposables */
+	keepFn<Params extends any[], D extends Disposable>(
+			fn: (...params: Params) => D
+		) {
+		return (...a: Params) => {
+			const disposable = fn(...a)
+			return this.keep(disposable)
+		}
+	}
+
+	/** wrap an async fn, auto-add returned disposables */
+	keepFnAsync<Params extends any[], D extends Disposable>(
+			fn: (...params: Params) => Promise<D>
+		) {
+		return async(...a: Params) => {
+			const disposable = await fn(...a)
+			return this.keep(disposable)
+		}
+	}
+
+	/** wrap a constructor, auto-add returned disposables */
+	keepConstructor<C extends Constructor<Disposable>>(Ctor: C) {
+		const scope = this
+		return class extends Ctor {
+			constructor(...p: any[]) {
+				super(...p)
+				scope.keep(this)
+			}
+		} as C
+	}
+
+	/** create a subscope, child gets disposed when parent does */
+	sub() {
+		const subscope = new Scope()
+		return this.stow(subscope, () => subscope.dispose())
+	}
+
+	/** dispose everything in this scope, in reverse order */
+	dispose() {
+		for (const fn of this.#disposers.reverse())
+			fn()
+		this.#disposers = []
+	}
+}
+

package/s/templating.ts

@@ -0,0 +1,22 @@
+
+export type TemplateParts = {
+	strings: TemplateStringsArray
+	values: any[]
+}
+
+export function templateParts(
+		strings: TemplateStringsArray,
+		...values: any[]
+	): TemplateParts {
+
+	return {strings, values}
+}
+
+export function templateString(strings: TemplateStringsArray, ...values: any[]) {
+	const lastIndex = strings.length - 1
+	return strings
+		.slice(0, lastIndex)
+		.reduce((a, b, c) => a + b + values[c], "")
+			+ strings[lastIndex]
+}
+

package/s/tests.test.ts

@@ -1,17 +1,21 @@
 
 import {Science} from "@e280/science"
 
-import cloneTest from "./clone/clone.test.js"
-import badgeTest from "./data/bytename/badge.test.js"
-import debounceTest from "./debounce/debounce.test.js"
-import bytenameTest from "./data/bytename/bytename.test.js"
-import deepTest from "./deep/deep.test.js"
+import clone from "./clone/clone.test.js"
+import thumbprint from "./data/bytename/thumbprint.test.js"
+import debounce from "./debounce/debounce.test.js"
+import bytename from "./data/bytename/bytename.test.js"
+import deep from "./deep/deep.test.js"
+import data from "./data/data.test.js"
+import queue from "./queue/queue.test.js"
 
 await Science.run({
-	clone: cloneTest,
-	bytename: bytenameTest,
-	badge: badgeTest,
-	debounce: debounceTest,
-	deep: deepTest,
+	clone,
+	bytename,
+	thumbprint,
+	debounce,
+	deep,
+	data,
+	queue,
 })
 

package/s/time.ts

@@ -0,0 +1,22 @@
+
+export const Time = {
+	seconds: (n: number) => (n * 1000),
+	minutes: (n: number) => (n * Time.seconds(60)),
+	hours: (n: number) => (n * Time.minutes(60)),
+	days: (n: number) => (n * Time.hours(24)),
+
+	future: {
+		seconds: (n: number) => (Date.now() + Time.seconds(n)),
+		minutes: (n: number) => (Date.now() + Time.minutes(n)),
+		hours: (n: number) => (Date.now() + Time.hours(n)),
+		days: (n: number) => (Date.now() + Time.days(n)),
+	},
+
+	past: {
+		seconds: (n: number) => (Date.now() - Time.seconds(n)),
+		minutes: (n: number) => (Date.now() - Time.minutes(n)),
+		hours: (n: number) => (Date.now() - Time.hours(n)),
+		days: (n: number) => (Date.now() - Time.days(n)),
+	},
+}
+

package/x/coalesce.d.ts

@@ -1 +1,2 @@
+/** return a single function that calls all the provided functions */
 export declare function coalesce<A extends any[] = []>(...fns: ((...a: A) => void)[]): (...a: A) => void;

package/x/coalesce.js

@@ -1,3 +1,4 @@
+/** return a single function that calls all the provided functions */
 export function coalesce(...fns) {
     return (...a) => fns.forEach(fn => fn(...a));
 }

package/x/coalesce.js.map

@@ -1 +1 @@
-{"version":3,"file":"coalesce.js","sourceRoot":"","sources":["../s/coalesce.ts"],"names":[],"mappings":"AACA,MAAM,UAAU,QAAQ,CAAuB,GAAG,GAA0B;IAC3E,OAAO,CAAC,GAAG,CAAI,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;AAChD,CAAC"}
+{"version":3,"file":"coalesce.js","sourceRoot":"","sources":["../s/coalesce.ts"],"names":[],"mappings":"AACA,qEAAqE;AACrE,MAAM,UAAU,QAAQ,CAAuB,GAAG,GAA0B;IAC3E,OAAO,CAAC,GAAG,CAAI,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;AAChD,CAAC"}

package/x/constructor.d.ts

@@ -0,0 +1,3 @@
+export type Constructor<T extends {} = {}> = new (...args: any[]) => T;
+export type Ctor<Params extends any[] = any[], Instance extends {} = {}> = new (...params: Params) => Instance;
+export declare function denew<Params extends any[] = any[], Instance extends {} = {}>(C: Ctor<Params, Instance>): (...p: Params) => Instance;

package/x/constructor.js

@@ -0,0 +1,4 @@
+export function denew(C) {
+    return (...p) => new C(...p);
+}
+//# sourceMappingURL=constructor.js.map

package/x/constructor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constructor.js","sourceRoot":"","sources":["../s/constructor.ts"],"names":[],"mappings":"AAQA,MAAM,UAAU,KAAK,CAGlB,CAAyB;IAC3B,OAAO,CAAC,GAAG,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;AACrC,CAAC"}

package/x/data/base-x.d.ts

@@ -0,0 +1,47 @@
+export type Lexicon = {
+    characters: string;
+    negativePrefix?: string;
+    padding?: {
+        character: string;
+        size: number;
+    };
+};
+export declare class BaseX {
+    lexicon: Lexicon;
+    static lexicons: Readonly<{
+        base2: {
+            characters: string;
+        };
+        hex: {
+            characters: string;
+        };
+        base36: {
+            characters: string;
+        };
+        base58: {
+            characters: string;
+        };
+        base62: {
+            characters: string;
+        };
+        base64url: {
+            negativePrefix: string;
+            characters: string;
+        };
+        base64: {
+            characters: string;
+            padding: {
+                character: string;
+                size: number;
+            };
+        };
+    }>;
+    private lookup;
+    private negativePrefix;
+    constructor(lexicon: Lexicon);
+    toBytes(s: string): Uint8Array;
+    fromBytes(bytes: Uint8Array): string;
+    toInteger(s: string): number;
+    fromInteger(n: number): string;
+    random(count?: number): string;
+}

package/x/data/base-x.js

@@ -0,0 +1,147 @@
+import { Bytes } from "./bytes.js";
+export class BaseX {
+    lexicon;
+    static lexicons = Object.freeze({
+        base2: { characters: "01" },
+        hex: { characters: "0123456789abcdef" },
+        base36: { characters: "0123456789abcdefghijklmnopqrstuvwxyz" },
+        base58: { characters: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz" },
+        base62: { characters: "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" },
+        base64url: {
+            negativePrefix: "~",
+            characters: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_",
+        },
+        base64: {
+            characters: "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",
+            padding: { character: "=", size: 4 },
+        },
+    });
+    lookup;
+    negativePrefix;
+    constructor(lexicon) {
+        this.lexicon = lexicon;
+        this.lookup = Object.fromEntries([...lexicon.characters].map((char, i) => [char, i]));
+        this.negativePrefix = lexicon.negativePrefix ?? "-";
+    }
+    toBytes(s) {
+        const bitsPerChar = Math.log2(this.lexicon.characters.length);
+        if (Number.isInteger(bitsPerChar)) {
+            // Bitstream mode (for power-of-2 lexicons)
+            let bitBuffer = 0;
+            let bitCount = 0;
+            const output = [];
+            for (const char of s) {
+                if (char === this.lexicon.padding?.character)
+                    continue;
+                const val = this.lookup[char];
+                if (val === undefined)
+                    throw new Error(`Invalid character: ${char}`);
+                bitBuffer = (bitBuffer << bitsPerChar) | val;
+                bitCount += bitsPerChar;
+                while (bitCount >= 8) {
+                    bitCount -= 8;
+                    output.push((bitBuffer >> bitCount) & 0xFF);
+                }
+            }
+            return new Uint8Array(output);
+        }
+        // Radix mode fallback
+        let num = 0n;
+        const base = BigInt(this.lexicon.characters.length);
+        let negative = false;
+        if (s.startsWith(this.negativePrefix)) {
+            s = s.slice(this.negativePrefix.length);
+            negative = true;
+        }
+        for (const char of s) {
+            const val = this.lookup[char];
+            if (val === undefined)
+                throw new Error(`Invalid character: ${char}`);
+            num = num * base + BigInt(val);
+        }
+        const out = [];
+        while (num > 0n) {
+            out.unshift(Number(num % 256n));
+            num = num / 256n;
+        }
+        return new Uint8Array(out);
+    }
+    fromBytes(bytes) {
+        const bitsPerChar = Math.log2(this.lexicon.characters.length);
+        if (Number.isInteger(bitsPerChar)) {
+            // Bitstream mode (for power-of-2 lexicons)
+            let bitBuffer = 0;
+            let bitCount = 0;
+            let out = "";
+            for (const byte of bytes) {
+                bitBuffer = (bitBuffer << 8) | byte;
+                bitCount += 8;
+                while (bitCount >= bitsPerChar) {
+                    bitCount -= bitsPerChar;
+                    const index = (bitBuffer >> bitCount) & ((1 << bitsPerChar) - 1);
+                    out += this.lexicon.characters[index];
+                }
+            }
+            // 🩹 flush remaining bits
+            if (bitCount > 0) {
+                const index = (bitBuffer << (bitsPerChar - bitCount)) & ((1 << bitsPerChar) - 1);
+                out += this.lexicon.characters[index];
+            }
+            // Add padding if applicable
+            if (this.lexicon.padding) {
+                while (out.length % this.lexicon.padding.size !== 0)
+                    out += this.lexicon.padding.character;
+            }
+            return out;
+        }
+        // Radix mode fallback
+        let num = 0n;
+        for (const byte of bytes)
+            num = (num << 8n) + BigInt(byte);
+        if (num === 0n)
+            return this.lexicon.characters[0];
+        const base = BigInt(this.lexicon.characters.length);
+        let out = "";
+        while (num > 0n) {
+            out = this.lexicon.characters[Number(num % base)] + out;
+            num = num / base;
+        }
+        return out;
+    }
+    toInteger(s) {
+        if (!s)
+            return 0;
+        let n = 0n;
+        let negative = false;
+        const base = BigInt(this.lexicon.characters.length);
+        if (s.startsWith(this.negativePrefix)) {
+            s = s.slice(this.negativePrefix.length);
+            negative = true;
+        }
+        for (const char of s) {
+            const value = this.lookup[char];
+            if (value === undefined)
+                throw new Error(`Invalid character: ${char}`);
+            n = n * base + BigInt(value);
+        }
+        return Number(negative ? -n : n);
+    }
+    fromInteger(n) {
+        n = Math.floor(n);
+        const negative = n < 0;
+        let num = BigInt(negative ? -n : n);
+        if (num === 0n)
+            return this.lexicon.characters[0];
+        const base = BigInt(this.lexicon.characters.length);
+        let out = "";
+        while (num > 0n) {
+            out = this.lexicon.characters[Number(num % base)] + out;
+            num = num / base;
+        }
+        return negative ? `${this.negativePrefix}${out}` : out;
+    }
+    random(count = 32) {
+        return this.fromBytes(Bytes.random(count));
+    }
+}
+//# sourceMappingURL=base-x.js.map

package/x/data/base-x.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base-x.js","sourceRoot":"","sources":["../../s/data/base-x.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,KAAK,EAAC,MAAM,YAAY,CAAA;AAWhC,MAAM,OAAO,KAAK;IAoBE;IAnBnB,MAAM,CAAC,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC;QAC/B,KAAK,EAAE,EAAC,UAAU,EAAE,IAAI,EAAC;QACzB,GAAG,EAAE,EAAC,UAAU,EAAE,kBAAkB,EAAC;QACrC,MAAM,EAAE,EAAC,UAAU,EAAE,sCAAsC,EAAC;QAC5D,MAAM,EAAE,EAAC,UAAU,EAAE,4DAA4D,EAAC;QAClF,MAAM,EAAE,EAAC,UAAU,EAAE,gEAAgE,EAAC;QACtF,SAAS,EAAE;YACV,cAAc,EAAE,GAAG;YACnB,UAAU,EAAE,kEAAkE;SAC9E;QACD,MAAM,EAAE;YACP,UAAU,EAAE,kEAAkE;YAC9E,OAAO,EAAE,EAAC,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,EAAC;SAClC;KACD,CAAC,CAAA;IAEM,MAAM,CAAwB;IAC9B,cAAc,CAAQ;IAE9B,YAAmB,OAAgB;QAAhB,YAAO,GAAP,OAAO,CAAS;QAClC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,WAAW,CAC/B,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CACnD,CAAA;QACD,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,IAAI,GAAG,CAAA;IACpD,CAAC;IAED,OAAO,CAAC,CAAS;QAChB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;QAC7D,IAAI,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;YACnC,2CAA2C;YAC3C,IAAI,SAAS,GAAG,CAAC,CAAA;YACjB,IAAI,QAAQ,GAAG,CAAC,CAAA;YAChB,MAAM,MAAM,GAAa,EAAE,CAAA;YAE3B,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;gBACtB,IAAI,IAAI,KAAK,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,SAAS;oBAAE,SAAQ;gBACtD,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;gBAC7B,IAAI,GAAG,KAAK,SAAS;oBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,EAAE,CAAC,CAAA;gBACpE,SAAS,GAAG,CAAC,SAAS,IAAI,WAAW,CAAC,GAAG,GAAG,CAAA;gBAC5C,QAAQ,IAAI,WAAW,CAAA;gBAEvB,OAAO,QAAQ,IAAI,CAAC,EAAE,CAAC;oBACtB,QAAQ,IAAI,CAAC,CAAA;oBACb,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,IAAI,QAAQ,CAAC,GAAG,IAAI,CAAC,CAAA;gBAC5C,CAAC;YACF,CAAC;YAED,OAAO,IAAI,UAAU,CAAC,MAAM,CAAC,CAAA;QAC9B,CAAC;QAED,sBAAsB;QACtB,IAAI,GAAG,GAAG,EAAE,CAAA;QACZ,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;QACnD,IAAI,QAAQ,GAAG,KAAK,CAAA;QACpB,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC;YACvC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;YACvC,QAAQ,GAAG,IAAI,CAAA;QAChB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC7B,IAAI,GAAG,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,EAAE,CAAC,CAAA;YACpE,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAA;QAC/B,CAAC;QACD,MAAM,GAAG,GAAa,EAAE,CAAA;QACxB,OAAO,GAAG,GAAG,EAAE,EAAE,CAAC;YACjB,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,CAAA;YAC/B,GAAG,GAAG,GAAG,GAAG,IAAI,CAAA;QACjB,CAAC;QACD,OAAO,IAAI,UAAU,CAAC,GAAG,CAAC,CAAA;IAC3B,CAAC;IAED,SAAS,CAAC,KAAiB;QAC1B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;QAC7D,IAAI,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;YACnC,2CAA2C;YAC3C,IAAI,SAAS,GAAG,CAAC,CAAA;YACjB,IAAI,QAAQ,GAAG,CAAC,CAAA;YAChB,IAAI,GAAG,GAAG,EAAE,CAAA;YAEZ,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBAC1B,SAAS,GAAG,CAAC,SAAS,IAAI,CAAC,CAAC,GAAG,IAAI,CAAA;gBACnC,QAAQ,IAAI,CAAC,CAAA;gBAEb,OAAO,QAAQ,IAAI,WAAW,EAAE,CAAC;oBAChC,QAAQ,IAAI,WAAW,CAAA;oBACvB,MAAM,KAAK,GAAG,CAAC,SAAS,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAA;oBAChE,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;gBACtC,CAAC;YACF,CAAC;YAED,0BAA0B;YAC1B,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;gBAClB,MAAM,KAAK,GAAG,CAAC,SAAS,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,CAAA;gBAChF,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;YACtC,CAAC;YAED,4BAA4B;YAC5B,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;gBAC1B,OAAO,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC;oBAClD,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,SAAS,CAAA;YACvC,CAAC;YAED,OAAO,GAAG,CAAA;QACX,CAAC;QAED,sBAAsB;QACtB,IAAI,GAAG,GAAG,EAAE,CAAA;QACZ,KAAK,MAAM,IAAI,IAAI,KAAK;YACvB,GAAG,GAAG,CAAC,GAAG,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAA;QAEjC,IAAI,GAAG,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;QAEjD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;QACnD,IAAI,GAAG,GAAG,EAAE,CAAA;QACZ,OAAO,GAAG,GAAG,EAAE,EAAE,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAA;YACvD,GAAG,GAAG,GAAG,GAAG,IAAI,CAAA;QACjB,CAAC;QACD,OAAO,GAAG,CAAA;IACX,CAAC;IAED,SAAS,CAAC,CAAS;QAClB,IAAI,CAAC,CAAC;YAAE,OAAO,CAAC,CAAA;QAChB,IAAI,CAAC,GAAG,EAAE,CAAA;QACV,IAAI,QAAQ,GAAG,KAAK,CAAA;QACpB,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;QACnD,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC;YACvC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;YACvC,QAAQ,GAAG,IAAI,CAAA;QAChB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC/B,IAAI,KAAK,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,EAAE,CAAC,CAAA;YACtE,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAA;QAC7B,CAAC;QACD,OAAO,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACjC,CAAC;IAED,WAAW,CAAC,CAAS;QACpB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;QACjB,MAAM,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAA;QACtB,IAAI,GAAG,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACnC,IAAI,GAAG,KAAK,EAAE;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;QACjD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,CAAA;QACnD,IAAI,GAAG,GAAG,EAAE,CAAA;QACZ,OAAO,GAAG,GAAG,EAAE,EAAE,CAAC;YACjB,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAA;YACvD,GAAG,GAAG,GAAG,GAAG,IAAI,CAAA;QACjB,CAAC;QACD,OAAO,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,cAAc,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAA;IACvD,CAAC;IAED,MAAM,CAAC,KAAK,GAAG,EAAE;QAChB,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAA;IAC3C,CAAC"}

package/x/data/base58.d.ts

@@ -1,5 +1,9 @@
 export declare const Base58: Readonly<{
+    fromBytes(bytes: Uint8Array): string;
+    toBytes(string: string): Uint8Array<ArrayBuffer>;
+    random(count?: number): string;
+    /** @deprecated renamed to `fromBytes` */
     string(bytes: Uint8Array): string;
+    /** @deprecated renamed to `toBytes` */
     bytes(string: string): Uint8Array<ArrayBuffer>;
-    random(count?: number): string;
 }>;