| | |
|---|
| | | const TupleSet = require("./TupleSet"); |
|---|
| | | |
|---|
| | | /** |
|---|
| | | * FIFO queue for tuples that preserves uniqueness by delegating membership |
|---|
| | | * tracking to `TupleSet`. |
|---|
| | | * @template T |
|---|
| | | * @template V |
|---|
| | | */ |
|---|
| | | class TupleQueue { |
|---|
| | | /** |
|---|
| | | * Seeds the queue with an optional iterable of tuples to visit. |
|---|
| | | * @param {Iterable<[T, V, ...EXPECTED_ANY]>=} items The initial elements. |
|---|
| | | */ |
|---|
| | | constructor(items) { |
|---|
| | |
|---|
| | | } |
|---|
| | | |
|---|
| | | /** |
|---|
| | | * Returns the number of elements in this queue. |
|---|
| | | * Returns the number of distinct tuples currently queued. |
|---|
| | | * @returns {number} The number of elements in this queue. |
|---|
| | | */ |
|---|
| | | get length() { |
|---|
| | |
|---|
| | | } |
|---|
| | | |
|---|
| | | /** |
|---|
| | | * Appends the specified element to this queue. |
|---|
| | | * Enqueues a tuple if it is not already present in the underlying set. |
|---|
| | | * @param {[T, V, ...EXPECTED_ANY]} item The element to add. |
|---|
| | | * @returns {void} |
|---|
| | | */ |
|---|
| | |
|---|
| | | } |
|---|
| | | |
|---|
| | | /** |
|---|
| | | * Retrieves and removes the head of this queue. |
|---|
| | | * Removes and returns the next queued tuple, rebuilding the iterator when |
|---|
| | | * the underlying tuple set has changed since the last full pass. |
|---|
| | | * @returns {[T, V, ...EXPECTED_ANY] | undefined} The head of the queue of `undefined` if this queue is empty. |
|---|
| | | */ |
|---|
| | | dequeue() { |
|---|
