nlptoolkit-datastructure 1.0.4 → 1.0.5

package/README.md

@@ -7,7 +7,7 @@ For Developers
 ============
 
 You can also see [Java](https://github.com/starlangsoftware/DataStructure), [Python](https://github.com/starlangsoftware/DataStructure-Py), 
-[Cython](https://github.com/starlangsoftware/DataStructure-Cy), [Swift](https://github.com/starlangsoftware/DataStructure-Swift), 
+[Cython](https://github.com/starlangsoftware/DataStructure-Cy), [Swift](https://github.com/starlangsoftware/DataStructure-Swift), [C](https://github.com/starlangsoftware/DataStructure-C), 
 [C#](https://github.com/starlangsoftware/DataStructure-CS), or [C++](https://github.com/starlangsoftware/DataStructure-CPP) repository.
 
 ## Requirements

package/dist/Queue.d.ts

@@ -0,0 +1,10 @@
+export declare class Queue<T> {
+    private list;
+    private head;
+    private tail;
+    private maxSize;
+    constructor(maxSize: number);
+    enqueue(item: T): void;
+    dequeue(): T;
+    isEmpty(): boolean;
+}

package/dist/Queue.js

@@ -0,0 +1,36 @@
+(function (factory) {
+    if (typeof module === "object" && typeof module.exports === "object") {
+        var v = factory(require, exports);
+        if (v !== undefined) module.exports = v;
+    }
+    else if (typeof define === "function" && define.amd) {
+        define(["require", "exports"], factory);
+    }
+})(function (require, exports) {
+    "use strict";
+    Object.defineProperty(exports, "__esModule", { value: true });
+    exports.Queue = void 0;
+    class Queue {
+        constructor(maxSize) {
+            this.list = [];
+            this.head = 0;
+            this.tail = 0;
+            this.maxSize = maxSize;
+            this.list = new Array(maxSize);
+        }
+        enqueue(item) {
+            this.list[this.tail] = item;
+            this.tail = (this.tail + 1) % this.maxSize;
+        }
+        dequeue() {
+            let item = this.list[this.head];
+            this.head = (this.head + 1) % this.maxSize;
+            return item;
+        }
+        isEmpty() {
+            return this.head == this.tail;
+        }
+    }
+    exports.Queue = Queue;
+});
+//# sourceMappingURL=Queue.js.map

package/dist/Queue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Queue.js","sourceRoot":"","sources":["../source/Queue.ts"],"names":[],"mappings":";;;;;;;;;;;;IAAA,MAAa,KAAK;QAOd,YAAY,OAAe;YALnB,SAAI,GAAc,EAAE,CAAA;YAMxB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;YACb,IAAI,CAAC,IAAI,GAAG,CAAC,CAAA;YACb,IAAI,CAAC,OAAO,GAAG,OAAO,CAAA;YACtB,IAAI,CAAC,IAAI,GAAG,IAAI,KAAK,CAAI,OAAO,CAAC,CAAA;QACrC,CAAC;QAEM,OAAO,CAAC,IAAO;YAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;YAC3B,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAA;QAC9C,CAAC;QAEM,OAAO;YACV,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC/B,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAA;YAC1C,OAAO,IAAI,CAAA;QACf,CAAC;QAEM,OAAO;YACV,OAAO,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAA;QACjC,CAAC;KAEJ;IA7BD,sBA6BC"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "nlptoolkit-datastructure",
-  "version": "1.0.4",
+  "version": "1.0.5",
   "description": "Simple Data Structures Library",
   "main": "index.js",
   "types": "index.js",

package/source/Queue.ts

@@ -0,0 +1,30 @@
+export class Queue<T> {
+
+    private list : Array<T> = []
+    private head : number
+    private tail : number
+    private maxSize: number
+
+    constructor(maxSize: number) {
+        this.head = 0
+        this.tail = 0
+        this.maxSize = maxSize
+        this.list = new Array<T>(maxSize)
+    }
+
+    public enqueue(item: T){
+        this.list[this.tail] = item
+        this.tail = (this.tail + 1) % this.maxSize
+    }
+
+    public dequeue(): T{
+        let item = this.list[this.head]
+        this.head = (this.head + 1) % this.maxSize
+        return item
+    }
+
+    public isEmpty(): boolean{
+        return this.head == this.tail
+    }
+
+}