{"version":3,"sources":["../node_modules/ts-linked-list/dist/LinkedList.js","../node_modules/ts-linked-list/dist/LinkedListNode.js","api/articles/index.ts","api/articles/article-1.1.ts","api/articles/article-1.2.ts","api/articles/article-1.3.ts","api/articles/article-1.4.ts","api/articles/article-2.1.ts","api/articles/article-2.2.ts","api/articles/article-2.3.ts","api/articles/article-2.4.ts","api/articles/article-3.1.ts","api/articles/article-3.2.ts","api/articles/article-3.3.ts","api/articles/article-3.4.ts"],"names":["__generator","this","thisArg","body","f","y","t","g","_","label","sent","trys","ops","next","verb","Symbol","iterator","n","v","op","TypeError","call","done","value","pop","length","push","e","step","__read","o","m","r","i","ar","error","__spread","arguments","concat","__values","__importDefault","mod","__esModule","Object","defineProperty","exports","LinkedListNode_1","require","LinkedList","args","_i","head","tail","size","append","prototype","get","enumerable","configurable","from","iterable","bind","apply","index","node","getNode","undefined","data","asc","stopAt","nextNode","currentNode","currentIndex","findNodeIndex","findNode","nodeIndex","find","findIndex","e_1","_a","args_1","args_1_1","default","e_1_1","return","prepend","e_2","reverseArgs","Array","reverse","reverseArgs_1","reverseArgs_1_1","prev","e_2_1","insertAt","insertAfter","removeNode","list","ReferenceError","removeAt","insertBefore","referenceNode","sort","compare","quicksort","start","end","pivotData","current","split","temp","shift","removeFromAnyEnd","merge","clear","slice","finish","forEach","modifier","map","_this","filter","reduce","result","currentElement","toArray","toString","separator","s","element","LinkedList_1","LinkedListNode","remove","articles","heading","introduction","image","process","stampImage","backgroundImage","tocIndex","link","chapterColor","keyTakeaways","standFor","meaning","asEmployee","asLeader","howToAct","question","answer","relatedMaterial","text","url","definitions"],"mappings":"0HACA,IAAIA,EAAeC,MAAQA,KAAKD,aAAgB,SAAUE,EAASC,GAC/D,IAAsGC,EAAGC,EAAGC,EAAGC,EAA3GC,EAAI,CAAEC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAPJ,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,IAAOK,KAAM,GAAIC,IAAK,IAChG,OAAOL,EAAI,CAAEM,KAAMC,EAAK,GAAI,MAASA,EAAK,GAAI,OAAUA,EAAK,IAAwB,oBAAXC,SAA0BR,EAAEQ,OAAOC,UAAY,WAAa,OAAOf,OAAUM,EACvJ,SAASO,EAAKG,GAAK,OAAO,SAAUC,GAAK,OACzC,SAAcC,GACV,GAAIf,EAAG,MAAM,IAAIgB,UAAU,mCAC3B,KAAOZ,GAAG,IACN,GAAIJ,EAAI,EAAGC,IAAMC,EAAY,EAARa,EAAG,GAASd,EAAC,OAAac,EAAG,GAAKd,EAAC,SAAeC,EAAID,EAAC,SAAeC,EAAEe,KAAKhB,GAAI,GAAKA,EAAEQ,SAAWP,EAAIA,EAAEe,KAAKhB,EAAGc,EAAG,KAAKG,KAAM,OAAOhB,EAE3J,OADID,EAAI,EAAGC,IAAGa,EAAK,CAAS,EAARA,EAAG,GAAQb,EAAEiB,QACzBJ,EAAG,IACP,KAAK,EAAG,KAAK,EAAGb,EAAIa,EAAI,MACxB,KAAK,EAAc,OAAXX,EAAEC,QAAgB,CAAEc,MAAOJ,EAAG,GAAIG,MAAM,GAChD,KAAK,EAAGd,EAAEC,QAASJ,EAAIc,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKX,EAAEI,IAAIY,MAAOhB,EAAEG,KAAKa,MAAO,SACxC,QACI,KAAkBlB,GAAZA,EAAIE,EAAEG,MAAYc,OAAS,GAAKnB,EAAEA,EAAEmB,OAAS,MAAkB,IAAVN,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAEX,EAAI,EAAG,SACjG,GAAc,IAAVW,EAAG,MAAcb,GAAMa,EAAG,GAAKb,EAAE,IAAMa,EAAG,GAAKb,EAAE,IAAM,CAAEE,EAAEC,MAAQU,EAAG,GAAI,MAC9E,GAAc,IAAVA,EAAG,IAAYX,EAAEC,MAAQH,EAAE,GAAI,CAAEE,EAAEC,MAAQH,EAAE,GAAIA,EAAIa,EAAI,MAC7D,GAAIb,GAAKE,EAAEC,MAAQH,EAAE,GAAI,CAAEE,EAAEC,MAAQH,EAAE,GAAIE,EAAEI,IAAIc,KAAKP,GAAK,MACvDb,EAAE,IAAIE,EAAEI,IAAIY,MAChBhB,EAAEG,KAAKa,MAAO,SAEtBL,EAAKhB,EAAKkB,KAAKnB,EAASM,GAC1B,MAAOmB,GAAKR,EAAK,CAAC,EAAGQ,GAAItB,EAAI,EAjBrB,QAiBoCD,EAAIE,EAAI,EACtD,GAAY,EAARa,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEI,MAAOJ,EAAG,GAAKA,EAAG,QAAK,EAAQG,MAAM,GArB9BM,CAAK,CAACX,EAAGC,OAwBzDW,EAAU5B,MAAQA,KAAK4B,QAAW,SAAUC,EAAGb,GAC/C,IAAIc,EAAsB,oBAAXhB,QAAyBe,EAAEf,OAAOC,UACjD,IAAKe,EAAG,OAAOD,EACf,IAAmBE,EAAYL,EAA3BM,EAAIF,EAAEV,KAAKS,GAAOI,EAAK,GAC3B,IACI,WAAc,IAANjB,GAAgBA,KAAM,MAAQe,EAAIC,EAAEpB,QAAQS,MAAMY,EAAGR,KAAKM,EAAET,OAExE,MAAOY,GAASR,EAAI,CAAEQ,MAAOA,GAH7B,QAKI,IACQH,IAAMA,EAAEV,OAASS,EAAIE,EAAC,SAAaF,EAAEV,KAAKY,GADlD,QAGU,GAAIN,EAAG,MAAMA,EAAEQ,OAE7B,OAAOD,GAEPE,EAAYnC,MAAQA,KAAKmC,UAAa,WACtC,IAAK,IAAIF,EAAK,GAAID,EAAI,EAAGA,EAAII,UAAUZ,OAAQQ,IAAKC,EAAKA,EAAGI,OAAOT,EAAOQ,UAAUJ,KACpF,OAAOC,GAEPK,EAAYtC,MAAQA,KAAKsC,UAAa,SAAUT,GAChD,IAAIC,EAAsB,oBAAXhB,QAAyBe,EAAEf,OAAOC,UAAWiB,EAAI,EAChE,OAAIF,EAAUA,EAAEV,KAAKS,GACd,CACHjB,KAAM,WAEF,OADIiB,GAAKG,GAAKH,EAAEL,SAAQK,OAAI,GACrB,CAAEP,MAAOO,GAAKA,EAAEG,KAAMX,MAAOQ,MAI5CU,EAAmBvC,MAAQA,KAAKuC,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExDE,OAAOC,eAAeC,EAAS,aAAc,CAAEtB,OAAO,IACtD,IAAIuB,EAAmBN,EAAgBO,EAAQ,MAQ3CC,EAA4B,WAC5B,SAASA,IAEL,IADA,IAAIC,EAAO,GACFC,EAAK,EAAGA,EAAKb,UAAUZ,OAAQyB,IACpCD,EAAKC,GAAMb,UAAUa,GAEzBjD,KAAKkD,KAAO,KACZlD,KAAKmD,KAAO,KACZnD,KAAKoD,KAAO,EACZ,IAAK,IAAIpB,EAAI,EAAGA,EAAII,UAAUZ,OAAQQ,IAClChC,KAAKqD,OAAOjB,UAAUJ,IAimB9B,OA9lBAU,OAAOC,eAAeI,EAAWO,UAAW,SAAU,CAIlDC,IAAK,WACD,OAAOvD,KAAKoD,MAEhBI,YAAY,EACZC,cAAc,IAUlBV,EAAWW,KAAO,SAAUC,GACxB,OAAO,IAAKZ,EAAWa,KAAKC,MAAMd,EAAYZ,EAAS,MAAC,GAASwB,MASrEZ,EAAWO,UAAUC,IAAM,SAAUO,GACjC,IAAIC,EAAO/D,KAAKgE,QAAQF,GACxB,YAAgBG,IAATF,EAAqBA,EAAKG,UAAOD,GAS5ClB,EAAWO,UAAUU,QAAU,SAAUF,GACrC,KAAkB,OAAd9D,KAAKkD,MAAiBY,EAAQ,GAAKA,GAAS9D,KAAKwB,QAArD,CAOA,IAJA,IAAI2C,EAAML,EAAQ9D,KAAKwB,OAAS,EAC5B4C,EAASD,EAAML,EAAQ9D,KAAKwB,OAASsC,EAAQ,EAC7CO,EAAWF,EAAM,OAAS,OAC1BG,EAAcH,EAAMnE,KAAKkD,KAAOlD,KAAKmD,KAChCoB,EAAe,EAAGA,EAAeH,EAAQG,IAC9CD,EAAcA,EAAYD,GAE9B,OAAOC,IAWXvB,EAAWO,UAAUkB,cAAgB,SAAUrE,GAG3C,IAFA,IAAIoE,EAAe,EACfD,EAActE,KAAKkD,KAChBoB,GAAa,CAChB,GAAInE,EAAEmE,EAAYJ,KAAMK,EAAcvE,MAClC,MAAO,CACH8D,MAAOS,EACPR,KAAMO,GAGdA,EAAcA,EAAY1D,KAC1B2D,GAAgB,IAaxBxB,EAAWO,UAAUmB,SAAW,SAAUtE,GACtC,IAAIuE,EAAY1E,KAAKwE,cAAcrE,GACnC,YAAqB8D,IAAdS,EAA0BA,EAAUX,UAAOE,GAUtDlB,EAAWO,UAAUqB,KAAO,SAAUxE,GAClC,IAAIuE,EAAY1E,KAAKwE,cAAcrE,GACnC,YAAqB8D,IAAdS,EAA0BA,EAAUX,KAAKG,UAAOD,GAU3DlB,EAAWO,UAAUsB,UAAY,SAAUzE,GACvC,IAAIuE,EAAY1E,KAAKwE,cAAcrE,GACnC,YAAqB8D,IAAdS,EAA0BA,EAAUZ,OAAS,GAWxDf,EAAWO,UAAUD,OAAS,WAG1B,IAFA,IAAIwB,EAAKC,EACL9B,EAAO,GACFC,EAAK,EAAGA,EAAKb,UAAUZ,OAAQyB,IACpCD,EAAKC,GAAMb,UAAUa,GAEzB,IACI,IAAK,IAAI8B,EAASzC,EAASU,GAAOgC,EAAWD,EAAOnE,QAASoE,EAAS3D,KAAM2D,EAAWD,EAAOnE,OAAQ,CAClG,IAAIsD,EAAOc,EAAS1D,MAChByC,EAAO,IAAIlB,EAAiBoC,QAAQf,EAAMlE,KAAKmD,KAAM,KAAMnD,MAC7C,OAAdA,KAAKkD,OACLlD,KAAKkD,KAAOa,GAEE,OAAd/D,KAAKmD,OACLnD,KAAKmD,KAAKvC,KAAOmD,GAErB/D,KAAKmD,KAAOY,EACZ/D,KAAKoD,MAAQ,GAGrB,MAAO8B,GAASL,EAAM,CAAE3C,MAAOgD,GAd/B,QAgBI,IACQF,IAAaA,EAAS3D,OAASyD,EAAKC,EAAOI,SAASL,EAAG1D,KAAK2D,GADpE,QAGU,GAAIF,EAAK,MAAMA,EAAI3C,OAEjC,OAAOlC,MASX+C,EAAWO,UAAU7B,KAAO,WAExB,IADA,IAAIuB,EAAO,GACFC,EAAK,EAAGA,EAAKb,UAAUZ,OAAQyB,IACpCD,EAAKC,GAAMb,UAAUa,GAGzB,OADAjD,KAAKqD,OAAOQ,MAAM7D,KAAMmC,EAASa,IAC1BhD,KAAKwB,QAUhBuB,EAAWO,UAAU8B,QAAU,WAG3B,IAFA,IAAIC,EAAKP,EACL9B,EAAO,GACFC,EAAK,EAAGA,EAAKb,UAAUZ,OAAQyB,IACpCD,EAAKC,GAAMb,UAAUa,GAEzB,IAAIqC,EAAcC,MAAM7B,KAAKV,GAAMwC,UACnC,IACI,IAAK,IAAIC,EAAgBnD,EAASgD,GAAcI,EAAkBD,EAAc7E,QAAS8E,EAAgBrE,KAAMqE,EAAkBD,EAAc7E,OAAQ,CACnJ,IAAIsD,EAAOwB,EAAgBpE,MACvByC,EAAO,IAAIlB,EAAiBoC,QAAQf,EAAM,KAAMlE,KAAKkD,KAAMlD,MAC7C,OAAdA,KAAKmD,OACLnD,KAAKmD,KAAOY,GAEE,OAAd/D,KAAKkD,OACLlD,KAAKkD,KAAKyC,KAAO5B,GAErB/D,KAAKkD,KAAOa,EACZ/D,KAAKoD,MAAQ,GAGrB,MAAOwC,GAASP,EAAM,CAAEnD,MAAO0D,GAd/B,QAgBI,IACQF,IAAoBA,EAAgBrE,OAASyD,EAAKW,EAAcN,SAASL,EAAG1D,KAAKqE,GADzF,QAGU,GAAIJ,EAAK,MAAMA,EAAInD,OAEjC,OAAOlC,MAYX+C,EAAWO,UAAUuC,SAAW,SAAU/B,EAAOI,GAC7C,GAAkB,OAAdlE,KAAKkD,KACL,OAAOlD,KAAKqD,OAAOa,GAEvB,GAAIJ,GAAS,EACT,OAAO9D,KAAKoF,QAAQlB,GAIxB,IAFA,IAAII,EAActE,KAAKkD,KACnBqB,EAAe,EACZA,EAAeT,EAAQ,GAA0B,OAArBQ,EAAY1D,MAC3C2D,GAAgB,EAChBD,EAAcA,EAAY1D,KAG9B,OADA0D,EAAYwB,YAAY5B,GACjBlE,MAWX+C,EAAWO,UAAUyC,WAAa,SAAUhC,GACxC,GAAIA,EAAKiC,OAAShG,KACd,MAAM,IAAIiG,eAAe,qCAkB7B,OAhBkB,OAAdlC,EAAK4B,OACL5B,EAAK4B,KAAK/E,KAAOmD,EAAKnD,MAER,OAAdmD,EAAKnD,OACLmD,EAAKnD,KAAK+E,KAAO5B,EAAK4B,MAEtB3F,KAAKkD,OAASa,IACd/D,KAAKkD,KAAOa,EAAKnD,MAEjBZ,KAAKmD,OAASY,IACd/D,KAAKmD,KAAOY,EAAK4B,MAErB3F,KAAKoD,MAAQ,EACbW,EAAKnD,KAAO,KACZmD,EAAK4B,KAAO,KACZ5B,EAAKiC,KAAO,KACLjC,GASXhB,EAAWO,UAAU4C,SAAW,SAAUpC,GACtC,IAAIC,EAAO/D,KAAKgE,QAAQF,GACxB,YAAgBG,IAATF,EAAqB/D,KAAK+F,WAAWhC,QAAQE,GAWxDlB,EAAWO,UAAU6C,aAAe,SAAUC,EAAelC,GACzD,IAAIH,EAAO,IAAIlB,EAAiBoC,QAAQf,EAAMkC,EAAcT,KAAMS,EAAepG,MASjF,OAR2B,OAAvBoG,EAAcT,OACd3F,KAAKkD,KAAOa,GAEW,OAAvBqC,EAAcT,OACdS,EAAcT,KAAK/E,KAAOmD,GAE9BqC,EAAcT,KAAO5B,EACrB/D,KAAKoD,MAAQ,EACNpD,MASX+C,EAAWO,UAAU+C,KAAO,SAAUC,GAClC,GAAkB,OAAdtG,KAAKkD,MAA+B,OAAdlD,KAAKmD,KAC3B,OAAOnD,KAEX,GAAIA,KAAKwB,OAAS,EACd,OAAOxB,KAkCX,OAhCgB,SAAZuG,EAAsBC,EAAOC,GAC7B,GAAID,IAAUC,EAAd,CAMA,IAHA,IAAIC,EAAYD,EAAIvC,KAChByC,EAAUH,EACVI,EAAQJ,EACLG,GAAWA,IAAYF,GAAK,CAE/B,GADWH,EAAQK,EAAQzC,KAAMwC,GACvB,CACN,GAAIC,IAAYC,EAAO,CACnB,IAAIC,EAAOD,EAAM1C,KACjB0C,EAAM1C,KAAOyC,EAAQzC,KACrByC,EAAQzC,KAAO2C,EAEnBD,EAAQA,EAAMhG,KAElB+F,EAAUA,EAAQ/F,KAEtB6F,EAAIvC,KAAO0C,EAAM1C,KACjB0C,EAAM1C,KAAOwC,EACTF,EAAM5F,OAAS6F,EAAId,OAGnBiB,EAAMjB,MAAQiB,IAAUJ,GACxBD,EAAUC,EAAOI,EAAMjB,MAEvBiB,EAAMhG,MAAQgG,IAAUH,GACxBF,EAAUK,EAAMhG,KAAM6F,KAG9BF,CAAUvG,KAAKkD,KAAMlD,KAAKmD,MACnBnD,MAWX+C,EAAWO,UAAUwC,YAAc,SAAUM,EAAelC,GACxD,IAAIH,EAAO,IAAIlB,EAAiBoC,QAAQf,EAAMkC,EAAeA,EAAcxF,KAAMZ,MASjF,OAR2B,OAAvBoG,EAAcxF,OACdZ,KAAKmD,KAAOY,GAEW,OAAvBqC,EAAcxF,OACdwF,EAAcxF,KAAK+E,KAAO5B,GAE9BqC,EAAcxF,KAAOmD,EACrB/D,KAAKoD,MAAQ,EACNpD,MASX+C,EAAWO,UAAUwD,MAAQ,WACzB,OAAO9G,KAAK+G,iBAAiB/G,KAAKkD,OAStCH,EAAWO,UAAU/B,IAAM,WACvB,OAAOvB,KAAK+G,iBAAiB/G,KAAKmD,OAatCJ,EAAWO,UAAU0D,MAAQ,SAAUhB,GACjB,OAAdhG,KAAKmD,OACLnD,KAAKmD,KAAKvC,KAAOoF,EAAK9C,MAER,OAAd8C,EAAK9C,OACL8C,EAAK9C,KAAKyC,KAAO3F,KAAKmD,MAE1BnD,KAAKkD,KAAOlD,KAAKkD,MAAQ8C,EAAK9C,KAC9BlD,KAAKmD,KAAO6C,EAAK7C,MAAQnD,KAAKmD,KAC9BnD,KAAKoD,MAAQ4C,EAAK5C,KAClB4C,EAAK5C,KAAOpD,KAAKoD,KACjB4C,EAAK9C,KAAOlD,KAAKkD,KACjB8C,EAAK7C,KAAOnD,KAAKmD,MASrBJ,EAAWO,UAAU2D,MAAQ,WAIzB,OAHAjH,KAAKkD,KAAO,KACZlD,KAAKmD,KAAO,KACZnD,KAAKoD,KAAO,EACLpD,MAcX+C,EAAWO,UAAU4D,MAAQ,SAAUV,EAAOC,GAC1C,IAAIT,EAAO,IAAIjD,EACXoE,EAASV,EACb,GAAkB,OAAdzG,KAAKkD,MAA+B,OAAdlD,KAAKmD,KAC3B,OAAO6C,QAEI/B,IAAXkD,GAAwBA,EAASX,KACjCW,EAASnH,KAAKwB,QAGlB,IADA,IAAI0B,EAAOlD,KAAKgE,QAAQwC,GACfxE,EAAI,EAAGA,EAAImF,EAASX,GAAkB,OAATtD,QAA0Be,IAATf,EAAoBlB,IACvEgE,EAAK3C,OAAOH,EAAKgB,MACjBhB,EAAOA,EAAKtC,KAEhB,OAAOoF,GASXjD,EAAWO,UAAUkC,QAAU,WAE3B,IADA,IAAIlB,EAActE,KAAKkD,KAChBoB,GAAa,CAChB,IAAI1D,EAAO0D,EAAY1D,KACvB0D,EAAY1D,KAAO0D,EAAYqB,KAC/BrB,EAAYqB,KAAO/E,EACnB0D,EAAcA,EAAYqB,KAE9B,IAAIxC,EAAOnD,KAAKmD,KAGhB,OAFAnD,KAAKmD,KAAOnD,KAAKkD,KACjBlD,KAAKkD,KAAOC,EACLnD,MAUX+C,EAAWO,UAAU8D,QAAU,SAAUjH,EAAGqF,QACxB,IAAZA,IAAsBA,GAAU,GAKpC,IAJA,IAAIjB,EAAeiB,EAAUxF,KAAKwB,OAAS,EAAI,EAC3C8C,EAAckB,EAAUxF,KAAKmD,KAAOnD,KAAKkD,KACzCmE,EAAW7B,GAAW,EAAI,EAC1BnB,EAAWmB,EAAU,OAAS,OAC3BlB,GACHnE,EAAEmE,EAAYJ,KAAMK,EAAcvE,MAClCsE,EAAcA,EAAYD,GAC1BE,GAAgB8C,GAYxBtE,EAAWO,UAAUgE,IAAM,SAAUnH,EAAGqF,GACpC,IAAI+B,EAAQvH,UACI,IAAZwF,IAAsBA,GAAU,GACpC,IAAIQ,EAAO,IAAIjD,EAEf,OADA/C,KAAKoH,SAAQ,SAAUlD,EAAMJ,GAAS,OAAOkC,EAAK3C,OAAOlD,EAAE+D,EAAMJ,EAAOyD,MAAY/B,GAC7EQ,GAWXjD,EAAWO,UAAUkE,OAAS,SAAUrH,EAAGqF,GACvC,IAAI+B,EAAQvH,UACI,IAAZwF,IAAsBA,GAAU,GACpC,IAAIQ,EAAO,IAAIjD,EAMf,OALA/C,KAAKoH,SAAQ,SAAUlD,EAAMJ,GACrB3D,EAAE+D,EAAMJ,EAAOyD,IACfvB,EAAK3C,OAAOa,KAEjBsB,GACIQ,GAWXjD,EAAWO,UAAUmE,OAAS,SAAUtH,EAAGqG,EAAOhB,QAC9B,IAAZA,IAAsBA,GAAU,GACpC,IAIIkC,EAJAnD,EAAeiB,EAAUxF,KAAKwB,OAAS,EAAI,EAC3C6F,EAAW7B,GAAW,EAAI,EAC1BnB,EAAWmB,EAAU,OAAS,OAC9BmC,EAAiBnC,EAAUxF,KAAKmD,KAAOnD,KAAKkD,KAEhD,QAAce,IAAVuC,EACAkB,EAASlB,MAER,KAAImB,EAKL,MAAM,IAAIxG,UAAU,oDAJpBuG,EAASC,EAAezD,KACxByD,EAAiBA,EAAetD,GAKpC,KAAOsD,GACHD,EAASvH,EAAEuH,EAAQC,EAAezD,KAAMK,EAAcvE,MACtDuE,GAAgB8C,EAChBM,EAAiBA,EAAetD,GAEpC,OAAOqD,GAQX3E,EAAWO,UAAUsE,QAAU,WAC3B,OAAOzF,EAASnC,OASpB+C,EAAWO,UAAUuE,SAAW,SAAUC,GAEtC,YADkB,IAAdA,IAAwBA,EAAY,KACjC9H,KAAKyH,QAAO,SAAUM,EAAG7D,GAAQ,MAAO,GAAK6D,EAAID,EAAY5D,MASxEnB,EAAWO,UAAUxC,OAAOC,UAAY,WACpC,IAAIiH,EACJ,OAAOjI,EAAYC,MAAM,SAAU8E,GAC/B,OAAQA,EAAGtE,OACP,KAAK,EACDwH,EAAUhI,KAAKkD,KACf4B,EAAGtE,MAAQ,EACf,KAAK,EACD,OAAkB,OAAZwH,EAA0B,CAAC,EAAa,GACvC,CAAC,EAAaA,EAAQ9D,MACjC,KAAK,EAGD,OAFAY,EAAGrE,OACHuH,EAAUA,EAAQpH,KACX,CAAC,EAAa,GACzB,KAAK,EAAG,MAAO,CAAC,QAK5BmC,EAAWO,UAAUyD,iBAAmB,SAAUhD,GAC9C,OAAgB,OAATA,EAAgB/D,KAAK+F,WAAWhC,GAAMG,UAAOD,GAEjDlB,EA3mBqB,GA6mBhCH,EAAQqC,QAAUlC,G,iCClrBlB,IAAIR,EAAmBvC,MAAQA,KAAKuC,iBAAoB,SAAUC,GAC9D,OAAQA,GAAOA,EAAIC,WAAcD,EAAM,CAAE,QAAWA,IAExDE,OAAOC,eAAeC,EAAS,aAAc,CAAEtB,OAAO,IACtD,IAAI2G,EAAe1F,EAAgBO,EAAQ,MAOvCoF,EAAgC,WAChC,SAASA,EAEThE,EAEAyB,EAEA/E,EAEAoF,GACIhG,KAAKkE,KAAOA,EACZlE,KAAK2F,KAAOA,EACZ3F,KAAKY,KAAOA,EACZZ,KAAKgG,KAAOA,EAoEhB,OAlEAtD,OAAOC,eAAeuF,EAAe5E,UAAW,QAAS,CAOrDC,IAAK,WACD,OAAOvD,KAAKkE,MAEhBV,YAAY,EACZC,cAAc,IAElBf,OAAOC,eAAeuF,EAAe5E,UAAW,QAAS,CAOrDC,IAAK,WACD,IAAIgE,EAAQvH,KACZ,GAAKA,KAAKgG,KAGV,OAAOhG,KAAKgG,KAAKpB,WAAU,SAAUtD,GAAS,OAAOA,IAAUiG,EAAMjG,UAEzEkC,YAAY,EACZC,cAAc,IASlByE,EAAe5E,UAAU6C,aAAe,SAAUjC,GAC9C,OAAqB,OAAdlE,KAAKgG,KACNhG,KAAKgG,KAAKG,aAAanG,KAAMkE,GAC7B,IAAI+D,EAAahD,QAAQf,EAAMlE,KAAKkE,OAS9CgE,EAAe5E,UAAUwC,YAAc,SAAU5B,GAC7C,OAAqB,OAAdlE,KAAKgG,KACNhG,KAAKgG,KAAKF,YAAY9F,KAAMkE,GAC5B,IAAI+D,EAAahD,QAAQjF,KAAKkE,KAAMA,IAQ9CgE,EAAe5E,UAAU6E,OAAS,WAC9B,GAAkB,OAAdnI,KAAKgG,KACL,MAAM,IAAIC,eAAe,oCAE7B,OAAOjG,KAAKgG,KAAKD,WAAW/F,OAEzBkI,EAjFyB,GAmFpCtF,EAAQqC,QAAUiD,G,oDC/EdE,EAAuC,I,OAAIrF,GAC/CqF,EAAS3G,KCf8B,CACnC4G,QAAS,wCAETC,aAAa,sXAEbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,WAEdC,aACI,gPAEJC,SAAS,u8BAMTC,QAAS,CACLC,WAAW,6iDAWHC,SAAS,k8BAUrBC,SAAU,CACN,CACIC,SAAU,qLACVC,OAAQ,4KAEZ,CACID,SAAU,2MACVC,OAAO,0WAIfC,gBAAiB,CACb,CACIC,KAAM,qCACNC,IAAK,sHAET,CACID,KAAM,oBACNC,IAAK,sHAET,CACID,KAAM,gDACNC,IAAK,sHAET,CACID,KAAM,4BACNC,IAAK,sHAET,CACID,KAAM,+EACNC,IAAK,gIAIbC,YAAY,q9BCjFuB,CACnCpB,QAAS,iDAETC,aAAa,kcAIbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,WAEdC,aACI,qMAEJC,SAAS,keAMTC,QAAS,CACLC,WAAW,47BAQXC,SAAS,snBASbC,SAAU,CACN,CACIC,SAAU,4NACVC,OAAQ,6QAEZ,CACID,SAAU,4DACVC,OAAQ,kNAIhBC,gBAAiB,CACb,CACIC,KAAM,qCACNC,IAAK,sHAET,CACID,KAAM,gDACNC,IAAK,sHAET,CACID,KAAM,oBACNC,IAAK,sHAET,CACID,KAAM,+EACNC,IAAK,gIAIbC,YAAY,ilBC3EuB,CACnCpB,QAAS,+BAETC,aAAa,uoBAGbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,WAEdC,aACI,oOAEJC,SAAS,mzBAMTC,QAAS,CACLC,WAAW,2uCAQXC,SAAS,80BASbC,SAAU,CACN,CACIC,SAAU,6FACVC,OAAQ,oUAEZ,CACID,SAAU,2KACVC,OAAQ,2PAIhBC,gBAAiB,CACb,CACIC,KAAM,kBACNC,IAAK,sHAET,CACID,KAAM,gBACNC,IAAK,sHAET,CACID,KAAM,sBACNC,IAAK,sHAET,CACID,KAAM,iCACNC,IAAK,sHAET,CACID,KAAM,wCACNC,IAAK,sHAEZ,CACOD,KAAM,wCACZC,IAAK,sHAEN,CACOD,KAAM,iBACZC,IAAK,mFAEN,CACOD,KAAM,4CACZC,IAAK,0DAEN,CACOD,KAAM,mBACZC,IAAK,0BAIPC,YAAY,ymBC9FuB,CACnCpB,QAAS,mCAETC,aAAa,sZAEbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,WAEdC,aACI,0QAEJC,SAAS,4kBAKTC,QAAS,CACLC,WAAW,wwCASXC,SAAS,0YAQbC,SAAU,CACN,CACIC,SAAU,6KACVC,OAAQ,gYAEZ,CACID,SAAU,+NACVC,OAAQ,qTAIhBC,gBAAiB,CACb,CACIC,KAAM,oCACNC,IAAK,sHAET,CACID,KAAM,4BACNC,IAAK,sHAET,CACID,KAAM,0BACNC,IAAK,uHAIbC,YAAY,klBJpDhBrB,EAAS3G,KKhB8B,CACnC4G,QAAS,qCAETC,aAAa,8VAEbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,YAEdC,aACI,kRAEJC,SAAS,62BAOTC,QAAS,CACLC,WAAW,qfAOXC,SAAS,6pBASbC,SAAU,CACN,CACIC,SAAU,6KACVC,OAAQ,0ZAEZ,CACID,SAAU,oLACVC,OAAQ,gLAIhBC,gBAAiB,CACb,CACIC,KAAM,6BACNC,IAAK,sHAET,CACID,KAAM,iDACNC,IAAK,sHAET,CACID,KAAM,2CACNC,IAAK,uHAIbC,YAAa,MCrEsB,CACnCpB,QAAS,uCAETC,aAAa,yUAEbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,YAEdC,aACI,uLAEJC,SAAS,wfAMTC,QAAS,CACLC,WAAW,4oBAOXC,SAAS,iiBASbC,SAAU,CACN,CACIC,SAAU,oHACVC,OAAQ,wOAEZ,CACID,SAAU,mNACVC,OAAQ,8NAIhBC,gBAAiB,CACb,CACIC,KAAM,2CACNC,IAAK,sHAET,CACID,KAAM,iDACNC,IAAK,sHAET,CACID,KAAM,6BACNC,IAAK,uHAIbC,YAAY,sgBCpEuB,CACnCpB,QAAS,8CAETC,aAAa,4fAEbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,YAEdC,aACI,oQAEJC,SAAS,k4BAMTC,QAAS,CACLC,WAAW,+UAMXC,SAAS,soBASbC,SAAU,CACN,CACIC,SAAU,6EACVC,OAAQ,mVAEZ,CACID,SAAU,kHACVC,OAAQ,qKAIhBC,gBAAiB,CACb,CACIC,KAAM,iDACNC,IAAK,uFAIbC,YAAa,MC3DsB,CACnCpB,QAAS,4CAETC,aAAa,wZAEbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,YAEdC,aACI,mLAEJC,SAAS,mwBAMTC,QAAS,CACLC,WAAW,ghBAOXC,SAAS,4uBAUbC,SAAU,CACN,CACIC,SAAU,+MACVC,OAAQ,yNAEZ,CACID,SAAU,8LACVC,OAAQ,0UAIhBC,gBAAiB,CACb,CACIC,KAAM,iDACNC,IAAK,sHAET,CACID,KAAM,6BACNC,IAAK,sHAET,CACID,KAAM,sCACNC,IAAK,uFAIbC,YAAY,sXRpDhBrB,EAAS3G,KSjB8B,CACnC4G,QAAS,8BAETC,aAAa,sfAEbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,UAEdC,aACI,yNAEJC,SAAS,klCAQTC,QAAS,CACLC,WAAW,oqCASXC,SAAS,ykBAQbC,SAAU,CACN,CACIC,SAAU,8MACVC,OAAQ,oUAEZ,CACID,SAAU,kNACVC,OAAQ,gTAIhBC,gBAAiB,CACb,CACIC,KAAM,oBACNC,IAAK,sHAET,CACID,KAAM,gBACNC,IAAK,sHAET,CACID,KAAM,0CACNC,IAAK,iEAET,CACID,KAAM,8CACNC,IAAK,qDAIbC,YAAY,0MC3EuB,CACnCpB,QAAS,wCAETC,aAAa,wmBAEbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,UAEdC,aACI,qOAEJC,SAAS,6gCAOTC,QAAS,CACLC,WAAW,89BAUXC,SAAS,ygBAQbC,SAAU,CACN,CACIC,SAAU,iKACVC,OAAQ,wTAEZ,CACID,SAAU,yLACVC,OAAQ,uOAIhBC,gBAAiB,CACb,CACIC,KAAM,6BACNC,IAAK,sHAET,CACID,KAAM,iDACNC,IAAK,sHAET,CACID,KAAM,oBACNC,IAAK,iEAET,CACID,KAAM,sDACNC,IAAK,kFAIbC,YAAa,MC3EsB,CACnCpB,QAAS,iCAETC,aAAa,kWAEbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,UAEdC,aACI,iPAEJC,SAAS,ssCAQTC,QAAS,CACLC,WAAW,mwBAOXC,SAAS,02BASbC,SAAU,CACN,CACIC,SAAU,iFACVC,OAAQ,6UAEZ,CACID,SAAU,4FACVC,OAAQ,0SAIhBC,gBAAiB,CACb,CACIC,KAAM,gBACNC,IAAK,sHAET,CACID,KAAM,sBACNC,IAAK,sHAET,CACID,KAAM,+BACNC,IAAK,sHAET,CACID,KAAM,wCACNC,IAAK,sHAET,CACID,KAAM,kBACNC,IAAK,sHAEZ,CACOD,KAAM,+CACZC,IAAK,2DAIPC,YAAY,qRClFuB,CACnCpB,QAAS,0BAETC,aAAa,8gBAEbC,MAAOC,yCACPC,WAAYD,+CAEZE,gBAAiBF,4DAEjBG,SAAU,MAEVC,KAAM,eAENC,aAAc,UAEdC,aAAa,wdAGbC,SAAS,k/BAWTC,QAAS,CACLC,WAAW,icAMXC,SAAS,mXAQbC,SAAU,CACN,CACIC,SACI,sGACJC,OACI,qMAER,CACID,SACI,8NACJC,OACI,0VAIZC,gBAAiB,CACb,CACIC,KAAM,oBACNC,IAAK,iEAET,CACID,KAAM,wCACNC,IAAK,8DAIbC,YAAY,0MZpDDrB","file":"static/js/0.07ff1976.chunk.js","sourcesContent":["\"use strict\";\r\nvar __generator = (this && this.__generator) || function (thisArg, body) {\r\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n function verb(n) { return function (v) { return step([n, v]); }; }\r\n function step(op) {\r\n if (f) throw new TypeError(\"Generator is already executing.\");\r\n while (_) try {\r\n 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;\r\n if (y = 0, t) op = [op[0] & 2, t.value];\r\n switch (op[0]) {\r\n case 0: case 1: t = op; break;\r\n case 4: _.label++; return { value: op[1], done: false };\r\n case 5: _.label++; y = op[1]; op = [0]; continue;\r\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n default:\r\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n if (t[2]) _.ops.pop();\r\n _.trys.pop(); continue;\r\n }\r\n op = body.call(thisArg, _);\r\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n }\r\n};\r\nvar __read = (this && this.__read) || function (o, n) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n if (!m) return o;\r\n var i = m.call(o), r, ar = [], e;\r\n try {\r\n while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n }\r\n catch (error) { e = { error: error }; }\r\n finally {\r\n try {\r\n if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n }\r\n finally { if (e) throw e.error; }\r\n }\r\n return ar;\r\n};\r\nvar __spread = (this && this.__spread) || function () {\r\n for (var ar = [], i = 0; i < arguments.length; i++) ar = ar.concat(__read(arguments[i]));\r\n return ar;\r\n};\r\nvar __values = (this && this.__values) || function (o) {\r\n var m = typeof Symbol === \"function\" && o[Symbol.iterator], i = 0;\r\n if (m) return m.call(o);\r\n return {\r\n next: function () {\r\n if (o && i >= o.length) o = void 0;\r\n return { value: o && o[i++], done: !o };\r\n }\r\n };\r\n};\r\nvar __importDefault = (this && this.__importDefault) || function (mod) {\r\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\r\n};\r\nObject.defineProperty(exports, \"__esModule\", { value: true });\r\nvar LinkedListNode_1 = __importDefault(require(\"./LinkedListNode\"));\r\n/**\r\n * A doubly linked list\r\n * ```ts\r\n * const list = new LinkedList(1, 2, 3);\r\n * const listFromArray = LinkedList.from([1, 2, 3]);\r\n * ```\r\n */\r\nvar LinkedList = /** @class */ (function () {\r\n function LinkedList() {\r\n var args = [];\r\n for (var _i = 0; _i < arguments.length; _i++) {\r\n args[_i] = arguments[_i];\r\n }\r\n this.head = null;\r\n this.tail = null;\r\n this.size = 0;\r\n for (var i = 0; i < arguments.length; i++) {\r\n this.append(arguments[i]);\r\n }\r\n }\r\n Object.defineProperty(LinkedList.prototype, \"length\", {\r\n /**\r\n * The length of the list\r\n */\r\n get: function () {\r\n return this.size;\r\n },\r\n enumerable: true,\r\n configurable: true\r\n });\r\n /**\r\n * Convert any iterable to a new linked list\r\n * ```javascript\r\n * const array = [1, 2, 3];\r\n * const list = LinkedList.from(array);\r\n * ```\r\n * @param iterable Any iterable datatype like Array or Map\r\n */\r\n LinkedList.from = function (iterable) {\r\n return new (LinkedList.bind.apply(LinkedList, __spread([void 0], iterable)))();\r\n };\r\n /**\r\n * Get the node data at a specified index, zero based\r\n * ```ts\r\n * new LinkedList(1, 2, 3).get(0); // 1\r\n * ```\r\n * @param index to retrieve data at\r\n */\r\n LinkedList.prototype.get = function (index) {\r\n var node = this.getNode(index);\r\n return node !== undefined ? node.data : undefined;\r\n };\r\n /**\r\n * Get the node at index, zero based\r\n * ```ts\r\n * new LinkedList(1, 2, 3).getNode(0);\r\n * // { prev: null, data: 1, next: LinkedListNode }\r\n * ```\r\n */\r\n LinkedList.prototype.getNode = function (index) {\r\n if (this.head === null || index < 0 || index >= this.length) {\r\n return undefined;\r\n }\r\n var asc = index < this.length / 2;\r\n var stopAt = asc ? index : this.length - index - 1;\r\n var nextNode = asc ? 'next' : 'prev';\r\n var currentNode = asc ? this.head : this.tail;\r\n for (var currentIndex = 0; currentIndex < stopAt; currentIndex++) {\r\n currentNode = currentNode[nextNode];\r\n }\r\n return currentNode;\r\n };\r\n /**\r\n * Return the first node and its index in the list that\r\n * satisfies the testing function\r\n * ```ts\r\n * new LinkedList(1, 2, 3).findNodeIndex(data => data === 1);\r\n * // { node: LinkedListNode, index: 0 }\r\n * ```\r\n * @param f A function to be applied to the data of each node\r\n */\r\n LinkedList.prototype.findNodeIndex = function (f) {\r\n var currentIndex = 0;\r\n var currentNode = this.head;\r\n while (currentNode) {\r\n if (f(currentNode.data, currentIndex, this)) {\r\n return {\r\n index: currentIndex,\r\n node: currentNode,\r\n };\r\n }\r\n currentNode = currentNode.next;\r\n currentIndex += 1;\r\n }\r\n return undefined;\r\n };\r\n /**\r\n * Returns the first node in the list that\r\n * satisfies the provided testing function. Otherwise undefined is returned.\r\n * ```ts\r\n * new LinkedList(1, 2, 3).findNode(data => data === 1);\r\n * // { prev: null, data: 1, next: LinkedListNode }\r\n * ```\r\n * @param f Function to test data against\r\n */\r\n LinkedList.prototype.findNode = function (f) {\r\n var nodeIndex = this.findNodeIndex(f);\r\n return nodeIndex !== undefined ? nodeIndex.node : undefined;\r\n };\r\n /**\r\n * Returns the value of the first element in the list that\r\n * satisfies the provided testing function. Otherwise undefined is returned.\r\n * ```ts\r\n * new LinkedList(1, 2, 3).find(data => data === 1); // 1\r\n * ```\r\n * @param f Function to test data against\r\n */\r\n LinkedList.prototype.find = function (f) {\r\n var nodeIndex = this.findNodeIndex(f);\r\n return nodeIndex !== undefined ? nodeIndex.node.data : undefined;\r\n };\r\n /**\r\n * Returns the index of the first node in the list that\r\n * satisfies the provided testing function. Ohterwise -1 is returned.\r\n * ```ts\r\n * new LinkedList(1, 2, 3).findIndex(data => data === 3); // 2\r\n * ```\r\n * @param f Function to test data against\r\n */\r\n LinkedList.prototype.findIndex = function (f) {\r\n var nodeIndex = this.findNodeIndex(f);\r\n return nodeIndex !== undefined ? nodeIndex.index : -1;\r\n };\r\n /**\r\n * Append one or any number of nodes to the end of the list.\r\n * This modifies the list in place and returns the list itself\r\n * to make this method chainable.\r\n * ```ts\r\n * new LinkedList(1).append(2).append(3, 4); // 1 <=> 2 <=> 3 <=> 4\r\n * ```\r\n * @param data Data to be stored in the node, takes any number of arguments\r\n */\r\n LinkedList.prototype.append = function () {\r\n var e_1, _a;\r\n var args = [];\r\n for (var _i = 0; _i < arguments.length; _i++) {\r\n args[_i] = arguments[_i];\r\n }\r\n try {\r\n for (var args_1 = __values(args), args_1_1 = args_1.next(); !args_1_1.done; args_1_1 = args_1.next()) {\r\n var data = args_1_1.value;\r\n var node = new LinkedListNode_1.default(data, this.tail, null, this);\r\n if (this.head === null) {\r\n this.head = node;\r\n }\r\n if (this.tail !== null) {\r\n this.tail.next = node;\r\n }\r\n this.tail = node;\r\n this.size += 1;\r\n }\r\n }\r\n catch (e_1_1) { e_1 = { error: e_1_1 }; }\r\n finally {\r\n try {\r\n if (args_1_1 && !args_1_1.done && (_a = args_1.return)) _a.call(args_1);\r\n }\r\n finally { if (e_1) throw e_1.error; }\r\n }\r\n return this;\r\n };\r\n /**\r\n * Synonym for append\r\n * ```ts\r\n * new LinkedList(1).push(2).push(3, 4); // 1 <=> 2 <=> 3 <=> 4\r\n * ```\r\n * @param data Data to be stored, takes any number of arguments\r\n */\r\n LinkedList.prototype.push = function () {\r\n var args = [];\r\n for (var _i = 0; _i < arguments.length; _i++) {\r\n args[_i] = arguments[_i];\r\n }\r\n this.append.apply(this, __spread(args));\r\n return this.length;\r\n };\r\n /**\r\n * Prepend any number of data arguments to the list. The\r\n * argument list is prepended as a block to reduce confusion:\r\n * ```javascript\r\n * new LinkedList(3, 4).prepend(0, 1, 2); // [0, 1, 2, 3, 4]\r\n * ```\r\n * @param data Data to be stored in the node, accepts any number of arguments\r\n */\r\n LinkedList.prototype.prepend = function () {\r\n var e_2, _a;\r\n var args = [];\r\n for (var _i = 0; _i < arguments.length; _i++) {\r\n args[_i] = arguments[_i];\r\n }\r\n var reverseArgs = Array.from(args).reverse();\r\n try {\r\n for (var reverseArgs_1 = __values(reverseArgs), reverseArgs_1_1 = reverseArgs_1.next(); !reverseArgs_1_1.done; reverseArgs_1_1 = reverseArgs_1.next()) {\r\n var data = reverseArgs_1_1.value;\r\n var node = new LinkedListNode_1.default(data, null, this.head, this);\r\n if (this.tail === null) {\r\n this.tail = node;\r\n }\r\n if (this.head !== null) {\r\n this.head.prev = node;\r\n }\r\n this.head = node;\r\n this.size += 1;\r\n }\r\n }\r\n catch (e_2_1) { e_2 = { error: e_2_1 }; }\r\n finally {\r\n try {\r\n if (reverseArgs_1_1 && !reverseArgs_1_1.done && (_a = reverseArgs_1.return)) _a.call(reverseArgs_1);\r\n }\r\n finally { if (e_2) throw e_2.error; }\r\n }\r\n return this;\r\n };\r\n /**\r\n * Insert a new node at a given index position. If index is\r\n * out of bounds, the node is appended, if index is negative\r\n * or 0, it will be prepended.\r\n * ```ts\r\n * new LinkedList(1, 3).insertAt(1, 2); // 1 <=> 2 <=> 3\r\n * ```\r\n * @param index The index to insert the new node at\r\n * @param data Data to be stored on the new node\r\n */\r\n LinkedList.prototype.insertAt = function (index, data) {\r\n if (this.head === null) {\r\n return this.append(data);\r\n }\r\n if (index <= 0) {\r\n return this.prepend(data);\r\n }\r\n var currentNode = this.head;\r\n var currentIndex = 0;\r\n while (currentIndex < index - 1 && currentNode.next !== null) {\r\n currentIndex += 1;\r\n currentNode = currentNode.next;\r\n }\r\n currentNode.insertAfter(data);\r\n return this;\r\n };\r\n /**\r\n * Remove the specified node from the list and return the removed\r\n * node afterwards.\r\n * ```ts\r\n * const list = new LinkedList(1, 2, 3);\r\n * list.removeNode(list.tail); // { prev: null, data: 3, next: null, list: null }\r\n * ```\r\n * @param node The node to be removed\r\n */\r\n LinkedList.prototype.removeNode = function (node) {\r\n if (node.list !== this) {\r\n throw new ReferenceError('Node does not belong to this list');\r\n }\r\n if (node.prev !== null) {\r\n node.prev.next = node.next;\r\n }\r\n if (node.next !== null) {\r\n node.next.prev = node.prev;\r\n }\r\n if (this.head === node) {\r\n this.head = node.next;\r\n }\r\n if (this.tail === node) {\r\n this.tail = node.prev;\r\n }\r\n this.size -= 1;\r\n node.next = null;\r\n node.prev = null;\r\n node.list = null;\r\n return node;\r\n };\r\n /**\r\n * Remove the node at the specified index\r\n * ```ts\r\n * new LinkedList(1, 2, 3).removeAt(2); // { prev: null, data: 3, next: null, list: null }\r\n * ```\r\n * @param index Index at which to remove\r\n */\r\n LinkedList.prototype.removeAt = function (index) {\r\n var node = this.getNode(index);\r\n return node !== undefined ? this.removeNode(node) : undefined;\r\n };\r\n /**\r\n * Insert a new node before the reference node\r\n * ```ts\r\n * const list = new LinkedList(1, 3);\r\n * list.insertBefore(list.tail, 2); // 1 <=> 2 <=> 3\r\n * ```\r\n * @param referenceNode The node reference\r\n * @param data Data to save in the node\r\n */\r\n LinkedList.prototype.insertBefore = function (referenceNode, data) {\r\n var node = new LinkedListNode_1.default(data, referenceNode.prev, referenceNode, this);\r\n if (referenceNode.prev === null) {\r\n this.head = node;\r\n }\r\n if (referenceNode.prev !== null) {\r\n referenceNode.prev.next = node;\r\n }\r\n referenceNode.prev = node;\r\n this.size += 1;\r\n return this;\r\n };\r\n /**\r\n * Sorts the linked list using the provided compare function\r\n * @param compare A function used to compare the data of two nodes. It should return\r\n * a boolean. True will insert a before b, false will insert b before a.\r\n * (a, b) => a < b or (1, 2) => 1 < 2 === true, 2 will be inserted after 1,\r\n * the sort order will be ascending.\r\n */\r\n LinkedList.prototype.sort = function (compare) {\r\n if (this.head === null || this.tail === null) {\r\n return this;\r\n }\r\n if (this.length < 2) {\r\n return this;\r\n }\r\n var quicksort = function (start, end) {\r\n if (start === end) {\r\n return;\r\n }\r\n var pivotData = end.data;\r\n var current = start;\r\n var split = start;\r\n while (current && current !== end) {\r\n var sort = compare(current.data, pivotData);\r\n if (sort) {\r\n if (current !== split) {\r\n var temp = split.data;\r\n split.data = current.data;\r\n current.data = temp;\r\n }\r\n split = split.next;\r\n }\r\n current = current.next;\r\n }\r\n end.data = split.data;\r\n split.data = pivotData;\r\n if (start.next === end.prev) {\r\n return;\r\n }\r\n if (split.prev && split !== start) {\r\n quicksort(start, split.prev);\r\n }\r\n if (split.next && split !== end) {\r\n quicksort(split.next, end);\r\n }\r\n };\r\n quicksort(this.head, this.tail);\r\n return this;\r\n };\r\n /**\r\n * Insert a new node after this one\r\n * ```ts\r\n * const list = new LinkedList(2, 3);\r\n * list.insertAfter(list.head, 1); // 1 <=> 2 <=> 3\r\n * ```\r\n * @param referenceNode The reference node\r\n * @param data Data to be saved in the node\r\n */\r\n LinkedList.prototype.insertAfter = function (referenceNode, data) {\r\n var node = new LinkedListNode_1.default(data, referenceNode, referenceNode.next, this);\r\n if (referenceNode.next === null) {\r\n this.tail = node;\r\n }\r\n if (referenceNode.next !== null) {\r\n referenceNode.next.prev = node;\r\n }\r\n referenceNode.next = node;\r\n this.size += 1;\r\n return this;\r\n };\r\n /**\r\n * Remove the first node from the list and return the data of the removed node\r\n * or undefined\r\n * ```ts\r\n * new LinkedList(1, 2, 3).shift(); // 1\r\n * ```\r\n */\r\n LinkedList.prototype.shift = function () {\r\n return this.removeFromAnyEnd(this.head);\r\n };\r\n /**\r\n * Remove the last node from the list and return the data of the removed node\r\n * or undefined if the list was empty\r\n * ```ts\r\n * new LinkedList(1, 2, 3).pop(); // 3\r\n * ```\r\n */\r\n LinkedList.prototype.pop = function () {\r\n return this.removeFromAnyEnd(this.tail);\r\n };\r\n /**\r\n * Merge the current list with another. Both lists will be\r\n * equal after merging.\r\n * ```ts\r\n * const list = new LinkedList(1, 2);\r\n * const otherList = new LinkedList(3);\r\n * list.merge(otherList);\r\n * (list === otherList); // true\r\n * ```\r\n * @param list The list to be merged\r\n */\r\n LinkedList.prototype.merge = function (list) {\r\n if (this.tail !== null) {\r\n this.tail.next = list.head;\r\n }\r\n if (list.head !== null) {\r\n list.head.prev = this.tail;\r\n }\r\n this.head = this.head || list.head;\r\n this.tail = list.tail || this.tail;\r\n this.size += list.size;\r\n list.size = this.size;\r\n list.head = this.head;\r\n list.tail = this.tail;\r\n };\r\n /**\r\n * Removes all nodes from a list\r\n *\r\n * ```ts\r\n * list.clear();\r\n * ```\r\n */\r\n LinkedList.prototype.clear = function () {\r\n this.head = null;\r\n this.tail = null;\r\n this.size = 0;\r\n return this;\r\n };\r\n /**\r\n * The slice() method returns a shallow copy of a\r\n * portion of a list into a new list object selected\r\n * from start to end (end not included).\r\n * The original list will not be modified.\r\n * ```ts\r\n * const list = new LinkedList(1, 2, 3, 4, 5);\r\n * const newList = list.slice(0, 3); // 1 <=> 2 <=> 3\r\n * ```\r\n * @param start Start index\r\n * @param end End index, optional\r\n */\r\n LinkedList.prototype.slice = function (start, end) {\r\n var list = new LinkedList();\r\n var finish = end;\r\n if (this.head === null || this.tail === null) {\r\n return list;\r\n }\r\n if (finish === undefined || finish < start) {\r\n finish = this.length;\r\n }\r\n var head = this.getNode(start);\r\n for (var i = 0; i < finish - start && head !== null && head !== undefined; i++) {\r\n list.append(head.data);\r\n head = head.next;\r\n }\r\n return list;\r\n };\r\n /**\r\n * The reverse() function reverses the list in place and returns the list\r\n * itself.\r\n * ```ts\r\n * new LinkedList(1, 2, 3).reverse(); // 3 <=> 2 <=> 1\r\n * ```\r\n */\r\n LinkedList.prototype.reverse = function () {\r\n var currentNode = this.head;\r\n while (currentNode) {\r\n var next = currentNode.next;\r\n currentNode.next = currentNode.prev;\r\n currentNode.prev = next;\r\n currentNode = currentNode.prev;\r\n }\r\n var tail = this.tail;\r\n this.tail = this.head;\r\n this.head = tail;\r\n return this;\r\n };\r\n /**\r\n * The forEach() method executes a provided function once for each list node.\r\n * ```ts\r\n * new LinkedList(1, 2, 3).forEach(data => log(data)); // 1 2 3\r\n * ```\r\n * @param f Function to execute for each element, taking up to three arguments.\r\n * @param reverse Indicates if the list should be walked in reverse order, default is false\r\n */\r\n LinkedList.prototype.forEach = function (f, reverse) {\r\n if (reverse === void 0) { reverse = false; }\r\n var currentIndex = reverse ? this.length - 1 : 0;\r\n var currentNode = reverse ? this.tail : this.head;\r\n var modifier = reverse ? -1 : 1;\r\n var nextNode = reverse ? 'prev' : 'next';\r\n while (currentNode) {\r\n f(currentNode.data, currentIndex, this);\r\n currentNode = currentNode[nextNode];\r\n currentIndex += modifier;\r\n }\r\n };\r\n /**\r\n * The map() method creates a new list with the results of\r\n * calling a provided function on every node in the calling list.\r\n * ```ts\r\n * new LinkedList(1, 2, 3).map(data => data + 10); // 11 <=> 12 <=> 13\r\n * ```\r\n * @param f Function that produces an node of the new list, taking up to three arguments\r\n * @param reverse Indicates if the list should be mapped in reverse order, default is false\r\n */\r\n LinkedList.prototype.map = function (f, reverse) {\r\n var _this = this;\r\n if (reverse === void 0) { reverse = false; }\r\n var list = new LinkedList();\r\n this.forEach(function (data, index) { return list.append(f(data, index, _this)); }, reverse);\r\n return list;\r\n };\r\n /**\r\n * The filter() method creates a new list with all nodes\r\n * that pass the test implemented by the provided function.\r\n * ```ts\r\n * new LinkedList(1, 2, 3, 4, 5).filter(data => data < 4); // 1 <=> 2 <=> 3\r\n * ```\r\n * @param f Function to test each node data in the list. Return true to keep the node\r\n * @param reverse Indicates if the list should be filtered in reverse order, default is false\r\n */\r\n LinkedList.prototype.filter = function (f, reverse) {\r\n var _this = this;\r\n if (reverse === void 0) { reverse = false; }\r\n var list = new LinkedList();\r\n this.forEach(function (data, index) {\r\n if (f(data, index, _this)) {\r\n list.append(data);\r\n }\r\n }, reverse);\r\n return list;\r\n };\r\n /**\r\n * Reduce over each node in the list\r\n * ```ts\r\n * new LinkedList(1, 2, 3).reduce(n => n += 1, 0); // 3\r\n * ```\r\n * @param f A reducer function\r\n * @param start An initial value\r\n * @returns The final state of the accumulator\r\n */\r\n LinkedList.prototype.reduce = function (f, start, reverse) {\r\n if (reverse === void 0) { reverse = false; }\r\n var currentIndex = reverse ? this.length - 1 : 0;\r\n var modifier = reverse ? -1 : 1;\r\n var nextNode = reverse ? 'prev' : 'next';\r\n var currentElement = reverse ? this.tail : this.head;\r\n var result;\r\n if (start !== undefined) {\r\n result = start;\r\n }\r\n else if (currentElement) {\r\n result = currentElement.data;\r\n currentElement = currentElement[nextNode];\r\n }\r\n else {\r\n throw new TypeError('Reduce of empty LinkedList with no initial value');\r\n }\r\n while (currentElement) {\r\n result = f(result, currentElement.data, currentIndex, this);\r\n currentIndex += modifier;\r\n currentElement = currentElement[nextNode];\r\n }\r\n return result;\r\n };\r\n /**\r\n * Convert the linked list to an array\r\n * ```ts\r\n * new LinkedList(1, 2, 3).toArray(); // [1, 2, 3]\r\n * ```\r\n */\r\n LinkedList.prototype.toArray = function () {\r\n return __spread(this);\r\n };\r\n /**\r\n * Convert a linked list to string\r\n * ```ts\r\n * new LinkedList('one', 'two', 'three').toString(' <=> ') === 'one <=> two <=> three';\r\n * ```\r\n * @param separator Optional string to be placed in between data nodes, default is one space\r\n */\r\n LinkedList.prototype.toString = function (separator) {\r\n if (separator === void 0) { separator = ' '; }\r\n return this.reduce(function (s, data) { return \"\" + s + separator + data; });\r\n };\r\n /**\r\n * The iterator implementation\r\n * ```ts\r\n * const list = new LinkedList(1, 2, 3);\r\n * for (const data of list) { log(data); } // 1 2 3\r\n * ```\r\n */\r\n LinkedList.prototype[Symbol.iterator] = function () {\r\n var element;\r\n return __generator(this, function (_a) {\r\n switch (_a.label) {\r\n case 0:\r\n element = this.head;\r\n _a.label = 1;\r\n case 1:\r\n if (!(element !== null)) return [3 /*break*/, 3];\r\n return [4 /*yield*/, element.data];\r\n case 2:\r\n _a.sent();\r\n element = element.next;\r\n return [3 /*break*/, 1];\r\n case 3: return [2 /*return*/];\r\n }\r\n });\r\n };\r\n /** Private helper function to reduce duplication of pop() and shift() methods */\r\n LinkedList.prototype.removeFromAnyEnd = function (node) {\r\n return node !== null ? this.removeNode(node).data : undefined;\r\n };\r\n return LinkedList;\r\n}());\r\nexports.default = LinkedList;\r\n","\"use strict\";\r\nvar __importDefault = (this && this.__importDefault) || function (mod) {\r\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\r\n};\r\nObject.defineProperty(exports, \"__esModule\", { value: true });\r\nvar LinkedList_1 = __importDefault(require(\"./LinkedList\"));\r\n/**\r\n * The class which represents one link or node in a linked list\r\n * ```ts\r\n * const node = new LinkedListNode(1, null, null, null);\r\n * ```\r\n */\r\nvar LinkedListNode = /** @class */ (function () {\r\n function LinkedListNode(\r\n /** Data stored on the node */\r\n data, \r\n /** The previous node in the list */\r\n prev, \r\n /** The next link in the list */\r\n next, \r\n /** The list this node belongs to */\r\n list) {\r\n this.data = data;\r\n this.prev = prev;\r\n this.next = next;\r\n this.list = list;\r\n }\r\n Object.defineProperty(LinkedListNode.prototype, \"value\", {\r\n /**\r\n * Alias to .data\r\n * ```ts\r\n * new LinkedList(1, 2, 3).head.value; // 1\r\n * ```\r\n */\r\n get: function () {\r\n return this.data;\r\n },\r\n enumerable: true,\r\n configurable: true\r\n });\r\n Object.defineProperty(LinkedListNode.prototype, \"index\", {\r\n /**\r\n * Get the index of this node\r\n * ```ts\r\n * new LinkedList(1, 2, 3).head.index; // 0\r\n * ```\r\n */\r\n get: function () {\r\n var _this = this;\r\n if (!this.list) {\r\n return undefined;\r\n }\r\n return this.list.findIndex(function (value) { return value === _this.value; });\r\n },\r\n enumerable: true,\r\n configurable: true\r\n });\r\n /**\r\n * Insert a new node before this one\r\n * ```ts\r\n * new LinkedList(2, 3).head.insertBefore(1); // 1 <=> 2 <=> 3\r\n * ```\r\n * @param data Data to save in the node\r\n */\r\n LinkedListNode.prototype.insertBefore = function (data) {\r\n return this.list !== null\r\n ? this.list.insertBefore(this, data)\r\n : new LinkedList_1.default(data, this.data);\r\n };\r\n /**\r\n * Insert new data after this node\r\n * ```ts\r\n * new LinkedList(1, 2).tail.insertAfter(3); // 1 <=> 2 <=> 3\r\n * ```\r\n * @param data Data to be saved in the node\r\n */\r\n LinkedListNode.prototype.insertAfter = function (data) {\r\n return this.list !== null\r\n ? this.list.insertAfter(this, data)\r\n : new LinkedList_1.default(this.data, data);\r\n };\r\n /**\r\n * Remove this node\r\n * ```ts\r\n * new LinkedList(1, 2, 3, 4).tail.remove(); // 1 <=> 2 <=> 3\r\n * ```\r\n */\r\n LinkedListNode.prototype.remove = function () {\r\n if (this.list === null) {\r\n throw new ReferenceError('Node does not belong to any list');\r\n }\r\n return this.list.removeNode(this);\r\n };\r\n return LinkedListNode;\r\n}());\r\nexports.default = LinkedListNode;\r\n","import LinkedList from \"ts-linked-list\";\r\nimport { ChapterArticle } from \"../cocApi\";\r\n\r\nimport { article as article1_1 } from \"./article-1.1\";\r\nimport { article as article1_2 } from \"./article-1.2\";\r\nimport { article as article1_3 } from \"./article-1.3\";\r\nimport { article as article1_4 } from \"./article-1.4\";\r\nimport { article as article2_1 } from \"./article-2.1\";\r\nimport { article as article2_2 } from \"./article-2.2\";\r\nimport { article as article2_3 } from \"./article-2.3\";\r\nimport { article as article2_4 } from \"./article-2.4\";\r\nimport { article as article3_1 } from \"./article-3.1\";\r\nimport { article as article3_2 } from \"./article-3.2\";\r\nimport { article as article3_3 } from \"./article-3.3\";\r\nimport { article as article3_4 } from \"./article-3.4\";\r\n\r\nlet articles: LinkedList = new LinkedList();\r\narticles.push(article1_1, article1_2, article1_3, article1_4);\r\narticles.push(article2_1, article2_2, article2_3, article2_4);\r\narticles.push(article3_1, article3_2, article3_3, article3_4);\r\n\r\nexport default articles;\r\n","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We have zero tolerance for corruption\",\r\n\r\n introduction: `

Fighting corruption is one of today’s most important global challenges. Corruption increases inequality and undermines the very foundation of our democratic and financial systems. As Sweden is ranked one of the least corrupt countries in the world, we have both an opportunity and a responsibility to support our partners by combating all forms of corruption.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/1.1.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/1.1_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_1.1.jpg\",\r\n\r\n tocIndex: \"1.1\",\r\n\r\n link: \"/chapter/1.1\",\r\n\r\n chapterColor: \"blueDark\",\r\n\r\n keyTakeaways:\r\n \"

We have zero tolerance for bribery and corruption. In general, that means we never accept or offer gifts, travel or other benefits to or from any partner or client. Consult our policy or your manager for information of exceptions.

\",\r\n\r\n standFor: `\r\n

We have a zero-tolerance policy towards any form of corruption and are committed to the highest norms of business conduct. We advocate free and fair trade, strive for transparent and fair competition and follow ethical standards. We always follow our Authorisation Instruction when signing agreements and undertake appropriate due diligence assessing the competence, capacity and reputation when evaluating potential partners and sponsorships.

\r\n

We strive to always base our procurement and contracting decisions on the best value expected to be received. This means taking price, but also quality, performance, competency, compliance, suitability and sustainability criteria into account.

\r\n\t\t

As we have a global presence, we comply with applicable national and local anti-bribery and anti-corruption laws. In case of conflicting terms, Swedish norms and laws take precedence when local norms and laws are less strict.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"The client I am currently working with has invited me to a conference on sustainable mining and offers to pay for my attendance, flight and accommodation. Can I accept the offer?\",\r\n answer: \"You cannot let the client cover any costs for you. But you can attend the conference as long as it has a clear business purpose and is arranged in a transparent manner.\"\r\n },\r\n {\r\n question: \"A Swedish company has a container held up at customs in Kenya. The local customs official demands a payment to get the products cleared. The company has contacted my colleague for help. What do I do?\",\r\n answer: `As we have zero tolerance towards all forms of bribes or facilitation payments, this is unacceptable. If you feel comfortable, please inform your colleague that bribery is an offense. If this is ignored and/or you suspect a violation, report this to a manager or through our anonymous Whistleblower function WhistleB.`\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"Anti-Bribery and Corruption Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/EtaiVbGrAmlDgxeCK_mqUY8BWUH9Nt-hPIFRbQmGsKOq9A?e=P8CiZe\"\r\n },\r\n {\r\n text: \"Purchasing Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/EtaiVbGrAmlDgxeCK_mqUY8BWUH9Nt-hPIFRbQmGsKOq9A?e=P8CiZe\"\r\n },\r\n {\r\n text: \"Directive on Business Entertainment and Gifts\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/EtaiVbGrAmlDgxeCK_mqUY8BWUH9Nt-hPIFRbQmGsKOq9A?e=P8CiZe\"\r\n },\r\n {\r\n text: \"Authorisation Instruction\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/EtaiVbGrAmlDgxeCK_mqUY8BWUH9Nt-hPIFRbQmGsKOq9A?e=P8CiZe\"\r\n },\r\n {\r\n text: \"Code on Gifts, Rewards and other Benefits in Business (Näringslivskoden).\",\r\n url: \"http://3afvm642sqoq9muh73hsqhtz-wpengine.netdna-ssl.com/wp-content/uploads/2015/11/141120-IMM_Code_of_Business_Conduct_.pdf\"\r\n }\r\n ],\r\n\r\n definitions: `\r\n

A Bribe/Bribery is an offer to pay, a payment, a promise to pay, or the authorisation of payment of something of value, whether directly or indirectly, for an improper purpose. Such improper purposes include influencing any act or decision from a public official or to secure any other improper advantage in order to obtain or retain business.

\r\n

Corruption is the misuse of entrusted power for private gain. As such, corruption has a broader definition than bribery and includes, but is not limited to, bribery, fraud, embezzlement and nepotism. This includes actions taken for financial or other reasons, including conflicts of interest.

\r\n\t\t

Examples of gifts of minimal value are corporate merchandise such as pens or notebooks, coffee or lunch at meetings and conferences. This does not include memberships, promotions and benefits, even if they are of low or no monetary value.

\r\n `\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We think twice before meeting public officials\",\r\n\r\n introduction: `

Meeting with public officials is an important part of helping our clients establish and build relations in new markets. \r\n It is important to keep in mind that public officials are often subject to stricter rules and restrictions than representatives of private organisations. \r\n We recommend that we never meet with public officials alone and strictly prohibit offering or accepting gifts to or from public officials.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/1.2.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/1.2_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_1.2.jpg\",\r\n\r\n tocIndex: \"1.2\",\r\n \r\n link: \"/chapter/1.2\",\r\n\r\n chapterColor: \"blueDark\",\r\n\r\n keyTakeaways:\r\n \"

Be extra cautious when meeting with government officials: avoid taking meetings alone and never contribute with Business Sweden’s funds to political parties, candidates or campaigns.

\",\r\n\r\n standFor: `\r\n

We never offer or accept gifts to or from public officials or meet them in a non-transparent way. We never interact with public officials in order to or with risk to improperly influence decisions.

\r\n

We never use Business Sweden funds or resources to contribute, directly or indirectly, to any political party, candidate or campaign.

\r\n

Our way of working and our promotion activities are based on independent analysis and facts.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"I have established a good contact with a public official. She has become a friend and our families spend a lot of time together. She has offered me and my family to borrow her house in Nice this summer. Can I do that?\",\r\n answer: \"We never give or accept gifts. This applies whether you have established a friendship with a client or public official, the value of the gift, or if the gift is offered during your free time or vacation. The same applies if your partner or child receives a benefit.\"\r\n },\r\n {\r\n question: \"Can I attend dinners with current or prospective clients?\",\r\n answer: \"Yes, you can. However, you should cover your own cost of drinks and preferably also food. Do not order expensive items from the menu, and never let client dinners influence any business decisions you make.\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"Anti-Bribery and Corruption Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/EtaiVbGrAmlDgxeCK_mqUY8BWUH9Nt-hPIFRbQmGsKOq9A?e=P8CiZe\"\r\n },\r\n {\r\n text: \"Directive on Business Entertainment and Gifts\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/EufyaKNuep9FsjYVJP1HwW0BsZJWtp8K2drcaE1-C-m2KA?e=gTTqsv\"\r\n },\r\n {\r\n text: \"Purchasing Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/EufyaKNuep9FsjYVJP1HwW0BsZJWtp8K2drcaE1-C-m2KA?e=gTTqsv\"\r\n },\r\n {\r\n text: \"Code on Gifts, Rewards and other Benefits in Business (Näringslivskoden).\",\r\n url: \"http://3afvm642sqoq9muh73hsqhtz-wpengine.netdna-ssl.com/wp-content/uploads/2015/11/141120-IMM_Code_of_Business_Conduct_.pdf\"\r\n }\r\n ],\r\n\r\n definitions: `\r\n

A public official is an official or employee of a government or public organisation (including departments or agencies thereof ), or a person acting in an official governmental capacity. This includes employees of state-run or state-owned entities and international organisations.

\r\n

Examples of gifts of minimal value are corporate merchandise such as pens or notebooks, coffee or lunch at meetings and conferences. This does not include memberships, promotions and benefits, even if they are low or no monetary value.

\r\n `\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We operate safely & securely\",\r\n\r\n introduction: `

Our international presence is vital to carry out our mission: to promote Sweden as an attractive business partner and create opportunities for Swedish companies around the world. However, there are significant security risks when working and travelling in complex environments. \r\n\t\t\t\t\tSuch risks cannot always be avoided but should always be mitigated. Our approach is to take security into consideration in all our activities and markets with all our stakeholders, as well as when handling information. We provide guidelines, leadership and work practices to ensure that we carry out our mission as safely and securely as possible.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/1.3.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/1.3_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_1.3.jpg\",\r\n\r\n tocIndex: \"1.3\",\r\n \r\n link: \"/chapter/1.3\",\r\n\r\n chapterColor: \"blueDark\",\r\n\r\n keyTakeaways:\r\n \"

Keep up to date with the security situation in the regions you are visiting and behave accordingly. Check our security recommendations and always behave in a way that is not offensive or deliberately put you in danger.

\",\r\n\r\n standFor: `\r\n

We strive to provide all our employees with a safe and secure working environment and to minimise risks to our core assets, information, integrity, reputation and brand. We always consider how security risks are linked to specific travels, information, projects or locations and how they could potentially affect us.

\r\n

We provide security instructions for local offices, residences and travel destinations as well as specific safety and security guidelines for delegations and events. We also take into account the security recommendations of local authorities and the Swedish Ministry for Foreign Affairs.

\r\n\t\t

We never share sensitive information and we handle our own and all our stakeholder’s information and data with the strictest confidentiality and integrity.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"I am going to work at our office in Johannesburg. What should I think about before moving?\",\r\n answer: \"Prepare yourself by reading into Business Sweden’s Country Risk Database, install the security app, conduct Business Sweden’s security E-learning training, asking the local employees and manager for advice on where to live, provide the office with details to next of kin, report your stay to the local Embassy.\"\r\n },\r\n {\r\n question: \"During the train ride to a business meeting, my colleague is working on his computer and is sharing sensitive information about a client on the phone. How should I act?\",\r\n answer: \"Inform your colleague to be more careful with sensitive information and that we always handle information and data with the strictest confidentiality and integrity. This also applies when you leave your computer open in meetings or at the office.\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"Security Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/ErWfIxo5nCBJg9noiG9nQE0B4QRIdp14478M4Qk3Jdugyg?e=xDBGow\"\r\n },\r\n {\r\n text: \"Travel Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Ei0cceKK69JEmO6N35Cp6AcBmqX4Fo586wodqSbdOw37Yw?e=DRTSCR\"\r\n },\r\n {\r\n text: \"Travel Instructions\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Ei0cceKK69JEmO6N35Cp6AcBmqX4Fo586wodqSbdOw37Yw?e=DRTSCR\"\r\n },\r\n {\r\n text: \"Info & IT Security Instruction\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/ErWfIxo5nCBJg9noiG9nQE0B4QRIdp14478M4Qk3Jdugyg?e=xDBGow\"\r\n },\r\n {\r\n text: \"Delegation Event Security Instruction\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/ErWfIxo5nCBJg9noiG9nQE0B4QRIdp14478M4Qk3Jdugyg?e=xDBGow\"\r\n },\r\n\t {\r\n text: \"Office Residence Security Instruction\",\r\n\t\t url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/ErWfIxo5nCBJg9noiG9nQE0B4QRIdp14478M4Qk3Jdugyg?e=xDBGow\"\r\n },\r\n\t {\r\n text: \"NDA agreements\",\r\n\t\t url: \"https://swedishtrade.sharepoint.com/sites/Information/Legal/SitePages/Home.aspx\"\r\n },\r\n\t {\r\n text: \"The Business Sweden Country Risk Database\",\r\n\t\t url: \"https://swedishtrade-gws.azurewebsites.net/Information\"\r\n },\r\n\t {\r\n text: \"GDPR Legislation\",\r\n\t\t url: \"https://gdpr-info.eu/\"\r\n\t },\r\n ],\r\n\r\n definitions: `\r\n

Risk is something occurring that will have a negative impact on Business Sweden’s objectives. Risk is measured in terms of probability and impact. Examples of risks include crime, political unrest and corruption, intelligence threats, information theft, cyber-attacks, terrorism, natural disasters, health and safety challenges, environmental hazards and poor infrastructure.

\r\n

Risk mitigation is defined as identifying, analysing and rating security risks combined with decisions or actions taken to reduce risks to an acceptable level.

\r\n `\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We share information responsibly\",\r\n\r\n introduction: `

We encourage our employees to promote Business Sweden during and outside of work, as long as it is done in a considerate and professional manner. Every member of the Business Sweden team is expected to apply our values when handling and sharing information about us in all internal and external channels, including on social media and when representing us in client meetings and at social events.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/1.4.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/1.4_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_1.4.jpg\",\r\n\r\n tocIndex: \"1.4\",\r\n \r\n link: \"/chapter/1.4\",\r\n\r\n chapterColor: \"blueDark\",\r\n\r\n keyTakeaways:\r\n \"

Communicate our values and service offering in a clear and defined way, backed up by facts and knowledge. Never reveal sensitive information about Business Sweden or our clients or engage in negative, aggressive or unlawful interactions online or offline.

\",\r\n\r\n standFor: `\r\n

We build and promote our culture and values by our way of communicating, online and offline as well as internally and externally. We are proud to be a part of Business Sweden and this shows in all our communication.

\r\n

We communicate in a way that is honest, clear, business-oriented and relevant. We never share sensitive, confidential or non-public information about us or our clients, or information that can influence shares or other securities and lead to insider trading. We follow internal IT security regulations, laws and local regulations.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"I received a call from a journalist asking about Business Sweden’s sustainability policy for working with international companies investing in Sweden. What do I do? \",\r\n answer: \" Only designated spokespersons are authorised to speak with the media on behalf of Business Sweden. If you do take a call from the media, it is important to be polite and helpful. Explain to the journalist that you are not the right person to speak on behalf of Business Sweden in these matters and put them in contact with the Head of Public Relations at MarCom & Digitalisation.\"\r\n },\r\n {\r\n question: \"With my client’s permission, I’ve shared our project achievement on social media. Someone has commented on the post asking about the ethics of this project. Since this is not my area of expertise, what do I do?\",\r\n answer: \" We encourage being transparent about our work and having an open dialogue with external parties. If you do not know the answer, contact the relevant Business Sweden team before providing a response. In this case, contact Head of Sustainability or the Head of Public Relations at MarCom & Digitalisation.\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"MarCom & Digitalisation guidebook\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/EsxsXLj6UqpOrJl8R50U8YAB0uctmm9TdCwTvr-S83g_Iw?e=UU3KtB\"\r\n },\r\n {\r\n text: \"Info & IT Security Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/ErWfIxo5nCBJg9noiG9nQE0B4QRIdp14478M4Qk3Jdugyg?e=xDBGow\"\r\n },\r\n {\r\n text: \"MarCom Business Partner\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/EsxsXLj6UqpOrJl8R50U8YAB0uctmm9TdCwTvr-S83g_Iw?e=UU3KtB\"\r\n }\r\n ],\r\n\r\n definitions: `\r\n

A public official is an official or employee of a government or public organisation (including departments or agencies thereof ), or a person acting in an official governmental capacity. This includes employees of state-run or state-owned entities and international organisations.

\r\n

Examples of gifts of minimal value are corporate merchandise such as pens or notebooks, coffee or lunch at meetings and conferences. This does not include memberships, promotions and benefits, even if they are low or no monetary value.

\r\n `\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We promise fair working conditions\",\r\n\r\n introduction: `

Fair working terms and conditions are keystones in creating the outstanding workplace we want Business Sweden to be. To us, this means providing a high-quality business with a safe and stimulating working environment. We believe that where our employees thrive and grow, they will do - and be at - their best in all our markets and offices.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/2.1.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/2.1_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_2.1.jpg\",\r\n\r\n tocIndex: \"2.1\",\r\n \r\n link: \"/chapter/2.1\",\r\n\r\n chapterColor: \"blueLight\",\r\n\r\n keyTakeaways:\r\n \"

We understand our responsibility to provide a good and healthy work environment for all our employees, in all markets. As team members, we collaborate, communicate and give feed-back to help each other grow. We speak up and let our managers know of any misconduct.

\",\r\n\r\n standFor: `\r\n

We understand our responsibility to our employees and strive to create a good working environment characterised by equality, respect and trust for the individual.

\r\n

We provide clearly communicated expectations for all roles in the organisation globally. Development opportunities are available for all employees based on aspiration, engagement and performance.

\r\n\t\t

We have fair remuneration and benefits packages for each employee based on local regulations, standards and market conditions. We consider working environment laws and regulations in each country to be a minimum standard that we strive to exceed, and we support continuous improvements in employee health and wellbeing.

\r\n\t\t

Working hours and working conditions shall always be in line with local legislation and applicable collective bargaining agreements.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"During the past couple of months, my working hours have been far too long. I am having trouble sleeping and shutting off work during evenings and weekends. What can I do?\",\r\n answer: \"We strive to provide fair working conditions for all our employees. Sometimes and during periods the workload can be heavy but working overtime should not be the norm and you should always be allowed time for recovery. If you feel that your working hours or workload affects your health in any way, you should proactively bring this up with your manager or another manager you trust, as well as talk to HR.\"\r\n },\r\n {\r\n question: \"In my office, people of several different religions work. My boss is also religious, and I feel like he treats team members with different religious views poorly. What can I do?\",\r\n answer: \"We never tolerate any form or discrimination due to religious (or any other) grounds. If you are comfortable, bring this up directly with your manager. If not, contact HR.\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"Working Environment Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Eni1rKyKvlJBoF5E7B1TGokBE3XP7Ml2dEVIZnxbg89hrw?e=qnghjy\"\r\n },\r\n {\r\n text: \"Equality, Discrimination and Harassment Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Eni1rKyKvlJBoF5E7B1TGokBE3XP7Ml2dEVIZnxbg89hrw?e=qnghjy\"\r\n },\r\n {\r\n text: \"Conflict of Interest and Nepotism Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Eni1rKyKvlJBoF5E7B1TGokBE3XP7Ml2dEVIZnxbg89hrw?e=qnghjy\"\r\n }\r\n ],\r\n\r\n definitions: null\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We ensure fair recruitment processes\",\r\n\r\n introduction: `

As the services we offer are highly based on loyalty and trust, we need to keep the same high standards in our own operations and recruitments. To ensure that our business advice and consultancy is based on the best interest of our customers, we actively work to avoid creating or maintaining any conflicts of interest.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/2.2.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/2.2_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_2.2.jpg\",\r\n\r\n tocIndex: \"2.2\",\r\n \r\n link: \"/chapter/2.2\",\r\n\r\n chapterColor: \"blueLight\",\r\n\r\n keyTakeaways:\r\n \"

Never favour family by employing or having a supervisor/subordinate relationship with a family member. Never occupy rival assignments or employments without written consent.

\",\r\n\r\n standFor: `\r\n

We actively work to be fair and objective in our recruitment. Hiring people who are connected to current employees can cause various problems like favouritism, conflicts of interest and family discord.

\r\n

We avoid any kind of nepotism. Nepotism includes all relationships established by blood, marriage or legal action, as well as domestic partners and their close family.

\r\n\t\t

We never occupy rival assignments or employments that could harm our reputation.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"We are looking for a new business expert and my sister-in-law would be perfect for this position. Can I hire her?\",\r\n answer: \"Yes, we can hire her, but you cannot be involved in the recruitment process and she cannot have a supervisor/ subordinate relationship with you. Bring this up with your immediate manager or HR so that they can take this further.\"\r\n },\r\n {\r\n question: \"My boss has hired a close relative as an associate, without telling HR that they are related. He gets special treatment and benefits, like more flexible working hours and fun business trips. What should I do?\",\r\n answer: \"This is unacceptable. Business Sweden avoid any kind of nepotism and has zero tolerance towards favouritism. All recruitment processes must be transparent and free from any conflict of interest. You should contact HR.\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"Conflict of Interest and Nepotism Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Eni1rKyKvlJBoF5E7B1TGokBE3XP7Ml2dEVIZnxbg89hrw?e=qnghjy\"\r\n },\r\n {\r\n text: \"Equality, Discrimination and Harassment Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Eni1rKyKvlJBoF5E7B1TGokBE3XP7Ml2dEVIZnxbg89hrw?e=qnghjy\"\r\n },\r\n {\r\n text: \"Working Environment Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Eni1rKyKvlJBoF5E7B1TGokBE3XP7Ml2dEVIZnxbg89hrw?e=qnghjy\"\r\n }\r\n ],\r\n\r\n definitions: `\r\n

A Conflict of Interest is when a person or entity with an obligation to Business Sweden has a conflicting interest, duty, or commitment. Having a conflict of interest is not in itself improper, but corruption can arise.

\r\n

Nepotism is a form of favouritism based on acquaintances and familiar relationships whereby someone in an official position exploits his or her power and authority to provide a job or favour to a family member or friend.

\r\n `\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We create opportunities for personal growth\",\r\n\r\n introduction: `

The well-being and performance of our employees are keys to our success as an organisation. We always strive to find great talents and provide them with the means and environment to grow with us. In support of this, our aim is always to offer attractive career opportunities that are clear, transparent and available for all. We see professional growth as a combination of personal achievements and working in a culture where collaboration and helpfulness is a natural part of our work environment.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/2.3.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/2.3_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_2.3.jpg\",\r\n\r\n tocIndex: \"2.3\",\r\n \r\n link: \"/chapter/2.3\",\r\n\r\n chapterColor: \"blueLight\",\r\n\r\n keyTakeaways:\r\n \"

We work to ensure that all our employees feel that they can have a rewarding career at Business Sweden. We offer clear and transparent career opportunities for our employees to grow and advance through. Our positions are always open for all to apply.

\",\r\n\r\n standFor: `\r\n

We want our employees to thrive and fulfil their highest potential. We strive to offer the best possible working conditions for our team members to perform as successfully as possible.

\r\n

We offer career opportunities and clarity as to how our employees can grow and advance. We strive to make role requirements as clear as possible and have a common competency framework and career path for our global workforces. Our internal job market is global, transparent and open for all employees.

\r\n\t\t

We value team members with diverse backgrounds related to culture, gender, age, ethnicity, race, religion and belief, disability, nationality, sexual orientation and gender identity. The diversity of our people is an important foundation of our culture and builds a workplace where everyone can contribute with unique experiences, perspectives and cultures.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"I really enjoy my job and want to advance quickly. How can I best do that?\",\r\n answer: \" Take a proactive discussion with you manager to explain your ambition. Ask for clarity and support to perform at your best in your current role and strive to also contribute to your team and colleagues. Involve your manager in creating a plan to advance and follow up on this with regular feedback and development sessions. Good luck!\"\r\n },\r\n {\r\n question: \"A desirable position is soon to be open in a market near mine. I want to apply. How can I find the job listing?\",\r\n answer: \"All our job openings are always listed publicly at our Intranet. You can always contact your HR Business Partner to learn more. Good luck with your application!\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"Business Sweden Performance Management Process\",\r\n url: \"https://swedishtrade.sharepoint.com/sites/Information/employee/SitePages/Home.aspx\"\r\n }\r\n ], \r\n\r\n definitions: null\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We strive for gender equality & diversity\",\r\n\r\n introduction: `

Achieving gender equality is one of the most important challenges in Agenda 2030 and the Global Goals. Besides being one of the major global human rights challenges, inequality and discrimination is a huge waste of human capital and potential. We believe that we can contribute positively to gender equality by having an international impact both as role models and by spreading our way of working.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/2.4.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/2.4_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_2.4.jpg\",\r\n\r\n tocIndex: \"2.4\",\r\n \r\n link: \"/chapter/2.4\",\r\n\r\n chapterColor: \"blueLight\",\r\n\r\n keyTakeaways:\r\n \"

We never withhold promotions or salary raise, mistreat, harass or discriminate anyone on your team or organisation due to gender, age, ethnicity, religion or disability.

\",\r\n\r\n standFor: `\r\n

We believe that men and women should have equal opportunities for employment, education and development. We oppose all discrimination due to gender expression, ethnicity, religion or belief, disability, sexual orientation or age and we want all employees to be given the opportunity to work in an environment free from harassment.

\r\n

Any decisions on recruitment, selection, education, promotion and career development are based on objective and professional criteria related to the proven performance, the role in question and assessed potential.

\r\n\t\t

We aim for an equal distribution with regards to gender in the workplace when recruiting, and we are actively facilitating for men and women to combine parenting with work.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"My team is looking for a new manager and I think I would be perfect for the position. I feel like my manager often favours men and that I might miss out on a promotion because I am a woman. What can I do?\",\r\n answer: \"This is unacceptable. We oppose all forms of discrimination and base all promotion decisions on objective criteria. Ask for transparent and clear feedback throughout the process and contact HR if you need support.\"\r\n },\r\n {\r\n question: \"In the region where I work, the majority of leading positions are being held by people of Swedish nationality. I feel like I don’t have the same opportunities to grow. What can I do?\",\r\n answer: \" At Business Sweden, equal opportunities for advancement are a core value. We actively work to increase diversity and gender balance on all levels. Bring up your concern with your manager and set a plan for your career development. You can also reach out to HR for support and information on possible upcoming opportunities.\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"Equality, Discrimination and Harassment Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Eni1rKyKvlJBoF5E7B1TGokBE3XP7Ml2dEVIZnxbg89hrw?e=qnghjy\"\r\n },\r\n {\r\n text: \"Working Environment Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Eni1rKyKvlJBoF5E7B1TGokBE3XP7Ml2dEVIZnxbg89hrw?e=qnghjy\"\r\n },\r\n {\r\n text: \"Related information on our Intranet\",\r\n url: \"https://swedishtrade.sharepoint.com/sites/Information/employee/SitePages/Home.aspx\"\r\n }\r\n ],\r\n\r\n definitions: `\r\n

Discrimination is mistreatment of any kind due to gender or gender expression, ethnicity, religion or belief, disability, sexual orientation, and/or age.

\r\n

Gender Equality is the equal access to resources and opportunities regardless of gender, including economic participation and decision-making.

\r\n `\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We care for the environment\",\r\n\r\n introduction: `

How we succeed in carrying out our mission has no importance if we do not care for our planet. As a global organisation based on Swedish norms and values, we play an important role in informing and influencing companies and societies worldwide in environmental responsibility as well as their role in contributing to the Agenda 2030. We do this by ensuring that our actions and decisions are always in the best interests of customers, our organisation as well as the environment and society.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/3.1.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/3.1_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_3.1.jpg\",\r\n\r\n tocIndex: \"3.1\",\r\n \r\n link: \"/chapter/3.1\",\r\n\r\n chapterColor: \"blueMid\",\r\n\r\n keyTakeaways:\r\n \"

Always consider the environmental impact when purchasing travels, goods and services. Avoid unnecessary consumption and make informed choices regarding the whole life cycle of goods, projects and activities.

\",\r\n\r\n standFor: `\r\n

We always consider the UN Global Goals (SDGs), Agenda 2030 and the Ten Principles of the UN Global Compact in all internal and external purchasing, procurement, activities and transactions.

\r\n

We always strive to inform, inspire and educate the importance of environmental responsibility and sustainable business as part of our offering to our partners.

\r\n\t\t

We strive to choose services and products provided by environmentally friendly and reliable companies and strive to create a sustainable environment and culture in our offices. We select suppliers according to fair, pre-defined criteria with supplier qualification, including environmental requirements.

\r\n\t\t

When bidding, we set personal interests aside to analyse the risks of direct negative impact on the environment, as well as the risks of corporate misconduct and financial irregularities.

\r\n\t\t

We consider virtual meetings to be the norm and only travel to physical meetings when absolutely necessary. When so, we encourage travelling by the most environmentally friendly option.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"We have a big upcoming event. I have been assigned to find a venue and to purchase all food, beverage and tableware. What should I think about in order to make it as environmentally friendly as possible?\",\r\n answer: \"Always be conscious about what venue and partner you choose. Try to keep the menu local, mostly plant based and avoid food and beverage waste. Use rented china if possible, otherwise try to find recyclable and environmentally friendly products (made from materials such as paper and bamboo) for the single-use tableware.\"\r\n },\r\n {\r\n question: \"A Swedish company has approached us for advice on selling a product with big environmental effects to India. There are no local environmental restrictions forbidding the product. How shall I proceed and act?\",\r\n answer: \"We always take a restrictive position towards businesses with high negative environmental impact. For new projects, we should take into consideration the total carbon emissions during the life-cycle of big projects and activities. If you are uncertain, ask your manager or our Sustainability office.\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"Purchasing Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/EufyaKNuep9FsjYVJP1HwW0BsZJWtp8K2drcaE1-C-m2KA?e=gTTqsv\"\r\n },\r\n {\r\n text: \"Travel Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Ei0cceKK69JEmO6N35Cp6AcBmqX4Fo586wodqSbdOw37Yw?e=DRTSCR\"\r\n },\r\n {\r\n text: \"Ten Principles of the UN Global Compact\",\r\n url: \"https://www.unglobalcompact.org/what-is-gc/mission/principles\"\r\n },\r\n {\r\n text: \"UN Global Goals for Sustainable Development\",\r\n url: \"https://sustainabledevelopment.un.org/?menu=1300\"\r\n }\r\n ],\r\n\r\n definitions: `\r\n

Environmental impact is the consequences (often negative) of our travel, manufacturing and consumption that require natural resources and/or cause emissions.

\r\n `\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We respect people & develop societies\",\r\n\r\n introduction: `

We are a global organisation, conducting business in many different markets with varying cultures, norms and legislations. When doing so, we always bring our values and Swedish norms and standards with us. We strive to support and implement solutions for global sustainability and contribute to building safe, just and stable societies in all our markets. We treat everyone we meet equally and with respect, regardless of hierarchy, cultural or religious background, gender, sexual orientation or ethnicity. In terms of legislation, we always follow the strictest norm or law in every matter and situation.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/3.2.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/3.2_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_3.2.jpg\",\r\n\r\n tocIndex: \"3.2\",\r\n \r\n link: \"/chapter/3.2\",\r\n\r\n chapterColor: \"blueMid\",\r\n\r\n keyTakeaways:\r\n \"

Treat everyone with equal respect and dignity. Never buy or support any kind of sexual services, whether during business hours or after. Report any violation you encounter, whether within or outside of our organisation.

\",\r\n\r\n standFor: `\r\n

We treat everyone within and outside of our organisation with the same amount of respect.

\r\n

We respect the Swedish legislation “Sweden’s Sex Purchase Act” (Swedish: Sexköpslagen) and have zero tolerance on sexual services. This applies to payments for sexual services, visits to strip clubs, pornography, as well as all types of contacts that may support trafficking or prostitution.

\r\n\t\t

As children are especially worthy of protection and care, we have zero tolerance towards child labour, abuse or mistreatment of children. We follow the ILO Conventions and Recommendations on child labour and expect our contractors, business partners or third-party representatives to do the same.

\r\n\t\t

As we always carry our values with us, we strive to contribute to societal development in all the markets we operate in. We never facilitate money laundering or give advice aimed to directly or indirectly circumvent the law, evade taxation, or promote injustice of any kind.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"I am at a client dinner and my manager is suggesting that we visit a strip club afterwards. This feels unethical and makes me uncomfortable. What should I do?\",\r\n answer: \"Any form of sexual services is strictly forbidden for everyone our Code of Conduct applies to, regardless of where and when it may take place. You are right to react and should not participate. Raise the issue with your immediate or another manager you trust and have a dialogue with the clients in question.\"\r\n },\r\n {\r\n question: \"My colleague and I are on a business trip in a country with a different religion than ours. My colleague is openly disrespectful towards the driver and hotel staff. How should I act?\",\r\n answer: \"We never tolerate any discrimination against people inside or outside of our organisation due to religion, gender, culture or background. Raise the issue with your immediate manager or another manager you trust, or contact HR.\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"Working Environment Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Eni1rKyKvlJBoF5E7B1TGokBE3XP7Ml2dEVIZnxbg89hrw?e=qnghjy\"\r\n },\r\n {\r\n text: \"Equality, Discrimination and Harassment Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Eni1rKyKvlJBoF5E7B1TGokBE3XP7Ml2dEVIZnxbg89hrw?e=qnghjy\"\r\n },\r\n {\r\n text: \"UN Global Compact\",\r\n url: \"https://www.unglobalcompact.org/what-is-gc/mission/principles\"\r\n },\r\n {\r\n text: \"ILO Conventions and Recommendations on Child Labour\",\r\n url: \"https://www.ilo.org/ipec/facts/ILOconventionsonchildlabour/lang--en/index.htm\"\r\n },\r\n ],\r\n\r\n definitions: null\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We travel safely & responsibly\",\r\n\r\n introduction: `

Travel is one of the major contributors to the current global climate crisis. We strive to reduce our carbon footprint by making virtual meetings the norm and consider the environmental impact in terms of how and when we travel. We always use the most cost-effective, environmentally friendly, safe and secure means of travel and accommodation.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/3.3.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/3.3_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_3.3.jpg\",\r\n\r\n tocIndex: \"3.3\",\r\n \r\n link: \"/chapter/3.3\",\r\n\r\n chapterColor: \"blueMid\",\r\n\r\n keyTakeaways:\r\n \"

Always consider virtual meetings before deciding to travel. When you do travel, make sure to do so in a way that is as safe and environmentally friendly as possible. Keep up to date with the security situation where you are headed.

\",\r\n\r\n standFor: `\r\n

We consider virtual meetings to be the norm and only travel to physical meetings when absolutely necessary.

\r\n

When physical meetings are necessary, we encourage travelling by train, public transport or other environmentally friendly options. When unavoidable, flights are booked through the bureau Egencia due to financial, safety and security reasons, and to track Business Sweden’s carbon footprint. We choose the most sustainable flight options: light packing, direct routes and with modern fleets when possible.

\r\n\t\t

We encourage all employees to commute to work via the most environmentally friendly option available.

\r\n\t\t

We support local and sustainable companies as the preferred choice when choosing taxi- and rental car company, restaurants, products and services.

\r\n\t\t

We always consider the security risks in the countries we are traveling to, prepare ourselves and take actions accordingly. We provide security instructions and specific safety and security guidelines for business trips, delegations and events. We follow the security recommendations provided by Business Sweden, local authorities and the Swedish Ministry for Foreign Affairs.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question: \"I am in a place where a terrorist act has just been carried out. What do I do?\",\r\n answer: \"If you are in immediate danger, get yourself to a safer location. Follow instructions from authorities. Press the SOS button on your security app and follow the instructions. If that is not possible, call the local authorities and/or our emergency number. If you are in safety, confirm this in the safety app and to your manager.\"\r\n },\r\n {\r\n question: \"I am in Sweden for sales meetings and need to go from Gothenburg to Stockholm. Can I fly?\",\r\n answer: \"Only when no other option is possible. We strive to reduce our carbon footprint through environmentally conscious business travel and encourage virtual meetings, for example conference calls or via Skype. If travel is necessary, we should always travel with the most sustainable travel option.\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"Travel Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Ei0cceKK69JEmO6N35Cp6AcBmqX4Fo586wodqSbdOw37Yw?e=DRTSCR\"\r\n },\r\n {\r\n text: \"Travel Instructions\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Ei0cceKK69JEmO6N35Cp6AcBmqX4Fo586wodqSbdOw37Yw?e=DRTSCR\"\r\n },\r\n {\r\n text: \"Travel Security Instructions\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/Ei0cceKK69JEmO6N35Cp6AcBmqX4Fo586wodqSbdOw37Yw?e=DRTSCR\"\r\n },\r\n {\r\n text: \"Delegation Event Security Instruction\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/ErWfIxo5nCBJg9noiG9nQE0B4QRIdp14478M4Qk3Jdugyg?e=xDBGow\"\r\n },\r\n {\r\n text: \"Security Policy\",\r\n url: \"https://swedishtrade.sharepoint.com/:f:/s/Projects/t88asoc/ErWfIxo5nCBJg9noiG9nQE0B4QRIdp14478M4Qk3Jdugyg?e=xDBGow\"\r\n },\r\n\t {\r\n text: \"Business Sweden’s Country Risk Database\",\r\n\t\t url: \"https://swedishtrade-gws.azurewebsites.net/Information\"\r\n }\r\n ],\r\n\r\n definitions: `\r\n

High-Risk Countries are countries with low levels of public security and law enforcement, where the risk for crime, natural disasters, terrorism or violence is increased and where the political or military situation is unpredictable.

\r\n `\r\n};","import { ChapterArticle } from \"../cocApi\";\r\n\r\nexport const article: ChapterArticle = {\r\n heading: \"We protect human rights\",\r\n\r\n introduction: `

Human rights are fundamental, equal to everyone and shall never be violated. We strive to conduct business with the highest norms and never tolerate direct or indirect human rights violations, as a consequence of our operations. We actively put demands on businesses to take responsibility for their goods and services not to have a negative effect on societies, the environment or on people. We strive to be role models for protecting human rights and work to have a positive effect in all our markets of operation.

`,\r\n\r\n image: process.env.PUBLIC_URL + \"/assets/stamps/3.4.svg\",\r\n stampImage: process.env.PUBLIC_URL + \"/assets/stamps/3.4_stamp.svg\",\r\n\r\n backgroundImage: process.env.PUBLIC_URL + \"/assets/chapter-article-bg/Header_3.4.jpg\",\r\n\r\n tocIndex: \"3.4\",\r\n \r\n link: \"/chapter/3.4\",\r\n\r\n chapterColor: \"blueMid\",\r\n\r\n keyTakeaways: `

Human Rights violations are always intolerable. You are urged to report and act on any suspected breeches, especially against children. Stay educated on the Human Rights situation in your field of expertise and your market of operations.

\r\n

Always consider the environmental impact when purchasing travels, goods and services. Avoid unnecessary consumption and make informed choices regarding the whole life cycle of goods, projects and activities.

`,\r\n\r\n standFor: `\r\n

We have signed the UN Global Compact and integrated its ten principles in our Code of Conduct. This means that we:

\r\n \r\n

We actively work to put pressure and demands on contractors, third parties and clients to secure that human rights, labour rights and freedom of association are never violated within their organisations or operations.

\r\n\t\t

We educate all our employees in sustainability and human rights to ensure that minimising negative effects on societies, the environment and on people is part of our advisory and offering.

\r\n `,\r\n\r\n meaning: {\r\n asEmployee: `\r\n \r\n `,\r\n asLeader: `\r\n \r\n `\r\n },\r\n\r\n howToAct: [\r\n {\r\n question:\r\n \"There is evidence that a contractor that we work with in my market uses child labour. What do I do?\",\r\n answer:\r\n \"We never accept human rights violations, in any form. This is subject to immediate termination of the partnership. Let your manager or another manager you trust know about this and act swiftly.\"\r\n },\r\n {\r\n question:\r\n \"I am researching partner companies for a major Swedish corporation in Bangladesh. One of the most promising potential partners have previously been accused of human rights violations. Can I still recommend this company?\",\r\n answer:\r\n \"As we never accept human rights violations, you are advised not to choose those partners without first undertaking a comprehensive due diligence. This is to ensure that actions have been taken to rightfully compensate the victims and that the company shall not be complicit in any further abuse. Report your findings to your project manager.\"\r\n }\r\n ],\r\n\r\n relatedMaterial: [\r\n {\r\n text: \"UN Global Compact\",\r\n url: \"https://www.unglobalcompact.org/what-is-gc/mission/principles\"\r\n },\r\n {\r\n text: \"Universal Declaration of Human Rights\",\r\n url: \"https://www.un.org/en/universal-declaration-human-rights/\"\r\n }\r\n ],\r\n\r\n definitions: `\r\n

Environmental impact is the consequences (often negative) of our travel, manufacturing and consumption that require natural resources and/or cause emissions.

\r\n `\r\n};\r\n"],"sourceRoot":""}