🧱 v0.0.0-dev.1

 

🧱 v0.0.0-dev.1 — First Brick

We’re excited to announce the very first prerelease of @fizzwiz/fluent: v0.0.0-dev.1 — the First Brick in what we hope will become a foundational library for expressive, composable iteration.

This version introduces the core abstractions:

  • Each — for lazy, fluent iteration.
  • What — for powerful search space modeling.
  • Path — a structural utility class essential for combinatorial workflows.

These concepts form the backbone of the library and open the door to elegant patterns like Search-and-Select, early restriction, and composable iteration chains.

🧪 This is a prerelease, but it's fully functional and ready to explore. Your feedback now will help shape what comes next.


Start experimenting. Share thoughts. Let’s refine it together.
— @fizzwiz ✨

Comments

Post a Comment

Popular posts from this blog

✨ Bridging Natural Language and Code

  ✨ Bridging Natural Language and Code In both programming and human communication, the elegance of a solution often lies in its   clarity   and   simplicity . Simplicity isn’t about doing less — it's about doing what matters, cleanly and expressively. The most powerful solutions are often those that read as naturally as they execute. What if the path to such solutions already exists — not in more complex tools, but in   language itself ? 💡 Programming, Meet Expression We’ve all had the experience of easily describing an algorithm in plain language, only to find the code implementation more awkward or verbose than expected. This gap between expression and execution is where inefficiencies and complexity thrive. But natural language has evolved to carry   core logical patterns   —   if ,   then ,   else ,   each ,   when ,   match . These aren't just linguistic constructs; they're   universal patterns of reasoning . T...
Read more

⚡ Early vs. Late Restriction

  ⚡ Early vs. Late Restriction in Combinatorial Search One of the core design strengths of   @fizzwiz/fluent   is its ability to optimize   combinatorial search   through   early restriction   of the search space — a subtle distinction that can have profound performance implications. 🚧 The Problem Suppose you want to generate all paths of length 3 from the items   [0, 1] ,   without repetitions . In many libraries, you generate   all possible paths   and then   filter out   the bad ones. But   @fizzwiz/fluent   allows you to go one step better: filter the bad paths   before   they’re ever constructed. ⚙️ The Code Here’s a side-by-side comparison of   early   and   late   restriction: const // the static version of the `each()` method of the class `Each` provides a `What` of paths rather than an `Each` of arrays space = Each . each ([ 0 , 1 ], [ 0 , 1 ], [ 0 , 1 ]), // ✅ Ea...
Read more