jc-structure 0.0.6 → 0.0.8

package/dist/jc-structure.js

@@ -1,4 +1,4 @@
-class e {
+class f {
   items = {};
   count = 0;
   lowestCount = 0;
@@ -10,8 +10,8 @@ class e {
     return delete this.items[this.lowestCount], this.lowestCount++, t;
   }
   enqueue(...t) {
-    t.forEach((s) => {
-      this.items[this.count] = s, this.count++;
+    t.forEach((e) => {
+      this.items[this.count] = e, this.count++;
     });
   }
   front() {
@@ -30,7 +30,7 @@ class e {
     return this.isEmpty() ? "" : `Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`;
   }
 }
-class o {
+class g {
   items = {};
   count = 0;
   constructor() {
@@ -42,8 +42,8 @@ class o {
     return delete this.items[this.count], t;
   }
   push(...t) {
-    t.forEach((s) => {
-      this.items[this.count] = s, this.count++;
+    t.forEach((e) => {
+      this.items[this.count] = e, this.count++;
     });
   }
   peek() {
@@ -62,7 +62,315 @@ class o {
     return this.isEmpty() ? "" : `Stack(count: ${this.count}):[${this.items[this.count - 1]},...rest]`;
   }
 }
+function o(s, t) {
+  return s === t ? 0 : s < t ? -1 : 1;
+}
+class n {
+  heap = [];
+  compareFn;
+  constructor(t = o) {
+    this.compareFn = t;
+  }
+  static getLeftIndex(t) {
+    return 2 * t + 1;
+  }
+  static getRightIndex(t) {
+    return 2 * t + 2;
+  }
+  static getParentIndex(t) {
+    return t === 0 ? void 0 : Math.floor((t - 1) / 2);
+  }
+  static swap(t, e, i) {
+    [t[e], t[i]] = [t[i], t[e]];
+  }
+  find() {
+    return this.isEmpty() ? void 0 : this.heap[0];
+  }
+  size() {
+    return this.heap.length;
+  }
+  isEmpty() {
+    return this.size() === 0;
+  }
+  clear() {
+    this.heap = [];
+  }
+  toString() {
+    return this.heap.toString();
+  }
+}
+class l extends n {
+  insert(t) {
+    return t ? !1 : (this.heap.push(t), this.siftUp(this.heap.length - 1), !0);
+  }
+  extract() {
+    if (this.isEmpty()) return;
+    if (this.heap.length === 1) return this.heap.shift();
+    const t = this.heap[0];
+    return this.heap[0] = this.heap.pop(), this.siftDown(0), t;
+  }
+  siftUp(t) {
+    let e = t, i = n.getLeftIndex(e), r = n.getRightIndex(e), h = this.size();
+    i < h && this.compareFn(this.heap[e], this.heap[i]) === -1 && (e = i), r < h && this.compareFn(this.heap[e], this.heap[r]) === 1 && (e = r), e !== t && (n.swap(this.heap, t, e), this.siftUp(e));
+  }
+  siftDown(t) {
+    let e = n.getParentIndex(t);
+    for (; t > 0 && e && this.compareFn(this.heap[e], this.heap[t]) === 1; )
+      n.swap(this.heap, e, t), t = e, e = n.getParentIndex(t);
+  }
+}
+class m extends l {
+  constructor(t = (e, i) => o(i, e)) {
+    super(t);
+  }
+}
+function c(s) {
+  return { value: s };
+}
+class v {
+  capacity;
+  length = 0;
+  head = null;
+  tail = null;
+  lookup = /* @__PURE__ */ new Map();
+  reverseLookup = /* @__PURE__ */ new Map();
+  constructor(t = 10) {
+    this.capacity = t;
+  }
+  prepend(t) {
+    this.head ? (t.next = this.head, this.head.prev = t, this.head = t) : this.head = this.tail = t;
+  }
+  detach(t) {
+    t.prev && (t.prev.next = t.next), t.next && (t.next.prev = t.prev), this.head === t && (this.head = this.head.next || null), this.tail === t && (this.tail = this.tail.prev || null), t.next = void 0, t.prev = void 0;
+  }
+  trimCache() {
+    if (this.length <= this.capacity) return;
+    const t = this.tail;
+    this.detach(t);
+    const e = this.reverseLookup.get(t);
+    this.lookup.delete(e), this.reverseLookup.delete(t), this.length--;
+  }
+  get(t) {
+    const e = this.lookup.get(t);
+    if (e)
+      return this.detach(e), this.prepend(e), e.value;
+  }
+  update(t, e) {
+    let i = this.lookup.get(t);
+    i ? (this.detach(i), this.prepend(i), i.value = e) : (i = c(e), this.length++, this.prepend(i), this.trimCache(), this.lookup.set(t, i), this.reverseLookup);
+  }
+}
+class u {
+  value;
+  next = void 0;
+}
+class x {
+  count = 0;
+  head = void 0;
+  constructor() {
+  }
+  indexOf(t) {
+    let e = this.head, i = 0, r = !1;
+    for (; e; ) {
+      if (this.equals(e.value, t)) {
+        r = !0;
+        break;
+      }
+      i++, e = e.next;
+    }
+    return r ? i : -1;
+  }
+  equals(t, e) {
+    return !1;
+  }
+  getElementAt(t) {
+    if (t < 0 || t >= this.count)
+      return;
+    if (t === 0)
+      return this.head;
+    let e = this.head;
+    for (let i = 0; i < t; i++)
+      e = e?.next;
+    return e;
+  }
+  getValueAt(t) {
+    return this.getElementAt(t)?.value;
+  }
+  insert(t, e) {
+    let i = new u();
+    if (i.value = t, e > this.count || e < 0)
+      throw new Error("index error");
+    this.count++;
+    let r, h;
+    if (e === 0) {
+      i.next = this.head, this.head = i;
+      return;
+    }
+    r = this.getElementAt(e - 1), h = r.next, r.next = i, i.next = h;
+  }
+  push(t) {
+    let e = new u();
+    if (e.value = t, this.count++, this.isEmpty()) {
+      this.head = e;
+      return;
+    }
+    let i = this.getElementAt(this.count - 1);
+    i.next = e;
+  }
+  remove(t) {
+    const e = this.indexOf(t);
+    return e === -1 ? void 0 : this.removeAt(e);
+  }
+  removeAt(t) {
+    if (this.isEmpty() || t < 0 || t >= this.count)
+      return;
+    let e = this.getElementAt(t), i = this.getElementAt(t - 1), r = e?.next;
+    return t === 0 && (this.head = r), i && (i.next = r), this.count--, e?.value;
+  }
+  isEmpty() {
+    return this.count === 0;
+  }
+  size() {
+    return this.count;
+  }
+  clear() {
+    this.count = 0, this.head = void 0;
+  }
+  toString() {
+    let t = "", e = this.head;
+    for (; e; )
+      t += e.value, t += ",", e = e.next;
+    return t = t.slice(0, -1), t;
+  }
+}
+class p {
+  key;
+  value;
+  constructor(t, e) {
+    this.key = t, this.value = e;
+  }
+}
+function a(s, t = { emptyString: !1, zeroNumber: !1 }) {
+  return s == null ? !(t.emptyString && s === "" || t.zeroNumber && s === 0) : !1;
+}
+class d {
+  table = [];
+  constructor() {
+  }
+  getItemIndex(t) {
+    for (let e = 0, i = this.table.length; e < i; e++)
+      if (this.table[e].key === t)
+        return e;
+    return -1;
+  }
+  set(t, e) {
+    if (a(t))
+      throw new Error("key is required");
+    if (a(e))
+      throw new Error("value is required");
+    if (this.has(t)) {
+      let i = this.getItemIndex(t);
+      this.table[i].value = e;
+    } else {
+      const i = new p(t, e);
+      this.table.push(i);
+    }
+  }
+  remove(t) {
+    if (this.has(t)) {
+      let e = this.getItemIndex(t);
+      return this.table.splice(e, 1)[0];
+    }
+  }
+  has(t) {
+    return this.getItemIndex(t) !== -1;
+  }
+  get(t) {
+    if (this.has(t)) {
+      let e = this.getItemIndex(t);
+      return this.table[e];
+    }
+  }
+  keys() {
+    return this.table.map((t) => t.key);
+  }
+  values() {
+    return this.table.map((t) => t.value);
+  }
+  keyValues() {
+    return this.table.map((t) => [t.key, t.value]);
+  }
+  forEach(t) {
+    for (let e = 0, i = this.size(); e < i; e++) {
+      let r = this.table[e];
+      if (!t(r.key, r.value))
+        break;
+    }
+  }
+  isEmpty() {
+    return !this.size();
+  }
+  size() {
+    return this.table.length;
+  }
+  clear() {
+    this.table = [];
+  }
+  toString() {
+    let t = "";
+    for (let e = 0, i = this.table.length; e < i; e++)
+      t += this.table[e].toString(), t += ",";
+    return t = t.slice(0, -1), t;
+  }
+}
+class y {
+  isDirected;
+  vertices;
+  adjList;
+  constructor(t = !1) {
+    this.isDirected = t, this.vertices = [], this.adjList = new d();
+  }
+  addVertex(t) {
+    this.vertices.includes(t) || (this.vertices.push(t), this.adjList.set(t, []));
+  }
+  addEdge(t, e) {
+    this.adjList.get(t) || this.addVertex(t), this.adjList.get(e) || this.addVertex(e), this.adjList.get(t)?.value.indexOf(e) === -1 && this.adjList.get(t)?.value.push(e), this.isDirected || this.adjList.get(e)?.value.indexOf(t) === -1 && this.adjList.get(e)?.value.push(t);
+  }
+  getVertices() {
+    return this.vertices;
+  }
+  getAdjacencyList() {
+    return this.adjList;
+  }
+  toString() {
+    let t = "";
+    for (let e = 0; e < this.vertices.length; e++)
+      t += this.vertices[e] + "-->", t += this.adjList.get(this.vertices[e])?.toString() || "", t += `
+`;
+    return t;
+  }
+}
+function E(s) {
+  let t;
+  const e = new Proxy(s, {
+    construct(i, r, h) {
+      return t || (t = Reflect.construct(
+        i,
+        r,
+        h
+      )), t;
+    }
+  });
+  return s.prototype.constructor = e, e;
+}
 export {
-  e as Queue,
-  o as Stack
+  d as Dictionary,
+  y as Graph,
+  v as LRU,
+  x as LinkedList,
+  m as MaxHeap,
+  l as MinHeap,
+  f as Queue,
+  g as Stack,
+  E as singleton
 };

package/dist/jc-structure.umd.cjs

@@ -1 +1,2 @@
-(function(t,e){typeof exports=="object"&&typeof module<"u"?e(exports):typeof define=="function"&&define.amd?define(["exports"],e):(t=typeof globalThis<"u"?globalThis:t||self,e(t["jc-structure"]={}))})(this,(function(t){"use strict";class e{items={};count=0;lowestCount=0;constructor(){}dequeue(){if(this.isEmpty())return;const s=this.items[this.lowestCount];return delete this.items[this.lowestCount],this.lowestCount++,s}enqueue(...s){s.forEach(i=>{this.items[this.count]=i,this.count++})}front(){return this.isEmpty()?void 0:this.items[this.lowestCount]}isEmpty(){return this.size()===0}size(){return this.count-this.lowestCount}clear(){this.items={},this.count=0,this.lowestCount=0}toString(){return this.isEmpty()?"":`Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`}}class u{items={};count=0;constructor(){}pop(){if(this.isEmpty())return;this.count--;const s=this.items[this.count];return delete this.items[this.count],s}push(...s){s.forEach(i=>{this.items[this.count]=i,this.count++})}peek(){return this.isEmpty()?void 0:this.items[this.count-1]}isEmpty(){return this.count===0}size(){return this.count}clear(){this.items={},this.count=0}toString(){return this.isEmpty()?"":`Stack(count: ${this.count}):[${this.items[this.count-1]},...rest]`}}t.Queue=e,t.Stack=u,Object.defineProperty(t,Symbol.toStringTag,{value:"Module"})}));
+(function(h,a){typeof exports=="object"&&typeof module<"u"?a(exports):typeof define=="function"&&define.amd?define(["exports"],a):(h=typeof globalThis<"u"?globalThis:h||self,a(h["jc-structure"]={}))})(this,(function(h){"use strict";class a{items={};count=0;lowestCount=0;constructor(){}dequeue(){if(this.isEmpty())return;const t=this.items[this.lowestCount];return delete this.items[this.lowestCount],this.lowestCount++,t}enqueue(...t){t.forEach(e=>{this.items[this.count]=e,this.count++})}front(){return this.isEmpty()?void 0:this.items[this.lowestCount]}isEmpty(){return this.size()===0}size(){return this.count-this.lowestCount}clear(){this.items={},this.count=0,this.lowestCount=0}toString(){return this.isEmpty()?"":`Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`}}class f{items={};count=0;constructor(){}pop(){if(this.isEmpty())return;this.count--;const t=this.items[this.count];return delete this.items[this.count],t}push(...t){t.forEach(e=>{this.items[this.count]=e,this.count++})}peek(){return this.isEmpty()?void 0:this.items[this.count-1]}isEmpty(){return this.count===0}size(){return this.count}clear(){this.items={},this.count=0}toString(){return this.isEmpty()?"":`Stack(count: ${this.count}):[${this.items[this.count-1]},...rest]`}}function o(s,t){return s===t?0:s<t?-1:1}class u{heap=[];compareFn;constructor(t=o){this.compareFn=t}static getLeftIndex(t){return 2*t+1}static getRightIndex(t){return 2*t+2}static getParentIndex(t){return t===0?void 0:Math.floor((t-1)/2)}static swap(t,e,i){[t[e],t[i]]=[t[i],t[e]]}find(){return this.isEmpty()?void 0:this.heap[0]}size(){return this.heap.length}isEmpty(){return this.size()===0}clear(){this.heap=[]}toString(){return this.heap.toString()}}class l extends u{insert(t){return t?!1:(this.heap.push(t),this.siftUp(this.heap.length-1),!0)}extract(){if(this.isEmpty())return;if(this.heap.length===1)return this.heap.shift();const t=this.heap[0];return this.heap[0]=this.heap.pop(),this.siftDown(0),t}siftUp(t){let e=t,i=u.getLeftIndex(e),r=u.getRightIndex(e),n=this.size();i<n&&this.compareFn(this.heap[e],this.heap[i])===-1&&(e=i),r<n&&this.compareFn(this.heap[e],this.heap[r])===1&&(e=r),e!==t&&(u.swap(this.heap,t,e),this.siftUp(e))}siftDown(t){let e=u.getParentIndex(t);for(;t>0&&e&&this.compareFn(this.heap[e],this.heap[t])===1;)u.swap(this.heap,e,t),t=e,e=u.getParentIndex(t)}}class g extends l{constructor(t=(e,i)=>o(i,e)){super(t)}}function m(s){return{value:s}}class v{capacity;length=0;head=null;tail=null;lookup=new Map;reverseLookup=new Map;constructor(t=10){this.capacity=t}prepend(t){this.head?(t.next=this.head,this.head.prev=t,this.head=t):this.head=this.tail=t}detach(t){t.prev&&(t.prev.next=t.next),t.next&&(t.next.prev=t.prev),this.head===t&&(this.head=this.head.next||null),this.tail===t&&(this.tail=this.tail.prev||null),t.next=void 0,t.prev=void 0}trimCache(){if(this.length<=this.capacity)return;const t=this.tail;this.detach(t);const e=this.reverseLookup.get(t);this.lookup.delete(e),this.reverseLookup.delete(t),this.length--}get(t){const e=this.lookup.get(t);if(e)return this.detach(e),this.prepend(e),e.value}update(t,e){let i=this.lookup.get(t);i?(this.detach(i),this.prepend(i),i.value=e):(i=m(e),this.length++,this.prepend(i),this.trimCache(),this.lookup.set(t,i),this.reverseLookup)}}class c{value;next=void 0}class y{count=0;head=void 0;constructor(){}indexOf(t){let e=this.head,i=0,r=!1;for(;e;){if(this.equals(e.value,t)){r=!0;break}i++,e=e.next}return r?i:-1}equals(t,e){return!1}getElementAt(t){if(t<0||t>=this.count)return;if(t===0)return this.head;let e=this.head;for(let i=0;i<t;i++)e=e?.next;return e}getValueAt(t){return this.getElementAt(t)?.value}insert(t,e){let i=new c;if(i.value=t,e>this.count||e<0)throw new Error("index error");this.count++;let r,n;if(e===0){i.next=this.head,this.head=i;return}r=this.getElementAt(e-1),n=r.next,r.next=i,i.next=n}push(t){let e=new c;if(e.value=t,this.count++,this.isEmpty()){this.head=e;return}let i=this.getElementAt(this.count-1);i.next=e}remove(t){const e=this.indexOf(t);return e===-1?void 0:this.removeAt(e)}removeAt(t){if(this.isEmpty()||t<0||t>=this.count)return;let e=this.getElementAt(t),i=this.getElementAt(t-1),r=e?.next;return t===0&&(this.head=r),i&&(i.next=r),this.count--,e?.value}isEmpty(){return this.count===0}size(){return this.count}clear(){this.count=0,this.head=void 0}toString(){let t="",e=this.head;for(;e;)t+=e.value,t+=",",e=e.next;return t=t.slice(0,-1),t}}class E{key;value;constructor(t,e){this.key=t,this.value=e}}function p(s,t={emptyString:!1,zeroNumber:!1}){return s==null?!(t.emptyString&&s===""||t.zeroNumber&&s===0):!1}class d{table=[];constructor(){}getItemIndex(t){for(let e=0,i=this.table.length;e<i;e++)if(this.table[e].key===t)return e;return-1}set(t,e){if(p(t))throw new Error("key is required");if(p(e))throw new Error("value is required");if(this.has(t)){let i=this.getItemIndex(t);this.table[i].value=e}else{const i=new E(t,e);this.table.push(i)}}remove(t){if(this.has(t)){let e=this.getItemIndex(t);return this.table.splice(e,1)[0]}}has(t){return this.getItemIndex(t)!==-1}get(t){if(this.has(t)){let e=this.getItemIndex(t);return this.table[e]}}keys(){return this.table.map(t=>t.key)}values(){return this.table.map(t=>t.value)}keyValues(){return this.table.map(t=>[t.key,t.value])}forEach(t){for(let e=0,i=this.size();e<i;e++){let r=this.table[e];if(!t(r.key,r.value))break}}isEmpty(){return!this.size()}size(){return this.table.length}clear(){this.table=[]}toString(){let t="";for(let e=0,i=this.table.length;e<i;e++)t+=this.table[e].toString(),t+=",";return t=t.slice(0,-1),t}}class w{isDirected;vertices;adjList;constructor(t=!1){this.isDirected=t,this.vertices=[],this.adjList=new d}addVertex(t){this.vertices.includes(t)||(this.vertices.push(t),this.adjList.set(t,[]))}addEdge(t,e){this.adjList.get(t)||this.addVertex(t),this.adjList.get(e)||this.addVertex(e),this.adjList.get(t)?.value.indexOf(e)===-1&&this.adjList.get(t)?.value.push(e),this.isDirected||this.adjList.get(e)?.value.indexOf(t)===-1&&this.adjList.get(e)?.value.push(t)}getVertices(){return this.vertices}getAdjacencyList(){return this.adjList}toString(){let t="";for(let e=0;e<this.vertices.length;e++)t+=this.vertices[e]+"-->",t+=this.adjList.get(this.vertices[e])?.toString()||"",t+=`
+`;return t}}function x(s){let t;const e=new Proxy(s,{construct(i,r,n){return t||(t=Reflect.construct(i,r,n)),t}});return s.prototype.constructor=e,e}h.Dictionary=d,h.Graph=w,h.LRU=v,h.LinkedList=y,h.MaxHeap=g,h.MinHeap=l,h.Queue=a,h.Stack=f,h.singleton=x,Object.defineProperty(h,Symbol.toStringTag,{value:"Module"})}));

package/index.d.ts

@@ -35,6 +35,9 @@ declare module "jc-structure" {
     clear(): void;
   }
 
+  /**
+   * 队列类，采用object实现
+   */
   export class Queue<T> implements IQueue<T> {
     constructor();
     /**
@@ -67,4 +70,233 @@ declare module "jc-structure" {
      */
     clear(): void;
   }
+
+  // export function compareFn(a: any, b: any): CompareResult;
+
+  /**
+   * 最小堆
+   */
+  export class MinHeap<T> {
+    constructor(fn?: (a: T, b: T) => CompareResult);
+    /**
+     * 向堆中添加元素
+     * @param args 要添加的元素，可以是多个或一个元素。
+     */
+    insert(...args: Array<T>): void;
+    /**
+     * #### 移除最小值或最大值，返回该值
+     */
+    extract(): T | undefined;
+    /**
+     * 查找一个值
+     * @param value 要查找的值
+     */
+    find(): T | undefined;
+    /**
+     * 判断数据结构是否为空
+     */
+    isEmpty(): boolean;
+    /**
+     * 数据结构元素长度
+     */
+    size(): number;
+    /**
+     * 重写 toString 方法
+     */
+    toString(): string;
+  }
+
+  /**
+   * 最大堆
+   */
+  export class MaxHeap<T> extends MinHeap<T> {
+    constructor(fn?: (a: T, b: T) => CompareResult);
+  }
+
+  /**
+   * LRU缓存类
+   */
+  export class LRU<K, V> {
+    constructor(capacity?: number);
+    /**
+     * 获取缓存的值
+     * @param key 键值
+     */
+    get(key: K): V | undefined;
+    /**
+     * 更新缓存
+     * @param key 键值
+     * @param value 缓存的值
+     */
+    update(key: K, value: V): void;
+  }
+
+  /**
+   * 链表节点类
+   */
+  export class LinkedList<T> {
+    constructor();
+    /**
+     * #### 向链表中添加元素
+     * @param element 要添加的元素
+     */
+    push(element: T): void;
+
+    /**
+     * #### 在指定位置插入元素
+     * @param element 要插入的元素
+     * @param index 插入的位置索引
+     */
+    insert(element: T, index: number): void;
+
+    /**
+     * #### 获取指定位置的节点
+     * @param index 指定位置索引
+     */
+    getElementAt(index: number): Node<T> | undefined;
+
+    /**
+     * #### 获取指定位置的值
+     * @param index 指定位置索引
+     */
+    getValueAt(index: number): T | undefined;
+
+    /**
+     * #### 移除指定位置的元素
+     * @param index 指定位置索引
+     */
+    removeAt(index: number): T | undefined;
+
+    /**
+     * #### 移除指定元素
+     * @param element 指定元素
+     */
+    remove(element: T): T | undefined;
+
+    /**
+     * #### 获取指定元素的索引
+     * @param element 指定元素
+     */
+    indexOf(element: T): number | undefined;
+
+    /**
+     * 判断数据结构是否为空
+     */
+    isEmpty(): boolean;
+    /**
+     * 数据结构元素长度
+     */
+    size(): number;
+    /**
+     * 重写 toString 方法
+     */
+    toString(): string;
+    /**
+     * 清除数据结构元素
+     */
+    clear(): void;
+  }
+
+  /**
+   * 字典类
+   */
+  export class Dictionary<K, V> {
+    constructor();
+    /**
+     * #### 设置键值对
+     * @param key 键
+     * @param value 值
+     */
+    set(key: K, value: V): void;
+
+    /**
+     * #### 删除键值对
+     * @param key 键
+     */
+    remove(key: K): ValuePair<K, V> | undefined;
+
+    /**
+     * #### 判断键是否存在
+     * @param key 键
+     */
+    has(key: K): boolean;
+
+    /**
+     * #### 获取键值对
+     * @param key 键
+     */
+    get(key: K): ValuePair<K, V> | undefined;
+
+    /**
+     * #### 获取键数组
+     */
+    keys(): Array<K>;
+
+    /**
+     * #### 获取值数组
+     */
+    values(): Array<V>;
+
+    /**
+     * #### 获取键值对数组
+     */
+    keyValues(): Array<[K, V]>;
+
+    /**
+     * 遍历键值对
+     * @param callbackFunc 回调函数
+     */
+    forEach(callbackFunc: (key: K, value: V) => boolean | void): void;
+
+    /**
+     * 判断数据结构是否为空
+     */
+    isEmpty(): boolean;
+    /**
+     * 数据结构元素长度
+     */
+    size(): number;
+    /**
+     * 重写 toString 方法
+     */
+    toString(): string;
+    /**
+     * 清除数据结构元素
+     */
+    clear(): void;
+  }
+
+  /**
+   * 图类
+   */
+  export class Graph<T> implements IGraph<T> {
+    constructor(isDirected?: boolean);
+    /**
+     * #### 添加顶点的方法
+     * @param v 顶点
+     */
+    addVertex(v: T): void;
+    /**
+     * #### 添加边的方法
+     * @param v 顶点
+     * @param w
+     */
+    addEdge(v: T, w: T): void;
+    /**
+     * #### 获取顶点集合的方法
+     */
+    getVertices(): Array<T>;
+    /**
+     * #### 获取邻接表的方法
+     */
+    getAdjacencyList(): IDictionary<T, Array<T>>;
+  }
+
+  /**
+   * #### 单例模式
+   * @param classCtor 类构造函数
+   */
+  export function singleton<T extends new (...args: any[]) => object>(
+    classCtor: T
+  ): T;
 }

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "jc-structure",
   "private": false,
-  "version": "0.0.6",
+  "version": "0.0.8",
   "type": "module",
   "files": [
     "dist",

package/types/dictionary.d.ts

@@ -0,0 +1,50 @@
+/**
+ * #### 字典接口
+ */
+interface IDictionary<K, V> extends Structure {
+  /**
+   * #### 设置键值对
+   * @param key 键
+   * @param value 值
+   */
+  set(key: K, value: V): void;
+
+  /**
+   * #### 删除键值对
+   * @param key 键
+   */
+  remove(key: K): ValuePair<K, V> | undefined;
+
+  /**
+   * #### 判断键是否存在
+   * @param key 键
+   */
+  has(key: K): boolean;
+
+  /**
+   * #### 获取键值对
+   * @param key 键
+   */
+  get(key: K): ValuePair<K, V> | undefined;
+
+  /**
+   * #### 获取键数组
+   */
+  keys(): Array<K>;
+
+  /**
+   * #### 获取值数组
+   */
+  values(): Array<V>;
+
+  /**
+   * #### 获取键值对数组
+   */
+  keyValues(): Array<[K, V]>;
+
+  /**
+   * 遍历键值对
+   * @param callbackFunc 回调函数
+   */
+  forEach(callbackFunc: (key: K, value: V) => boolean | void): void;
+}

package/types/global.d.ts

@@ -16,3 +16,9 @@ interface Structure {
    */
   toString(): string;
 }
+
+type CompareResult = -1 | 0 | 1;
+
+interface CompareFn<T> {
+  (a: T, b: T): CompareResult;
+}

package/types/graph.d.ts

@@ -0,0 +1,24 @@
+/**
+ * #### 图接口
+ */
+interface IGraph<T> {
+  /**
+   * #### 添加顶点的方法
+   * @param v 顶点
+   */
+  addVertex(v: T): void;
+  /**
+   * #### 添加边的方法
+   * @param v 顶点
+   * @param w
+   */
+  addEdge(v: T, w: T): void;
+  /**
+   * #### 获取顶点集合的方法
+   */
+  getVertices(): Array<T>;
+  /**
+   * #### 获取邻接表的方法
+   */
+  getAdjacencyList(): IDictionary<T, Array<T>>;
+}

package/types/heap.d.ts

@@ -0,0 +1,18 @@
+interface IHeap<T> extends Structure {
+  /**
+   * #### 插入一个值，返回一个布尔值
+   * @param value 要插入的值
+   */
+  insert(value: T): boolean;
+
+  /**
+   * #### 移除最小值或最大值，返回该值
+   */
+  extract(): T | undefined;
+
+  /**
+   * 查找一个值
+   * @param value 要查找的值
+   */
+  find(): T | undefined;
+}

package/types/linkedList.d.ts

@@ -0,0 +1,47 @@
+/**
+ * #### 链表接口
+ */
+interface ILinkedList<T> extends Structure {
+  /**
+   * #### 向链表中添加元素
+   * @param element 要添加的元素
+   */
+  push(element: T): void;
+
+  /**
+   * #### 在指定位置插入元素
+   * @param element 要插入的元素
+   * @param index 插入的位置索引
+   */
+  insert(element: T, index: number): void;
+
+  /**
+   * #### 获取指定位置的节点
+   * @param index 指定位置索引
+   */
+  getElementAt(index: number): Node<T> | undefined;
+
+  /**
+   * #### 获取指定位置的值
+   * @param index 指定位置索引
+   */
+  getValueAt(index: number): T | undefined;
+
+  /**
+   * #### 移除指定位置的元素
+   * @param index 指定位置索引
+   */
+  removeAt(index: number): T | undefined;
+
+  /**
+   * #### 移除指定元素
+   * @param element 指定元素
+   */
+  remove(element: T): T | undefined;
+
+  /**
+   * #### 获取指定元素的索引
+   * @param element 指定元素
+   */
+  indexOf(element: T): number | undefined;
+}