@mcp-web/decompose-zod-schema 0.1.0

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2025 Fritz Lekschas
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -0,0 +1,358 @@
+# Schema Decomposition for AI Tools
+
+Large schemas create two fundamental challenges when working with AI systems:
+
+## 1. Descriptive Complexity
+When schemas have too many properties, AI might struggle to understand and work
+with all concepts simultaneously. Complex schemas can exceed context limits and
+reduce AI's ability to generate accurate, focused responses.
+
+**Solution: Schema Decomposition**
+- Split large objects into semantically-coherent sub-schemas
+- This results in focused schemas that handle specific domains of properties
+- Each sub-schema can be processed independently, improving AI accuracy and efficiency
+- Perfect for breaking down complex forms, configuration objects, or data models
+
+## 2. Generative Complexity  
+When schemas contain unbounded collections (arrays, records, maps), the AI might need to manage many items at once, which can lead to errors and inefficiency. Generating or updating large collections can overwhelm AI systems and result in incomplete or incorrect data.
+
+**Solution: Value Generation Decomposition**
+- Transform collections into single-item + indexing operations
+- AI generates/updates one item at a time with precise targeting
+- Supports both arrays (`items[]`) and records/maps (`configs{}`)
+- Enables incremental updates to large datasets without losing context
+
+---
+
+This utility provides both types of decomposition through a flexible, type-safe API that works seamlessly with Zod schemas and maintains full TypeScript support.
+
+## Features
+
+- **Manual Decomposition**: Use split plans to precisely control how schemas are decomposed
+- **Automatic Suggestions**: Size-based algorithms to suggest optimal decomposition plans
+- **Enum Splitting**: Automatically splits large enums into smaller chunks with flexible notation
+- **Array Decomposition**: Transform arrays into single-item schemas with `items[]` notation
+- **Record Decomposition**: Transform records/maps into key-value pairs with `configs{}` notation
+- **Plan Validation**: Validate split plans against schemas before decomposition
+- **Partial Updates**: Apply updates from decomposed schemas to complete objects
+- **Extensible Strategy System**: Plugin architecture for custom decomposition algorithms
+- **Type Safety**: Maintains full TypeScript type safety throughout
+
+## Usage
+
+### Automatic Decomposition (Size-based)
+
+```typescript
+import { decomposeSchema, applyPartialUpdate } from '@your-company/decompose-zod-schema';
+import { z } from 'zod';
+
+// Define a complex schema
+const userSchema = z.object({
+  user: z.object({
+    id: z.string().uuid(),
+    name: z.string(),
+    email: z.string().email(),
+  }),
+  profile: z.object({
+    bio: z.string(),
+    avatar: z.string().url().optional(),
+  }),
+  preferences: z.object({
+    theme: z.enum(['light', 'dark', 'auto']),
+    language: z.enum(['en', 'es', 'fr', 'de']),
+  }),
+  // Large enum for testing
+  category: z.enum(Array.from({ length: 200 }, (_, i) => `cat-${i}`) as [string, ...string[]]),
+});
+
+// Automatic decomposition with size constraints
+const decomposed = decomposeSchema(userSchema, {
+  maxTokensPerSchema: 1500,
+  maxOptionsPerEnum: 50,
+});
+
+console.log(decomposed);
+// [
+//   { name: "user", schema: z.object({...}), targetPaths: ["user.id", "user.name", "user.email"] },
+//   { name: "profile", schema: z.object({...}), targetPaths: ["profile.bio", "profile.avatar"] },
+//   { name: "preferences", schema: z.object({...}), targetPaths: ["preferences.theme", "preferences.language"] },
+//   { name: "category-1", schema: z.object({...}), targetPaths: ["category[0:50]"] },
+//   { name: "category-2", schema: z.object({...}), targetPaths: ["category[50:100]"] },
+//   // ... more category chunks
+// ]
+```
+
+### Manual Decomposition (Split Plans)
+
+```typescript
+import { decomposeSchema, PlanBuilder } from '@your-company/decompose-zod-schema';
+
+// Simple static plan
+const plan = [
+  'user',
+  'profile', 
+  'preferences',
+  'category[50]',  // Split category enum into chunks of 50
+];
+
+const decomposed = decomposeSchema(userSchema, plan);
+
+// Using the plan builder for more complex scenarios
+const builderPlan = new PlanBuilder()
+  .addSplit('user')
+  .addSplit('profile')
+  .addConditionalEnumSplit('preferences.language', 10, userSchema)
+  .addEnumSplit('category', 50)
+  .build();
+
+const decomposedFromBuilder = decomposeSchema(userSchema, builderPlan);
+```
+
+### Array and Record Decomposition
+
+Transform collections into manageable single-item operations:
+
+```typescript
+import { decomposeSchema, applyPartialUpdate } from '@your-company/decompose-zod-schema';
+import { z } from 'zod';
+
+// Schema with arrays and records
+const dataSchema = z.object({
+  users: z.array(z.object({
+    name: z.string(),
+    email: z.string(),
+    roles: z.array(z.string())
+  })),
+  settings: z.record(z.string(), z.object({
+    enabled: z.boolean(),
+    value: z.string()
+  })),
+  metadata: z.string()
+});
+
+// Decompose collections into single-item schemas
+const plan = [
+  'metadata',     // Regular property
+  'users[]',      // Array decomposition: z.array(T) → z.object({ index: number, value: T })
+  'settings{}'    // Record decomposition: z.record(K, V) → z.object({ key: K, value: V })
+];
+
+const decomposed = decomposeSchema(dataSchema, plan);
+console.log(decomposed);
+// [
+//   { name: "metadata", schema: z.object({ metadata: z.string() }), targetPaths: ["metadata"] },
+//   { name: "users-item", schema: z.object({ index: z.number(), value: UserSchema }), targetPaths: ["users[]"] },
+//   { name: "settings-entry", schema: z.object({ key: z.string(), value: SettingSchema }), targetPaths: ["settings{}"] }
+// ]
+
+// Apply single-item updates
+const currentData = {
+  users: [
+    { name: 'Alice', email: 'alice@example.com', roles: ['user'] },
+    { name: 'Bob', email: 'bob@example.com', roles: ['admin'] }
+  ],
+  settings: {
+    theme: { enabled: true, value: 'dark' },
+    debug: { enabled: false, value: 'off' }
+  },
+  metadata: 'User Management System'
+};
+
+// Update a specific array element
+const usersSchema = decomposed.find(s => s.name === 'users-item');
+const arrayUpdate = { 
+  index: 0, 
+  value: { name: 'Alice Updated', email: 'alice.new@example.com', roles: ['user', 'moderator'] }
+};
+const updatedData = applyPartialUpdate(currentData, usersSchema.targetPaths, arrayUpdate);
+
+// Update a specific record entry
+const settingsSchema = decomposed.find(s => s.name === 'settings-entry');
+const recordUpdate = { 
+  key: 'debug', 
+  value: { enabled: true, value: 'verbose' }
+};
+const finalData = applyPartialUpdate(updatedData, settingsSchema.targetPaths, recordUpdate);
+```
+
+### Split Plan Validation
+
+```typescript
+import { validatePlan } from '@your-company/decompose-zod-schema';
+
+const plan = ['user', 'profile', 'nonexistent.path', 'category[1000]'];
+const errors = validatePlan(plan, userSchema);
+
+if (errors.length > 0) {
+  console.log('Plan validation errors:', errors);
+  // ["Path 'nonexistent.path' does not exist in schema", "Invalid slice range..."]
+}
+```
+
+### Advanced Strategy System
+
+```typescript
+import { 
+  suggestWithStrategy, 
+  SuggestionStrategyRegistry,
+  SemanticSuggestionStrategy 
+} from '@your-company/decompose-zod-schema';
+
+// Use different suggestion strategies
+const sizeBasedPlan = suggestWithStrategy('size-based', userSchema, {
+  maxTokensPerSchema: 1500,
+  maxOptionsPerEnum: 50
+});
+
+// Register custom strategies
+const registry = new SuggestionStrategyRegistry();
+registry.register(new SemanticSuggestionStrategy());
+
+const semanticPlan = registry.suggest('semantic', userSchema, {});
+```
+
+### Partial Updates
+
+```typescript
+const currentUser = {
+  user: { id: '123', name: 'John', email: 'john@example.com' },
+  profile: { bio: 'Developer', avatar: 'https://example.com/avatar.jpg' },
+  preferences: { theme: 'light', language: 'en' },
+};
+
+// Apply a partial update for just the user information
+const updatedUser = applyPartialUpdate(
+  currentUser,
+  ['user.id', 'user.name', 'user.email'],
+  { id: '456', name: 'Jane', email: 'jane@example.com' }
+);
+
+console.log(updatedUser);
+// {
+//   user: { id: '456', name: 'Jane', email: 'jane@example.com' },
+//   profile: { bio: 'Developer', avatar: 'https://example.com/avatar.jpg' },  // unchanged
+//   preferences: { theme: 'light', language: 'en' }  // unchanged
+// }
+```
+
+## Command Line Interface
+
+A Node.js CLI is provided for testing and analyzing schema decomposition:
+
+```bash
+# Run tests
+npm test
+
+# Analyze a schema
+npm run example
+
+# Custom analysis
+node decompose-cli.js -i schema.ts -s mySchema -t 1000 -v
+```
+
+### CLI Options
+
+- `-i, --input <file>`: Input TypeScript file containing schema
+- `-s, --schema <name>`: Name of the schema variable to decompose
+- `-o, --output <file>`: Output JSON file for results
+- `-t, --tokens <number>`: Maximum tokens per decomposed schema (default: 2000)
+- `-e, --enum-size <number>`: Maximum enum size before splitting (default: 200)
+- `-v, --verbose`: Verbose output
+- `-h, --help`: Show help
+
+## Testing
+
+Comprehensive tests are provided using Node.js test frameworks:
+
+```bash
+cd packages/decompose-zod-schema
+npm test
+```
+
+Tests cover:
+- Basic schema decomposition
+- Nested object handling
+- Large enum splitting
+- Partial update functionality
+- Round-trip validation (ensuring decomposed updates maintain schema validity)
+
+## Implementation Details
+
+### Architecture Overview
+
+The library is structured into distinct modules for maximum flexibility:
+
+1. **Types** (`types.ts`): Core type definitions including `SplitPlan`, `DecomposedSchema`, and strategy interfaces
+2. **Utils** (`utils.ts`): Internal utility functions for path manipulation, schema extraction, and validation
+3. **Manual Decompose** (`manual-decompose.ts`): Core decomposition logic using explicit split plans
+4. **Decompose** (`decompose.ts`): Main entry point that delegates to manual decomposition
+5. **Split Suggestions** (`split-suggestions.ts`): Strategy system for automatic plan generation
+6. **Index** (`index.ts`): Public API with convenience wrapper function
+
+### Split Plan System
+
+Split plans use a simple string-based notation:
+
+```typescript
+type SplitPlan = Array<
+  | string                    // Simple path: 'user' or 'profile.bio'
+  | `${string}[${number}]`    // Chunk notation: 'category[50]'
+  | `${string}[${number}:${number}]`  // Slice notation: 'category[0:50]'
+>;
+```
+
+Examples:
+- `'user'` - Extract the entire 'user' object
+- `'profile.bio'` - Extract just the bio field from profile
+- `'category[50]'` - Split category enum into chunks of 50 items each
+- `'category[0:50]'` - Extract specific slice from category enum
+
+### Strategy Pattern for Suggestions
+
+The suggestion system uses a plugin architecture:
+
+```typescript
+interface SuggestionStrategy {
+  name: string;
+  suggest(schema: ZodObject<Record<string, ZodType>>, options?: unknown): SplitPlan;
+}
+```
+
+Built-in strategies:
+- **Size-based**: Groups schemas by token count limits and enum size constraints
+- **Semantic**: (Future) Groups by property name patterns and domain semantics
+
+### Enum Handling
+
+Enums support multiple splitting approaches:
+- **Even chunking**: Distributes enum options evenly across chunks
+- **Size-based chunking**: Creates chunks with maximum size limits
+- **Explicit slicing**: Allows precise control over enum ranges
+
+```typescript
+// Original enum
+z.enum(['opt1', 'opt2', ..., 'opt100'])
+
+// Chunked with bracket notation
+'category[25]' → [
+  'category[0:25]',   // opts 1-25
+  'category[25:50]',  // opts 26-50
+  'category[50:75]',  // opts 51-75
+  'category[75:100]'  // opts 76-100
+]
+```
+
+## TypeScript Support
+
+All types are properly defined with generic constraints:
+- `DecomposedSchema`: Represents a decomposed schema with metadata
+- `DecompositionOptions`: Configuration options for decomposition
+- Full type inference for schema shapes and validation results
+
+## Error Handling
+
+The utility provides comprehensive error handling:
+- Schema validation errors during decomposition
+- Invalid partial update attempts
+- Type mismatches and constraint violations
+- Detailed error messages for debugging

package/dist/apply.d.ts

@@ -0,0 +1,2 @@
+export declare const applyPartialUpdate: (currentState: unknown, targetPaths: string[], partialUpdate: unknown) => unknown;
+//# sourceMappingURL=apply.d.ts.map

package/dist/apply.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"apply.d.ts","sourceRoot":"","sources":["../src/apply.ts"],"names":[],"mappings":"AAcA,eAAO,MAAM,kBAAkB,GAC7B,cAAc,OAAO,EACrB,aAAa,MAAM,EAAE,EACrB,eAAe,OAAO,YAqEvB,CAAC"}

package/dist/apply.js

@@ -0,0 +1,65 @@
+import { produce } from 'immer';
+import { parseEnumSplit, setNestedValue } from './utils.js';
+// Helper to get nested value
+const get = (obj, path) => {
+    const keys = path.split('.');
+    let current = obj;
+    for (const key of keys) {
+        if (current == null)
+            return undefined;
+        current = current[key];
+    }
+    return current;
+};
+export const applyPartialUpdate = (currentState, targetPaths, partialUpdate) => {
+    return produce(currentState, (draft) => {
+        // Check if this is an array or record split update
+        const firstTargetPath = targetPaths[0];
+        const parsed = parseEnumSplit(firstTargetPath);
+        if (parsed.isArraySplit) {
+            // Handle array split update: partialUpdate should be { index: number, value: T }
+            const { index, value } = partialUpdate;
+            const arrayPath = parsed.path;
+            const arrayRef = get(draft, arrayPath);
+            if (!arrayRef || !Array.isArray(arrayRef)) {
+                console.warn(`Array not found at path: ${arrayPath}`);
+                return;
+            }
+            if (index < 0 || index >= arrayRef.length) {
+                console.warn(`Index ${index} out of bounds for array at ${arrayPath} (length: ${arrayRef.length})`);
+                return;
+            }
+            // Update the array element
+            Object.assign(arrayRef[index], value);
+            return;
+        }
+        if (parsed.isRecordSplit) {
+            // Handle record split update: partialUpdate should be { key: K, value: V }
+            const { key, value } = partialUpdate;
+            const recordPath = parsed.path;
+            const recordRef = get(draft, recordPath);
+            if (!recordRef || typeof recordRef !== 'object') {
+                console.warn(`Record not found at path: ${recordPath}`);
+                return;
+            }
+            // Update the record entry
+            recordRef[key] = value;
+            return;
+        }
+        // Handle regular property updates
+        Object.entries(partialUpdate).forEach(([key, value]) => {
+            // Find matching target path
+            const targetPath = targetPaths.find((path) => {
+                const parsedPath = parseEnumSplit(path);
+                // Exact match for leaf property
+                if (parsedPath.path.endsWith(`.${key}`) || parsedPath.path === key)
+                    return true;
+                return false;
+            });
+            if (targetPath) {
+                const parsedPath = parseEnumSplit(targetPath);
+                setNestedValue(draft, parsedPath.path, value);
+            }
+        });
+    });
+};

package/dist/cli.d.ts

@@ -0,0 +1,3 @@
+#!/usr/bin/env node
+export {};
+//# sourceMappingURL=cli.d.ts.map

package/dist/cli.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cli.d.ts","sourceRoot":"","sources":["../src/cli.ts"],"names":[],"mappings":""}