jc-structure 0.0.1

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 hzqhxy
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/dist/jc-structure.js

@@ -0,0 +1,35 @@
+class e {
+  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((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]`;
+  }
+}
+export {
+  e as Stack
+};

package/dist/jc-structure.umd.cjs

@@ -0,0 +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"})}));

package/index.d.ts

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

package/package.json

@@ -0,0 +1,39 @@
+{
+  "name": "jc-structure",
+  "private": false,
+  "version": "0.0.1",
+  "type": "module",
+  "files": [
+    "dist",
+    "index.d.ts",
+    "types",
+    "README.md",
+    "LICENSE"
+  ],
+  "description": "create data structure set using ts.",
+  "keywords": [
+    "data",
+    "structure",
+    "set",
+    "typescript"
+  ],
+  "author": "chuz1 <jckjsjz@163.com>",
+  "license": "MIT",
+  "repository": {
+    "type": "git",
+    "url": "https://gitee.com/hzqhxy/jc-structure"
+  },
+  "exports": {
+    "types": "./index.d.ts",
+    "import": "./dist/jc-structure.js",
+    "require": "./dist/jc-structure.cjs"
+  },
+  "scripts": {
+    "dev": "vite",
+    "build": "tsc && vite build"
+  },
+  "devDependencies": {
+    "typescript": "~5.9.2",
+    "vite": "^7.1.5"
+  }
+}

package/types/stack.d.ts

@@ -0,0 +1,21 @@
+interface StackObj<T> {
+  [key: number]: T;
+}
+
+interface IStack<T> extends Structure {
+  /**
+   * 移除栈顶元素并返回该元素
+   */
+  pop(): T | undefined;
+
+  /**
+   * #### 向栈顶添加元素
+   * @param item 要添加的元素
+   */
+  push(...args: Array<T>): void;
+
+  /**
+   * #### 返回栈顶元素，但不移除
+   */
+  peek(): T | undefined;
+}