data-footstone

overview

使用 ts 编写基本的数据结构。

feature

• stack
• queue
  • PriorityQueue
• chain
  • SingleChain
  • DoublyChain
  • SingleCircleChain
  • DoublyCircleChain
• hashMap
  • hash 方法
• tree
  • BinaryTree
  • BinarySearchTree
  • AVLTree
• graph
  • DirectionGraph
  • UndirectionGraph
• sort
• cache
  • fifo
  • lru
  • lfu

install

npm i data-footstone

usage

import { Stack } from 'data-footstone'
let s = new Stack()
s.push(1, 2, 3, 4)
s.toArray() // [1,2,3,4]
s.pop() // 4
s.pop() // 3
s.peek() // 2
s.isEmpty() // false
s.clear() // 清空栈

api

interface BinarySearchTreeNode<T> extends BinaryTreeNode<T> {
  key: N
  value: T | null
  left: BinarySearchTreeNodeOrNull<T>
  right: BinarySearchTreeNodeOrNull<T>
  parent: BinarySearchTreeNode<T>
  clone: () => BinarySearchTreeNode<T>
  'operator<': (otherNode: BinarySearchTreeNode<T>) => B
  'operator>': (otherNode: BinarySearchTreeNode<T>) => B
  'operator===': (otherNode: BinarySearchTreeNode<T>) => B
  'operator!==': (otherNode: BinarySearchTreeNode<T>) => B
  isLeft: () => B
  isRight: () => B
  sibling: () => BinarySearchTreeNodeOrNull<T>
  uncle: () => BinarySearchTreeNodeOrNull<T>
}
type BinarySearchTreeNodeOrNull<T> = BinarySearchTreeNode<T> | null

type AVLTreeNode<T> = BinarySearchTreeNode<T>
type AVLTreeNodeOrNull<T> = BinarySearchTreeNodeOrNull<T>

暂时没开放此类

interface Vertex<T> {
  data: T
  inDegree: N
  outDegree: N
  status: A
  dTime: D // 考虑使用ms
  fTime: D
  // parent: VertexOrNull<T>
}
type VertexOrNull<T> = Vertex<T> | null
interface Edge<T> {
  data: A // 可能这里需要修改
  start: Vertex<T>
  end: Vertex<T>
  weight: N
  status: A
}
type EdgeOrNull<T> = Edge<T> | null
type ShortestPathObj<T> = {
  distance: Map<T, N>
  predecessors: Map<T, T>
}

principle

此包的处理逻辑。

uml

todo

未来迭代计划。
未来迭代计划。