Home > @hz-9/algorithm

algorithm package

Classes

Class	Description
AdelsonVelskiiLandiTree	Self-balancing tree. 自平衡树。
ArrayDeque	A deque implementation based on array. 一个基于数组的双向队列。
ArrayQueue	A queue implementation based on array. 一个基于数组的单向队列。
ArrayStack	A stack implementation based on arrays. 一个基于数组实现的栈。
BetterHashmap	一个比较合适的哈希表，采用 djb2 哈希算法，以及平方探测，用以解决冲突。
BinarySearchTree	Binary Search Tree 二叉搜索树
DoublyLinkedList	Doubly Linked List Class 双向链表
DoublyLinkedListNode	Doubly Linked List Node Class 双向链表节点
Edge	Edge class. 边类。
Graph	Graph class 图类。(邻接表)
KeyValue	A key-value pair. 一个键值对。
LinearProbingHashmap	A hashmap with linear probing. 一个使用线性探查的哈希表。
LinkedListDeque	A deque implementation based on DoublyLinkedList. 一个基于链表的双向队列。
LinkedListHashmap	A hash map with linked list chaining. When encountering hash collisions, it continues to search in the linked list. 一个链式寻址的哈希表。 若遇到哈希值冲突时，将会根据在链表中继续寻找。
LinkedListQueue	A queue implementation based on SinglyLinkedList. 一个基于链表的单向队列。
LinkedListStack	A stack implementation based on SinglyLinkedList. 一个基于数组实现的栈。
MaxHeap	Max Heap Class 最大堆
MinHeap	Min Heap Class 最小堆
ObjectDeque	A deque implementation based on object. 一个基于对象的双向队列。
ObjectQueue	A queue implementation based on object. 一个基于对象的单向队列。
ObjectStack	A stack implementation based on object. 一个基于对象实现的栈。
RedBlackTree	Red-Black Tree 红黑树
RedBlackTreeNode	Red-Black Tree Node 红黑树节点
SetPlus	A class that extends Set with additional functionalities. 一个扩展了 Set 的类，提供了额外的功能。
SimpleHashmap	A simple hashmap. It is prone to key collision issues, where conflicting keys cannot be added to the hashmap. 一个简单的哈希表。 它容易遇到键冲突问题，冲突的键无法添加到哈希表中。
SinglyLinkedList	Singly Linked List Class 单向链表
SinglyLinkedListNode	Singly Linked List Node Class 单向链表节点
SortedLinkedList	Sorted Linked List Class 有序链表
SquareProbingHashmap	A hashmap with square probing. 一个使用平方探查法的哈希表。
Vertice	Vertex class. 顶点类。

Abstract Classes

Abstract Class	Description
Base	Base class for algorithm. 基类。
Hashmap	A base class for hash maps. 一个哈希表的基类。

Enumerations

Enumeration	Description
Compare	Compare the two values. 比较两值结果。

Functions

Function	Description
adelsonVelskiiLandiTreeSearch(list, value, compareFn)	Sequential search algorithm.(AdelsonVelskiiLandiTree) Input parameters do not need to be sorted. 线性搜索算法。(自平衡树) 传入参数必须已经进行从小到大排序。
binarySearch(array, target, compareFn)	Binary search algorithm. Input parameters must be sorted in ascending order. 二分搜索算法。 传入参数无需排序。
binaryTreeSearch(list, value, compareFn)	Sequential search algorithm.(BinarySearchTree) Input parameters do not need to be sorted. 线性搜索算法。(二叉搜索树) 传入参数必须已经进行从小到大排序。
breadthFirstSearch(graph, startVertex, callback)	Breadth-first search algorithm (BFS). 广度优先搜索算法（BFS）。
breadthFirstSearchShortestPath(graph, startVertex)	Using Breadth-first search algorithm to obtain shortest path information. 使用广度优先搜索算法获取最短路径信息。
breadthFirstSearchShortestPathString(graph, startVertex, chars)	Using Breadth-first search algorithm to obtain shortest path information.(Return string) 使用广度优先搜索算法获取最短路径信息。(返回字符串)
bubbleSort(list, compareFu)	Bubble sort algorithm. 冒泡排序。 Time complexity: O(n^2 / 2) Time complexity badest case: O(n^2 / 2) Time complexity goodest case: O(n) Space complexity: O(1)
bubbleSortBase(list, compareFu)	Bubble sort algorithm. 冒泡排序。 Time complexity: O(n^2) Time complexity badest case: O(n^2) Time complexity goodest case: O(n) Space complexity: O(1)
bucketSort(list, compareFu, bucketSize, toNumber)	Bucket sort algorithm. 桶排序。 Time complexity: O(n)
countingSort(list, toNumber)	Counting sort algorithm. 计数排序。 Time complexity: O(n+k) Time complexity badest case: O(n+k) Time complexity goodest case: O(n+k) Space complexity: O(n+k)
defaultCompare(a, b)	Compare the relationship between a and b. 比较 a 和 b 的大小关系。
defaultEquals(a, b)	Check if a and b are equal. 判断 a 和 b 是否相等。
defaultToNumber(val)	Convert any type to a number. This function should ensure that different objects in the target dataset are not converted to the same number. 将任意类型转换为数字。 此函数应保证目标数据集中不同对象不会被转换为相同数字。
depthFirstSearch(graph, startVertex, callback, explore)	Depth-first search algorithm (DFS). 深度优先搜索算法（DFS）。
depthFirstSearchShortestPath(graph, startVertex)	Using Depth-first search algorithm to obtain shortest path information. FIXME: The results are not accurate, not recommended for use. 使用深度优先搜索算法获取最短路径信息。 ！！！结果不够准确，不建议使用。
depthFirstSearchShortestPathString(graph, startVertex, chars)	Using Depth-first search algorithm to obtain shortest path information.(Return string) FIXME: The results are not accurate, not recommended for use. 使用深度优先搜索算法获取最短路径信息。(返回字符串) ！！！结果不够准确，不建议使用。
depthFirstSearchVariety(graph, startVertex, callback)	Depth-first search algorithm (DFS). A variant implementation. 深度优先搜索算法（DFS）。 一个变种实现。
hashSearch(list, value, toKeyStr, toHashCode)	Hash search algorithm. Input parameters do not need to be sorted. 哈希搜索算法。 传入参数无需排序。
heapSort(list, compareFu)	Heap sort algorithm. 堆排序。 Time complexity: O(n logn) Time complexity badest case: O(n logn) Time complexity goodest case: O(n logn) Space complexity: O(1)
insertionSort(list, compareFu)	Insertion sort algorithm. 插入排序。 Time complexity: O(n^2) Time complexity badest case: O(n^2) Time complexity goodest case: O(n) Space complexity: O(1)
interpolationSearch(array, target, compareFn)	Interpolation search algorithm. Input parameters must be sorted in ascending order. 内插搜索算法。 传入参数必须已经进行从小到大排序。
kVEqualFn(a, b)	The equality function for KeyValue objects. KeyValue 对象的相等性函数。
kVToObj(keyValue)	The default function to convert a key-value pair to an object. 将键值对转换为对象的默认函数。
mergeSort(list, compareFu)	Merge sort algorithm. 归并排序。 Time complexity: O(n logn) Time complexity badest case: O(n logn) Time complexity goodest case: O(n logn) Space complexity: O(n)
quickSort(list, compareFu)	Quick sort algorithm. 快速排序。 Time complexity: O(n logn) Time complexity badest case: O(n^2) Time complexity goodest case: O(n logn) Space complexity: O(n logn)
radixSort(list, radixBase, toNumber)	Radix sort algorithm. 基数排序。 Time complexity: O(n*m) Time complexity badest case: O(n*m) Time complexity goodest case: O(n*m) Space complexity: O(m)
redBlackTreeSearch(list, value, compareFn)	Sequential search algorithm.(RedBlackTree) Input parameters do not need to be sorted. 线性搜索算法。(红黑树) 传入参数必须已经进行从小到大排序。
selectionSort(list, compareFu)	Selection sort algorithm. 选择排序。 Time complexity: O(n^2) Time complexity badest case: O(n^2) Time complexity goodest case: O(n) Space complexity: O(1)
sequentialSearch(list, value, equalsFn)	Sequential search algorithm. Input parameters must be sorted in ascending order. 线性搜索算法。 传入参数必须已经进行从小到大排序。
shuffleRandom(array)	Shuffle the array randomly. 随机打乱数组。
toKeyStrDefault(key)	Converts a key to a string. 将键转换为字符串。

Interfaces

Interface	Description
IGraphShortestPathReturn
IGraphToArrayItem	Graph class toArray function returns an array item. Graph 类 toArray 函数返回的数组项。
IKeyValueObj	An interface representing a key-value object. 表示键值对象的接口。

Variables

Variable	Description
djb2HashCode	djb2 hash function. Better than loselose hash function. djb2 散列函数。比 loselose 散列函数更好。
EMPTY_KEY_VALUE	An empty KeyValue. 一个空的 KeyValue。
loseloseHashCode	loselose hash function. loselose 散列函数。

Type Aliases

Type Alias	Description
CompareFn	(Type) Compare the relationship between a and b. (类型) 比较 a 和 b 的大小关系。
EqualsFn	(Type) Check if a and b are equal. (类型) 判断 a 和 b 是否相等。
ToHashCode	Converts a string key to a hash code. 将字符串键转换为哈希码。
ToKeyStr	Converts a key to a string. 将键转换为字符串。
ToNumberFn	Convert any type to a number. This function should ensure that different objects in the target dataset are not converted to the same number. 将任意类型转换为数字。 此函数应保证目标数据集中不同对象不会被转换为相同数字。