buckets-js
Version:
Buckets is a complete, fully tested and documented data structure library written in pure JavaScript.
287 lines (226 loc) • 6.39 kB
HTML
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
<head>
<meta http-equiv="content-type" content="text/html; charset=utf-8" />
<title>JsDoc Reference - Index</title>
<meta name="generator" content="JsDoc Toolkit" />
<style type="text/css">
/* default.css */
body
{
font: 13.5px sans-serif;
line-height: 20px;
max-width: 950px;
-webkit-font-smoothing: antialiased;
text-align: justify;
}
h1
{
padding: 0;
color: rgb(65, 131, 196);
margin: 0 auto;
padding-top: 18px;
}
#index
{
margin-top: 15px;
margin-left: 15px;
width: 160px;
position: absolute;
left: 8px;
padding: 8px;
background: #fafafa;
padding-top: 12px;
padding-left: 6px;
padding-right: 12px;
padding-bottom: 0px;
border: 1px solid rgba(0, 0, 0, 0.1);
}
#content
{
margin-left: 220px;
}
.classList li
{
padding: 0;
margin: 0 0 8px 0;
}
.summaryTable {
width: 100%;
}
h2 { font-size: 110%; }
caption, div.sectionTitle
{
box-sizing: border-box;
color: rgb(51, 51, 51);
background-color: #fafafa;
line-height: 25px;
font-family: Helvetica, arial, nimbussansl, liberationsans, freesans, clean, sans-serif, 'Segoe UI Emoji', 'Segoe UI Symbol';
font-size: 14px;
font-style: normal;
font-variant: normal;
font-weight: bold;
text-align: left;
padding: 2px 6px 2px 6px;
border: 1px rgb(216, 216, 216) solid;
}
div.sectionTitle { margin-bottom: 8px; }
.summaryTable thead { display: none; }
.summaryTable td
{
vertical-align: top;
padding: 4px;
border-bottom: 1px rgb(216, 216, 216) solid;
border-right: 1px rgb(216, 216, 216) solid;
border-left: 1px rgb(216, 216, 216) solid;
}
/*col#summaryAttributes {}*/
.summaryTable td.attributes
{
border-left: 1px;
width: 140px;
text-align: right;
}
td.attributes, .fixedFont
{
color: rgb(2, 74, 8);
font-family: Consolas, 'Liberation Mono', Menlo, Courier, monospace;
}
.summaryTable td.nameDescription
{
text-align: left;
}
.summaryTable { margin-bottom: 8px; }
.detailList .heading
{
font-weight: bold;
padding-bottom: 6px;
margin-left: 0;
}
.classList {
list-style-type: none;
padding: 0;
margin: 0 0 0 8px;
font-family: sans-serif;
font-size: 1em;
overflow: auto;
}
a { color:#4285f4;
text-decoration: none;
}
hr {
border: 0;
border-top: 1px solid rgb(216, 216, 216);
border-bottom: 1px solid rgba(255, 255, 255, 0.3);
}
td.nameDescription.fixedFont {
color: rgb(0, 0, 0);
}
span.light {
color: rgb(148, 149, 155);
font-weight: bold;
}
pre {
background: #fafafa;
padding-top: 16px;
padding-bottom: 16px;
padding-left: 16px;
padding-right: 16px;
/* border: 1px solid rgba(0, 0, 0, 0.1); */
font-family: Consolas, 'Liberation Mono', Menlo, Courier, monospace;
font-style: normal;
font-variant: normal;
font-weight: normal;
border: 1px solid rgba(0, 0, 0, 0.1);
color: rgb(124, 19, 0);
}
</style>
</head>
<body>
<div id="header">
</div>
<div id="index">
<ul class="classList">
<li><a href="symbols/buckets.arrays.html">buckets.arrays</a></li>
<li><a href="symbols/buckets.Bag.html">buckets.Bag</a></li>
<li><a href="symbols/buckets.BSTree.html">buckets.BSTree</a></li>
<li><a href="symbols/buckets.Dictionary.html">buckets.Dictionary</a></li>
<li><a href="symbols/buckets.Heap.html">buckets.Heap</a></li>
<li><a href="symbols/buckets.LinkedList.html">buckets.LinkedList</a></li>
<li><a href="symbols/buckets.MultiDictionary.html">buckets.MultiDictionary</a></li>
<li><a href="symbols/buckets.PriorityQueue.html">buckets.PriorityQueue</a></li>
<li><a href="symbols/buckets.Queue.html">buckets.Queue</a></li>
<li><a href="symbols/buckets.Set.html">buckets.Set</a></li>
<li><a href="symbols/buckets.Stack.html">buckets.Stack</a></li>
</ul>
</div>
<div id="content">
<h1 class="classTitle">Index</h1>
<div>
<h2><a href="symbols/buckets.arrays.html">buckets.arrays</a></h2>
Contains various functions for manipulating arrays.
</div>
<hr />
<div>
<h2><a href="symbols/buckets.Bag.html">buckets.Bag</a></h2>
<p>A bag is a special kind of set in which members are
allowed to appear more than once.
</div>
<hr />
<div>
<h2><a href="symbols/buckets.BSTree.html">buckets.BSTree</a></h2>
<p> Binary search trees keep their elements in sorted order, so that
lookup and other operations can use the principle of binary search.
</div>
<hr />
<div>
<h2><a href="symbols/buckets.Dictionary.html">buckets.Dictionary</a></h2>
<p>Dictionaries map keys to values, each key can map to at most one value.
</div>
<hr />
<div>
<h2><a href="symbols/buckets.Heap.html">buckets.Heap</a></h2>
<p>A heap is a binary tree that maintains the heap property:
Every node is less than or equal to each of its children.
</div>
<hr />
<div>
<h2><a href="symbols/buckets.LinkedList.html">buckets.LinkedList</a></h2>
A linked list is a sequence of items arranged one after
another.
</div>
<hr />
<div>
<h2><a href="symbols/buckets.MultiDictionary.html">buckets.MultiDictionary</a></h2>
<p>A multi dictionary is a special kind of dictionary that holds
multiple values against each key.
</div>
<hr />
<div>
<h2><a href="symbols/buckets.PriorityQueue.html">buckets.PriorityQueue</a></h2>
<p>In a priority queue each element is associated with a "priority",
elements are dequeued in highest-priority-first order (the elements with the
highest priority are dequeued first).
</div>
<hr />
<div>
<h2><a href="symbols/buckets.Queue.html">buckets.Queue</a></h2>
A queue is a First-In-First-Out (FIFO) data structure, the first
element added to the queue will be the first one to be removed.
</div>
<hr />
<div>
<h2><a href="symbols/buckets.Set.html">buckets.Set</a></h2>
<p>A set is a data structure that contains no duplicate items.
</div>
<hr />
<div>
<h2><a href="symbols/buckets.Stack.html">buckets.Stack</a></h2>
A Stack is a Last-In-First-Out (LIFO) data structure, the last
element added to the stack will be the first one to be removed.
</div>
<hr />
</div>
</body>
</html>