es-stl

v2.0.0-beta.1

Published

a year ago

EMCAScript Standard Template Library

Downloads

0High
0Medium
0Low

porky-prince

datastructures algorithms ds algm stl

es-stl

EMCAScript Standard Template Library

Install

npm:

$ npm install --save es-stl

yarn:

$ yarn add es-stl

Usage

Using es5

const binarySearch = require('ts-stl/algm/binarySearch');

binarySearch([1, 3, 5], 3);// => 1

Using es6 or typescript

import binarySearch from 'ts-stl/algm/binarySearch';

binarySearch([1, 3, 5], 3);// => 1

Reference

lodash

jquery

Modules

Classes

Functions

algm/binarySearch ⇒ number

Binary Search

| Param | Type | Default | Description | | --- | --- | --- | --- | | arr | Array.<T> | | an array after sort from small to large | | searchVal | number | | | | [cb] | ISearchCb.<T> | giveBackCb | | | [left] | number | 0 | | | [right] | number | arr.length - 1 | |

algm/binarySearchByRange ⇒ number

Binary search by range.

| Param | Type | Description | | --- | --- | --- | | arr | Array.<T> | an object array after sort from small to large | | searchVal | number | | | cb | ISearchRangeCb.<T> | |

Example

const dataList = [{s:0, e: 5}, {s:6, e: 18}, {s:19, e: 30}, ...];
binarySearchByRange(dataList, 10, (range: number[], data: {s: number, e: number}) => {
    range[0] = data.s;
    range[1] = data.e;
});
// => 1

const dataList = [{s:0, e: 5}, {s:5, e: 18}, {s:18, e: 30}, ...];
binarySearchByRange(dataList, 10, (range: number[], data: {s: number, e: number}) => {
    range[0] = data.s;
    range[1] = data.e - 1;
});
// => 1

algm/binarySearchInRange ⇒ number

Binary search in range [a, b).

| Param | Type | Description | | --- | --- | --- | | arr | Array.<T> | an object array after sort from small to large | | searchVal | number | | | cb | ISearchCb.<T> | |

Example

const dataList = [{num: 0}, {num: 100}, {num: 300}, {num: 700}, {num: 1000}];
binarySearchInRange(dataList, 125, (data: { num: number }) => data.num);
// => 1

i = binarySearchInRange(dataList, -10, (data: { num: number }) => data.num);
// => -1

i = binarySearchInRange(dataList, 0, (data: { num: number }) => data.num);
// => 0

i = binarySearchInRange(dataList, 100, (data: { num: number }) => data.num);
// => 1

i = binarySearchInRange(dataList, 300, (data: { num: number }) => data.num);
// => 2

i = binarySearchInRange(dataList, 350, (data: { num: number }) => data.num);
// => 2

i = binarySearchInRange(dataList, 800, (data: { num: number }) => data.num);
// => 3

i = binarySearchInRange(dataList, 1000, (data: { num: number }) => data.num);
// => 4

i = binarySearchInRange(dataList, 2000, (data: { num: number }) => data.num);
// => 4

algm/exponentialSearch ⇒ number

Exponential Search

| Param | Type | Default | Description | | --- | --- | --- | --- | | arr | Array.<T> | | an array after sort from small to large | | searchVal | number | | | | [cb] | ISearchCb.<T> | giveBackCb | |

algm/interpolationSearch ⇒ number

Interpolation Search

| Param | Type | Default | Description | | --- | --- | --- | --- | | arr | Array.<T> | | an array after sort from small to large | | searchVal | number | | | | [cb] | ISearchCb.<T> | giveBackCb | |

algm/mergeSortArr ⇒ Array.<T>

To combine two sorted arrays into an array sorted by original rules

Returns: Array.<T> - new array

| Param | Type | Description | | --- | --- | --- | | arr1 | Array.<T> | an array after sort | | arr2 | Array.<T> | an array after sort | | cb | ISortCb.<T> | |

algm/mergeSortSingle ⇒ Array.<T>

Inserts an element into an sorted array, keeping the original order

| Param | Type | Description | | --- | --- | --- | | arr | Array.<T> | an array after sort | | el | T | | | cb | ISortCb.<T> | |

algm/unique

Array Unique

ds/BinarySortTree

Binary Sort Tree

ds/BinarySortTree
- ~BinarySortNode
- ~BinarySortTree
  - .root ⇒ BinarySortNode.<V>
  - .isEmpty() ⇒ boolean
  - .insert(key, value) ⇒ boolean
  - .remove(key) ⇒ V | null
  - .search(key, node) ⇒ BinarySortNode.<V> | null
  - .getMinNode(node) ⇒ BinarySortNode.<V> | null
  - .getMaxNode(node) ⇒ BinarySortNode.<V> | null
  - .preOrder(cb)
  - .inOrder(cb)
  - .postOrder(cb)
  - .clear()

ds/BinarySortTree~BinarySortNode

Binary sort tree node

Kind: inner class of ds/BinarySortTree

ds/BinarySortTree~BinarySortTree

Kind: inner class of ds/BinarySortTree

~BinarySortTree
- .root ⇒ BinarySortNode.<V>
- .isEmpty() ⇒ boolean
- .insert(key, value) ⇒ boolean
- .remove(key) ⇒ V | null
- .search(key, node) ⇒ BinarySortNode.<V> | null
- .getMinNode(node) ⇒ BinarySortNode.<V> | null
- .getMaxNode(node) ⇒ BinarySortNode.<V> | null
- .preOrder(cb)
- .inOrder(cb)
- .postOrder(cb)
- .clear()

binarySortTree.root ⇒ BinarySortNode.<V>

root

Kind: instance property of BinarySortTree

binarySortTree.isEmpty() ⇒ boolean

isEmpty

Kind: instance method of BinarySortTree

binarySortTree.insert(key, value) ⇒ boolean

insert

Kind: instance method of BinarySortTree

| Param | Type | | --- | --- | | key | number | | value | V |

binarySortTree.remove(key) ⇒ V | null

remove

Kind: instance method of BinarySortTree

| Param | Type | | --- | --- | | key | number |

binarySortTree.search(key, node) ⇒ BinarySortNode.<V> | null

Kind: instance method of BinarySortTree

| Param | Type | | --- | --- | | key | number | | node | BinarySortNode.<V> |

binarySortTree.getMinNode(node) ⇒ BinarySortNode.<V> | null

getMinNode

Kind: instance method of BinarySortTree

| Param | Type | | --- | --- | | node | BinarySortNode.<V> |

binarySortTree.getMaxNode(node) ⇒ BinarySortNode.<V> | null

getMaxNode

Kind: instance method of BinarySortTree

| Param | Type | | --- | --- | | node | BinarySortNode.<V> |

binarySortTree.preOrder(cb)

preOrder

Kind: instance method of BinarySortTree

| Param | Type | | --- | --- | | cb | IOrderCb.<V> |

binarySortTree.inOrder(cb)

inOrder

Kind: instance method of BinarySortTree

| Param | Type | | --- | --- | | cb | IOrderCb.<V> |

binarySortTree.postOrder(cb)

postOrder

Kind: instance method of BinarySortTree

| Param | Type | | --- | --- | | cb | IOrderCb.<V> |

binarySortTree.clear()

clear

Kind: instance method of BinarySortTree

ds/Graph

Graph

ds/Graph
- ~Vertex
- ~Edge
- ~Graph
  - new Graph(_isDirected)
  - .vertexSize ⇒ number
  - .edgeSize ⇒ number
  - .isEmpty() ⇒ boolean
  - .isDirected() ⇒ boolean
  - .getVertex(key) ⇒ Vertex.<K, V, E> | undefined
  - .setVertex(key, value) ⇒ Vertex.<K, V, E>
  - .removeVertex(key) ⇒ Vertex.<K, V, E> | undefined
  - .getEdge(fromKey, toKey) ⇒ Edge.<K, V, E> | undefined
  - .setEdge(fromKey, toKey, value) ⇒ Edge.<K, V, E> | undefined
  - .removeEdge(fromKey, toKey) ⇒ Edge.<K, V, E> | undefined
  - .dfs(key, cb)
  - .bfs(key, cb)
  - .dijkstra(key, getWeight) ⇒ Dictionary.<K, number>
  - .clear()

ds/Graph~Vertex

Vertex

Kind: inner class of ds/Graph

ds/Graph~Edge

Edge

Kind: inner class of ds/Graph

ds/Graph~Graph

Kind: inner class of ds/Graph

~Graph
- new Graph(_isDirected)
- .vertexSize ⇒ number
- .edgeSize ⇒ number
- .isEmpty() ⇒ boolean
- .isDirected() ⇒ boolean
- .getVertex(key) ⇒ Vertex.<K, V, E> | undefined
- .setVertex(key, value) ⇒ Vertex.<K, V, E>
- .removeVertex(key) ⇒ Vertex.<K, V, E> | undefined
- .getEdge(fromKey, toKey) ⇒ Edge.<K, V, E> | undefined
- .setEdge(fromKey, toKey, value) ⇒ Edge.<K, V, E> | undefined
- .removeEdge(fromKey, toKey) ⇒ Edge.<K, V, E> | undefined
- .dfs(key, cb)
- .bfs(key, cb)
- .dijkstra(key, getWeight) ⇒ Dictionary.<K, number>
- .clear()

new Graph(_isDirected)

| Param | Type | Default | | --- | --- | --- | | _isDirected | boolean | false |

graph.vertexSize ⇒ number

vertexSize

Kind: instance property of Graph

graph.edgeSize ⇒ number

edgeSize

Kind: instance property of Graph