jc-structure 0.0.5 → 0.0.7

package/dist/jc-structure.js

@@ -1,4 +1,4 @@
-class e {
+class p {
   items = {};
   count = 0;
   lowestCount = 0;
@@ -30,7 +30,7 @@ class e {
     return this.isEmpty() ? "" : `Queue(size: ${this.size()}):[${this.items[this.lowestCount]},...rest]`;
   }
 }
-class o {
+class a {
   items = {};
   count = 0;
   constructor() {
@@ -62,7 +62,71 @@ class o {
     return this.isEmpty() ? "" : `Stack(count: ${this.count}):[${this.items[this.count - 1]},...rest]`;
   }
 }
+function o(i, t) {
+  return i === t ? 0 : i < t ? -1 : 1;
+}
+class h {
+  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, s, e) {
+    [t[s], t[e]] = [t[e], t[s]];
+  }
+  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 u extends h {
+  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 s = t, e = h.getLeftIndex(s), r = h.getRightIndex(s), n = this.size();
+    e < n && this.compareFn(this.heap[s], this.heap[e]) === -1 && (s = e), r < n && this.compareFn(this.heap[s], this.heap[r]) === 1 && (s = r), s !== t && (h.swap(this.heap, t, s), this.siftUp(s));
+  }
+  siftDown(t) {
+    let s = h.getParentIndex(t);
+    for (; t > 0 && s && this.compareFn(this.heap[s], this.heap[t]) === 1; )
+      h.swap(this.heap, s, t), t = s, s = h.getParentIndex(t);
+  }
+}
+class c extends u {
+  constructor(t = (s, e) => o(e, s)) {
+    super(t);
+  }
+}
 export {
-  e as Queue,
-  o as Stack
+  c as MaxHeap,
+  u as MinHeap,
+  p as Queue,
+  a as Stack
 };

package/dist/jc-structure.umd.cjs

@@ -1 +1 @@
-(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(s,r){typeof exports=="object"&&typeof module<"u"?r(exports):typeof define=="function"&&define.amd?define(["exports"],r):(s=typeof globalThis<"u"?globalThis:s||self,r(s["jc-structure"]={}))})(this,(function(s){"use strict";class r{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 a{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(n,t){return n===t?0:n<t?-1:1}class h{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 p extends h{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=h.getLeftIndex(e),u=h.getRightIndex(e),c=this.size();i<c&&this.compareFn(this.heap[e],this.heap[i])===-1&&(e=i),u<c&&this.compareFn(this.heap[e],this.heap[u])===1&&(e=u),e!==t&&(h.swap(this.heap,t,e),this.siftUp(e))}siftDown(t){let e=h.getParentIndex(t);for(;t>0&&e&&this.compareFn(this.heap[e],this.heap[t])===1;)h.swap(this.heap,e,t),t=e,e=h.getParentIndex(t)}}class f extends p{constructor(t=(e,i)=>o(i,e)){super(t)}}s.MaxHeap=f,s.MinHeap=p,s.Queue=r,s.Stack=a,Object.defineProperty(s,Symbol.toStringTag,{value:"Module"})}));

package/index.d.ts

@@ -1,23 +1,115 @@
 declare module "jc-structure" {
+  /**
+   * 栈类，采用object实现
+   */
   export class Stack<T> implements IStack<T> {
     constructor();
-    push(item: T): void;
+    /**
+     * #### 向栈顶添加元素
+     * @param args 要添加的元素,可以是多个或一个元素。
+     */
+    push(...args: Array<T>): void;
+    /**
+     * #### 移除栈顶元素并返回该元素
+     */
     pop(): T | undefined;
+    /**
+     * #### 返回栈顶元素，但不移除
+     */
     peek(): T | undefined;
+    /**
+     * 判断数据结构是否为空
+     */
     isEmpty(): boolean;
+    /**
+     * 数据结构元素长度
+     */
     size(): number;
+    /**
+     * 重写 toString 方法
+     */
     toString(): string;
+    /**
+     * 清除数据结构元素
+     */
     clear(): void;
   }
 
+  /**
+   * 队列类，采用object实现
+   */
   export class Queue<T> implements IQueue<T> {
     constructor();
-    enqueue(item: T): void;
+    /**
+     * #### 向队列末尾添加元素
+     * @param args 要添加的元素，可以是多个或一个元素。
+     */
+    enqueue(...args: Array<T>): void;
+    /**
+     * #### 移除队列头部元素并返回该元素
+     */
     dequeue(): T | undefined;
+    /**
+     * #### 返回队列头部元素，但不移除
+     */
     front(): T | undefined;
+    /**
+     * 判断数据结构是否为空
+     */
     isEmpty(): boolean;
+    /**
+     * 数据结构元素长度
+     */
     size(): number;
+    /**
+     * 重写 toString 方法
+     */
     toString(): string;
+    /**
+     * 清除数据结构元素
+     */
     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);
+  }
 }

package/package.json

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

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/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/stack.d.ts

@@ -10,7 +10,7 @@ interface IStack<T> extends Structure {
 
   /**
    * #### 向栈顶添加元素
-   * @param item 要添加的元素
+   * @param args 要添加的元素,key可以是多个或一个元素。
    */
   push(...args: Array<T>): void;