@dbx-tools/shared-core 0.3.21 → 0.3.22

package/README.md

@@ -7,17 +7,7 @@ browsers, workers, CLIs, and shared schema packages. Modules are exported as
 namespaces so call sites stay explicit:
 
 ```ts
-import {
-  async,
-  error,
-  hash,
-  http,
-  log,
-  net,
-  object,
-  brand,
-  string,
-} from "@dbx-tools/shared-core";
+import { async, error, hash, http, log, net, object, brand, string } from "@dbx-tools/shared-core";
 ```
 
 Node-only helpers live in [`@dbx-tools/core`](../../node/core). AppKit and

package/package.json

@@ -22,7 +22,7 @@
   "publishConfig": {
     "access": "public"
   },
-  "version": "0.3.21",
+  "version": "0.3.22",
   "types": "index.ts",
   "type": "module",
   "exports": {

package/src/async.ts

@@ -152,7 +152,9 @@ export async function* poll<T, A = Record<string, unknown>>(
       if (options.filter) {
         if (options.filter === "distinct") {
           if (deepEqual(previous, value)) continue;
-        } else if (!(await options.filter(value, ctx))) continue;
+        } else if (!(await options.filter(value, ctx))) {
+          continue;
+        }
       }
       yield value;
       if (predicate && !(await predicate(value, ctx))) return;
@@ -170,8 +172,9 @@ export async function* poll<T, A = Record<string, unknown>>(
  * parent (so a fetch-level cancel doesn't tear down the main poll loop).
  */
 export function tieAbortSignal(child: AbortController, parent?: AbortSignal): void {
-  if (!parent) return;
-  else if (parent.aborted) {
+  if (!parent) {
+    return;
+  } else if (parent.aborted) {
     child.abort(parent.reason);
     return;
   }

package/src/hash.ts

@@ -215,8 +215,9 @@ const BASE32_ALPHABET = "0123456789abcdefghjkmnpqrstvwxyz";
  * fail fast instead of producing silently-degraded encodings.
  */
 function base32Alphabet(alphabet?: string): string {
-  if (alphabet === undefined) return BASE32_ALPHABET;
-  else if (new Set(alphabet).size !== 32) {
+  if (alphabet === undefined) {
+    return BASE32_ALPHABET;
+  } else if (new Set(alphabet).size !== 32) {
     throw new Error("Base32 alphabet must contain 32 unique characters");
   }
   return alphabet;

package/src/log.ts

@@ -126,9 +126,8 @@ type LoggerFactory = (name?: string) => Logger;
  * resolved factory (or the one resolved `undefined`). A rejection is evicted
  * by {@link memoize} so a later call retries.
  */
-const createConsolaLoggerFactory = memoize(
-  async (): Promise<LoggerFactory | undefined> => {
-    const consolaDisabled = toBoolean(globalProcess?.env?.LOG_CONSOLA_DISABLED);
+const createConsolaLoggerFactory = memoize(async (): Promise<LoggerFactory | undefined> => {
+  const consolaDisabled = toBoolean(globalProcess?.env?.LOG_CONSOLA_DISABLED);
   if (!consolaDisabled) {
     try {
       const { consola, createConsola, LogLevels } = await import(/* @vite-ignore */ "consola");
@@ -264,8 +263,7 @@ async function createConsoleLoggerFactory(globalProcessStdErr: any): Promise<Log
  */
 const createLogger: LoggerFactory = await (async () => {
   return (
-    (await createConsolaLoggerFactory()) ??
-    (await createConsoleLoggerFactory(globalProcessStdErr))
+    (await createConsolaLoggerFactory()) ?? (await createConsoleLoggerFactory(globalProcessStdErr))
   );
 })();
 
@@ -320,8 +318,9 @@ function parseLogLevel(raw: unknown): LogLevel | undefined {
       if (text === normalized) break;
       text = normalized;
     }
-    if (!text) break;
-    else if (text in LOG_LEVEL_RANK) {
+    if (!text) {
+      break;
+    } else if (text in LOG_LEVEL_RANK) {
       return text as LogLevel;
     }
   }

package/src/net.ts

@@ -127,9 +127,7 @@ class UrlBuilderImpl extends URL {
    * arrays; each is trimmed of boundary slashes and blanks are dropped.
    */
   withPathReplace(...pathSegments: (string | string[])[]): UrlBuilder {
-    const pathnameParts: string[] = [...pathSegments].flatMap((p) =>
-      Array.isArray(p) ? p : [p],
-    );
+    const pathnameParts: string[] = [...pathSegments].flatMap((p) => (Array.isArray(p) ? p : [p]));
     const pathname = pathnameParts
       .map((p) => p.replace(URL_PATH_SEGMENT_TRIM, ""))
       .filter(Boolean)
@@ -242,8 +240,8 @@ export function pathMatch(input: UrlLike, path: string): boolean {
 function defaultUrl(): URL {
   // Reach `window` via `globalThis` so this compiles without the DOM
   // lib (it's `undefined` on the server / in workers without one).
-  const origin = (globalThis as { window?: { location?: { origin?: string } } }).window
-    ?.location?.origin;
+  const origin = (globalThis as { window?: { location?: { origin?: string } } }).window?.location
+    ?.origin;
   if (origin && origin !== "null") {
     const originUrl = parseUrl(origin);
     if (originUrl) {
@@ -257,7 +255,7 @@ function parseUrl(input: string): URL | null {
   if (input && input.includes(URL_SCHEME_SEPARATOR)) {
     try {
       return new URL(input);
-    } catch { }
+    } catch {}
   }
   return null;
 }

package/src/object.ts

@@ -19,7 +19,6 @@
 /** Lazy sequence over iterable source(s). See {@link sequence}. */
 export type Sequence<T> = SequenceImpl<T>;
 
-
 type SequenceSource<T> = Iterable<T> | ReadonlyMap<unknown, T> | OneOrMany<T> | null | undefined;
 
 /**
@@ -58,9 +57,6 @@ type GroupValue<T, P> = P extends (value: any, ...rest: any[]) => value is infer
 /** A map of group name -> predicate, as accepted by {@link group}. */
 type GroupPredicates<T> = Record<string, (value: T, index: number) => boolean>;
 
-
-
-
 /**
  * Type guard for a {@link Collection}: an {@link Array}, {@link Set}, or
  * {@link Map}. Narrows `value` so its element/value type is treated as `T`.
@@ -84,19 +80,17 @@ export function isEmpty(
   collection: Collection<unknown> | Record<string, unknown>,
   options?: { recursive?: boolean },
 ): boolean {
-
   function visit(value: unknown, seen?: Set<unknown>): boolean {
-    if (value == null) return true;
-    else if (typeof value === "object") {
+    if (value == null) {
+      return true;
+    } else if (typeof value === "object") {
       if (seen?.has(value)) return true;
       seen?.add(value);
       if (Array.isArray(value)) {
         return value.length === 0 || (seen ? value.every((item) => visit(item, seen)) : false);
       }
       if (value instanceof Set) {
-        return (
-          value.size === 0 || (seen ? [...value].every((item) => visit(item, seen)) : false)
-        );
+        return value.size === 0 || (seen ? [...value].every((item) => visit(item, seen)) : false);
       }
       if (value instanceof Map) {
         return (
@@ -105,11 +99,12 @@ export function isEmpty(
         );
       }
       const keys = Object.keys(value);
-      if (keys.length === 0) return true;
-      else if (seen) {
+      if (keys.length === 0) {
+        return true;
+      } else if (seen) {
         return keys.every((key) => visit((value as Record<string, unknown>)[key], seen));
       } else {
-        return false
+        return false;
       }
     } else {
       return false;
@@ -118,7 +113,6 @@ export function isEmpty(
   return visit(collection, options?.recursive ? new Set() : undefined);
 }
 
-
 /**
  * Normalizes a source to an iterable of its `T` values, so Maps are treated
  * uniformly with arrays/sets: a {@link Map} yields its *values* (matching
@@ -154,7 +148,6 @@ export function isContainer<T = unknown>(value: unknown): value is Container<T>
   );
 }
 
-
 function sequenceSources<T>(...sources: SequenceSource<T>[]): Iterable<T>[] {
   const sourceIterables: Iterable<T>[] = [];
   for (const source of sources) {
@@ -526,7 +519,7 @@ export function at<T>(index: number, ...sources: readonly Source<T>[]): T | unde
   return undefined;
 }
 
-export function toOneOrMany<T>(input: (T | OneOrMany<T>)): OneOrMany<T> {
+export function toOneOrMany<T>(input: T | OneOrMany<T>): OneOrMany<T> {
   return Array.isArray(input) ? input : [input];
 }
 
@@ -585,7 +578,7 @@ class SequenceImpl<T> {
       // beginning.
       const buffer = this.buffer!;
       let index = 0;
-      for (; ;) {
+      for (;;) {
         if (index < buffer.length) {
           yield buffer[index++]!;
           continue;
@@ -648,9 +641,7 @@ class SequenceImpl<T> {
    *
    * @see {@link sequence}
    */
-  join(
-    ...sources: readonly SequenceSource<T>[]
-  ): Sequence<T> {
+  join(...sources: readonly SequenceSource<T>[]): Sequence<T> {
     const sourceIterables = sequenceSources(this, ...sources);
     return sequenceSources.length === 0 ? this : sequence(...sourceIterables);
   }
@@ -751,9 +742,7 @@ const emptySequence: Sequence<never> = new SequenceImpl([], undefined, {
  * @typeParam T - Element type of the sequence.
  * @param sources - Iterables to concatenate, in order (`Map` sources use values).
  */
-export function sequence<T>(
-  ...sources: readonly SequenceSource<T>[]
-): Sequence<T> {
+export function sequence<T>(...sources: readonly SequenceSource<T>[]): Sequence<T> {
   // Skip nullish sources and known-empty collections; normalize the rest to
   // their values so a Map contributes values rather than [key, value] entries.
   const sourceIterables = sequenceSources(...sources);
@@ -773,8 +762,6 @@ export function sequence<T>(
   );
 }
 
-
-
 /**
  * Flattens a mix of single items and iterables into one lazy {@link Generator}.
  *
@@ -800,10 +787,6 @@ export function* generator<T>(
   }
 }
 
-
-
-
-
 // ---------------------------------------------------------------------------
 // Object value guards, coercions, and structural equality
 // ---------------------------------------------------------------------------
@@ -836,8 +819,9 @@ export function isRecord(value: unknown): value is Record<string, unknown> {
  * well as the numbers `1` and `0`.
  */
 export function toBoolean(value: unknown): boolean | undefined {
-  if (typeof value === "boolean") return value;
-  else if (typeof value === "string") {
+  if (typeof value === "boolean") {
+    return value;
+  } else if (typeof value === "string") {
     value = value.trim().toLowerCase();
     if (
       value === "true" ||
@@ -846,17 +830,18 @@ export function toBoolean(value: unknown): boolean | undefined {
       value === "1" ||
       value === "yes" ||
       value === "y"
-    )
+    ) {
       return true;
-    else if (
+    } else if (
       value === "false" ||
       value == "f" ||
       value === "off" ||
       value === "0" ||
       value === "no" ||
       value === "n"
-    )
+    ) {
       return false;
+    }
   } else if (typeof value === "number") {
     if (value === 1) return true;
     else if (value === 0) return false;

package/src/predicate.ts

@@ -137,9 +137,7 @@ function buildPredicate<T, U extends T>(test: (value: T) => unknown): Predicate<
 /**
  * Wraps a type predicate while preserving its narrowed type.
  */
-export function create<T, U extends T>(
-  predicate: TypePredicateFunction<T, U>,
-): Predicate<T, U>;
+export function create<T, U extends T>(predicate: TypePredicateFunction<T, U>): Predicate<T, U>;
 
 /**
  * Wraps an ordinary boolean or truthy predicate.

package/src/string.ts

@@ -520,9 +520,7 @@ export function pluralize(count: number, noun: string): string {
  * {@link TokenizeOptions} (e.g. `camelCase: false`) merge over the defaults.
  */
 export function toLabel(value: string, options?: TokenizeOptions): string {
-  const tokens = [
-    ...tokenizeWithOptions({ lowerCase: true, capitalize: true, ...options }, value),
-  ];
+  const tokens = [...tokenizeWithOptions({ lowerCase: true, capitalize: true, ...options }, value)];
   return tokens.length > 0 ? tokens.join(" ") : value;
 }
 

package/src/token.ts

@@ -37,9 +37,7 @@ export function getAccessTokenPayload(
   if (!(typeof input === "string")) {
     if (headerName) {
       forEachHeaderValue(input, headerName, (value: string) => {
-        for (const [payloadKey, payloadValue] of Object.entries(
-          getAccessTokenPayload(value),
-        )) {
+        for (const [payloadKey, payloadValue] of Object.entries(getAccessTokenPayload(value))) {
           if (!accessTokenPayload || !(payloadKey in accessTokenPayload)) {
             if (!accessTokenPayload) accessTokenPayload = {};
             accessTokenPayload[payloadKey] = payloadValue;
@@ -98,10 +96,7 @@ export function getAccessTokenScopes(
  * Accepts the raw {@link MASTRA_SCOPES_KEY} array stamped on
  * `RequestContext` as well as iterables from {@link getAccessTokenScopes}.
  */
-export function includesAccessTokenScope(
-  scopes: unknown,
-  allowed: readonly string[],
-): boolean {
+export function includesAccessTokenScope(scopes: unknown, allowed: readonly string[]): boolean {
   if (allowed.length) {
     for (const scope of iterateClaims(scopes)) {
       if (allowed.includes(scope)) {