Skip to main content
Module

x/collections/mod.ts>BinaryHeap.from

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
Latest
method BinaryHeap.from
import { BinaryHeap } from "https://deno.land/x/collections@0.12.1/mod.ts";

Creates a new binary heap from an array like or iterable object.

Parameters

collection: ArrayLike<T> | Iterable<T> | BinaryHeap<T>

Parameters

collection: ArrayLike<T> | Iterable<T> | BinaryHeap<T>
options: { compare?: (a: U, b: U) => number; }

Parameters

collection: ArrayLike<T> | Iterable<T> | BinaryHeap<T>
options: { compare?: (a: U, b: U) => number; map: (value: T, index: number) => U; thisArg?: V; }