Skip to main content
Module

x/collections/common.ts

Collection data structures that are not standard built-in objects in JavaScript. This includes a vector (double-ended queue), binary heap (priority queue), binary search tree, and a red black tree.
udibo/collections
Very Popular
Go to Latest
import * as collections from "https://deno.land/x/collections@v0.10.0/common.ts";

Variables

Directions on a binary search tree node.

Functions

Counts the number of occurances for each value.

Returns a random integer within a range.

Generates an array of integers within a range.

Shuffles an array in-place using the Fisher-Yates shuffle algorithm then returns it.

Swaps the values at two indexes in an array.

Type Aliases

This module is browser compatible.