☯️ v0.0.0-dev.3 — Classifier & TrueSet

☯️ v0.0.0-dev.3 — Classifier & TrueSet

We’re thrilled to announce v0.0.0-dev.3 of @fizzwiz/sorted, introducing two powerful new abstractions: Classifier and TrueSet. This release takes the library far beyond simple sorted collections, enabling hierarchical keys, prefix queries, and representation-based equivalence.

🔧 Core Enhancements

Classifier — a rich, multidimensional map

A Classifier stores entries whose keys are arrays (any iterable). It supports:

  • Storing multiple items per key
  • Efficient prefix queries with wildcards
  • Sorted traversal of both keys and items
  • Flexible equivalence via custom sorting rules

TrueSet — a representation-based set

A TrueSet defines equivalence using a representation function (repr). It enables:

  • Equivalence among objects, not just primitives
  • Aggregation of equivalent items in sorted, enumerable classes

📦 Why This Matters

These new structures let you express equivalence and ordering in ways JavaScript’s native collections simply cannot:

  • Equivalence can be defined by length, content, structure, or any meaningful attribute
  • Classifier keys can be multidimensional sequences, enabling deeply hierarchical or composite representations
  • Prefix queries and wildcard matching make complex hierarchical traversal both intuitive and efficient

⚙️ Runtime Sorting — 🧬 Evolving Populations — 📊 Statistical Insight

Because sorting happens during insertion, @fizzwiz/sorted naturally supports dynamic, data-driven systems:

  • Items can represent candidates evolving toward an optimal solution
  • Multiple populations can evolve in parallel, each governed by its own repr function
  • Each equivalence class tracks its frequency, giving you immediate statistical insight

Together, these capabilities make @fizzwiz/sorted a flexible engine for search, optimization, classification.

🧪 This is a prerelease, but it’s ready to explore. Your early feedback will help refine the API and shape upcoming features.

— @fizzwiz ✨

Comments

Post a Comment

Popular posts from this blog

🧠 Contemplating a True Set

🧠 Equivalence in JavaScript: Contemplating a True Set In JavaScript,   equivalence   behaves differently depending on whether you're working with primitive or non-primitive types. For   primitives —such as numbers, booleans, strings, and symbols—equivalence is determined by comparing actual values. If two variables hold the same value, they are considered equivalent. However, for   objects and arrays , equivalence is   by reference . Two arrays   [0]   and   [0]   are not considered equal because they are separate instances, even though they contain identical content. 🔬 Snippet 1: Equivalence by Value and by Reference new Set ([ 0 , 0 ]); // => Set { 0 } new Set ([[ 0 ], [ 0 ]]); // => Set { [0], [0] } JavaScript’s   Set   treats the two   0   values as equivalent but considers   [0]   and   [0]   as distinct because they are different object instances. This reveals JavaScript’s mini...
Read more

🧱 v0.0.0-dev.1 — First Brick

🧱 v0.0.0-dev.1 — First Brick We’re excited to announce the   first prerelease   of   @fizzwiz/sorted :   v0.0.0-dev.1   — the   First Brick   in what aims to become a foundational library for   priority-aware collections   and   custom equivalence models . This release introduces the core building blocks: 🔧 Core Abstractions Collection   – a base interface for iterable containers Queue   – an extension for prioritizing and structuring exploration 📦 Concrete Implementations ArrayQueue   – a simple queue based on insertion order SortedArray   – a comparator-based queue maintaining sorted state These implementations offer different   notions of equivalence   — by insertion order or by comparator — laying the groundwork for more powerful models based on   representation functions , coming soon. 🧪 This is a   prerelease , but it’s ready to explore. Your early feedback will help guide the evolution o...
Read more