### circular-buffer

A NodeJS simple circular buffer implementation supporting indexing

Updated by @tomsmeding

### circular_buffer_js

Fast TS/JS implementation of a circular buffer (aka ring queue, cyclic list, etc.) Extremely well tested.

Updated by @stonecypher

### @fun-land/fun-state

A React architecture and library for doing fractal, compositional state in a way that is typesafe, testable, and easy to refactor.

Updated by @jethrolarson

### @fun-land/accessor

A TS/JS library for doing immutable updates and querying on nested data structures in a way that is composable and powerful.

Updated by @jethrolarson

### accessor-ts

A TS/JS library for doing immutable updates and querying on nested data structures in a way that is composable and powerful.

Updated by @jethrolarson

### superstring

A data structure to efficiently represent the results of applying patches.

Updated by @nathansobo

### tree-util

Utility package for building a tree from array plus functions for working with trees

Updated by @gatesmart

### fun-state

A React architecture and library for doing fractal, compositional state in a way that is typesafe, testable, and easy to refactor.

Updated by @jethrolarson

### js-data-structures-and-algorithms

Data structures and algorithms implemented in JavaScript

Updated by @thawkin3

### @lokprakash/datastructure

This package contains data structures like stack, binary tree...

Updated by @lokprakash

### @lillallol/outline-pdf-data-structure

Create a pdf outline data structure from a high level string representation of pdf outline. This data structure can be used to create a real pdf outline.

Updated by @lillallol

### collection-data

This module is an utility for managing data in the form of Map.

Updated by @smaug-6739

### @fun-land/use-fun-state

A React architecture and library for doing fractal, compositional state in a way that is typesafe, testable, and easy to refactor.

Updated by @jethrolarson

### ndarray-methods

Convenient methods for JavaScript built-in multi-dimensional arrays.

Updated by @graphemecluster

### tiny-tree

Efficient, no-dependency b-tree and binary search tree for node or the browser

Updated by @jes-sherborne

### priority-queue-with-custom-comparator

Priority queue data structure where you are able to set your own compare function.

Updated by @devjan