fp-pack 0.13.0 → 0.14.0

package/README.md

@@ -6,20 +6,17 @@
   **A practical functional toolkit for JavaScript and TypeScript.**
 </div>
 
-Written in TypeScript with full type safety, fp-pack works seamlessly in both JavaScript and TypeScript projects.
+The core philosophy of `fp-pack` is simple: **if you know functions, pipes, and currying, you're ready to use it.** It's a pipe-first toolkit for everyday code—approachable, zero-deps, and tree-shakeable.
 
-fp-pack is a focused collection of functional programming utilities designed for real-world applications.
-It emphasizes **function composition, immutability, and declarative code** through `pipe` and `pipeAsync`, while remaining approachable for everyday developers.
+**No complex monads. No wrapper ceremony.** Just plain functions that compose naturally, with an optional `SideEffect` pattern for early exits and error handling.
 
-The concept is simple: if you understand functions, pipes, and currying, you can use fp-pack immediately.
+At a glance:
+- **Composition-first** APIs centered around `pipe` / `pipeAsync`.
+- **TypeScript-native** utilities with strong inference (pipelines often work without manual type annotations).
+- **SideEffect pattern** for early exits and error handling — write normal functions, mark exceptional paths with `SideEffect.of()`, and let the pipeline handle the rest. No monad wrappers required.
 
-There's no framework and no heavy abstractions—just well-chosen helpers that make functional style easier to adopt and maintain in production code.
+If you want functional composition without a lot of ceremony, `fp-pack` is designed to be a practical starting point that still scales to larger codebases.
 
----
-
-> **⚠️ Project Status**
->
-> fp-pack is actively evolving as we refine its functional patterns in TypeScript. The core API is stable enough for daily use, but some edges may change as we improve the design.
 
 ---
 
@@ -95,8 +92,20 @@ There's no framework and no heavy abstractions—just well-chosen helpers that m
 - **Pipe-centric composition**
   `pipe` (sync) and `pipeAsync` (async) are the primary composition tools. All utilities are designed to work seamlessly in pipe chains.
 
+- **DX-optimized type inference**
+  **"Don't let strictness hinder inference."** fp-pack's standard `pipe` prioritizes **global type stability** over local constraints at connection points. The inference chain, designed without `NoInfer`, lets TypeScript derive perfect result types at the end of your pipeline—even without manual annotations. This **"Global Stability"** approach means you write less, TypeScript infers more, and your pipelines just work.
+
+  Works best in value-first pipelines where the input anchors generics. Function-first or from-start pipelines may need `pipeHint` or a small wrapper.
+
+  When users inappropriately use explicit type annotations, TypeScript's natural inference benefits are reduced, and in some edge cases intermediate type mismatches may be allowed to keep the pipeline flowing. When you need stricter mismatch detection, use `pipeStrict`/`pipeAsyncStrict`; for maximum inference power with minimal friction, stick to `pipe`/`pipeAsync`. → **[Pipe Choice Guide](https://superlucky84.github.io/fp-pack/#/ko/guide/pipe-choice-guide)**
+
 - **Pragmatic error handling**
-  The `SideEffect` pattern handles errors and side effects declaratively in `pipeSideEffect`/`pipeAsyncSideEffect` pipelines. Write normal functions that compose naturally—these pipelines automatically short-circuit when they encounter a `SideEffect`, eliminating the need for wrapper types everywhere. For strict union typing across branches, use `pipeSideEffectStrict` / `pipeAsyncSideEffectStrict`. Use `runPipeResult`/`matchSideEffect` **outside** the pipeline. If the input is narrowed to `SideEffect<R>` (e.g. after `isSideEffect`), `runPipeResult` returns `R`. If the result type is widened (e.g. `SideEffect<any>`), provide generics to recover a safe union. Use `isSideEffect` for precise runtime narrowing.
+  The `SideEffect` pattern handles errors declaratively in `pipeSideEffect`/`pipeAsyncSideEffect` and short-circuits on `SideEffect`, so you can keep normal functions.
+  For strict union typing across branches, use `pipeSideEffectStrict` / `pipeAsyncSideEffectStrict`.
+
+  **Usage notes:**
+  - Call `runPipeResult`/`matchSideEffect` **outside** the pipeline.
+  - After `isSideEffect`, `runPipeResult` returns the effect type; if widened (e.g. `SideEffect<any>`), pass generics to recover a safe union.
 
 - **Immutable & Pure by default**
   Core utilities avoid mutations and side effects. Any exception is explicitly named (e.g. `tap`, `log`).
@@ -157,9 +166,9 @@ yarn add fp-pack
 
 ## AI Agent Skills (Optional)
 
-fp-pack includes an AI agent skills file that helps AI coding assistants (Claude Code, GitHub Copilot, Cursor, etc.) automatically write fp-pack-style functional code.
+fp-pack includes an AI agent skills package that helps AI coding assistants (Claude Code, GitHub Copilot, Cursor, etc.) automatically write fp-pack-style functional code.
 
-When you have this skills file in your project, AI assistants will:
+When you have this skills package in your project, AI assistants will:
 - Default to using `pipe`/`pipeAsync` for pure transformations, and `pipeSideEffect`/`pipeAsyncSideEffect` when SideEffect is involved (use strict variants when you need strict effect unions)
 - Use the `SideEffect` pattern instead of try-catch
 - Prefer `stream/*` functions for large datasets
@@ -167,20 +176,24 @@ When you have this skills file in your project, AI assistants will:
 
 ### Setup for Claude Code
 
-Copy the skills file to your project's `.claude/skills/` directory:
+Copy the skills folder to your project's `.claude/skills/` directory:
 
 ```bash
 # Unix/macOS/Linux
-cp node_modules/fp-pack/dist/skills/fp-pack.md .claude/skills/
+mkdir -p .claude/skills/fp-pack
+cp -R node_modules/fp-pack/dist/skills/fp-pack/* .claude/skills/fp-pack/
 
 # Windows (PowerShell)
-Copy-Item node_modules/fp-pack/dist/skills/fp-pack.md .claude/skills/
+New-Item -ItemType Directory -Force -Path .claude/skills/fp-pack
+Copy-Item node_modules/fp-pack/dist/skills/fp-pack/* .claude/skills/fp-pack -Recurse
 
 # Or manually create the directory and copy
-mkdir -p .claude/skills
-cp node_modules/fp-pack/dist/skills/fp-pack.md .claude/skills/
+mkdir -p .claude/skills/fp-pack
+cp -R node_modules/fp-pack/dist/skills/fp-pack/* .claude/skills/fp-pack/
 ```
 
+If your tool expects a single file, point it to `.claude/skills/fp-pack/SKILL.md` or link that file to `.claude/skills/fp-pack.md`.
+
 ### Setup for Codex
 
 Copy the Codex skill to your project's `$CODEX_HOME/skills/` directory (default: `~/.codex/skills`):
@@ -188,22 +201,22 @@ Copy the Codex skill to your project's `$CODEX_HOME/skills/` directory (default:
 ```bash
 # Unix/macOS/Linux
 mkdir -p ~/.codex/skills/fp-pack
-cp node_modules/fp-pack/dist/skills/fp-pack/SKILL.md ~/.codex/skills/fp-pack/SKILL.md
+cp -R node_modules/fp-pack/dist/skills/fp-pack/* ~/.codex/skills/fp-pack/
 
 # Windows (PowerShell)
 New-Item -ItemType Directory -Force -Path "$HOME/.codex/skills/fp-pack"
-Copy-Item node_modules/fp-pack/dist/skills/fp-pack/SKILL.md $HOME/.codex/skills/fp-pack/SKILL.md
+Copy-Item node_modules/fp-pack/dist/skills/fp-pack/* $HOME/.codex/skills/fp-pack -Recurse
 ```
 
 Once configured, AI assistants will automatically apply fp-pack coding patterns when helping you write code.
 
-> **Note:** The skills file is located at `node_modules/fp-pack/dist/skills/fp-pack.md` after installation. You can also view it in the [GitHub repository](https://github.com/superlucky84/fp-pack/blob/main/fp-pack.md).
+> **Note:** The skills package is located at `node_modules/fp-pack/dist/skills/fp-pack/` after installation (includes `SKILL.md`, `examples/`, `reference/`, and `constraints/`). You can also view `SKILL.md` in the [GitHub repository](https://github.com/superlucky84/fp-pack/blob/main/skills/fp-pack/SKILL.md).
 
 ### AI Agent Role Add-on (Global)
 
 For agents with system prompt support (OpenCode, custom agents), fp-pack provides a **reusable behavior module** that conditionally enforces fp-pack patterns when fp-pack is detected in the project.
 
-Unlike skills files which are project-specific, this add-on is attached directly to your agent's system prompt, making it work across all your projects. It automatically activates only when fp-pack is installed.
+Unlike skills packages which are project-specific, this add-on is attached directly to your agent's system prompt, making it work across all your projects. It automatically activates only when fp-pack is installed.
 
 📖 **[View AI Agent Role Add-on Documentation](https://superlucky84.github.io/fp-pack/#/ai-agent-addon)**
 
@@ -664,9 +677,9 @@ Provide generics when inference is lost; prefer `isSideEffect` for precise narro
 Most data transformations are pure and don't need SideEffect handling. Use `pipe` for sync operations and `pipeAsync` for async operations. **Only switch to SideEffect-aware pipes when you actually need** early termination or error handling with side effects.
 
 **Pure Pipelines:**
-- **`pipe`** - Synchronous, **pure** transformations (99% of cases)
-- **`pipeStrict`** - Sync pipe with stricter type checking (catches mismatches earlier)
-- **`pipeAsync`** - Async, **pure** transformations (99% of cases)
+- **`pipe`** - Synchronous, **pure** transformations (99% of cases) - **DX-optimized** for global type inference
+- **`pipeStrict`** - Sync pipe with stricter type checking (catches mismatches earlier at connection points)
+- **`pipeAsync`** - Async, **pure** transformations (99% of cases) - **DX-optimized** for global type inference
 - **`pipeAsyncStrict`** - Async pipe with stricter type checking
 
 **SideEffect-Aware Pipelines:**
@@ -675,7 +688,9 @@ Most data transformations are pure and don't need SideEffect handling. Use `pipe
 - **`pipeAsyncSideEffect`** - **Only when you need** SideEffect short-circuiting (async)
 - **`pipeAsyncSideEffectStrict`** - Async SideEffect pipelines with strict effect unions
 
-**Important:** `pipe` and `pipeAsync` are for **pure** functions only—they don't handle `SideEffect`. If your pipeline can return `SideEffect`, use `pipeSideEffect` or `pipeAsyncSideEffect` instead. Choose the strict variants (`pipeStrict`, `pipeAsyncStrict`, `pipeSideEffectStrict`, `pipeAsyncSideEffectStrict`) when you need stricter type checking or precise unions for SideEffect results.
+**Important:**
+- `pipe` and `pipeAsync` are for **pure** functions only—they don't handle `SideEffect`. If your pipeline can return `SideEffect`, use `pipeSideEffect` or `pipeAsyncSideEffect` instead.
+- **Inference vs Strictness trade-off**: Standard `pipe`/`pipeAsync` prioritize **global type stability** (TypeScript infers the final result perfectly without manual annotations). Strict variants (`pipeStrict`, `pipeAsyncStrict`) catch type mismatches earlier but may require more type hints. Choose based on your needs: maximum inference power (standard) vs early error detection (strict).
 
 ```typescript
 // Pure sync pipe - no SideEffect handling
@@ -814,6 +829,7 @@ fp-pack draws inspiration from excellent functional programming libraries in the
 - **[Ramda](https://ramdajs.com/)** - A practical functional library that pioneered many of the patterns we use today
 - **[Remeda](https://remedajs.com/)** - Strongly influential TypeScript-first utility patterns and ergonomics
 - **[lodash/fp](https://lodash.com/docs/4.17.15#fp)** - Data-last, auto-curried utility style for functional composition
+- **[fp-ts](https://gcanti.github.io/fp-ts/)** - Advanced functional abstractions (e.g. Reader patterns) that influenced parts of this project
 - **[Rambda](https://github.com/selfrefactor/rambda)** - Lightweight Ramda-inspired functional utilities
 - **[FxJS](https://github.com/marpple/FxJS)** and **[FxTS](https://github.com/marpple/FxTS)** - Inspired by their exceptional combination of lazy evaluation and functional tooling patterns
 

package/dist/ai-addons/fp-pack-agent-addon.md

@@ -1,10 +1,10 @@
 # fp-pack Agent Role Add-on
 
-Document Version: 0.13.0
+Document Version: 0.14.0
 
 ## What This Document Is
 
-This document is a **reusable Agent Role Add-on** designed to enforce fp-pack functional programming patterns in AI coding agents.
+This document is a **reusable Agent Role Add-on** designed to guide fp-pack functional programming patterns in AI coding agents.
 
 This is not:
 - A human-readable tutorial
@@ -16,7 +16,7 @@ This is:
 - A self-contained behavior module
 - Copy-paste ready instructions for agent system prompts
 - A composable extension that modifies existing agent roles
-- A conditional enforcer that activates only when fp-pack is detected
+- A conditional guide that activates only when fp-pack is detected
 
 This add-on transforms any general-purpose coding agent into one that prioritizes fp-pack's declarative, functional composition patterns **when fp-pack is installed in the project**. No external documentation is required—all necessary context is embedded within this document.
 
@@ -24,7 +24,7 @@ This add-on transforms any general-purpose coding agent into one that prioritize
 
 **Attach this add-on to your agent when:**
 - You work across multiple projects, some using fp-pack and others not
-- You want automatic pattern enforcement when fp-pack is detected
+- You want automatic pattern guidance when fp-pack is detected
 - Your team adopts fp-pack selectively per project
 - You need a single agent configuration that adapts to project context
 
@@ -32,7 +32,7 @@ This add-on transforms any general-purpose coding agent into one that prioritize
 
 The agent will:
 - Detect fp-pack presence via `package.json` or `node_modules`
-- Enforce fp-pack patterns only in projects with fp-pack installed
+- Suggest fp-pack patterns only in projects with fp-pack installed
 - Use standard coding practices in projects without fp-pack
 - Never suggest installing fp-pack unless explicitly requested
 
@@ -44,77 +44,78 @@ The agent will:
 ## fp-pack Coding Behavior (Copy-Paste Block)
 
 ```
-You are a coding agent with fp-pack functional programming enforcement enabled.
+You are a coding agent with fp-pack functional programming guidance enabled.
 
 ACTIVATION CONDITIONS:
 
-These constraints apply ONLY when fp-pack is installed in the current project.
+These guidelines apply ONLY when fp-pack is installed in the current project.
 
-Before enforcing fp-pack patterns, verify fp-pack availability:
+Before suggesting fp-pack patterns, verify fp-pack availability:
 1. Check if `package.json` contains fp-pack in dependencies or devDependencies
 2. Check if `node_modules/fp-pack` directory exists
 3. Check if fp-pack imports are present in existing code
 
 If fp-pack is NOT installed:
-- Do not enforce these constraints
+- Do not enforce these guidelines
 - Use standard coding practices appropriate for the project
 - Never suggest installing fp-pack unless explicitly requested
 
 If fp-pack IS installed:
-- Enforce all constraints below strictly
-- Refuse code that violates these patterns
-- Suggest fp-pack alternatives for all imperative code
+- Apply all guidelines below
+- Suggest fp-pack alternatives for imperative code
+- Prioritize composition patterns for clarity and reuse
 
-BEHAVIORAL CONSTRAINTS:
+CODING GUIDELINES:
 
 1. COMPOSITION PRIORITY
-   - Use `pipe` for all synchronous data transformations
-   - Use `pipeAsync` for all asynchronous operations
-   - Never write imperative loops (for, while, forEach)
-   - Never chain native array methods (.map().filter().slice())
-   - All data flow must be expressed through function composition
-
-2. MUTATION PROHIBITION
-   - Never mutate objects or arrays
-   - Never use assignment operators on existing data structures
-   - Never modify function parameters
-   - All updates must create new immutable values
-
-3. OBJECT-ORIENTED PATTERN PROHIBITION
-   - Never create classes for business logic
-   - Never use inheritance hierarchies
-   - Never implement OOP design patterns (Factory, Strategy, etc.)
-   - Prefer function composition over object methods
-
-4. DECLARATIVE CONTROL FLOW
-   - Use `ifElse` instead of if/else statements
-   - Use `when`/`unless` for conditional execution
-   - Use `cond` instead of switch statements
-   - All branching logic must remain within pipe chains
-
-5. SIDE EFFECT HANDLING
-   - Use `pipeSideEffect` / `pipeAsyncSideEffect` for early termination patterns
-   - Use `pipeSideEffectStrict` / `pipeAsyncSideEffectStrict` for strict type unions
+   - Use `pipe` / `pipeAsync` for 2+ step transformations
+   - For single steps, call the function directly (no pipe needed)
+   - Prefer value-first: `pipe(value, ...)` for better type inference
+   - Use function-first only for reusable pipelines
+   - For trivial one-liners, native JS is acceptable when it's clearer
+
+2. IMMUTABILITY
+   - Prefer immutable operations over mutation
+   - Use fp-pack's object/array utilities for updates
+   - Return new values instead of modifying parameters
+   - Suggest immutable alternatives when mutation is detected
+
+3. DECLARATIVE PATTERNS
+   - Prefer `ifElse`, `when`, `unless`, `cond` for control flow within pipelines
+   - Simple if/else outside pipelines is acceptable
+   - Suggest functional control flow when complexity grows
+   - Keep branching logic within pipe chains when possible
+
+4. SIDE EFFECT HANDLING
+   - Use `pipeSideEffect*` / `pipeAsyncSideEffect*` for early termination
+   - Prefer `pipeSideEffectStrict` / `pipeAsyncSideEffectStrict` for strict unions
    - Wrap side effects in `SideEffect.of()`
-   - Call `runPipeResult` OUTSIDE pipelines for execution
-   - Never use try-catch within pipelines (use SideEffect pattern)
+   - Call `runPipeResult` OUTSIDE pipelines
+   - Use `isSideEffect` for precise type narrowing
+   - Try-catch outside pipelines is acceptable; inside pipelines prefer SideEffect
 
-6. LAZY EVALUATION FOR LARGE DATA
-   - Use `stream/*` functions for processing large datasets
-   - Never materialize entire datasets when lazy evaluation is possible
+5. LAZY EVALUATION FOR LARGE DATA
+   - Use `fp-pack/stream` functions for large/unbounded datasets
    - Prefer `toArray` only when final materialization is required
+   - Suggest stream utilities when processing efficiency matters
 
-7. ERROR HANDLING
-   - Errors and exceptional paths must use SideEffect pattern
-   - Never throw exceptions within pipe chains
+6. ERROR HANDLING
+   - Use SideEffect pattern for errors within pipelines
+   - Traditional try-catch is acceptable at boundaries/outside pipelines
    - Use `isSideEffect` for type-safe error branching
    - Call `runPipeResult` or `matchSideEffect` outside pipelines
 
-8. CODE REJECTION POLICY
-   - Refuse to write imperative loops
-   - Refuse to implement class-based solutions
-   - Refuse to mutate data structures
-   - Suggest fp-pack alternatives when requested patterns violate constraints
+7. PRACTICAL BALANCE
+   - Reach for fp-pack when composition adds clarity or reuse
+   - Simple imperative code is fine for trivial cases
+   - Don't force fp-pack patterns when they reduce readability
+   - Suggest refactoring when imperative code becomes complex
+
+8. SUGGESTION POLICY
+   - Suggest fp-pack alternatives for imperative patterns
+   - Explain benefits of functional approach
+   - Provide both imperative and fp-pack solutions when appropriate
+   - Respect user preferences if they choose imperative style
 
 IMPORT PATHS:
 - Core functions: `import { pipe, map, filter } from 'fp-pack'`
@@ -122,28 +123,24 @@ IMPORT PATHS:
 - SideEffect pattern: `import { pipeSideEffect, pipeSideEffectStrict, SideEffect, isSideEffect, runPipeResult } from 'fp-pack'`
 - Stream functions: `import { map, filter, toArray } from 'fp-pack/stream'`
 
-ENFORCEMENT:
-When user requests violate these constraints, respond with:
-1. Explanation of why the request violates fp-pack principles
-2. Alternative solution using fp-pack patterns
-3. Code example demonstrating the fp-pack approach
+GUIDANCE APPROACH:
+When user requests could benefit from fp-pack patterns:
+1. Provide solution using fp-pack patterns
+2. Explain advantages of the functional approach
+3. If user prefers imperative style, respect their choice
 
-When existing code violates these constraints, either:
-1. Refactor to fp-pack patterns automatically
-2. Warn about violations and suggest refactoring
+When existing code could be improved with fp-pack:
+1. Suggest fp-pack refactoring when it adds clarity
+2. Explain the benefits of the proposed changes
+3. Don't force refactoring for trivial improvements
 
 REFERENCE MATERIALS (NOT PART OF BEHAVIORAL RULES):
 
-This document is the **sole authoritative specification** for fp-pack-first coding behavior.
-
-If you need detailed usage examples, API patterns, or additional explanations
-for human readers, the following reference material may exist:
-
-node_modules/fp-pack/dist/skills/fp-pack.md
+For detailed guidance on fp-pack patterns and usage, refer to:
+node_modules/fp-pack/dist/skills/fp-pack/
 
-This reference material is **optional**. Agents must follow the behavioral
-constraints defined in this document regardless of whether external
-documentation exists or is accessible.
+This reference material provides comprehensive examples, troubleshooting tips,
+and pattern guidance that complements the behavioral guidelines above.
 ```
 
 ## Minimal fp-pack Interface Context
@@ -151,8 +148,10 @@ documentation exists or is accessible.
 This section provides minimal context to help agents locate and use fp-pack functions without becoming an API reference.
 
 ### Core Composition
-- **pipe** - Left-to-right synchronous composition
+- **pipe** - Left-to-right synchronous composition (use for 2+ steps)
+- **pipeStrict** - Stricter type checking between steps
 - **pipeAsync** - Left-to-right asynchronous composition
+- **pipeAsyncStrict** - Async with stricter type checking
 - **pipeSideEffect** - Composition with early termination (non-strict unions)
 - **pipeSideEffectStrict** - Composition with early termination (strict unions)
 - **pipeAsyncSideEffect** - Async composition with early termination (non-strict unions)
@@ -163,11 +162,12 @@ Available in `fp-pack`:
 - Array operations: `map`, `filter`, `reduce`, `take`, `drop`, `chunk`, `flatten`, `flatMap`, `sort`, `sortBy`, `groupBy`, `uniq`, `zip`
 - Object operations: `prop`, `pick`, `omit`, `assoc`, `merge`, `mapValues`, `evolve`, `path`
 - Control flow: `ifElse`, `when`, `unless`, `cond`
+- Utilities: `from`, `tap`, `tap0`, `curry`, `compose`
 
 ### SideEffect Pattern
 Available in `fp-pack`:
 - `SideEffect.of(fn, label?)` - Create side effect container
-- `isSideEffect(value)` - Runtime type guard
+- `isSideEffect(value)` - Runtime type guard (prefer for precise narrowing)
 - `runPipeResult(result)` - Execute side effect or return value (call OUTSIDE pipelines)
 - `matchSideEffect(result, handlers)` - Pattern match on result
 
@@ -181,6 +181,7 @@ Available in `fp-pack/stream`:
 Some data-last functions require explicit type hints in pipelines:
 - Use `pipeHint<Input, Output>(fn)` for type annotation
 - Affected functions: `chunk`, `drop`, `take`, `zip`, `prop`, `pick`, `omit`, `path`, `timeout`
+- Prefer value-first `pipe(value, ...)` to anchor types and avoid hints
 
 ## How to Attach This Add-on
 
@@ -198,10 +199,10 @@ Insert the "fp-pack Coding Behavior" block into your agent's system prompt:
     [your agent capabilities]...
   </capabilities>
 
-  <!-- INSERT fp-pack BEHAVIORAL CONSTRAINTS HERE -->
-  <coding-constraints>
+  <!-- INSERT fp-pack BEHAVIORAL GUIDELINES HERE -->
+  <coding-guidelines>
     [Copy the entire "fp-pack Coding Behavior (Copy-Paste Block)" section here]
-  </coding-constraints>
+  </coding-guidelines>
 
   <workflow>
     [your agent workflow]...
@@ -211,7 +212,7 @@ Insert the "fp-pack Coding Behavior" block into your agent's system prompt:
 
 ### Configuration Files
 
-For agent configuration files (YAML, JSON, etc.), adapt the constraints to the format:
+For agent configuration files (YAML, JSON, etc.), adapt the guidelines to the format:
 
 ```yaml
 agent:
@@ -219,7 +220,7 @@ agent:
   extensions:
     - type: "fp-pack-addon"
       content: |
-        [Paste fp-pack Coding Behavior constraints here]
+        [Paste fp-pack Coding Behavior guidelines here]
 ```
 
 ### Multiple Add-ons
@@ -229,9 +230,9 @@ This add-on composes with other role extensions:
 ```
 <agent-role>
   <base-role>Your agent identity</base-role>
-  <extension name="fp-pack-addon">[fp-pack constraints]</extension>
-  <extension name="security-addon">[security constraints]</extension>
-  <extension name="testing-addon">[testing constraints]</extension>
+  <extension name="fp-pack-addon">[fp-pack guidelines]</extension>
+  <extension name="security-addon">[security guidelines]</extension>
+  <extension name="testing-addon">[testing guidelines]</extension>
 </agent-role>
 ```
 
@@ -243,35 +244,49 @@ This document is structured as an add-on rather than a complete agent definition
 
 1. **Role Personalization**: Different teams have different agent personalities, capabilities, and workflows. A complete agent specification would impose unnecessary constraints on these preferences.
 
-2. **Composition Over Prescription**: Agent roles should be composable. This add-on focuses solely on enforcing fp-pack coding patterns, allowing users to combine it with other behavioral extensions (testing strategies, security policies, documentation standards).
+2. **Composition Over Prescription**: Agent roles should be composable. This add-on focuses solely on guiding fp-pack coding patterns, allowing users to combine it with other behavioral extensions (testing strategies, security policies, documentation standards).
 
 3. **Framework Agnostic**: Complete agent definitions often include framework-specific instructions or tool configurations. This add-on remains purely focused on coding behavior, independent of execution environment.
 
-4. **Maintenance Simplicity**: Behavioral constraints change less frequently than tool configurations or framework integrations. Separating concerns allows independent versioning and updates.
+4. **Maintenance Simplicity**: Behavioral guidelines change less frequently than tool configurations or framework integrations. Separating concerns allows independent versioning and updates.
 
-5. **Reusability Across Platforms**: Different AI platforms (OpenCode, custom agents, IDE extensions) have different configuration formats. A standalone behavioral module adapts more easily than a complete agent specification.
+5. **Reusability Across Platforms**: Different AI platforms (Claude Code, custom agents, IDE extensions) have different configuration formats. A standalone behavioral module adapts more easily than a complete agent specification.
 
-### Enforcement vs. Suggestion
+### Guidance vs. Enforcement
 
-This add-on enforces constraints rather than suggesting best practices. The distinction is critical:
+This add-on provides guidance rather than strict enforcement. The distinction is critical:
 
+- **Guidance**: Agent suggests fp-pack patterns and explains benefits
 - **Enforcement**: Agent refuses to generate code that violates constraints
-- **Suggestion**: Agent generates code and recommends improvements afterward
 
-fp-pack patterns require enforcement because:
-- Mixing imperative and functional styles creates inconsistent codebases
-- Partial adoption of composition patterns provides minimal benefit
-- Refactoring imperative code to functional style is more costly than writing functionally from the start
+fp-pack patterns benefit from guidance because:
+- **Flexibility**: Some situations genuinely benefit from imperative code
+- **Learning curve**: Developers need time to understand functional patterns
+- **Pragmatism**: Trivial one-liners don't always need composition
+- **Context matters**: Not every data transformation requires pipe
+
+### Balanced Approach
+
+This add-on follows the fp-pack SKILL.md philosophy:
+- "Use pipe for 2+ steps; for single steps, call the function directly"
+- "For trivial one-liners, using native JS directly is fine"
+- "Reach for fp-pack when composition adds clarity or reuse"
+
+**Why balanced over strict?**
+1. **Readability first**: Functional patterns should enhance, not obscure
+2. **Respect developer judgment**: Not every imperative pattern is wrong
+3. **Gradual adoption**: Teams can adopt fp-pack incrementally
+4. **Avoid dogma**: Pragmatism over purity
 
-### Selective Enforcement Based on Project Context
+### Selective Activation Based on Project Context
 
 This add-on activates conditionally based on fp-pack installation status:
 
-**Why selective enforcement?**
+**Why selective activation?**
 1. **Avoid forcing dependencies**: Agents should not impose architectural decisions on projects that haven't adopted fp-pack
 2. **Respect existing patterns**: Projects without fp-pack likely have established coding conventions that should be honored
-3. **Prevent confusion**: Enforcing fp-pack patterns without fp-pack available creates import errors and confusion
-4. **Enable experimentation**: Teams can evaluate fp-pack by installing it, triggering automatic pattern adoption
+3. **Prevent confusion**: Suggesting fp-pack patterns without fp-pack available creates import errors and confusion
+4. **Enable experimentation**: Teams can evaluate fp-pack by installing it, triggering automatic pattern guidance
 
 **Detection mechanism:**
 The agent verifies fp-pack availability through:
@@ -284,9 +299,9 @@ This detection-based activation allows a single agent configuration to work appr
 ### Design Constraints
 
 This add-on intentionally avoids:
-- **Complete API coverage**: Full API documentation belongs in separate references
+- **Complete API coverage**: Full API documentation belongs in separate references (skills/fp-pack/ reference files)
 - **Framework-specific patterns**: UI framework integration belongs in project-specific documentation
 - **Implementation details**: Internal fp-pack architecture is irrelevant to usage
-- **Philosophical arguments**: Functional programming theory is not required to enforce patterns
+- **Absolute prohibitions**: "Never" statements reduce flexibility and pragmatism
 
-The goal is minimal, actionable instructions that modify agent behavior without overwhelming the context window or duplicating external documentation.
+The goal is minimal, actionable guidance that modifies agent behavior without overwhelming the context window or duplicating external documentation.

package/dist/fp-pack.umd.js

@@ -1,2 +1,2 @@
-(function(u,p){typeof exports=="object"&&typeof module<"u"?p(exports):typeof define=="function"&&define.amd?define(["exports"],p):(u=typeof globalThis<"u"?globalThis:u||self,p(u.FpPack={}))})(this,(function(u){"use strict";function p(...n){if(n.length===0)return;const[t,...e]=n;if(typeof t=="function"){const r=[t,...e];return i=>r.reduce((c,o)=>o(c),i)}return e.reduce((r,i)=>i(r),t)}function P(...n){if(n.length===0)return;const[t,...e]=n;if(typeof t=="function"){const r=[t,...e];return i=>r.reduce((c,o)=>o(c),i)}return e.reduce((r,i)=>i(r),t)}function T(n){return n}function M(n){return(...t)=>{if(typeof t[0]=="function"){const i=t;return c=>o=>{const s=i.map(l=>(a=>l(a,o)));return n(c,...s)}}const[e,...r]=t;return i=>{const c=r.map(o=>(s=>o(s,i)));return n(e,...c)}}}class d{effect;label;constructor(t,e){this.effect=t,this.label=e}static of(t,e){return new d(t,e)}}function N(n,t){return n instanceof d?t.effect(n):t.value(n)}function v(n){return h(n)?n.effect():n}function h(n){return n instanceof d}function k(...n){const t=(i,c)=>{let o=i;for(const s of c){if(h(o))return o;o=s(o)}return o};if(n.length===0)return;const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function z(...n){const t=(i,c)=>{let o=i;for(const s of c){if(h(o))return o;o=s(o)}return o};if(n.length===0)return;const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function W(...n){return t=>n.reduceRight((e,r)=>r(e),t)}function f(n,...t){const e=r=>r.length>=n.length?n(...r):(...i)=>e([...r,...i]);return t.length===0?e([]):e(t)}function D(n,...t){return function(...r){const i=[...t,...r];return n.apply(this,i)}}function I(n){return function(...e){const r=[...e].reverse();return n.apply(this,r)}}function _(n,...t){return t.length===0?(...e)=>!n(...e):!n(...t)}function L(n){return n}function C(n){return()=>n}function K(n){const t=e=>n;return Object.defineProperty(t,"__from",{value:!0}),t}function q(n){return t=>(n(t),t)}function B(n){return()=>{n()}}function V(n){let t=!1,e;return function(...i){return t||(t=!0,e=n.apply(this,i)),e}}function F(n){const t=new Map,e=Symbol("result");return function(...i){let c=t;for(const s of i)c.has(s)||c.set(s,new Map),c=c.get(s);if(c.has(e))return c.get(e);const o=n.apply(this,i);return c.set(e,o),o}}function R(n,t,e,r){return n(r)?t(r):e(r)}const $=f(R);function U(n,t,e){return n(e)?t(e):e}const j=f(U);function H(n,t,e){return n(e)?e:t(e)}const G=f(H);function Z(n){return t=>{for(const[e,r]of n)if(e(t))return r(t)}}function J(n,t,e){try{return n(e)}catch(r){const i=r instanceof Error?r:new Error(String(r));return t(i,e)}}const Q=f(J);function X(n,t,e){return n(e)?e:t}const Y=f(X);function x(n,t){return t.map(n)}const nn=f(x);function tn(n,t){return t.filter(n)}const en=f(tn);function rn(n,t,e){return e.reduce(n,t)}const un=f(rn);function cn(n,t){return t.flatMap(n)}const on=f(cn);function fn(n,t){return t.find(n)}const sn=f(fn);function ln(n,t){for(let e=0;e<t.length;e++)if(n(t[e]))return!0;return!1}const an=f(ln);function dn(n,t){return t.every(n)}const hn=f(dn);function yn(n,t){return n<=0?[]:n>=t.length?[...t]:t.slice(0,n)}const pn=f(yn);function mn(n,t){const e=Math.floor(n);return!Number.isFinite(e)||e<=0?t:t.slice(e)}const gn=f(mn);function wn(n,t){const e=[];let r=!0;for(const i of t)r&&!n(i)&&(r=!1),r||e.push(i);return e}const An=f(wn);function Sn(n,t){const e=Math.floor(n);if(!Number.isFinite(e)||e<=0)return[];const r=[];for(let i=0;i<t.length;i+=e)r.push(t.slice(i,i+e));return r}const bn=f(Sn);function En(n,t){const e=Math.min(t.length,n.length),r=[];for(let i=0;i<e;i+=1)r.push([t[i],n[i]]);return r}const On=f(En);function Pn(n,t,e){const r=Math.min(e.length,t.length),i=[];for(let c=0;c<r;c+=1)i.push(n(e[c],t[c]));return i}const Tn=f(Pn);function Mn(n){const t=[],e=[];for(const[r,i]of n)t.push(r),e.push(i);return[t,e]}function Nn(n){const t=new Set,e=[];for(const r of n)t.has(r)||(t.add(r),e.push(r));return e}function vn(n,t){const e=new Set,r=[];for(const i of t){const c=n(i);e.has(c)||(e.add(c),r.push(i))}return r}const kn=f(vn);function zn(n,t){return[...t].sort((e,r)=>{const i=n(e),c=n(r);return i<c?-1:i>c?1:0})}const Wn=f(zn);function Dn(n,t){return[...t].sort(n)}const In=f(Dn);function _n(n,t){return t.reduce((e,r)=>{const i=n(r);return e[i]||(e[i]=[]),e[i].push(r),e},{})}const Ln=f(_n);function Cn(n){return n.map((t,e)=>[e,t])}function Kn(n,t){const e=[];for(const r of t){if(!n(r))break;e.push(r)}return e}const qn=f(Kn);function Bn(n,t,e){const r=[];let i=t;for(const c of e)i=n(i,c),r.push(i);return r}const Vn=f(Bn);function Fn(n,t){return[...t,...n]}const Rn=f(Fn);function $n(n,t){return[...t,n]}const Un=f($n);function jn(n,t){return[n,...t]}const Hn=f(jn);function Gn(n){return n.flat()}function Zn(n){return n[0]}function Jn(n){return n.slice(1)}function Qn(n){if(n.length!==0)return n[n.length-1]}function Xn(n){return n.length<=1?[]:n.slice(0,-1)}function Yn(n,t){if(!Number.isFinite(n)||!Number.isFinite(t))return[];if(n===t)return[];const e=n<t?1:-1,r=[];for(let i=n;e>0?i<t:i>t;i+=e)r.push(i);return r}function xn(n,t){const e=[],r=[];for(const i of t)n(i)?e.push(i):r.push(i);return[e,r]}const nt=f(xn);function tt(n){const t=[],e=r=>{for(const i of r)Array.isArray(i)?e(i):t.push(i)};return e(n),t}function et(n,t){return t?.[n]}const rt=f(et);function it(n,t){const e=t?.[n];if(e==null)throw new Error(`propStrict: "${String(n)}" is null or undefined`);return e}const ut=f(it);function ct(n,t,e){const r=e?.[t];return r??n}const ot=f(ct);function ft(n,t){return n.reduce((e,r)=>e?.[r],t)}const st=f(ft);function lt(n,t,e){const r=t.reduce((i,c)=>i?.[c],e);return r??n}const at=f(lt);function dt(n,t){const e={};for(const r of n)r in t&&(e[r]=t[r]);return e}const ht=f(dt);function yt(n,t){const e={...t};for(const r of n)delete e[r];return e}const pt=f(yt);function mt(n,t,e){if(Array.isArray(e)){const r=e.slice();return r[n]=t,r}return e&&typeof e=="object"?{...e,[n]:t}:{[n]:t}}const gt=f(mt),S=n=>typeof n=="number"?Number.isInteger(n):typeof n=="string"?/^-?\d+$/.test(n):!1,wt=(n,t)=>{const e=typeof n=="number"?n:Number(n);return Number.isNaN(e)?-1:e<0?Math.max(t+e,0):e},b=n=>n!==null&&typeof n=="object";function m(n,t,e){if(n.length===0)return t;const[r,...i]=n,c=S(r),o=Array.isArray(e)?e.slice():b(e)?{...e}:c?[]:{};if(Array.isArray(o)&&S(r)){const a=wt(r,o.length),w=o[a],A=i.length===0?t:m(i,t,w);return o[a]=A,o}const s=b(o)?o[r]:void 0,l=i.length===0?t:m(i,t,s);return o[r]=l,o}const At=f(m);function St(n,t){if(Array.isArray(t)){const e=t.slice(),r=typeof n=="number"?n:Number.isNaN(Number(n))?-1:Number(n);return r>=0&&r<e.length?e.splice(r,1):delete e[n],e}if(t&&typeof t=="object"){const{[n]:e,...r}=t;return r}return t}const bt=n=>typeof n=="number"?Number.isInteger(n):typeof n=="string"?/^-?\d+$/.test(n):!1,Et=(n,t)=>{const e=typeof n=="number"?n:Number(n);return Number.isNaN(e)?-1:e<0?t+e:e},Ot=n=>n!==null&&typeof n=="object";function g(n,t){if(n.length===0||!Ot(t))return t;const[e,...r]=n;if(Array.isArray(t)&&bt(e)){const c=Et(e,t.length);if(c<0||c>=t.length)return t;const o=t.slice();if(r.length===0)return o.splice(c,1),o;const s=g(r,o[c]);return o[c]=s,o}if(!Object.prototype.hasOwnProperty.call(t,e))return t;if(r.length===0){const{[e]:c,...o}=t;return o}const i={...t};return i[e]=g(r,i[e]),i}const Pt=f(g);function Tt(n,t){return{...n,...t}}const Mt=f(Tt);function Nt(n,t){const e=i=>typeof i=="object"&&i!==null&&!Array.isArray(i),r=(i,c)=>{const o={...i};for(const[s,l]of Object.entries(c)){const a=o[s];e(a)&&e(l)?o[s]=r(a,l):o[s]=l}return o};return e(n)&&e(t)?r(n,t):{...n,...t}}const vt=f(Nt);function kt(n){return n.reduce((e,r)=>({...e,...r}),{})}function zt(n){return Object.keys(n)}function Wt(n){return Object.values(n)}function Dt(n){return Object.entries(n)}function It(n){return t=>{const e={};for(const[r,i]of Object.entries(t))e[r]=n(i);return e}}function _t(n,t){const e={...t};for(const r of Object.keys(n)){const i=n[r];typeof i=="function"&&(e[r]=i(t[r]))}return e}const Lt=f(_t);function Ct(n,t){return Object.prototype.hasOwnProperty.call(t,n)}const Kt=f(Ct);function qt(n){return t=>{let e=t;for(const r of n){if(e==null||!Object.prototype.hasOwnProperty.call(e,r))return!1;e=e[r]}return!0}}function Bt(n,t){return y(n,t,new WeakMap)}function y(n,t,e){if(n===t||typeof n=="number"&&typeof t=="number"&&Number.isNaN(n)&&Number.isNaN(t))return!0;if(n===null||t===null||typeof n!="object"||typeof t!="object")return!1;if(e.has(n))return e.get(n)===t;if(e.set(n,t),n instanceof Date&&t instanceof Date)return n.getTime()===t.getTime();if(n instanceof Map&&t instanceof Map){if(n.size!==t.size)return!1;const c=Array.from(t.entries());for(const[o,s]of n.entries()){let l=!1;for(let a=0;a<c.length;a++){const[w,A]=c[a];if(y(o,w,e)&&y(s,A,e)){c.splice(a,1),l=!0;break}}if(!l)return!1}return!0}if(n instanceof Set&&t instanceof Set){if(n.size!==t.size)return!1;const c=Array.from(t.values());for(const o of n.values()){let s=!1;for(let l=0;l<c.length;l++)if(y(o,c[l],e)){c.splice(l,1),s=!0;break}if(!s)return!1}return!0}if(Array.isArray(n)&&Array.isArray(t)){if(n.length!==t.length)return!1;for(let c=0;c<n.length;c++)if(!y(n[c],t[c],e))return!1;return!0}const r=Reflect.ownKeys(n),i=Reflect.ownKeys(t);if(r.length!==i.length)return!1;for(const c of r)if(!Object.prototype.hasOwnProperty.call(t,c)||!y(n[c],t[c],e))return!1;return!0}const E=f(Bt);function Vt(n){return n==null}function Ft(n){return n==null?!0:typeof n=="string"||Array.isArray(n)?n.length===0:n instanceof Map||n instanceof Set?n.size===0:typeof n=="object"?Object.keys(n).length===0:!1}function Rt(n){const t=n.toLowerCase();return e=>{if(e===null)return t==="null";if(e===void 0)return t==="undefined";const r=typeof e;return r!=="object"?r===t:Object.prototype.toString.call(e).slice(8,-1).toLowerCase()===t}}function $t(n){return t=>t>n}function Ut(n){return t=>t>=n}function jt(n){return t=>t<n}function Ht(n){return t=>t<=n}function Gt(n,t,e){return e<n?n:e>t?t:e}const Zt=f(Gt);function Jt(n,t){if(typeof t=="string"&&typeof n=="string")return t.includes(n);if(Array.isArray(t)){for(let e=0;e<t.length;e++)if(E(t[e],n))return!0;return!1}return!1}function Qt(n,t){return n+t}const Xt=f(Qt);function Yt(n,t){return n-t}const xt=f(Yt);function ne(n,t){return n*t}const te=f(ne);function ee(n,t){return n/t}const re=f(ee);function ie(n){return n.reduce((t,e)=>t+e,0)}function ue(n){return n.length===0?NaN:n.reduce((e,r)=>e+r,0)/n.length}function ce(n){return n.length===0?1/0:Math.min(...n)}function oe(n){return n.length===0?-1/0:Math.max(...n)}function fe(n){return Math.round(n)}function se(n){return Math.floor(n)}function le(n){return Math.ceil(n)}function ae(n,t){const e=Math.ceil(n),r=Math.floor(t);return r<e?e:Math.floor(Math.random()*(r-e+1))+e}const de=f(ae);function he(n){return n.trim()}function ye(n,t){return t.split(n)}const pe=f(ye);function me(n,t){return t.join(n)}const ge=f(me);function we(n,t,e){return e.replace(n,t)}const Ae=f(we);function Se(n){return n.toUpperCase()}function be(n){return n.toLowerCase()}function Ee(n,t){if(typeof t=="string"&&typeof n=="string")return t.startsWith(n);if(Array.isArray(n)&&Array.isArray(t)){if(n.length===0)return!0;if(n.length>t.length)return!1;for(let e=0;e<n.length;e++)if(t[e]!==n[e])return!1;return!0}return!1}function Oe(n,t){if(typeof t=="string"&&typeof n=="string")return t.endsWith(n);if(Array.isArray(n)&&Array.isArray(t)){if(n.length===0)return!0;if(n.length>t.length)return!1;for(let e=0;e<n.length;e++){const r=t.length-n.length+e;if(t[r]!==n[e])return!1}return!0}return!1}function Pe(n,t){return t.match(n)}const Te=f(Pe);function Me(...n){const t=async(i,c)=>{let o=i;for(const s of c)o=await s(o);return o};if(n.length===0)return Promise.resolve(void 0);const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function Ne(...n){const t=async(i,c)=>{let o=i;for(const s of c)o=await s(o);return o};if(n.length===0)return Promise.resolve(void 0);const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function ve(...n){const t=async(i,c)=>{let o=i;for(const s of c){if(h(o))return o;o=await s(o)}return o};if(n.length===0)return Promise.resolve(void 0);const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function ke(...n){const t=async(i,c)=>{let o=i;for(const s of c){if(h(o))return o;o=await s(o)}return o};if(n.length===0)return Promise.resolve(void 0);const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function O(n){return new Promise(t=>{setTimeout(t,n)})}function ze(n,t){return new Promise((e,r)=>{const i=setTimeout(()=>r(new Error(`Timed out after ${n}ms`)),n);t.then(c=>{clearTimeout(i),e(c)}).catch(c=>{clearTimeout(i),r(c)})})}const We=f(ze);function De(n,t,e=0){return(async()=>{let r=0;for(;;)try{return await t()}catch(i){if(r+=1,r>n)throw i;e>0&&await O(e)}})()}const Ie=f(De);function _e(n,t){let e;return function(...i){e&&clearTimeout(e);const c=this;e=setTimeout(()=>{e=void 0,n.apply(c,i)},t)}}const Le=f(_e);function Ce(n,t){let e;return function(...i){e||(n.apply(this,i),e=setTimeout(()=>{e=void 0},t))}}const Ke=f(Ce);function qe(n,t){let e,r=!1,i,c;const o=()=>{e=void 0,r&&i&&(r=!1,n.apply(c,i))};return function(...l){if(!e){n.apply(this,l),e=setTimeout(o,t);return}r=!0,i=l,c=this,clearTimeout(e),e=setTimeout(o,t)}}const Be=f(qe);function Ve(n,t){let e=0,r=null,i=null;const c=(s,l)=>{e=Date.now(),n.apply(s,l)};return function(...s){const l=Date.now(),a=t-(l-e);a<=0?(i&&(clearTimeout(i),i=null),r=null,c(this,s)):(r=s,i||(i=setTimeout(()=>{i=null,r&&(c(this,r),r=null)},a)))}}const Fe=f(Ve);function Re(n){return t=>t==null?null:n(t)}function $e(n){return t=>{const e=[];for(const r of t){const i=n(r);i!=null&&e.push(i)}return e}}function Ue(n){return t=>t??n}function je(n){try{return{ok:!0,value:n()}}catch(t){return{ok:!1,error:t}}}function He(n,t,e){return e==null?n():t(e)}const Ge=f(He);function Ze(n,t){if(!n)throw new Error(t??"Assertion failed")}const Je=f(Ze);function Qe(n,t){if(!n)throw new Error(t??"Invariant failed")}const Xe=f(Qe);function Ye(n){return t=>(n?console.log(n,t):console.log(t),t)}u.SideEffect=d,u.SideEffectClass=d,u.add=Xt,u.append=Un,u.assert=Je,u.assoc=gt,u.assocPath=At,u.ceil=le,u.chunk=bn,u.clamp=Zt,u.complement=_,u.compose=W,u.concat=Rn,u.cond=Z,u.constant=C,u.curry=f,u.debounce=Le,u.debounceLeading=Ke,u.debounceLeadingTrailing=Be,u.delay=O,u.dissoc=St,u.dissocPath=Pt,u.div=re,u.drop=gn,u.dropWhile=An,u.endsWith=Oe,u.entries=Dt,u.equals=E,u.every=hn,u.evolve=Lt,u.filter=en,u.find=sn,u.flatMap=on,u.flatten=Gn,u.flattenDeep=tt,u.flip=I,u.floor=se,u.fold=Ge,u.from=K,u.getOrElse=Ue,u.groupBy=Ln,u.gt=$t,u.gte=Ut,u.guard=Y,u.has=Kt,u.hasPath=qt,u.head=Zn,u.identity=L,u.ifElse=$,u.includes=Jt,u.init=Xn,u.invariant=Xe,u.isEmpty=Ft,u.isNil=Vt,u.isSideEffect=h,u.isType=Rt,u.join=ge,u.keys=zt,u.last=Qn,u.log=Ye,u.lt=jt,u.lte=Ht,u.map=nn,u.mapMaybe=$e,u.mapValues=It,u.match=Te,u.matchSideEffect=N,u.max=oe,u.maybe=Re,u.mean=ue,u.memoize=F,u.merge=Mt,u.mergeAll=kt,u.mergeDeep=vt,u.min=ce,u.mul=te,u.omit=pt,u.once=V,u.partial=D,u.partition=nt,u.path=st,u.pathOr=at,u.pick=ht,u.pipe=p,u.pipeAsync=Me,u.pipeAsyncSideEffect=ve,u.pipeAsyncSideEffectStrict=ke,u.pipeAsyncStrict=Ne,u.pipeHint=T,u.pipeSideEffect=k,u.pipeSideEffectStrict=z,u.pipeStrict=P,u.pipeWithDeps=M,u.prepend=Hn,u.prop=rt,u.propOr=ot,u.propStrict=ut,u.randomInt=de,u.range=Yn,u.reduce=un,u.replace=Ae,u.result=je,u.retry=Ie,u.round=fe,u.runPipeResult=v,u.scan=Vn,u.some=an,u.sort=In,u.sortBy=Wn,u.split=pe,u.startsWith=Ee,u.sub=xt,u.sum=ie,u.tail=Jn,u.take=pn,u.takeWhile=qn,u.tap=q,u.tap0=B,u.throttle=Fe,u.timeout=We,u.toLower=be,u.toUpper=Se,u.trim=he,u.tryCatch=Q,u.uniq=Nn,u.uniqBy=kn,u.unless=G,u.unzip=Mn,u.values=Wt,u.when=j,u.zip=On,u.zipIndex=Cn,u.zipWith=Tn,Object.defineProperty(u,Symbol.toStringTag,{value:"Module"})}));
+(function(u,y){typeof exports=="object"&&typeof module<"u"?y(exports):typeof define=="function"&&define.amd?define(["exports"],y):(u=typeof globalThis<"u"?globalThis:u||self,y(u.FpPack={}))})(this,(function(u){"use strict";function y(...n){if(n.length===0)return;const[t,...e]=n;if(typeof t=="function"){const r=[t,...e];return i=>r.reduce((c,o)=>o(c),i)}return e.reduce((r,i)=>i(r),t)}function M(...n){if(n.length===0)return;const[t,...e]=n;if(typeof t=="function"){const r=[t,...e];return i=>r.reduce((c,o)=>o(c),i)}return e.reduce((r,i)=>i(r),t)}const S=M;Object.defineProperty(S,"__pipe_strict",{value:!0});function N(n){return n}function v(n){return(...t)=>{if(typeof t[0]=="function"){const i=t;return c=>o=>{const s=i.map(l=>(a=>l(a,o)));return n(c,...s)}}const[e,...r]=t;return i=>{const c=r.map(o=>(s=>o(s,i)));return n(e,...c)}}}class d{effect;label;constructor(t,e){this.effect=t,this.label=e}static of(t,e){return new d(t,e)}}function _(n,t){return n instanceof d?t.effect(n):t.value(n)}function k(n){return h(n)?n.effect():n}function h(n){return n instanceof d}function W(...n){const t=(i,c)=>{let o=i;for(const s of c){if(h(o))return o;o=s(o)}return o};if(n.length===0)return;const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function z(...n){const t=(i,c)=>{let o=i;for(const s of c){if(h(o))return o;o=s(o)}return o};if(n.length===0)return;const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function D(...n){return t=>n.reduceRight((e,r)=>r(e),t)}function f(n,...t){const e=r=>r.length>=n.length?n(...r):(...i)=>e([...r,...i]);return t.length===0?e([]):e(t)}function I(n,...t){return function(...r){const i=[...t,...r];return n.apply(this,i)}}function L(n){return function(...e){const r=[...e].reverse();return n.apply(this,r)}}function B(n,...t){return t.length===0?(...e)=>!n(...e):!n(...t)}function C(n){return n}function K(n){return()=>n}function q(n){const t=e=>n;return Object.defineProperty(t,"__from",{value:!0}),t}function V(n){return t=>(n(t),t)}function F(n){return()=>{n()}}function R(n){let t=!1,e;return function(...i){return t||(t=!0,e=n.apply(this,i)),e}}function $(n){const t=new Map,e=Symbol("result");return function(...i){let c=t;for(const s of i)c.has(s)||c.set(s,new Map),c=c.get(s);if(c.has(e))return c.get(e);const o=n.apply(this,i);return c.set(e,o),o}}function U(n,t,e,r){return n(r)?t(r):e(r)}const j=f(U);function H(n,t,e){return n(e)?t(e):e}const G=f(H);function Z(n,t,e){return n(e)?e:t(e)}const J=f(Z);function Q(n){return t=>{for(const[e,r]of n)if(e(t))return r(t)}}function X(n,t,e){try{return n(e)}catch(r){const i=r instanceof Error?r:new Error(String(r));return t(i,e)}}const Y=f(X);function x(n,t,e){return n(e)?e:t}const nn=f(x);function tn(n,t){return t.map(n)}const en=f(tn);function rn(n,t){return t.filter(n)}const un=f(rn);function cn(n,t,e){return e.reduce(n,t)}const on=f(cn);function fn(n,t){return t.flatMap(n)}const sn=f(fn);function ln(n,t){return t.find(n)}const an=f(ln);function dn(n,t){for(let e=0;e<t.length;e++)if(n(t[e]))return!0;return!1}const hn=f(dn);function pn(n,t){return t.every(n)}const yn=f(pn);function mn(n,t){return n<=0?[]:n>=t.length?[...t]:t.slice(0,n)}const gn=f(mn);function An(n,t){const e=Math.floor(n);return!Number.isFinite(e)||e<=0?t:t.slice(e)}const wn=f(An);function Sn(n,t){const e=[];let r=!0;for(const i of t)r&&!n(i)&&(r=!1),r||e.push(i);return e}const bn=f(Sn);function On(n,t){const e=Math.floor(n);if(!Number.isFinite(e)||e<=0)return[];const r=[];for(let i=0;i<t.length;i+=e)r.push(t.slice(i,i+e));return r}const Pn=f(On);function En(n,t){const e=Math.min(t.length,n.length),r=[];for(let i=0;i<e;i+=1)r.push([t[i],n[i]]);return r}const Tn=f(En);function Mn(n,t,e){const r=Math.min(e.length,t.length),i=[];for(let c=0;c<r;c+=1)i.push(n(e[c],t[c]));return i}const Nn=f(Mn);function vn(n){const t=[],e=[];for(const[r,i]of n)t.push(r),e.push(i);return[t,e]}function _n(n){const t=new Set,e=[];for(const r of n)t.has(r)||(t.add(r),e.push(r));return e}function kn(n,t){const e=new Set,r=[];for(const i of t){const c=n(i);e.has(c)||(e.add(c),r.push(i))}return r}const Wn=f(kn);function zn(n,t){return[...t].sort((e,r)=>{const i=n(e),c=n(r);return i<c?-1:i>c?1:0})}const Dn=f(zn);function In(n,t){return[...t].sort(n)}const Ln=f(In);function Bn(n,t){return t.reduce((e,r)=>{const i=n(r);return e[i]||(e[i]=[]),e[i].push(r),e},{})}const Cn=f(Bn);function Kn(n){return n.map((t,e)=>[e,t])}function qn(n,t){const e=[];for(const r of t){if(!n(r))break;e.push(r)}return e}const Vn=f(qn);function Fn(n,t,e){const r=[];let i=t;for(const c of e)i=n(i,c),r.push(i);return r}const Rn=f(Fn);function $n(n,t){return[...t,...n]}const Un=f($n);function jn(n,t){return[...t,n]}const Hn=f(jn);function Gn(n,t){return[n,...t]}const Zn=f(Gn);function Jn(n){return n.flat()}function Qn(n){return n[0]}function Xn(n){return n.slice(1)}function Yn(n){if(n.length!==0)return n[n.length-1]}function xn(n){return n.length<=1?[]:n.slice(0,-1)}function nt(n,t){if(!Number.isFinite(n)||!Number.isFinite(t))return[];if(n===t)return[];const e=n<t?1:-1,r=[];for(let i=n;e>0?i<t:i>t;i+=e)r.push(i);return r}function tt(n,t){const e=[],r=[];for(const i of t)n(i)?e.push(i):r.push(i);return[e,r]}const et=f(tt);function rt(n){const t=[],e=r=>{for(const i of r)Array.isArray(i)?e(i):t.push(i)};return e(n),t}function it(n,t){return t?.[n]}const ut=f(it);function ct(n,t){const e=t?.[n];if(e==null)throw new Error(`propStrict: "${String(n)}" is null or undefined`);return e}const ot=f(ct);function ft(n,t,e){const r=e?.[t];return r??n}const st=f(ft);function lt(n,t){return n.reduce((e,r)=>e?.[r],t)}const at=f(lt);function dt(n,t,e){const r=t.reduce((i,c)=>i?.[c],e);return r??n}const ht=f(dt);function pt(n,t){const e={};for(const r of n)r in t&&(e[r]=t[r]);return e}const yt=f(pt);function mt(n,t){const e={...t};for(const r of n)delete e[r];return e}const gt=f(mt);function At(n,t,e){if(Array.isArray(e)){const r=e.slice();return r[n]=t,r}return e&&typeof e=="object"?{...e,[n]:t}:{[n]:t}}const wt=f(At),b=n=>typeof n=="number"?Number.isInteger(n):typeof n=="string"?/^-?\d+$/.test(n):!1,St=(n,t)=>{const e=typeof n=="number"?n:Number(n);return Number.isNaN(e)?-1:e<0?Math.max(t+e,0):e},O=n=>n!==null&&typeof n=="object";function m(n,t,e){if(n.length===0)return t;const[r,...i]=n,c=b(r),o=Array.isArray(e)?e.slice():O(e)?{...e}:c?[]:{};if(Array.isArray(o)&&b(r)){const a=St(r,o.length),A=o[a],w=i.length===0?t:m(i,t,A);return o[a]=w,o}const s=O(o)?o[r]:void 0,l=i.length===0?t:m(i,t,s);return o[r]=l,o}const bt=f(m);function Ot(n,t){if(Array.isArray(t)){const e=t.slice(),r=typeof n=="number"?n:Number.isNaN(Number(n))?-1:Number(n);return r>=0&&r<e.length?e.splice(r,1):delete e[n],e}if(t&&typeof t=="object"){const{[n]:e,...r}=t;return r}return t}const Pt=n=>typeof n=="number"?Number.isInteger(n):typeof n=="string"?/^-?\d+$/.test(n):!1,Et=(n,t)=>{const e=typeof n=="number"?n:Number(n);return Number.isNaN(e)?-1:e<0?t+e:e},Tt=n=>n!==null&&typeof n=="object";function g(n,t){if(n.length===0||!Tt(t))return t;const[e,...r]=n;if(Array.isArray(t)&&Pt(e)){const c=Et(e,t.length);if(c<0||c>=t.length)return t;const o=t.slice();if(r.length===0)return o.splice(c,1),o;const s=g(r,o[c]);return o[c]=s,o}if(!Object.prototype.hasOwnProperty.call(t,e))return t;if(r.length===0){const{[e]:c,...o}=t;return o}const i={...t};return i[e]=g(r,i[e]),i}const Mt=f(g);function Nt(n,t){return{...n,...t}}const vt=f(Nt);function _t(n,t){const e=i=>typeof i=="object"&&i!==null&&!Array.isArray(i),r=(i,c)=>{const o={...i};for(const[s,l]of Object.entries(c)){const a=o[s];e(a)&&e(l)?o[s]=r(a,l):o[s]=l}return o};return e(n)&&e(t)?r(n,t):{...n,...t}}const kt=f(_t);function Wt(n){return n.reduce((e,r)=>({...e,...r}),{})}function zt(n){return Object.keys(n)}function Dt(n){return Object.values(n)}function It(n){return Object.entries(n)}function Lt(n){return t=>{const e={};for(const[r,i]of Object.entries(t))e[r]=n(i);return e}}function Bt(n,t){const e={...t};for(const r of Object.keys(n)){const i=n[r];typeof i=="function"&&(e[r]=i(t[r]))}return e}const Ct=f(Bt);function Kt(n,t){return Object.prototype.hasOwnProperty.call(t,n)}const qt=f(Kt);function Vt(n){return t=>{let e=t;for(const r of n){if(e==null||!Object.prototype.hasOwnProperty.call(e,r))return!1;e=e[r]}return!0}}function Ft(n,t){return p(n,t,new WeakMap)}function p(n,t,e){if(n===t||typeof n=="number"&&typeof t=="number"&&Number.isNaN(n)&&Number.isNaN(t))return!0;if(n===null||t===null||typeof n!="object"||typeof t!="object")return!1;if(e.has(n))return e.get(n)===t;if(e.set(n,t),n instanceof Date&&t instanceof Date)return n.getTime()===t.getTime();if(n instanceof Map&&t instanceof Map){if(n.size!==t.size)return!1;const c=Array.from(t.entries());for(const[o,s]of n.entries()){let l=!1;for(let a=0;a<c.length;a++){const[A,w]=c[a];if(p(o,A,e)&&p(s,w,e)){c.splice(a,1),l=!0;break}}if(!l)return!1}return!0}if(n instanceof Set&&t instanceof Set){if(n.size!==t.size)return!1;const c=Array.from(t.values());for(const o of n.values()){let s=!1;for(let l=0;l<c.length;l++)if(p(o,c[l],e)){c.splice(l,1),s=!0;break}if(!s)return!1}return!0}if(Array.isArray(n)&&Array.isArray(t)){if(n.length!==t.length)return!1;for(let c=0;c<n.length;c++)if(!p(n[c],t[c],e))return!1;return!0}const r=Reflect.ownKeys(n),i=Reflect.ownKeys(t);if(r.length!==i.length)return!1;for(const c of r)if(!Object.prototype.hasOwnProperty.call(t,c)||!p(n[c],t[c],e))return!1;return!0}const P=f(Ft);function Rt(n){return n==null}function $t(n){return n==null?!0:typeof n=="string"||Array.isArray(n)?n.length===0:n instanceof Map||n instanceof Set?n.size===0:typeof n=="object"?Object.keys(n).length===0:!1}function Ut(n){const t=n.toLowerCase();return e=>{if(e===null)return t==="null";if(e===void 0)return t==="undefined";const r=typeof e;return r!=="object"?r===t:Object.prototype.toString.call(e).slice(8,-1).toLowerCase()===t}}function jt(n){return t=>t>n}function Ht(n){return t=>t>=n}function Gt(n){return t=>t<n}function Zt(n){return t=>t<=n}function Jt(n,t,e){return e<n?n:e>t?t:e}const Qt=f(Jt);function Xt(n,t){if(typeof t=="string"&&typeof n=="string")return t.includes(n);if(Array.isArray(t)){for(let e=0;e<t.length;e++)if(P(t[e],n))return!0;return!1}return!1}function Yt(n,t){return n+t}const xt=f(Yt);function ne(n,t){return n-t}const te=f(ne);function ee(n,t){return n*t}const re=f(ee);function ie(n,t){return n/t}const ue=f(ie);function ce(n){return n.reduce((t,e)=>t+e,0)}function oe(n){return n.length===0?NaN:n.reduce((e,r)=>e+r,0)/n.length}function fe(n){return n.length===0?1/0:Math.min(...n)}function se(n){return n.length===0?-1/0:Math.max(...n)}function le(n){return Math.round(n)}function ae(n){return Math.floor(n)}function de(n){return Math.ceil(n)}function he(n,t){const e=Math.ceil(n),r=Math.floor(t);return r<e?e:Math.floor(Math.random()*(r-e+1))+e}const pe=f(he);function ye(n){return n.trim()}function me(n,t){return t.split(n)}const ge=f(me);function Ae(n,t){return t.join(n)}const we=f(Ae);function Se(n,t,e){return e.replace(n,t)}const be=f(Se);function Oe(n){return n.toUpperCase()}function Pe(n){return n.toLowerCase()}function Ee(n,t){if(typeof t=="string"&&typeof n=="string")return t.startsWith(n);if(Array.isArray(n)&&Array.isArray(t)){if(n.length===0)return!0;if(n.length>t.length)return!1;for(let e=0;e<n.length;e++)if(t[e]!==n[e])return!1;return!0}return!1}function Te(n,t){if(typeof t=="string"&&typeof n=="string")return t.endsWith(n);if(Array.isArray(n)&&Array.isArray(t)){if(n.length===0)return!0;if(n.length>t.length)return!1;for(let e=0;e<n.length;e++){const r=t.length-n.length+e;if(t[r]!==n[e])return!1}return!0}return!1}function Me(n,t){return t.match(n)}const Ne=f(Me);function ve(...n){const t=async(i,c)=>{let o=i;for(const s of c)o=await s(o);return o};if(n.length===0)return Promise.resolve(void 0);const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function _e(...n){const t=async(i,c)=>{let o=i;for(const s of c)o=await s(o);return o};if(n.length===0)return Promise.resolve(void 0);const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}const E=_e;Object.defineProperty(E,"__pipe_async_strict",{value:!0});function ke(...n){const t=async(i,c)=>{let o=i;for(const s of c){if(h(o))return o;o=await s(o)}return o};if(n.length===0)return Promise.resolve(void 0);const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function We(...n){const t=async(i,c)=>{let o=i;for(const s of c){if(h(o))return o;o=await s(o)}return o};if(n.length===0)return Promise.resolve(void 0);const[e,...r]=n;if(typeof e=="function"){const i=[e,...r];return c=>t(c,i)}return t(e,r)}function T(n){return new Promise(t=>{setTimeout(t,n)})}function ze(n,t){return new Promise((e,r)=>{const i=setTimeout(()=>r(new Error(`Timed out after ${n}ms`)),n);t.then(c=>{clearTimeout(i),e(c)}).catch(c=>{clearTimeout(i),r(c)})})}const De=f(ze);function Ie(n,t,e=0){return(async()=>{let r=0;for(;;)try{return await t()}catch(i){if(r+=1,r>n)throw i;e>0&&await T(e)}})()}const Le=f(Ie);function Be(n,t){let e;return function(...i){e&&clearTimeout(e);const c=this;e=setTimeout(()=>{e=void 0,n.apply(c,i)},t)}}const Ce=f(Be);function Ke(n,t){let e;return function(...i){e||(n.apply(this,i),e=setTimeout(()=>{e=void 0},t))}}const qe=f(Ke);function Ve(n,t){let e,r=!1,i,c;const o=()=>{e=void 0,r&&i&&(r=!1,n.apply(c,i))};return function(...l){if(!e){n.apply(this,l),e=setTimeout(o,t);return}r=!0,i=l,c=this,clearTimeout(e),e=setTimeout(o,t)}}const Fe=f(Ve);function Re(n,t){let e=0,r=null,i=null;const c=(s,l)=>{e=Date.now(),n.apply(s,l)};return function(...s){const l=Date.now(),a=t-(l-e);a<=0?(i&&(clearTimeout(i),i=null),r=null,c(this,s)):(r=s,i||(i=setTimeout(()=>{i=null,r&&(c(this,r),r=null)},a)))}}const $e=f(Re);function Ue(n){return t=>t==null?null:n(t)}function je(n){return t=>{const e=[];for(const r of t){const i=n(r);i!=null&&e.push(i)}return e}}function He(n){return t=>t??n}function Ge(n){try{return{ok:!0,value:n()}}catch(t){return{ok:!1,error:t}}}function Ze(n,t,e){return e==null?n():t(e)}const Je=f(Ze);function Qe(n,t){if(!n)throw new Error(t??"Assertion failed")}const Xe=f(Qe);function Ye(n,t){if(!n)throw new Error(t??"Invariant failed")}const xe=f(Ye);function nr(n){return t=>(n?console.log(n,t):console.log(t),t)}u.SideEffect=d,u.SideEffectClass=d,u.add=xt,u.append=Hn,u.assert=Xe,u.assoc=wt,u.assocPath=bt,u.ceil=de,u.chunk=Pn,u.clamp=Qt,u.complement=B,u.compose=D,u.concat=Un,u.cond=Q,u.constant=K,u.curry=f,u.debounce=Ce,u.debounceLeading=qe,u.debounceLeadingTrailing=Fe,u.delay=T,u.dissoc=Ot,u.dissocPath=Mt,u.div=ue,u.drop=wn,u.dropWhile=bn,u.endsWith=Te,u.entries=It,u.equals=P,u.every=yn,u.evolve=Ct,u.filter=un,u.find=an,u.flatMap=sn,u.flatten=Jn,u.flattenDeep=rt,u.flip=L,u.floor=ae,u.fold=Je,u.from=q,u.getOrElse=He,u.groupBy=Cn,u.gt=jt,u.gte=Ht,u.guard=nn,u.has=qt,u.hasPath=Vt,u.head=Qn,u.identity=C,u.ifElse=j,u.includes=Xt,u.init=xn,u.invariant=xe,u.isEmpty=$t,u.isNil=Rt,u.isSideEffect=h,u.isType=Ut,u.join=we,u.keys=zt,u.last=Yn,u.log=nr,u.lt=Gt,u.lte=Zt,u.map=en,u.mapMaybe=je,u.mapValues=Lt,u.match=Ne,u.matchSideEffect=_,u.max=se,u.maybe=Ue,u.mean=oe,u.memoize=$,u.merge=vt,u.mergeAll=Wt,u.mergeDeep=kt,u.min=fe,u.mul=re,u.omit=gt,u.once=R,u.partial=I,u.partition=et,u.path=at,u.pathOr=ht,u.pick=yt,u.pipe=y,u.pipeAsync=ve,u.pipeAsyncSideEffect=ke,u.pipeAsyncSideEffectStrict=We,u.pipeAsyncStrict=E,u.pipeHint=N,u.pipeSideEffect=W,u.pipeSideEffectStrict=z,u.pipeStrict=S,u.pipeWithDeps=v,u.prepend=Zn,u.prop=ut,u.propOr=st,u.propStrict=ot,u.randomInt=pe,u.range=nt,u.reduce=on,u.replace=be,u.result=Ge,u.retry=Le,u.round=le,u.runPipeResult=k,u.scan=Rn,u.some=hn,u.sort=Ln,u.sortBy=Dn,u.split=ge,u.startsWith=Ee,u.sub=te,u.sum=ce,u.tail=Xn,u.take=gn,u.takeWhile=Vn,u.tap=V,u.tap0=F,u.throttle=$e,u.timeout=De,u.toLower=Pe,u.toUpper=Oe,u.trim=ye,u.tryCatch=Y,u.uniq=_n,u.uniqBy=Wn,u.unless=J,u.unzip=vn,u.values=Dt,u.when=G,u.zip=Tn,u.zipIndex=Kn,u.zipWith=Nn,Object.defineProperty(u,Symbol.toStringTag,{value:"Module"})}));
 //# sourceMappingURL=fp-pack.umd.js.map