nlptoolkit-datastructure 1.0.5 → 1.0.7

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (5) hide show
  1. package/dist/Queue.d.ts +2 -0
  2. package/dist/Queue.js +8 -0
  3. package/dist/Queue.js.map +1 -1
  4. package/package.json +1 -1
  5. package/source/Queue.ts +10 -0
package/dist/Queue.d.ts CHANGED
@@ -4,7 +4,9 @@ export declare class Queue<T> {
4
4
  private tail;
5
5
  private maxSize;
6
6
  constructor(maxSize: number);
7
+ enqueueAll(items: Array<T>): void;
7
8
  enqueue(item: T): void;
8
9
  dequeue(): T;
10
+ peek(): T;
9
11
  isEmpty(): boolean;
10
12
  }
package/dist/Queue.js CHANGED
@@ -18,6 +18,11 @@
18
18
  this.maxSize = maxSize;
19
19
  this.list = new Array(maxSize);
20
20
  }
21
+ enqueueAll(items) {
22
+ for (let item of items) {
23
+ this.enqueue(item);
24
+ }
25
+ }
21
26
  enqueue(item) {
22
27
  this.list[this.tail] = item;
23
28
  this.tail = (this.tail + 1) % this.maxSize;
@@ -27,6 +32,9 @@
27
32
  this.head = (this.head + 1) % this.maxSize;
28
33
  return item;
29
34
  }
35
+ peek() {
36
+ return this.list[this.head];
37
+ }
30
38
  isEmpty() {
31
39
  return this.head == this.tail;
32
40
  }
package/dist/Queue.js.map CHANGED
@@ -1 +1 @@
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"}
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,UAAU,CAAC,KAAe;YAC7B,KAAK,IAAI,IAAI,IAAI,KAAK,EAAC;gBACnB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;aACrB;QACL,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,IAAI;YACP,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC/B,CAAC;QAEM,OAAO;YACV,OAAO,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAA;QACjC,CAAC;KAEJ;IAvCD,sBAuCC"}
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "nlptoolkit-datastructure",
3
- "version": "1.0.5",
3
+ "version": "1.0.7",
4
4
  "description": "Simple Data Structures Library",
5
5
  "main": "index.js",
6
6
  "types": "index.js",
package/source/Queue.ts CHANGED
@@ -12,6 +12,12 @@ export class Queue<T> {
12
12
  this.list = new Array<T>(maxSize)
13
13
  }
14
14
 
15
+ public enqueueAll(items: Array<T>){
16
+ for (let item of items){
17
+ this.enqueue(item)
18
+ }
19
+ }
20
+
15
21
  public enqueue(item: T){
16
22
  this.list[this.tail] = item
17
23
  this.tail = (this.tail + 1) % this.maxSize
@@ -23,6 +29,10 @@ export class Queue<T> {
23
29
  return item
24
30
  }
25
31
 
32
+ public peek(): T{
33
+ return this.list[this.head]
34
+ }
35
+
26
36
  public isEmpty(): boolean{
27
37
  return this.head == this.tail
28
38
  }