@@ -52,7 +52,7 @@ <h1 class="page-title">Source: data-structures/interval-tree.js</h1>
5252
5353 /**
5454 * Node which describes an interval.
55- *
55+ *
5656 * @public
5757 * @constructor
5858 * @param {Number} start Start of the interval.
@@ -67,7 +67,7 @@ <h1 class="page-title">Source: data-structures/interval-tree.js</h1>
6767 */
6868 this.interval = [start, end];
6969 /**
70- * Max endpoint in subtree which starts from this node.
70+ * Max endpoint in subtree which starts from this node.
7171 * @member {Number}
7272 */
7373 this.max = -Infinity;
@@ -134,7 +134,7 @@ <h1 class="page-title">Source: data-structures/interval-tree.js</h1>
134134
135135 /**
136136 * Add new interval to the tree.
137- *
137+ *
138138 * @public
139139 * @param {Array} intreval Array with start and end points of the interval.
140140 */
@@ -169,7 +169,7 @@ <h1 class="page-title">Source: data-structures/interval-tree.js</h1>
169169 /**
170170 * Checks or point belongs to at least one intarval from the tree.<br> <br>
171171 * Complexity: O(log N).
172- *
172+ *
173173 * @public
174174 * @method
175175 * @param {Number} point Point which should be checked.
@@ -224,7 +224,7 @@ <h1 class="page-title">Source: data-structures/interval-tree.js</h1>
224224
225225 /**
226226 * Returns height of the tree.
227- *
227+ *
228228 * @public
229229 * @method
230230 * @return {Number} Height of the tree.
@@ -347,13 +347,13 @@ <h1 class="page-title">Source: data-structures/interval-tree.js</h1>
347347</ div >
348348
349349< nav >
350- < h2 > < a href ="index.html "> Home</ a > </ h2 > < h3 > Modules</ h3 > < ul > < li > < a href ="module-data-structures_binary-search-tree.html "> data-structures/binary-search-tree</ a > </ li > < li > < a href ="module-data-structures_heap.html "> data-structures/heap</ a > </ li > < li > < a href ="module-data-structures_interval-tree.html "> data-structures/interval-tree</ a > </ li > < li > < a href ="module-data-structures_linked-list.html "> data-structures/linked-list</ a > </ li > < li > < a href ="module-data-structures_red-black-tree.html "> data-structures/red-black-tree</ a > </ li > < li > < a href ="module-graphs_others_topological-sort.html "> graphs/others/topological-sort</ a > </ li > < li > < a href ="module-graphs_searching_bfs.html "> graphs/searching/bfs</ a > </ li > < li > < a href ="module-graphs_searching_dfs.html "> graphs/searching/dfs</ a > </ li > < li > < a href ="module-graphs_shortest-path_bellman-ford.html "> graphs/shortest-path/bellman-ford</ a > </ li > < li > < a href ="module-graphs_shortest-path_dijkstra.html "> graphs/shortest-path/dijkstra</ a > </ li > < li > < a href ="module-graphs_shortest-path_floyd-warshall.html "> graphs/shortest-path/floyd-warshall</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.html "> graphs/spanning-trees/prim</ a > </ li > < li > < a href ="module-primes_is-prime.html "> primes/is-prime</ a > </ li > < li > < a href ="module-primes_prime-factor-tree.html "> primes/prime-factor-tree</ a > </ li > < li > < a href ="module-primes_sieve-of-eratosthenes.html "> primes/sieve-of-eratosthenes</ a > </ li > </ ul > < h3 > Classes</ h3 > < ul > < li > < a href ="module-data-structures_binary-search-tree.BinaryTree.html "> BinaryTree</ a > </ li > < li > < a href ="module-data-structures_binary-search-tree.Node.html "> Node</ a > </ li > < li > < a href ="module-data-structures_heap.Heap.html "> Heap</ a > </ li > < li > < a href ="module-data-structures_interval-tree.IntervalTree.html "> IntervalTree</ a > </ li > < li > < a href ="module-data-structures_interval-tree.Node.html "> Node</ a > </ li > < li > < a href ="module-data-structures_linked-list.LinkedList.html "> LinkedList</ a > </ li > < li > < a href ="module-data-structures_linked-list.Node.html "> Node</ a > </ li > < li > < a href ="module-data-structures_red-black-tree.RBTree.html "> RBTree</ a > </ li > < li > < a href ="module-graphs_shortest-path_bellman-ford.Edge.html "> Edge</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.Edge.html "> Edge</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.Graph.html "> Graph</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.Vertex.html "> Vertex</ a > </ li > </ ul >
350+ < h2 > < a href ="index.html "> Home</ a > </ h2 > < h3 > Modules</ h3 > < ul > < li > < a href ="module-combinatorics_cartesianproduct.html "> combinatorics/cartesianproduct</ a > </ li > < li > < a href ="module-combinatorics_combinations.html "> combinatorics/combinations</ a > </ li > < li > < a href ="module-combinatorics_permutations.html "> combinatorics/permutations</ a > </ li > < li > < a href ="module-combinatorics_variations-repetition.html "> combinatorics/variations-repetition</ a > </ li > < li > < a href ="module-data-structures_binary-search-tree.html "> data-structures/binary-search-tree</ a > </ li > < li > < a href ="module-data-structures_heap.html "> data-structures/heap</ a > </ li > < li > < a href ="module-data-structures_interval-tree.html "> data-structures/interval-tree</ a > </ li > < li > < a href ="module-data-structures_linked-list.html "> data-structures/linked-list</ a > </ li > < li > < a href ="module-data-structures_red-black-tree.html "> data-structures/red-black-tree</ a > </ li > < li > < a href ="module-graphs_others_topological-sort.html "> graphs/others/topological-sort</ a > </ li > < li > < a href ="module-graphs_searching_bfs.html "> graphs/searching/bfs</ a > </ li > < li > < a href ="module-graphs_searching_dfs.html "> graphs/searching/dfs</ a > </ li > < li > < a href ="module-graphs_shortest-path_bellman-ford.html "> graphs/shortest-path/bellman-ford</ a > </ li > < li > < a href ="module-graphs_shortest-path_dijkstra.html "> graphs/shortest-path/dijkstra</ a > </ li > < li > < a href ="module-graphs_shortest-path_floyd-warshall.html "> graphs/shortest-path/floyd-warshall</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.html "> graphs/spanning-trees/prim</ a > </ li > < li > < a href ="module-primes_is-prime.html "> primes/is-prime</ a > </ li > < li > < a href ="module-primes_prime-factor-tree.html "> primes/prime-factor-tree</ a > </ li > < li > < a href ="module-primes_sieve-of-eratosthenes.html "> primes/sieve-of-eratosthenes</ a > </ li > </ ul > < h3 > Classes</ h3 > < ul > < li > < a href ="module-data-structures_binary-search-tree.BinaryTree.html "> BinaryTree</ a > </ li > < li > < a href ="module-data-structures_binary-search-tree.Node.html "> Node</ a > </ li > < li > < a href ="module-data-structures_heap.Heap.html "> Heap</ a > </ li > < li > < a href ="module-data-structures_interval-tree.IntervalTree.html "> IntervalTree</ a > </ li > < li > < a href ="module-data-structures_interval-tree.Node.html "> Node</ a > </ li > < li > < a href ="module-data-structures_linked-list.LinkedList.html "> LinkedList</ a > </ li > < li > < a href ="module-data-structures_linked-list.Node.html "> Node</ a > </ li > < li > < a href ="module-data-structures_red-black-tree.RBTree.html "> RBTree</ a > </ li > < li > < a href ="module-graphs_shortest-path_bellman-ford.Edge.html "> Edge</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.Edge.html "> Edge</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.Graph.html "> Graph</ a > </ li > < li > < a href ="module-graphs_spanning-trees_prim.Vertex.html "> Vertex</ a > </ li > </ ul >
351351</ nav >
352352
353353< br class ="clear ">
354354
355355< footer >
356- Documentation generated by < a href ="https://github.com/jsdoc3/jsdoc "> JSDoc 3.3.0-alpha13</ a > on Sun Jan 11 2015 19:07:45 GMT+0200 (EET)
356+ Documentation generated by < a href ="https://github.com/jsdoc3/jsdoc "> JSDoc 3.3.0-alpha13</ a > on Sun Jan 11 2015 20:12:49 GMT+0200 (EET)
357357</ footer >
358358
359359< script > prettyPrint ( ) ; </ script >
0 commit comments