Skip to main content
Home
Browse packagesDocsSign in

@std/data-structures@1.0.9
Built and signed on GitHub Actions

latest
denoland/std

Common data structures like red-black trees and binary heaps

This package works with Cloudflare Workers, Node.js, Deno, Bun, Browsers
This package works with Cloudflare Workers
This package works with Node.js
This package works with Deno
This package works with Bun
This package works with Browsers
JSR Score
100%
Published
5 months ago (1.0.9)

default

Data structures for use in algorithms and other data manipulation.

f
ascend

Compare two values in ascending order using JavaScript's built in comparison operators.

c
BinaryHeap

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.

c
BinarySearchTree

An unbalanced binary search tree. The values are in ascending order by default, using JavaScript's built-in comparison operators to sort the values.

f
descend

Compare two values in descending order using JavaScript's built in comparison operators.

c
RedBlackTree

A red-black tree. This is a kind of self-balancing binary search tree. The values are in ascending order by default, using JavaScript's built-in comparison operators to sort the values.

c
BinaryHeap

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.

c
BinarySearchTree

An unbalanced binary search tree. The values are in ascending order by default, using JavaScript's built-in comparison operators to sort the values.

f
ascend

Compare two values in ascending order using JavaScript's built in comparison operators.

f
descend

Compare two values in descending order using JavaScript's built in comparison operators.

c
RedBlackTree

A red-black tree. This is a kind of self-balancing binary search tree. The values are in ascending order by default, using JavaScript's built-in comparison operators to sort the values.

c
D2Array

A 2d array. Unlike a normal array, it does not grow dynamically, and needs to be manually resized with the resize method. It can never have the width or height be 0.

c
BidirectionalMap

An extension of Map that allows lookup by both key and value.

c
BinarySearchTree

An unbalanced binary search tree. The values are in ascending order by default, using JavaScript's built-in comparison operators to sort the values.

New Ticket: Report package

Please provide a reason for reporting this package. We will review your report and take appropriate action.

Please review the JSR usage policy before submitting a report.