Buckets

A complete fully tested and documented data structure library written in pure JavaScript. Buckets also includes several functions for manipulating arrays. A bag is a special kind of set in which members are allowed to appear more than once. Binary search trees keep their elements in sorted order, so that lookup and other operations can use the principle of binary search. Dictionaries map keys to values, each key can map to at most one value. A heap is a binary tree that maintains the heap property. Every node is less than or equal to each of its children. A linked list is a sequence of items arranged one after another. A multi dictionary is a special kind of dictionary that holds multiple values against each key. In a priority queue, each element is associated with a "priority", and elements are dequeued in the highest-priority-first order (the elements with the highest priority are dequeued first).