keywords:binary search

@bemoje/arr-sorted-index-of

Binary search -based indexOf for sorted arrays.

bemoje

published 1.0.2 4 years ago

M

Q

P

functional-red-black-tree2

A fully persistent balanced binary search tree. Typed version

kirill486

published 1.1.0 4 years ago

M

Q

P

most-trees

A small javascript library that allows you to implement most tree data structures

zebediahperkins

published 2.2.0 4 years ago

M

Q

P

> In computer science, binary search trees (BST), sometimes called ordered or sorted binary trees, are a particular type of container: data structures that store "items" (such as numbers, names etc.) in memory. By https://en.wikipedia.org/wiki/Binary_sea

edward904

published 1.0.1 6 years ago

M

Q

P

avl-treemap

A TS/JS implemenation of a self-balancing binary tree with mapped data nodes

codejedi365

published 1.0.4 3 years ago

M

Q

P

sarray

Sorted Array - uses binary search for fast insertion / reading

arnorhs

published 1.0.16 3 years ago

M

Q

P

bigsearch

Fast search for big arrays

danp3d

published 0.0.1 9 years ago

M

Q

P

functional-red-black-tree-test

A fully persistent balanced binary search tree

ccorcos

published 1.0.1 5 years ago

M

Q

P

bintree

Simple search tree Class implementation, in JavaScript. Add, Search, Remove and many more.

nekgasov

published 1.0.0 7 years ago

M

Q

P

@praneshravi/bst.js

Javascript implementation of Binary Search Tree

praneshravi

published 1.1.0 6 years ago

M

Q

P

@bemoje/arr-sorted-has

Binary search -based indexOf for sorted arrays.

bemoje

published 1.0.2 4 years ago

M

Q

P

@bemoje/arr-sorted-indexes-of

Find all indexes at which an array element exists, by binary search.

bemoje

published 1.0.1 4 years ago

M

Q

P

lite-lru

A simple LRU cache module that is optimized for frequent serialization, only supports increasing integer keys and uses binary search to locate the entries

faridnsh

published 0.0.1 7 years ago

M

Q

P

keepitsortedstupid

This is a basic implementation of a sorted array, designed to maintain a collection of items in such a way that it can easily be searched via binary search. Built with effeciency and ease of use in mind.