Data-Structures Packages

Data-structures and algorithms implemented on TypeScript

Basic Data Structures in TypeScript

Generates a tree structure using a list of UNIX-like paths, with support for custom payloads.

Converts an array of items with ids and parent ids to a nested tree in a performant `O(n)` way. Runs in browsers and node.

  ![GitHub last commit](https://img.shields.io/github/last-commit/fabryscript/

Algorithms and data-structures implemented on JavaScript

A trie structure for efficient word and phrase search

There are neither a lot of resources on internet nor any book which guides and dictates best practices in the implementation of popular Data Structures using Javascript. The purpose of this library is to provide cooked implementation of populare data stru

JS/TS package to emulate fixed-size arrays from C/C++/Java and even Dart. Only used in SE-1222 (Data Structures) exercises. Not for production use.

A collection of tools, utilities, and helpers for TypeScript

Javascript implementation of widely known algorithms, functions and data structures.

Min Heap

Min Priority Queue

Implementation of Disjoint-set data structure algorithm (also called a union–find data structure or merge–find set).

A JavaScript implementation of doubly linked list operations

A TypeScript implementation of an N-way set-associative cache with configurable replacement policies, supporting operations like put, get, delete, and listAll. Optimized for performance and extensibility.

A powerful and efficient implementation of hash tables for JavaScript, optimized for performance and scalability.

A HashMap for the modern Javascript world

**Rype** is not just another validation package; it's a lightning-fast, type-optimized solution designed specifically for TypeScript projects. Unlike other libraries, Rype has been fine-tuned to fully harness the power of TypeScript, providing unparallele

Set array items declaratively