Package Exports

standard-collections
standard-collections/dist/index.js

This package does not declare an exports field, so the exports above have been automatically detected and optimized by JSPM instead. If any package subpath is missing, it is recommended to post an issue to the original package (standard-collections) to support the "exports" field. If that is not possible, create a JSPM override to customize the exports field for this package.

Readme

standard-collections

Standard collections in TypeScript / JavaScript

Stack
Queue
Priority Queue
BSF/DSF searches

Stack

A stack is a last-in first-out collection. It implements push, pop, peek, isEmpty.

import { Stack } from "standard-collections";

const stack = new Stack<string>();

stack.push("a");
stack.push("b");
stack.push("c");

console.log(stack.pop()); // "c"
console.log(stack.pop()); // "b"
console.log(stack.pop()); // "a"

Queue

A queue is a first-in first-out collection. It implements enqueue, dequeue, peek, isEmpty.

import { Queue } from "standard-collections";

const q = new Queue<number>();

q.enqueue(6);
q.enqueue(1);
q.enqueue(3);

console.log(q.dequeue()); // 6
console.log(q.dequeue()); // 1
console.log(q.dequeue()); // 3

Priority Queue

A priority queue will always extract the priority value that comes first.

Constructor parameters (optional): initial values, custom comparison function.

Supported operations: insert, extract, peek, isEmpty, size, clear.

Example with standard comparison operators:

import { PriorityQueue } from "standard-collections";

const p = new PriorityQueue<number>();

p.insert(10);
p.insert(4);
p.insert(8);

console.log(p.extract()); // 4
console.log(p.extract()); // 8
console.log(p.extract()); // 10

Example with custom comparison:

import { PriorityQueue } from "standard-collections";

interface Bid {
    customer: string;
    price: number;
}

const q = new PriorityQueue<Bid>({
    comparator: (a, b) => b.price - a.price,
});

q.insert({ customer: "john", price: 11.5 });
q.insert({ customer: "elsa", price: 11.7 });
q.insert({ customer: "tom", price: 11.4 });

console.log(q.extract().customer);  // elsa
console.log(q.extract().customer);  // john
console.log(q.extract().customer);  // tom

Graph searches

This library implements depth-first search and breadth-first search.

The graphSearch function returns an Iterable<T> that iterates by navigating on the graph.

Example:

import { graphSearch, GraphSearchMethod } from "standard-collections";

interface City {
    id: number;
    connections: City[];
}

const c1 = { id: 1, connections: [] };
const c2 = { id: 2, connections: [] };
const c3 = { id: 3, connections: [] };
c1.connections.push(c2);
c2.connections.push(c3);
c3.connections.push(c1);
c3.connections.push(c2);

for (const city of graphSearch({
    initialNode: c1,
    getNeighbors: (x) => x.connections,
    method: GraphSearchMethod.DepthFirst
})) {
    console.log(city.id); // prints 1, 2, 3
}