polen 0.11.0-next.16 → 0.11.0-next.18

package/src/template/lib/fetch-text.ts

@@ -1,13 +1,54 @@
+import { Either } from 'effect'
+
+/**
+ * Error type for fetch failures
+ */
+export interface FetchError {
+  readonly _tag: 'FetchError'
+  readonly url: string
+  readonly status: number
+  readonly statusText: string
+  readonly message: string
+}
+
+const makeFetchError = (url: string, status: number, statusText: string): FetchError => ({
+  _tag: 'FetchError',
+  url,
+  status,
+  statusText,
+  message: `Failed to fetch: ${url} (${status} ${statusText})`,
+})
+
 /**
  * Fetch text content from a URL
  * @param url - The URL to fetch from
+ * @returns Either with text content on right or FetchError on left
+ */
+export const fetchTextEither = async (url: string): Promise<Either.Either<string, FetchError>> => {
+  try {
+    const response = await fetch(url)
+    if (!response.ok) {
+      return Either.left(makeFetchError(url, response.status, response.statusText))
+    }
+    const text = await response.text()
+    return Either.right(text)
+  } catch (error) {
+    // Network errors or other exceptions
+    return Either.left(makeFetchError(url, 0, 'Network Error'))
+  }
+}
+
+/**
+ * Fetch text content from a URL (legacy throwing version)
+ * @param url - The URL to fetch from
  * @returns Promise that resolves to the text content
  * @throws Error if the request fails
+ * @deprecated Use fetchTextEither for better error handling
  */
 export const fetchText = async (url: string): Promise<string> => {
-  const response = await fetch(url)
-  if (!response.ok) {
-    throw new Error(`Failed to fetch: ${url} (${response.status} ${response.statusText})`)
+  const result = await fetchTextEither(url)
+  if (Either.isLeft(result)) {
+    throw new Error(result.left.message)
   }
-  return response.text()
+  return result.right
 }

package/src/template/routes/changelog.tsx

@@ -6,7 +6,7 @@ import { Revision } from '#lib/revision'
 import { Swiss } from '#lib/swiss'
 import { Version } from '#lib/version'
 import { Box, Flex, Text } from '@radix-ui/themes'
-import { Effect } from 'effect'
+import { Effect, HashMap, Option } from 'effect'
 import React, { useEffect, useMemo, useState } from 'react'
 import { useParams } from 'react-router'
 import { schemasCatalog } from 'virtual:polen/project/schemas'
@@ -136,7 +136,7 @@ const Component = () => {
   // Get available versions if catalog is versioned
   const availableVersions = useMemo(() => {
     if (Catalog.Versioned.is(catalog)) {
-      return catalog.entries.map(entry => Version.encodeSync(entry.version))
+      return Catalog.Versioned.getVersions(catalog).map(Version.encodeSync)
     }
     return []
   }, [catalog])
@@ -148,8 +148,14 @@ const Component = () => {
     } else {
       // For versioned catalogs, show only current version's revisions
       if (urlVersion) {
-        const entry = catalog.entries.find(e => Version.encodeSync(e.version) === urlVersion)
-        return entry ? entry.revisions : []
+        const entryOption = Option.map(
+          HashMap.findFirst(catalog.entries, (_, key) => Version.encodeSync(key) === urlVersion),
+          ([, value]) => value,
+        )
+        return Option.match(entryOption, {
+          onNone: () => [],
+          onSome: (entry) => entry.revisions,
+        })
       }
       // No revisions if no version selected (will redirect)
       return []

package/src/template/routes/examples/_index.tsx

@@ -36,7 +36,7 @@ export const loader = async () => {
 
 const Component = () => {
   const examplesCatalog = useLoaderData(IndexSchema)
-  const schema = schemasCatalog && Catalog.getLatestSchema(schemasCatalog).definition
+  const schema = schemasCatalog && Catalog.getLatest(schemasCatalog).definition
   const hasExamples = examplesCatalog && examplesCatalog.examples.length > 0
 
   // TODO: This should become a proper diagnostic viewer component that displays

package/src/template/routes/examples/name.tsx

@@ -4,6 +4,7 @@ import { useLoaderData } from '#lib/react-router-effect/use-loader-data'
 import { Version } from '#lib/version/$'
 import { Heading } from '@radix-ui/themes'
 import { Str } from '@wollybeard/kit'
+import { Array, Option } from 'effect'
 import { useSearchParams } from 'react-router'
 import { examplesCatalog } from 'virtual:polen/project/examples'
 import { schemasCatalog } from 'virtual:polen/project/schemas'
@@ -23,10 +24,11 @@ export const nameLoader = async ({ params }: any) => {
   }
 
   // Check if the example exists
-  const example = examplesCatalog.examples.find((e: any) => e.name === name)
-  if (!example) {
+  const exampleOption = Array.findFirst(examplesCatalog.examples, (e) => e.name === name)
+  if (Option.isNone(exampleOption)) {
     throw new Response('Not Found', { status: 404 })
   }
+  const example = exampleOption.value
 
   return example
 }

package/src/template/routes/reference.tsx

@@ -6,10 +6,10 @@ import { S } from '#lib/kit-temp/effect'
 import { Lifecycles } from '#lib/lifecycles/$'
 import { route, useLoaderData } from '#lib/react-router-effect/react-router-effect'
 import { Schema } from '#lib/schema/$'
-import { Swiss } from '#lib/swiss'
 import { Version } from '#lib/version/$'
 import { Flex } from '@radix-ui/themes'
 import { neverCase } from '@wollybeard/kit/language'
+import { HashMap, Option } from 'effect'
 import { Effect, Match } from 'effect'
 import React from 'react'
 import { useParams } from 'react-router'
@@ -49,15 +49,15 @@ const referenceLoader = ({ params }: any) => {
             // If version param provided, find that specific version
             if (params.version) {
               const requestedVersion = Version.decodeSync(params.version)
-              const found = c.entries.find(s => Version.equivalence(requestedVersion, s.version))
-              if (!found) {
+              const foundOption = HashMap.get(c.entries, requestedVersion)
+              if (Option.isNone(foundOption)) {
                 // TODO: Return 404 error
                 throw new Error(`Version ${params.version} not found`)
               }
-              return found
+              return Option.getOrThrow(foundOption)
             }
             // No version param means "latest" - use the last entry
-            const latest = c.entries[c.entries.length - 1]
+            const latest = Catalog.Versioned.getLatestOrThrow(c)
             if (!latest) {
               throw new Error('No schemas available in versioned catalog')
             }
@@ -161,7 +161,7 @@ const ReferenceView = () => {
           return catalog._tag === 'CatalogVersioned' && version
             ? (
               <VersionPicker
-                data={catalog.entries.map(entry => entry.version)}
+                data={Catalog.Versioned.getVersions(catalog)}
                 current={version}
               />
             )

package/src/template/stores/toast.ts

@@ -1,4 +1,4 @@
-import { Schema as S } from 'effect'
+import { Duration, Schema as S } from 'effect'
 import { proxy } from 'valtio'
 
 // ============================================================================
@@ -68,8 +68,10 @@ export const initialState: State = {
   toasts: [],
 }
 
+const DEFAULT_TOAST_DURATION = Duration.seconds(5)
+
 const toastDefaults = {
-  duration: 5000,
+  duration: Duration.toMillis(DEFAULT_TOAST_DURATION),
   actions: [],
 } satisfies Partial<Toast>
 
@@ -96,7 +98,8 @@ export const store = proxy({
 
     // Auto-remove after duration (default 5 seconds). Set duration to 0 to disable auto-dismiss
     if (toast.duration !== 0) {
-      setTimeout(() => store.remove(id), toast.duration || toastDefaults.duration)
+      const durationMs = toast.duration || toastDefaults.duration
+      setTimeout(() => store.remove(id), durationMs)
     }
 
     return id

package/src/vite/plugins/navbar.ts

@@ -59,7 +59,7 @@ export const Navbar = ({
             const hasMultipleRevisions = Catalog.fold(
               (versioned) => {
                 // For versioned catalogs, count total revisions across all entries
-                const totalRevisions = versioned.entries.reduce(
+                const totalRevisions = Catalog.Versioned.getAll(versioned).reduce(
                   (sum: number, entry) => sum + entry.revisions.length,
                   0,
                 )

package/src/vite/plugins/routes-manifest.ts

@@ -100,7 +100,7 @@ function processVersionedCatalog(
   catalog: Catalog.Versioned.Versioned,
   routes: string[],
 ): void {
-  for (const schema of catalog.entries) {
+  for (const schema of Catalog.Versioned.getAll(catalog)) {
     const version = schema.version
     routes.push(`/reference/version/${version}`)
 

package/build/lib/graph/$$.d.ts

@@ -1,2 +0,0 @@
-export * from './graph.js';
-//# sourceMappingURL=$$.d.ts.map

package/build/lib/graph/$$.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"$$.d.ts","sourceRoot":"","sources":["../../../src/lib/graph/$$.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA"}

package/build/lib/graph/$$.js

@@ -1,2 +0,0 @@
-export * from './graph.js';
-//# sourceMappingURL=$$.js.map

package/build/lib/graph/$$.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"$$.js","sourceRoot":"","sources":["../../../src/lib/graph/$$.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA"}

package/build/lib/graph/$.d.ts

@@ -1,2 +0,0 @@
-export * as Graph from './$$.js';
-//# sourceMappingURL=$.d.ts.map

package/build/lib/graph/$.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"$.d.ts","sourceRoot":"","sources":["../../../src/lib/graph/$.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,MAAM,SAAS,CAAA"}

package/build/lib/graph/$.js

@@ -1,2 +0,0 @@
-export * as Graph from './$$.js';
-//# sourceMappingURL=$.js.map

package/build/lib/graph/$.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"$.js","sourceRoot":"","sources":["../../../src/lib/graph/$.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,MAAM,SAAS,CAAA"}

package/build/lib/graph/graph.d.ts

@@ -1,127 +0,0 @@
-import { S } from '#lib/kit-temp/effect';
-/**
- * Dependency graph for tracking relationships between nodes
- * Used to efficiently handle dependencies in various contexts
- */
-export declare const DependencyGraph: S.Struct<{
-    /**
-     * Map from parent ID to array of child IDs (parent depends on children)
-     */
-    dependencies: S.Record$<typeof S.String, S.Array$<typeof S.String>>;
-    /**
-     * Map from child ID to array of parent IDs (child is depended on by parents)
-     */
-    dependents: S.Record$<typeof S.String, S.Array$<typeof S.String>>;
-}>;
-export type DependencyGraph = typeof DependencyGraph.Type;
-export declare const make: (props: {
-    readonly dependencies: {
-        readonly [x: string]: readonly string[];
-    };
-    readonly dependents: {
-        readonly [x: string]: readonly string[];
-    };
-}, options?: S.MakeOptions) => {
-    readonly dependencies: {
-        readonly [x: string]: readonly string[];
-    };
-    readonly dependents: {
-        readonly [x: string]: readonly string[];
-    };
-};
-/**
- * Create an empty dependency graph
- */
-export declare const create: () => DependencyGraph;
-/**
- * Add a dependency relationship (immutable)
- * @param graph - The dependency graph
- * @param parent - The parent node ID
- * @param child - The child node ID that the parent depends on
- * @returns A new graph with the dependency added
- */
-export declare const addDependency: (graph: DependencyGraph, parent: string, child: string) => DependencyGraph;
-/**
- * Add a dependency relationship (mutable)
- * @param graph - The dependency graph to mutate
- * @param parent - The parent node ID
- * @param child - The child node ID that the parent depends on
- */
-export declare const addDependencyMutable: (graph: DependencyGraph, parent: string, child: string) => void;
-/**
- * Find all nodes that have no dependencies (leaf nodes)
- */
-export declare const findLeafNodes: (graph: DependencyGraph) => Set<string>;
-/**
- * Check if all dependencies of a node have been processed
- */
-export declare const areDependenciesReady: (node: string, graph: DependencyGraph, processed: Set<string>) => boolean;
-/**
- * Get topological ordering of nodes (children before parents)
- * This ensures we process dependencies before the nodes that depend on them
- *
- * @param graph - The dependency graph
- * @returns Array of node IDs in topological order
- */
-export declare const topologicalSort: (graph: DependencyGraph) => string[];
-export declare const decode: (i: {
-    readonly dependencies: {
-        readonly [x: string]: readonly string[];
-    };
-    readonly dependents: {
-        readonly [x: string]: readonly string[];
-    };
-}, overrideOptions?: import("effect/SchemaAST").ParseOptions) => import("effect/Effect").Effect<{
-    readonly dependencies: {
-        readonly [x: string]: readonly string[];
-    };
-    readonly dependents: {
-        readonly [x: string]: readonly string[];
-    };
-}, import("effect/ParseResult").ParseError, never>;
-export declare const decodeSync: (i: {
-    readonly dependencies: {
-        readonly [x: string]: readonly string[];
-    };
-    readonly dependents: {
-        readonly [x: string]: readonly string[];
-    };
-}, overrideOptions?: import("effect/SchemaAST").ParseOptions) => {
-    readonly dependencies: {
-        readonly [x: string]: readonly string[];
-    };
-    readonly dependents: {
-        readonly [x: string]: readonly string[];
-    };
-};
-export declare const encode: (a: {
-    readonly dependencies: {
-        readonly [x: string]: readonly string[];
-    };
-    readonly dependents: {
-        readonly [x: string]: readonly string[];
-    };
-}, overrideOptions?: import("effect/SchemaAST").ParseOptions) => import("effect/Effect").Effect<{
-    readonly dependencies: {
-        readonly [x: string]: readonly string[];
-    };
-    readonly dependents: {
-        readonly [x: string]: readonly string[];
-    };
-}, import("effect/ParseResult").ParseError, never>;
-export declare const encodeSync: (a: {
-    readonly dependencies: {
-        readonly [x: string]: readonly string[];
-    };
-    readonly dependents: {
-        readonly [x: string]: readonly string[];
-    };
-}, overrideOptions?: import("effect/SchemaAST").ParseOptions) => {
-    readonly dependencies: {
-        readonly [x: string]: readonly string[];
-    };
-    readonly dependents: {
-        readonly [x: string]: readonly string[];
-    };
-};
-//# sourceMappingURL=graph.d.ts.map

package/build/lib/graph/graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../../src/lib/graph/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,sBAAsB,CAAA;AAIxC;;;GAGG;AACH,eAAO,MAAM,eAAe;IAC1B;;OAEG;;IAGH;;OAEG;;EAKH,CAAA;AAEF,MAAM,MAAM,eAAe,GAAG,OAAO,eAAe,CAAC,IAAI,CAAA;AAIzD,eAAO,MAAM,IAAI;;;;;;;;;;;;;;CAAuB,CAAA;AAExC;;GAEG;AACH,eAAO,MAAM,MAAM,QAAO,eAItB,CAAA;AAIJ;;;;;;GAMG;AACH,eAAO,MAAM,aAAa,GACxB,OAAO,eAAe,EACtB,QAAQ,MAAM,EACd,OAAO,MAAM,KACZ,eAqBF,CAAA;AAED;;;;;GAKG;AACH,eAAO,MAAM,oBAAoB,GAC/B,OAAO,eAAe,EACtB,QAAQ,MAAM,EACd,OAAO,MAAM,KACZ,IAsBF,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,aAAa,GAAI,OAAO,eAAe,KAAG,GAAG,CAAC,MAAM,CAYhE,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,oBAAoB,GAC/B,MAAM,MAAM,EACZ,OAAO,eAAe,EACtB,WAAW,GAAG,CAAC,MAAM,CAAC,KACrB,OAKF,CAAA;AAED;;;;;;GAMG;AACH,eAAO,MAAM,eAAe,GAAI,OAAO,eAAe,KAAG,MAAM,EA2C9D,CAAA;AAID,eAAO,MAAM,MAAM;;;;;;;;;;;;;;kDAA4B,CAAA;AAC/C,eAAO,MAAM,UAAU;;;;;;;;;;;;;;CAAgC,CAAA;AACvD,eAAO,MAAM,MAAM;;;;;;;;;;;;;;kDAA4B,CAAA;AAC/C,eAAO,MAAM,UAAU;;;;;;;;;;;;;;CAAgC,CAAA"}

package/build/lib/graph/graph.js

@@ -1,152 +0,0 @@
-import { S } from '#lib/kit-temp/effect';
-// ─── Schema ──────────────────────────────────────────────────────────────────
-/**
- * Dependency graph for tracking relationships between nodes
- * Used to efficiently handle dependencies in various contexts
- */
-export const DependencyGraph = S.Struct({
-    /**
-     * Map from parent ID to array of child IDs (parent depends on children)
-     */
-    dependencies: S.Record({ key: S.String, value: S.Array(S.String) }),
-    /**
-     * Map from child ID to array of parent IDs (child is depended on by parents)
-     */
-    dependents: S.Record({ key: S.String, value: S.Array(S.String) }),
-}).annotations({
-    identifier: 'DependencyGraph',
-    description: 'A directed graph tracking dependencies between nodes',
-});
-// ─── Constructors ────────────────────────────────────────────────────────────
-export const make = DependencyGraph.make;
-/**
- * Create an empty dependency graph
- */
-export const create = () => make({
-    dependencies: {},
-    dependents: {},
-});
-// ─── Domain Logic ────────────────────────────────────────────────────────────
-/**
- * Add a dependency relationship (immutable)
- * @param graph - The dependency graph
- * @param parent - The parent node ID
- * @param child - The child node ID that the parent depends on
- * @returns A new graph with the dependency added
- */
-export const addDependency = (graph, parent, child) => {
-    // Get existing arrays or create empty ones
-    const children = graph.dependencies[parent] || [];
-    const parents = graph.dependents[child] || [];
-    // Add child if not already present
-    const newChildren = children.includes(child) ? children : [...children, child];
-    // Add parent if not already present
-    const newParents = parents.includes(parent) ? parents : [...parents, parent];
-    return make({
-        dependencies: {
-            ...graph.dependencies,
-            [parent]: newChildren,
-        },
-        dependents: {
-            ...graph.dependents,
-            [child]: newParents,
-        },
-    });
-};
-/**
- * Add a dependency relationship (mutable)
- * @param graph - The dependency graph to mutate
- * @param parent - The parent node ID
- * @param child - The child node ID that the parent depends on
- */
-export const addDependencyMutable = (graph, parent, child) => {
-    // Cast to mutable for mutation
-    const mutableGraph = graph;
-    // Add to dependencies
-    if (!mutableGraph.dependencies[parent]) {
-        mutableGraph.dependencies[parent] = [];
-    }
-    if (!mutableGraph.dependencies[parent].includes(child)) {
-        mutableGraph.dependencies[parent].push(child);
-    }
-    // Add to dependents
-    if (!mutableGraph.dependents[child]) {
-        mutableGraph.dependents[child] = [];
-    }
-    if (!mutableGraph.dependents[child].includes(parent)) {
-        mutableGraph.dependents[child].push(parent);
-    }
-};
-/**
- * Find all nodes that have no dependencies (leaf nodes)
- */
-export const findLeafNodes = (graph) => {
-    const leaves = new Set();
-    // Check all nodes that appear as children
-    for (const child of Object.keys(graph.dependents)) {
-        const deps = graph.dependencies[child];
-        if (!deps || deps.length === 0) {
-            leaves.add(child);
-        }
-    }
-    return leaves;
-};
-/**
- * Check if all dependencies of a node have been processed
- */
-export const areDependenciesReady = (node, graph, processed) => {
-    const deps = graph.dependencies[node];
-    if (!deps)
-        return true;
-    return deps.every(dep => processed.has(dep));
-};
-/**
- * Get topological ordering of nodes (children before parents)
- * This ensures we process dependencies before the nodes that depend on them
- *
- * @param graph - The dependency graph
- * @returns Array of node IDs in topological order
- */
-export const topologicalSort = (graph) => {
-    const result = [];
-    const visited = new Set();
-    const visiting = new Set(); // For cycle detection
-    // Get all nodes
-    const allNodes = new Set();
-    for (const parent of Object.keys(graph.dependencies)) {
-        allNodes.add(parent);
-    }
-    for (const child of Object.keys(graph.dependents)) {
-        allNodes.add(child);
-    }
-    const visit = (node) => {
-        if (visited.has(node))
-            return;
-        if (visiting.has(node)) {
-            // Cycle detected - just skip this node
-            return;
-        }
-        visiting.add(node);
-        // Visit all children first
-        const children = graph.dependencies[node];
-        if (children) {
-            for (const child of children) {
-                visit(child);
-            }
-        }
-        visiting.delete(node);
-        visited.add(node);
-        result.push(node);
-    };
-    // Visit all nodes
-    for (const node of allNodes) {
-        visit(node);
-    }
-    return result;
-};
-// ─── Codec ───────────────────────────────────────────────────────────────────
-export const decode = S.decode(DependencyGraph);
-export const decodeSync = S.decodeSync(DependencyGraph);
-export const encode = S.encode(DependencyGraph);
-export const encodeSync = S.encodeSync(DependencyGraph);
-//# sourceMappingURL=graph.js.map

package/build/lib/graph/graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../../src/lib/graph/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,CAAC,EAAE,MAAM,sBAAsB,CAAA;AAExC,gFAAgF;AAEhF;;;GAGG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAC,MAAM,CAAC;IACtC;;OAEG;IACH,YAAY,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;IAEnE;;OAEG;IACH,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;CAClE,CAAC,CAAC,WAAW,CAAC;IACb,UAAU,EAAE,iBAAiB;IAC7B,WAAW,EAAE,sDAAsD;CACpE,CAAC,CAAA;AAIF,gFAAgF;AAEhF,MAAM,CAAC,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,CAAA;AAExC;;GAEG;AACH,MAAM,CAAC,MAAM,MAAM,GAAG,GAAoB,EAAE,CAC1C,IAAI,CAAC;IACH,YAAY,EAAE,EAAE;IAChB,UAAU,EAAE,EAAE;CACf,CAAC,CAAA;AAEJ,gFAAgF;AAEhF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,KAAsB,EACtB,MAAc,EACd,KAAa,EACI,EAAE;IACnB,2CAA2C;IAC3C,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,CAAA;IACjD,MAAM,OAAO,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,CAAA;IAE7C,mCAAmC;IACnC,MAAM,WAAW,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,EAAE,KAAK,CAAC,CAAA;IAE9E,oCAAoC;IACpC,MAAM,UAAU,GAAG,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,EAAE,MAAM,CAAC,CAAA;IAE5E,OAAO,IAAI,CAAC;QACV,YAAY,EAAE;YACZ,GAAG,KAAK,CAAC,YAAY;YACrB,CAAC,MAAM,CAAC,EAAE,WAAW;SACtB;QACD,UAAU,EAAE;YACV,GAAG,KAAK,CAAC,UAAU;YACnB,CAAC,KAAK,CAAC,EAAE,UAAU;SACpB;KACF,CAAC,CAAA;AACJ,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,KAAsB,EACtB,MAAc,EACd,KAAa,EACP,EAAE;IACR,+BAA+B;IAC/B,MAAM,YAAY,GAAG,KAGpB,CAAA;IAED,sBAAsB;IACtB,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,MAAM,CAAC,EAAE,CAAC;QACvC,YAAY,CAAC,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,CAAA;IACxC,CAAC;IACD,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,YAAY,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IAC/C,CAAC;IAED,oBAAoB;IACpB,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACpC,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,EAAE,CAAA;IACrC,CAAC;IACD,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QACrD,YAAY,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC7C,CAAC;AACH,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAsB,EAAe,EAAE;IACnE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAEhC,0CAA0C;IAC1C,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAA;QACtC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACnB,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,IAAY,EACZ,KAAsB,EACtB,SAAsB,EACb,EAAE;IACX,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAA;IACrC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAA;IAEtB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;AAC9C,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,KAAsB,EAAY,EAAE;IAClE,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAA;IACjC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA,CAAC,sBAAsB;IAEzD,gBAAgB;IAChB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;QACrD,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;IACtB,CAAC;IACD,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;QAClD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACrB,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,IAAY,EAAQ,EAAE;QACnC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAM;QAE7B,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,uCAAuC;YACvC,OAAM;QACR,CAAC;QAED,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAElB,2BAA2B;QAC3B,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,IAAI,CAAC,CAAA;QACzC,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC7B,KAAK,CAAC,KAAK,CAAC,CAAA;YACd,CAAC;QACH,CAAC;QAED,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjB,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACnB,CAAC,CAAA;IAED,kBAAkB;IAClB,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,KAAK,CAAC,IAAI,CAAC,CAAA;IACb,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC,CAAA;AAED,gFAAgF;AAEhF,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAA;AAC/C,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAA;AACvD,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,eAAe,CAAC,CAAA;AAC/C,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC,eAAe,CAAC,CAAA"}

package/build/lib/mask/$$.d.ts

@@ -1,3 +0,0 @@
-export * from './apply.js';
-export * from './mask.js';
-//# sourceMappingURL=$$.d.ts.map

package/build/lib/mask/$$.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"$$.d.ts","sourceRoot":"","sources":["../../../src/lib/mask/$$.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA;AAC1B,cAAc,WAAW,CAAA"}

package/build/lib/mask/$$.js

@@ -1,3 +0,0 @@
-export * from './apply.js';
-export * from './mask.js';
-//# sourceMappingURL=$$.js.map

package/build/lib/mask/$$.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"$$.js","sourceRoot":"","sources":["../../../src/lib/mask/$$.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAA;AAC1B,cAAc,WAAW,CAAA"}

package/build/lib/mask/$.d.ts

@@ -1,2 +0,0 @@
-export * as Mask from './$$.js';
-//# sourceMappingURL=$.d.ts.map

package/build/lib/mask/$.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"$.d.ts","sourceRoot":"","sources":["../../../src/lib/mask/$.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,SAAS,CAAA"}

package/build/lib/mask/$.js

@@ -1,2 +0,0 @@
-export * as Mask from './$$.js';
-//# sourceMappingURL=$.js.map

package/build/lib/mask/$.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"$.js","sourceRoot":"","sources":["../../../src/lib/mask/$.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,IAAI,MAAM,SAAS,CAAA"}

package/build/lib/mask/apply.d.ts

@@ -1,86 +0,0 @@
-import { type ExtendsExact } from '#lib/kit-temp';
-import type { GetDataType, Mask } from './mask.js';
-/**
- * Type-level function that applies a mask to data.
- *
- * @template Data - The data type
- * @template M - The mask type
- *
- * Binary masks:
- * - show=true returns the data unchanged
- * - show=false returns undefined
- *
- * Properties masks:
- * - 'allow' mode returns Pick<Data, keys>
- * - 'deny' mode returns Omit<Data, keys>
- * - Non-objects throw an error at runtime
- */
-export type Apply<$Data, $M extends Mask> = $M extends {
-    type: `binary`;
-    show: boolean;
-} ? $M[`show`] extends true ? $Data : undefined : $M extends {
-    type: `properties`;
-    mode: string;
-    properties: any[];
-} ? $Data extends object ? $M[`mode`] extends `allow` ? Pick<$Data, Extract<$M[`properties`][number], keyof $Data>> : Omit<$Data, Extract<$M[`properties`][number], keyof $Data>> : never : never;
-/**
- * Apply mask to data with standard covariance.
- *
- * Data must be assignable to the mask's expected type (may have excess properties).
- *
- * @param data - The data to mask
- * @param mask - The mask to apply
- * @returns The masked data
- *
- * @example
- * ```ts
- * const user = { name: 'John', email: 'john@example.com', password: 'secret' }
- * const mask = Mask.pick<User>(['name', 'email'])
- * const safeUser = apply(user, mask) // { name: 'John', email: 'john@example.com' }
- * ```
- */
-export declare const apply: <data extends GetDataType<mask>, mask extends Mask>(data: data, mask: mask) => Apply<data, mask>;
-/**
- * Apply mask to partial data.
- *
- * Data may have only a subset of the mask's expected properties.
- * Useful when working with incomplete data or optional fields.
- *
- * @param data - The partial data to mask
- * @param mask - The mask to apply
- * @returns The masked data
- *
- * @example
- * ```ts
- * const partialUser = { name: 'John' } // missing email
- * const mask = Mask.pick<User>(['name', 'email'])
- * const result = applyPartial(partialUser, mask) // { name: 'John' }
- * ```
- */
-export declare const applyPartial: <data extends Partial<GetDataType<mask>>, mask extends Mask>(data: data, mask: mask) => Apply<data, mask>;
-/**
- * Apply mask to data with exact type matching.
- *
- * Data must exactly match the mask's expected type - no missing or excess properties.
- * Provides the strictest type checking.
- *
- * @param data - The data to mask (must exactly match expected type)
- * @param mask - The mask to apply
- * @returns The masked data
- *
- * @example
- * ```ts
- * type User = { name: string; email: string }
- * const mask = Mask.pick<User>(['name'])
- *
- * // This works - exact match
- * const user: User = { name: 'John', email: 'john@example.com' }
- * const result = applyExact(user, mask)
- *
- * // This fails - has extra property
- * const userWithExtra = { name: 'John', email: 'john@example.com', age: 30 }
- * const result2 = applyExact(userWithExtra, mask) // Type error!
- * ```
- */
-export declare const applyExact: <data, mask extends Mask>(data: ExtendsExact<data, GetDataType<mask>>, mask: mask) => Apply<data, mask>;
-//# sourceMappingURL=apply.d.ts.map