This is a simple, zero dependencies, package with popular data structures. This package, although strives to provide high quality code, is new and not yet battle tested for high performance production scenarios. Therefore, consider alternative solutions
Min/Max Heap & Heap Sort implementation in javascript
A performant double-ended queue (deque) implementation in javascript.
A heap-based implementation of priority queue in javascript with typescript support.
a performant queue implementation in javascript
binary search tree & avl tree (self balancing tree) implementation in javascript
graph & directed graph implementation in javascript
stack implementation in javascript
trie implementation in javascript
Enhanced Set that extends javascript ES6 Set
a javascript implementation of LinkedList & DoublyLinkedList
Tools and constants shared across Apify projects.
Tools and constants shared across Apify projects.
Tools and constants shared across Apify projects.
production-ready data structures implementation in javascript & typescript.
Tool to find the matching URLs on a page (or html document) by providing a URL pattern.
Helper for adding timeouts to promises that support easy cancellation.
Tools and constants shared across Apify projects.
an implementation of round robin as a data structure
Package to encrypt and decrypt apify actor input secrets.
Publicly available JSON schemas for Apify platform
Tools and constants shared across Apify projects.
max heap implementation in javascript
Utility to evaluate dynamic memory expressions for Apify actors.