stack-base-iterator - npm Package Compare versions

Comparing version 1.2.24 to 1.2.25

dist/cjs/drainStack.js

@@ -21,3 +21,3 @@ "use strict";
     if (iterator.processors.length <= 0) return false;
-    iterator.processors.first()(false);
+    iterator.processors.last()(false);
     if (iterator.done) return false;
@@ -24,0 +24,0 @@ return iterator.queued.length > 0;

dist/cjs/drainStack.js.map

@@ -1,1 +0,1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/drainStack.ts"],"sourcesContent":["import processOrQueue from './processOrQueue.js';\n\nimport type { AbstractIterator } from './types.js';\n\nfunction canProcess<T>(iterator: AbstractIterator<T>): boolean {\n  if (iterator.done || !iterator.stack.length) return false;\n  if (iterator.queued.length) return true;\n  if (iterator.processors.length <= 0) return false;\n  iterator.processors.first()(false);\n  if (iterator.done) return false;\n  return iterator.queued.length > 0;\n}\n\nexport default function drainStack<T>(iterator: AbstractIterator<T>): undefined {\n  while (canProcess<T>(iterator)) {\n    processOrQueue(iterator, iterator.queued.pop());\n  }\n}\n"],"names":["drainStack","canProcess","iterator","done","stack","length","queued","processors","first","processOrQueue","pop"],"mappings":";;;;+BAaA;;;eAAwBA;;;qEAbG;;;;;;AAI3B,SAASC,WAAcC,QAA6B;IAClD,IAAIA,SAASC,IAAI,IAAI,CAACD,SAASE,KAAK,CAACC,MAAM,EAAE,OAAO;IACpD,IAAIH,SAASI,MAAM,CAACD,MAAM,EAAE,OAAO;IACnC,IAAIH,SAASK,UAAU,CAACF,MAAM,IAAI,GAAG,OAAO;IAC5CH,SAASK,UAAU,CAACC,KAAK,GAAG;IAC5B,IAAIN,SAASC,IAAI,EAAE,OAAO;IAC1B,OAAOD,SAASI,MAAM,CAACD,MAAM,GAAG;AAClC;AAEe,SAASL,WAAcE,QAA6B;IACjE,MAAOD,WAAcC,UAAW;QAC9BO,IAAAA,uBAAc,EAACP,UAAUA,SAASI,MAAM,CAACI,GAAG;IAC9C;AACF"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/drainStack.ts"],"sourcesContent":["import processOrQueue from './processOrQueue.js';\n\nimport type { AbstractIterator } from './types.js';\n\nfunction canProcess<T>(iterator: AbstractIterator<T>): boolean {\n  if (iterator.done || !iterator.stack.length) return false;\n  if (iterator.queued.length) return true;\n  if (iterator.processors.length <= 0) return false;\n  iterator.processors.last()(false);\n  if (iterator.done) return false;\n  return iterator.queued.length > 0;\n}\n\nexport default function drainStack<T>(iterator: AbstractIterator<T>): undefined {\n  while (canProcess<T>(iterator)) {\n    processOrQueue(iterator, iterator.queued.pop());\n  }\n}\n"],"names":["drainStack","canProcess","iterator","done","stack","length","queued","processors","last","processOrQueue","pop"],"mappings":";;;;+BAaA;;;eAAwBA;;;qEAbG;;;;;;AAI3B,SAASC,WAAcC,QAA6B;IAClD,IAAIA,SAASC,IAAI,IAAI,CAACD,SAASE,KAAK,CAACC,MAAM,EAAE,OAAO;IACpD,IAAIH,SAASI,MAAM,CAACD,MAAM,EAAE,OAAO;IACnC,IAAIH,SAASK,UAAU,CAACF,MAAM,IAAI,GAAG,OAAO;IAC5CH,SAASK,UAAU,CAACC,IAAI,GAAG;IAC3B,IAAIN,SAASC,IAAI,EAAE,OAAO;IAC1B,OAAOD,SAASI,MAAM,CAACD,MAAM,GAAG;AAClC;AAEe,SAASL,WAAcE,QAA6B;IACjE,MAAOD,WAAcC,UAAW;QAC9BO,IAAAA,uBAAc,EAACP,UAAUA,SAASI,MAAM,CAACI,GAAG;IAC9C;AACF"}

dist/cjs/index.d.cts

@@ -7,5 +7,5 @@ import LinkedList from './LinkedList.js';
     protected done: boolean;
-    protected stack: LinkedList<StackFunction<T>>;
+    protected stack: StackFunction<T>[];
+    protected queued: ProcessCallback<T>[];
     protected processors: LinkedList<Processor>;
-    protected queued: LinkedList<ProcessCallback<T>>;
     protected processing: LinkedList<ProcessCallback<T>>;
@@ -12,0 +12,0 @@ protected options: StackOptions;

dist/cjs/index.d.ts

@@ -7,5 +7,5 @@ import LinkedList from './LinkedList.js';
     protected done: boolean;
-    protected stack: LinkedList<StackFunction<T>>;
+    protected stack: StackFunction<T>[];
+    protected queued: ProcessCallback<T>[];
     protected processors: LinkedList<Processor>;
-    protected queued: LinkedList<ProcessCallback<T>>;
     protected processing: LinkedList<ProcessCallback<T>>;
@@ -12,0 +12,0 @@ protected options: StackOptions;

dist/cjs/index.js

@@ -118,5 +118,5 @@ "use strict";
         this.done = false;
-        this.stack = new _LinkedList.default();
+        this.stack = new Array();
+        this.queued = new Array();
         this.processors = new _LinkedList.default();
-        this.queued = new _LinkedList.default();
         this.processing = new _LinkedList.default();
@@ -191,3 +191,3 @@ this.entries = new _LinkedList.default();
             var processor = (0, _createProcessor.default)(this.next.bind(this), processorOptions, function(err) {
-                if (!_this.destroyed) _this.processors.removeValue(processor);
+                if (!_this.destroyed) _this.processors.remove(processor);
                 processor = null;
@@ -194,0 +194,0 @@ options = null;

dist/cjs/index.js.map

@@ -1,1 +0,1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/index.ts"],"sourcesContent":["import once from 'call-once-fn';\nimport LinkedList from './LinkedList.js';\n\nimport createProcesor from './createProcessor.js';\nimport drainStack from './drainStack.js';\nimport processOrQueue from './processOrQueue.js';\n\nimport type { AbstractIterator, EachDoneCallback, EachFunction, ForEachOptions, NextCallback, ProcessCallback, Processor, ProcessorOptions, StackFunction, StackOptions } from './types.js';\n\nexport type * from './types.js';\nexport { default as LinkedList } from './LinkedList.js';\nexport default class StackBaseIterator<T, TReturn = unknown, TNext = unknown> implements AsyncIterator<T, TReturn, TNext> {\n  protected done: boolean;\n  protected stack: LinkedList<StackFunction<T>>;\n  protected processors: LinkedList<Processor>;\n  protected queued: LinkedList<ProcessCallback<T>>;\n  protected processing: LinkedList<ProcessCallback<T>>;\n\n  protected options: StackOptions;\n  protected entries: LinkedList<T>;\n  protected destroyed: boolean;\n\n  constructor(options: StackOptions = {}) {\n    this.options = { ...options };\n    this.options.error =\n      options.error ||\n      function defaultError(err) {\n        return !!err; // fail on errors\n      };\n\n    this.done = false;\n    this.stack = new LinkedList<StackFunction<T>>();\n    this.processors = new LinkedList<Processor>();\n    this.queued = new LinkedList<ProcessCallback<T>>();\n    this.processing = new LinkedList<ProcessCallback<T>>();\n    this.entries = new LinkedList<T>();\n  }\n\n  isDone() {\n    return this.done;\n  }\n\n  push(fn: StackFunction<T>, ...rest: StackFunction<T>[]) {\n    if (this.done) return console.log('Attempting to push on a done iterator');\n    this.stack.push(fn);\n    !rest.length || rest.forEach((x) => this.stack.push(x));\n    drainStack<T>(this as unknown as AbstractIterator<T>);\n  }\n\n  next(...[value]: [] | [TNext]): Promise<IteratorResult<T, TReturn>> {\n    const callback = value as NextCallback<T>;\n    if (typeof callback === 'function') {\n      processOrQueue(\n        this as unknown as AbstractIterator<T>,\n        once((err?: Error, value?: T | null) => {\n          err ? callback(err) : callback(null, value);\n        }) as ProcessCallback<T>\n      );\n      return;\n    }\n\n    return new Promise((resolve, reject) => {\n      processOrQueue(\n        this as unknown as AbstractIterator<T>,\n        once((err, value: T) => {\n          err ? reject(err) : resolve({ value, done: value === null } as IteratorResult<T, TReturn>);\n        }) as ProcessCallback<T>\n      );\n    });\n  }\n\n  forEach(fn: EachFunction<T>, options?: ForEachOptions | ProcessCallback<T>, callback?: EachDoneCallback): undefined | Promise<boolean> {\n    if (typeof fn !== 'function') throw new Error('Missing each function');\n    if (typeof options === 'function') {\n      callback = options as EachDoneCallback;\n      options = {};\n    }\n\n    if (typeof callback === 'function') {\n      if (this.done) {\n        callback(null, true);\n        return;\n      }\n      options = options || {};\n      const processorOptions: ProcessorOptions<T> = {\n        each: fn,\n        callbacks: options.callbacks || false,\n        concurrency: options.concurrency || 1,\n        limit: options.limit || Infinity,\n        error:\n          options.error ||\n          function defaultError() {\n            return true; // default is exit on error\n          },\n        total: 0,\n        counter: 0,\n        stop: () => {\n          return this.done || this.queued.length >= this.stack.length;\n        },\n      };\n\n      let processor = createProcesor<T>(this.next.bind(this), processorOptions, (err) => {\n        if (!this.destroyed) this.processors.removeValue(processor);\n        processor = null;\n        options = null;\n        const done = !this.stack.length;\n        if ((err || done) && !this.done) this.end(err);\n        return callback(err, this.done || done);\n      });\n      this.processors.push(processor);\n      processor();\n      return;\n    }\n\n    return new Promise((resolve, reject) =>\n      this.forEach(fn, options, (err?: Error, done?: boolean) => {\n        err ? reject(err) : resolve(done);\n      })\n    );\n  }\n\n  end(err?: Error) {\n    if (this.done) return;\n    this.done = true;\n    while (this.processors.length > 0) this.processors.pop()(err || true);\n    while (this.processing.length > 0) err ? this.processing.pop()(err) : this.processing.pop()(null, null);\n    while (this.queued.length > 0) err ? this.queued.pop()(err) : this.queued.pop()(null, null);\n    while (this.stack.length > 0) this.stack.pop();\n  }\n\n  destroy(err?: Error) {\n    if (this.destroyed) throw new Error('Already destroyed');\n    this.destroyed = true;\n    this.end(err);\n  }\n}\n\nif (typeof Symbol !== 'undefined' && Symbol.asyncIterator) {\n  StackBaseIterator.prototype[Symbol.asyncIterator] = function asyncIterator() {\n    const self = this;\n    return {\n      next() {\n        return self.next().then((value) => {\n          return Promise.resolve(value);\n        });\n      },\n      destroy() {\n        self.destroy();\n        return Promise.resolve();\n      },\n    };\n  };\n}\n"],"names":["LinkedList","StackBaseIterator","options","error","defaultError","err","done","stack","processors","queued","processing","entries","isDone","push","fn","rest","console","log","length","forEach","x","drainStack","next","value","callback","processOrQueue","once","Promise","resolve","reject","Error","processorOptions","each","callbacks","concurrency","limit","Infinity","total","counter","stop","processor","createProcesor","bind","destroyed","removeValue","end","pop","destroy","Symbol","asyncIterator","prototype","self","then"],"mappings":";;;;;;;;;;;QAUoBA;eAAAA,mBAAU;;;eACTC;;;iEAXJ;iEACM;sEAEI;iEACJ;qEACI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAMZ,IAAA,AAAMA,kCAAN;;aAAMA;YAWPC,UAAAA,iEAAwB,CAAC;gCAXlBD;QAYjB,IAAI,CAACC,OAAO,GAAG,mBAAKA;QACpB,IAAI,CAACA,OAAO,CAACC,KAAK,GAChBD,QAAQC,KAAK,IACb,SAASC,aAAaC,GAAG;YACvB,OAAO,CAAC,CAACA,KAAK,iBAAiB;QACjC;QAEF,IAAI,CAACC,IAAI,GAAG;QACZ,IAAI,CAACC,KAAK,GAAG,IAAIP,mBAAU;QAC3B,IAAI,CAACQ,UAAU,GAAG,IAAIR,mBAAU;QAChC,IAAI,CAACS,MAAM,GAAG,IAAIT,mBAAU;QAC5B,IAAI,CAACU,UAAU,GAAG,IAAIV,mBAAU;QAChC,IAAI,CAACW,OAAO,GAAG,IAAIX,mBAAU;;iBAxBZC;IA2BnBW,OAAAA,MAEC,GAFDA,SAAAA;QACE,OAAO,IAAI,CAACN,IAAI;IAClB;IAEAO,OAAAA,IAKC,GALDA,SAAAA,KAAKC,EAAoB;;QAAE,IAAA,IAAA,OAAA,UAAA,QAAA,AAAGC,OAAH,UAAA,OAAA,IAAA,OAAA,QAAA,OAAA,GAAA,OAAA,MAAA;YAAGA,KAAH,OAAA,KAAA,SAAA,CAAA,KAA2B;;QACpD,IAAI,IAAI,CAACT,IAAI,EAAE,OAAOU,QAAQC,GAAG,CAAC;QAClC,IAAI,CAACV,KAAK,CAACM,IAAI,CAACC;QAChB,CAACC,KAAKG,MAAM,IAAIH,KAAKI,OAAO,CAAC,SAACC;mBAAM,MAAKb,KAAK,CAACM,IAAI,CAACO;;QACpDC,IAAAA,mBAAU,EAAI,IAAI;IACpB;IAEAC,OAAAA,IAoBC,GApBDA,SAAAA;;QAAK,IAAA,IAAA,OAAA,UAAA,QAAA,OAAA,UAAA,OAAA,OAAA,GAAA,OAAA,MAAA;YAAA,KAAA,QAAA,SAAA,CAAA,KAAwB;;YAAxB,yBAAA,UAAIC,QAAJ;QACH,IAAMC,WAAWD;QACjB,IAAI,OAAOC,aAAa,YAAY;YAClCC,IAAAA,uBAAc,EACZ,IAAI,EACJC,IAAAA,mBAAI,EAAC,SAACrB,KAAakB;gBACjBlB,MAAMmB,SAASnB,OAAOmB,SAAS,MAAMD;YACvC;YAEF;QACF;QAEA,OAAO,IAAII,QAAQ,SAACC,SAASC;YAC3BJ,IAAAA,uBAAc,SAEZC,IAAAA,mBAAI,EAAC,SAACrB,KAAKkB;gBACTlB,MAAMwB,OAAOxB,OAAOuB,QAAQ;oBAAEL,OAAAA;oBAAOjB,MAAMiB,UAAU;gBAAK;YAC5D;QAEJ;IACF;IAEAJ,OAAAA,OAgDC,GAhDDA,SAAAA,QAAQL,EAAmB,EAAEZ,OAA6C,EAAEsB,QAA2B;;QACrG,IAAI,OAAOV,OAAO,YAAY,MAAM,IAAIgB,MAAM;QAC9C,IAAI,OAAO5B,YAAY,YAAY;YACjCsB,WAAWtB;YACXA,UAAU,CAAC;QACb;QAEA,IAAI,OAAOsB,aAAa,YAAY;YAClC,IAAI,IAAI,CAAClB,IAAI,EAAE;gBACbkB,SAAS,MAAM;gBACf;YACF;YACAtB,UAAUA,WAAW,CAAC;YACtB,IAAM6B,mBAAwC;gBAC5CC,MAAMlB;gBACNmB,WAAW/B,QAAQ+B,SAAS,IAAI;gBAChCC,aAAahC,QAAQgC,WAAW,IAAI;gBACpCC,OAAOjC,QAAQiC,KAAK,IAAIC;gBACxBjC,OACED,QAAQC,KAAK,IACb,SAASC;oBACP,OAAO,MAAM,2BAA2B;gBAC1C;gBACFiC,OAAO;gBACPC,SAAS;gBACTC,MAAM;oBACJ,OAAO,MAAKjC,IAAI,IAAI,MAAKG,MAAM,CAACS,MAAM,IAAI,MAAKX,KAAK,CAACW,MAAM;gBAC7D;YACF;YAEA,IAAIsB,YAAYC,IAAAA,wBAAc,EAAI,IAAI,CAACnB,IAAI,CAACoB,IAAI,CAAC,IAAI,GAAGX,kBAAkB,SAAC1B;gBACzE,IAAI,CAAC,MAAKsC,SAAS,EAAE,MAAKnC,UAAU,CAACoC,WAAW,CAACJ;gBACjDA,YAAY;gBACZtC,UAAU;gBACV,IAAMI,OAAO,CAAC,MAAKC,KAAK,CAACW,MAAM;gBAC/B,IAAI,AAACb,CAAAA,OAAOC,IAAG,KAAM,CAAC,MAAKA,IAAI,EAAE,MAAKuC,GAAG,CAACxC;gBAC1C,OAAOmB,SAASnB,KAAK,MAAKC,IAAI,IAAIA;YACpC;YACA,IAAI,CAACE,UAAU,CAACK,IAAI,CAAC2B;YACrBA;YACA;QACF;QAEA,OAAO,IAAIb,QAAQ,SAACC,SAASC;mBAC3B,MAAKV,OAAO,CAACL,IAAIZ,SAAS,SAACG,KAAaC;gBACtCD,MAAMwB,OAAOxB,OAAOuB,QAAQtB;YAC9B;;IAEJ;IAEAuC,OAAAA,GAOC,GAPDA,SAAAA,IAAIxC,GAAW;QACb,IAAI,IAAI,CAACC,IAAI,EAAE;QACf,IAAI,CAACA,IAAI,GAAG;QACZ,MAAO,IAAI,CAACE,UAAU,CAACU,MAAM,GAAG,EAAG,IAAI,CAACV,UAAU,CAACsC,GAAG,GAAGzC,OAAO;QAChE,MAAO,IAAI,CAACK,UAAU,CAACQ,MAAM,GAAG,EAAGb,MAAM,IAAI,CAACK,UAAU,CAACoC,GAAG,GAAGzC,OAAO,IAAI,CAACK,UAAU,CAACoC,GAAG,GAAG,MAAM;QAClG,MAAO,IAAI,CAACrC,MAAM,CAACS,MAAM,GAAG,EAAGb,MAAM,IAAI,CAACI,MAAM,CAACqC,GAAG,GAAGzC,OAAO,IAAI,CAACI,MAAM,CAACqC,GAAG,GAAG,MAAM;QACtF,MAAO,IAAI,CAACvC,KAAK,CAACW,MAAM,GAAG,EAAG,IAAI,CAACX,KAAK,CAACuC,GAAG;IAC9C;IAEAC,OAAAA,OAIC,GAJDA,SAAAA,QAAQ1C,GAAW;QACjB,IAAI,IAAI,CAACsC,SAAS,EAAE,MAAM,IAAIb,MAAM;QACpC,IAAI,CAACa,SAAS,GAAG;QACjB,IAAI,CAACE,GAAG,CAACxC;IACX;WA3HmBJ;;AA8HrB,IAAI,OAAO+C,WAAW,eAAeA,OAAOC,aAAa,EAAE;IACzDhD,kBAAkBiD,SAAS,CAACF,OAAOC,aAAa,CAAC,GAAG,SAASA;QAC3D,IAAME,OAAO,IAAI;QACjB,OAAO;YACL7B,MAAAA,SAAAA;gBACE,OAAO6B,KAAK7B,IAAI,GAAG8B,IAAI,CAAC,SAAC7B;oBACvB,OAAOI,QAAQC,OAAO,CAACL;gBACzB;YACF;YACAwB,SAAAA,SAAAA;gBACEI,KAAKJ,OAAO;gBACZ,OAAOpB,QAAQC,OAAO;YACxB;QACF;IACF;AACF"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/index.ts"],"sourcesContent":["import once from 'call-once-fn';\nimport LinkedList from './LinkedList.js';\n\nimport createProcesor from './createProcessor.js';\nimport drainStack from './drainStack.js';\nimport processOrQueue from './processOrQueue.js';\n\nimport type { AbstractIterator, EachDoneCallback, EachFunction, ForEachOptions, NextCallback, ProcessCallback, Processor, ProcessorOptions, StackFunction, StackOptions } from './types.js';\n\nexport type * from './types.js';\nexport { default as LinkedList } from './LinkedList.js';\nexport default class StackBaseIterator<T, TReturn = unknown, TNext = unknown> implements AsyncIterator<T, TReturn, TNext> {\n  protected done: boolean;\n  protected stack: StackFunction<T>[];\n  protected queued: ProcessCallback<T>[];\n  protected processors: LinkedList<Processor>;\n  protected processing: LinkedList<ProcessCallback<T>>;\n\n  protected options: StackOptions;\n  protected entries: LinkedList<T>;\n  protected destroyed: boolean;\n\n  constructor(options: StackOptions = {}) {\n    this.options = { ...options };\n    this.options.error =\n      options.error ||\n      function defaultError(err) {\n        return !!err; // fail on errors\n      };\n\n    this.done = false;\n    this.stack = new Array<StackFunction<T>>();\n    this.queued = new Array<ProcessCallback<T>>();\n    this.processors = new LinkedList<Processor>();\n    this.processing = new LinkedList<ProcessCallback<T>>();\n    this.entries = new LinkedList<T>();\n  }\n\n  isDone() {\n    return this.done;\n  }\n\n  push(fn: StackFunction<T>, ...rest: StackFunction<T>[]) {\n    if (this.done) return console.log('Attempting to push on a done iterator');\n    this.stack.push(fn);\n    !rest.length || rest.forEach((x) => this.stack.push(x));\n    drainStack<T>(this as unknown as AbstractIterator<T>);\n  }\n\n  next(...[value]: [] | [TNext]): Promise<IteratorResult<T, TReturn>> {\n    const callback = value as NextCallback<T>;\n    if (typeof callback === 'function') {\n      processOrQueue(\n        this as unknown as AbstractIterator<T>,\n        once((err?: Error, value?: T | null) => {\n          err ? callback(err) : callback(null, value);\n        }) as ProcessCallback<T>\n      );\n      return;\n    }\n\n    return new Promise((resolve, reject) => {\n      processOrQueue(\n        this as unknown as AbstractIterator<T>,\n        once((err, value: T) => {\n          err ? reject(err) : resolve({ value, done: value === null } as IteratorResult<T, TReturn>);\n        }) as ProcessCallback<T>\n      );\n    });\n  }\n\n  forEach(fn: EachFunction<T>, options?: ForEachOptions | ProcessCallback<T>, callback?: EachDoneCallback): undefined | Promise<boolean> {\n    if (typeof fn !== 'function') throw new Error('Missing each function');\n    if (typeof options === 'function') {\n      callback = options as EachDoneCallback;\n      options = {};\n    }\n\n    if (typeof callback === 'function') {\n      if (this.done) {\n        callback(null, true);\n        return;\n      }\n      options = options || {};\n      const processorOptions: ProcessorOptions<T> = {\n        each: fn,\n        callbacks: options.callbacks || false,\n        concurrency: options.concurrency || 1,\n        limit: options.limit || Infinity,\n        error:\n          options.error ||\n          function defaultError() {\n            return true; // default is exit on error\n          },\n        total: 0,\n        counter: 0,\n        stop: () => {\n          return this.done || this.queued.length >= this.stack.length;\n        },\n      };\n\n      let processor = createProcesor<T>(this.next.bind(this), processorOptions, (err) => {\n        if (!this.destroyed) this.processors.remove(processor);\n        processor = null;\n        options = null;\n        const done = !this.stack.length;\n        if ((err || done) && !this.done) this.end(err);\n        return callback(err, this.done || done);\n      });\n      this.processors.push(processor);\n      processor();\n      return;\n    }\n\n    return new Promise((resolve, reject) =>\n      this.forEach(fn, options, (err?: Error, done?: boolean) => {\n        err ? reject(err) : resolve(done);\n      })\n    );\n  }\n\n  end(err?: Error) {\n    if (this.done) return;\n    this.done = true;\n    while (this.processors.length > 0) this.processors.pop()(err || true);\n    while (this.processing.length > 0) err ? this.processing.pop()(err) : this.processing.pop()(null, null);\n    while (this.queued.length > 0) err ? this.queued.pop()(err) : this.queued.pop()(null, null);\n    while (this.stack.length > 0) this.stack.pop();\n  }\n\n  destroy(err?: Error) {\n    if (this.destroyed) throw new Error('Already destroyed');\n    this.destroyed = true;\n    this.end(err);\n  }\n}\n\nif (typeof Symbol !== 'undefined' && Symbol.asyncIterator) {\n  StackBaseIterator.prototype[Symbol.asyncIterator] = function asyncIterator() {\n    const self = this;\n    return {\n      next() {\n        return self.next().then((value) => {\n          return Promise.resolve(value);\n        });\n      },\n      destroy() {\n        self.destroy();\n        return Promise.resolve();\n      },\n    };\n  };\n}\n"],"names":["LinkedList","StackBaseIterator","options","error","defaultError","err","done","stack","Array","queued","processors","processing","entries","isDone","push","fn","rest","console","log","length","forEach","x","drainStack","next","value","callback","processOrQueue","once","Promise","resolve","reject","Error","processorOptions","each","callbacks","concurrency","limit","Infinity","total","counter","stop","processor","createProcesor","bind","destroyed","remove","end","pop","destroy","Symbol","asyncIterator","prototype","self","then"],"mappings":";;;;;;;;;;;QAUoBA;eAAAA,mBAAU;;;eACTC;;;iEAXJ;iEACM;sEAEI;iEACJ;qEACI;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAMZ,IAAA,AAAMA,kCAAN;;aAAMA;YAWPC,UAAAA,iEAAwB,CAAC;gCAXlBD;QAYjB,IAAI,CAACC,OAAO,GAAG,mBAAKA;QACpB,IAAI,CAACA,OAAO,CAACC,KAAK,GAChBD,QAAQC,KAAK,IACb,SAASC,aAAaC,GAAG;YACvB,OAAO,CAAC,CAACA,KAAK,iBAAiB;QACjC;QAEF,IAAI,CAACC,IAAI,GAAG;QACZ,IAAI,CAACC,KAAK,GAAG,IAAIC;QACjB,IAAI,CAACC,MAAM,GAAG,IAAID;QAClB,IAAI,CAACE,UAAU,GAAG,IAAIV,mBAAU;QAChC,IAAI,CAACW,UAAU,GAAG,IAAIX,mBAAU;QAChC,IAAI,CAACY,OAAO,GAAG,IAAIZ,mBAAU;;iBAxBZC;IA2BnBY,OAAAA,MAEC,GAFDA,SAAAA;QACE,OAAO,IAAI,CAACP,IAAI;IAClB;IAEAQ,OAAAA,IAKC,GALDA,SAAAA,KAAKC,EAAoB;;QAAE,IAAA,IAAA,OAAA,UAAA,QAAA,AAAGC,OAAH,UAAA,OAAA,IAAA,OAAA,QAAA,OAAA,GAAA,OAAA,MAAA;YAAGA,KAAH,OAAA,KAAA,SAAA,CAAA,KAA2B;;QACpD,IAAI,IAAI,CAACV,IAAI,EAAE,OAAOW,QAAQC,GAAG,CAAC;QAClC,IAAI,CAACX,KAAK,CAACO,IAAI,CAACC;QAChB,CAACC,KAAKG,MAAM,IAAIH,KAAKI,OAAO,CAAC,SAACC;mBAAM,MAAKd,KAAK,CAACO,IAAI,CAACO;;QACpDC,IAAAA,mBAAU,EAAI,IAAI;IACpB;IAEAC,OAAAA,IAoBC,GApBDA,SAAAA;;QAAK,IAAA,IAAA,OAAA,UAAA,QAAA,OAAA,UAAA,OAAA,OAAA,GAAA,OAAA,MAAA;YAAA,KAAA,QAAA,SAAA,CAAA,KAAwB;;YAAxB,yBAAA,UAAIC,QAAJ;QACH,IAAMC,WAAWD;QACjB,IAAI,OAAOC,aAAa,YAAY;YAClCC,IAAAA,uBAAc,EACZ,IAAI,EACJC,IAAAA,mBAAI,EAAC,SAACtB,KAAamB;gBACjBnB,MAAMoB,SAASpB,OAAOoB,SAAS,MAAMD;YACvC;YAEF;QACF;QAEA,OAAO,IAAII,QAAQ,SAACC,SAASC;YAC3BJ,IAAAA,uBAAc,SAEZC,IAAAA,mBAAI,EAAC,SAACtB,KAAKmB;gBACTnB,MAAMyB,OAAOzB,OAAOwB,QAAQ;oBAAEL,OAAAA;oBAAOlB,MAAMkB,UAAU;gBAAK;YAC5D;QAEJ;IACF;IAEAJ,OAAAA,OAgDC,GAhDDA,SAAAA,QAAQL,EAAmB,EAAEb,OAA6C,EAAEuB,QAA2B;;QACrG,IAAI,OAAOV,OAAO,YAAY,MAAM,IAAIgB,MAAM;QAC9C,IAAI,OAAO7B,YAAY,YAAY;YACjCuB,WAAWvB;YACXA,UAAU,CAAC;QACb;QAEA,IAAI,OAAOuB,aAAa,YAAY;YAClC,IAAI,IAAI,CAACnB,IAAI,EAAE;gBACbmB,SAAS,MAAM;gBACf;YACF;YACAvB,UAAUA,WAAW,CAAC;YACtB,IAAM8B,mBAAwC;gBAC5CC,MAAMlB;gBACNmB,WAAWhC,QAAQgC,SAAS,IAAI;gBAChCC,aAAajC,QAAQiC,WAAW,IAAI;gBACpCC,OAAOlC,QAAQkC,KAAK,IAAIC;gBACxBlC,OACED,QAAQC,KAAK,IACb,SAASC;oBACP,OAAO,MAAM,2BAA2B;gBAC1C;gBACFkC,OAAO;gBACPC,SAAS;gBACTC,MAAM;oBACJ,OAAO,MAAKlC,IAAI,IAAI,MAAKG,MAAM,CAACU,MAAM,IAAI,MAAKZ,KAAK,CAACY,MAAM;gBAC7D;YACF;YAEA,IAAIsB,YAAYC,IAAAA,wBAAc,EAAI,IAAI,CAACnB,IAAI,CAACoB,IAAI,CAAC,IAAI,GAAGX,kBAAkB,SAAC3B;gBACzE,IAAI,CAAC,MAAKuC,SAAS,EAAE,MAAKlC,UAAU,CAACmC,MAAM,CAACJ;gBAC5CA,YAAY;gBACZvC,UAAU;gBACV,IAAMI,OAAO,CAAC,MAAKC,KAAK,CAACY,MAAM;gBAC/B,IAAI,AAACd,CAAAA,OAAOC,IAAG,KAAM,CAAC,MAAKA,IAAI,EAAE,MAAKwC,GAAG,CAACzC;gBAC1C,OAAOoB,SAASpB,KAAK,MAAKC,IAAI,IAAIA;YACpC;YACA,IAAI,CAACI,UAAU,CAACI,IAAI,CAAC2B;YACrBA;YACA;QACF;QAEA,OAAO,IAAIb,QAAQ,SAACC,SAASC;mBAC3B,MAAKV,OAAO,CAACL,IAAIb,SAAS,SAACG,KAAaC;gBACtCD,MAAMyB,OAAOzB,OAAOwB,QAAQvB;YAC9B;;IAEJ;IAEAwC,OAAAA,GAOC,GAPDA,SAAAA,IAAIzC,GAAW;QACb,IAAI,IAAI,CAACC,IAAI,EAAE;QACf,IAAI,CAACA,IAAI,GAAG;QACZ,MAAO,IAAI,CAACI,UAAU,CAACS,MAAM,GAAG,EAAG,IAAI,CAACT,UAAU,CAACqC,GAAG,GAAG1C,OAAO;QAChE,MAAO,IAAI,CAACM,UAAU,CAACQ,MAAM,GAAG,EAAGd,MAAM,IAAI,CAACM,UAAU,CAACoC,GAAG,GAAG1C,OAAO,IAAI,CAACM,UAAU,CAACoC,GAAG,GAAG,MAAM;QAClG,MAAO,IAAI,CAACtC,MAAM,CAACU,MAAM,GAAG,EAAGd,MAAM,IAAI,CAACI,MAAM,CAACsC,GAAG,GAAG1C,OAAO,IAAI,CAACI,MAAM,CAACsC,GAAG,GAAG,MAAM;QACtF,MAAO,IAAI,CAACxC,KAAK,CAACY,MAAM,GAAG,EAAG,IAAI,CAACZ,KAAK,CAACwC,GAAG;IAC9C;IAEAC,OAAAA,OAIC,GAJDA,SAAAA,QAAQ3C,GAAW;QACjB,IAAI,IAAI,CAACuC,SAAS,EAAE,MAAM,IAAIb,MAAM;QACpC,IAAI,CAACa,SAAS,GAAG;QACjB,IAAI,CAACE,GAAG,CAACzC;IACX;WA3HmBJ;;AA8HrB,IAAI,OAAOgD,WAAW,eAAeA,OAAOC,aAAa,EAAE;IACzDjD,kBAAkBkD,SAAS,CAACF,OAAOC,aAAa,CAAC,GAAG,SAASA;QAC3D,IAAME,OAAO,IAAI;QACjB,OAAO;YACL7B,MAAAA,SAAAA;gBACE,OAAO6B,KAAK7B,IAAI,GAAG8B,IAAI,CAAC,SAAC7B;oBACvB,OAAOI,QAAQC,OAAO,CAACL;gBACzB;YACF;YACAwB,SAAAA,SAAAA;gBACEI,KAAKJ,OAAO;gBACZ,OAAOpB,QAAQC,OAAO;YACxB;QACF;IACF;AACF"}

dist/cjs/LinkedList.d.cts

@@ -1,5 +0,8 @@
-import FIFO from 'fifo';
-export default class LinkedList<T> extends FIFO<T> {
+export default class LinkedList<T> {
+    private fifo;
+    get length(): any;
+    last(): T;
     pop(): T;
-    removeValue(value: T): boolean;
+    push(value: T): LinkedList<T>;
+    remove(value: T): boolean;
 }

dist/cjs/LinkedList.d.ts

@@ -1,5 +0,8 @@
-import FIFO from 'fifo';
-export default class LinkedList<T> extends FIFO<T> {
+export default class LinkedList<T> {
+    private fifo;
+    get length(): any;
+    last(): T;
     pop(): T;
-    removeValue(value: T): boolean;
+    push(value: T): LinkedList<T>;
+    remove(value: T): boolean;
 }

dist/cjs/LinkedList.js

@@ -12,12 +12,2 @@ "use strict";
 var _fifo = /*#__PURE__*/ _interop_require_default(require("fifo"));
-function _assert_this_initialized(self) {
-    if (self === void 0) {
-        throw new ReferenceError("this hasn't been initialised - super() hasn't been called");
-    }
-    return self;
-}
-function _call_super(_this, derived, args) {
-    derived = _get_prototype_of(derived);
-    return _possible_constructor_return(_this, _is_native_reflect_construct() ? Reflect.construct(derived, args || [], _get_prototype_of(_this).constructor) : derived.apply(_this, args));
-}
 function _class_call_check(instance, Constructor) {
@@ -28,37 +18,16 @@ if (!(instance instanceof Constructor)) {
 }
-function _get(target, property, receiver) {
-    if (typeof Reflect !== "undefined" && Reflect.get) {
-        _get = Reflect.get;
-    } else {
-        _get = function get(target, property, receiver) {
-            var base = _super_prop_base(target, property);
-            if (!base) return;
-            var desc = Object.getOwnPropertyDescriptor(base, property);
-            if (desc.get) {
-                return desc.get.call(receiver || target);
-            }
-            return desc.value;
-        };
+function _defineProperties(target, props) {
+    for(var i = 0; i < props.length; i++){
+        var descriptor = props[i];
+        descriptor.enumerable = descriptor.enumerable || false;
+        descriptor.configurable = true;
+        if ("value" in descriptor) descriptor.writable = true;
+        Object.defineProperty(target, descriptor.key, descriptor);
     }
-    return _get(target, property, receiver || target);
 }
-function _get_prototype_of(o) {
-    _get_prototype_of = Object.setPrototypeOf ? Object.getPrototypeOf : function getPrototypeOf(o) {
-        return o.__proto__ || Object.getPrototypeOf(o);
-    };
-    return _get_prototype_of(o);
+function _create_class(Constructor, protoProps, staticProps) {
+    if (protoProps) _defineProperties(Constructor.prototype, protoProps);
+    if (staticProps) _defineProperties(Constructor, staticProps);
+    return Constructor;
 }
-function _inherits(subClass, superClass) {
-    if (typeof superClass !== "function" && superClass !== null) {
-        throw new TypeError("Super expression must either be null or a function");
-    }
-    subClass.prototype = Object.create(superClass && superClass.prototype, {
-        constructor: {
-            value: subClass,
-            writable: true,
-            configurable: true
-        }
-    });
-    if (superClass) _set_prototype_of(subClass, superClass);
-}
 function _interop_require_default(obj) {
@@ -69,50 +38,23 @@ return obj && obj.__esModule ? obj : {
 }
-function _possible_constructor_return(self, call) {
-    if (call && (_type_of(call) === "object" || typeof call === "function")) {
-        return call;
-    }
-    return _assert_this_initialized(self);
-}
-function _set_prototype_of(o, p) {
-    _set_prototype_of = Object.setPrototypeOf || function setPrototypeOf(o, p) {
-        o.__proto__ = p;
-        return o;
-    };
-    return _set_prototype_of(o, p);
-}
-function _super_prop_base(object, property) {
-    while(!Object.prototype.hasOwnProperty.call(object, property)){
-        object = _get_prototype_of(object);
-        if (object === null) break;
-    }
-    return object;
-}
-function _type_of(obj) {
-    "@swc/helpers - typeof";
-    return obj && typeof Symbol !== "undefined" && obj.constructor === Symbol ? "symbol" : typeof obj;
-}
-function _is_native_reflect_construct() {
-    try {
-        var result = !Boolean.prototype.valueOf.call(Reflect.construct(Boolean, [], function() {}));
-    } catch (_) {}
-    return (_is_native_reflect_construct = function() {
-        return !!result;
-    })();
-}
-var LinkedList = /*#__PURE__*/ function(FIFO) {
+var LinkedList = /*#__PURE__*/ function() {
     "use strict";
-    _inherits(LinkedList, FIFO);
     function LinkedList() {
         _class_call_check(this, LinkedList);
-        return _call_super(this, LinkedList, arguments);
+        this.fifo = new _fifo.default();
     }
     var _proto = LinkedList.prototype;
-    // @ts-ignore
+    _proto.last = function last() {
+        return this.fifo.last();
+    };
     _proto.pop = function pop() {
-        return _get(_get_prototype_of(LinkedList.prototype), "pop", this).call(this);
+        return this.fifo.pop();
     };
-    _proto.removeValue = function removeValue(value) {
-        for(var node = this.node; node; node = this.next(node)){
+    _proto.push = function push(value) {
+        this.fifo.push(value);
+        return this;
+    };
+    _proto.remove = function remove(value) {
+        for(var node = this.fifo.node; node; node = this.fifo.next(node)){
             if (node.value === value) {
-                this.remove(node);
+                this.fifo.remove(node);
                 return true;
@@ -123,4 +65,12 @@ }
     };
+    _create_class(LinkedList, [
+        {
+            key: "length",
+            get: function get() {
+                return this.fifo.length;
+            }
+        }
+    ]);
     return LinkedList;
-}(_fifo.default);
+}();
 /* CJS INTEROP */ if (exports.__esModule && exports.default) { try { Object.defineProperty(exports.default, '__esModule', { value: true }); for (var key in exports) { exports.default[key] = exports[key]; } } catch (_) {}; module.exports = exports.default; }

dist/cjs/LinkedList.js.map

@@ -1,1 +0,1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/LinkedList.ts"],"sourcesContent":["import FIFO from 'fifo';\n\nexport default class LinkedList<T> extends FIFO<T> {\n  // @ts-ignore\n  pop(): T {\n    return super.pop() as T;\n  }\n  removeValue(value: T): boolean {\n    for (let node = this.node; node; node = this.next(node)) {\n      if (node.value === value) {\n        this.remove(node);\n        return true;\n      }\n    }\n    return false;\n  }\n}\n"],"names":["LinkedList","pop","removeValue","value","node","next","remove","FIFO"],"mappings":";;;;;;;eAEqBA;;;2DAFJ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEF,IAAA,AAAMA,2BAAN;;cAAMA;aAAAA;gCAAAA;QAAN,OAAA,kBAAMA;;iBAAAA;IACnB,aAAa;IACbC,OAAAA,GAEC,GAFDA,SAAAA;QACE,OAAO,uBAHUD,uBAGJC,OAAN,IAAK;IACd;IACAC,OAAAA,WAQC,GARDA,SAAAA,YAAYC,KAAQ;QAClB,IAAK,IAAIC,OAAO,IAAI,CAACA,IAAI,EAAEA,MAAMA,OAAO,IAAI,CAACC,IAAI,CAACD,MAAO;YACvD,IAAIA,KAAKD,KAAK,KAAKA,OAAO;gBACxB,IAAI,CAACG,MAAM,CAACF;gBACZ,OAAO;YACT;QACF;QACA,OAAO;IACT;WAbmBJ;EAAsBO,aAAI"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/LinkedList.ts"],"sourcesContent":["import FIFO from 'fifo';\n\nexport default class LinkedList<T> {\n  private fifo = new FIFO<T>();\n\n  get length() {\n    return this.fifo.length;\n  }\n  last(): T {\n    return this.fifo.last();\n  }\n  pop(): T {\n    return this.fifo.pop() as T;\n  }\n  push(value: T): LinkedList<T> {\n    this.fifo.push(value);\n    return this;\n  }\n  remove(value: T): boolean {\n    for (let node = this.fifo.node; node; node = this.fifo.next(node)) {\n      if (node.value === value) {\n        this.fifo.remove(node);\n        return true;\n      }\n    }\n    return false;\n  }\n}\n"],"names":["LinkedList","fifo","FIFO","last","pop","push","value","remove","node","next","length"],"mappings":";;;;;;;eAEqBA;;;2DAFJ;;;;;;;;;;;;;;;;;;;;;;;;;AAEF,IAAA,AAAMA,2BAAN;;aAAMA;gCAAAA;aACXC,OAAO,IAAIC,aAAI;;iBADJF;IAMnBG,OAAAA,IAEC,GAFDA,SAAAA;QACE,OAAO,IAAI,CAACF,IAAI,CAACE,IAAI;IACvB;IACAC,OAAAA,GAEC,GAFDA,SAAAA;QACE,OAAO,IAAI,CAACH,IAAI,CAACG,GAAG;IACtB;IACAC,OAAAA,IAGC,GAHDA,SAAAA,KAAKC,KAAQ;QACX,IAAI,CAACL,IAAI,CAACI,IAAI,CAACC;QACf,OAAO,IAAI;IACb;IACAC,OAAAA,MAQC,GARDA,SAAAA,OAAOD,KAAQ;QACb,IAAK,IAAIE,OAAO,IAAI,CAACP,IAAI,CAACO,IAAI,EAAEA,MAAMA,OAAO,IAAI,CAACP,IAAI,CAACQ,IAAI,CAACD,MAAO;YACjE,IAAIA,KAAKF,KAAK,KAAKA,OAAO;gBACxB,IAAI,CAACL,IAAI,CAACM,MAAM,CAACC;gBACjB,OAAO;YACT;QACF;QACA,OAAO;IACT;kBAxBmBR;;YAGfU,KAAAA;iBAAJ;gBACE,OAAO,IAAI,CAACT,IAAI,CAACS,MAAM;YACzB;;;WALmBV"}

dist/cjs/processOrQueue.js

@@ -25,3 +25,3 @@ "use strict";
     if (!iterator.stack.length) {
-        iterator.queued.unshift(callback);
+        iterator.queued.push(callback);
         return;
@@ -35,4 +35,3 @@ }
         (0, _asap.default)(function() {
-            // done is based on stack being empty and not error state as the user may choose to skip the error
-            iterator.processing.removeValue(callback);
+            iterator.processing.remove(callback);
             if (iterator.done) return callback(null, null); // early exit
@@ -39,0 +38,0 @@ if (err && _asynccompat.default.defaultValue(iterator.options.error(err), true)) err = null; // skip error

dist/cjs/processOrQueue.js.map

@@ -1,1 +0,1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/processOrQueue.ts"],"sourcesContent":["import compat from 'async-compat';\n\nimport asap from 'asap';\n\nimport type { AbstractIterator, ProcessCallback } from './types.js';\n\nexport default function processOrQueue<T>(iterator: AbstractIterator<T>, callback: ProcessCallback<T>): undefined {\n  if (iterator.done) {\n    callback(null, null);\n    return;\n  }\n\n  // nothing to process so queue\n  if (!iterator.stack.length) {\n    iterator.queued.unshift(callback);\n    return;\n  }\n\n  // process next\n  const next = iterator.stack.pop();\n  iterator.processing.push(callback);\n  next(iterator, (err?: Error, result?: T): undefined => {\n    // break call stack\n    asap(() => {\n      // done is based on stack being empty and not error state as the user may choose to skip the error\n      iterator.processing.removeValue(callback);\n      if (iterator.done) return callback(null, null); // early exit\n      if (err && compat.defaultValue(iterator.options.error(err), true)) err = null; // skip error\n\n      const done = iterator.stack.length <= 0 && iterator.processing.length <= 0;\n      !done && !err && !result ? processOrQueue<T>(iterator, callback) : callback(err, result || null);\n      if (done && !iterator.done) iterator.end(); // end\n    });\n  });\n}\n"],"names":["processOrQueue","iterator","callback","done","stack","length","queued","unshift","next","pop","processing","push","err","result","asap","removeValue","compat","defaultValue","options","error","end"],"mappings":";;;;+BAMA;;;eAAwBA;;;kEANL;2DAEF;;;;;;AAIF,SAASA,eAAkBC,QAA6B,EAAEC,QAA4B;IACnG,IAAID,SAASE,IAAI,EAAE;QACjBD,SAAS,MAAM;QACf;IACF;IAEA,8BAA8B;IAC9B,IAAI,CAACD,SAASG,KAAK,CAACC,MAAM,EAAE;QAC1BJ,SAASK,MAAM,CAACC,OAAO,CAACL;QACxB;IACF;IAEA,eAAe;IACf,IAAMM,OAAOP,SAASG,KAAK,CAACK,GAAG;IAC/BR,SAASS,UAAU,CAACC,IAAI,CAACT;IACzBM,KAAKP,UAAU,SAACW,KAAaC;QAC3B,mBAAmB;QACnBC,IAAAA,aAAI,EAAC;YACH,kGAAkG;YAClGb,SAASS,UAAU,CAACK,WAAW,CAACb;YAChC,IAAID,SAASE,IAAI,EAAE,OAAOD,SAAS,MAAM,OAAO,aAAa;YAC7D,IAAIU,OAAOI,oBAAM,CAACC,YAAY,CAAChB,SAASiB,OAAO,CAACC,KAAK,CAACP,MAAM,OAAOA,MAAM,MAAM,aAAa;YAE5F,IAAMT,OAAOF,SAASG,KAAK,CAACC,MAAM,IAAI,KAAKJ,SAASS,UAAU,CAACL,MAAM,IAAI;YACzE,CAACF,QAAQ,CAACS,OAAO,CAACC,SAASb,eAAkBC,UAAUC,YAAYA,SAASU,KAAKC,UAAU;YAC3F,IAAIV,QAAQ,CAACF,SAASE,IAAI,EAAEF,SAASmB,GAAG,IAAI,MAAM;QACpD;IACF;AACF"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/processOrQueue.ts"],"sourcesContent":["import compat from 'async-compat';\n\nimport asap from 'asap';\n\nimport type { AbstractIterator, ProcessCallback } from './types.js';\n\nexport default function processOrQueue<T>(iterator: AbstractIterator<T>, callback: ProcessCallback<T>): undefined {\n  if (iterator.done) {\n    callback(null, null);\n    return;\n  }\n\n  // nothing to process so queue\n  if (!iterator.stack.length) {\n    iterator.queued.push(callback);\n    return;\n  }\n\n  // process next\n  const next = iterator.stack.pop();\n  iterator.processing.push(callback);\n  next(iterator, (err?: Error, result?: T): undefined => {\n    // break call stack\n    asap(() => {\n      iterator.processing.remove(callback);\n      if (iterator.done) return callback(null, null); // early exit\n      if (err && compat.defaultValue(iterator.options.error(err), true)) err = null; // skip error\n\n      const done = iterator.stack.length <= 0 && iterator.processing.length <= 0;\n      !done && !err && !result ? processOrQueue<T>(iterator, callback) : callback(err, result || null);\n      if (done && !iterator.done) iterator.end(); // end\n    });\n  });\n}\n"],"names":["processOrQueue","iterator","callback","done","stack","length","queued","push","next","pop","processing","err","result","asap","remove","compat","defaultValue","options","error","end"],"mappings":";;;;+BAMA;;;eAAwBA;;;kEANL;2DAEF;;;;;;AAIF,SAASA,eAAkBC,QAA6B,EAAEC,QAA4B;IACnG,IAAID,SAASE,IAAI,EAAE;QACjBD,SAAS,MAAM;QACf;IACF;IAEA,8BAA8B;IAC9B,IAAI,CAACD,SAASG,KAAK,CAACC,MAAM,EAAE;QAC1BJ,SAASK,MAAM,CAACC,IAAI,CAACL;QACrB;IACF;IAEA,eAAe;IACf,IAAMM,OAAOP,SAASG,KAAK,CAACK,GAAG;IAC/BR,SAASS,UAAU,CAACH,IAAI,CAACL;IACzBM,KAAKP,UAAU,SAACU,KAAaC;QAC3B,mBAAmB;QACnBC,IAAAA,aAAI,EAAC;YACHZ,SAASS,UAAU,CAACI,MAAM,CAACZ;YAC3B,IAAID,SAASE,IAAI,EAAE,OAAOD,SAAS,MAAM,OAAO,aAAa;YAC7D,IAAIS,OAAOI,oBAAM,CAACC,YAAY,CAACf,SAASgB,OAAO,CAACC,KAAK,CAACP,MAAM,OAAOA,MAAM,MAAM,aAAa;YAE5F,IAAMR,OAAOF,SAASG,KAAK,CAACC,MAAM,IAAI,KAAKJ,SAASS,UAAU,CAACL,MAAM,IAAI;YACzE,CAACF,QAAQ,CAACQ,OAAO,CAACC,SAASZ,eAAkBC,UAAUC,YAAYA,SAASS,KAAKC,UAAU;YAC3F,IAAIT,QAAQ,CAACF,SAASE,IAAI,EAAEF,SAASkB,GAAG,IAAI,MAAM;QACpD;IACF;AACF"}

dist/cjs/types.d.cts

@@ -31,5 +31,5 @@ import type LinkedList from './LinkedList.js';
     done: boolean;
-    stack: LinkedList<StackFunction<T>>;
+    stack: StackFunction<T>[];
+    queued: ProcessCallback<T>[];
     processors: LinkedList<Processor>;
-    queued: LinkedList<ProcessCallback<T>>;
     processing: LinkedList<ProcessCallback<T>>;
@@ -36,0 +36,0 @@ options: StackOptions;

dist/cjs/types.d.ts

@@ -31,5 +31,5 @@ import type LinkedList from './LinkedList.js';
     done: boolean;
-    stack: LinkedList<StackFunction<T>>;
+    stack: StackFunction<T>[];
+    queued: ProcessCallback<T>[];
     processors: LinkedList<Processor>;
-    queued: LinkedList<ProcessCallback<T>>;
     processing: LinkedList<ProcessCallback<T>>;
@@ -36,0 +36,0 @@ options: StackOptions;

dist/esm/drainStack.js

@@ -6,3 +6,3 @@ import processOrQueue from './processOrQueue.js';
     if (iterator.processors.length <= 0) return false;
-    iterator.processors.first()(false);
+    iterator.processors.last()(false);
     if (iterator.done) return false;
@@ -9,0 +9,0 @@ return iterator.queued.length > 0;

dist/esm/drainStack.js.map

@@ -1,1 +0,1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/drainStack.ts"],"sourcesContent":["import processOrQueue from './processOrQueue.js';\n\nimport type { AbstractIterator } from './types.js';\n\nfunction canProcess<T>(iterator: AbstractIterator<T>): boolean {\n  if (iterator.done || !iterator.stack.length) return false;\n  if (iterator.queued.length) return true;\n  if (iterator.processors.length <= 0) return false;\n  iterator.processors.first()(false);\n  if (iterator.done) return false;\n  return iterator.queued.length > 0;\n}\n\nexport default function drainStack<T>(iterator: AbstractIterator<T>): undefined {\n  while (canProcess<T>(iterator)) {\n    processOrQueue(iterator, iterator.queued.pop());\n  }\n}\n"],"names":["processOrQueue","canProcess","iterator","done","stack","length","queued","processors","first","drainStack","pop"],"mappings":"AAAA,OAAOA,oBAAoB,sBAAsB;AAIjD,SAASC,WAAcC,QAA6B;IAClD,IAAIA,SAASC,IAAI,IAAI,CAACD,SAASE,KAAK,CAACC,MAAM,EAAE,OAAO;IACpD,IAAIH,SAASI,MAAM,CAACD,MAAM,EAAE,OAAO;IACnC,IAAIH,SAASK,UAAU,CAACF,MAAM,IAAI,GAAG,OAAO;IAC5CH,SAASK,UAAU,CAACC,KAAK,GAAG;IAC5B,IAAIN,SAASC,IAAI,EAAE,OAAO;IAC1B,OAAOD,SAASI,MAAM,CAACD,MAAM,GAAG;AAClC;AAEA,eAAe,SAASI,WAAcP,QAA6B;IACjE,MAAOD,WAAcC,UAAW;QAC9BF,eAAeE,UAAUA,SAASI,MAAM,CAACI,GAAG;IAC9C;AACF"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/drainStack.ts"],"sourcesContent":["import processOrQueue from './processOrQueue.js';\n\nimport type { AbstractIterator } from './types.js';\n\nfunction canProcess<T>(iterator: AbstractIterator<T>): boolean {\n  if (iterator.done || !iterator.stack.length) return false;\n  if (iterator.queued.length) return true;\n  if (iterator.processors.length <= 0) return false;\n  iterator.processors.last()(false);\n  if (iterator.done) return false;\n  return iterator.queued.length > 0;\n}\n\nexport default function drainStack<T>(iterator: AbstractIterator<T>): undefined {\n  while (canProcess<T>(iterator)) {\n    processOrQueue(iterator, iterator.queued.pop());\n  }\n}\n"],"names":["processOrQueue","canProcess","iterator","done","stack","length","queued","processors","last","drainStack","pop"],"mappings":"AAAA,OAAOA,oBAAoB,sBAAsB;AAIjD,SAASC,WAAcC,QAA6B;IAClD,IAAIA,SAASC,IAAI,IAAI,CAACD,SAASE,KAAK,CAACC,MAAM,EAAE,OAAO;IACpD,IAAIH,SAASI,MAAM,CAACD,MAAM,EAAE,OAAO;IACnC,IAAIH,SAASK,UAAU,CAACF,MAAM,IAAI,GAAG,OAAO;IAC5CH,SAASK,UAAU,CAACC,IAAI,GAAG;IAC3B,IAAIN,SAASC,IAAI,EAAE,OAAO;IAC1B,OAAOD,SAASI,MAAM,CAACD,MAAM,GAAG;AAClC;AAEA,eAAe,SAASI,WAAcP,QAA6B;IACjE,MAAOD,WAAcC,UAAW;QAC9BF,eAAeE,UAAUA,SAASI,MAAM,CAACI,GAAG;IAC9C;AACF"}

dist/esm/index.d.ts

@@ -7,5 +7,5 @@ import LinkedList from './LinkedList.js';
     protected done: boolean;
-    protected stack: LinkedList<StackFunction<T>>;
+    protected stack: StackFunction<T>[];
+    protected queued: ProcessCallback<T>[];
     protected processors: LinkedList<Processor>;
-    protected queued: LinkedList<ProcessCallback<T>>;
     protected processing: LinkedList<ProcessCallback<T>>;
@@ -12,0 +12,0 @@ protected options: StackOptions;

dist/esm/index.js

@@ -61,3 +61,3 @@ import once from 'call-once-fn';
             let processor = createProcesor(this.next.bind(this), processorOptions, (err)=>{
-                if (!this.destroyed) this.processors.removeValue(processor);
+                if (!this.destroyed) this.processors.remove(processor);
                 processor = null;
@@ -98,5 +98,5 @@ options = null;
         this.done = false;
-        this.stack = new LinkedList();
+        this.stack = new Array();
+        this.queued = new Array();
         this.processors = new LinkedList();
-        this.queued = new LinkedList();
         this.processing = new LinkedList();
@@ -103,0 +103,0 @@ this.entries = new LinkedList();

dist/esm/index.js.map

@@ -1,1 +0,1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/index.ts"],"sourcesContent":["import once from 'call-once-fn';\nimport LinkedList from './LinkedList.js';\n\nimport createProcesor from './createProcessor.js';\nimport drainStack from './drainStack.js';\nimport processOrQueue from './processOrQueue.js';\n\nimport type { AbstractIterator, EachDoneCallback, EachFunction, ForEachOptions, NextCallback, ProcessCallback, Processor, ProcessorOptions, StackFunction, StackOptions } from './types.js';\n\nexport type * from './types.js';\nexport { default as LinkedList } from './LinkedList.js';\nexport default class StackBaseIterator<T, TReturn = unknown, TNext = unknown> implements AsyncIterator<T, TReturn, TNext> {\n  protected done: boolean;\n  protected stack: LinkedList<StackFunction<T>>;\n  protected processors: LinkedList<Processor>;\n  protected queued: LinkedList<ProcessCallback<T>>;\n  protected processing: LinkedList<ProcessCallback<T>>;\n\n  protected options: StackOptions;\n  protected entries: LinkedList<T>;\n  protected destroyed: boolean;\n\n  constructor(options: StackOptions = {}) {\n    this.options = { ...options };\n    this.options.error =\n      options.error ||\n      function defaultError(err) {\n        return !!err; // fail on errors\n      };\n\n    this.done = false;\n    this.stack = new LinkedList<StackFunction<T>>();\n    this.processors = new LinkedList<Processor>();\n    this.queued = new LinkedList<ProcessCallback<T>>();\n    this.processing = new LinkedList<ProcessCallback<T>>();\n    this.entries = new LinkedList<T>();\n  }\n\n  isDone() {\n    return this.done;\n  }\n\n  push(fn: StackFunction<T>, ...rest: StackFunction<T>[]) {\n    if (this.done) return console.log('Attempting to push on a done iterator');\n    this.stack.push(fn);\n    !rest.length || rest.forEach((x) => this.stack.push(x));\n    drainStack<T>(this as unknown as AbstractIterator<T>);\n  }\n\n  next(...[value]: [] | [TNext]): Promise<IteratorResult<T, TReturn>> {\n    const callback = value as NextCallback<T>;\n    if (typeof callback === 'function') {\n      processOrQueue(\n        this as unknown as AbstractIterator<T>,\n        once((err?: Error, value?: T | null) => {\n          err ? callback(err) : callback(null, value);\n        }) as ProcessCallback<T>\n      );\n      return;\n    }\n\n    return new Promise((resolve, reject) => {\n      processOrQueue(\n        this as unknown as AbstractIterator<T>,\n        once((err, value: T) => {\n          err ? reject(err) : resolve({ value, done: value === null } as IteratorResult<T, TReturn>);\n        }) as ProcessCallback<T>\n      );\n    });\n  }\n\n  forEach(fn: EachFunction<T>, options?: ForEachOptions | ProcessCallback<T>, callback?: EachDoneCallback): undefined | Promise<boolean> {\n    if (typeof fn !== 'function') throw new Error('Missing each function');\n    if (typeof options === 'function') {\n      callback = options as EachDoneCallback;\n      options = {};\n    }\n\n    if (typeof callback === 'function') {\n      if (this.done) {\n        callback(null, true);\n        return;\n      }\n      options = options || {};\n      const processorOptions: ProcessorOptions<T> = {\n        each: fn,\n        callbacks: options.callbacks || false,\n        concurrency: options.concurrency || 1,\n        limit: options.limit || Infinity,\n        error:\n          options.error ||\n          function defaultError() {\n            return true; // default is exit on error\n          },\n        total: 0,\n        counter: 0,\n        stop: () => {\n          return this.done || this.queued.length >= this.stack.length;\n        },\n      };\n\n      let processor = createProcesor<T>(this.next.bind(this), processorOptions, (err) => {\n        if (!this.destroyed) this.processors.removeValue(processor);\n        processor = null;\n        options = null;\n        const done = !this.stack.length;\n        if ((err || done) && !this.done) this.end(err);\n        return callback(err, this.done || done);\n      });\n      this.processors.push(processor);\n      processor();\n      return;\n    }\n\n    return new Promise((resolve, reject) =>\n      this.forEach(fn, options, (err?: Error, done?: boolean) => {\n        err ? reject(err) : resolve(done);\n      })\n    );\n  }\n\n  end(err?: Error) {\n    if (this.done) return;\n    this.done = true;\n    while (this.processors.length > 0) this.processors.pop()(err || true);\n    while (this.processing.length > 0) err ? this.processing.pop()(err) : this.processing.pop()(null, null);\n    while (this.queued.length > 0) err ? this.queued.pop()(err) : this.queued.pop()(null, null);\n    while (this.stack.length > 0) this.stack.pop();\n  }\n\n  destroy(err?: Error) {\n    if (this.destroyed) throw new Error('Already destroyed');\n    this.destroyed = true;\n    this.end(err);\n  }\n}\n\nif (typeof Symbol !== 'undefined' && Symbol.asyncIterator) {\n  StackBaseIterator.prototype[Symbol.asyncIterator] = function asyncIterator() {\n    const self = this;\n    return {\n      next() {\n        return self.next().then((value) => {\n          return Promise.resolve(value);\n        });\n      },\n      destroy() {\n        self.destroy();\n        return Promise.resolve();\n      },\n    };\n  };\n}\n"],"names":["once","LinkedList","createProcesor","drainStack","processOrQueue","default","StackBaseIterator","isDone","done","push","fn","rest","console","log","stack","length","forEach","x","next","value","callback","err","Promise","resolve","reject","options","Error","processorOptions","each","callbacks","concurrency","limit","Infinity","error","defaultError","total","counter","stop","queued","processor","bind","destroyed","processors","removeValue","end","pop","processing","destroy","entries","Symbol","asyncIterator","prototype","self","then"],"mappings":"AAAA,OAAOA,UAAU,eAAe;AAChC,OAAOC,gBAAgB,kBAAkB;AAEzC,OAAOC,oBAAoB,uBAAuB;AAClD,OAAOC,gBAAgB,kBAAkB;AACzC,OAAOC,oBAAoB,sBAAsB;AAKjD,SAASC,WAAWJ,UAAU,QAAQ,kBAAkB;AACzC,IAAA,AAAMK,oBAAN,MAAMA;IA2BnBC,SAAS;QACP,OAAO,IAAI,CAACC,IAAI;IAClB;IAEAC,KAAKC,EAAoB,EAAE,GAAGC,IAAwB,EAAE;QACtD,IAAI,IAAI,CAACH,IAAI,EAAE,OAAOI,QAAQC,GAAG,CAAC;QAClC,IAAI,CAACC,KAAK,CAACL,IAAI,CAACC;QAChB,CAACC,KAAKI,MAAM,IAAIJ,KAAKK,OAAO,CAAC,CAACC,IAAM,IAAI,CAACH,KAAK,CAACL,IAAI,CAACQ;QACpDd,WAAc,IAAI;IACpB;IAEAe,KAAK,GAAG,CAACC,MAAM,AAAc,EAAuC;QAClE,MAAMC,WAAWD;QACjB,IAAI,OAAOC,aAAa,YAAY;YAClChB,eACE,IAAI,EACJJ,KAAK,CAACqB,KAAaF;gBACjBE,MAAMD,SAASC,OAAOD,SAAS,MAAMD;YACvC;YAEF;QACF;QAEA,OAAO,IAAIG,QAAQ,CAACC,SAASC;YAC3BpB,eACE,IAAI,EACJJ,KAAK,CAACqB,KAAKF;gBACTE,MAAMG,OAAOH,OAAOE,QAAQ;oBAAEJ;oBAAOX,MAAMW,UAAU;gBAAK;YAC5D;QAEJ;IACF;IAEAH,QAAQN,EAAmB,EAAEe,OAA6C,EAAEL,QAA2B,EAAgC;QACrI,IAAI,OAAOV,OAAO,YAAY,MAAM,IAAIgB,MAAM;QAC9C,IAAI,OAAOD,YAAY,YAAY;YACjCL,WAAWK;YACXA,UAAU,CAAC;QACb;QAEA,IAAI,OAAOL,aAAa,YAAY;YAClC,IAAI,IAAI,CAACZ,IAAI,EAAE;gBACbY,SAAS,MAAM;gBACf;YACF;YACAK,UAAUA,WAAW,CAAC;YACtB,MAAME,mBAAwC;gBAC5CC,MAAMlB;gBACNmB,WAAWJ,QAAQI,SAAS,IAAI;gBAChCC,aAAaL,QAAQK,WAAW,IAAI;gBACpCC,OAAON,QAAQM,KAAK,IAAIC;gBACxBC,OACER,QAAQQ,KAAK,IACb,SAASC;oBACP,OAAO,MAAM,2BAA2B;gBAC1C;gBACFC,OAAO;gBACPC,SAAS;gBACTC,MAAM;oBACJ,OAAO,IAAI,CAAC7B,IAAI,IAAI,IAAI,CAAC8B,MAAM,CAACvB,MAAM,IAAI,IAAI,CAACD,KAAK,CAACC,MAAM;gBAC7D;YACF;YAEA,IAAIwB,YAAYrC,eAAkB,IAAI,CAACgB,IAAI,CAACsB,IAAI,CAAC,IAAI,GAAGb,kBAAkB,CAACN;gBACzE,IAAI,CAAC,IAAI,CAACoB,SAAS,EAAE,IAAI,CAACC,UAAU,CAACC,WAAW,CAACJ;gBACjDA,YAAY;gBACZd,UAAU;gBACV,MAAMjB,OAAO,CAAC,IAAI,CAACM,KAAK,CAACC,MAAM;gBAC/B,IAAI,AAACM,CAAAA,OAAOb,IAAG,KAAM,CAAC,IAAI,CAACA,IAAI,EAAE,IAAI,CAACoC,GAAG,CAACvB;gBAC1C,OAAOD,SAASC,KAAK,IAAI,CAACb,IAAI,IAAIA;YACpC;YACA,IAAI,CAACkC,UAAU,CAACjC,IAAI,CAAC8B;YACrBA;YACA;QACF;QAEA,OAAO,IAAIjB,QAAQ,CAACC,SAASC,SAC3B,IAAI,CAACR,OAAO,CAACN,IAAIe,SAAS,CAACJ,KAAab;gBACtCa,MAAMG,OAAOH,OAAOE,QAAQf;YAC9B;IAEJ;IAEAoC,IAAIvB,GAAW,EAAE;QACf,IAAI,IAAI,CAACb,IAAI,EAAE;QACf,IAAI,CAACA,IAAI,GAAG;QACZ,MAAO,IAAI,CAACkC,UAAU,CAAC3B,MAAM,GAAG,EAAG,IAAI,CAAC2B,UAAU,CAACG,GAAG,GAAGxB,OAAO;QAChE,MAAO,IAAI,CAACyB,UAAU,CAAC/B,MAAM,GAAG,EAAGM,MAAM,IAAI,CAACyB,UAAU,CAACD,GAAG,GAAGxB,OAAO,IAAI,CAACyB,UAAU,CAACD,GAAG,GAAG,MAAM;QAClG,MAAO,IAAI,CAACP,MAAM,CAACvB,MAAM,GAAG,EAAGM,MAAM,IAAI,CAACiB,MAAM,CAACO,GAAG,GAAGxB,OAAO,IAAI,CAACiB,MAAM,CAACO,GAAG,GAAG,MAAM;QACtF,MAAO,IAAI,CAAC/B,KAAK,CAACC,MAAM,GAAG,EAAG,IAAI,CAACD,KAAK,CAAC+B,GAAG;IAC9C;IAEAE,QAAQ1B,GAAW,EAAE;QACnB,IAAI,IAAI,CAACoB,SAAS,EAAE,MAAM,IAAIf,MAAM;QACpC,IAAI,CAACe,SAAS,GAAG;QACjB,IAAI,CAACG,GAAG,CAACvB;IACX;IAhHA,YAAYI,UAAwB,CAAC,CAAC,CAAE;QACtC,IAAI,CAACA,OAAO,GAAG;YAAE,GAAGA,OAAO;QAAC;QAC5B,IAAI,CAACA,OAAO,CAACQ,KAAK,GAChBR,QAAQQ,KAAK,IACb,SAASC,aAAab,GAAG;YACvB,OAAO,CAAC,CAACA,KAAK,iBAAiB;QACjC;QAEF,IAAI,CAACb,IAAI,GAAG;QACZ,IAAI,CAACM,KAAK,GAAG,IAAIb;QACjB,IAAI,CAACyC,UAAU,GAAG,IAAIzC;QACtB,IAAI,CAACqC,MAAM,GAAG,IAAIrC;QAClB,IAAI,CAAC6C,UAAU,GAAG,IAAI7C;QACtB,IAAI,CAAC+C,OAAO,GAAG,IAAI/C;IACrB;AAmGF;AA5HA,SAAqBK,+BA4HpB;AAED,IAAI,OAAO2C,WAAW,eAAeA,OAAOC,aAAa,EAAE;IACzD5C,kBAAkB6C,SAAS,CAACF,OAAOC,aAAa,CAAC,GAAG,SAASA;QAC3D,MAAME,OAAO,IAAI;QACjB,OAAO;YACLlC;gBACE,OAAOkC,KAAKlC,IAAI,GAAGmC,IAAI,CAAC,CAAClC;oBACvB,OAAOG,QAAQC,OAAO,CAACJ;gBACzB;YACF;YACA4B;gBACEK,KAAKL,OAAO;gBACZ,OAAOzB,QAAQC,OAAO;YACxB;QACF;IACF;AACF"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/index.ts"],"sourcesContent":["import once from 'call-once-fn';\nimport LinkedList from './LinkedList.js';\n\nimport createProcesor from './createProcessor.js';\nimport drainStack from './drainStack.js';\nimport processOrQueue from './processOrQueue.js';\n\nimport type { AbstractIterator, EachDoneCallback, EachFunction, ForEachOptions, NextCallback, ProcessCallback, Processor, ProcessorOptions, StackFunction, StackOptions } from './types.js';\n\nexport type * from './types.js';\nexport { default as LinkedList } from './LinkedList.js';\nexport default class StackBaseIterator<T, TReturn = unknown, TNext = unknown> implements AsyncIterator<T, TReturn, TNext> {\n  protected done: boolean;\n  protected stack: StackFunction<T>[];\n  protected queued: ProcessCallback<T>[];\n  protected processors: LinkedList<Processor>;\n  protected processing: LinkedList<ProcessCallback<T>>;\n\n  protected options: StackOptions;\n  protected entries: LinkedList<T>;\n  protected destroyed: boolean;\n\n  constructor(options: StackOptions = {}) {\n    this.options = { ...options };\n    this.options.error =\n      options.error ||\n      function defaultError(err) {\n        return !!err; // fail on errors\n      };\n\n    this.done = false;\n    this.stack = new Array<StackFunction<T>>();\n    this.queued = new Array<ProcessCallback<T>>();\n    this.processors = new LinkedList<Processor>();\n    this.processing = new LinkedList<ProcessCallback<T>>();\n    this.entries = new LinkedList<T>();\n  }\n\n  isDone() {\n    return this.done;\n  }\n\n  push(fn: StackFunction<T>, ...rest: StackFunction<T>[]) {\n    if (this.done) return console.log('Attempting to push on a done iterator');\n    this.stack.push(fn);\n    !rest.length || rest.forEach((x) => this.stack.push(x));\n    drainStack<T>(this as unknown as AbstractIterator<T>);\n  }\n\n  next(...[value]: [] | [TNext]): Promise<IteratorResult<T, TReturn>> {\n    const callback = value as NextCallback<T>;\n    if (typeof callback === 'function') {\n      processOrQueue(\n        this as unknown as AbstractIterator<T>,\n        once((err?: Error, value?: T | null) => {\n          err ? callback(err) : callback(null, value);\n        }) as ProcessCallback<T>\n      );\n      return;\n    }\n\n    return new Promise((resolve, reject) => {\n      processOrQueue(\n        this as unknown as AbstractIterator<T>,\n        once((err, value: T) => {\n          err ? reject(err) : resolve({ value, done: value === null } as IteratorResult<T, TReturn>);\n        }) as ProcessCallback<T>\n      );\n    });\n  }\n\n  forEach(fn: EachFunction<T>, options?: ForEachOptions | ProcessCallback<T>, callback?: EachDoneCallback): undefined | Promise<boolean> {\n    if (typeof fn !== 'function') throw new Error('Missing each function');\n    if (typeof options === 'function') {\n      callback = options as EachDoneCallback;\n      options = {};\n    }\n\n    if (typeof callback === 'function') {\n      if (this.done) {\n        callback(null, true);\n        return;\n      }\n      options = options || {};\n      const processorOptions: ProcessorOptions<T> = {\n        each: fn,\n        callbacks: options.callbacks || false,\n        concurrency: options.concurrency || 1,\n        limit: options.limit || Infinity,\n        error:\n          options.error ||\n          function defaultError() {\n            return true; // default is exit on error\n          },\n        total: 0,\n        counter: 0,\n        stop: () => {\n          return this.done || this.queued.length >= this.stack.length;\n        },\n      };\n\n      let processor = createProcesor<T>(this.next.bind(this), processorOptions, (err) => {\n        if (!this.destroyed) this.processors.remove(processor);\n        processor = null;\n        options = null;\n        const done = !this.stack.length;\n        if ((err || done) && !this.done) this.end(err);\n        return callback(err, this.done || done);\n      });\n      this.processors.push(processor);\n      processor();\n      return;\n    }\n\n    return new Promise((resolve, reject) =>\n      this.forEach(fn, options, (err?: Error, done?: boolean) => {\n        err ? reject(err) : resolve(done);\n      })\n    );\n  }\n\n  end(err?: Error) {\n    if (this.done) return;\n    this.done = true;\n    while (this.processors.length > 0) this.processors.pop()(err || true);\n    while (this.processing.length > 0) err ? this.processing.pop()(err) : this.processing.pop()(null, null);\n    while (this.queued.length > 0) err ? this.queued.pop()(err) : this.queued.pop()(null, null);\n    while (this.stack.length > 0) this.stack.pop();\n  }\n\n  destroy(err?: Error) {\n    if (this.destroyed) throw new Error('Already destroyed');\n    this.destroyed = true;\n    this.end(err);\n  }\n}\n\nif (typeof Symbol !== 'undefined' && Symbol.asyncIterator) {\n  StackBaseIterator.prototype[Symbol.asyncIterator] = function asyncIterator() {\n    const self = this;\n    return {\n      next() {\n        return self.next().then((value) => {\n          return Promise.resolve(value);\n        });\n      },\n      destroy() {\n        self.destroy();\n        return Promise.resolve();\n      },\n    };\n  };\n}\n"],"names":["once","LinkedList","createProcesor","drainStack","processOrQueue","default","StackBaseIterator","isDone","done","push","fn","rest","console","log","stack","length","forEach","x","next","value","callback","err","Promise","resolve","reject","options","Error","processorOptions","each","callbacks","concurrency","limit","Infinity","error","defaultError","total","counter","stop","queued","processor","bind","destroyed","processors","remove","end","pop","processing","destroy","Array","entries","Symbol","asyncIterator","prototype","self","then"],"mappings":"AAAA,OAAOA,UAAU,eAAe;AAChC,OAAOC,gBAAgB,kBAAkB;AAEzC,OAAOC,oBAAoB,uBAAuB;AAClD,OAAOC,gBAAgB,kBAAkB;AACzC,OAAOC,oBAAoB,sBAAsB;AAKjD,SAASC,WAAWJ,UAAU,QAAQ,kBAAkB;AACzC,IAAA,AAAMK,oBAAN,MAAMA;IA2BnBC,SAAS;QACP,OAAO,IAAI,CAACC,IAAI;IAClB;IAEAC,KAAKC,EAAoB,EAAE,GAAGC,IAAwB,EAAE;QACtD,IAAI,IAAI,CAACH,IAAI,EAAE,OAAOI,QAAQC,GAAG,CAAC;QAClC,IAAI,CAACC,KAAK,CAACL,IAAI,CAACC;QAChB,CAACC,KAAKI,MAAM,IAAIJ,KAAKK,OAAO,CAAC,CAACC,IAAM,IAAI,CAACH,KAAK,CAACL,IAAI,CAACQ;QACpDd,WAAc,IAAI;IACpB;IAEAe,KAAK,GAAG,CAACC,MAAM,AAAc,EAAuC;QAClE,MAAMC,WAAWD;QACjB,IAAI,OAAOC,aAAa,YAAY;YAClChB,eACE,IAAI,EACJJ,KAAK,CAACqB,KAAaF;gBACjBE,MAAMD,SAASC,OAAOD,SAAS,MAAMD;YACvC;YAEF;QACF;QAEA,OAAO,IAAIG,QAAQ,CAACC,SAASC;YAC3BpB,eACE,IAAI,EACJJ,KAAK,CAACqB,KAAKF;gBACTE,MAAMG,OAAOH,OAAOE,QAAQ;oBAAEJ;oBAAOX,MAAMW,UAAU;gBAAK;YAC5D;QAEJ;IACF;IAEAH,QAAQN,EAAmB,EAAEe,OAA6C,EAAEL,QAA2B,EAAgC;QACrI,IAAI,OAAOV,OAAO,YAAY,MAAM,IAAIgB,MAAM;QAC9C,IAAI,OAAOD,YAAY,YAAY;YACjCL,WAAWK;YACXA,UAAU,CAAC;QACb;QAEA,IAAI,OAAOL,aAAa,YAAY;YAClC,IAAI,IAAI,CAACZ,IAAI,EAAE;gBACbY,SAAS,MAAM;gBACf;YACF;YACAK,UAAUA,WAAW,CAAC;YACtB,MAAME,mBAAwC;gBAC5CC,MAAMlB;gBACNmB,WAAWJ,QAAQI,SAAS,IAAI;gBAChCC,aAAaL,QAAQK,WAAW,IAAI;gBACpCC,OAAON,QAAQM,KAAK,IAAIC;gBACxBC,OACER,QAAQQ,KAAK,IACb,SAASC;oBACP,OAAO,MAAM,2BAA2B;gBAC1C;gBACFC,OAAO;gBACPC,SAAS;gBACTC,MAAM;oBACJ,OAAO,IAAI,CAAC7B,IAAI,IAAI,IAAI,CAAC8B,MAAM,CAACvB,MAAM,IAAI,IAAI,CAACD,KAAK,CAACC,MAAM;gBAC7D;YACF;YAEA,IAAIwB,YAAYrC,eAAkB,IAAI,CAACgB,IAAI,CAACsB,IAAI,CAAC,IAAI,GAAGb,kBAAkB,CAACN;gBACzE,IAAI,CAAC,IAAI,CAACoB,SAAS,EAAE,IAAI,CAACC,UAAU,CAACC,MAAM,CAACJ;gBAC5CA,YAAY;gBACZd,UAAU;gBACV,MAAMjB,OAAO,CAAC,IAAI,CAACM,KAAK,CAACC,MAAM;gBAC/B,IAAI,AAACM,CAAAA,OAAOb,IAAG,KAAM,CAAC,IAAI,CAACA,IAAI,EAAE,IAAI,CAACoC,GAAG,CAACvB;gBAC1C,OAAOD,SAASC,KAAK,IAAI,CAACb,IAAI,IAAIA;YACpC;YACA,IAAI,CAACkC,UAAU,CAACjC,IAAI,CAAC8B;YACrBA;YACA;QACF;QAEA,OAAO,IAAIjB,QAAQ,CAACC,SAASC,SAC3B,IAAI,CAACR,OAAO,CAACN,IAAIe,SAAS,CAACJ,KAAab;gBACtCa,MAAMG,OAAOH,OAAOE,QAAQf;YAC9B;IAEJ;IAEAoC,IAAIvB,GAAW,EAAE;QACf,IAAI,IAAI,CAACb,IAAI,EAAE;QACf,IAAI,CAACA,IAAI,GAAG;QACZ,MAAO,IAAI,CAACkC,UAAU,CAAC3B,MAAM,GAAG,EAAG,IAAI,CAAC2B,UAAU,CAACG,GAAG,GAAGxB,OAAO;QAChE,MAAO,IAAI,CAACyB,UAAU,CAAC/B,MAAM,GAAG,EAAGM,MAAM,IAAI,CAACyB,UAAU,CAACD,GAAG,GAAGxB,OAAO,IAAI,CAACyB,UAAU,CAACD,GAAG,GAAG,MAAM;QAClG,MAAO,IAAI,CAACP,MAAM,CAACvB,MAAM,GAAG,EAAGM,MAAM,IAAI,CAACiB,MAAM,CAACO,GAAG,GAAGxB,OAAO,IAAI,CAACiB,MAAM,CAACO,GAAG,GAAG,MAAM;QACtF,MAAO,IAAI,CAAC/B,KAAK,CAACC,MAAM,GAAG,EAAG,IAAI,CAACD,KAAK,CAAC+B,GAAG;IAC9C;IAEAE,QAAQ1B,GAAW,EAAE;QACnB,IAAI,IAAI,CAACoB,SAAS,EAAE,MAAM,IAAIf,MAAM;QACpC,IAAI,CAACe,SAAS,GAAG;QACjB,IAAI,CAACG,GAAG,CAACvB;IACX;IAhHA,YAAYI,UAAwB,CAAC,CAAC,CAAE;QACtC,IAAI,CAACA,OAAO,GAAG;YAAE,GAAGA,OAAO;QAAC;QAC5B,IAAI,CAACA,OAAO,CAACQ,KAAK,GAChBR,QAAQQ,KAAK,IACb,SAASC,aAAab,GAAG;YACvB,OAAO,CAAC,CAACA,KAAK,iBAAiB;QACjC;QAEF,IAAI,CAACb,IAAI,GAAG;QACZ,IAAI,CAACM,KAAK,GAAG,IAAIkC;QACjB,IAAI,CAACV,MAAM,GAAG,IAAIU;QAClB,IAAI,CAACN,UAAU,GAAG,IAAIzC;QACtB,IAAI,CAAC6C,UAAU,GAAG,IAAI7C;QACtB,IAAI,CAACgD,OAAO,GAAG,IAAIhD;IACrB;AAmGF;AA5HA,SAAqBK,+BA4HpB;AAED,IAAI,OAAO4C,WAAW,eAAeA,OAAOC,aAAa,EAAE;IACzD7C,kBAAkB8C,SAAS,CAACF,OAAOC,aAAa,CAAC,GAAG,SAASA;QAC3D,MAAME,OAAO,IAAI;QACjB,OAAO;YACLnC;gBACE,OAAOmC,KAAKnC,IAAI,GAAGoC,IAAI,CAAC,CAACnC;oBACvB,OAAOG,QAAQC,OAAO,CAACJ;gBACzB;YACF;YACA4B;gBACEM,KAAKN,OAAO;gBACZ,OAAOzB,QAAQC,OAAO;YACxB;QACF;IACF;AACF"}

dist/esm/LinkedList.d.ts

@@ -1,5 +0,8 @@
-import FIFO from 'fifo';
-export default class LinkedList<T> extends FIFO<T> {
+export default class LinkedList<T> {
+    private fifo;
+    get length(): any;
+    last(): T;
     pop(): T;
-    removeValue(value: T): boolean;
+    push(value: T): LinkedList<T>;
+    remove(value: T): boolean;
 }

dist/esm/LinkedList.js

 import FIFO from 'fifo';
-let LinkedList = class LinkedList extends FIFO {
-    // @ts-ignore
+let LinkedList = class LinkedList {
+    get length() {
+        return this.fifo.length;
+    }
+    last() {
+        return this.fifo.last();
+    }
     pop() {
-        return super.pop();
+        return this.fifo.pop();
     }
-    removeValue(value) {
-        for(let node = this.node; node; node = this.next(node)){
+    push(value) {
+        this.fifo.push(value);
+        return this;
+    }
+    remove(value) {
+        for(let node = this.fifo.node; node; node = this.fifo.next(node)){
             if (node.value === value) {
-                this.remove(node);
+                this.fifo.remove(node);
                 return true;
@@ -16,3 +25,6 @@ }
     }
+    constructor(){
+        this.fifo = new FIFO();
+    }
 };
 export { LinkedList as default };

dist/esm/LinkedList.js.map

@@ -1,1 +0,1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/LinkedList.ts"],"sourcesContent":["import FIFO from 'fifo';\n\nexport default class LinkedList<T> extends FIFO<T> {\n  // @ts-ignore\n  pop(): T {\n    return super.pop() as T;\n  }\n  removeValue(value: T): boolean {\n    for (let node = this.node; node; node = this.next(node)) {\n      if (node.value === value) {\n        this.remove(node);\n        return true;\n      }\n    }\n    return false;\n  }\n}\n"],"names":["FIFO","LinkedList","pop","removeValue","value","node","next","remove"],"mappings":"AAAA,OAAOA,UAAU,OAAO;AAET,IAAA,AAAMC,aAAN,MAAMA,mBAAsBD;IACzC,aAAa;IACbE,MAAS;QACP,OAAO,KAAK,CAACA;IACf;IACAC,YAAYC,KAAQ,EAAW;QAC7B,IAAK,IAAIC,OAAO,IAAI,CAACA,IAAI,EAAEA,MAAMA,OAAO,IAAI,CAACC,IAAI,CAACD,MAAO;YACvD,IAAIA,KAAKD,KAAK,KAAKA,OAAO;gBACxB,IAAI,CAACG,MAAM,CAACF;gBACZ,OAAO;YACT;QACF;QACA,OAAO;IACT;AACF;AAdA,SAAqBJ,wBAcpB"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/LinkedList.ts"],"sourcesContent":["import FIFO from 'fifo';\n\nexport default class LinkedList<T> {\n  private fifo = new FIFO<T>();\n\n  get length() {\n    return this.fifo.length;\n  }\n  last(): T {\n    return this.fifo.last();\n  }\n  pop(): T {\n    return this.fifo.pop() as T;\n  }\n  push(value: T): LinkedList<T> {\n    this.fifo.push(value);\n    return this;\n  }\n  remove(value: T): boolean {\n    for (let node = this.fifo.node; node; node = this.fifo.next(node)) {\n      if (node.value === value) {\n        this.fifo.remove(node);\n        return true;\n      }\n    }\n    return false;\n  }\n}\n"],"names":["FIFO","LinkedList","length","fifo","last","pop","push","value","remove","node","next"],"mappings":"AAAA,OAAOA,UAAU,OAAO;AAET,IAAA,AAAMC,aAAN,MAAMA;IAGnB,IAAIC,SAAS;QACX,OAAO,IAAI,CAACC,IAAI,CAACD,MAAM;IACzB;IACAE,OAAU;QACR,OAAO,IAAI,CAACD,IAAI,CAACC,IAAI;IACvB;IACAC,MAAS;QACP,OAAO,IAAI,CAACF,IAAI,CAACE,GAAG;IACtB;IACAC,KAAKC,KAAQ,EAAiB;QAC5B,IAAI,CAACJ,IAAI,CAACG,IAAI,CAACC;QACf,OAAO,IAAI;IACb;IACAC,OAAOD,KAAQ,EAAW;QACxB,IAAK,IAAIE,OAAO,IAAI,CAACN,IAAI,CAACM,IAAI,EAAEA,MAAMA,OAAO,IAAI,CAACN,IAAI,CAACO,IAAI,CAACD,MAAO;YACjE,IAAIA,KAAKF,KAAK,KAAKA,OAAO;gBACxB,IAAI,CAACJ,IAAI,CAACK,MAAM,CAACC;gBACjB,OAAO;YACT;QACF;QACA,OAAO;IACT;;aAvBQN,OAAO,IAAIH;;AAwBrB;AAzBA,SAAqBC,wBAyBpB"}

dist/esm/processOrQueue.js

@@ -10,3 +10,3 @@ import compat from 'async-compat';
     if (!iterator.stack.length) {
-        iterator.queued.unshift(callback);
+        iterator.queued.push(callback);
         return;
@@ -20,4 +20,3 @@ }
         asap(()=>{
-            // done is based on stack being empty and not error state as the user may choose to skip the error
-            iterator.processing.removeValue(callback);
+            iterator.processing.remove(callback);
             if (iterator.done) return callback(null, null); // early exit
@@ -24,0 +23,0 @@ if (err && compat.defaultValue(iterator.options.error(err), true)) err = null; // skip error

dist/esm/processOrQueue.js.map

@@ -1,1 +0,1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/processOrQueue.ts"],"sourcesContent":["import compat from 'async-compat';\n\nimport asap from 'asap';\n\nimport type { AbstractIterator, ProcessCallback } from './types.js';\n\nexport default function processOrQueue<T>(iterator: AbstractIterator<T>, callback: ProcessCallback<T>): undefined {\n  if (iterator.done) {\n    callback(null, null);\n    return;\n  }\n\n  // nothing to process so queue\n  if (!iterator.stack.length) {\n    iterator.queued.unshift(callback);\n    return;\n  }\n\n  // process next\n  const next = iterator.stack.pop();\n  iterator.processing.push(callback);\n  next(iterator, (err?: Error, result?: T): undefined => {\n    // break call stack\n    asap(() => {\n      // done is based on stack being empty and not error state as the user may choose to skip the error\n      iterator.processing.removeValue(callback);\n      if (iterator.done) return callback(null, null); // early exit\n      if (err && compat.defaultValue(iterator.options.error(err), true)) err = null; // skip error\n\n      const done = iterator.stack.length <= 0 && iterator.processing.length <= 0;\n      !done && !err && !result ? processOrQueue<T>(iterator, callback) : callback(err, result || null);\n      if (done && !iterator.done) iterator.end(); // end\n    });\n  });\n}\n"],"names":["compat","asap","processOrQueue","iterator","callback","done","stack","length","queued","unshift","next","pop","processing","push","err","result","removeValue","defaultValue","options","error","end"],"mappings":"AAAA,OAAOA,YAAY,eAAe;AAElC,OAAOC,UAAU,OAAO;AAIxB,eAAe,SAASC,eAAkBC,QAA6B,EAAEC,QAA4B;IACnG,IAAID,SAASE,IAAI,EAAE;QACjBD,SAAS,MAAM;QACf;IACF;IAEA,8BAA8B;IAC9B,IAAI,CAACD,SAASG,KAAK,CAACC,MAAM,EAAE;QAC1BJ,SAASK,MAAM,CAACC,OAAO,CAACL;QACxB;IACF;IAEA,eAAe;IACf,MAAMM,OAAOP,SAASG,KAAK,CAACK,GAAG;IAC/BR,SAASS,UAAU,CAACC,IAAI,CAACT;IACzBM,KAAKP,UAAU,CAACW,KAAaC;QAC3B,mBAAmB;QACnBd,KAAK;YACH,kGAAkG;YAClGE,SAASS,UAAU,CAACI,WAAW,CAACZ;YAChC,IAAID,SAASE,IAAI,EAAE,OAAOD,SAAS,MAAM,OAAO,aAAa;YAC7D,IAAIU,OAAOd,OAAOiB,YAAY,CAACd,SAASe,OAAO,CAACC,KAAK,CAACL,MAAM,OAAOA,MAAM,MAAM,aAAa;YAE5F,MAAMT,OAAOF,SAASG,KAAK,CAACC,MAAM,IAAI,KAAKJ,SAASS,UAAU,CAACL,MAAM,IAAI;YACzE,CAACF,QAAQ,CAACS,OAAO,CAACC,SAASb,eAAkBC,UAAUC,YAAYA,SAASU,KAAKC,UAAU;YAC3F,IAAIV,QAAQ,CAACF,SAASE,IAAI,EAAEF,SAASiB,GAAG,IAAI,MAAM;QACpD;IACF;AACF"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/processOrQueue.ts"],"sourcesContent":["import compat from 'async-compat';\n\nimport asap from 'asap';\n\nimport type { AbstractIterator, ProcessCallback } from './types.js';\n\nexport default function processOrQueue<T>(iterator: AbstractIterator<T>, callback: ProcessCallback<T>): undefined {\n  if (iterator.done) {\n    callback(null, null);\n    return;\n  }\n\n  // nothing to process so queue\n  if (!iterator.stack.length) {\n    iterator.queued.push(callback);\n    return;\n  }\n\n  // process next\n  const next = iterator.stack.pop();\n  iterator.processing.push(callback);\n  next(iterator, (err?: Error, result?: T): undefined => {\n    // break call stack\n    asap(() => {\n      iterator.processing.remove(callback);\n      if (iterator.done) return callback(null, null); // early exit\n      if (err && compat.defaultValue(iterator.options.error(err), true)) err = null; // skip error\n\n      const done = iterator.stack.length <= 0 && iterator.processing.length <= 0;\n      !done && !err && !result ? processOrQueue<T>(iterator, callback) : callback(err, result || null);\n      if (done && !iterator.done) iterator.end(); // end\n    });\n  });\n}\n"],"names":["compat","asap","processOrQueue","iterator","callback","done","stack","length","queued","push","next","pop","processing","err","result","remove","defaultValue","options","error","end"],"mappings":"AAAA,OAAOA,YAAY,eAAe;AAElC,OAAOC,UAAU,OAAO;AAIxB,eAAe,SAASC,eAAkBC,QAA6B,EAAEC,QAA4B;IACnG,IAAID,SAASE,IAAI,EAAE;QACjBD,SAAS,MAAM;QACf;IACF;IAEA,8BAA8B;IAC9B,IAAI,CAACD,SAASG,KAAK,CAACC,MAAM,EAAE;QAC1BJ,SAASK,MAAM,CAACC,IAAI,CAACL;QACrB;IACF;IAEA,eAAe;IACf,MAAMM,OAAOP,SAASG,KAAK,CAACK,GAAG;IAC/BR,SAASS,UAAU,CAACH,IAAI,CAACL;IACzBM,KAAKP,UAAU,CAACU,KAAaC;QAC3B,mBAAmB;QACnBb,KAAK;YACHE,SAASS,UAAU,CAACG,MAAM,CAACX;YAC3B,IAAID,SAASE,IAAI,EAAE,OAAOD,SAAS,MAAM,OAAO,aAAa;YAC7D,IAAIS,OAAOb,OAAOgB,YAAY,CAACb,SAASc,OAAO,CAACC,KAAK,CAACL,MAAM,OAAOA,MAAM,MAAM,aAAa;YAE5F,MAAMR,OAAOF,SAASG,KAAK,CAACC,MAAM,IAAI,KAAKJ,SAASS,UAAU,CAACL,MAAM,IAAI;YACzE,CAACF,QAAQ,CAACQ,OAAO,CAACC,SAASZ,eAAkBC,UAAUC,YAAYA,SAASS,KAAKC,UAAU;YAC3F,IAAIT,QAAQ,CAACF,SAASE,IAAI,EAAEF,SAASgB,GAAG,IAAI,MAAM;QACpD;IACF;AACF"}

dist/esm/types.d.ts

@@ -31,5 +31,5 @@ import type LinkedList from './LinkedList.js';
     done: boolean;
-    stack: LinkedList<StackFunction<T>>;
+    stack: StackFunction<T>[];
+    queued: ProcessCallback<T>[];
     processors: LinkedList<Processor>;
-    queued: LinkedList<ProcessCallback<T>>;
     processing: LinkedList<ProcessCallback<T>>;
@@ -36,0 +36,0 @@ options: StackOptions;

dist/esm/types.js.map

@@ -1,1 +0,1 @@
-{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/types.ts"],"sourcesContent":["import type LinkedList from './LinkedList.js';\n\nexport type ProcessCallback<T> = (error?: Error, value?: T | null) => undefined;\nexport type NextCallback<T> = (error?: Error, value?: T | null) => undefined;\nexport type Processor = (doneOrError?: Error | boolean) => undefined;\n\nexport type EachDoneCallback = (error?: Error, value?: boolean) => undefined;\nexport type EachCallback<T> = (value: T, callback: EachDoneCallback) => undefined;\nexport type EachPromise<T> = (value: T) => Promise<boolean | undefined>;\nexport type EachFunction<T> = EachCallback<T> | EachPromise<T>;\n\nexport type ValueCallback<T> = (error?: Error, value?: T) => boolean;\nexport type Next<T> = (callback: ProcessCallback<T>) => undefined;\n\nexport interface StackOptions {\n  error?: (err: NodeJS.ErrnoException) => boolean;\n}\n\nexport interface ForEachOptions {\n  error?: (err: NodeJS.ErrnoException) => boolean;\n  callbacks?: boolean;\n  concurrency?: number;\n  limit?: number;\n}\n\nexport interface ProcessorOptions<T> extends ForEachOptions {\n  each: EachFunction<T>;\n  counter: number;\n  total: number;\n  stop: (count?: number) => boolean;\n  done?: boolean;\n  err?: Error;\n}\n\nexport type StackFunction<T> = (iterator: AbstractIterator<T>, callback: ValueCallback<T>) => void;\n\nexport interface AbstractIterator<T> {\n  done: boolean;\n  stack: LinkedList<StackFunction<T>>;\n  processors: LinkedList<Processor>;\n  queued: LinkedList<ProcessCallback<T>>;\n  processing: LinkedList<ProcessCallback<T>>;\n  options: StackOptions;\n  end: () => undefined;\n}\n"],"names":[],"mappings":"AAoCA,WAQC"}
+{"version":3,"sources":["/Users/kevin/Dev/OpenSource/iterators/stack-base-iterator/src/types.ts"],"sourcesContent":["import type LinkedList from './LinkedList.js';\n\nexport type ProcessCallback<T> = (error?: Error, value?: T | null) => undefined;\nexport type NextCallback<T> = (error?: Error, value?: T | null) => undefined;\nexport type Processor = (doneOrError?: Error | boolean) => undefined;\n\nexport type EachDoneCallback = (error?: Error, value?: boolean) => undefined;\nexport type EachCallback<T> = (value: T, callback: EachDoneCallback) => undefined;\nexport type EachPromise<T> = (value: T) => Promise<boolean | undefined>;\nexport type EachFunction<T> = EachCallback<T> | EachPromise<T>;\n\nexport type ValueCallback<T> = (error?: Error, value?: T) => boolean;\nexport type Next<T> = (callback: ProcessCallback<T>) => undefined;\n\nexport interface StackOptions {\n  error?: (err: NodeJS.ErrnoException) => boolean;\n}\n\nexport interface ForEachOptions {\n  error?: (err: NodeJS.ErrnoException) => boolean;\n  callbacks?: boolean;\n  concurrency?: number;\n  limit?: number;\n}\n\nexport interface ProcessorOptions<T> extends ForEachOptions {\n  each: EachFunction<T>;\n  counter: number;\n  total: number;\n  stop: (count?: number) => boolean;\n  done?: boolean;\n  err?: Error;\n}\n\nexport type StackFunction<T> = (iterator: AbstractIterator<T>, callback: ValueCallback<T>) => void;\n\nexport interface AbstractIterator<T> {\n  done: boolean;\n  stack: StackFunction<T>[];\n  queued: ProcessCallback<T>[];\n  processors: LinkedList<Processor>;\n  processing: LinkedList<ProcessCallback<T>>;\n  options: StackOptions;\n  end: () => undefined;\n}\n"],"names":[],"mappings":"AAoCA,WAQC"}

package.json

 {
   "name": "stack-base-iterator",
-  "version": "1.2.24",
+  "version": "1.2.25",
   "description": "Base iterator for values retrieved using a stack of async functions returning values",
@@ -5,0 +5,0 @@ "keywords": [

No alert changes

Worsened metrics

Total package byte prevSize

79087

-1.88%

Lines of code

835

-3.91%

No dependency changes