🔺 @fizzwiz/prism v0.0.0-dev.3 — Tiny Adjustment

🔺 @fizzwiz/prism v0.0.0-dev.3 — Tiny Adjustment

This release removes the dependency on @fizzwiz/sorted to prevent circular dependencies, as the upcoming version of @fizzwiz/sorted will, in turn, rely on @fizzwiz/prism. The change keeps the library modular, lightweight, and cleanly separated from other packages.

🧩 What’s Changed

The Search and AsyncSearch constructors no longer create an ArrayQueue by default. You must now explicitly provide a queue instance using the fluent .via() method:

import { ArrayQueue } from "@fizzwiz/sorted";
import { Search } from "@fizzwiz/prism";

const queue = new ArrayQueue();

const search = new Search()
  .from(start)
  .through(space)
  .via(queue);

This adjustment gives you clearer control over search strategies while ensuring Prism remains almost dependency-free (it still depends on @fizzwiz/fluent) and easy to integrate in any environment.

📦 Get It

📦 Available on npm: @fizzwiz/prism

— @fizzwiz ✨


Comments

Post a Comment

Popular posts from this blog

📦 v0.0.0-dev.1 — Search & Run

📦 v0.0.0-dev.1 — Search & Run We’re thrilled to announce the   first prerelease   of   @fizzwiz/prism :   v0.0.0-dev.1   — the   First Brick , laying the foundation for a library dedicated to   capturing the wonder moment   of calculi. This release unveils the core abstractions:   Run   and   Search . Each abstraction serves as the cornerstone for its own package, offering expressive, high-level problem-solving patterns. Notably, the   Search   class introduces full support for the   Search-and-Select Pattern , enabling formal and symbolic exploration of infinite solution spaces. 🧪 This is a   prerelease , ready for exploration. Your early feedback is invaluable and will help shape the API’s evolution and future features. “Explore freely. Push limits. Join us in capturing the wonder of computation.” —   @fizzwiz ✨
Read more

🧮 Exploring Combinatoric Calculus with Search

🧮 Exploring Combinatoric Calculus with   Search The   Search   abstraction in   @fizzwiz/prism   provides a   clean, declarative approach   to generating and exploring combinatorial structures. Rather than hard-coding recursive algorithms, you can   formally describe   how permutations, combinations, power sets, and other combinatorial constructs are generated — and let the fluent search engine do the heavy lifting. 🧠 Concept: Combinatorics as Exploration Every combinatorial problem can be viewed as a   space of possible choices : Permutations : ordered sequences of elements. Combinations : subsets without regard to order. Power sets : all possible subsets of a set. Traditionally, each case requires a specialized algorithm, often with complex recursion. With   Search , we express these patterns declaratively through   path expansion   — describing how one partial choice leads to the next. ⚙️ Defining a Search Process Eac...
Read more