@aureooms/js-data-structures

Playground for data structures in JavaScript. This is a child project of @aureooms/js-library and the twin project of @aureooms/js-algorithms.

Description

This project is just a playground for any data structure that doesn't fit in any of those project,

• aureooms/js-bst : binary search tree code bricks in JavaScript
  • @aureooms/js-red-black-tree : Red-black tree data structure for JavaScript
• aureooms/js-cg : computational geometry code bricks for JavaScript
• aureooms/js-collections : Python's collections library for JavaScript
  • aureooms/js-collections-chainmap : Collections library for JavaScript
  • aureooms/js-collections-counter : Python's counter data structure for JavaScript
  • aureooms/js-collections-defaultdict : Python's defaultdict data structure for JavaScript
  • aureooms/js-collections-deque : Python's deque data structure for JavaScript
  • aureooms/js-collections-dict : Collections library for JavaScript
  • aureooms/js-collections-namedtuple : Python's namedtuple data structure for JavaScript
  • aureooms/js-collections-ordereddict : Python's ordereddict data structure for JavaScript
  • aureooms/js-collections-set : Python's set data structure for JavaScript
• aureooms/js-dict : dictionary ADT code bricks for JavaScript
• aureooms/js-disjoint-set : disjoint-set data structure code bricks for JavaScript
  • aureooms/js-fixed-disjoint-set : fixed-size-array-based disjoint-set set code bricks for JavaScript
• aureooms/js-gn : graphs and networks code bricks for JavaScript
• aureooms/js-heap : heap code bricks for JavaScript
  • aureooms/js-heap-spec: Specification for heap data structures in JavaScript
  • aureooms/js-heapq: Python's heapq library for Javascript
  • aureooms/js-heapsort: Heap sort algorithm for Javascript
  • aureooms/js-binomial-heap: Binomial heap data structure for JavaScript
  • aureooms/js-d-ary-heap: d-ary heap data structure for JavaScript
  • aureooms/js-pairing-heap: Pairing heap data structure for JavaScript
• aureooms/js-list-spec : list ADT specification code bricks for JavaScript
  • aureooms/js-arraylist : dynamic array code bricks for JavaScript
  • aureooms/js-dll : doubly linked list code bricks for JavaScript
  • aureooms/js-sll : singly linked list code bricks for JavaScript
• aureooms/js-lifo : Last In, First Out abstract data types code bricks for JavaScript
• aureooms/js-fifo : First In, First Out data structures code bricks for JavaScript
• aureooms/js-persistent : persistent data structures code bricks for JavaScript
  • aureooms/js-fingertree: finger trees code bricks for JavaScript
• aureooms/js-pubsub : publish-subscribe pattern code bricks for JavaScript

Those packages aim to provide code bricks that are as generic as possible. Some examples are a d-ary heap that can be parametrized with any d, BST's built on the same left rotate and right rotate functions, an ArrayList implementation with parametrizable allocator.

Reference

A list of links and projects focusing on data structures implementation.

Projects implementing data structures in JavaScript

• https://github.com/nzakas/computer-science-in-javascript
• https://github.com/benoitvallon/computer-science-in-javascript
• http://www.nayuki.io
• https://github.com/Yomguithereal/mnemonist

Projects implementing data structures in other languages

• https://github.com/patmorin/ods (C++, Java, Python)
• http://www.nayuki.io (C, C++, Java, C#, Python, Haskell, MATLAB and others)
• http://rosettacode.org (All kinds of languages)
• https://github.com/mahmoud/boltons (Python)

Others

• http://en.wikipedia.org/wiki/Disjoint-set_data_structure
• http://en.wikipedia.org/wiki/Partition_refinement