jc-structure 0.0.2 → 0.0.4

package/dist/jc-structure.js

@@ -1,4 +1,36 @@
 class e {
+  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((s) => {
+      this.items[this.count] = s, 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 o {
   items = {};
   count = 0;
   constructor() {
@@ -31,5 +63,6 @@ class e {
   }
 }
 export {
-  e as Stack
+  e as Queue,
+  o as Stack
 };

package/dist/jc-structure.umd.cjs

@@ -1 +1 @@
-(function(t,i){typeof exports=="object"&&typeof module<"u"?i(exports):typeof define=="function"&&define.amd?define(["exports"],i):(t=typeof globalThis<"u"?globalThis:t||self,i(t["jc-structure"]={}))})(this,(function(t){"use strict";class i{items={};count=0;constructor(){}pop(){if(this.isEmpty())return;this.count--;const e=this.items[this.count];return delete this.items[this.count],e}push(...e){e.forEach(s=>{this.items[this.count]=s,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.Stack=i,Object.defineProperty(t,Symbol.toStringTag,{value:"Module"})}));
+(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"})}));

package/index.d.ts

@@ -1,18 +1,6 @@
-interface Structure {
-  /**
-   * 判断数据结构是否为空
-   */
-  isEmpty(): boolean;
-  /**
-   * 数据结构元素长度
-   */
-  size(): number;
-  /**
-   * 清除数据结构元素
-   */
-  clear(): void;
-  /**
-   * 重写 toString 方法
-   */
-  toString(): string;
+declare module "jc-structure" {
+  class Stack<T> implements IStack<T> {}
+
+  class Queue<T> implements IQueue<T> {}
+  export { Stack, Queue };
 }

package/package.json

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

package/types/global.d.ts

@@ -0,0 +1,18 @@
+interface Structure {
+  /**
+   * 判断数据结构是否为空
+   */
+  isEmpty(): boolean;
+  /**
+   * 数据结构元素长度
+   */
+  size(): number;
+  /**
+   * 清除数据结构元素
+   */
+  clear(): void;
+  /**
+   * 重写 toString 方法
+   */
+  toString(): string;
+}