data-structure-typed 1.21.3 → 1.31.0

package/dist/data-structures/linked-list/doubly-linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"doubly-linked-list.js","sourceRoot":"","sources":["../../../src/data-structures/linked-list/doubly-linked-list.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAOA;IAME,8BAAY,GAAM;QAChB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAChB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAID,sBAAI,qCAAG;aAAP;YACE,OAAO,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;aAED,UAAQ,KAAQ;YACd,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC;QACpB,CAAC;;;OAJA;IAQD,sBAAI,sCAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;aAED,UAAS,KAAqC;YAC5C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;;;OAJA;IAQD,sBAAI,sCAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;aAED,UAAS,KAAqC;YAC5C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;;;OAJA;IAKH,2BAAC;AAAD,CAAC,AAzCD,IAyCC;AAzCY,oDAAoB;AA2CjC;IAIE;QACE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IAID,sBAAI,kCAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;aAED,UAAS,KAAqC;YAC5C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;;;OAJA;IAQD,sBAAI,kCAAI;aAAR;YACE,OAAO,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;aAED,UAAS,KAAqC;YAC5C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACrB,CAAC;;;OAJA;IAQD,sBAAI,oCAAM;aAAV;YACE,OAAO,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;;;OAAA;IAQM,0BAAS,GAAhB,UAAoB,IAAS;;QAC3B,IAAM,gBAAgB,GAAG,IAAI,gBAAgB,EAAK,CAAC;;YACnD,KAAmB,IAAA,SAAA,SAAA,IAAI,CAAA,0BAAA,4CAAE;gBAApB,IAAM,IAAI,iBAAA;gBACb,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aAC7B;;;;;;;;;QACD,OAAO,gBAAgB,CAAC;IAC1B,CAAC;IAMD,+BAAI,GAAJ,UAAK,GAAM;QACT,IAAM,OAAO,GAAG,IAAI,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YACd,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;SACrB;aAAM;YACL,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACzB,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,OAAO,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;SACrB;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAOD,8BAAG,GAAH;QACE,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QACjC,IAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;YAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;SAClB;aAAM;YACL,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC;YAC7B,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,IAAI,CAAC;SACxB;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,WAAW,CAAC,GAAG,CAAC;IACzB,CAAC;IAOD,gCAAK,GAAL;QACE,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QACjC,IAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;YAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;SAClB;aAAM;YACL,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC;YAC7B,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,IAAI,CAAC;SACxB;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,WAAW,CAAC,GAAG,CAAC;IACzB,CAAC;IAOD,kCAAO,GAAP,UAAQ,GAAM;QACZ,IAAM,OAAO,GAAG,IAAI,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YACd,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;SACrB;aAAM;YACL,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YACzB,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,OAAO,CAAC;YAC1B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;SACrB;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IASD,gCAAK,GAAL,UAAM,KAAa;QACjB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,SAAS,CAAC;QACxD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;YAC9B,OAAO,GAAG,OAAQ,CAAC,IAAI,CAAC;SACzB;QACD,OAAO,OAAQ,CAAC,GAAG,CAAC;IACtB,CAAC;IAUD,oCAAS,GAAT,UAAU,KAAa;QACrB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACnD,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE;YAC9B,OAAO,GAAG,OAAQ,CAAC,IAAI,CAAC;SACzB;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IASD,mCAAQ,GAAR,UAAS,GAAM;QACb,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QAExB,OAAO,OAAO,EAAE;YACd,IAAI,OAAO,CAAC,GAAG,KAAK,GAAG,EAAE;gBACvB,OAAO,OAAO,CAAC;aAChB;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAWD,mCAAQ,GAAR,UAAS,KAAa,EAAE,GAAM;QAC5B,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QACnD,IAAI,KAAK,KAAK,CAAC,EAAE;YACf,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAClB,OAAO,IAAI,CAAC;SACb;QACD,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,EAAE;YACzB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACf,OAAO,IAAI,CAAC;SACb;QAED,IAAM,OAAO,GAAG,IAAI,oBAAoB,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAC3C,IAAM,QAAQ,GAAG,QAAS,CAAC,IAAI,CAAC;QAChC,OAAO,CAAC,IAAI,GAAG,QAAQ,CAAC;QACxB,OAAO,CAAC,IAAI,GAAG,QAAQ,CAAC;QACxB,QAAS,CAAC,IAAI,GAAG,OAAO,CAAC;QACzB,QAAS,CAAC,IAAI,GAAG,OAAO,CAAC;QACzB,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IASD,mCAAQ,GAAR,UAAS,KAAa;QACpB,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO,SAAS,CAAC;QACxD,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;QACrC,IAAI,KAAK,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC;QAEjD,IAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAM,QAAQ,GAAG,WAAY,CAAC,IAAI,CAAC;QACnC,IAAM,QAAQ,GAAG,WAAY,CAAC,IAAI,CAAC;QACnC,QAAS,CAAC,IAAI,GAAG,QAAQ,CAAC;QAC1B,QAAS,CAAC,IAAI,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,WAAY,CAAC,GAAG,CAAC;IAC1B,CAAC;IAYD,iCAAM,GAAN,UAAO,SAAsC;QAC3C,IAAI,IAAoC,CAAC;QAEzC,IAAI,SAAS,YAAY,oBAAoB,EAAE;YAC7C,IAAI,GAAG,SAAS,CAAC;SAClB;aAAM;YACL,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;SACjC;QAED,IAAI,IAAI,EAAE;YACR,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;gBACtB,IAAI,CAAC,KAAK,EAAE,CAAC;aACd;iBAAM,IAAI,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;gBAC7B,IAAI,CAAC,GAAG,EAAE,CAAC;aACZ;iBAAM;gBACL,IAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC3B,IAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC;gBAC3B,QAAS,CAAC,IAAI,GAAG,QAAQ,CAAC;gBAC1B,QAAS,CAAC,IAAI,GAAG,QAAQ,CAAC;gBAC1B,IAAI,CAAC,OAAO,EAAE,CAAC;aAChB;YACD,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAMD,kCAAO,GAAP;QACE,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE;YACd,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACxB,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAKD,gCAAK,GAAL;QACE,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;IACnB,CAAC;IASD,+BAAI,GAAJ,UAAK,QAA6B;QAChC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE;YACd,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;gBACzB,OAAO,OAAO,CAAC,GAAG,CAAC;aACpB;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IASD,kCAAO,GAAP,UAAQ,GAAM;QACZ,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE;YACd,IAAI,OAAO,CAAC,GAAG,KAAK,GAAG,EAAE;gBACvB,OAAO,KAAK,CAAC;aACd;YACD,KAAK,EAAE,CAAC;YACR,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAUD,mCAAQ,GAAR,UAAS,QAA6B;QACpC,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE;YACd,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;gBACzB,OAAO,OAAO,CAAC,GAAG,CAAC;aACpB;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAMD,yCAAc,GAAd;QACE,IAAM,KAAK,GAAQ,EAAE,CAAC;QACtB,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE;YACd,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACxB,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAKD,kCAAO,GAAP;;QACE,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,KAAA,OAAyB,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAA,EAA9C,IAAI,CAAC,IAAI,QAAA,EAAE,IAAI,CAAC,IAAI,QAAA,CAA2B;QAChD,OAAO,OAAO,EAAE;YACd,IAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;YAC1B,KAAA,OAA+B,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,IAAA,EAA1D,OAAO,CAAC,IAAI,QAAA,EAAE,OAAO,CAAC,IAAI,QAAA,CAAiC;YAC5D,OAAO,GAAG,IAAI,CAAC;SAChB;IACH,CAAC;IAQD,kCAAO,GAAP,UAAQ,QAAyC;QAC/C,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,OAAO,EAAE;YACd,QAAQ,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC7B,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;YACvB,KAAK,EAAE,CAAC;SACT;IACH,CAAC;IAUD,8BAAG,GAAH,UAAO,QAAuB;QAC5B,IAAM,UAAU,GAAG,IAAI,gBAAgB,EAAK,CAAC;QAC7C,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE;YACd,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IASD,iCAAM,GAAN,UAAO,QAA6B;QAClC,IAAM,YAAY,GAAG,IAAI,gBAAgB,EAAK,CAAC;QAC/C,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE;YACd,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;gBACzB,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;aAChC;YACD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAYD,iCAAM,GAAN,UAAU,QAAuC,EAAE,YAAe;QAChE,IAAI,WAAW,GAAG,YAAY,CAAC;QAC/B,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACxB,OAAO,OAAO,EAAE;YACd,WAAW,GAAG,QAAQ,CAAC,WAAW,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;YACjD,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC;SACxB;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAcD,sCAAW,GAAX,UAAY,mBAAgD,EAAE,QAAW;QACvE,IAAI,YAAY,CAAC;QAEjB,IAAI,mBAAmB,YAAY,oBAAoB,EAAE;YACvD,YAAY,GAAG,mBAAmB,CAAC;SACpC;aAAM;YACL,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC;SACnD;QAED,IAAI,YAAY,EAAE;YAChB,IAAM,OAAO,GAAG,IAAI,oBAAoB,CAAC,QAAQ,CAAC,CAAC;YACnD,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC;YACjC,IAAI,YAAY,CAAC,IAAI,EAAE;gBACrB,YAAY,CAAC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;aAClC;YACD,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC;YAC5B,YAAY,CAAC,IAAI,GAAG,OAAO,CAAC;YAC5B,IAAI,YAAY,KAAK,IAAI,CAAC,IAAI,EAAE;gBAC9B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;aACrB;YACD,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,OAAO,IAAI,CAAC;SACb;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAeD,uCAAY,GAAZ,UAAa,mBAAgD,EAAE,QAAW;QACxE,IAAI,YAAY,CAAC;QAEjB,IAAI,mBAAmB,YAAY,oBAAoB,EAAE;YACvD,YAAY,GAAG,mBAAmB,CAAC;SACpC;aAAM;YACL,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC;SACnD;QAED,IAAI,YAAY,EAAE;YAChB,IAAM,OAAO,GAAG,IAAI,oBAAoB,CAAC,QAAQ,CAAC,CAAC;YACnD,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC;YACjC,IAAI,YAAY,CAAC,IAAI,EAAE;gBACrB,YAAY,CAAC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;aAClC;YACD,OAAO,CAAC,IAAI,GAAG,YAAY,CAAC;YAC5B,YAAY,CAAC,IAAI,GAAG,OAAO,CAAC;YAC5B,IAAI,YAAY,KAAK,IAAI,CAAC,IAAI,EAAE;gBAC9B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;aACrB;YACD,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,OAAO,IAAI,CAAC;SACb;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IACH,uBAAC;AAAD,CAAC,AA1gBD,IA0gBC;AA1gBY,4CAAgB"}

package/dist/data-structures/linked-list/index.js

@@ -17,3 +17,4 @@ Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./singly-linked-list"), exports);
 __exportStar(require("./doubly-linked-list"), exports);
 __exportStar(require("./skip-linked-list"), exports);
+//# sourceMappingURL=index.js.map

package/dist/data-structures/linked-list/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/data-structures/linked-list/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,uDAAqC;AACrC,uDAAqC;AACrC,qDAAmC"}

package/dist/data-structures/linked-list/singly-linked-list.js

@@ -1,84 +1,144 @@
 "use strict";
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (g && (g = 0, op[0] && (_ = 0)), _) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-class SinglyLinkedListNode {
-    /**
-     * The constructor function initializes an instance of a class with a given value and sets the next property to null.
-     * @param {T} val - The "val" parameter is of type T, which means it can be any data type. It represents the value that
-     * will be stored in the node of a linked list.
-     */
-    constructor(val) {
+var SinglyLinkedListNode = (function () {
+    function SinglyLinkedListNode(val) {
         this._val = val;
         this._next = null;
     }
-    get val() {
-        return this._val;
-    }
-    set val(value) {
-        this._val = value;
-    }
-    get next() {
-        return this._next;
-    }
-    set next(value) {
-        this._next = value;
-    }
-}
+    Object.defineProperty(SinglyLinkedListNode.prototype, "val", {
+        get: function () {
+            return this._val;
+        },
+        set: function (value) {
+            this._val = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(SinglyLinkedListNode.prototype, "next", {
+        get: function () {
+            return this._next;
+        },
+        set: function (value) {
+            this._next = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    return SinglyLinkedListNode;
+}());
 exports.SinglyLinkedListNode = SinglyLinkedListNode;
-class SinglyLinkedList {
-    /**
-     * The constructor initializes the linked list with an empty head, tail, and length.
-     */
-    constructor() {
+var SinglyLinkedList = (function () {
+    function SinglyLinkedList() {
         this._head = null;
         this._tail = null;
         this._length = 0;
     }
-    get head() {
-        return this._head;
-    }
-    set head(value) {
-        this._head = value;
-    }
-    get tail() {
-        return this._tail;
-    }
-    set tail(value) {
-        this._tail = value;
-    }
-    get length() {
-        return this._length;
-    }
-    /**
-     * The `fromArray` function creates a new SinglyLinkedList instance and populates it with the elements from the given
-     * array.
-     * @param {T[]} data - The `data` parameter is an array of elements of type `T`.
-     * @returns The `fromArray` function returns a `SinglyLinkedList` object.
-     */
-    static fromArray(data) {
-        const singlyLinkedList = new SinglyLinkedList();
-        for (const item of data) {
-            singlyLinkedList.push(item);
+    Object.defineProperty(SinglyLinkedList.prototype, "head", {
+        get: function () {
+            return this._head;
+        },
+        set: function (value) {
+            this._head = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(SinglyLinkedList.prototype, "tail", {
+        get: function () {
+            return this._tail;
+        },
+        set: function (value) {
+            this._tail = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(SinglyLinkedList.prototype, "length", {
+        get: function () {
+            return this._length;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    SinglyLinkedList.fromArray = function (data) {
+        var e_1, _a;
+        var singlyLinkedList = new SinglyLinkedList();
+        try {
+            for (var data_1 = __values(data), data_1_1 = data_1.next(); !data_1_1.done; data_1_1 = data_1.next()) {
+                var item = data_1_1.value;
+                singlyLinkedList.push(item);
+            }
+        }
+        catch (e_1_1) { e_1 = { error: e_1_1 }; }
+        finally {
+            try {
+                if (data_1_1 && !data_1_1.done && (_a = data_1.return)) _a.call(data_1);
+            }
+            finally { if (e_1) throw e_1.error; }
         }
         return singlyLinkedList;
-    }
-    getLength() {
+    };
+    SinglyLinkedList.prototype.getLength = function () {
         return this._length;
-    }
-    /**
-     * The `push` function adds a new node with the given data to the end of a singly linked list.
-     * @param {T} data - The "data" parameter represents the value that you want to add to the linked list. It can be of
-     * any type (T) as specified in the generic type declaration of the class or function.
-     */
-    push(data) {
-        const newNode = new SinglyLinkedListNode(data);
+    };
+    SinglyLinkedList.prototype.push = function (data) {
+        var newNode = new SinglyLinkedListNode(data);
         if (!this.head) {
             this.head = newNode;
             this.tail = newNode;
@@ -88,52 +148,37 @@ class SinglyLinkedList {
             this.tail = newNode;
         }
         this._length++;
-    }
-    /**
-     * The `pop()` function removes and returns the value of the last element in a linked list, updating the head and tail
-     * pointers accordingly.
-     * @returns The method `pop()` returns the value of the node that is being removed from the end of the linked list. If
-     * the linked list is empty, it returns `null`.
-     */
-    pop() {
+    };
+    SinglyLinkedList.prototype.pop = function () {
         if (!this.head)
-            return null;
+            return undefined;
         if (this.head === this.tail) {
-            const val = this.head.val;
+            var val_1 = this.head.val;
             this.head = null;
             this.tail = null;
             this._length--;
-            return val;
+            return val_1;
         }
-        let current = this.head;
+        var current = this.head;
         while (current.next !== this.tail) {
             current = current.next;
         }
-        const val = this.tail.val;
+        var val = this.tail.val;
         current.next = null;
         this.tail = current;
         this._length--;
         return val;
-    }
-    /**
-     * The `shift()` function removes and returns the value of the first node in a linked list.
-     * @returns The value of the node that is being removed from the beginning of the linked list.
-     */
-    shift() {
+    };
+    SinglyLinkedList.prototype.shift = function () {
         if (!this.head)
-            return null;
-        const removedNode = this.head;
+            return undefined;
+        var removedNode = this.head;
         this.head = this.head.next;
         this._length--;
         return removedNode.val;
-    }
-    /**
-     * The unshift function adds a new node with the given value to the beginning of a singly linked list.
-     * @param {T} val - The parameter "val" represents the value of the new node that will be added to the beginning of the
-     * linked list.
-     */
-    unshift(val) {
-        const newNode = new SinglyLinkedListNode(val);
+    };
+    SinglyLinkedList.prototype.unshift = function (val) {
+        var newNode = new SinglyLinkedListNode(val);
         if (!this.head) {
             this.head = newNode;
             this.tail = newNode;
@@ -143,73 +188,45 @@ class SinglyLinkedList {
             this.head = newNode;
         }
         this._length++;
-    }
-    /**
-     * The function `getAt` returns the value at a specified index in a linked list, or null if the index is out of range.
-     * @param {number} index - The index parameter is a number that represents the position of the element we want to
-     * retrieve from the list.
-     * @returns The method `getAt(index: number): T | null` returns the value at the specified index in the linked list, or
-     * `null` if the index is out of bounds.
-     */
-    getAt(index) {
+    };
+    SinglyLinkedList.prototype.getAt = function (index) {
         if (index < 0 || index >= this.length)
-            return null;
-        let current = this.head;
-        for (let i = 0; i < index; i++) {
+            return undefined;
+        var current = this.head;
+        for (var i = 0; i < index; i++) {
             current = current.next;
         }
         return current.val;
-    }
-    /**
-     * The function `getNodeAt` returns the node at a given index in a singly linked list.
-     * @param {number} index - The `index` parameter is a number that represents the position of the node we want to
-     * retrieve from the linked list. It indicates the zero-based index of the node we want to access.
-     * @returns The method `getNodeAt(index: number)` returns a `SinglyLinkedListNode<T>` object if the node at the
-     * specified index exists, or `null` if the index is out of bounds.
-     */
-    getNodeAt(index) {
-        let current = this.head;
-        for (let i = 0; i < index; i++) {
+    };
+    SinglyLinkedList.prototype.getNodeAt = function (index) {
+        var current = this.head;
+        for (var i = 0; i < index; i++) {
             current = current.next;
         }
         return current;
-    }
-    /**
-     * The `deleteAt` function removes an element at a specified index from a linked list and returns the removed element.
-     * @param {number} index - The index parameter represents the position of the element that needs to be deleted in the
-     * data structure. It is of type number.
-     * @returns The method `deleteAt` returns the value of the node that was deleted, or `null` if the index is out of
-     * bounds.
-     */
-    deleteAt(index) {
+    };
+    SinglyLinkedList.prototype.deleteAt = function (index) {
         if (index < 0 || index >= this.length)
-            return null;
+            return undefined;
         if (index === 0)
             return this.shift();
         if (index === this.length - 1)
             return this.pop();
-        const prevNode = this.getNodeAt(index - 1);
-        const removedNode = prevNode.next;
+        var prevNode = this.getNodeAt(index - 1);
+        var removedNode = prevNode.next;
         prevNode.next = removedNode.next;
         this._length--;
         return removedNode.val;
-    }
-    /**
-     * The delete function removes a node with a specific value from a singly linked list.
-     * @param {T | SinglyLinkedListNode<T>} valueOrNode - The `valueOrNode` parameter can accept either a value of type `T`
-     * or a `SinglyLinkedListNode<T>` object.
-     * @returns The `delete` method returns a boolean value. It returns `true` if the value or node is found and
-     * successfully deleted from the linked list, and `false` if the value or node is not found in the linked list.
-     */
-    delete(valueOrNode) {
-        let value;
+    };
+    SinglyLinkedList.prototype.delete = function (valueOrNode) {
+        var value;
         if (valueOrNode instanceof SinglyLinkedListNode) {
             value = valueOrNode.val;
         }
         else {
             value = valueOrNode;
         }
-        let current = this.head, prev = null;
+        var current = this.head, prev = null;
         while (current) {
             if (current.val === value) {
                 if (prev === null) {
@@ -231,17 +248,8 @@ class SinglyLinkedList {
             current = current.next;
         }
         return false;
-    }
-    /**
-     * The `insertAt` function inserts a value at a specified index in a singly linked list.
-     * @param {number} index - The index parameter represents the position at which the new value should be inserted in the
-     * linked list. It is of type number.
-     * @param {T} val - The `val` parameter represents the value that you want to insert into the linked list at the
-     * specified index.
-     * @returns The `insert` method returns a boolean value. It returns `true` if the insertion is successful, and `false`
-     * if the index is out of bounds.
-     */
-    insertAt(index, val) {
+    };
+    SinglyLinkedList.prototype.insertAt = function (index, val) {
         if (index < 0 || index > this.length)
             return false;
         if (index === 0) {
@@ -252,69 +260,47 @@ class SinglyLinkedList {
             this.push(val);
             return true;
         }
-        const newNode = new SinglyLinkedListNode(val);
-        const prevNode = this.getNodeAt(index - 1);
+        var newNode = new SinglyLinkedListNode(val);
+        var prevNode = this.getNodeAt(index - 1);
         newNode.next = prevNode.next;
         prevNode.next = newNode;
         this._length++;
         return true;
-    }
-    /**
-     * The function checks if the length of a data structure is equal to zero and returns a boolean value indicating
-     * whether it is empty or not.
-     * @returns A boolean value indicating whether the length of the object is equal to 0.
-     */
-    isEmpty() {
+    };
+    SinglyLinkedList.prototype.isEmpty = function () {
         return this.length === 0;
-    }
-    /**
-     * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
-     */
-    clear() {
+    };
+    SinglyLinkedList.prototype.clear = function () {
         this._head = null;
         this._tail = null;
         this._length = 0;
-    }
-    /**
-     * The `toArray` function converts a linked list into an array.
-     * @returns The `toArray()` method is returning an array of type `T[]`.
-     */
-    toArray() {
-        const array = [];
-        let current = this.head;
+    };
+    SinglyLinkedList.prototype.toArray = function () {
+        var array = [];
+        var current = this.head;
         while (current) {
             array.push(current.val);
             current = current.next;
         }
         return array;
-    }
-    /**
-     * The `reverse` function reverses the order of the nodes in a singly linked list.
-     * @returns The reverse() method does not return anything. It has a return type of void.
-     */
-    reverse() {
+    };
+    SinglyLinkedList.prototype.reverse = function () {
+        var _a;
         if (!this.head || this.head === this.tail)
             return;
-        let prev = null;
-        let current = this.head;
-        let next = null;
+        var prev = null;
+        var current = this.head;
+        var next = null;
         while (current) {
             next = current.next;
             current.next = prev;
             prev = current;
             current = next;
         }
-        [this.head, this.tail] = [this.tail, this.head];
-    }
-    /**
-     * The `find` function iterates through a linked list and returns the first element that satisfies a given condition.
-     * @param callback - A function that takes a value of type T as its parameter and returns a boolean value. This
-     * function is used to determine whether a particular value in the linked list satisfies a certain condition.
-     * @returns The method `find` returns the first element in the linked list that satisfies the condition specified by
-     * the callback function. If no element satisfies the condition, it returns `null`.
-     */
-    find(callback) {
-        let current = this.head;
+        _a = __read([this.tail, this.head], 2), this.head = _a[0], this.tail = _a[1];
+    };
+    SinglyLinkedList.prototype.find = function (callback) {
+        var current = this.head;
         while (current) {
             if (callback(current.val)) {
                 return current.val;
@@ -322,16 +308,10 @@ class SinglyLinkedList {
             current = current.next;
         }
         return null;
-    }
-    /**
-     * The `indexOf` function returns the index of the first occurrence of a given value in a linked list.
-     * @param {T} value - The value parameter is the value that you want to find the index of in the linked list.
-     * @returns The method is returning the index of the first occurrence of the specified value in the linked list. If the
-     * value is not found, it returns -1.
-     */
-    indexOf(value) {
-        let index = 0;
-        let current = this.head;
+    };
+    SinglyLinkedList.prototype.indexOf = function (value) {
+        var index = 0;
+        var current = this.head;
         while (current) {
             if (current.val === value) {
                 return index;
@@ -340,16 +320,9 @@ class SinglyLinkedList {
             current = current.next;
         }
         return -1;
-    }
-    /**
-     * The function finds a node in a singly linked list by its value and returns the node if found, otherwise returns
-     * null.
-     * @param {T} value - The value parameter is the value that we want to search for in the linked list.
-     * @returns a `SinglyLinkedListNode<T>` if a node with the specified value is found in the linked list. If no node with
-     * the specified value is found, the function returns `null`.
-     */
-    findNode(value) {
-        let current = this.head;
+    };
+    SinglyLinkedList.prototype.findNode = function (value) {
+        var current = this.head;
         while (current) {
             if (current.val === value) {
                 return current;
@@ -357,19 +330,11 @@ class SinglyLinkedList {
             current = current.next;
         }
         return null;
-    }
-    /**
-     * The `insertBefore` function inserts a new value before an existing value in a singly linked list.
-     * @param {T | SinglyLinkedListNode<T>} existingValueOrNode - The existing value or node that you want to insert the
-     * new value before. It can be either the value itself or a node containing the value in the linked list.
-     * @param {T} newValue - The `newValue` parameter represents the value that you want to insert into the linked list.
-     * @returns The method `insertBefore` returns a boolean value. It returns `true` if the new value was successfully
-     * inserted before the existing value, and `false` otherwise.
-     */
-    insertBefore(existingValueOrNode, newValue) {
+    };
+    SinglyLinkedList.prototype.insertBefore = function (existingValueOrNode, newValue) {
         if (!this.head)
             return false;
-        let existingValue;
+        var existingValue;
         if (existingValueOrNode instanceof SinglyLinkedListNode) {
             existingValue = existingValueOrNode.val;
         }
@@ -380,10 +345,10 @@ class SinglyLinkedList {
             this.unshift(newValue);
             return true;
         }
-        let current = this.head;
+        var current = this.head;
         while (current.next) {
             if (current.next.val === existingValue) {
-                const newNode = new SinglyLinkedListNode(newValue);
+                var newNode = new SinglyLinkedListNode(newValue);
                 newNode.next = current.next;
                 current.next = newNode;
                 this._length++;
@@ -392,17 +357,9 @@ class SinglyLinkedList {
             current = current.next;
         }
         return false;
-    }
-    /**
-     * The `insertAfter` function inserts a new node with a given value after an existing node in a singly linked list.
-     * @param {T | SinglyLinkedListNode<T>} existingValueOrNode - The existing value or node in the linked list after which
-     * the new value will be inserted. It can be either the value of the existing node or the existing node itself.
-     * @param {T} newValue - The value that you want to insert into the linked list after the existing value or node.
-     * @returns The method returns a boolean value. It returns true if the new value was successfully inserted after the
-     * existing value or node, and false if the existing value or node was not found in the linked list.
-     */
-    insertAfter(existingValueOrNode, newValue) {
-        let existingNode;
+    };
+    SinglyLinkedList.prototype.insertAfter = function (existingValueOrNode, newValue) {
+        var existingNode;
         if (existingValueOrNode instanceof SinglyLinkedListNode) {
             existingNode = existingValueOrNode;
         }
@@ -410,7 +367,7 @@ class SinglyLinkedList {
             existingNode = this.findNode(existingValueOrNode);
         }
         if (existingNode) {
-            const newNode = new SinglyLinkedListNode(newValue);
+            var newNode = new SinglyLinkedListNode(newValue);
             newNode.next = existingNode.next;
             existingNode.next = newNode;
             if (existingNode === this.tail) {
@@ -420,15 +377,10 @@ class SinglyLinkedList {
             return true;
         }
         return false;
-    }
-    /**
-     * The function counts the number of occurrences of a given value in a linked list.
-     * @param {T} value - The value parameter is the value that you want to count the occurrences of in the linked list.
-     * @returns The count of occurrences of the given value in the linked list.
-     */
-    countOccurrences(value) {
-        let count = 0;
-        let current = this.head;
+    };
+    SinglyLinkedList.prototype.countOccurrences = function (value) {
+        var count = 0;
+        var current = this.head;
         while (current) {
             if (current.val === value) {
                 count++;
@@ -436,6 +388,26 @@ class SinglyLinkedList {
             current = current.next;
         }
         return count;
-    }
-}
+    };
+    SinglyLinkedList.prototype[Symbol.iterator] = function () {
+        var current;
+        return __generator(this, function (_a) {
+            switch (_a.label) {
+                case 0:
+                    current = this.head;
+                    _a.label = 1;
+                case 1:
+                    if (!current) return [3, 3];
+                    return [4, current.val];
+                case 2:
+                    _a.sent();
+                    current = current.next;
+                    return [3, 1];
+                case 3: return [2];
+            }
+        });
+    };
+    return SinglyLinkedList;
+}());
 exports.SinglyLinkedList = SinglyLinkedList;
+//# sourceMappingURL=singly-linked-list.js.map