/collections/binary_heap.ts | std@0.181.0 | Deno

std/collections/binary_heap.ts

Deno standard library

denoland/deno_std

Menu

mod.ts (default module)

DeepMergeOptions

JoinToStringOptions

MergingStrategy

aggregateGroups

firstNotNullishOf

aggregate_groups.ts

aggregateGroups

associate_by.ts

associate_with.ts

binary_search_node.ts

BinarySearchNode

binary_search_tree.ts

BinarySearchTree

DeepMergeOptions

MergingStrategy

drop_last_while.ts

filter_entries.ts

filter_values.ts

first_not_nullish_of.ts

firstNotNullishOf

includes_value.ts

join_to_string.ts

JoinToStringOptions

map_not_nullish.ts

permutations.ts

red_black_node.ts

red_black_tree.ts

reduce_groups.ts

running_reduce.ts

sliding_windows.ts

take_last_while.ts

import * as mod from "https://dotland.deno.dev/std@0.181.0/collections/binary_heap.ts";

Classes

c

A priority queue implemented with a binary heap. The heap is in descending order by default, using JavaScript's built-in comparison operators to sort the values.

Functions

f ascend	Compares its two arguments for ascending order using JavaScript's built in comparison operators.
f descend	Compares its two arguments for descending order using JavaScript's built in comparison operators.