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

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

We’re thrilled to announce the first prerelease of @fizzwiz/search: v0.0.0-dev.1 — a library dedicated to declarative, lazy search abstractions for computational spaces.

Core Features in this Release

  • Search — synchronous, lazy search for combinatorial or infinite spaces
  • AsyncSearch — asynchronous, parallelized search for distributed or concurrent workloads
  • Fully lazy, fluent, and extensible API
  • Compatible with any queue strategy (FIFO, DFS, priority queues, custom)

🧪 This is a prerelease. Your feedback is essential for shaping the API’s evolution and the next features of @fizzwiz/search.

“Explore freely. Push limits. Capture the wonder of computation.”
— @fizzwiz ✨


Comments

Post a Comment

Popular posts from this blog

🧠 The Search-and-Select Pattern

🧠 The Search-and-Select Pattern 🔍 Multivalued Functions as Possibility A function that returns   iterables   instead of a single value can be understood in two powerful ways: Uncertainty: The function doesn’t know the answer yet, so it returns several plausible options. Exploration: When input and output share the same type, the function becomes a   map : from one point, it shows all the directions you can go next. That second interpretation unlocks something fundamental: A multivalued function   is   a search space. 🧭 Step by Step Toward a Solution Think about how you actually solve hard problems. You don’t jump straight to the solution. You: make a rough guess, explore variations, discard bad paths, and gradually converge on something that works. The Search class models exactly this process. Each step looks like: Pull the most promising candidate from a queue Push all neighboring possibilities back into the queue Prune the least promising candidates if th...
Read more

🧮 Exploring Combinatoric Calculus

🧮 Exploring Combinatoric Calculus with   Search The   Search   abstraction in   @fizzwiz/search   provides a clean, declarative way to generate and explore   combinatorial structures . You simply   describe   how candidates expand — and let the lazy search engine handle the traversal. 🧠 Concept: Combinatorics as Exploration Most combinatorial problems can be understood as a   space of possible choices : Dispositions   → sequences of fixed length Combinations   → subsets of fixed length Power sets   → all subsets Traditionally, each one requires its own custom algorithm — often recursive, imperative, and hard to generalize. With   Search , you model them all with a single idea: Start from an initial candidate, and expand it into new candidates using a declarative rule. ⚙️ Defining a Search Process Each search consists of three parts: Start   – The initial candidate (e.g., an empty path). Space   – A function des...
Read more