⚖️ SortedArray Class

⚖️ SortedArray Class — Sorting by Comparator

The SortedArray class is a queue that maintains sorted order at all times, using a custom or predefined comparator.

It extends ArrayQueue, but introduces equivalence, ordering, and deduplication logic — making it suitable for priority queues, symbolic sets, or ordered workflows.

🧪 API: SortedArray

Constructor

new SortedArray(comparator?, items?)
ParameterTypeDescription
comparator(a, b) => -1 | 0 | 1Comparison function; defaults to ORDER.ASCENDING.
itemsArray<any>Initial items to add (will be sorted).

Properties

  • items: Array<any>
    Returns the internal sorted array.

  • comparator: function
    The function used to maintain sort order and define equivalence.

Methods

has(item): boolean

Returns true if an equivalent item exists in the queue (according to the comparator).

add(item): boolean

Adds the item in sorted position if no equivalent already exists.
Returns true if the item was inserted.

remove(item): boolean

Removes the equivalent item, if found.
Returns true if removal occurred.

🧬 Internal Logic

The class uses a fast binary search algorithm to locate insert/remove positions in logarithmic time:

SortedArray.logSearch(item, array, comparator) // → [index, itemOrUndefined]

🧠 Design Notes

SortedArray is perfect for priority queues, bounded sets, and sorted collections.

It defines equivalence by comparing items.

Any further advanced notion of equivalence wouldn't be possible without this basic equivalence by comparison.


“Order decides what counts as equal.”
— @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

☯️ 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 class...
Read more