@panyam/tsutils 0.0.61 → 0.0.62

package/lib/cjs/list.d.ts

@@ -23,12 +23,12 @@ export declare class ValueList<V extends ListNode<V>> {
     get last(): Nullable<V>;
     reversedValues(): Generator<V>;
     values(): Generator<V>;
-    popBack(): V;
-    popFront(): V;
     add(child: V, before?: Nullable<V>): this;
     pushFront(value: V): this;
-    push(value: V): this;
+    pushBack(value: V): this;
     remove(child: V): this;
+    popBack(): V;
+    popFront(): V;
 }
 export declare class List<V> {
     private container;

package/lib/cjs/list.js

@@ -14,7 +14,7 @@ class ValueList {
         this._lastChild = null;
         this._size = 0;
         for (const v of values)
-            this.push(v);
+            this.pushBack(v);
     }
     toJSON() {
         return Array.from(this.values());
@@ -69,38 +69,6 @@ class ValueList {
             tmp = tmp.nextSibling;
         }
     }
-    popBack() {
-        if (this._lastChild == null) {
-            throw new Error("No children");
-        }
-        const out = this._lastChild;
-        const prev = this._lastChild.prevSibling;
-        this._size--;
-        if (prev == null) {
-            this._firstChild = this._lastChild = null;
-        }
-        else {
-            prev.nextSibling = null;
-            this._lastChild = prev;
-        }
-        return out;
-    }
-    popFront() {
-        if (this._firstChild == null) {
-            throw new Error("No children");
-        }
-        const out = this._firstChild;
-        const next = this._firstChild.nextSibling;
-        this._size--;
-        if (next == null) {
-            this._firstChild = this._lastChild = null;
-        }
-        else {
-            next.prevSibling = null;
-            this._firstChild = next;
-        }
-        return out;
-    }
     add(child, before = null) {
         if (child.nextSibling != null || child.prevSibling != null) {
             throw new Error("New node already added to a list.  Remove it first");
@@ -136,7 +104,7 @@ class ValueList {
     pushFront(value) {
         return this.add(value, this._firstChild);
     }
-    push(value) {
+    pushBack(value) {
         return this.add(value);
     }
     remove(child) {
@@ -163,6 +131,22 @@ class ValueList {
         child.prevSibling = child.nextSibling = null;
         return this;
     }
+    popBack() {
+        if (this._lastChild == null) {
+            throw new Error("No children");
+        }
+        const out = this._lastChild;
+        this.remove(out);
+        return out;
+    }
+    popFront() {
+        if (this._firstChild == null) {
+            throw new Error("No children");
+        }
+        const out = this._firstChild;
+        this.remove(out);
+        return out;
+    }
 }
 exports.ValueList = ValueList;
 class List {

package/lib/cjs/list.js.map

@@ -1 +1 @@
-{"version":3,"file":"list.js","sourceRoot":"","sources":["../../src/list.ts"],"names":[],"mappings":";;;AAOA,MAAM,eAAe;IAGnB,YAAmB,KAAQ;QAAR,UAAK,GAAL,KAAK,CAAG;QAF3B,gBAAW,GAAiC,IAAI,CAAC;QACjD,gBAAW,GAAiC,IAAI,CAAC;IACnB,CAAC;CAChC;AAMD,MAAa,SAAS;IAKpB,YAAY,GAAG,MAAW;QAJhB,gBAAW,GAAgB,IAAI,CAAC;QAChC,eAAU,GAAgB,IAAI,CAAC;QAC/B,UAAK,GAAG,CAAC,CAAC;QAGlB,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,MAAiC;QACvC,IAAI,GAAG,GAAa,IAAI,CAAC,WAAW,CAAC;QACrC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE;gBACxB,MAAM;aACP;YACD,KAAK,EAAE,CAAC;YACR,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,CAAC,OAAqB,EAAE,OAAsC;QAClE,IAAI,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAC5C,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,IAAI,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC;QACzB,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE;YAClF,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE;gBACvB,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;IACrC,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAKD,CAAC,cAAc;QACb,IAAI,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAC1B,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,MAAM,GAAG,CAAC;YACV,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;IACH,CAAC;IAKD,CAAC,MAAM;QACL,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,MAAM,GAAG,CAAC;YACV,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;IACH,CAAC;IAED,OAAO;QACL,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE;YAC3B,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;SAChC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC;QACzC,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SAC3C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SACxB;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,QAAQ;QACN,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,EAAE;YAC5B,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;SAChC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;QAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SAC3C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SACzB;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,GAAG,CAAC,KAAQ,EAAE,SAAsB,IAAI;QAEtC,IAAI,KAAK,CAAC,WAAW,IAAI,IAAI,IAAI,KAAK,CAAC,WAAW,IAAI,IAAI,EAAE;YAC1D,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;SACvE;QACD,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;QAC7C,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE;YACvD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;SAC5C;aAAM,IAAI,MAAM,IAAI,IAAI,EAAE;YACzB,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC;YACpC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC,UAAU,CAAC,WAAW,GAAG,KAAK,CAAC;YACpC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;SACzB;aAAM,IAAI,MAAM,IAAI,IAAI,CAAC,WAAW,EAAE;YACrC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC;YAC3B,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC,WAAW,CAAC,WAAW,GAAG,KAAK,CAAC;YACrC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;SAC1B;aAAM;YACL,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC;YAChC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC;YAC3B,MAAM,CAAC,WAAW,GAAG,KAAK,CAAC;YAC3B,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,IAAI,IAAI,IAAI,EAAE;gBAChB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;aAC1B;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,KAAQ;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAC3C,CAAC;IAED,IAAI,CAAC,KAAQ;QACX,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAQD,MAAM,CAAC,KAAQ;QACb,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC;QAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC;QAE/B,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,IAAI,IAAI,IAAI,IAAI;gBAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SAC3C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SACzB;QAED,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,IAAI,IAAI,IAAI,IAAI;gBAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SAC1C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SACzB;QAED,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;YAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAE/C,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAhLD,8BAgLC;AAOD,MAAa,IAAI;IAGf,YAAY,GAAG,MAAW;QACxB,IAAI,CAAC,SAAS,GAAG,IAAI,SAAS,EAAsB,CAAC;QACrD,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,MAAiC;QACvC,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,CAAC,OAAgB,EAAE,OAAsC;QAC7D,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACvF,CAAC;IAED,IAAI,CAAC,MAAS;QACZ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YACvC,IAAI,MAAM,IAAI,CAAC,CAAC,KAAK,EAAE;gBACrB,OAAO,CAAC,CAAC;aACV;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;IAChC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC7B,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;IAC9B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC7B,CAAC;IAKD,CAAC,cAAc;QACb,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,cAAc,EAAE;YAAE,MAAM,CAAC,CAAC,KAAK,CAAC;IACjE,CAAC;IAKD,CAAC,MAAM;QACL,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YAAE,MAAM,CAAC,CAAC,KAAK,CAAC;IACzD,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC;IACxC,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC;IACzC,CAAC;IAED,SAAS,CAAC,KAAQ;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,IAAI,CAAC,KAAQ;QACX,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,KAAQ,EAAE,SAAuC,IAAI;QACvD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AA/ED,oBA+EC","sourcesContent":["import { Nullable } from \"./types\";\n\nexport interface ListNode<V> {\n  nextSibling: Nullable<V>;\n  prevSibling: Nullable<V>;\n}\n\nclass MutableListNode<V> implements ListNode<MutableListNode<V>> {\n  nextSibling: Nullable<MutableListNode<V>> = null;\n  prevSibling: Nullable<MutableListNode<V>> = null;\n  constructor(public value: V) {}\n}\n\n/**\n * A list implementation where the value itself contains next and prev pointers\n * so we do not need to create wrapper classes.\n */\nexport class ValueList<V extends ListNode<V>> {\n  protected _firstChild: Nullable<V> = null;\n  protected _lastChild: Nullable<V> = null;\n  protected _size = 0;\n\n  constructor(...values: V[]) {\n    for (const v of values) this.push(v);\n  }\n\n  toJSON(): V[] {\n    return Array.from(this.values());\n  }\n\n  forEach(method: (val: V) => boolean | any): number {\n    let tmp: V | null = this._firstChild;\n    let count = 0;\n    while (tmp != null) {\n      if (method(tmp) == false) {\n        break;\n      }\n      count++;\n      tmp = tmp.nextSibling;\n    }\n    return count;\n  }\n\n  equals(another: ValueList<V>, eqlFunc: (val1: V, val2: V) => boolean): boolean {\n    if (this.size != another.size) return false;\n    let tmp = this.first;\n    let tmp2 = another.first;\n    for (; tmp != null && tmp2 != null; tmp = tmp.nextSibling, tmp2 = tmp2.nextSibling) {\n      if (!eqlFunc(tmp, tmp2)) {\n        return false;\n      }\n    }\n    return tmp == null && tmp2 == null;\n  }\n\n  get isEmpty(): boolean {\n    return this._size == 0;\n  }\n\n  get size(): number {\n    return this._size;\n  }\n\n  get first(): Nullable<V> {\n    return this._firstChild;\n  }\n\n  get last(): Nullable<V> {\n    return this._lastChild;\n  }\n\n  /**\n   * Generator of values in reverse order.\n   */\n  *reversedValues(): Generator<V> {\n    let tmp = this._lastChild;\n    while (tmp != null) {\n      yield tmp;\n      tmp = tmp.prevSibling;\n    }\n  }\n\n  /**\n   * Generator of values in forward order.\n   */\n  *values(): Generator<V> {\n    let tmp = this._firstChild;\n    while (tmp != null) {\n      yield tmp;\n      tmp = tmp.nextSibling;\n    }\n  }\n\n  popBack(): V {\n    if (this._lastChild == null) {\n      throw new Error(\"No children\");\n    }\n    const out = this._lastChild;\n    const prev = this._lastChild.prevSibling;\n    this._size--;\n    if (prev == null) {\n      this._firstChild = this._lastChild = null;\n    } else {\n      prev.nextSibling = null;\n      this._lastChild = prev;\n    }\n    return out;\n  }\n\n  popFront(): V {\n    if (this._firstChild == null) {\n      throw new Error(\"No children\");\n    }\n    const out = this._firstChild;\n    const next = this._firstChild.nextSibling;\n    this._size--;\n    if (next == null) {\n      this._firstChild = this._lastChild = null;\n    } else {\n      next.prevSibling = null;\n      this._firstChild = next;\n    }\n    return out;\n  }\n\n  add(child: V, before: Nullable<V> = null): this {\n    // Ensure that this node is not added anywhere else\n    if (child.nextSibling != null || child.prevSibling != null) {\n      throw new Error(\"New node already added to a list.  Remove it first\");\n    }\n    child.nextSibling = child.prevSibling = null;\n    this._size++;\n    if (this._firstChild == null || this._lastChild == null) {\n      this._firstChild = this._lastChild = child;\n    } else if (before == null) {\n      child.prevSibling = this._lastChild;\n      child.nextSibling = null;\n      this._lastChild.nextSibling = child;\n      this._lastChild = child;\n    } else if (before == this._firstChild) {\n      child.nextSibling = before;\n      child.prevSibling = null;\n      this._firstChild.prevSibling = child;\n      this._firstChild = child;\n    } else {\n      const prev = before.prevSibling;\n      child.nextSibling = before;\n      before.prevSibling = child;\n      child.prevSibling = prev;\n      if (prev != null) {\n        prev.nextSibling = child;\n      }\n    }\n    return this;\n  }\n\n  pushFront(value: V): this {\n    return this.add(value, this._firstChild);\n  }\n\n  push(value: V): this {\n    return this.add(value);\n  }\n\n  /**\n   * Removes a child node from this list.\n   * It is upto the caller to ensure that this node indeed belongs\n   * to this list otherwise deletion of a non belonging node could result\n   * in undefined behaviour.\n   */\n  remove(child: V): this {\n    const next = child.nextSibling;\n    const prev = child.prevSibling;\n\n    if (next == null) {\n      this._lastChild = prev;\n      if (prev == null) this._firstChild = null;\n    } else {\n      next.prevSibling = prev;\n    }\n\n    if (prev == null) {\n      this._firstChild = next;\n      if (next == null) this._lastChild = null;\n    } else {\n      prev.nextSibling = next;\n    }\n\n    if (next != null || prev != null) this._size--;\n\n    child.prevSibling = child.nextSibling = null;\n    return this;\n  }\n}\n\n/**\n * A list implementation where the values themselves need to be wrapper in a list node.\n * If values already have sibling node properties they can be direclty used\n * via ValueLists.\n */\nexport class List<V> {\n  private container: ValueList<MutableListNode<V>>;\n\n  constructor(...values: V[]) {\n    this.container = new ValueList<MutableListNode<V>>();\n    for (const v of values) this.push(v);\n  }\n\n  toJSON(): V[] {\n    return Array.from(this.values());\n  }\n\n  forEach(method: (val: V) => boolean | any): number {\n    return this.container.forEach((v) => method(v.value));\n  }\n\n  equals(another: List<V>, eqlFunc: (val1: V, val2: V) => boolean): boolean {\n    return this.container.equals(another.container, (a, b) => eqlFunc(a.value, b.value));\n  }\n\n  find(target: V): Nullable<MutableListNode<V>> {\n    for (const v of this.container.values()) {\n      if (target == v.value) {\n        return v;\n      }\n    }\n    return null;\n  }\n\n  get isEmpty(): boolean {\n    return this.container.isEmpty;\n  }\n\n  get size(): number {\n    return this.container.size;\n  }\n\n  get first(): Nullable<MutableListNode<V>> {\n    return this.container.first;\n  }\n\n  get last(): Nullable<MutableListNode<V>> {\n    return this.container.last;\n  }\n\n  /**\n   * Generator of values in reverse order.\n   */\n  *reversedValues(): Generator<V> {\n    for (const v of this.container.reversedValues()) yield v.value;\n  }\n\n  /**\n   * Generator of values in forward order.\n   */\n  *values(): Generator<V> {\n    for (const v of this.container.values()) yield v.value;\n  }\n\n  popBack(): V {\n    return this.container.popBack().value;\n  }\n\n  popFront(): V {\n    return this.container.popFront().value;\n  }\n\n  pushFront(value: V): this {\n    return this.add(value, this.container.first);\n  }\n\n  push(value: V): this {\n    return this.add(value);\n  }\n\n  add(child: V, before: Nullable<MutableListNode<V>> = null): this {\n    this.container.add(new MutableListNode(child), before);\n    return this;\n  }\n}\n"]}
+{"version":3,"file":"list.js","sourceRoot":"","sources":["../../src/list.ts"],"names":[],"mappings":";;;AAOA,MAAM,eAAe;IAGnB,YAAmB,KAAQ;QAAR,UAAK,GAAL,KAAK,CAAG;QAF3B,gBAAW,GAAiC,IAAI,CAAC;QACjD,gBAAW,GAAiC,IAAI,CAAC;IACnB,CAAC;CAChC;AAMD,MAAa,SAAS;IAKpB,YAAY,GAAG,MAAW;QAJhB,gBAAW,GAAgB,IAAI,CAAC;QAChC,eAAU,GAAgB,IAAI,CAAC;QAC/B,UAAK,GAAG,CAAC,CAAC;QAGlB,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,MAAiC;QACvC,IAAI,GAAG,GAAa,IAAI,CAAC,WAAW,CAAC;QACrC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE;gBACxB,MAAM;aACP;YACD,KAAK,EAAE,CAAC;YACR,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,CAAC,OAAqB,EAAE,OAAsC;QAClE,IAAI,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAC5C,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,IAAI,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC;QACzB,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE;YAClF,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE;gBACvB,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;IACrC,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAKD,CAAC,cAAc;QACb,IAAI,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAC1B,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,MAAM,GAAG,CAAC;YACV,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;IACH,CAAC;IAKD,CAAC,MAAM;QACL,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,MAAM,GAAG,CAAC;YACV,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;IACH,CAAC;IAED,GAAG,CAAC,KAAQ,EAAE,SAAsB,IAAI;QAEtC,IAAI,KAAK,CAAC,WAAW,IAAI,IAAI,IAAI,KAAK,CAAC,WAAW,IAAI,IAAI,EAAE;YAC1D,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;SACvE;QACD,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;QAC7C,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE;YACvD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;SAC5C;aAAM,IAAI,MAAM,IAAI,IAAI,EAAE;YACzB,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC;YACpC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC,UAAU,CAAC,WAAW,GAAG,KAAK,CAAC;YACpC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;SACzB;aAAM,IAAI,MAAM,IAAI,IAAI,CAAC,WAAW,EAAE;YACrC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC;YAC3B,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC,WAAW,CAAC,WAAW,GAAG,KAAK,CAAC;YACrC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;SAC1B;aAAM;YACL,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC;YAChC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC;YAC3B,MAAM,CAAC,WAAW,GAAG,KAAK,CAAC;YAC3B,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,IAAI,IAAI,IAAI,EAAE;gBAChB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;aAC1B;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,KAAQ;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAC3C,CAAC;IAED,QAAQ,CAAC,KAAQ;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAQD,MAAM,CAAC,KAAQ;QACb,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC;QAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC;QAE/B,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,IAAI,IAAI,IAAI,IAAI;gBAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SAC3C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SACzB;QAED,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,IAAI,IAAI,IAAI,IAAI;gBAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SAC1C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SACzB;QAED,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;YAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAE/C,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE;YAC3B,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;SAChC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,OAAO,GAAG,CAAC;IACb,CAAC;IAED,QAAQ;QACN,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,EAAE;YAC5B,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;SAChC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAlKD,8BAkKC;AAOD,MAAa,IAAI;IAGf,YAAY,GAAG,MAAW;QACxB,IAAI,CAAC,SAAS,GAAG,IAAI,SAAS,EAAsB,CAAC;QACrD,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,MAAiC;QACvC,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,CAAC,OAAgB,EAAE,OAAsC;QAC7D,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACvF,CAAC;IAED,IAAI,CAAC,MAAS;QACZ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YACvC,IAAI,MAAM,IAAI,CAAC,CAAC,KAAK,EAAE;gBACrB,OAAO,CAAC,CAAC;aACV;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;IAChC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC7B,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;IAC9B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC7B,CAAC;IAKD,CAAC,cAAc;QACb,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,cAAc,EAAE;YAAE,MAAM,CAAC,CAAC,KAAK,CAAC;IACjE,CAAC;IAKD,CAAC,MAAM;QACL,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YAAE,MAAM,CAAC,CAAC,KAAK,CAAC;IACzD,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC;IACxC,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC;IACzC,CAAC;IAED,SAAS,CAAC,KAAQ;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,IAAI,CAAC,KAAQ;QACX,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,KAAQ,EAAE,SAAuC,IAAI;QACvD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AA/ED,oBA+EC","sourcesContent":["import { Nullable } from \"./types\";\n\nexport interface ListNode<V> {\n  nextSibling: Nullable<V>;\n  prevSibling: Nullable<V>;\n}\n\nclass MutableListNode<V> implements ListNode<MutableListNode<V>> {\n  nextSibling: Nullable<MutableListNode<V>> = null;\n  prevSibling: Nullable<MutableListNode<V>> = null;\n  constructor(public value: V) {}\n}\n\n/**\n * A list implementation where the value itself contains next and prev pointers\n * so we do not need to create wrapper classes.\n */\nexport class ValueList<V extends ListNode<V>> {\n  protected _firstChild: Nullable<V> = null;\n  protected _lastChild: Nullable<V> = null;\n  protected _size = 0;\n\n  constructor(...values: V[]) {\n    for (const v of values) this.pushBack(v);\n  }\n\n  toJSON(): V[] {\n    return Array.from(this.values());\n  }\n\n  forEach(method: (val: V) => boolean | any): number {\n    let tmp: V | null = this._firstChild;\n    let count = 0;\n    while (tmp != null) {\n      if (method(tmp) == false) {\n        break;\n      }\n      count++;\n      tmp = tmp.nextSibling;\n    }\n    return count;\n  }\n\n  equals(another: ValueList<V>, eqlFunc: (val1: V, val2: V) => boolean): boolean {\n    if (this.size != another.size) return false;\n    let tmp = this.first;\n    let tmp2 = another.first;\n    for (; tmp != null && tmp2 != null; tmp = tmp.nextSibling, tmp2 = tmp2.nextSibling) {\n      if (!eqlFunc(tmp, tmp2)) {\n        return false;\n      }\n    }\n    return tmp == null && tmp2 == null;\n  }\n\n  get isEmpty(): boolean {\n    return this._size == 0;\n  }\n\n  get size(): number {\n    return this._size;\n  }\n\n  get first(): Nullable<V> {\n    return this._firstChild;\n  }\n\n  get last(): Nullable<V> {\n    return this._lastChild;\n  }\n\n  /**\n   * Generator of values in reverse order.\n   */\n  *reversedValues(): Generator<V> {\n    let tmp = this._lastChild;\n    while (tmp != null) {\n      yield tmp;\n      tmp = tmp.prevSibling;\n    }\n  }\n\n  /**\n   * Generator of values in forward order.\n   */\n  *values(): Generator<V> {\n    let tmp = this._firstChild;\n    while (tmp != null) {\n      yield tmp;\n      tmp = tmp.nextSibling;\n    }\n  }\n\n  add(child: V, before: Nullable<V> = null): this {\n    // Ensure that this node is not added anywhere else\n    if (child.nextSibling != null || child.prevSibling != null) {\n      throw new Error(\"New node already added to a list.  Remove it first\");\n    }\n    child.nextSibling = child.prevSibling = null;\n    this._size++;\n    if (this._firstChild == null || this._lastChild == null) {\n      this._firstChild = this._lastChild = child;\n    } else if (before == null) {\n      child.prevSibling = this._lastChild;\n      child.nextSibling = null;\n      this._lastChild.nextSibling = child;\n      this._lastChild = child;\n    } else if (before == this._firstChild) {\n      child.nextSibling = before;\n      child.prevSibling = null;\n      this._firstChild.prevSibling = child;\n      this._firstChild = child;\n    } else {\n      const prev = before.prevSibling;\n      child.nextSibling = before;\n      before.prevSibling = child;\n      child.prevSibling = prev;\n      if (prev != null) {\n        prev.nextSibling = child;\n      }\n    }\n    return this;\n  }\n\n  pushFront(value: V): this {\n    return this.add(value, this._firstChild);\n  }\n\n  pushBack(value: V): this {\n    return this.add(value);\n  }\n\n  /**\n   * Removes a child node from this list.\n   * It is upto the caller to ensure that this node indeed belongs\n   * to this list otherwise deletion of a non belonging node could result\n   * in undefined behaviour.\n   */\n  remove(child: V): this {\n    const next = child.nextSibling;\n    const prev = child.prevSibling;\n\n    if (next == null) {\n      this._lastChild = prev;\n      if (prev == null) this._firstChild = null;\n    } else {\n      next.prevSibling = prev;\n    }\n\n    if (prev == null) {\n      this._firstChild = next;\n      if (next == null) this._lastChild = null;\n    } else {\n      prev.nextSibling = next;\n    }\n\n    if (next != null || prev != null) this._size--;\n\n    child.prevSibling = child.nextSibling = null;\n    return this;\n  }\n\n  popBack(): V {\n    if (this._lastChild == null) {\n      throw new Error(\"No children\");\n    }\n    const out = this._lastChild;\n    this.remove(out);\n    return out;\n  }\n\n  popFront(): V {\n    if (this._firstChild == null) {\n      throw new Error(\"No children\");\n    }\n    const out = this._firstChild;\n    this.remove(out);\n    return out;\n  }\n}\n\n/**\n * A list implementation where the values themselves need to be wrapper in a list node.\n * If values already have sibling node properties they can be direclty used\n * via ValueLists.\n */\nexport class List<V> {\n  private container: ValueList<MutableListNode<V>>;\n\n  constructor(...values: V[]) {\n    this.container = new ValueList<MutableListNode<V>>();\n    for (const v of values) this.push(v);\n  }\n\n  toJSON(): V[] {\n    return Array.from(this.values());\n  }\n\n  forEach(method: (val: V) => boolean | any): number {\n    return this.container.forEach((v) => method(v.value));\n  }\n\n  equals(another: List<V>, eqlFunc: (val1: V, val2: V) => boolean): boolean {\n    return this.container.equals(another.container, (a, b) => eqlFunc(a.value, b.value));\n  }\n\n  find(target: V): Nullable<MutableListNode<V>> {\n    for (const v of this.container.values()) {\n      if (target == v.value) {\n        return v;\n      }\n    }\n    return null;\n  }\n\n  get isEmpty(): boolean {\n    return this.container.isEmpty;\n  }\n\n  get size(): number {\n    return this.container.size;\n  }\n\n  get first(): Nullable<MutableListNode<V>> {\n    return this.container.first;\n  }\n\n  get last(): Nullable<MutableListNode<V>> {\n    return this.container.last;\n  }\n\n  /**\n   * Generator of values in reverse order.\n   */\n  *reversedValues(): Generator<V> {\n    for (const v of this.container.reversedValues()) yield v.value;\n  }\n\n  /**\n   * Generator of values in forward order.\n   */\n  *values(): Generator<V> {\n    for (const v of this.container.values()) yield v.value;\n  }\n\n  popBack(): V {\n    return this.container.popBack().value;\n  }\n\n  popFront(): V {\n    return this.container.popFront().value;\n  }\n\n  pushFront(value: V): this {\n    return this.add(value, this.container.first);\n  }\n\n  push(value: V): this {\n    return this.add(value);\n  }\n\n  add(child: V, before: Nullable<MutableListNode<V>> = null): this {\n    this.container.add(new MutableListNode(child), before);\n    return this;\n  }\n}\n"]}

package/lib/esm/list.d.ts

@@ -23,12 +23,12 @@ export declare class ValueList<V extends ListNode<V>> {
     get last(): Nullable<V>;
     reversedValues(): Generator<V>;
     values(): Generator<V>;
-    popBack(): V;
-    popFront(): V;
     add(child: V, before?: Nullable<V>): this;
     pushFront(value: V): this;
-    push(value: V): this;
+    pushBack(value: V): this;
     remove(child: V): this;
+    popBack(): V;
+    popFront(): V;
 }
 export declare class List<V> {
     private container;

package/lib/esm/list.js

@@ -11,7 +11,7 @@ export class ValueList {
         this._lastChild = null;
         this._size = 0;
         for (const v of values)
-            this.push(v);
+            this.pushBack(v);
     }
     toJSON() {
         return Array.from(this.values());
@@ -66,38 +66,6 @@ export class ValueList {
             tmp = tmp.nextSibling;
         }
     }
-    popBack() {
-        if (this._lastChild == null) {
-            throw new Error("No children");
-        }
-        const out = this._lastChild;
-        const prev = this._lastChild.prevSibling;
-        this._size--;
-        if (prev == null) {
-            this._firstChild = this._lastChild = null;
-        }
-        else {
-            prev.nextSibling = null;
-            this._lastChild = prev;
-        }
-        return out;
-    }
-    popFront() {
-        if (this._firstChild == null) {
-            throw new Error("No children");
-        }
-        const out = this._firstChild;
-        const next = this._firstChild.nextSibling;
-        this._size--;
-        if (next == null) {
-            this._firstChild = this._lastChild = null;
-        }
-        else {
-            next.prevSibling = null;
-            this._firstChild = next;
-        }
-        return out;
-    }
     add(child, before = null) {
         if (child.nextSibling != null || child.prevSibling != null) {
             throw new Error("New node already added to a list.  Remove it first");
@@ -133,7 +101,7 @@ export class ValueList {
     pushFront(value) {
         return this.add(value, this._firstChild);
     }
-    push(value) {
+    pushBack(value) {
         return this.add(value);
     }
     remove(child) {
@@ -160,6 +128,22 @@ export class ValueList {
         child.prevSibling = child.nextSibling = null;
         return this;
     }
+    popBack() {
+        if (this._lastChild == null) {
+            throw new Error("No children");
+        }
+        const out = this._lastChild;
+        this.remove(out);
+        return out;
+    }
+    popFront() {
+        if (this._firstChild == null) {
+            throw new Error("No children");
+        }
+        const out = this._firstChild;
+        this.remove(out);
+        return out;
+    }
 }
 export class List {
     constructor(...values) {

package/lib/esm/list.js.map

@@ -1 +1 @@
-{"version":3,"file":"list.js","sourceRoot":"","sources":["../../src/list.ts"],"names":[],"mappings":"AAOA,MAAM,eAAe;IAGnB,YAAmB,KAAQ;QAAR,UAAK,GAAL,KAAK,CAAG;QAF3B,gBAAW,GAAiC,IAAI,CAAC;QACjD,gBAAW,GAAiC,IAAI,CAAC;IACnB,CAAC;CAChC;AAMD,MAAM,OAAO,SAAS;IAKpB,YAAY,GAAG,MAAW;QAJhB,gBAAW,GAAgB,IAAI,CAAC;QAChC,eAAU,GAAgB,IAAI,CAAC;QAC/B,UAAK,GAAG,CAAC,CAAC;QAGlB,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,MAAiC;QACvC,IAAI,GAAG,GAAa,IAAI,CAAC,WAAW,CAAC;QACrC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE;gBACxB,MAAM;aACP;YACD,KAAK,EAAE,CAAC;YACR,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,CAAC,OAAqB,EAAE,OAAsC;QAClE,IAAI,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAC5C,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,IAAI,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC;QACzB,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE;YAClF,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE;gBACvB,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;IACrC,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAKD,CAAC,cAAc;QACb,IAAI,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAC1B,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,MAAM,GAAG,CAAC;YACV,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;IACH,CAAC;IAKD,CAAC,MAAM;QACL,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,MAAM,GAAG,CAAC;YACV,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;IACH,CAAC;IAED,OAAO;QACL,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE;YAC3B,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;SAChC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC;QACzC,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SAC3C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SACxB;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,QAAQ;QACN,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,EAAE;YAC5B,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;SAChC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC;QAC1C,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SAC3C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SACzB;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,GAAG,CAAC,KAAQ,EAAE,SAAsB,IAAI;QAEtC,IAAI,KAAK,CAAC,WAAW,IAAI,IAAI,IAAI,KAAK,CAAC,WAAW,IAAI,IAAI,EAAE;YAC1D,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;SACvE;QACD,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;QAC7C,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE;YACvD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;SAC5C;aAAM,IAAI,MAAM,IAAI,IAAI,EAAE;YACzB,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC;YACpC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC,UAAU,CAAC,WAAW,GAAG,KAAK,CAAC;YACpC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;SACzB;aAAM,IAAI,MAAM,IAAI,IAAI,CAAC,WAAW,EAAE;YACrC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC;YAC3B,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC,WAAW,CAAC,WAAW,GAAG,KAAK,CAAC;YACrC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;SAC1B;aAAM;YACL,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC;YAChC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC;YAC3B,MAAM,CAAC,WAAW,GAAG,KAAK,CAAC;YAC3B,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,IAAI,IAAI,IAAI,EAAE;gBAChB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;aAC1B;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,KAAQ;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAC3C,CAAC;IAED,IAAI,CAAC,KAAQ;QACX,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAQD,MAAM,CAAC,KAAQ;QACb,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC;QAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC;QAE/B,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,IAAI,IAAI,IAAI,IAAI;gBAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SAC3C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SACzB;QAED,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,IAAI,IAAI,IAAI,IAAI;gBAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SAC1C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SACzB;QAED,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;YAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAE/C,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAOD,MAAM,OAAO,IAAI;IAGf,YAAY,GAAG,MAAW;QACxB,IAAI,CAAC,SAAS,GAAG,IAAI,SAAS,EAAsB,CAAC;QACrD,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,MAAiC;QACvC,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,CAAC,OAAgB,EAAE,OAAsC;QAC7D,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACvF,CAAC;IAED,IAAI,CAAC,MAAS;QACZ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YACvC,IAAI,MAAM,IAAI,CAAC,CAAC,KAAK,EAAE;gBACrB,OAAO,CAAC,CAAC;aACV;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;IAChC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC7B,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;IAC9B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC7B,CAAC;IAKD,CAAC,cAAc;QACb,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,cAAc,EAAE;YAAE,MAAM,CAAC,CAAC,KAAK,CAAC;IACjE,CAAC;IAKD,CAAC,MAAM;QACL,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YAAE,MAAM,CAAC,CAAC,KAAK,CAAC;IACzD,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC;IACxC,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC;IACzC,CAAC;IAED,SAAS,CAAC,KAAQ;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,IAAI,CAAC,KAAQ;QACX,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,KAAQ,EAAE,SAAuC,IAAI;QACvD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC;IACd,CAAC;CACF","sourcesContent":["import { Nullable } from \"./types\";\n\nexport interface ListNode<V> {\n  nextSibling: Nullable<V>;\n  prevSibling: Nullable<V>;\n}\n\nclass MutableListNode<V> implements ListNode<MutableListNode<V>> {\n  nextSibling: Nullable<MutableListNode<V>> = null;\n  prevSibling: Nullable<MutableListNode<V>> = null;\n  constructor(public value: V) {}\n}\n\n/**\n * A list implementation where the value itself contains next and prev pointers\n * so we do not need to create wrapper classes.\n */\nexport class ValueList<V extends ListNode<V>> {\n  protected _firstChild: Nullable<V> = null;\n  protected _lastChild: Nullable<V> = null;\n  protected _size = 0;\n\n  constructor(...values: V[]) {\n    for (const v of values) this.push(v);\n  }\n\n  toJSON(): V[] {\n    return Array.from(this.values());\n  }\n\n  forEach(method: (val: V) => boolean | any): number {\n    let tmp: V | null = this._firstChild;\n    let count = 0;\n    while (tmp != null) {\n      if (method(tmp) == false) {\n        break;\n      }\n      count++;\n      tmp = tmp.nextSibling;\n    }\n    return count;\n  }\n\n  equals(another: ValueList<V>, eqlFunc: (val1: V, val2: V) => boolean): boolean {\n    if (this.size != another.size) return false;\n    let tmp = this.first;\n    let tmp2 = another.first;\n    for (; tmp != null && tmp2 != null; tmp = tmp.nextSibling, tmp2 = tmp2.nextSibling) {\n      if (!eqlFunc(tmp, tmp2)) {\n        return false;\n      }\n    }\n    return tmp == null && tmp2 == null;\n  }\n\n  get isEmpty(): boolean {\n    return this._size == 0;\n  }\n\n  get size(): number {\n    return this._size;\n  }\n\n  get first(): Nullable<V> {\n    return this._firstChild;\n  }\n\n  get last(): Nullable<V> {\n    return this._lastChild;\n  }\n\n  /**\n   * Generator of values in reverse order.\n   */\n  *reversedValues(): Generator<V> {\n    let tmp = this._lastChild;\n    while (tmp != null) {\n      yield tmp;\n      tmp = tmp.prevSibling;\n    }\n  }\n\n  /**\n   * Generator of values in forward order.\n   */\n  *values(): Generator<V> {\n    let tmp = this._firstChild;\n    while (tmp != null) {\n      yield tmp;\n      tmp = tmp.nextSibling;\n    }\n  }\n\n  popBack(): V {\n    if (this._lastChild == null) {\n      throw new Error(\"No children\");\n    }\n    const out = this._lastChild;\n    const prev = this._lastChild.prevSibling;\n    this._size--;\n    if (prev == null) {\n      this._firstChild = this._lastChild = null;\n    } else {\n      prev.nextSibling = null;\n      this._lastChild = prev;\n    }\n    return out;\n  }\n\n  popFront(): V {\n    if (this._firstChild == null) {\n      throw new Error(\"No children\");\n    }\n    const out = this._firstChild;\n    const next = this._firstChild.nextSibling;\n    this._size--;\n    if (next == null) {\n      this._firstChild = this._lastChild = null;\n    } else {\n      next.prevSibling = null;\n      this._firstChild = next;\n    }\n    return out;\n  }\n\n  add(child: V, before: Nullable<V> = null): this {\n    // Ensure that this node is not added anywhere else\n    if (child.nextSibling != null || child.prevSibling != null) {\n      throw new Error(\"New node already added to a list.  Remove it first\");\n    }\n    child.nextSibling = child.prevSibling = null;\n    this._size++;\n    if (this._firstChild == null || this._lastChild == null) {\n      this._firstChild = this._lastChild = child;\n    } else if (before == null) {\n      child.prevSibling = this._lastChild;\n      child.nextSibling = null;\n      this._lastChild.nextSibling = child;\n      this._lastChild = child;\n    } else if (before == this._firstChild) {\n      child.nextSibling = before;\n      child.prevSibling = null;\n      this._firstChild.prevSibling = child;\n      this._firstChild = child;\n    } else {\n      const prev = before.prevSibling;\n      child.nextSibling = before;\n      before.prevSibling = child;\n      child.prevSibling = prev;\n      if (prev != null) {\n        prev.nextSibling = child;\n      }\n    }\n    return this;\n  }\n\n  pushFront(value: V): this {\n    return this.add(value, this._firstChild);\n  }\n\n  push(value: V): this {\n    return this.add(value);\n  }\n\n  /**\n   * Removes a child node from this list.\n   * It is upto the caller to ensure that this node indeed belongs\n   * to this list otherwise deletion of a non belonging node could result\n   * in undefined behaviour.\n   */\n  remove(child: V): this {\n    const next = child.nextSibling;\n    const prev = child.prevSibling;\n\n    if (next == null) {\n      this._lastChild = prev;\n      if (prev == null) this._firstChild = null;\n    } else {\n      next.prevSibling = prev;\n    }\n\n    if (prev == null) {\n      this._firstChild = next;\n      if (next == null) this._lastChild = null;\n    } else {\n      prev.nextSibling = next;\n    }\n\n    if (next != null || prev != null) this._size--;\n\n    child.prevSibling = child.nextSibling = null;\n    return this;\n  }\n}\n\n/**\n * A list implementation where the values themselves need to be wrapper in a list node.\n * If values already have sibling node properties they can be direclty used\n * via ValueLists.\n */\nexport class List<V> {\n  private container: ValueList<MutableListNode<V>>;\n\n  constructor(...values: V[]) {\n    this.container = new ValueList<MutableListNode<V>>();\n    for (const v of values) this.push(v);\n  }\n\n  toJSON(): V[] {\n    return Array.from(this.values());\n  }\n\n  forEach(method: (val: V) => boolean | any): number {\n    return this.container.forEach((v) => method(v.value));\n  }\n\n  equals(another: List<V>, eqlFunc: (val1: V, val2: V) => boolean): boolean {\n    return this.container.equals(another.container, (a, b) => eqlFunc(a.value, b.value));\n  }\n\n  find(target: V): Nullable<MutableListNode<V>> {\n    for (const v of this.container.values()) {\n      if (target == v.value) {\n        return v;\n      }\n    }\n    return null;\n  }\n\n  get isEmpty(): boolean {\n    return this.container.isEmpty;\n  }\n\n  get size(): number {\n    return this.container.size;\n  }\n\n  get first(): Nullable<MutableListNode<V>> {\n    return this.container.first;\n  }\n\n  get last(): Nullable<MutableListNode<V>> {\n    return this.container.last;\n  }\n\n  /**\n   * Generator of values in reverse order.\n   */\n  *reversedValues(): Generator<V> {\n    for (const v of this.container.reversedValues()) yield v.value;\n  }\n\n  /**\n   * Generator of values in forward order.\n   */\n  *values(): Generator<V> {\n    for (const v of this.container.values()) yield v.value;\n  }\n\n  popBack(): V {\n    return this.container.popBack().value;\n  }\n\n  popFront(): V {\n    return this.container.popFront().value;\n  }\n\n  pushFront(value: V): this {\n    return this.add(value, this.container.first);\n  }\n\n  push(value: V): this {\n    return this.add(value);\n  }\n\n  add(child: V, before: Nullable<MutableListNode<V>> = null): this {\n    this.container.add(new MutableListNode(child), before);\n    return this;\n  }\n}\n"]}
+{"version":3,"file":"list.js","sourceRoot":"","sources":["../../src/list.ts"],"names":[],"mappings":"AAOA,MAAM,eAAe;IAGnB,YAAmB,KAAQ;QAAR,UAAK,GAAL,KAAK,CAAG;QAF3B,gBAAW,GAAiC,IAAI,CAAC;QACjD,gBAAW,GAAiC,IAAI,CAAC;IACnB,CAAC;CAChC;AAMD,MAAM,OAAO,SAAS;IAKpB,YAAY,GAAG,MAAW;QAJhB,gBAAW,GAAgB,IAAI,CAAC;QAChC,eAAU,GAAgB,IAAI,CAAC;QAC/B,UAAK,GAAG,CAAC,CAAC;QAGlB,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,MAAiC;QACvC,IAAI,GAAG,GAAa,IAAI,CAAC,WAAW,CAAC;QACrC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,KAAK,EAAE;gBACxB,MAAM;aACP;YACD,KAAK,EAAE,CAAC;YACR,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,MAAM,CAAC,OAAqB,EAAE,OAAsC;QAClE,IAAI,IAAI,CAAC,IAAI,IAAI,OAAO,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAC5C,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,IAAI,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC;QACzB,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC,WAAW,EAAE,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE;YAClF,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE;gBACvB,OAAO,KAAK,CAAC;aACd;SACF;QACD,OAAO,GAAG,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC;IACrC,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAKD,CAAC,cAAc;QACb,IAAI,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAC1B,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,MAAM,GAAG,CAAC;YACV,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;IACH,CAAC;IAKD,CAAC,MAAM;QACL,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3B,OAAO,GAAG,IAAI,IAAI,EAAE;YAClB,MAAM,GAAG,CAAC;YACV,GAAG,GAAG,GAAG,CAAC,WAAW,CAAC;SACvB;IACH,CAAC;IAED,GAAG,CAAC,KAAQ,EAAE,SAAsB,IAAI;QAEtC,IAAI,KAAK,CAAC,WAAW,IAAI,IAAI,IAAI,KAAK,CAAC,WAAW,IAAI,IAAI,EAAE;YAC1D,MAAM,IAAI,KAAK,CAAC,oDAAoD,CAAC,CAAC;SACvE;QACD,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;QAC7C,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE;YACvD,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;SAC5C;aAAM,IAAI,MAAM,IAAI,IAAI,EAAE;YACzB,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC;YACpC,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC,UAAU,CAAC,WAAW,GAAG,KAAK,CAAC;YACpC,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;SACzB;aAAM,IAAI,MAAM,IAAI,IAAI,CAAC,WAAW,EAAE;YACrC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC;YAC3B,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,CAAC,WAAW,CAAC,WAAW,GAAG,KAAK,CAAC;YACrC,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;SAC1B;aAAM;YACL,MAAM,IAAI,GAAG,MAAM,CAAC,WAAW,CAAC;YAChC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC;YAC3B,MAAM,CAAC,WAAW,GAAG,KAAK,CAAC;YAC3B,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;YACzB,IAAI,IAAI,IAAI,IAAI,EAAE;gBAChB,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;aAC1B;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,SAAS,CAAC,KAAQ;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAC3C,CAAC;IAED,QAAQ,CAAC,KAAQ;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAQD,MAAM,CAAC,KAAQ;QACb,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC;QAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,WAAW,CAAC;QAE/B,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,IAAI,IAAI,IAAI,IAAI;gBAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SAC3C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SACzB;QAED,IAAI,IAAI,IAAI,IAAI,EAAE;YAChB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YACxB,IAAI,IAAI,IAAI,IAAI;gBAAE,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;SAC1C;aAAM;YACL,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;SACzB;QAED,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;YAAE,IAAI,CAAC,KAAK,EAAE,CAAC;QAE/C,KAAK,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,GAAG,IAAI,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO;QACL,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,EAAE;YAC3B,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;SAChC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC;QAC5B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,OAAO,GAAG,CAAC;IACb,CAAC;IAED,QAAQ;QACN,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,EAAE;YAC5B,MAAM,IAAI,KAAK,CAAC,aAAa,CAAC,CAAC;SAChC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACjB,OAAO,GAAG,CAAC;IACb,CAAC;CACF;AAOD,MAAM,OAAO,IAAI;IAGf,YAAY,GAAG,MAAW;QACxB,IAAI,CAAC,SAAS,GAAG,IAAI,SAAS,EAAsB,CAAC;QACrD,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,CAAC;IAED,MAAM;QACJ,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IACnC,CAAC;IAED,OAAO,CAAC,MAAiC;QACvC,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,CAAC,OAAgB,EAAE,OAAsC;QAC7D,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACvF,CAAC;IAED,IAAI,CAAC,MAAS;QACZ,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE;YACvC,IAAI,MAAM,IAAI,CAAC,CAAC,KAAK,EAAE;gBACrB,OAAO,CAAC,CAAC;aACV;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC;IAChC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC7B,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC;IAC9B,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;IAC7B,CAAC;IAKD,CAAC,cAAc;QACb,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,cAAc,EAAE;YAAE,MAAM,CAAC,CAAC,KAAK,CAAC;IACjE,CAAC;IAKD,CAAC,MAAM;QACL,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YAAE,MAAM,CAAC,CAAC,KAAK,CAAC;IACzD,CAAC;IAED,OAAO;QACL,OAAO,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC;IACxC,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC;IACzC,CAAC;IAED,SAAS,CAAC,KAAQ;QAChB,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC;IAED,IAAI,CAAC,KAAQ;QACX,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,GAAG,CAAC,KAAQ,EAAE,SAAuC,IAAI;QACvD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC;IACd,CAAC;CACF","sourcesContent":["import { Nullable } from \"./types\";\n\nexport interface ListNode<V> {\n  nextSibling: Nullable<V>;\n  prevSibling: Nullable<V>;\n}\n\nclass MutableListNode<V> implements ListNode<MutableListNode<V>> {\n  nextSibling: Nullable<MutableListNode<V>> = null;\n  prevSibling: Nullable<MutableListNode<V>> = null;\n  constructor(public value: V) {}\n}\n\n/**\n * A list implementation where the value itself contains next and prev pointers\n * so we do not need to create wrapper classes.\n */\nexport class ValueList<V extends ListNode<V>> {\n  protected _firstChild: Nullable<V> = null;\n  protected _lastChild: Nullable<V> = null;\n  protected _size = 0;\n\n  constructor(...values: V[]) {\n    for (const v of values) this.pushBack(v);\n  }\n\n  toJSON(): V[] {\n    return Array.from(this.values());\n  }\n\n  forEach(method: (val: V) => boolean | any): number {\n    let tmp: V | null = this._firstChild;\n    let count = 0;\n    while (tmp != null) {\n      if (method(tmp) == false) {\n        break;\n      }\n      count++;\n      tmp = tmp.nextSibling;\n    }\n    return count;\n  }\n\n  equals(another: ValueList<V>, eqlFunc: (val1: V, val2: V) => boolean): boolean {\n    if (this.size != another.size) return false;\n    let tmp = this.first;\n    let tmp2 = another.first;\n    for (; tmp != null && tmp2 != null; tmp = tmp.nextSibling, tmp2 = tmp2.nextSibling) {\n      if (!eqlFunc(tmp, tmp2)) {\n        return false;\n      }\n    }\n    return tmp == null && tmp2 == null;\n  }\n\n  get isEmpty(): boolean {\n    return this._size == 0;\n  }\n\n  get size(): number {\n    return this._size;\n  }\n\n  get first(): Nullable<V> {\n    return this._firstChild;\n  }\n\n  get last(): Nullable<V> {\n    return this._lastChild;\n  }\n\n  /**\n   * Generator of values in reverse order.\n   */\n  *reversedValues(): Generator<V> {\n    let tmp = this._lastChild;\n    while (tmp != null) {\n      yield tmp;\n      tmp = tmp.prevSibling;\n    }\n  }\n\n  /**\n   * Generator of values in forward order.\n   */\n  *values(): Generator<V> {\n    let tmp = this._firstChild;\n    while (tmp != null) {\n      yield tmp;\n      tmp = tmp.nextSibling;\n    }\n  }\n\n  add(child: V, before: Nullable<V> = null): this {\n    // Ensure that this node is not added anywhere else\n    if (child.nextSibling != null || child.prevSibling != null) {\n      throw new Error(\"New node already added to a list.  Remove it first\");\n    }\n    child.nextSibling = child.prevSibling = null;\n    this._size++;\n    if (this._firstChild == null || this._lastChild == null) {\n      this._firstChild = this._lastChild = child;\n    } else if (before == null) {\n      child.prevSibling = this._lastChild;\n      child.nextSibling = null;\n      this._lastChild.nextSibling = child;\n      this._lastChild = child;\n    } else if (before == this._firstChild) {\n      child.nextSibling = before;\n      child.prevSibling = null;\n      this._firstChild.prevSibling = child;\n      this._firstChild = child;\n    } else {\n      const prev = before.prevSibling;\n      child.nextSibling = before;\n      before.prevSibling = child;\n      child.prevSibling = prev;\n      if (prev != null) {\n        prev.nextSibling = child;\n      }\n    }\n    return this;\n  }\n\n  pushFront(value: V): this {\n    return this.add(value, this._firstChild);\n  }\n\n  pushBack(value: V): this {\n    return this.add(value);\n  }\n\n  /**\n   * Removes a child node from this list.\n   * It is upto the caller to ensure that this node indeed belongs\n   * to this list otherwise deletion of a non belonging node could result\n   * in undefined behaviour.\n   */\n  remove(child: V): this {\n    const next = child.nextSibling;\n    const prev = child.prevSibling;\n\n    if (next == null) {\n      this._lastChild = prev;\n      if (prev == null) this._firstChild = null;\n    } else {\n      next.prevSibling = prev;\n    }\n\n    if (prev == null) {\n      this._firstChild = next;\n      if (next == null) this._lastChild = null;\n    } else {\n      prev.nextSibling = next;\n    }\n\n    if (next != null || prev != null) this._size--;\n\n    child.prevSibling = child.nextSibling = null;\n    return this;\n  }\n\n  popBack(): V {\n    if (this._lastChild == null) {\n      throw new Error(\"No children\");\n    }\n    const out = this._lastChild;\n    this.remove(out);\n    return out;\n  }\n\n  popFront(): V {\n    if (this._firstChild == null) {\n      throw new Error(\"No children\");\n    }\n    const out = this._firstChild;\n    this.remove(out);\n    return out;\n  }\n}\n\n/**\n * A list implementation where the values themselves need to be wrapper in a list node.\n * If values already have sibling node properties they can be direclty used\n * via ValueLists.\n */\nexport class List<V> {\n  private container: ValueList<MutableListNode<V>>;\n\n  constructor(...values: V[]) {\n    this.container = new ValueList<MutableListNode<V>>();\n    for (const v of values) this.push(v);\n  }\n\n  toJSON(): V[] {\n    return Array.from(this.values());\n  }\n\n  forEach(method: (val: V) => boolean | any): number {\n    return this.container.forEach((v) => method(v.value));\n  }\n\n  equals(another: List<V>, eqlFunc: (val1: V, val2: V) => boolean): boolean {\n    return this.container.equals(another.container, (a, b) => eqlFunc(a.value, b.value));\n  }\n\n  find(target: V): Nullable<MutableListNode<V>> {\n    for (const v of this.container.values()) {\n      if (target == v.value) {\n        return v;\n      }\n    }\n    return null;\n  }\n\n  get isEmpty(): boolean {\n    return this.container.isEmpty;\n  }\n\n  get size(): number {\n    return this.container.size;\n  }\n\n  get first(): Nullable<MutableListNode<V>> {\n    return this.container.first;\n  }\n\n  get last(): Nullable<MutableListNode<V>> {\n    return this.container.last;\n  }\n\n  /**\n   * Generator of values in reverse order.\n   */\n  *reversedValues(): Generator<V> {\n    for (const v of this.container.reversedValues()) yield v.value;\n  }\n\n  /**\n   * Generator of values in forward order.\n   */\n  *values(): Generator<V> {\n    for (const v of this.container.values()) yield v.value;\n  }\n\n  popBack(): V {\n    return this.container.popBack().value;\n  }\n\n  popFront(): V {\n    return this.container.popFront().value;\n  }\n\n  pushFront(value: V): this {\n    return this.add(value, this.container.first);\n  }\n\n  push(value: V): this {\n    return this.add(value);\n  }\n\n  add(child: V, before: Nullable<MutableListNode<V>> = null): this {\n    this.container.add(new MutableListNode(child), before);\n    return this;\n  }\n}\n"]}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@panyam/tsutils",
-  "version": "0.0.61",
+  "version": "0.0.62",
   "author": "Sriram Panyam",
   "description": "Some basic TS utils for personal use",
   "homepage": "https://github.com/panyam/tsutils#readme",