{"version":3,"sources":["webpack:///./node_modules/@ckeditor/ckeditor5-engine/src/model/batch.js","webpack:///./node_modules/@ckeditor/ckeditor5-engine/src/model/differ.js","webpack:///./node_modules/@ckeditor/ckeditor5-engine/src/index.js"],"names":["Batch","type","this","operations","operation","batch","push","op","baseVersion","Differ","markerCollection","_markerCollection","_changesInElement","Map","_elementSnapshots","_changedMarkers","_changeCount","_cachedChanges","_cachedChangesWithGraveyard","item","_isInInsertedElement","parent","_markRemove","startOffset","offsetSize","_markInsert","range","Range","_createOn","getMarkersIntersectingRange","marker","markerRange","getRange","bufferMarkerChange","name","affectsData","position","offset","nodes","maxOffset","getItems","shallow","_markAttribute","sourcePosition","isEqual","targetPosition","getShiftedBy","howMany","sourceParentInserted","targetParentInserted","getMovedRangeStart","_createFromPositionAndShift","splitElement","splitPosition","insertionPosition","graveyardPosition","mergedElement","graveyardParent","mergedIntoElement","markerName","oldRange","newRange","buffered","get","delete","set","result","change","Array","from","map","data","size","options","includeChangesInGraveyard","slice","diffSet","keys","element","changes","sort","a","b","snapshotChildren","elementChildren","_getChildrenSnapshot","getChildren","actions","_generateActionsFromChanges","length","i","j","action","_getInsertDiff","_getRemoveDiff","elementAttributes","attributes","snapshotAttributes","Position","_createAt","index","offsetToIndex","getChild","_getAttributesDiff","root","rootName","changeCount","isBefore","prevIndex","prevDiff","thisDiff","isConsecutiveTextRemove","isConsecutiveTextAdd","isConsecutiveAttributeChange","isFlat","attributeKey","attributeOldValue","attributeNewValue","end","filter","v","_changesInGraveyardFilter","clear","changeItem","count","_markChange","_removeAllNestedChanges","_makeSnapshot","_getChangesForElement","_handleChange","splice","has","inc","nodesToHandle","old","incEnd","oldEnd","unshift","intersectionLength","howManyAfter","attributePart","oldAttributes","newAttributes","diffs","key","oldValue","newValue","start","clone","is","children","snapshot","child","getAttributes","oldChildrenLength","oldChildrenHandled","repeat","split","entry","posInGy","rangeInGy"],"mappings":"sNAqBqBA,E,WAQpB,aAAgC,IAAnBC,EAAmB,uDAAZ,UAAY,uBAO/BC,KAAKC,WAAa,GAalBD,KAAKD,KAAOA,E,4DA0BCG,GAIb,OAHAA,EAAUC,MAAQH,KAClBA,KAAKC,WAAWG,KAAMF,GAEfA,I,kCApBU,2BACjB,YAAkBF,KAAKC,WAAvB,+CAAoC,KAAxBI,EAAwB,QACnC,GAAwB,OAAnBA,EAAGC,YACP,OAAOD,EAAGC,aAHK,kFAOjB,OAAO,S,gQC9CYC,E,WAMpB,WAAaC,GAAmB,uBAO/BR,KAAKS,kBAAoBD,EAWzBR,KAAKU,kBAAoB,IAAIC,IAU7BX,KAAKY,kBAAoB,IAAID,IAY7BX,KAAKa,gBAAkB,IAAIF,IAS3BX,KAAKc,aAAe,EAYpBd,KAAKe,eAAiB,KAYtBf,KAAKgB,4BAA8B,K,2DAmBvBC,GACZ,IAAKjB,KAAKkB,qBAAsBD,EAAKE,QAArC,CAIAnB,KAAKoB,YAAaH,EAAKE,OAAQF,EAAKI,YAAaJ,EAAKK,YACtDtB,KAAKuB,YAAaN,EAAKE,OAAQF,EAAKI,YAAaJ,EAAKK,YAEtD,IAAME,EAAQC,OAAMC,UAAWT,GARZ,uBAUnB,YAAsBjB,KAAKS,kBAAkBkB,4BAA6BH,GAA1E,+CAAoF,KAAxEI,EAAwE,QAC7EC,EAAcD,EAAOE,WAE3B9B,KAAK+B,mBAAoBH,EAAOI,KAAMH,EAAaA,EAAaD,EAAOK,cAbrD,kFAiBnBjC,KAAKe,eAAiB,Q,sCAWNb,GAKhB,OAASA,EAAUH,MAClB,IAAK,SACJ,GAAKC,KAAKkB,qBAAsBhB,EAAUgC,SAASf,QAClD,OAGDnB,KAAKuB,YAAarB,EAAUgC,SAASf,OAAQjB,EAAUgC,SAASC,OAAQjC,EAAUkC,MAAMC,WAExF,MAED,IAAK,eACL,IAAK,kBACL,IAAK,kBAAmB,2BACvB,YAAoBnC,EAAUsB,MAAMc,SAAU,CAAEC,SAAS,IAAzD,+CAAoE,KAAxDtB,EAAwD,QAC9DjB,KAAKkB,qBAAsBD,EAAKE,SAIrCnB,KAAKwC,eAAgBvB,IANC,kFASvB,MAED,IAAK,SACL,IAAK,OACL,IAAK,WAGJ,GACCf,EAAUuC,eAAeC,QAASxC,EAAUyC,iBAC5CzC,EAAUuC,eAAeG,aAAc1C,EAAU2C,SAAUH,QAASxC,EAAUyC,gBAE9E,OAGD,IAAMG,EAAuB9C,KAAKkB,qBAAsBhB,EAAUuC,eAAetB,QAC3E4B,EAAuB/C,KAAKkB,qBAAsBhB,EAAUyC,eAAexB,QAE3E2B,GACL9C,KAAKoB,YAAalB,EAAUuC,eAAetB,OAAQjB,EAAUuC,eAAeN,OAAQjC,EAAU2C,SAGzFE,GACL/C,KAAKuB,YAAarB,EAAUyC,eAAexB,OAAQjB,EAAU8C,qBAAqBb,OAAQjC,EAAU2C,SAGrG,MAED,IAAK,SACJ,GAAK7C,KAAKkB,qBAAsBhB,EAAUgC,SAASf,QAClD,OAGDnB,KAAKoB,YAAalB,EAAUgC,SAASf,OAAQjB,EAAUgC,SAASC,OAAQ,GACxEnC,KAAKuB,YAAarB,EAAUgC,SAASf,OAAQjB,EAAUgC,SAASC,OAAQ,GAExE,IAAMX,EAAQC,OAAMwB,4BAA6B/C,EAAUgC,SAAU,GARvD,uBAUd,YAAsBlC,KAAKS,kBAAkBkB,4BAA6BH,GAA1E,+CAAoF,KAAxEI,EAAwE,QAC7EC,EAAcD,EAAOE,WAE3B9B,KAAK+B,mBAAoBH,EAAOI,KAAMH,EAAaA,EAAaD,EAAOK,cAb1D,kFAgBd,MAED,IAAK,QACJ,IAAMiB,EAAehD,EAAUiD,cAAchC,OAGvCnB,KAAKkB,qBAAsBgC,IAChClD,KAAKoB,YAAa8B,EAAchD,EAAUiD,cAAchB,OAAQjC,EAAU2C,SAIrE7C,KAAKkB,qBAAsBhB,EAAUkD,kBAAkBjC,SAC5DnB,KAAKuB,YAAarB,EAAUkD,kBAAkBjC,OAAQjB,EAAUkD,kBAAkBjB,OAAQ,GAItFjC,EAAUmD,mBACdrD,KAAKoB,YAAalB,EAAUmD,kBAAkBlC,OAAQjB,EAAUmD,kBAAkBlB,OAAQ,GAG3F,MAED,IAAK,QAEJ,IAAMmB,EAAgBpD,EAAUuC,eAAetB,OAEzCnB,KAAKkB,qBAAsBoC,EAAcnC,SAC9CnB,KAAKoB,YAAakC,EAAcnC,OAAQmC,EAAcjC,YAAa,GAIpE,IAAMkC,EAAkBrD,EAAUmD,kBAAkBlC,OAEpDnB,KAAKuB,YAAagC,EAAiBrD,EAAUmD,kBAAkBlB,OAAQ,GAGvE,IAAMqB,EAAoBtD,EAAUyC,eAAexB,OAE7CnB,KAAKkB,qBAAsBsC,IAChCxD,KAAKuB,YAAaiC,EAAmBtD,EAAUyC,eAAeR,OAAQmB,EAAcjB,WAGrF,MAKFrC,KAAKe,eAAiB,O,yCAYH0C,EAAYC,EAAUC,EAAU1B,GACnD,IAAM2B,EAAW5D,KAAKa,gBAAgBgD,IAAKJ,GAErCG,GAOLA,EAASD,SAAWA,EACpBC,EAAS3B,YAAcA,EAEG,MAArB2B,EAASF,UAAyC,MAArBE,EAASD,UAG1C3D,KAAKa,gBAAgBiD,OAAQL,IAZ9BzD,KAAKa,gBAAgBkD,IAAKN,EAAY,CACrCC,WACAC,WACA1B,kB,2CAoBF,IAAM+B,EAAS,GADK,uBAGpB,YAAgChE,KAAKa,gBAArC,+CAAuD,iCAAzCmB,EAAyC,KAAnCiC,EAAmC,KAC9B,MAAnBA,EAAOP,UACXM,EAAO5D,KAAM,CAAE4B,OAAMR,MAAOyC,EAAOP,YALjB,kFASpB,OAAOM,I,wCASP,IAAMA,EAAS,GADE,uBAGjB,YAAgChE,KAAKa,gBAArC,+CAAuD,iCAAzCmB,EAAyC,KAAnCiC,EAAmC,KAC9B,MAAnBA,EAAON,UACXK,EAAO5D,KAAM,CAAE4B,OAAMR,MAAOyC,EAAON,YALpB,kFASjB,OAAOK,I,0CASP,OAAOE,MAAMC,KAAMnE,KAAKa,iBAAkBuD,KAAK,SAAAnD,GAAI,MAClD,CACCe,KAAMf,EAAM,GACZoD,KAAM,CACLX,SAAUzC,EAAM,GAAIyC,SACpBC,SAAU1C,EAAM,GAAI0C,gB,uCAiBP,2BAChB,YAA4B3D,KAAKa,gBAAjC,+CAAmD,iCAAnCoD,EAAmC,KAClD,GAAKA,EAAOhC,YACX,OAAO,GAHO,kFAQhB,OAAOjC,KAAKU,kBAAkB4D,KAAO,I,mCAmBuB,IAAjDC,EAAiD,uDAAvC,CAAEC,2BAA2B,GAElD,GAAKxE,KAAKe,eACT,OAAKwD,EAAQC,0BACLxE,KAAKgB,4BAA4ByD,QAEjCzE,KAAKe,eAAe0D,QAK7B,IAAIC,EAAU,GAX8C,uBAc5D,YAAuB1E,KAAKU,kBAAkBiE,OAA9C,+CAAuD,KAA3CC,EAA2C,QAEhDC,EAAU7E,KAAKU,kBAAkBmD,IAAKe,GAAUE,MAAM,SAAEC,EAAGC,GAChE,OAAKD,EAAE5C,SAAW6C,EAAE7C,OACd4C,EAAEhF,MAAQiF,EAAEjF,KAIC,UAAVgF,EAAEhF,MAAoB,EAAI,EAG3B,EAGDgF,EAAE5C,OAAS6C,EAAE7C,QAAU,EAAI,KAI7B8C,EAAmBjF,KAAKY,kBAAkBiD,IAAKe,GAE/CM,EAAkBC,EAAsBP,EAAQQ,eAGhDC,EAAUC,EAA6BL,EAAiBM,OAAQV,GAElEW,EAAI,EACJC,EAAI,EA1B8C,uBA6BtD,YAAsBJ,EAAtB,+CAAgC,KAApBK,EAAoB,QAC/B,GAAgB,MAAXA,EAEJhB,EAAQtE,KAAMJ,KAAK2F,eAAgBf,EAASY,EAAGN,EAAiBM,GAAIxD,OAEpEwD,SACM,GAAgB,MAAXE,EAEXhB,EAAQtE,KAAMJ,KAAK4F,eAAgBhB,EAASY,EAAGP,EAAkBQ,GAAIzD,OAErEyD,SACM,GAAgB,MAAXC,EAAiB,OAEtBG,EAAoBX,EAAiBM,GAAIM,WACzCC,EAAqBd,EAAkBQ,GAAIK,WAC7CtE,OAAK,EAET,GAAkC,SAA7B0D,EAAiBM,GAAIxD,KACzBR,EAAQ,IAAIC,OAAOuE,OAASC,UAAWrB,EAASY,GAAKQ,OAASC,UAAWrB,EAASY,EAAI,QAChF,CACN,IAAMU,EAAQtB,EAAQuB,cAAeX,GACrChE,EAAQ,IAAIC,OAAOuE,OAASC,UAAWrB,EAASY,GAAKQ,OAASC,UAAWrB,EAAQwB,SAAUF,GAAS,KAKrG,EAAAxB,GAAQtE,KAAR,uBAAiBJ,KAAKqG,mBAAoB7E,EAAOuE,EAAoBF,KAErEL,IACAC,SAGAD,IACAC,KA9DoD,oFAdK,kFAkF5Df,EAAQI,MAAM,SAAEC,EAAGC,GAIlB,OAAKD,EAAE7C,SAASoE,MAAQtB,EAAE9C,SAASoE,KAC3BvB,EAAE7C,SAASoE,KAAKC,SAAWvB,EAAE9C,SAASoE,KAAKC,UAAY,EAAI,EAI9DxB,EAAE7C,SAASQ,QAASsC,EAAE9C,UAEnB6C,EAAEyB,YAAcxB,EAAEwB,YAInBzB,EAAE7C,SAASuE,SAAUzB,EAAE9C,WAAc,EAAI,KAIjD,IAAM,IAAIsD,EAAI,EAAGkB,EAAY,EAAGlB,EAAId,EAAQa,OAAQC,IAAM,CACzD,IAAMmB,EAAWjC,EAASgC,GACpBE,EAAWlC,EAASc,GAGpBqB,EACY,UAAjBF,EAAS5G,MAAqC,UAAjB6G,EAAS7G,MACrB,SAAjB4G,EAAS3E,MAAoC,SAAjB4E,EAAS5E,MACrC2E,EAASzE,SAASQ,QAASkE,EAAS1E,UAG/B4E,EACY,UAAjBH,EAAS5G,MAAqC,UAAjB6G,EAAS7G,MACrB,SAAjB4G,EAAS3E,MAAoC,SAAjB4E,EAAS5E,MACrC2E,EAASzE,SAASf,QAAUyF,EAAS1E,SAASf,QAC9CwF,EAASzE,SAASC,OAASwE,EAASpB,QAAUqB,EAAS1E,SAASC,OAG3D4E,EACY,aAAjBJ,EAAS5G,MAAwC,aAAjB6G,EAAS7G,MACzC4G,EAASzE,SAASf,QAAUyF,EAAS1E,SAASf,QAC9CwF,EAASnF,MAAMwF,QAAUJ,EAASpF,MAAMwF,QACxCL,EAASzE,SAASC,OAASwE,EAASpB,QAAUqB,EAAS1E,SAASC,QAChEwE,EAASM,cAAgBL,EAASK,cAClCN,EAASO,mBAAqBN,EAASM,mBACvCP,EAASQ,mBAAqBP,EAASO,kBAEnCN,GAA2BC,GAAwBC,GACvDJ,EAASpB,SAEJwB,IACJJ,EAASnF,MAAM4F,IAAMT,EAASnF,MAAM4F,IAAIxE,aAAc,IAGvD8B,EAASc,GAAM,MAEfkB,EAAYlB,EAIdd,EAAUA,EAAQ2C,QAAQ,SAAAC,GAAC,OAAIA,KA7I6B,2BAgJ5D,YAAoB5C,EAApB,+CAA8B,KAAlBzD,EAAkB,eACtBA,EAAKuF,YAEM,aAAbvF,EAAKlB,cACFkB,EAAKiB,gBACLjB,EAAKsE,SArJ8C,kFA+J5D,OANAvF,KAAKc,aAAe,EAGpBd,KAAKgB,4BAA8B0D,EAAQD,QAC3CzE,KAAKe,eAAiB2D,EAAQ2C,OAAQE,GAEjChD,EAAQC,0BACLxE,KAAKgB,4BAELhB,KAAKe,iB,8BAQbf,KAAKU,kBAAkB8G,QACvBxH,KAAKY,kBAAkB4G,QACvBxH,KAAKa,gBAAgB2G,QACrBxH,KAAKe,eAAiB,O,kCAWVI,EAAQgB,EAAQU,GAC5B,IAAM4E,EAAa,CAAE1H,KAAM,SAAUoC,SAAQU,UAAS6E,MAAO1H,KAAKc,gBAElEd,KAAK2H,YAAaxG,EAAQsG,K,kCAWdtG,EAAQgB,EAAQU,GAC5B,IAAM4E,EAAa,CAAE1H,KAAM,SAAUoC,SAAQU,UAAS6E,MAAO1H,KAAKc,gBAElEd,KAAK2H,YAAaxG,EAAQsG,GAE1BzH,KAAK4H,wBAAyBzG,EAAQgB,EAAQU,K,qCAS/B5B,GACf,IAAMwG,EAAa,CAAE1H,KAAM,YAAaoC,OAAQlB,EAAKI,YAAawB,QAAS5B,EAAKK,WAAYoG,MAAO1H,KAAKc,gBAExGd,KAAK2H,YAAa1G,EAAKE,OAAQsG,K,kCAUnBtG,EAAQsG,GAEpBzH,KAAK6H,cAAe1G,GAGpB,IAAM0D,EAAU7E,KAAK8H,sBAAuB3G,GAG5CnB,KAAK+H,cAAeN,EAAY5C,GAGhCA,EAAQzE,KAAMqH,GAId,IAAM,IAAIjC,EAAI,EAAGA,EAAIX,EAAQU,OAAQC,IAC/BX,EAASW,GAAI3C,QAAU,IAC3BgC,EAAQmD,OAAQxC,EAAG,GAEnBA,O,4CAYoBZ,GACtB,IAAIC,EAUJ,OARK7E,KAAKU,kBAAkBuH,IAAKrD,GAChCC,EAAU7E,KAAKU,kBAAkBmD,IAAKe,IAEtCC,EAAU,GAEV7E,KAAKU,kBAAkBqD,IAAKa,EAASC,IAG/BA,I,oCASOD,GACR5E,KAAKY,kBAAkBqH,IAAKrD,IACjC5E,KAAKY,kBAAkBmD,IAAKa,EAASO,EAAsBP,EAAQQ,kB,oCAYtD8C,EAAKrD,GAiBnBqD,EAAIC,cAAgBD,EAAIrF,QAjBK,2BAmB7B,YAAmBgC,EAAnB,+CAA6B,KAAjBuD,EAAiB,QACtBC,EAASH,EAAI/F,OAAS+F,EAAIrF,QAC1ByF,EAASF,EAAIjG,OAASiG,EAAIvF,QAEhC,GAAiB,UAAZqF,EAAInI,OACS,UAAZqI,EAAIrI,OACHmI,EAAI/F,QAAUiG,EAAIjG,OACtBiG,EAAIjG,QAAU+F,EAAIrF,QACPqF,EAAI/F,OAASmG,IACxBF,EAAIvF,SAAWqF,EAAIC,cACnBD,EAAIC,cAAgB,IAIL,UAAZC,EAAIrI,MACHmI,EAAI/F,OAASiG,EAAIjG,SACrBiG,EAAIjG,QAAU+F,EAAIrF,SAIH,aAAZuF,EAAIrI,MACR,GAAKmI,EAAI/F,QAAUiG,EAAIjG,OACtBiG,EAAIjG,QAAU+F,EAAIrF,aACZ,GAAKqF,EAAI/F,OAASmG,EAAS,CAWjC,IAAMzF,EAAUuF,EAAIvF,QAEpBuF,EAAIvF,QAAUqF,EAAI/F,OAASiG,EAAIjG,OAI/B0C,EAAQ0D,QAAS,CAChBxI,KAAM,YACNoC,OAAQkG,EACRxF,QAASA,EAAUuF,EAAIvF,QACvB6E,MAAO1H,KAAKc,iBAMhB,GAAiB,UAAZoH,EAAInI,KAAmB,CAC3B,GAAiB,UAAZqI,EAAIrI,KACR,GAAKsI,GAAUD,EAAIjG,OAClBiG,EAAIjG,QAAU+F,EAAIrF,aACZ,GAAKwF,GAAUC,EACrB,GAAKJ,EAAI/F,OAASiG,EAAIjG,OAAS,CAC9B,IAAMqG,EAAqBH,EAASD,EAAIjG,OAExCiG,EAAIjG,OAAS+F,EAAI/F,OAEjBiG,EAAIvF,SAAW2F,EACfN,EAAIC,eAAiBK,OAErBJ,EAAIvF,SAAWqF,EAAIC,cACnBD,EAAIC,cAAgB,OAGrB,GAAKD,EAAI/F,QAAUiG,EAAIjG,OACtB+F,EAAIC,eAAiBC,EAAIvF,QACzBuF,EAAIvF,QAAU,OACR,GAAKqF,EAAI/F,OAASmG,EAAS,CACjC,IAAME,EAAqBF,EAASJ,EAAI/F,OAExCiG,EAAIvF,SAAW2F,EACfN,EAAIC,eAAiBK,EAcxB,GATiB,UAAZJ,EAAIrI,OACHsI,GAAUD,EAAIjG,OAClBiG,EAAIjG,QAAU+F,EAAIrF,QACPqF,EAAI/F,OAASiG,EAAIjG,SAC5B+F,EAAIC,eAAiBC,EAAIvF,QACzBuF,EAAIvF,QAAU,IAIC,aAAZuF,EAAIrI,KACR,GAAKsI,GAAUD,EAAIjG,OAClBiG,EAAIjG,QAAU+F,EAAIrF,aACZ,GAAKqF,EAAI/F,OAASiG,EAAIjG,OAAS,CACrC,IAAMqG,EAAqBH,EAASD,EAAIjG,OAExCiG,EAAIjG,OAAS+F,EAAI/F,OACjBiG,EAAIvF,SAAW2F,OACT,GAAKN,EAAI/F,OAASmG,EACxB,GAAKD,GAAUC,EAAS,CAMvB,IAAMzF,EAAUuF,EAAIvF,QAEpBuF,EAAIvF,QAAUqF,EAAI/F,OAASiG,EAAIjG,OAE/B,IAAMsG,EAAe5F,EAAUuF,EAAIvF,QAAUqF,EAAIC,cAIjDtD,EAAQ0D,QAAS,CAChBxI,KAAM,YACNoC,OAAQ+F,EAAI/F,OACZU,QAAS4F,EACTf,MAAO1H,KAAKc,sBAGbsH,EAAIvF,SAAWyF,EAASJ,EAAI/F,OAMhC,GAAiB,aAAZ+F,EAAInI,KAAsB,CAE9B,GAAiB,UAAZqI,EAAIrI,KACR,GAAKmI,EAAI/F,OAASiG,EAAIjG,QAAUkG,EAASD,EAAIjG,OAAS,CACrD,GAAKkG,EAASC,EAAS,CAOtB,IAAMI,EAAgB,CACrB3I,KAAM,YACNoC,OAAQmG,EACRzF,QAASwF,EAASC,EAClBZ,MAAO1H,KAAKc,gBAGbd,KAAK+H,cAAeW,EAAe7D,GAEnCA,EAAQzE,KAAMsI,GAGfR,EAAIC,cAAgBC,EAAIjG,OAAS+F,EAAI/F,OACrC+F,EAAIrF,QAAUqF,EAAIC,mBACPD,EAAI/F,QAAUiG,EAAIjG,QAAU+F,EAAI/F,OAASmG,IAC/CD,EAASC,GACbJ,EAAIC,cAAgBE,EAASC,EAC7BJ,EAAI/F,OAASmG,GAEbJ,EAAIC,cAAgB,GAKvB,GAAiB,UAAZC,EAAIrI,MAGHmI,EAAI/F,OAASiG,EAAIjG,QAAUkG,EAASD,EAAIjG,OAAS,CACrD,IAAMuG,EAAgB,CACrB3I,KAAM,YACNoC,OAAQiG,EAAIjG,OACZU,QAASwF,EAASD,EAAIjG,OACtBuF,MAAO1H,KAAKc,gBAGbd,KAAK+H,cAAeW,EAAe7D,GAEnCA,EAAQzE,KAAMsI,GAEdR,EAAIC,cAAgBC,EAAIjG,OAAS+F,EAAI/F,OACrC+F,EAAIrF,QAAUqF,EAAIC,cAIH,aAAZC,EAAIrI,OAEHmI,EAAI/F,QAAUiG,EAAIjG,QAAUkG,GAAUC,GAE1CJ,EAAIC,cAAgB,EACpBD,EAAIrF,QAAU,EACdqF,EAAI/F,OAAS,GACF+F,EAAI/F,QAAUiG,EAAIjG,QAAUkG,GAAUC,IAEjDF,EAAIvF,QAAU,MA/MW,kFAqN7BqF,EAAIrF,QAAUqF,EAAIC,qBACXD,EAAIC,gB,qCAYIhH,EAAQgB,EAAQH,GAC/B,MAAO,CACNjC,KAAM,SACNmC,SAAU8D,OAASC,UAAW9E,EAAQgB,GACtCH,OACAuD,OAAQ,EACRiB,YAAaxG,KAAKc,kB,qCAaJK,EAAQgB,EAAQH,GAC/B,MAAO,CACNjC,KAAM,SACNmC,SAAU8D,OAASC,UAAW9E,EAAQgB,GACtCH,OACAuD,OAAQ,EACRiB,YAAaxG,KAAKc,kB,yCAaAU,EAAOmH,EAAeC,GAEzC,IAAMC,EAAQ,GAGdD,EAAgB,IAAIjI,IAAKiI,GALgC,2BAQzD,YAAiCD,EAAjC,+CAAiD,iCAAnCG,EAAmC,KAA9BC,EAA8B,KAE1CC,EAAWJ,EAAcX,IAAKa,GAAQF,EAAc/E,IAAKiF,GAAQ,KAGlEE,IAAaD,GAEjBF,EAAMzI,KAAM,CACXL,KAAM,YACNmC,SAAUV,EAAMyH,MAChBzH,MAAOA,EAAM0H,QACb3D,OAAQ,EACR0B,aAAc6B,EACd5B,kBAAmB6B,EACnB5B,kBAAmB6B,EACnBxC,YAAaxG,KAAKc,iBAKpB8H,EAAc9E,OAAQgF,IA5BkC,6GAgCzD,YAAiCF,EAAjC,+CAAiD,iCAAnCE,EAAmC,KAA9BE,EAA8B,KAEhDH,EAAMzI,KAAM,CACXL,KAAM,YACNmC,SAAUV,EAAMyH,MAChBzH,MAAOA,EAAM0H,QACb3D,OAAQ,EACR0B,aAAc6B,EACd5B,kBAAmB,KACnBC,kBAAmB6B,EACnBxC,YAAaxG,KAAKc,kBA1CqC,kFA8CzD,OAAO+H,I,2CAUcjE,GACrB,IAAMzD,EAASyD,EAAQzD,OAEvB,IAAMA,EACL,OAAO,EAGR,IAAM0D,EAAU7E,KAAKU,kBAAkBmD,IAAK1C,GACtCgB,EAASyC,EAAQvD,YAEvB,GAAKwD,EAAU,4BACd,YAAsBA,EAAtB,+CAAgC,KAApBZ,EAAoB,QAC/B,GAAoB,UAAfA,EAAOlE,MAAoBoC,GAAU8B,EAAO9B,QAAUA,EAAS8B,EAAO9B,OAAS8B,EAAOpB,QAC1F,OAAO,GAHK,mFAQf,OAAO7C,KAAKkB,qBAAsBC,K,8CAYVA,EAAQgB,EAAQU,GACxC,IAAMrB,EAAQ,IAAIC,OAAOuE,OAASC,UAAW9E,EAAQgB,GAAU6D,OAASC,UAAW9E,EAAQgB,EAASU,IADlD,uBAGlD,YAAoBrB,EAAMc,SAAU,CAAEC,SAAS,IAA/C,+CAA0D,KAA9CtB,EAA8C,QACpDA,EAAKkI,GAAI,aACbnJ,KAAKY,kBAAkBkD,OAAQ7C,GAC/BjB,KAAKU,kBAAkBoD,OAAQ7C,GAE/BjB,KAAK4H,wBAAyB3G,EAAM,EAAGA,EAAKoB,aARI,qF,8BAn5BlD,OAAsC,GAA/BrC,KAAKU,kBAAkB4D,MAA0C,GAA7BtE,KAAKa,gBAAgByD,S,KAm6BlE,SAASa,EAAsBiE,GAC9B,IAAMC,EAAW,GADwB,uBAGzC,YAAqBD,EAArB,+CAAgC,KAApBE,EAAoB,QAC/B,GAAKA,EAAMH,GAAI,SACd,IAAM,IAAI3D,EAAI,EAAGA,EAAI8D,EAAMjF,KAAKkB,OAAQC,IACvC6D,EAASjJ,KAAM,CACd4B,KAAM,QACN8D,WAAY,IAAInF,IAAK2I,EAAMC,wBAI7BF,EAASjJ,KAAM,CACd4B,KAAMsH,EAAMtH,KACZ8D,WAAY,IAAInF,IAAK2I,EAAMC,oBAdW,kFAmBzC,OAAOF,EAgDR,SAAS/D,EAA6BkE,EAAmB3E,GACxD,IAAMQ,EAAU,GAEZlD,EAAS,EACTsH,EAAqB,EAJyC,uBAOlE,YAAsB5E,EAAtB,+CAAgC,KAApBZ,EAAoB,QAE/B,GAAKA,EAAO9B,OAASA,EAAS,CAC7B,IAAM,IAAIqD,EAAI,EAAGA,EAAIvB,EAAO9B,OAASA,EAAQqD,IAC5CH,EAAQjF,KAAM,KAGfqJ,GAAsBxF,EAAO9B,OAASA,EAIvC,GAAoB,UAAf8B,EAAOlE,KAAmB,CAC9B,IAAM,IAAIyF,EAAI,EAAGA,EAAIvB,EAAOpB,QAAS2C,IACpCH,EAAQjF,KAAM,KAIf+B,EAAS8B,EAAO9B,OAAS8B,EAAOpB,aAC1B,GAAoB,UAAfoB,EAAOlE,KAAmB,CACrC,IAAM,IAAIyF,EAAI,EAAGA,EAAIvB,EAAOpB,QAAS2C,IACpCH,EAAQjF,KAAM,KAIf+B,EAAS8B,EAAO9B,OAEhBsH,GAAsBxF,EAAOpB,aAE7BwC,EAAQjF,KAAR,MAAAiF,EAAO,eAAU,IAAIqE,OAAQzF,EAAOpB,SAAU8G,MAAO,MAGrDxH,EAAS8B,EAAO9B,OAAS8B,EAAOpB,QAEhC4G,GAAsBxF,EAAOpB,SAxCmC,kFA8ClE,GAAK4G,EAAqBD,EACzB,IAAM,IAAIhE,EAAI,EAAGA,EAAIgE,EAAoBC,EAAqBtH,EAAQqD,IACrEH,EAAQjF,KAAM,KAIhB,OAAOiF,EAIR,SAASkC,EAA2BqC,GACnC,IAAMC,EAAUD,EAAM1H,UAA4C,cAAhC0H,EAAM1H,SAASoE,KAAKC,SAChDuD,EAAYF,EAAMpI,OAAsC,cAA7BoI,EAAMpI,MAAM8E,KAAKC,SAElD,OAAQsD,IAAYC,I,kCC/oCrB","file":"js/chunk-vendors~e5a72684.f0814b66.js","sourcesContent":["/**\n * @license Copyright (c) 2003-2021, CKSource - Frederico Knabben. All rights reserved.\n * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license\n */\n\n/**\n * @module engine/model/batch\n */\n\n/**\n * A batch instance groups model changes ({@link module:engine/model/operation/operation~Operation operations}). All operations\n * grouped in a single batch can be reverted together, so you can also think about a batch as of a single undo step. If you want\n * to extend a given undo step, you can add more changes to the batch using {@link module:engine/model/model~Model#enqueueChange}:\n *\n *\t\tmodel.enqueueChange( batch, writer => {\n *\t\t\twriter.insertText( 'foo', paragraph, 'end' );\n *\t\t} );\n *\n * @see module:engine/model/model~Model#enqueueChange\n * @see module:engine/model/model~Model#change\n */\nexport default class Batch {\n\t/**\n\t * Creates a batch instance.\n\t *\n\t * @see module:engine/model/model~Model#enqueueChange\n\t * @see module:engine/model/model~Model#change\n\t * @param {'transparent'|'default'} [type='default'] The type of the batch.\n\t */\n\tconstructor( type = 'default' ) {\n\t\t/**\n\t\t * An array of operations that compose this batch.\n\t\t *\n\t\t * @readonly\n\t\t * @type {Array.<module:engine/model/operation/operation~Operation>}\n\t\t */\n\t\tthis.operations = [];\n\n\t\t/**\n\t\t * The type of the batch.\n\t\t *\n\t\t * It can be one of the following values:\n\t\t * * `'default'` &ndash; All \"normal\" batches. This is the most commonly used type.\n\t\t * * `'transparent'` &ndash; A batch that should be ignored by other features, i.e. an initial batch or collaborative editing\n\t\t * changes.\n\t\t *\n\t\t * @readonly\n\t\t * @type {'transparent'|'default'}\n\t\t */\n\t\tthis.type = type;\n\t}\n\n\t/**\n\t * Returns the base version of this batch, which is equal to the base version of the first operation in the batch.\n\t * If there are no operations in the batch or neither operation has the base version set, it returns `null`.\n\t *\n\t * @readonly\n\t * @type {Number|null}\n\t */\n\tget baseVersion() {\n\t\tfor ( const op of this.operations ) {\n\t\t\tif ( op.baseVersion !== null ) {\n\t\t\t\treturn op.baseVersion;\n\t\t\t}\n\t\t}\n\n\t\treturn null;\n\t}\n\n\t/**\n\t * Adds an operation to the batch instance.\n\t *\n\t * @param {module:engine/model/operation/operation~Operation} operation An operation to add.\n\t * @returns {module:engine/model/operation/operation~Operation} The added operation.\n\t */\n\taddOperation( operation ) {\n\t\toperation.batch = this;\n\t\tthis.operations.push( operation );\n\n\t\treturn operation;\n\t}\n}\n","/**\n * @license Copyright (c) 2003-2021, CKSource - Frederico Knabben. All rights reserved.\n * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license\n */\n\n/**\n * @module engine/model/differ\n */\n\nimport Position from './position';\nimport Range from './range';\n\n/**\n * Calculates the difference between two model states.\n *\n * Receives operations that are to be applied on the model document. Marks parts of the model document tree which\n * are changed and saves the state of these elements before the change. Then, it compares saved elements with the\n * changed elements, after all changes are applied on the model document. Calculates the diff between saved\n * elements and new ones and returns a change set.\n */\nexport default class Differ {\n\t/**\n\t * Creates a `Differ` instance.\n\t *\n\t * @param {module:engine/model/markercollection~MarkerCollection} markerCollection Model's marker collection.\n\t */\n\tconstructor( markerCollection ) {\n\t\t/**\n\t\t * Reference to the model's marker collection.\n\t\t *\n\t\t * @private\n\t\t * @type {module:engine/model/markercollection~MarkerCollection}\n\t\t */\n\t\tthis._markerCollection = markerCollection;\n\n\t\t/**\n\t\t * A map that stores changes that happened in a given element.\n\t\t *\n\t\t * The keys of the map are references to the model elements.\n\t\t * The values of the map are arrays with changes that were done on this element.\n\t\t *\n\t\t * @private\n\t\t * @type {Map}\n\t\t */\n\t\tthis._changesInElement = new Map();\n\n\t\t/**\n\t\t * A map that stores \"element's children snapshots\". A snapshot is representing children of a given element before\n\t\t * the first change was applied on that element. Snapshot items are objects with two properties: `name`,\n\t\t * containing the element name (or `'$text'` for a text node) and `attributes` which is a map of the node's attributes.\n\t\t *\n\t\t * @private\n\t\t * @type {Map}\n\t\t */\n\t\tthis._elementSnapshots = new Map();\n\n\t\t/**\n\t\t * A map that stores all changed markers.\n\t\t *\n\t\t * The keys of the map are marker names.\n\t\t * The values of the map are objects with the `oldRange` and `newRange` properties. They store the marker range\n\t\t * state before and after the change.\n\t\t *\n\t\t * @private\n\t\t * @type {Map}\n\t\t */\n\t\tthis._changedMarkers = new Map();\n\n\t\t/**\n\t\t * Stores the number of changes that were processed. Used to order the changes chronologically. It is important\n\t\t * when changes are sorted.\n\t\t *\n\t\t * @private\n\t\t * @type {Number}\n\t\t */\n\t\tthis._changeCount = 0;\n\n\t\t/**\n\t\t * For efficiency purposes, `Differ` stores the change set returned by the differ after {@link #getChanges} call.\n\t\t * Cache is reset each time a new operation is buffered. If the cache has not been reset, {@link #getChanges} will\n\t\t * return the cached value instead of calculating it again.\n\t\t *\n\t\t * This property stores those changes that did not take place in graveyard root.\n\t\t *\n\t\t * @private\n\t\t * @type {Array.<Object>|null}\n\t\t */\n\t\tthis._cachedChanges = null;\n\n\t\t/**\n\t\t * For efficiency purposes, `Differ` stores the change set returned by the differ after the {@link #getChanges} call.\n\t\t * The cache is reset each time a new operation is buffered. If the cache has not been reset, {@link #getChanges} will\n\t\t * return the cached value instead of calculating it again.\n\t\t *\n\t\t * This property stores all changes evaluated by `Differ`, including those that took place in the graveyard.\n\t\t *\n\t\t * @private\n\t\t * @type {Array.<Object>|null}\n\t\t */\n\t\tthis._cachedChangesWithGraveyard = null;\n\t}\n\n\t/**\n\t * Informs whether there are any changes buffered in `Differ`.\n\t *\n\t * @readonly\n\t * @type {Boolean}\n\t */\n\tget isEmpty() {\n\t\treturn this._changesInElement.size == 0 && this._changedMarkers.size == 0;\n\t}\n\n\t/**\n\t * Marks given `item` in differ to be \"refreshed\". It means that the item will be marked as removed and inserted in the differ changes\n\t * set, so it will be effectively re-converted when differ changes will be handled by a dispatcher.\n\t *\n\t * @param {module:engine/model/item~Item} item Item to refresh.\n\t */\n\trefreshItem( item ) {\n\t\tif ( this._isInInsertedElement( item.parent ) ) {\n\t\t\treturn;\n\t\t}\n\n\t\tthis._markRemove( item.parent, item.startOffset, item.offsetSize );\n\t\tthis._markInsert( item.parent, item.startOffset, item.offsetSize );\n\n\t\tconst range = Range._createOn( item );\n\n\t\tfor ( const marker of this._markerCollection.getMarkersIntersectingRange( range ) ) {\n\t\t\tconst markerRange = marker.getRange();\n\n\t\t\tthis.bufferMarkerChange( marker.name, markerRange, markerRange, marker.affectsData );\n\t\t}\n\n\t\t// Clear cache after each buffered operation as it is no longer valid.\n\t\tthis._cachedChanges = null;\n\t}\n\n\t/**\n\t * Buffers the given operation. An operation has to be buffered before it is executed.\n\t *\n\t * Operation type is checked and it is checked which nodes it will affect. These nodes are then stored in `Differ`\n\t * in the state before the operation is executed.\n\t *\n\t * @param {module:engine/model/operation/operation~Operation} operation An operation to buffer.\n\t */\n\tbufferOperation( operation ) {\n\t\t// Below we take an operation, check its type, then use its parameters in marking (private) methods.\n\t\t// The general rule is to not mark elements inside inserted element. All inserted elements are re-rendered.\n\t\t// Marking changes in them would cause a \"double\" changing then.\n\t\t//\n\t\tswitch ( operation.type ) {\n\t\t\tcase 'insert': {\n\t\t\t\tif ( this._isInInsertedElement( operation.position.parent ) ) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tthis._markInsert( operation.position.parent, operation.position.offset, operation.nodes.maxOffset );\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'addAttribute':\n\t\t\tcase 'removeAttribute':\n\t\t\tcase 'changeAttribute': {\n\t\t\t\tfor ( const item of operation.range.getItems( { shallow: true } ) ) {\n\t\t\t\t\tif ( this._isInInsertedElement( item.parent ) ) {\n\t\t\t\t\t\tcontinue;\n\t\t\t\t\t}\n\n\t\t\t\t\tthis._markAttribute( item );\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'remove':\n\t\t\tcase 'move':\n\t\t\tcase 'reinsert': {\n\t\t\t\t// When range is moved to the same position then not mark it as a change.\n\t\t\t\t// See: https://github.com/ckeditor/ckeditor5-engine/issues/1664.\n\t\t\t\tif (\n\t\t\t\t\toperation.sourcePosition.isEqual( operation.targetPosition ) ||\n\t\t\t\t\toperation.sourcePosition.getShiftedBy( operation.howMany ).isEqual( operation.targetPosition )\n\t\t\t\t) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tconst sourceParentInserted = this._isInInsertedElement( operation.sourcePosition.parent );\n\t\t\t\tconst targetParentInserted = this._isInInsertedElement( operation.targetPosition.parent );\n\n\t\t\t\tif ( !sourceParentInserted ) {\n\t\t\t\t\tthis._markRemove( operation.sourcePosition.parent, operation.sourcePosition.offset, operation.howMany );\n\t\t\t\t}\n\n\t\t\t\tif ( !targetParentInserted ) {\n\t\t\t\t\tthis._markInsert( operation.targetPosition.parent, operation.getMovedRangeStart().offset, operation.howMany );\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'rename': {\n\t\t\t\tif ( this._isInInsertedElement( operation.position.parent ) ) {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\n\t\t\t\tthis._markRemove( operation.position.parent, operation.position.offset, 1 );\n\t\t\t\tthis._markInsert( operation.position.parent, operation.position.offset, 1 );\n\n\t\t\t\tconst range = Range._createFromPositionAndShift( operation.position, 1 );\n\n\t\t\t\tfor ( const marker of this._markerCollection.getMarkersIntersectingRange( range ) ) {\n\t\t\t\t\tconst markerRange = marker.getRange();\n\n\t\t\t\t\tthis.bufferMarkerChange( marker.name, markerRange, markerRange, marker.affectsData );\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'split': {\n\t\t\t\tconst splitElement = operation.splitPosition.parent;\n\n\t\t\t\t// Mark that children of the split element were removed.\n\t\t\t\tif ( !this._isInInsertedElement( splitElement ) ) {\n\t\t\t\t\tthis._markRemove( splitElement, operation.splitPosition.offset, operation.howMany );\n\t\t\t\t}\n\n\t\t\t\t// Mark that the new element (split copy) was inserted.\n\t\t\t\tif ( !this._isInInsertedElement( operation.insertionPosition.parent ) ) {\n\t\t\t\t\tthis._markInsert( operation.insertionPosition.parent, operation.insertionPosition.offset, 1 );\n\t\t\t\t}\n\n\t\t\t\t// If the split took the element from the graveyard, mark that the element from the graveyard was removed.\n\t\t\t\tif ( operation.graveyardPosition ) {\n\t\t\t\t\tthis._markRemove( operation.graveyardPosition.parent, operation.graveyardPosition.offset, 1 );\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tcase 'merge': {\n\t\t\t\t// Mark that the merged element was removed.\n\t\t\t\tconst mergedElement = operation.sourcePosition.parent;\n\n\t\t\t\tif ( !this._isInInsertedElement( mergedElement.parent ) ) {\n\t\t\t\t\tthis._markRemove( mergedElement.parent, mergedElement.startOffset, 1 );\n\t\t\t\t}\n\n\t\t\t\t// Mark that the merged element was inserted into graveyard.\n\t\t\t\tconst graveyardParent = operation.graveyardPosition.parent;\n\n\t\t\t\tthis._markInsert( graveyardParent, operation.graveyardPosition.offset, 1 );\n\n\t\t\t\t// Mark that children of merged element were inserted at new parent.\n\t\t\t\tconst mergedIntoElement = operation.targetPosition.parent;\n\n\t\t\t\tif ( !this._isInInsertedElement( mergedIntoElement ) ) {\n\t\t\t\t\tthis._markInsert( mergedIntoElement, operation.targetPosition.offset, mergedElement.maxOffset );\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\t// Clear cache after each buffered operation as it is no longer valid.\n\t\tthis._cachedChanges = null;\n\t}\n\n\t/**\n\t * Buffers a marker change.\n\t *\n\t * @param {String} markerName The name of the marker that changed.\n\t * @param {module:engine/model/range~Range|null} oldRange Marker range before the change or `null` if the marker has just\n\t * been created.\n\t * @param {module:engine/model/range~Range|null} newRange Marker range after the change or `null` if the marker was removed.\n\t * @param {Boolean} affectsData Flag indicating whether marker affects the editor data.\n\t */\n\tbufferMarkerChange( markerName, oldRange, newRange, affectsData ) {\n\t\tconst buffered = this._changedMarkers.get( markerName );\n\n\t\tif ( !buffered ) {\n\t\t\tthis._changedMarkers.set( markerName, {\n\t\t\t\toldRange,\n\t\t\t\tnewRange,\n\t\t\t\taffectsData\n\t\t\t} );\n\t\t} else {\n\t\t\tbuffered.newRange = newRange;\n\t\t\tbuffered.affectsData = affectsData;\n\n\t\t\tif ( buffered.oldRange == null && buffered.newRange == null ) {\n\t\t\t\t// The marker is going to be removed (`newRange == null`) but it did not exist before the first buffered change\n\t\t\t\t// (`buffered.oldRange == null`). In this case, do not keep the marker in buffer at all.\n\t\t\t\tthis._changedMarkers.delete( markerName );\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Returns all markers that should be removed as a result of buffered changes.\n\t *\n\t * @returns {Array.<Object>} Markers to remove. Each array item is an object containing the `name` and `range` properties.\n\t */\n\tgetMarkersToRemove() {\n\t\tconst result = [];\n\n\t\tfor ( const [ name, change ] of this._changedMarkers ) {\n\t\t\tif ( change.oldRange != null ) {\n\t\t\t\tresult.push( { name, range: change.oldRange } );\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Returns all markers which should be added as a result of buffered changes.\n\t *\n\t * @returns {Array.<Object>} Markers to add. Each array item is an object containing the `name` and `range` properties.\n\t */\n\tgetMarkersToAdd() {\n\t\tconst result = [];\n\n\t\tfor ( const [ name, change ] of this._changedMarkers ) {\n\t\t\tif ( change.newRange != null ) {\n\t\t\t\tresult.push( { name, range: change.newRange } );\n\t\t\t}\n\t\t}\n\n\t\treturn result;\n\t}\n\n\t/**\n\t * Returns all markers which changed.\n\t *\n\t * @returns {Array.<Object>}\n\t */\n\tgetChangedMarkers() {\n\t\treturn Array.from( this._changedMarkers ).map( item => (\n\t\t\t{\n\t\t\t\tname: item[ 0 ],\n\t\t\t\tdata: {\n\t\t\t\t\toldRange: item[ 1 ].oldRange,\n\t\t\t\t\tnewRange: item[ 1 ].newRange\n\t\t\t\t}\n\t\t\t}\n\t\t) );\n\t}\n\n\t/**\n\t * Checks whether some of the buffered changes affect the editor data.\n\t *\n\t * Types of changes which affect the editor data:\n\t *\n\t * * model structure changes,\n\t * * attribute changes,\n\t * * changes of markers which were defined as `affectingData`.\n\t *\n\t * @returns {Boolean}\n\t */\n\thasDataChanges() {\n\t\tfor ( const [ , change ] of this._changedMarkers ) {\n\t\t\tif ( change.affectsData ) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\t// If markers do not affect the data, check whether there are some changes in elements.\n\t\treturn this._changesInElement.size > 0;\n\t}\n\n\t/**\n\t * Calculates the diff between the old model tree state (the state before the first buffered operations since the last {@link #reset}\n\t * call) and the new model tree state (actual one). It should be called after all buffered operations are executed.\n\t *\n\t * The diff set is returned as an array of diff items, each describing a change done on the model. The items are sorted by\n\t * the position on which the change happened. If a position {@link module:engine/model/position~Position#isBefore is before}\n\t * another one, it will be on an earlier index in the diff set.\n\t *\n\t * Because calculating the diff is a costly operation, the result is cached. If no new operation was buffered since the\n\t * previous {@link #getChanges} call, the next call will return the cached value.\n\t *\n\t * @param {Object} options Additional options.\n\t * @param {Boolean} [options.includeChangesInGraveyard=false] If set to `true`, also changes that happened\n\t * in the graveyard root will be returned. By default, changes in the graveyard root are not returned.\n\t * @returns {Array.<Object>} Diff between the old and the new model tree state.\n\t */\n\tgetChanges( options = { includeChangesInGraveyard: false } ) {\n\t\t// If there are cached changes, just return them instead of calculating changes again.\n\t\tif ( this._cachedChanges ) {\n\t\t\tif ( options.includeChangesInGraveyard ) {\n\t\t\t\treturn this._cachedChangesWithGraveyard.slice();\n\t\t\t} else {\n\t\t\t\treturn this._cachedChanges.slice();\n\t\t\t}\n\t\t}\n\n\t\t// Will contain returned results.\n\t\tlet diffSet = [];\n\n\t\t// Check all changed elements.\n\t\tfor ( const element of this._changesInElement.keys() ) {\n\t\t\t// Get changes for this element and sort them.\n\t\t\tconst changes = this._changesInElement.get( element ).sort( ( a, b ) => {\n\t\t\t\tif ( a.offset === b.offset ) {\n\t\t\t\t\tif ( a.type != b.type ) {\n\t\t\t\t\t\t// If there are multiple changes at the same position, \"remove\" change should be first.\n\t\t\t\t\t\t// If the order is different, for example, we would first add some nodes and then removed them\n\t\t\t\t\t\t// (instead of the nodes that we should remove).\n\t\t\t\t\t\treturn a.type == 'remove' ? -1 : 1;\n\t\t\t\t\t}\n\n\t\t\t\t\treturn 0;\n\t\t\t\t}\n\n\t\t\t\treturn a.offset < b.offset ? -1 : 1;\n\t\t\t} );\n\n\t\t\t// Get children of this element before any change was applied on it.\n\t\t\tconst snapshotChildren = this._elementSnapshots.get( element );\n\t\t\t// Get snapshot of current element's children.\n\t\t\tconst elementChildren = _getChildrenSnapshot( element.getChildren() );\n\n\t\t\t// Generate actions basing on changes done on element.\n\t\t\tconst actions = _generateActionsFromChanges( snapshotChildren.length, changes );\n\n\t\t\tlet i = 0; // Iterator in `elementChildren` array -- iterates through current children of element.\n\t\t\tlet j = 0; // Iterator in `snapshotChildren` array -- iterates through old children of element.\n\n\t\t\t// Process every action.\n\t\t\tfor ( const action of actions ) {\n\t\t\t\tif ( action === 'i' ) {\n\t\t\t\t\t// Generate diff item for this element and insert it into the diff set.\n\t\t\t\t\tdiffSet.push( this._getInsertDiff( element, i, elementChildren[ i ].name ) );\n\n\t\t\t\t\ti++;\n\t\t\t\t} else if ( action === 'r' ) {\n\t\t\t\t\t// Generate diff item for this element and insert it into the diff set.\n\t\t\t\t\tdiffSet.push( this._getRemoveDiff( element, i, snapshotChildren[ j ].name ) );\n\n\t\t\t\t\tj++;\n\t\t\t\t} else if ( action === 'a' ) {\n\t\t\t\t\t// Take attributes from saved and current children.\n\t\t\t\t\tconst elementAttributes = elementChildren[ i ].attributes;\n\t\t\t\t\tconst snapshotAttributes = snapshotChildren[ j ].attributes;\n\t\t\t\t\tlet range;\n\n\t\t\t\t\tif ( elementChildren[ i ].name == '$text' ) {\n\t\t\t\t\t\trange = new Range( Position._createAt( element, i ), Position._createAt( element, i + 1 ) );\n\t\t\t\t\t} else {\n\t\t\t\t\t\tconst index = element.offsetToIndex( i );\n\t\t\t\t\t\trange = new Range( Position._createAt( element, i ), Position._createAt( element.getChild( index ), 0 ) );\n\t\t\t\t\t}\n\n\t\t\t\t\t// Generate diff items for this change (there might be multiple attributes changed and\n\t\t\t\t\t// there is a single diff for each of them) and insert them into the diff set.\n\t\t\t\t\tdiffSet.push( ...this._getAttributesDiff( range, snapshotAttributes, elementAttributes ) );\n\n\t\t\t\t\ti++;\n\t\t\t\t\tj++;\n\t\t\t\t} else {\n\t\t\t\t\t// `action` is 'equal'. Child not changed.\n\t\t\t\t\ti++;\n\t\t\t\t\tj++;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\t// Then, sort the changes by the position (change at position before other changes is first).\n\t\tdiffSet.sort( ( a, b ) => {\n\t\t\t// If the change is in different root, we don't care much, but we'd like to have all changes in given\n\t\t\t// root \"together\" in the array. So let's just sort them by the root name. It does not matter which root\n\t\t\t// will be processed first.\n\t\t\tif ( a.position.root != b.position.root ) {\n\t\t\t\treturn a.position.root.rootName < b.position.root.rootName ? -1 : 1;\n\t\t\t}\n\n\t\t\t// If change happens at the same position...\n\t\t\tif ( a.position.isEqual( b.position ) ) {\n\t\t\t\t// Keep chronological order of operations.\n\t\t\t\treturn a.changeCount - b.changeCount;\n\t\t\t}\n\n\t\t\t// If positions differ, position \"on the left\" should be earlier in the result.\n\t\t\treturn a.position.isBefore( b.position ) ? -1 : 1;\n\t\t} );\n\n\t\t// Glue together multiple changes (mostly on text nodes).\n\t\tfor ( let i = 1, prevIndex = 0; i < diffSet.length; i++ ) {\n\t\t\tconst prevDiff = diffSet[ prevIndex ];\n\t\t\tconst thisDiff = diffSet[ i ];\n\n\t\t\t// Glue remove changes if they happen on text on same position.\n\t\t\tconst isConsecutiveTextRemove =\n\t\t\t\tprevDiff.type == 'remove' && thisDiff.type == 'remove' &&\n\t\t\t\tprevDiff.name == '$text' && thisDiff.name == '$text' &&\n\t\t\t\tprevDiff.position.isEqual( thisDiff.position );\n\n\t\t\t// Glue insert changes if they happen on text on consecutive fragments.\n\t\t\tconst isConsecutiveTextAdd =\n\t\t\t\tprevDiff.type == 'insert' && thisDiff.type == 'insert' &&\n\t\t\t\tprevDiff.name == '$text' && thisDiff.name == '$text' &&\n\t\t\t\tprevDiff.position.parent == thisDiff.position.parent &&\n\t\t\t\tprevDiff.position.offset + prevDiff.length == thisDiff.position.offset;\n\n\t\t\t// Glue attribute changes if they happen on consecutive fragments and have same key, old value and new value.\n\t\t\tconst isConsecutiveAttributeChange =\n\t\t\t\tprevDiff.type == 'attribute' && thisDiff.type == 'attribute' &&\n\t\t\t\tprevDiff.position.parent == thisDiff.position.parent &&\n\t\t\t\tprevDiff.range.isFlat && thisDiff.range.isFlat &&\n\t\t\t\tprevDiff.position.offset + prevDiff.length == thisDiff.position.offset &&\n\t\t\t\tprevDiff.attributeKey == thisDiff.attributeKey &&\n\t\t\t\tprevDiff.attributeOldValue == thisDiff.attributeOldValue &&\n\t\t\t\tprevDiff.attributeNewValue == thisDiff.attributeNewValue;\n\n\t\t\tif ( isConsecutiveTextRemove || isConsecutiveTextAdd || isConsecutiveAttributeChange ) {\n\t\t\t\tprevDiff.length++;\n\n\t\t\t\tif ( isConsecutiveAttributeChange ) {\n\t\t\t\t\tprevDiff.range.end = prevDiff.range.end.getShiftedBy( 1 );\n\t\t\t\t}\n\n\t\t\t\tdiffSet[ i ] = null;\n\t\t\t} else {\n\t\t\t\tprevIndex = i;\n\t\t\t}\n\t\t}\n\n\t\tdiffSet = diffSet.filter( v => v );\n\n\t\t// Remove `changeCount` property from diff items. It is used only for sorting and is internal thing.\n\t\tfor ( const item of diffSet ) {\n\t\t\tdelete item.changeCount;\n\n\t\t\tif ( item.type == 'attribute' ) {\n\t\t\t\tdelete item.position;\n\t\t\t\tdelete item.length;\n\t\t\t}\n\t\t}\n\n\t\tthis._changeCount = 0;\n\n\t\t// Cache changes.\n\t\tthis._cachedChangesWithGraveyard = diffSet.slice();\n\t\tthis._cachedChanges = diffSet.filter( _changesInGraveyardFilter );\n\n\t\tif ( options.includeChangesInGraveyard ) {\n\t\t\treturn this._cachedChangesWithGraveyard;\n\t\t} else {\n\t\t\treturn this._cachedChanges;\n\t\t}\n\t}\n\n\t/**\n\t * Resets `Differ`. Removes all buffered changes.\n\t */\n\treset() {\n\t\tthis._changesInElement.clear();\n\t\tthis._elementSnapshots.clear();\n\t\tthis._changedMarkers.clear();\n\t\tthis._cachedChanges = null;\n\t}\n\n\t/**\n\t * Saves and handles an insert change.\n\t *\n\t * @private\n\t * @param {module:engine/model/element~Element} parent\n\t * @param {Number} offset\n\t * @param {Number} howMany\n\t */\n\t_markInsert( parent, offset, howMany ) {\n\t\tconst changeItem = { type: 'insert', offset, howMany, count: this._changeCount++ };\n\n\t\tthis._markChange( parent, changeItem );\n\t}\n\n\t/**\n\t * Saves and handles a remove change.\n\t *\n\t * @private\n\t * @param {module:engine/model/element~Element} parent\n\t * @param {Number} offset\n\t * @param {Number} howMany\n\t */\n\t_markRemove( parent, offset, howMany ) {\n\t\tconst changeItem = { type: 'remove', offset, howMany, count: this._changeCount++ };\n\n\t\tthis._markChange( parent, changeItem );\n\n\t\tthis._removeAllNestedChanges( parent, offset, howMany );\n\t}\n\n\t/**\n\t * Saves and handles an attribute change.\n\t *\n\t * @private\n\t * @param {module:engine/model/item~Item} item\n\t */\n\t_markAttribute( item ) {\n\t\tconst changeItem = { type: 'attribute', offset: item.startOffset, howMany: item.offsetSize, count: this._changeCount++ };\n\n\t\tthis._markChange( item.parent, changeItem );\n\t}\n\n\t/**\n\t * Saves and handles a model change.\n\t *\n\t * @private\n\t * @param {module:engine/model/element~Element} parent\n\t * @param {Object} changeItem\n\t */\n\t_markChange( parent, changeItem ) {\n\t\t// First, make a snapshot of this parent's children (it will be made only if it was not made before).\n\t\tthis._makeSnapshot( parent );\n\n\t\t// Then, get all changes that already were done on the element (empty array if this is the first change).\n\t\tconst changes = this._getChangesForElement( parent );\n\n\t\t// Then, look through all the changes, and transform them or the new change.\n\t\tthis._handleChange( changeItem, changes );\n\n\t\t// Add the new change.\n\t\tchanges.push( changeItem );\n\n\t\t// Remove incorrect changes. During transformation some change might be, for example, included in another.\n\t\t// In that case, the change will have `howMany` property set to `0` or less. We need to remove those changes.\n\t\tfor ( let i = 0; i < changes.length; i++ ) {\n\t\t\tif ( changes[ i ].howMany < 1 ) {\n\t\t\t\tchanges.splice( i, 1 );\n\n\t\t\t\ti--;\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Gets an array of changes that have already been saved for a given element.\n\t *\n\t * @private\n\t * @param {module:engine/model/element~Element} element\n\t * @returns {Array.<Object>}\n\t */\n\t_getChangesForElement( element ) {\n\t\tlet changes;\n\n\t\tif ( this._changesInElement.has( element ) ) {\n\t\t\tchanges = this._changesInElement.get( element );\n\t\t} else {\n\t\t\tchanges = [];\n\n\t\t\tthis._changesInElement.set( element, changes );\n\t\t}\n\n\t\treturn changes;\n\t}\n\n\t/**\n\t * Saves a children snapshot for a given element.\n\t *\n\t * @private\n\t * @param {module:engine/model/element~Element} element\n\t */\n\t_makeSnapshot( element ) {\n\t\tif ( !this._elementSnapshots.has( element ) ) {\n\t\t\tthis._elementSnapshots.set( element, _getChildrenSnapshot( element.getChildren() ) );\n\t\t}\n\t}\n\n\t/**\n\t * For a given newly saved change, compares it with a change already done on the element and modifies the incoming\n\t * change and/or the old change.\n\t *\n\t * @private\n\t * @param {Object} inc Incoming (new) change.\n\t * @param {Array.<Object>} changes An array containing all the changes done on that element.\n\t */\n\t_handleChange( inc, changes ) {\n\t\t// We need a helper variable that will store how many nodes are to be still handled for this change item.\n\t\t// `nodesToHandle` (how many nodes still need to be handled) and `howMany` (how many nodes were affected)\n\t\t// needs to be differentiated.\n\t\t//\n\t\t// This comes up when there are multiple changes that are affected by `inc` change item.\n\t\t//\n\t\t// For example: assume two insert changes: `{ offset: 2, howMany: 1 }` and `{ offset: 5, howMany: 1 }`.\n\t\t// Assume that `inc` change is remove `{ offset: 2, howMany: 2, nodesToHandle: 2 }`.\n\t\t//\n\t\t// Then, we:\n\t\t// - \"forget\" about first insert change (it is \"eaten\" by remove),\n\t\t// - because of that, at the end we will want to remove only one node (`nodesToHandle = 1`),\n\t\t// - but still we have to change offset of the second insert change from `5` to `3`!\n\t\t//\n\t\t// So, `howMany` does not change throughout items transformation and keeps information about how many nodes were affected,\n\t\t// while `nodesToHandle` means how many nodes need to be handled after the change item is transformed by other changes.\n\t\tinc.nodesToHandle = inc.howMany;\n\n\t\tfor ( const old of changes ) {\n\t\t\tconst incEnd = inc.offset + inc.howMany;\n\t\t\tconst oldEnd = old.offset + old.howMany;\n\n\t\t\tif ( inc.type == 'insert' ) {\n\t\t\t\tif ( old.type == 'insert' ) {\n\t\t\t\t\tif ( inc.offset <= old.offset ) {\n\t\t\t\t\t\told.offset += inc.howMany;\n\t\t\t\t\t} else if ( inc.offset < oldEnd ) {\n\t\t\t\t\t\told.howMany += inc.nodesToHandle;\n\t\t\t\t\t\tinc.nodesToHandle = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( old.type == 'remove' ) {\n\t\t\t\t\tif ( inc.offset < old.offset ) {\n\t\t\t\t\t\told.offset += inc.howMany;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( old.type == 'attribute' ) {\n\t\t\t\t\tif ( inc.offset <= old.offset ) {\n\t\t\t\t\t\told.offset += inc.howMany;\n\t\t\t\t\t} else if ( inc.offset < oldEnd ) {\n\t\t\t\t\t\t// This case is more complicated, because attribute change has to be split into two.\n\t\t\t\t\t\t// Example (assume that uppercase and lowercase letters mean different attributes):\n\t\t\t\t\t\t//\n\t\t\t\t\t\t// initial state:\t\tabcxyz\n\t\t\t\t\t\t// attribute change:\taBCXYz\n\t\t\t\t\t\t// incoming insert:\t\taBCfooXYz\n\t\t\t\t\t\t//\n\t\t\t\t\t\t// Change ranges cannot intersect because each item has to be described exactly (it was either\n\t\t\t\t\t\t// not changed, inserted, removed, or its attribute was changed). That's why old attribute\n\t\t\t\t\t\t// change has to be split and both parts has to be handled separately from now on.\n\t\t\t\t\t\tconst howMany = old.howMany;\n\n\t\t\t\t\t\told.howMany = inc.offset - old.offset;\n\n\t\t\t\t\t\t// Add the second part of attribute change to the beginning of processed array so it won't\n\t\t\t\t\t\t// be processed again in this loop.\n\t\t\t\t\t\tchanges.unshift( {\n\t\t\t\t\t\t\ttype: 'attribute',\n\t\t\t\t\t\t\toffset: incEnd,\n\t\t\t\t\t\t\thowMany: howMany - old.howMany,\n\t\t\t\t\t\t\tcount: this._changeCount++\n\t\t\t\t\t\t} );\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif ( inc.type == 'remove' ) {\n\t\t\t\tif ( old.type == 'insert' ) {\n\t\t\t\t\tif ( incEnd <= old.offset ) {\n\t\t\t\t\t\told.offset -= inc.howMany;\n\t\t\t\t\t} else if ( incEnd <= oldEnd ) {\n\t\t\t\t\t\tif ( inc.offset < old.offset ) {\n\t\t\t\t\t\t\tconst intersectionLength = incEnd - old.offset;\n\n\t\t\t\t\t\t\told.offset = inc.offset;\n\n\t\t\t\t\t\t\told.howMany -= intersectionLength;\n\t\t\t\t\t\t\tinc.nodesToHandle -= intersectionLength;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\told.howMany -= inc.nodesToHandle;\n\t\t\t\t\t\t\tinc.nodesToHandle = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\tif ( inc.offset <= old.offset ) {\n\t\t\t\t\t\t\tinc.nodesToHandle -= old.howMany;\n\t\t\t\t\t\t\told.howMany = 0;\n\t\t\t\t\t\t} else if ( inc.offset < oldEnd ) {\n\t\t\t\t\t\t\tconst intersectionLength = oldEnd - inc.offset;\n\n\t\t\t\t\t\t\told.howMany -= intersectionLength;\n\t\t\t\t\t\t\tinc.nodesToHandle -= intersectionLength;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( old.type == 'remove' ) {\n\t\t\t\t\tif ( incEnd <= old.offset ) {\n\t\t\t\t\t\told.offset -= inc.howMany;\n\t\t\t\t\t} else if ( inc.offset < old.offset ) {\n\t\t\t\t\t\tinc.nodesToHandle += old.howMany;\n\t\t\t\t\t\told.howMany = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( old.type == 'attribute' ) {\n\t\t\t\t\tif ( incEnd <= old.offset ) {\n\t\t\t\t\t\told.offset -= inc.howMany;\n\t\t\t\t\t} else if ( inc.offset < old.offset ) {\n\t\t\t\t\t\tconst intersectionLength = incEnd - old.offset;\n\n\t\t\t\t\t\told.offset = inc.offset;\n\t\t\t\t\t\told.howMany -= intersectionLength;\n\t\t\t\t\t} else if ( inc.offset < oldEnd ) {\n\t\t\t\t\t\tif ( incEnd <= oldEnd ) {\n\t\t\t\t\t\t\t// On first sight in this case we don't need to split attribute operation into two.\n\t\t\t\t\t\t\t// However the changes set is later converted to actions (see `_generateActionsFromChanges`).\n\t\t\t\t\t\t\t// For that reason, no two changes may intersect.\n\t\t\t\t\t\t\t// So we cannot have an attribute change that \"contains\" remove change.\n\t\t\t\t\t\t\t// Attribute change needs to be split.\n\t\t\t\t\t\t\tconst howMany = old.howMany;\n\n\t\t\t\t\t\t\told.howMany = inc.offset - old.offset;\n\n\t\t\t\t\t\t\tconst howManyAfter = howMany - old.howMany - inc.nodesToHandle;\n\n\t\t\t\t\t\t\t// Add the second part of attribute change to the beginning of processed array so it won't\n\t\t\t\t\t\t\t// be processed again in this loop.\n\t\t\t\t\t\t\tchanges.unshift( {\n\t\t\t\t\t\t\t\ttype: 'attribute',\n\t\t\t\t\t\t\t\toffset: inc.offset,\n\t\t\t\t\t\t\t\thowMany: howManyAfter,\n\t\t\t\t\t\t\t\tcount: this._changeCount++\n\t\t\t\t\t\t\t} );\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\told.howMany -= oldEnd - inc.offset;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tif ( inc.type == 'attribute' ) {\n\t\t\t\t// In case of attribute change, `howMany` should be kept same as `nodesToHandle`. It's not an error.\n\t\t\t\tif ( old.type == 'insert' ) {\n\t\t\t\t\tif ( inc.offset < old.offset && incEnd > old.offset ) {\n\t\t\t\t\t\tif ( incEnd > oldEnd ) {\n\t\t\t\t\t\t\t// This case is similar to a case described when incoming change was insert and old change was attribute.\n\t\t\t\t\t\t\t// See comment above.\n\t\t\t\t\t\t\t//\n\t\t\t\t\t\t\t// This time incoming change is attribute. We need to split incoming change in this case too.\n\t\t\t\t\t\t\t// However this time, the second part of the attribute change needs to be processed further\n\t\t\t\t\t\t\t// because there might be other changes that it collides with.\n\t\t\t\t\t\t\tconst attributePart = {\n\t\t\t\t\t\t\t\ttype: 'attribute',\n\t\t\t\t\t\t\t\toffset: oldEnd,\n\t\t\t\t\t\t\t\thowMany: incEnd - oldEnd,\n\t\t\t\t\t\t\t\tcount: this._changeCount++\n\t\t\t\t\t\t\t};\n\n\t\t\t\t\t\t\tthis._handleChange( attributePart, changes );\n\n\t\t\t\t\t\t\tchanges.push( attributePart );\n\t\t\t\t\t\t}\n\n\t\t\t\t\t\tinc.nodesToHandle = old.offset - inc.offset;\n\t\t\t\t\t\tinc.howMany = inc.nodesToHandle;\n\t\t\t\t\t} else if ( inc.offset >= old.offset && inc.offset < oldEnd ) {\n\t\t\t\t\t\tif ( incEnd > oldEnd ) {\n\t\t\t\t\t\t\tinc.nodesToHandle = incEnd - oldEnd;\n\t\t\t\t\t\t\tinc.offset = oldEnd;\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tinc.nodesToHandle = 0;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( old.type == 'remove' ) {\n\t\t\t\t\t// This is a case when attribute change \"contains\" remove change.\n\t\t\t\t\t// The attribute change needs to be split into two because changes cannot intersect.\n\t\t\t\t\tif ( inc.offset < old.offset && incEnd > old.offset ) {\n\t\t\t\t\t\tconst attributePart = {\n\t\t\t\t\t\t\ttype: 'attribute',\n\t\t\t\t\t\t\toffset: old.offset,\n\t\t\t\t\t\t\thowMany: incEnd - old.offset,\n\t\t\t\t\t\t\tcount: this._changeCount++\n\t\t\t\t\t\t};\n\n\t\t\t\t\t\tthis._handleChange( attributePart, changes );\n\n\t\t\t\t\t\tchanges.push( attributePart );\n\n\t\t\t\t\t\tinc.nodesToHandle = old.offset - inc.offset;\n\t\t\t\t\t\tinc.howMany = inc.nodesToHandle;\n\t\t\t\t\t}\n\t\t\t\t}\n\n\t\t\t\tif ( old.type == 'attribute' ) {\n\t\t\t\t\t// There are only two conflicting scenarios possible here:\n\t\t\t\t\tif ( inc.offset >= old.offset && incEnd <= oldEnd ) {\n\t\t\t\t\t\t// `old` change includes `inc` change, or they are the same.\n\t\t\t\t\t\tinc.nodesToHandle = 0;\n\t\t\t\t\t\tinc.howMany = 0;\n\t\t\t\t\t\tinc.offset = 0;\n\t\t\t\t\t} else if ( inc.offset <= old.offset && incEnd >= oldEnd ) {\n\t\t\t\t\t\t// `inc` change includes `old` change.\n\t\t\t\t\t\told.howMany = 0;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tinc.howMany = inc.nodesToHandle;\n\t\tdelete inc.nodesToHandle;\n\t}\n\n\t/**\n\t * Returns an object with a single insert change description.\n\t *\n\t * @private\n\t * @param {module:engine/model/element~Element} parent The element in which the change happened.\n\t * @param {Number} offset The offset at which change happened.\n\t * @param {String} name The name of the removed element or `'$text'` for a character.\n\t * @returns {Object} The diff item.\n\t */\n\t_getInsertDiff( parent, offset, name ) {\n\t\treturn {\n\t\t\ttype: 'insert',\n\t\t\tposition: Position._createAt( parent, offset ),\n\t\t\tname,\n\t\t\tlength: 1,\n\t\t\tchangeCount: this._changeCount++\n\t\t};\n\t}\n\n\t/**\n\t * Returns an object with a single remove change description.\n\t *\n\t * @private\n\t * @param {module:engine/model/element~Element} parent The element in which change happened.\n\t * @param {Number} offset The offset at which change happened.\n\t * @param {String} name The name of the removed element or `'$text'` for a character.\n\t * @returns {Object} The diff item.\n\t */\n\t_getRemoveDiff( parent, offset, name ) {\n\t\treturn {\n\t\t\ttype: 'remove',\n\t\t\tposition: Position._createAt( parent, offset ),\n\t\t\tname,\n\t\t\tlength: 1,\n\t\t\tchangeCount: this._changeCount++\n\t\t};\n\t}\n\n\t/**\n\t * Returns an array of objects where each one is a single attribute change description.\n\t *\n\t * @private\n\t * @param {module:engine/model/range~Range} range The range where the change happened.\n\t * @param {Map} oldAttributes A map, map iterator or compatible object that contains attributes before the change.\n\t * @param {Map} newAttributes A map, map iterator or compatible object that contains attributes after the change.\n\t * @returns {Array.<Object>} An array containing one or more diff items.\n\t */\n\t_getAttributesDiff( range, oldAttributes, newAttributes ) {\n\t\t// Results holder.\n\t\tconst diffs = [];\n\n\t\t// Clone new attributes as we will be performing changes on this object.\n\t\tnewAttributes = new Map( newAttributes );\n\n\t\t// Look through old attributes.\n\t\tfor ( const [ key, oldValue ] of oldAttributes ) {\n\t\t\t// Check what is the new value of the attribute (or if it was removed).\n\t\t\tconst newValue = newAttributes.has( key ) ? newAttributes.get( key ) : null;\n\n\t\t\t// If values are different (or attribute was removed)...\n\t\t\tif ( newValue !== oldValue ) {\n\t\t\t\t// Add diff item.\n\t\t\t\tdiffs.push( {\n\t\t\t\t\ttype: 'attribute',\n\t\t\t\t\tposition: range.start,\n\t\t\t\t\trange: range.clone(),\n\t\t\t\t\tlength: 1,\n\t\t\t\t\tattributeKey: key,\n\t\t\t\t\tattributeOldValue: oldValue,\n\t\t\t\t\tattributeNewValue: newValue,\n\t\t\t\t\tchangeCount: this._changeCount++\n\t\t\t\t} );\n\t\t\t}\n\n\t\t\t// Prevent returning two diff items for the same change.\n\t\t\tnewAttributes.delete( key );\n\t\t}\n\n\t\t// Look through new attributes that weren't handled above.\n\t\tfor ( const [ key, newValue ] of newAttributes ) {\n\t\t\t// Each of them is a new attribute. Add diff item.\n\t\t\tdiffs.push( {\n\t\t\t\ttype: 'attribute',\n\t\t\t\tposition: range.start,\n\t\t\t\trange: range.clone(),\n\t\t\t\tlength: 1,\n\t\t\t\tattributeKey: key,\n\t\t\t\tattributeOldValue: null,\n\t\t\t\tattributeNewValue: newValue,\n\t\t\t\tchangeCount: this._changeCount++\n\t\t\t} );\n\t\t}\n\n\t\treturn diffs;\n\t}\n\n\t/**\n\t * Checks whether given element or any of its parents is an element that is buffered as an inserted element.\n\t *\n\t * @private\n\t * @param {module:engine/model/element~Element} element Element to check.\n\t * @returns {Boolean}\n\t */\n\t_isInInsertedElement( element ) {\n\t\tconst parent = element.parent;\n\n\t\tif ( !parent ) {\n\t\t\treturn false;\n\t\t}\n\n\t\tconst changes = this._changesInElement.get( parent );\n\t\tconst offset = element.startOffset;\n\n\t\tif ( changes ) {\n\t\t\tfor ( const change of changes ) {\n\t\t\t\tif ( change.type == 'insert' && offset >= change.offset && offset < change.offset + change.howMany ) {\n\t\t\t\t\treturn true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\treturn this._isInInsertedElement( parent );\n\t}\n\n\t/**\n\t * Removes deeply all buffered changes that are registered in elements from range specified by `parent`, `offset`\n\t * and `howMany`.\n\t *\n\t * @private\n\t * @param {module:engine/model/element~Element} parent\n\t * @param {Number} offset\n\t * @param {Number} howMany\n\t */\n\t_removeAllNestedChanges( parent, offset, howMany ) {\n\t\tconst range = new Range( Position._createAt( parent, offset ), Position._createAt( parent, offset + howMany ) );\n\n\t\tfor ( const item of range.getItems( { shallow: true } ) ) {\n\t\t\tif ( item.is( 'element' ) ) {\n\t\t\t\tthis._elementSnapshots.delete( item );\n\t\t\t\tthis._changesInElement.delete( item );\n\n\t\t\t\tthis._removeAllNestedChanges( item, 0, item.maxOffset );\n\t\t\t}\n\t\t}\n\t}\n}\n\n// Returns an array that is a copy of passed child list with the exception that text nodes are split to one or more\n// objects, each representing one character and attributes set on that character.\nfunction _getChildrenSnapshot( children ) {\n\tconst snapshot = [];\n\n\tfor ( const child of children ) {\n\t\tif ( child.is( '$text' ) ) {\n\t\t\tfor ( let i = 0; i < child.data.length; i++ ) {\n\t\t\t\tsnapshot.push( {\n\t\t\t\t\tname: '$text',\n\t\t\t\t\tattributes: new Map( child.getAttributes() )\n\t\t\t\t} );\n\t\t\t}\n\t\t} else {\n\t\t\tsnapshot.push( {\n\t\t\t\tname: child.name,\n\t\t\t\tattributes: new Map( child.getAttributes() )\n\t\t\t} );\n\t\t}\n\t}\n\n\treturn snapshot;\n}\n\n// Generates array of actions for given changes set.\n// It simulates what `diff` function does.\n// Generated actions are:\n// - 'e' for 'equal' - when item at that position did not change,\n// - 'i' for 'insert' - when item at that position was inserted,\n// - 'r' for 'remove' - when item at that position was removed,\n// - 'a' for 'attribute' - when item at that position has it attributes changed.\n//\n// Example (assume that uppercase letters have bold attribute, compare with function code):\n//\n// children before:\tfooBAR\n// children after:\tfoxybAR\n//\n// changes: type: remove, offset: 1, howMany: 1\n//\t\t\ttype: insert, offset: 2, howMany: 2\n//\t\t\ttype: attribute, offset: 4, howMany: 1\n//\n// expected actions: equal (f), remove (o), equal (o), insert (x), insert (y), attribute (b), equal (A), equal (R)\n//\n// steps taken by th script:\n//\n// 1. change = \"type: remove, offset: 1, howMany: 1\"; offset = 0; oldChildrenHandled = 0\n//    1.1 between this change and the beginning is one not-changed node, fill with one equal action, one old child has been handled\n//    1.2 this change removes one node, add one remove action\n//    1.3 change last visited `offset` to 1\n//    1.4 since an old child has been removed, one more old child has been handled\n//    1.5 actions at this point are: equal, remove\n//\n// 2. change = \"type: insert, offset: 2, howMany: 2\"; offset = 1; oldChildrenHandled = 2\n//    2.1 between this change and previous change is one not-changed node, add equal action, another one old children has been handled\n//    2.2 this change inserts two nodes, add two insert actions\n//    2.3 change last visited offset to the end of the inserted range, that is 4\n//    2.4 actions at this point are: equal, remove, equal, insert, insert\n//\n// 3. change = \"type: attribute, offset: 4, howMany: 1\"; offset = 4, oldChildrenHandled = 3\n//    3.1 between this change and previous change are no not-changed nodes\n//    3.2 this change changes one node, add one attribute action\n//    3.3 change last visited `offset` to the end of change range, that is 5\n//    3.4 since an old child has been changed, one more old child has been handled\n//    3.5 actions at this point are: equal, remove, equal, insert, insert, attribute\n//\n// 4. after loop oldChildrenHandled = 4, oldChildrenLength = 6 (fooBAR is 6 characters)\n//    4.1 fill up with two equal actions\n//\n// The result actions are: equal, remove, equal, insert, insert, attribute, equal, equal.\nfunction _generateActionsFromChanges( oldChildrenLength, changes ) {\n\tconst actions = [];\n\n\tlet offset = 0;\n\tlet oldChildrenHandled = 0;\n\n\t// Go through all buffered changes.\n\tfor ( const change of changes ) {\n\t\t// First, fill \"holes\" between changes with \"equal\" actions.\n\t\tif ( change.offset > offset ) {\n\t\t\tfor ( let i = 0; i < change.offset - offset; i++ ) {\n\t\t\t\tactions.push( 'e' );\n\t\t\t}\n\n\t\t\toldChildrenHandled += change.offset - offset;\n\t\t}\n\n\t\t// Then, fill up actions accordingly to change type.\n\t\tif ( change.type == 'insert' ) {\n\t\t\tfor ( let i = 0; i < change.howMany; i++ ) {\n\t\t\t\tactions.push( 'i' );\n\t\t\t}\n\n\t\t\t// The last handled offset is after inserted range.\n\t\t\toffset = change.offset + change.howMany;\n\t\t} else if ( change.type == 'remove' ) {\n\t\t\tfor ( let i = 0; i < change.howMany; i++ ) {\n\t\t\t\tactions.push( 'r' );\n\t\t\t}\n\n\t\t\t// The last handled offset is at the position where the nodes were removed.\n\t\t\toffset = change.offset;\n\t\t\t// We removed `howMany` old nodes, update `oldChildrenHandled`.\n\t\t\toldChildrenHandled += change.howMany;\n\t\t} else {\n\t\t\tactions.push( ...'a'.repeat( change.howMany ).split( '' ) );\n\n\t\t\t// The last handled offset is at the position after the changed range.\n\t\t\toffset = change.offset + change.howMany;\n\t\t\t// We changed `howMany` old nodes, update `oldChildrenHandled`.\n\t\t\toldChildrenHandled += change.howMany;\n\t\t}\n\t}\n\n\t// Fill \"equal\" actions at the end of actions set. Use `oldChildrenHandled` to see how many children\n\t// has not been changed / removed at the end of their parent.\n\tif ( oldChildrenHandled < oldChildrenLength ) {\n\t\tfor ( let i = 0; i < oldChildrenLength - oldChildrenHandled - offset; i++ ) {\n\t\t\tactions.push( 'e' );\n\t\t}\n\t}\n\n\treturn actions;\n}\n\n// Filter callback for Array.filter that filters out change entries that are in graveyard.\nfunction _changesInGraveyardFilter( entry ) {\n\tconst posInGy = entry.position && entry.position.root.rootName == '$graveyard';\n\tconst rangeInGy = entry.range && entry.range.root.rootName == '$graveyard';\n\n\treturn !posInGy && !rangeInGy;\n}\n","/**\n * @license Copyright (c) 2003-2021, CKSource - Frederico Knabben. All rights reserved.\n * For licensing, see LICENSE.md or https://ckeditor.com/legal/ckeditor-oss-license\n */\n\n/**\n * @module engine\n */\n\nexport * from './view/placeholder';\n\nexport { default as EditingController } from './controller/editingcontroller';\nexport { default as DataController } from './controller/datacontroller';\n\nexport { default as Conversion } from './conversion/conversion';\n\nexport { default as HtmlDataProcessor } from './dataprocessor/htmldataprocessor';\n\nexport { default as InsertOperation } from './model/operation/insertoperation';\nexport { default as MarkerOperation } from './model/operation/markeroperation';\nexport { default as OperationFactory } from './model/operation/operationfactory';\nexport { transformSets } from './model/operation/transform';\n\nexport { default as DocumentSelection } from './model/documentselection';\nexport { default as Range } from './model/range';\nexport { default as LiveRange } from './model/liverange';\nexport { default as LivePosition } from './model/liveposition';\nexport { default as Model } from './model/model';\nexport { default as TreeWalker } from './model/treewalker';\nexport { default as Element } from './model/element';\n\nexport { default as DomConverter } from './view/domconverter';\nexport { default as ViewDocument } from './view/document';\n\nexport { getFillerOffset } from './view/containerelement';\nexport { default as Observer } from './view/observer/observer';\nexport { default as ClickObserver } from './view/observer/clickobserver';\nexport { default as DomEventObserver } from './view/observer/domeventobserver';\nexport { default as MouseObserver } from './view/observer/mouseobserver';\nexport { default as DowncastWriter } from './view/downcastwriter';\nexport { default as UpcastWriter } from './view/upcastwriter';\nexport { default as Matcher } from './view/matcher';\n\nexport { default as DomEventData } from './view/observer/domeventdata';\n\nexport { StylesProcessor } from './view/stylesmap';\nexport * from './view/styles/background';\nexport * from './view/styles/border';\nexport * from './view/styles/margin';\nexport * from './view/styles/padding';\nexport * from './view/styles/utils';\n"],"sourceRoot":""}