diff --git a/Examples/Quill/index.html b/Examples/Quill/index.html index 0199956a..af7edbdb 100644 --- a/Examples/Quill/index.html +++ b/Examples/Quill/index.html @@ -2,142 +2,24 @@ + + -
- -
- - - - - - - - - - - - - - - - - - - - - - - - - - - - -
- - -
+
+
+ + diff --git a/Examples/Quill/index.js b/Examples/Quill/index.js index 85316f31..87ad1fc1 100644 --- a/Examples/Quill/index.js +++ b/Examples/Quill/index.js @@ -7,8 +7,8 @@ Y({ name: 'memory' }, connector: { - name: 'websockets-client', - room: 'richtext-example' + name: 'webrtc', + room: 'richtext-example-quill-beta' }, sourceDir: '/bower_components', share: { @@ -18,13 +18,22 @@ Y({ window.yQuill = y // create quill element - window.quill = new Quill('#editor', { + window.quill = new Quill('#quill', { modules: { - 'toolbar': { container: '#toolbar' }, - 'link-tooltip': true + formula: true, + syntax: true, + toolbar: [ + [{ size: ['small', false, 'large', 'huge'] }], + ['bold', 'italic', 'underline'], + [{ color: [] }, { background: [] }], // Snow theme fills in values + [{ script: 'sub' }, { script: 'super' }], + ['link', 'image'], + ['link', 'code-block'], + [{list: 'ordered' }] + ] }, theme: 'snow' - }) + }); // bind quill to richtext type y.share.richtext.bind(window.quill) }) diff --git a/y.es6 b/y.es6 index 4afd9c00..eb67d4bf 100644 --- a/y.es6 +++ b/y.es6 @@ -951,12 +951,16 @@ module.exports = function (Y /* :any */) { } } if (defined == null) { - var isGarbageCollected = yield* this.isGarbageCollected(op.id) + var opid = op.id + var isGarbageCollected = yield* this.isGarbageCollected(opid) if (!isGarbageCollected) { yield* Y.Struct[op.struct].execute.call(this, op) yield* this.addOperation(op) yield* this.store.operationAdded(this, op) - + if (!Y.utils.compareIds(opid, op.id)) { + // operationAdded changed op + op = yield* this.getOperation(opid) + } // if insertion, try to combine with left yield* this.tryCombineWithLeft(op) } @@ -2695,6 +2699,153 @@ module.exports = function (Y /* : any*/) { receivedOp (op) { if (this.awaiting <= 0) { this.onevent(op) + } else if (op.struct === 'Delete') { + var self = this + function checkDelete (d) { + if (d.length == null) { + throw new Error('This shouldn\'t happen! d.length must be defined!') + } + // we check if o deletes something in self.waiting + // if so, we remove the deleted operation + for (var w = 0; w < self.waiting.length; w++) { + var i = self.waiting[w] + if (i.struct === 'Insert' && i.id[0] === d.target[0]) { + var iLength = i.hasOwnProperty('content') ? i.content.length : 1 + var dStart = d.target[1] + var dEnd = d.target[1] + (d.length || 1) + var iStart = i.id[1] + var iEnd = i.id[1] + iLength + // Check if they don't overlap + if (iEnd <= dStart || dEnd <= iStart) { + // no overlapping + continue + } + // we check all overlapping cases. All cases: + /* + 1) iiiii + ddddd + --> modify i and d + 2) iiiiiii + ddddd + --> modify i, remove d + 3) iiiiiii + ddd + --> remove d, modify i, and create another i (for the right hand side) + 4) iiiii + ddddddd + --> remove i, modify d + 5) iiiiiii + ddddddd + --> remove both i and d (**) + 6) iiiiiii + ddddd + --> modify i, remove d + 7) iii + ddddddd + --> remove i, create and apply two d with checkDelete(d) (**) + 8) iiiii + ddddddd + --> remove i, modify d (**) + 9) iiiii + ddddd + --> modify i and d + (**) (also check if i contains content or type) + */ + // TODO: I left some debugger statements, because I want to debug all cases once in production. REMEMBER END TODO + if (iStart < dStart) { + if (dStart < iEnd) { + if (iEnd < dEnd) { + // Case 1 + // remove the right part of i's content + i.content.splice(dStart - iStart) + // remove the start of d's deletion + d.length = dEnd - iEnd + d.target = [d.target[0], iEnd] + continue + } else if (iEnd === dEnd) { + // Case 2 + i.content.splice(dStart - iStart) + // remove d, we do that by simply ending this function + return + } else { // (dEnd < iEnd) + // Case 3 + var newI = { + id: [i.id[0], dEnd], + content: i.content.slice(dEnd - iStart), + struct: 'Insert' + } + self.waiting.push(newI) + i.content.splice(dStart - iStart) + return + } + } + } else if (dStart === iStart) { + if (iEnd < dEnd) { + // Case 4 + d.length = dEnd - iEnd + d.target = [d.target[0], iEnd] + i.content = [] + continue + } else if (iEnd === dEnd) { + // Case 5 + self.waiting.splice(w, 1) + return + } else { // (dEnd < iEnd) + // Case 6 + i.content = i.content.slice(dEnd - iStart) + i.id = [i.id[0], dEnd] + return + } + } else { // (dStart < iStart) + if (iStart < dEnd) { + // they overlap + /* + 7) iii + ddddddd + --> remove i, create and apply two d with checkDelete(d) (**) + 8) iiiii + ddddddd + --> remove i, modify d (**) + 9) iiiii + ddddd + --> modify i and d + */ + if (iEnd < dEnd) { + // Case 7 + debugger + self.waiting.splice(w, 1) + checkDelete({ + target: [d.target[0], dStart], + length: iStart - dStart, + struct: 'Delete' + }) + checkDelete({ + target: [d.target[0], iEnd], + length: iEnd - dEnd, + struct: 'Delete' + }) + return + } else if (iEnd === dEnd) { + // Case 8 + self.waiting.splice(w, 1) + w-- + d.length -= iLength + continue + } else { // dEnd < iEnd + // Case 9 + d.length = iStart - dStart + i.content.splice(0, dEnd - iStart) + i.id = [i.id[0], dEnd] + continue + } + } + } + } + } + // finished with remaining operations + self.waiting.push(d) + } + checkDelete(op) } else { this.waiting.push(op) } @@ -2779,11 +2930,27 @@ module.exports = function (Y /* : any*/) { ins.push(o) } }) + this.waiting = [] // put in executable order ins = notSoSmartSort(ins) - ins.forEach(this.onevent) - dels.forEach(this.onevent) - this.waiting = [] + // this.onevent can trigger the creation of another operation + // -> check if this.awaiting increased & stop computation if it does + for (var i = 0; i < ins.length; i++) { + if (this.awaiting === 0) { + this.onevent(ins[i]) + } else { + this.waiting = this.waiting.concat(ins.slice(i)) + break + } + } + for (var i = 0; i < dels.length; i++) { + if (this.awaiting === 0) { + this.onevent(dels[i]) + } else { + this.waiting = this.waiting.concat(dels.slice(i)) + break + } + } } } } diff --git a/y.es6.map b/y.es6.map index 634a66bf..91390bd1 100644 --- a/y.es6.map +++ b/y.es6.map @@ -1 +1 @@ -{"version":3,"sources":["node_modules/browser-pack/_prelude.js","src/Connector.js","src/Connectors/Test.js","src/Database.js","src/Struct.js","src/Transaction.js","src/Utils.js","src/y.js"],"names":[],"mappings":"AAAA;ACAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC9ZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACrKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC1fA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC1ZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACzkCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC7jBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"y.es6","sourceRoot":"/source/","sourcesContent":["(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o;\n whenSyncedListeners: Array;\n currentSyncTarget: ?UserId;\n syncingClients: Array;\n forwardToSyncingClients: boolean;\n debug: boolean;\n broadcastedHB: boolean;\n syncStep2: Promise;\n userId: UserId;\n send: Function;\n broadcast: Function;\n broadcastOpBuffer: Array;\n protocolVersion: number;\n */\n /*\n opts contains the following information:\n role : String Role of this client (\"master\" or \"slave\")\n userId : String Uniquely defines the user.\n debug: Boolean Whether to print debug messages (optional)\n */\n constructor (y, opts) {\n this.y = y\n if (opts == null) {\n opts = {}\n }\n if (opts.role == null || opts.role === 'master') {\n this.role = 'master'\n } else if (opts.role === 'slave') {\n this.role = 'slave'\n } else {\n throw new Error(\"Role must be either 'master' or 'slave'!\")\n }\n this.y.db.forwardAppliedOperations = opts.forwardAppliedOperations || false\n this.role = opts.role\n this.connections = {}\n this.isSynced = false\n this.userEventListeners = []\n this.whenSyncedListeners = []\n this.currentSyncTarget = null\n this.syncingClients = []\n this.forwardToSyncingClients = opts.forwardToSyncingClients !== false\n this.debug = opts.debug === true\n this.broadcastedHB = false\n this.syncStep2 = Promise.resolve()\n this.broadcastOpBuffer = []\n this.protocolVersion = 11\n }\n reconnect () {\n }\n disconnect () {\n this.connections = {}\n this.isSynced = false\n this.currentSyncTarget = null\n this.broadcastedHB = false\n this.syncingClients = []\n this.whenSyncedListeners = []\n return this.y.db.stopGarbageCollector()\n }\n setUserId (userId) {\n if (this.userId == null) {\n this.userId = userId\n return this.y.db.setUserId(userId)\n } else {\n return null\n }\n }\n onUserEvent (f) {\n this.userEventListeners.push(f)\n }\n userLeft (user) {\n if (this.connections[user] != null) {\n delete this.connections[user]\n if (user === this.currentSyncTarget) {\n this.currentSyncTarget = null\n this.findNextSyncTarget()\n }\n this.syncingClients = this.syncingClients.filter(function (cli) {\n return cli !== user\n })\n for (var f of this.userEventListeners) {\n f({\n action: 'userLeft',\n user: user\n })\n }\n }\n }\n userJoined (user, role) {\n if (role == null) {\n throw new Error('You must specify the role of the joined user!')\n }\n if (this.connections[user] != null) {\n throw new Error('This user already joined!')\n }\n this.connections[user] = {\n isSynced: false,\n role: role\n }\n for (var f of this.userEventListeners) {\n f({\n action: 'userJoined',\n user: user,\n role: role\n })\n }\n if (this.currentSyncTarget == null) {\n this.findNextSyncTarget()\n }\n }\n // Execute a function _when_ we are connected.\n // If not connected, wait until connected\n whenSynced (f) {\n if (this.isSynced) {\n f()\n } else {\n this.whenSyncedListeners.push(f)\n }\n }\n /*\n\n returns false, if there is no sync target\n true otherwise\n */\n findNextSyncTarget () {\n if (this.currentSyncTarget != null || this.isSynced) {\n return // \"The current sync has not finished!\"\n }\n\n var syncUser = null\n for (var uid in this.connections) {\n if (!this.connections[uid].isSynced) {\n syncUser = uid\n break\n }\n }\n var conn = this\n if (syncUser != null) {\n this.currentSyncTarget = syncUser\n this.y.db.requestTransaction(function *() {\n var stateSet = yield* this.getStateSet()\n var deleteSet = yield* this.getDeleteSet()\n conn.send(syncUser, {\n type: 'sync step 1',\n stateSet: stateSet,\n deleteSet: deleteSet,\n protocolVersion: conn.protocolVersion\n })\n })\n } else {\n this.y.db.requestTransaction(function *() {\n // it is crucial that isSynced is set at the time garbageCollectAfterSync is called\n conn.isSynced = true\n yield* this.garbageCollectAfterSync()\n // call whensynced listeners\n for (var f of conn.whenSyncedListeners) {\n f()\n }\n conn.whenSyncedListeners = []\n })\n }\n }\n send (uid, message) {\n if (this.debug) {\n console.log(`send ${this.userId} -> ${uid}: ${message.type}`, message) // eslint-disable-line\n }\n }\n /*\n Buffer operations, and broadcast them when ready.\n */\n broadcastOps (ops) {\n ops = ops.map(function (op) {\n return Y.Struct[op.struct].encode(op)\n })\n var self = this\n function broadcastOperations () {\n if (self.broadcastOpBuffer.length > 0) {\n self.broadcast({\n type: 'update',\n ops: self.broadcastOpBuffer\n })\n self.broadcastOpBuffer = []\n }\n }\n if (this.broadcastOpBuffer.length === 0) {\n this.broadcastOpBuffer = ops\n if (this.y.db.transactionInProgress) {\n this.y.db.whenTransactionsFinished().then(broadcastOperations)\n } else {\n setTimeout(broadcastOperations, 0)\n }\n } else {\n this.broadcastOpBuffer = this.broadcastOpBuffer.concat(ops)\n }\n }\n /*\n You received a raw message, and you know that it is intended for Yjs. Then call this function.\n */\n receiveMessage (sender/* :UserId */, message/* :Message */) {\n if (sender === this.userId) {\n return\n }\n if (this.debug) {\n console.log(`receive ${sender} -> ${this.userId}: ${message.type}`, JSON.parse(JSON.stringify(message))) // eslint-disable-line\n }\n if (message.protocolVersion != null && message.protocolVersion !== this.protocolVersion) {\n console.error(\n `You tried to sync with a yjs instance that has a different protocol version\n (You: ${this.protocolVersion}, Client: ${message.protocolVersion}).\n The sync was stopped. You need to upgrade your dependencies (especially Yjs & the Connector)!\n `)\n this.send(sender, {\n type: 'sync stop',\n protocolVersion: this.protocolVersion\n })\n return\n }\n if (message.type === 'sync step 1') {\n let conn = this\n let m = message\n this.y.db.requestTransaction(function *() {\n var currentStateSet = yield* this.getStateSet()\n yield* this.applyDeleteSet(m.deleteSet)\n\n var ds = yield* this.getDeleteSet()\n var ops = yield* this.getOperations(m.stateSet)\n conn.send(sender, {\n type: 'sync step 2',\n os: ops,\n stateSet: currentStateSet,\n deleteSet: ds,\n protocolVersion: this.protocolVersion\n })\n if (this.forwardToSyncingClients) {\n conn.syncingClients.push(sender)\n setTimeout(function () {\n conn.syncingClients = conn.syncingClients.filter(function (cli) {\n return cli !== sender\n })\n conn.send(sender, {\n type: 'sync done'\n })\n }, 5000) // TODO: conn.syncingClientDuration)\n } else {\n conn.send(sender, {\n type: 'sync done'\n })\n }\n conn._setSyncedWith(sender)\n })\n } else if (message.type === 'sync step 2') {\n let conn = this\n var broadcastHB = !this.broadcastedHB\n this.broadcastedHB = true\n var db = this.y.db\n var defer = {}\n defer.promise = new Promise(function (resolve) {\n defer.resolve = resolve\n })\n this.syncStep2 = defer.promise\n let m /* :MessageSyncStep2 */ = message\n db.requestTransaction(function * () {\n yield* this.applyDeleteSet(m.deleteSet)\n this.store.apply(m.os)\n db.requestTransaction(function * () {\n var ops = yield* this.getOperations(m.stateSet)\n if (ops.length > 0) {\n if (!broadcastHB) { // TODO: consider to broadcast here..\n conn.send(sender, {\n type: 'update',\n ops: ops\n })\n } else {\n // broadcast only once!\n conn.broadcastOps(ops)\n }\n }\n defer.resolve()\n })\n })\n } else if (message.type === 'sync done') {\n var self = this\n this.syncStep2.then(function () {\n self._setSyncedWith(sender)\n })\n } else if (message.type === 'update') {\n if (this.forwardToSyncingClients) {\n for (var client of this.syncingClients) {\n this.send(client, message)\n }\n }\n if (this.y.db.forwardAppliedOperations) {\n var delops = message.ops.filter(function (o) {\n return o.struct === 'Delete'\n })\n if (delops.length > 0) {\n this.broadcastOps(delops)\n }\n }\n this.y.db.apply(message.ops)\n }\n }\n _setSyncedWith (user) {\n var conn = this.connections[user]\n if (conn != null) {\n conn.isSynced = true\n }\n if (user === this.currentSyncTarget) {\n this.currentSyncTarget = null\n this.findNextSyncTarget()\n }\n }\n /*\n Currently, the HB encodes operations as JSON. For the moment I want to keep it\n that way. Maybe we support encoding in the HB as XML in the future, but for now I don't want\n too much overhead. Y is very likely to get changed a lot in the future\n\n Because we don't want to encode JSON as string (with character escaping, wich makes it pretty much unreadable)\n we encode the JSON as XML.\n\n When the HB support encoding as XML, the format should look pretty much like this.\n\n does not support primitive values as array elements\n expects an ltx (less than xml) object\n */\n parseMessageFromXml (m/* :any */) {\n function parseArray (node) {\n for (var n of node.children) {\n if (n.getAttribute('isArray') === 'true') {\n return parseArray(n)\n } else {\n return parseObject(n)\n }\n }\n }\n function parseObject (node/* :any */) {\n var json = {}\n for (var attrName in node.attrs) {\n var value = node.attrs[attrName]\n var int = parseInt(value, 10)\n if (isNaN(int) || ('' + int) !== value) {\n json[attrName] = value\n } else {\n json[attrName] = int\n }\n }\n for (var n/* :any */ in node.children) {\n var name = n.name\n if (n.getAttribute('isArray') === 'true') {\n json[name] = parseArray(n)\n } else {\n json[name] = parseObject(n)\n }\n }\n return json\n }\n parseObject(m)\n }\n /*\n encode message in xml\n we use string because Strophe only accepts an \"xml-string\"..\n So {a:4,b:{c:5}} will look like\n \n \n \n m - ltx element\n json - Object\n */\n encodeMessageToXml (msg, obj) {\n // attributes is optional\n function encodeObject (m, json) {\n for (var name in json) {\n var value = json[name]\n if (name == null) {\n // nop\n } else if (value.constructor === Object) {\n encodeObject(m.c(name), value)\n } else if (value.constructor === Array) {\n encodeArray(m.c(name), value)\n } else {\n m.setAttribute(name, value)\n }\n }\n }\n function encodeArray (m, array) {\n m.setAttribute('isArray', 'true')\n for (var e of array) {\n if (e.constructor === Object) {\n encodeObject(m.c('array-element'), e)\n } else {\n encodeArray(m.c('array-element'), e)\n }\n }\n }\n if (obj.constructor === Object) {\n encodeObject(msg.c('y', { xmlns: 'http://y.ninja/connector-stanza' }), obj)\n } else if (obj.constructor === Array) {\n encodeArray(msg.c('y', { xmlns: 'http://y.ninja/connector-stanza' }), obj)\n } else {\n throw new Error(\"I can't encode this json!\")\n }\n }\n }\n Y.AbstractConnector = AbstractConnector\n}\n","/* global getRandom, async */\n'use strict'\n\nmodule.exports = function (Y) {\n var globalRoom = {\n users: {},\n buffers: {}, // TODO: reimplement this idea. This does not cover all cases!! Here, you have a queue which is unrealistic (i.e. think about multiple incoming connections)\n removeUser: function (user) {\n for (var i in this.users) {\n this.users[i].userLeft(user)\n }\n delete this.users[user]\n delete this.buffers[user]\n },\n addUser: function (connector) {\n this.users[connector.userId] = connector\n this.buffers[connector.userId] = {}\n for (var uname in this.users) {\n if (uname !== connector.userId) {\n var u = this.users[uname]\n u.userJoined(connector.userId, 'master')\n connector.userJoined(u.userId, 'master')\n }\n }\n },\n whenTransactionsFinished: function () {\n var ps = []\n for (var name in this.users) {\n ps.push(this.users[name].y.db.whenTransactionsFinished())\n }\n return Promise.all(ps)\n },\n flushOne: function flushOne () {\n var bufs = []\n for (var receiver in globalRoom.buffers) {\n let buff = globalRoom.buffers[receiver]\n var push = false\n for (let sender in buff) {\n if (buff[sender].length > 0) {\n push = true\n break\n }\n }\n if (push) {\n bufs.push(receiver)\n }\n }\n if (bufs.length > 0) {\n var userId = getRandom(bufs)\n let buff = globalRoom.buffers[userId]\n let sender = getRandom(Object.keys(buff))\n var m = buff[sender].shift()\n if (buff[sender].length === 0) {\n delete buff[sender]\n }\n var user = globalRoom.users[userId]\n user.receiveMessage(m[0], m[1])\n return user.y.db.whenTransactionsFinished()\n } else {\n return false\n }\n },\n flushAll: function () {\n return new Promise(function (resolve) {\n // flushes may result in more created operations,\n // flush until there is nothing more to flush\n function nextFlush () {\n var c = globalRoom.flushOne()\n if (c) {\n while (c) {\n c = globalRoom.flushOne()\n }\n globalRoom.whenTransactionsFinished().then(nextFlush)\n } else {\n setTimeout(function () {\n var c = globalRoom.flushOne()\n if (c) {\n c.then(function () {\n globalRoom.whenTransactionsFinished().then(nextFlush)\n })\n } else {\n resolve()\n }\n }, 0)\n }\n }\n globalRoom.whenTransactionsFinished().then(nextFlush)\n })\n }\n }\n Y.utils.globalRoom = globalRoom\n\n var userIdCounter = 0\n\n class Test extends Y.AbstractConnector {\n constructor (y, options) {\n if (options === undefined) {\n throw new Error('Options must not be undefined!')\n }\n options.role = 'master'\n options.forwardToSyncingClients = false\n super(y, options)\n this.setUserId((userIdCounter++) + '').then(() => {\n globalRoom.addUser(this)\n })\n this.globalRoom = globalRoom\n this.syncingClientDuration = 0\n }\n receiveMessage (sender, m) {\n super.receiveMessage(sender, JSON.parse(JSON.stringify(m)))\n }\n send (userId, message) {\n var buffer = globalRoom.buffers[userId]\n if (buffer != null) {\n if (buffer[this.userId] == null) {\n buffer[this.userId] = []\n }\n buffer[this.userId].push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n broadcast (message) {\n for (var key in globalRoom.buffers) {\n var buff = globalRoom.buffers[key]\n if (buff[this.userId] == null) {\n buff[this.userId] = []\n }\n buff[this.userId].push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n isDisconnected () {\n return globalRoom.users[this.userId] == null\n }\n reconnect () {\n if (this.isDisconnected()) {\n globalRoom.addUser(this)\n super.reconnect()\n }\n return Y.utils.globalRoom.flushAll()\n }\n disconnect () {\n if (!this.isDisconnected()) {\n globalRoom.removeUser(this.userId)\n super.disconnect()\n }\n return this.y.db.whenTransactionsFinished()\n }\n flush () {\n var self = this\n return async(function * () {\n var buff = globalRoom.buffers[self.userId]\n while (Object.keys(buff).length > 0) {\n var sender = getRandom(Object.keys(buff))\n var m = buff[sender].shift()\n if (buff[sender].length === 0) {\n delete buff[sender]\n }\n this.receiveMessage(m[0], m[1])\n }\n yield self.whenTransactionsFinished()\n })\n }\n }\n\n Y.Test = Test\n}\n","/* @flow */\n'use strict'\n\nmodule.exports = function (Y /* :any */) {\n /*\n Partial definition of an OperationStore.\n TODO: name it Database, operation store only holds operations.\n\n A database definition must alse define the following methods:\n * logTable() (optional)\n - show relevant information information in a table\n * requestTransaction(makeGen)\n - request a transaction\n * destroy()\n - destroy the database\n */\n class AbstractDatabase {\n /* ::\n y: YConfig;\n forwardAppliedOperations: boolean;\n listenersById: Object;\n listenersByIdExecuteNow: Array;\n listenersByIdRequestPending: boolean;\n initializedTypes: Object;\n whenUserIdSetListener: ?Function;\n waitingTransactions: Array;\n transactionInProgress: boolean;\n executeOrder: Array;\n gc1: Array;\n gc2: Array;\n gcTimeout: number;\n gcInterval: any;\n garbageCollect: Function;\n executeOrder: Array; // for debugging only\n userId: UserId;\n opClock: number;\n transactionsFinished: ?{promise: Promise, resolve: any};\n transact: (x: ?Generator) => any;\n */\n constructor (y, opts) {\n this.y = y\n var os = this\n this.userId = null\n var resolve\n this.userIdPromise = new Promise(function (r) {\n resolve = r\n })\n this.userIdPromise.resolve = resolve\n // whether to broadcast all applied operations (insert & delete hook)\n this.forwardAppliedOperations = false\n // E.g. this.listenersById[id] : Array\n this.listenersById = {}\n // Execute the next time a transaction is requested\n this.listenersByIdExecuteNow = []\n // A transaction is requested\n this.listenersByIdRequestPending = false\n /* To make things more clear, the following naming conventions:\n * ls : we put this.listenersById on ls\n * l : Array\n * id : Id (can't use as property name)\n * sid : String (converted from id via JSON.stringify\n so we can use it as a property name)\n\n Always remember to first overwrite\n a property before you iterate over it!\n */\n // TODO: Use ES7 Weak Maps. This way types that are no longer user,\n // wont be kept in memory.\n this.initializedTypes = {}\n this.waitingTransactions = []\n this.transactionInProgress = false\n this.transactionIsFlushed = false\n if (typeof YConcurrency_TestingMode !== 'undefined') {\n this.executeOrder = []\n }\n this.gc1 = [] // first stage\n this.gc2 = [] // second stage -> after that, remove the op\n this.gcTimeout = !opts.gcTimeout ? 50000 : opts.gcTimeouts\n function garbageCollect () {\n return os.whenTransactionsFinished().then(function () {\n if (os.gc1.length > 0 || os.gc2.length > 0) {\n if (!os.y.isConnected()) {\n console.warn('gc should be empty when disconnected!')\n }\n return new Promise((resolve) => {\n os.requestTransaction(function * () {\n if (os.y.connector != null && os.y.connector.isSynced) {\n for (var i = 0; i < os.gc2.length; i++) {\n var oid = os.gc2[i]\n yield* this.garbageCollectOperation(oid)\n }\n os.gc2 = os.gc1\n os.gc1 = []\n }\n // TODO: Use setInterval here instead (when garbageCollect is called several times there will be several timeouts..)\n if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n resolve()\n })\n })\n } else {\n // TODO: see above\n if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n return Promise.resolve()\n }\n })\n }\n this.garbageCollect = garbageCollect\n if (this.gcTimeout > 0) {\n garbageCollect()\n }\n }\n queueGarbageCollector (id) {\n if (this.y.isConnected()) {\n this.gc1.push(id)\n }\n }\n emptyGarbageCollector () {\n return new Promise(resolve => {\n var check = () => {\n if (this.gc1.length > 0 || this.gc2.length > 0) {\n this.garbageCollect().then(check)\n } else {\n resolve()\n }\n }\n setTimeout(check, 0)\n })\n }\n addToDebug () {\n if (typeof YConcurrency_TestingMode !== 'undefined') {\n var command /* :string */ = Array.prototype.map.call(arguments, function (s) {\n if (typeof s === 'string') {\n return s\n } else {\n return JSON.stringify(s)\n }\n }).join('').replace(/\"/g, \"'\").replace(/,/g, ', ').replace(/:/g, ': ')\n this.executeOrder.push(command)\n }\n }\n getDebugData () {\n console.log(this.executeOrder.join('\\n'))\n }\n stopGarbageCollector () {\n var self = this\n return new Promise(function (resolve) {\n self.requestTransaction(function * () {\n var ungc /* :Array */ = self.gc1.concat(self.gc2)\n self.gc1 = []\n self.gc2 = []\n for (var i = 0; i < ungc.length; i++) {\n var op = yield* this.getOperation(ungc[i])\n if (op != null) {\n delete op.gc\n yield* this.setOperation(op)\n }\n }\n resolve()\n })\n })\n }\n /*\n Try to add to GC.\n\n TODO: rename this function\n\n Rulez:\n * Only gc if this user is online\n * The most left element in a list must not be gc'd.\n => There is at least one element in the list\n\n returns true iff op was added to GC\n */\n * addToGarbageCollector (op, left) {\n if (\n op.gc == null &&\n op.deleted === true\n ) {\n var gc = false\n if (left != null && left.deleted === true) {\n gc = true\n } else if (op.content != null && op.content.length > 1) {\n op = yield* this.getInsertionCleanStart([op.id[0], op.id[1] + 1])\n gc = true\n }\n if (gc) {\n op.gc = true\n yield* this.setOperation(op)\n this.store.queueGarbageCollector(op.id)\n return true\n }\n }\n return false\n }\n removeFromGarbageCollector (op) {\n function filter (o) {\n return !Y.utils.compareIds(o, op.id)\n }\n this.gc1 = this.gc1.filter(filter)\n this.gc2 = this.gc2.filter(filter)\n delete op.gc\n }\n * destroy () {\n clearInterval(this.gcInterval)\n this.gcInterval = null\n for (var key in this.initializedTypes) {\n var type = this.initializedTypes[key]\n if (type._destroy != null) {\n type._destroy()\n } else {\n console.error('The type you included does not provide destroy functionality, it will remain in memory (updating your packages will help).')\n }\n }\n }\n setUserId (userId) {\n if (!this.userIdPromise.inProgress) {\n this.userIdPromise.inProgress = true\n var self = this\n self.requestTransaction(function * () {\n self.userId = userId\n var state = yield* this.getState(userId)\n self.opClock = state.clock\n self.userIdPromise.resolve(userId)\n })\n }\n return this.userIdPromise\n }\n whenUserIdSet (f) {\n this.userIdPromise.then(f)\n }\n getNextOpId (numberOfIds) {\n if (numberOfIds == null) {\n throw new Error('getNextOpId expects the number of created ids to create!')\n } else if (this.userId == null) {\n throw new Error('OperationStore not yet initialized!')\n } else {\n var id = [this.userId, this.opClock]\n this.opClock += numberOfIds\n return id\n }\n }\n /*\n Apply a list of operations.\n\n * get a transaction\n * check whether all Struct.*.requiredOps are in the OS\n * check if it is an expected op (otherwise wait for it)\n * check if was deleted, apply a delete operation after op was applied\n */\n apply (ops) {\n for (var i = 0; i < ops.length; i++) {\n var o = ops[i]\n if (o.id == null || o.id[0] !== this.y.connector.userId) {\n var required = Y.Struct[o.struct].requiredOps(o)\n if (o.requires != null) {\n required = required.concat(o.requires)\n }\n this.whenOperationsExist(required, o)\n }\n }\n }\n /*\n op is executed as soon as every operation requested is available.\n Note that Transaction can (and should) buffer requests.\n */\n whenOperationsExist (ids, op) {\n if (ids.length > 0) {\n let listener = {\n op: op,\n missing: ids.length\n }\n\n for (let i = 0; i < ids.length; i++) {\n let id = ids[i]\n let sid = JSON.stringify(id)\n let l = this.listenersById[sid]\n if (l == null) {\n l = []\n this.listenersById[sid] = l\n }\n l.push(listener)\n }\n } else {\n this.listenersByIdExecuteNow.push({\n op: op\n })\n }\n\n if (this.listenersByIdRequestPending) {\n return\n }\n\n this.listenersByIdRequestPending = true\n var store = this\n\n this.requestTransaction(function * () {\n var exeNow = store.listenersByIdExecuteNow\n store.listenersByIdExecuteNow = []\n\n var ls = store.listenersById\n store.listenersById = {}\n\n store.listenersByIdRequestPending = false\n\n for (let key = 0; key < exeNow.length; key++) {\n let o = exeNow[key].op\n yield* store.tryExecute.call(this, o)\n }\n\n for (var sid in ls) {\n var l = ls[sid]\n var id = JSON.parse(sid)\n var op\n if (typeof id[1] === 'string') {\n op = yield* this.getOperation(id)\n } else {\n op = yield* this.getInsertion(id)\n }\n if (op == null) {\n store.listenersById[sid] = l\n } else {\n for (let i = 0; i < l.length; i++) {\n let listener = l[i]\n let o = listener.op\n if (--listener.missing === 0) {\n yield* store.tryExecute.call(this, o)\n }\n }\n }\n }\n })\n }\n /*\n Actually execute an operation, when all expected operations are available.\n */\n /* :: // TODO: this belongs somehow to transaction\n store: Object;\n getOperation: any;\n isGarbageCollected: any;\n addOperation: any;\n whenOperationsExist: any;\n */\n * tryExecute (op) {\n this.store.addToDebug('yield* this.store.tryExecute.call(this, ', JSON.stringify(op), ')')\n if (op.struct === 'Delete') {\n yield* Y.Struct.Delete.execute.call(this, op)\n // this is now called in Transaction.deleteOperation!\n // yield* this.store.operationAdded(this, op)\n } else {\n // check if this op was defined\n var defined = yield* this.getInsertion(op.id)\n while (defined != null && defined.content != null) {\n // check if this op has a longer content in the case it is defined\n if (defined.id[1] + defined.content.length < op.id[1] + op.content.length) {\n var overlapSize = defined.content.length - (op.id[1] - defined.id[1])\n op.content.splice(0, overlapSize)\n op.id = [op.id[0], op.id[1] + overlapSize]\n op.left = Y.utils.getLastId(defined)\n op.origin = op.left\n defined = yield* this.getOperation(op.id) // getOperation suffices here\n } else {\n break\n }\n }\n if (defined == null) {\n var isGarbageCollected = yield* this.isGarbageCollected(op.id)\n if (!isGarbageCollected) {\n yield* Y.Struct[op.struct].execute.call(this, op)\n yield* this.addOperation(op)\n yield* this.store.operationAdded(this, op)\n\n // if insertion, try to combine with left\n yield* this.tryCombineWithLeft(op)\n }\n }\n }\n }\n /*\n * Called by a transaction when an operation is added.\n * This function is especially important for y-indexeddb, where several instances may share a single database.\n * Every time an operation is created by one instance, it is send to all other instances and operationAdded is called\n *\n * If it's not a Delete operation:\n * * Checks if another operation is executable (listenersById)\n * * Update state, if possible\n *\n * Always:\n * * Call type\n */\n * operationAdded (transaction, op) {\n if (op.struct === 'Delete') {\n var target = yield* transaction.getInsertion(op.target)\n var type = this.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(transaction, op)\n }\n } else {\n // increase SS\n yield* transaction.updateState(op.id[0])\n var opLen = op.content != null ? op.content.length : 1\n for (let i = 0; i < opLen; i++) {\n // notify whenOperation listeners (by id)\n var sid = JSON.stringify([op.id[0], op.id[1] + i])\n var l = this.listenersById[sid]\n delete this.listenersById[sid]\n if (l != null) {\n for (var key in l) {\n var listener = l[key]\n if (--listener.missing === 0) {\n this.whenOperationsExist([], listener.op)\n }\n }\n }\n }\n var t = this.initializedTypes[JSON.stringify(op.parent)]\n\n // if parent is deleted, mark as gc'd and return\n if (op.parent != null) {\n var parentIsDeleted = yield* transaction.isDeleted(op.parent)\n if (parentIsDeleted) {\n yield* transaction.deleteList(op.id)\n return\n }\n }\n\n // notify parent, if it was instanciated as a custom type\n if (t != null) {\n let o = Y.utils.copyOperation(op)\n yield* t._changed(transaction, o)\n }\n if (!op.deleted) {\n // Delete if DS says this is actually deleted\n var len = op.content != null ? op.content.length : 1\n var startId = op.id // You must not use op.id in the following loop, because op will change when deleted\n for (let i = 0; i < len; i++) {\n var id = [startId[0], startId[1] + i]\n var opIsDeleted = yield* transaction.isDeleted(id)\n if (opIsDeleted) {\n var delop = {\n struct: 'Delete',\n target: id\n }\n yield* this.tryExecute.call(transaction, delop)\n }\n }\n }\n }\n }\n whenTransactionsFinished () {\n if (this.transactionInProgress) {\n if (this.transactionsFinished == null) {\n var resolve\n var promise = new Promise(function (r) {\n resolve = r\n })\n this.transactionsFinished = {\n resolve: resolve,\n promise: promise\n }\n return promise\n } else {\n return this.transactionsFinished.promise\n }\n } else {\n return Promise.resolve()\n }\n }\n // Check if there is another transaction request.\n // * the last transaction is always a flush :)\n getNextRequest () {\n if (this.waitingTransactions.length === 0) {\n if (this.transactionIsFlushed) {\n this.transactionInProgress = false\n this.transactionIsFlushed = false\n if (this.transactionsFinished != null) {\n this.transactionsFinished.resolve()\n this.transactionsFinished = null\n }\n return null\n } else {\n this.transactionIsFlushed = true\n return function * () {\n yield* this.flush()\n }\n }\n } else {\n this.transactionIsFlushed = false\n return this.waitingTransactions.shift()\n }\n }\n requestTransaction (makeGen/* :any */, callImmediately) {\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n setTimeout(() => {\n this.transact(this.getNextRequest())\n }, 0)\n }\n }\n }\n Y.AbstractDatabase = AbstractDatabase\n}\n","/* @flow */\n'use strict'\n\n/*\n An operation also defines the structure of a type. This is why operation and\n structure are used interchangeably here.\n\n It must be of the type Object. I hope to achieve some performance\n improvements when working on databases that support the json format.\n\n An operation must have the following properties:\n\n * encode\n - Encode the structure in a readable format (preferably string- todo)\n * decode (todo)\n - decode structure to json\n * execute\n - Execute the semantics of an operation.\n * requiredOps\n - Operations that are required to execute this operation.\n*/\nmodule.exports = function (Y/* :any */) {\n var Struct = {\n /* This is the only operation that is actually not a structure, because\n it is not stored in the OS. This is why it _does not_ have an id\n\n op = {\n target: Id\n }\n */\n Delete: {\n encode: function (op) {\n return op\n },\n requiredOps: function (op) {\n return [] // [op.target]\n },\n execute: function * (op) {\n return yield* this.deleteOperation(op.target, op.length || 1)\n }\n },\n Insert: {\n /* {\n content: [any],\n opContent: Id,\n id: Id,\n left: Id,\n origin: Id,\n right: Id,\n parent: Id,\n parentSub: string (optional), // child of Map type\n }\n */\n encode: function (op/* :Insertion */) /* :Insertion */ {\n // TODO: you could not send the \"left\" property, then you also have to\n // \"op.left = null\" in $execute or $decode\n var e/* :any */ = {\n id: op.id,\n left: op.left,\n right: op.right,\n origin: op.origin,\n parent: op.parent,\n struct: op.struct\n }\n if (op.parentSub != null) {\n e.parentSub = op.parentSub\n }\n if (op.hasOwnProperty('opContent')) {\n e.opContent = op.opContent\n } else {\n e.content = op.content.slice()\n }\n\n return e\n },\n requiredOps: function (op) {\n var ids = []\n if (op.left != null) {\n ids.push(op.left)\n }\n if (op.right != null) {\n ids.push(op.right)\n }\n if (op.origin != null && !Y.utils.compareIds(op.left, op.origin)) {\n ids.push(op.origin)\n }\n // if (op.right == null && op.left == null) {\n ids.push(op.parent)\n\n if (op.opContent != null) {\n ids.push(op.opContent)\n }\n return ids\n },\n getDistanceToOrigin: function * (op) {\n if (op.left == null) {\n return 0\n } else {\n var d = 0\n var o = yield* this.getInsertion(op.left)\n while (!Y.utils.matchesId(o, op.origin)) {\n d++\n if (o.left == null) {\n break\n } else {\n o = yield* this.getInsertion(o.left)\n }\n }\n return d\n }\n },\n /*\n # $this has to find a unique position between origin and the next known character\n # case 1: $origin equals $o.origin: the $creator parameter decides if left or right\n # let $OL= [o1,o2,o3,o4], whereby $this is to be inserted between o1 and o4\n # o2,o3 and o4 origin is 1 (the position of o2)\n # there is the case that $this.creator < o2.creator, but o3.creator < $this.creator\n # then o2 knows o3. Since on another client $OL could be [o1,o3,o4] the problem is complex\n # therefore $this would be always to the right of o3\n # case 2: $origin < $o.origin\n # if current $this insert_position > $o origin: $this ins\n # else $insert_position will not change\n # (maybe we encounter case 1 later, then this will be to the right of $o)\n # case 3: $origin > $o.origin\n # $this insert_position is to the left of $o (forever!)\n */\n execute: function * (op) {\n var i // loop counter\n\n // during this function some ops may get split into two pieces (e.g. with getInsertionCleanEnd)\n // We try to merge them later, if possible\n var tryToRemergeLater = []\n\n if (op.origin != null) { // TODO: !== instead of !=\n // we save in origin that op originates in it\n // we need that later when we eventually garbage collect origin (see transaction)\n var origin = yield* this.getInsertionCleanEnd(op.origin)\n if (origin.originOf == null) {\n origin.originOf = []\n }\n origin.originOf.push(op.id)\n yield* this.setOperation(origin)\n if (origin.right != null) {\n tryToRemergeLater.push(origin.right)\n }\n }\n var distanceToOrigin = i = yield* Struct.Insert.getDistanceToOrigin.call(this, op) // most cases: 0 (starts from 0)\n\n // now we begin to insert op in the list of insertions..\n var o\n var parent\n var start\n\n // find o. o is the first conflicting operation\n if (op.left != null) {\n o = yield* this.getInsertionCleanEnd(op.left)\n if (!Y.utils.compareIds(op.left, op.origin) && o.right != null) {\n // only if not added previously\n tryToRemergeLater.push(o.right)\n }\n o = (o.right == null) ? null : yield* this.getOperation(o.right)\n } else { // left == null\n parent = yield* this.getOperation(op.parent)\n let startId = op.parentSub ? parent.map[op.parentSub] : parent.start\n start = startId == null ? null : yield* this.getOperation(startId)\n o = start\n }\n\n // make sure to split op.right if necessary (also add to tryCombineWithLeft)\n if (op.right != null) {\n tryToRemergeLater.push(op.right)\n yield* this.getInsertionCleanStart(op.right)\n }\n\n // handle conflicts\n while (true) {\n if (o != null && !Y.utils.compareIds(o.id, op.right)) {\n var oOriginDistance = yield* Struct.Insert.getDistanceToOrigin.call(this, o)\n if (oOriginDistance === i) {\n // case 1\n if (o.id[0] < op.id[0]) {\n op.left = Y.utils.getLastId(o)\n distanceToOrigin = i + 1 // just ignore o.content.length, doesn't make a difference\n }\n } else if (oOriginDistance < i) {\n // case 2\n if (i - distanceToOrigin <= oOriginDistance) {\n op.left = Y.utils.getLastId(o)\n distanceToOrigin = i + 1 // just ignore o.content.length, doesn't make a difference\n }\n } else {\n break\n }\n i++\n if (o.right != null) {\n o = yield* this.getInsertion(o.right)\n } else {\n o = null\n }\n } else {\n break\n }\n }\n\n // reconnect..\n var left = null\n var right = null\n if (parent == null) {\n parent = yield* this.getOperation(op.parent)\n }\n\n // reconnect left and set right of op\n if (op.left != null) {\n left = yield* this.getInsertion(op.left)\n // link left\n op.right = left.right\n left.right = op.id\n\n yield* this.setOperation(left)\n } else {\n // set op.right from parent, if necessary\n op.right = op.parentSub ? parent.map[op.parentSub] || null : parent.start\n }\n // reconnect right\n if (op.right != null) {\n // TODO: wanna connect right too?\n right = yield* this.getOperation(op.right)\n right.left = Y.utils.getLastId(op)\n\n // if right exists, and it is supposed to be gc'd. Remove it from the gc\n if (right.gc != null) {\n if (right.content != null && right.content.length > 1) {\n right = yield* this.getInsertionCleanEnd(right.id)\n }\n this.store.removeFromGarbageCollector(right)\n }\n yield* this.setOperation(right)\n }\n\n // update parents .map/start/end properties\n if (op.parentSub != null) {\n if (left == null) {\n parent.map[op.parentSub] = op.id\n yield* this.setOperation(parent)\n }\n // is a child of a map struct.\n // Then also make sure that only the most left element is not deleted\n // We do not call the type in this case (this is what the third parameter is for)\n if (op.right != null) {\n yield* this.deleteOperation(op.right, 1, true)\n }\n if (op.left != null) {\n yield* this.deleteOperation(op.id, 1, true)\n }\n } else {\n if (right == null || left == null) {\n if (right == null) {\n parent.end = Y.utils.getLastId(op)\n }\n if (left == null) {\n parent.start = op.id\n }\n yield* this.setOperation(parent)\n }\n }\n\n // try to merge original op.left and op.origin\n for (let i = 0; i < tryToRemergeLater.length; i++) {\n var m = yield* this.getOperation(tryToRemergeLater[i])\n yield* this.tryCombineWithLeft(m)\n }\n }\n },\n List: {\n /*\n {\n start: null,\n end: null,\n struct: \"List\",\n type: \"\",\n id: this.os.getNextOpId(1)\n }\n */\n create: function (id) {\n return {\n start: null,\n end: null,\n struct: 'List',\n id: id\n }\n },\n encode: function (op) {\n var e = {\n struct: 'List',\n id: op.id,\n type: op.type\n }\n if (op.requires != null) {\n e.requires = op.requires\n }\n if (op.info != null) {\n e.info = op.info\n }\n return e\n },\n requiredOps: function () {\n /*\n var ids = []\n if (op.start != null) {\n ids.push(op.start)\n }\n if (op.end != null){\n ids.push(op.end)\n }\n return ids\n */\n return []\n },\n execute: function * (op) {\n op.start = null\n op.end = null\n },\n ref: function * (op, pos) {\n if (op.start == null) {\n return null\n }\n var res = null\n var o = yield* this.getOperation(op.start)\n\n while (true) {\n if (!o.deleted) {\n res = o\n pos--\n }\n if (pos >= 0 && o.right != null) {\n o = yield* this.getOperation(o.right)\n } else {\n break\n }\n }\n return res\n },\n map: function * (o, f) {\n o = o.start\n var res = []\n while (o != null) { // TODO: change to != (at least some convention)\n var operation = yield* this.getOperation(o)\n if (!operation.deleted) {\n res.push(f(operation))\n }\n o = operation.right\n }\n return res\n }\n },\n Map: {\n /*\n {\n map: {},\n struct: \"Map\",\n type: \"\",\n id: this.os.getNextOpId(1)\n }\n */\n create: function (id) {\n return {\n id: id,\n map: {},\n struct: 'Map'\n }\n },\n encode: function (op) {\n var e = {\n struct: 'Map',\n type: op.type,\n id: op.id,\n map: {} // overwrite map!!\n }\n if (op.requires != null) {\n e.requires = op.requires\n }\n if (op.info != null) {\n e.info = op.info\n }\n return e\n },\n requiredOps: function () {\n return []\n },\n execute: function * () {},\n /*\n Get a property by name\n */\n get: function * (op, name) {\n var oid = op.map[name]\n if (oid != null) {\n var res = yield* this.getOperation(oid)\n if (res == null || res.deleted) {\n return void 0\n } else if (res.opContent == null) {\n return res.content[0]\n } else {\n return yield* this.getType(res.opContent)\n }\n }\n }\n }\n }\n Y.Struct = Struct\n}\n","/* @flow */\n'use strict'\n\n/*\n Partial definition of a transaction\n\n A transaction provides all the the async functionality on a database.\n\n By convention, a transaction has the following properties:\n * ss for StateSet\n * os for OperationStore\n * ds for DeleteStore\n\n A transaction must also define the following methods:\n * checkDeleteStoreForState(state)\n - When increasing the state of a user, an operation with an higher id\n may already be garbage collected, and therefore it will never be received.\n update the state to reflect this knowledge. This won't call a method to save the state!\n * getDeleteSet(id)\n - Get the delete set in a readable format:\n {\n \"userX\": [\n [5,1], // starting from position 5, one operations is deleted\n [9,4] // starting from position 9, four operations are deleted\n ],\n \"userY\": ...\n }\n * getOpsFromDeleteSet(ds) -- TODO: just call this.deleteOperation(id) here\n - get a set of deletions that need to be applied in order to get to\n achieve the state of the supplied ds\n * setOperation(op)\n - write `op` to the database.\n Note: this is allowed to return an in-memory object.\n E.g. the Memory adapter returns the object that it has in-memory.\n Changing values on this object will be stored directly in the database\n without calling this function. Therefore,\n setOperation may have no functionality in some adapters. This also has\n implications on the way we use operations that were served from the database.\n We try not to call copyObject, if not necessary.\n * addOperation(op)\n - add an operation to the database.\n This may only be called once for every op.id\n Must return a function that returns the next operation in the database (ordered by id)\n * getOperation(id)\n * removeOperation(id)\n - remove an operation from the database. This is called when an operation\n is garbage collected.\n * setState(state)\n - `state` is of the form\n {\n user: \"1\",\n clock: 4\n } <- meaning that we have four operations from user \"1\"\n (with these id's respectively: 0, 1, 2, and 3)\n * getState(user)\n * getStateVector()\n - Get the state of the OS in the form\n [{\n user: \"userX\",\n clock: 11\n },\n ..\n ]\n * getStateSet()\n - Get the state of the OS in the form\n {\n \"userX\": 11,\n \"userY\": 22\n }\n * getOperations(startSS)\n - Get the all the operations that are necessary in order to achive the\n stateSet of this user, starting from a stateSet supplied by another user\n * makeOperationReady(ss, op)\n - this is called only by `getOperations(startSS)`. It makes an operation\n applyable on a given SS.\n*/\nmodule.exports = function (Y/* :any */) {\n class TransactionInterface {\n /* ::\n store: Y.AbstractDatabase;\n ds: Store;\n os: Store;\n ss: Store;\n */\n /*\n Get a type based on the id of its model.\n If it does not exist yes, create it.\n TODO: delete type from store.initializedTypes[id] when corresponding id was deleted!\n */\n * getType (id, args) {\n var sid = JSON.stringify(id)\n var t = this.store.initializedTypes[sid]\n if (t == null) {\n var op/* :MapStruct | ListStruct */ = yield* this.getOperation(id)\n if (op != null) {\n t = yield* Y[op.type].typeDefinition.initType.call(this, this.store, op, args)\n this.store.initializedTypes[sid] = t\n }\n }\n return t\n }\n * createType (typedefinition, id) {\n var structname = typedefinition[0].struct\n id = id || this.store.getNextOpId(1)\n var op\n if (id[0] === '_') {\n op = yield* this.getOperation(id)\n } else {\n op = Y.Struct[structname].create(id)\n op.type = typedefinition[0].name\n }\n if (typedefinition[0].appendAdditionalInfo != null) {\n yield* typedefinition[0].appendAdditionalInfo.call(this, op, typedefinition[1])\n }\n if (op[0] === '_') {\n yield* this.setOperation(op)\n } else {\n yield* this.applyCreatedOperations([op])\n }\n return yield* this.getType(id, typedefinition[1])\n }\n /* createType (typedefinition, id) {\n var structname = typedefinition[0].struct\n id = id || this.store.getNextOpId(1)\n var op = Y.Struct[structname].create(id)\n op.type = typedefinition[0].name\n if (typedefinition[0].appendAdditionalInfo != null) {\n yield* typedefinition[0].appendAdditionalInfo.call(this, op, typedefinition[1])\n }\n // yield* this.applyCreatedOperations([op])\n yield* Y.Struct[op.struct].execute.call(this, op)\n yield* this.addOperation(op)\n yield* this.store.operationAdded(this, op)\n return yield* this.getType(id, typedefinition[1])\n }*/\n /*\n Apply operations that this user created (no remote ones!)\n * does not check for Struct.*.requiredOps()\n * also broadcasts it through the connector\n */\n * applyCreatedOperations (ops) {\n var send = []\n for (var i = 0; i < ops.length; i++) {\n var op = ops[i]\n yield* this.store.tryExecute.call(this, op)\n if (op.id == null || typeof op.id[1] !== 'string') {\n send.push(Y.Struct[op.struct].encode(op))\n }\n }\n if (!this.store.y.connector.isDisconnected() && send.length > 0) { // TODO: && !this.store.forwardAppliedOperations (but then i don't send delete ops)\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcastOps(send)\n }\n }\n\n * deleteList (start) {\n while (start != null) {\n start = yield* this.getOperation(start)\n if (!start.gc) {\n start.gc = true\n start.deleted = true\n yield* this.setOperation(start)\n var delLength = start.content != null ? start.content.length : 1\n yield* this.markDeleted(start.id, delLength)\n if (start.opContent != null) {\n yield* this.deleteOperation(start.opContent)\n }\n this.store.queueGarbageCollector(start.id)\n }\n start = start.right\n }\n }\n\n /*\n Mark an operation as deleted, and add it to the GC, if possible.\n */\n * deleteOperation (targetId, length, preventCallType) /* :Generator */ {\n if (length == null) {\n length = 1\n }\n yield* this.markDeleted(targetId, length)\n while (length > 0) {\n var callType = false\n var target = yield* this.os.findWithUpperBound([targetId[0], targetId[1] + length - 1])\n var targetLength = target != null && target.content != null ? target.content.length : 1\n if (target == null || target.id[0] !== targetId[0] || target.id[1] + targetLength <= targetId[1]) {\n // does not exist or is not in the range of the deletion\n target = null\n length = 0\n } else {\n // does exist, check if it is too long\n if (!target.deleted) {\n if (target.id[1] < targetId[1]) {\n // starts to the left of the deletion range\n target = yield* this.getInsertionCleanStart(targetId)\n targetLength = target.content.length // must have content property!\n }\n if (target.id[1] + targetLength > targetId[1] + length) {\n // ends to the right of the deletion range\n target = yield* this.getInsertionCleanEnd([targetId[0], targetId[1] + length - 1])\n targetLength = target.content.length\n }\n }\n length = target.id[1] - targetId[1]\n }\n\n if (target != null) {\n if (!target.deleted) {\n callType = true\n // set deleted & notify type\n target.deleted = true\n // delete containing lists\n if (target.start != null) {\n // TODO: don't do it like this .. -.-\n yield* this.deleteList(target.start)\n // yield* this.deleteList(target.id) -- do not gc itself because this may still get referenced\n }\n if (target.map != null) {\n for (var name in target.map) {\n yield* this.deleteList(target.map[name])\n }\n // TODO: here to.. (see above)\n // yield* this.deleteList(target.id) -- see above\n }\n if (target.opContent != null) {\n yield* this.deleteOperation(target.opContent)\n // target.opContent = null\n }\n if (target.requires != null) {\n for (var i = 0; i < target.requires.length; i++) {\n yield* this.deleteOperation(target.requires[i])\n }\n }\n }\n var left\n if (target.left != null) {\n left = yield* this.getInsertion(target.left)\n } else {\n left = null\n }\n\n // set here because it was deleted and/or gc'd\n yield* this.setOperation(target)\n\n /*\n Check if it is possible to add right to the gc.\n Because this delete can't be responsible for left being gc'd,\n we don't have to add left to the gc..\n */\n var right\n if (target.right != null) {\n right = yield* this.getOperation(target.right)\n } else {\n right = null\n }\n if (callType && !preventCallType) {\n yield* this.store.operationAdded(this, {\n struct: 'Delete',\n target: target.id,\n length: targetLength\n })\n }\n // need to gc in the end!\n yield* this.store.addToGarbageCollector.call(this, target, left)\n if (right != null) {\n yield* this.store.addToGarbageCollector.call(this, right, target)\n }\n }\n }\n }\n /*\n Mark an operation as deleted&gc'd\n */\n * markGarbageCollected (id, len) {\n // this.mem.push([\"gc\", id]);\n this.store.addToDebug('yield* this.markGarbageCollected(', id, ', ', len, ')')\n var n = yield* this.markDeleted(id, len)\n if (n.id[1] < id[1] && !n.gc) {\n // un-extend left\n var newlen = n.len - (id[1] - n.id[1])\n n.len -= newlen\n yield* this.ds.put(n)\n n = {id: id, len: newlen, gc: false}\n yield* this.ds.put(n)\n }\n // get prev&next before adding a new operation\n var prev = yield* this.ds.findPrev(id)\n var next = yield* this.ds.findNext(id)\n\n if (id[1] + len < n.id[1] + n.len && !n.gc) {\n // un-extend right\n yield* this.ds.put({id: [id[0], id[1] + len], len: n.len - len, gc: false})\n n.len = len\n }\n // set gc'd\n n.gc = true\n // can extend left?\n if (\n prev != null &&\n prev.gc &&\n Y.utils.compareIds([prev.id[0], prev.id[1] + prev.len], n.id)\n ) {\n prev.len += n.len\n yield* this.ds.delete(n.id)\n n = prev\n // ds.put n here?\n }\n // can extend right?\n if (\n next != null &&\n next.gc &&\n Y.utils.compareIds([n.id[0], n.id[1] + n.len], next.id)\n ) {\n n.len += next.len\n yield* this.ds.delete(next.id)\n }\n yield* this.ds.put(n)\n yield* this.updateState(n.id[0])\n }\n /*\n Mark an operation as deleted.\n\n returns the delete node\n */\n * markDeleted (id, length) {\n if (length == null) {\n length = 1\n }\n // this.mem.push([\"del\", id]);\n var n = yield* this.ds.findWithUpperBound(id)\n if (n != null && n.id[0] === id[0]) {\n if (n.id[1] <= id[1] && id[1] <= n.id[1] + n.len) {\n // id is in n's range\n var diff = id[1] + length - (n.id[1] + n.len) // overlapping right\n if (diff > 0) {\n // id+length overlaps n\n if (!n.gc) {\n n.len += diff\n } else {\n diff = n.id[1] + n.len - id[1] // overlapping left (id till n.end)\n if (diff < length) {\n // a partial deletion\n n = {id: [id[0], id[1] + diff], len: length - diff, gc: false}\n yield* this.ds.put(n)\n } else {\n // already gc'd\n throw new Error('Cannot happen! (it dit though.. :()')\n // return n\n }\n }\n } else {\n // no overlapping, already deleted\n return n\n }\n } else {\n // cannot extend left (there is no left!)\n n = {id: id, len: length, gc: false}\n yield* this.ds.put(n) // TODO: you double-put !!\n }\n } else {\n // cannot extend left\n n = {id: id, len: length, gc: false}\n yield* this.ds.put(n)\n }\n // can extend right?\n var next = yield* this.ds.findNext(n.id)\n if (\n next != null &&\n n.id[0] === next.id[0] &&\n n.id[1] + n.len >= next.id[1]\n ) {\n diff = n.id[1] + n.len - next.id[1] // from next.start to n.end\n while (diff >= 0) {\n // n overlaps with next\n if (next.gc) {\n // gc is stronger, so reduce length of n\n n.len -= diff\n if (diff >= next.len) {\n // delete the missing range after next\n diff = diff - next.len // missing range after next\n if (diff > 0) {\n yield* this.ds.put(n) // unneccessary? TODO!\n yield* this.markDeleted([next.id[0], next.id[1] + next.len], diff)\n }\n }\n break\n } else {\n // we can extend n with next\n if (diff > next.len) {\n // n is even longer than next\n // get next.next, and try to extend it\n var _next = yield* this.ds.findNext(next.id)\n yield* this.ds.delete(next.id)\n if (_next == null || n.id[0] !== _next.id[0]) {\n break\n } else {\n next = _next\n diff = n.id[1] + n.len - next.id[1] // from next.start to n.end\n // continue!\n }\n } else {\n // n just partially overlaps with next. extend n, delete next, and break this loop\n n.len += next.len - diff\n yield* this.ds.delete(next.id)\n break\n }\n }\n }\n }\n yield* this.ds.put(n)\n return n\n }\n /*\n Call this method when the client is connected&synced with the\n other clients (e.g. master). This will query the database for\n operations that can be gc'd and add them to the garbage collector.\n */\n * garbageCollectAfterSync () {\n if (this.store.gc1.length > 0 || this.store.gc2.length > 0) {\n console.warn('gc should be empty after sync')\n }\n yield* this.os.iterate(this, null, null, function * (op) {\n if (op.gc) {\n delete op.gc\n yield* this.setOperation(op)\n }\n if (op.parent != null) {\n var parentDeleted = yield* this.isDeleted(op.parent)\n if (parentDeleted) {\n op.gc = true\n if (!op.deleted) {\n yield* this.markDeleted(op.id, op.content != null ? op.content.length : 1)\n op.deleted = true\n if (op.opContent != null) {\n yield* this.deleteOperation(op.opContent)\n }\n if (op.requires != null) {\n for (var i = 0; i < op.requires.length; i++) {\n yield* this.deleteOperation(op.requires[i])\n }\n }\n }\n yield* this.setOperation(op)\n this.store.gc1.push(op.id) // this is ok becaues its shortly before sync (otherwise use queueGarbageCollector!)\n return\n }\n }\n if (op.deleted) {\n var left = null\n if (op.left != null) {\n left = yield* this.getInsertion(op.left)\n }\n yield* this.store.addToGarbageCollector.call(this, op, left)\n }\n })\n }\n /*\n Really remove an op and all its effects.\n The complicated case here is the Insert operation:\n * reset left\n * reset right\n * reset parent.start\n * reset parent.end\n * reset origins of all right ops\n */\n * garbageCollectOperation (id) {\n this.store.addToDebug('yield* this.garbageCollectOperation(', id, ')')\n var o = yield* this.getOperation(id)\n yield* this.markGarbageCollected(id, (o != null && o.content != null) ? o.content.length : 1) // always mark gc'd\n // if op exists, then clean that mess up..\n if (o != null) {\n var deps = []\n if (o.opContent != null) {\n deps.push(o.opContent)\n }\n if (o.requires != null) {\n deps = deps.concat(o.requires)\n }\n for (var i = 0; i < deps.length; i++) {\n var dep = yield* this.getOperation(deps[i])\n if (dep != null) {\n if (!dep.deleted) {\n yield* this.deleteOperation(dep.id)\n dep = yield* this.getOperation(dep.id)\n }\n dep.gc = true\n yield* this.setOperation(dep)\n this.store.queueGarbageCollector(dep.id)\n } else {\n yield* this.markGarbageCollected(deps[i], 1)\n }\n }\n\n // remove gc'd op from the left op, if it exists\n if (o.left != null) {\n var left = yield* this.getInsertion(o.left)\n left.right = o.right\n yield* this.setOperation(left)\n }\n // remove gc'd op from the right op, if it exists\n // also reset origins of right ops\n if (o.right != null) {\n var right = yield* this.getOperation(o.right)\n right.left = o.left\n\n if (o.originOf != null && o.originOf.length > 0) {\n // find new origin of right ops\n // origin is the first left deleted operation\n var neworigin = o.left\n var neworigin_ = null\n while (neworigin != null) {\n neworigin_ = yield* this.getInsertion(neworigin)\n if (neworigin_.deleted) {\n break\n }\n neworigin = neworigin_.left\n }\n\n // reset origin of all right ops (except first right - duh!),\n\n /* ** The following code does not rely on the the originOf property **\n I recently added originOf to all Insert Operations (see Struct.Insert.execute),\n which saves which operations originate in a Insert operation.\n Garbage collecting without originOf is more memory efficient, but is nearly impossible for large texts, or lists!\n But I keep this code for now\n ```\n // reset origin of right\n right.origin = neworigin\n // search until you find origin pointer to the left of o\n if (right.right != null) {\n var i = yield* this.getOperation(right.right)\n var ids = [o.id, o.right]\n while (ids.some(function (id) {\n return Y.utils.compareIds(id, i.origin)\n })) {\n if (Y.utils.compareIds(i.origin, o.id)) {\n // reset origin of i\n i.origin = neworigin\n yield* this.setOperation(i)\n }\n // get next i\n if (i.right == null) {\n break\n } else {\n ids.push(i.id)\n i = yield* this.getOperation(i.right)\n }\n }\n }\n ```\n */\n // ** Now the new implementation starts **\n // reset neworigin of all originOf[*]\n for (var _i in o.originOf) {\n var originsIn = yield* this.getOperation(o.originOf[_i])\n if (originsIn != null) {\n originsIn.origin = neworigin\n yield* this.setOperation(originsIn)\n }\n }\n if (neworigin != null) {\n if (neworigin_.originOf == null) {\n neworigin_.originOf = o.originOf\n } else {\n neworigin_.originOf = o.originOf.concat(neworigin_.originOf)\n }\n yield* this.setOperation(neworigin_)\n }\n // we don't need to set right here, because\n // right should be in o.originOf => it is set it the previous for loop\n } else {\n // we didn't need to reset the origin of right\n // so we have to set right here\n yield* this.setOperation(right)\n }\n }\n // o may originate in another operation.\n // Since o is deleted, we have to reset o.origin's `originOf` property\n if (o.origin != null) {\n var origin = yield* this.getInsertion(o.origin)\n origin.originOf = origin.originOf.filter(function (_id) {\n return !Y.utils.compareIds(id, _id)\n })\n yield* this.setOperation(origin)\n }\n var parent\n if (o.parent != null) {\n parent = yield* this.getOperation(o.parent)\n }\n // remove gc'd op from parent, if it exists\n if (parent != null) {\n var setParent = false // whether to save parent to the os\n if (o.parentSub != null) {\n if (Y.utils.compareIds(parent.map[o.parentSub], o.id)) {\n setParent = true\n if (o.right != null) {\n parent.map[o.parentSub] = o.right\n } else {\n delete parent.map[o.parentSub]\n }\n }\n } else {\n if (Y.utils.compareIds(parent.start, o.id)) {\n // gc'd op is the start\n setParent = true\n parent.start = o.right\n }\n if (Y.utils.matchesId(o, parent.end)) {\n // gc'd op is the end\n setParent = true\n parent.end = o.left\n }\n }\n if (setParent) {\n yield* this.setOperation(parent)\n }\n }\n // finally remove it from the os\n yield* this.removeOperation(o.id)\n }\n }\n * checkDeleteStoreForState (state) {\n var n = yield* this.ds.findWithUpperBound([state.user, state.clock])\n if (n != null && n.id[0] === state.user && n.gc) {\n state.clock = Math.max(state.clock, n.id[1] + n.len)\n }\n }\n * updateState (user) {\n var state = yield* this.getState(user)\n yield* this.checkDeleteStoreForState(state)\n var o = yield* this.getInsertion([user, state.clock])\n var oLength = (o != null && o.content != null) ? o.content.length : 1\n while (o != null && user === o.id[0] && o.id[1] <= state.clock && o.id[1] + oLength > state.clock) {\n // either its a new operation (1. case), or it is an operation that was deleted, but is not yet in the OS\n state.clock += oLength\n yield* this.checkDeleteStoreForState(state)\n o = yield* this.os.findNext(o.id)\n oLength = (o != null && o.content != null) ? o.content.length : 1\n }\n yield* this.setState(state)\n }\n /*\n apply a delete set in order to get\n the state of the supplied ds\n */\n * applyDeleteSet (ds) {\n var deletions = []\n\n for (var user in ds) {\n var dv = ds[user]\n var pos = 0\n var d = dv[pos]\n yield* this.ds.iterate(this, [user, 0], [user, Number.MAX_VALUE], function * (n) {\n // cases:\n // 1. d deletes something to the right of n\n // => go to next n (break)\n // 2. d deletes something to the left of n\n // => create deletions\n // => reset d accordingly\n // *)=> if d doesn't delete anything anymore, go to next d (continue)\n // 3. not 2) and d deletes something that also n deletes\n // => reset d so that it doesn't contain n's deletion\n // *)=> if d does not delete anything anymore, go to next d (continue)\n while (d != null) {\n var diff = 0 // describe the diff of length in 1) and 2)\n if (n.id[1] + n.len <= d[0]) {\n // 1)\n break\n } else if (d[0] < n.id[1]) {\n // 2)\n // delete maximum the len of d\n // else delete as much as possible\n diff = Math.min(n.id[1] - d[0], d[1])\n deletions.push([user, d[0], diff, d[2]])\n } else {\n // 3)\n diff = n.id[1] + n.len - d[0] // never null (see 1)\n if (d[2] && !n.gc) {\n // d marks as gc'd but n does not\n // then delete either way\n deletions.push([user, d[0], Math.min(diff, d[1]), d[2]])\n }\n }\n if (d[1] <= diff) {\n // d doesn't delete anything anymore\n d = dv[++pos]\n } else {\n d[0] = d[0] + diff // reset pos\n d[1] = d[1] - diff // reset length\n }\n }\n })\n // for the rest.. just apply it\n for (; pos < dv.length; pos++) {\n d = dv[pos]\n deletions.push([user, d[0], d[1], d[2]])\n }\n }\n for (var i = 0; i < deletions.length; i++) {\n var del = deletions[i]\n // always try to delete..\n yield* this.deleteOperation([del[0], del[1]], del[2])\n if (del[3]) {\n // gc..\n yield* this.markGarbageCollected([del[0], del[1]], del[2]) // always mark gc'd\n // remove operation..\n var counter = del[1] + del[2]\n while (counter >= del[1]) {\n var o = yield* this.os.findWithUpperBound([del[0], counter - 1])\n if (o == null) {\n break\n }\n var oLen = o.content != null ? o.content.length : 1\n if (o.id[0] !== del[0] || o.id[1] + oLen <= del[1]) {\n // not in range\n break\n }\n if (o.id[1] + oLen > del[1] + del[2]) {\n // overlaps right\n o = yield* this.getInsertionCleanEnd([del[0], del[1] + del[2] - 1])\n }\n if (o.id[1] < del[1]) {\n // overlaps left\n o = yield* this.getInsertionCleanStart([del[0], del[1]])\n }\n counter = o.id[1]\n yield* this.garbageCollectOperation(o.id)\n }\n }\n if (this.store.forwardAppliedOperations) {\n var ops = []\n ops.push({struct: 'Delete', target: [d[0], d[1]], length: del[2]})\n this.store.y.connector.broadcastOps(ops)\n }\n }\n }\n * isGarbageCollected (id) {\n var n = yield* this.ds.findWithUpperBound(id)\n return n != null && n.id[0] === id[0] && id[1] < n.id[1] + n.len && n.gc\n }\n /*\n A DeleteSet (ds) describes all the deleted ops in the OS\n */\n * getDeleteSet () {\n var ds = {}\n yield* this.ds.iterate(this, null, null, function * (n) {\n var user = n.id[0]\n var counter = n.id[1]\n var len = n.len\n var gc = n.gc\n var dv = ds[user]\n if (dv === void 0) {\n dv = []\n ds[user] = dv\n }\n dv.push([counter, len, gc])\n })\n return ds\n }\n * isDeleted (id) {\n var n = yield* this.ds.findWithUpperBound(id)\n return n != null && n.id[0] === id[0] && id[1] < n.id[1] + n.len\n }\n * setOperation (op) {\n yield* this.os.put(op)\n return op\n }\n * addOperation (op) {\n yield* this.os.put(op)\n if (!this.store.y.connector.isDisconnected() && this.store.forwardAppliedOperations && typeof op.id[1] !== 'string') {\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcastOps([op])\n }\n }\n // if insertion, try to combine with left insertion (if both have content property)\n * tryCombineWithLeft (op) {\n if (\n op != null &&\n op.left != null &&\n op.content != null &&\n op.left[0] === op.id[0] &&\n Y.utils.compareIds(op.left, op.origin)\n ) {\n var left = yield* this.getInsertion(op.left)\n if (left.content != null &&\n left.id[1] + left.content.length === op.id[1] &&\n left.originOf.length === 1 &&\n !left.gc && !left.deleted &&\n !op.gc && !op.deleted\n ) {\n // combine!\n if (op.originOf != null) {\n left.originOf = op.originOf\n } else {\n delete left.originOf\n }\n left.content = left.content.concat(op.content)\n left.right = op.right\n yield* this.os.delete(op.id)\n yield* this.setOperation(left)\n }\n }\n }\n * getInsertion (id) {\n var ins = yield* this.os.findWithUpperBound(id)\n if (ins == null) {\n return null\n } else {\n var len = ins.content != null ? ins.content.length : 1 // in case of opContent\n if (id[0] === ins.id[0] && id[1] < ins.id[1] + len) {\n return ins\n } else {\n return null\n }\n }\n }\n * getInsertionCleanStartEnd (id) {\n yield* this.getInsertionCleanStart(id)\n return yield* this.getInsertionCleanEnd(id)\n }\n // Return an insertion such that id is the first element of content\n // This function manipulates an operation, if necessary\n * getInsertionCleanStart (id) {\n var ins = yield* this.getInsertion(id)\n if (ins != null) {\n if (ins.id[1] === id[1]) {\n return ins\n } else {\n var left = Y.utils.copyObject(ins)\n ins.content = left.content.splice(id[1] - ins.id[1])\n ins.id = id\n var leftLid = Y.utils.getLastId(left)\n ins.origin = leftLid\n left.originOf = [ins.id]\n left.right = ins.id\n ins.left = leftLid\n // debugger // check\n yield* this.setOperation(left)\n yield* this.setOperation(ins)\n if (left.gc) {\n this.store.queueGarbageCollector(ins.id)\n }\n return ins\n }\n } else {\n return null\n }\n }\n // Return an insertion such that id is the last element of content\n // This function manipulates an operation, if necessary\n * getInsertionCleanEnd (id) {\n var ins = yield* this.getInsertion(id)\n if (ins != null) {\n if (ins.content == null || (ins.id[1] + ins.content.length - 1 === id[1])) {\n return ins\n } else {\n var right = Y.utils.copyObject(ins)\n right.content = ins.content.splice(id[1] - ins.id[1] + 1) // cut off remainder\n right.id = [id[0], id[1] + 1]\n var insLid = Y.utils.getLastId(ins)\n right.origin = insLid\n ins.originOf = [right.id]\n ins.right = right.id\n right.left = insLid\n // debugger // check\n yield* this.setOperation(right)\n yield* this.setOperation(ins)\n if (ins.gc) {\n this.store.queueGarbageCollector(right.id)\n }\n return ins\n }\n } else {\n return null\n }\n }\n * getOperation (id/* :any */)/* :Transaction */ {\n var o = yield* this.os.find(id)\n if (id[0] !== '_' || o != null) {\n return o\n } else { // type is string\n // generate this operation?\n var comp = id[1].split('_')\n if (comp.length > 1) {\n var struct = comp[0]\n var op = Y.Struct[struct].create(id)\n op.type = comp[1]\n yield* this.setOperation(op)\n return op\n } else {\n // won't be called. but just in case..\n console.error('Unexpected case. How can this happen?')\n debugger // eslint-disable-line\n return null\n }\n }\n }\n * removeOperation (id) {\n yield* this.os.delete(id)\n }\n * setState (state) {\n var val = {\n id: [state.user],\n clock: state.clock\n }\n yield* this.ss.put(val)\n }\n * getState (user) {\n var n = yield* this.ss.find([user])\n var clock = n == null ? null : n.clock\n if (clock == null) {\n clock = 0\n }\n return {\n user: user,\n clock: clock\n }\n }\n * getStateVector () {\n var stateVector = []\n yield* this.ss.iterate(this, null, null, function * (n) {\n stateVector.push({\n user: n.id[0],\n clock: n.clock\n })\n })\n return stateVector\n }\n * getStateSet () {\n var ss = {}\n yield* this.ss.iterate(this, null, null, function * (n) {\n ss[n.id[0]] = n.clock\n })\n return ss\n }\n /*\n Here, we make all missing operations executable for the receiving user.\n\n Notes:\n startSS: denotes to the SV that the remote user sent\n currSS: denotes to the state vector that the user should have if he\n applies all already sent operations (increases is each step)\n\n We face several problems:\n * Execute op as is won't work because ops depend on each other\n -> find a way so that they do not anymore\n * When changing left, must not go more to the left than the origin\n * When changing right, you have to consider that other ops may have op\n as their origin, this means that you must not set one of these ops\n as the new right (interdependencies of ops)\n * can't just go to the right until you find the first known operation,\n With currSS\n -> interdependency of ops is a problem\n With startSS\n -> leads to inconsistencies when two users join at the same time.\n Then the position depends on the order of execution -> error!\n\n Solution:\n -> re-create originial situation\n -> set op.left = op.origin (which never changes)\n -> set op.right\n to the first operation that is known (according to startSS)\n or to the first operation that has an origin that is not to the\n right of op.\n -> Enforces unique execution order -> happy user\n\n Improvements: TODO\n * Could set left to origin, or the first known operation\n (startSS or currSS.. ?)\n -> Could be necessary when I turn GC again.\n -> Is a bad(ish) idea because it requires more computation\n\n What we do:\n * Iterate over all missing operations.\n * When there is an operation, where the right op is known, send this op all missing ops to the left to the user\n * I explained above what we have to do with each operation. Here is how we do it efficiently:\n 1. Go to the left until you find either op.origin, or a known operation (let o denote current operation in the iteration)\n 2. Found a known operation -> set op.left = o, and send it to the user. stop\n 3. Found o = op.origin -> set op.left = op.origin, and send it to the user. start again from 1. (set op = o)\n 4. Found some o -> set o.right = op, o.left = o.origin, send it to the user, continue\n */\n * getOperations (startSS) {\n // TODO: use bounds here!\n if (startSS == null) {\n startSS = {}\n }\n var send = []\n\n var endSV = yield* this.getStateVector()\n for (var endState of endSV) {\n var user = endState.user\n if (user === '_') {\n continue\n }\n var startPos = startSS[user] || 0\n if (startPos > 0) {\n // There is a change that [user, startPos] is in a composed Insertion (with a smaller counter)\n // find out if that is the case\n var firstMissing = yield* this.getInsertion([user, startPos])\n if (firstMissing != null) {\n // update startPos\n startPos = firstMissing.id[1]\n }\n }\n yield* this.os.iterate(this, [user, startPos], [user, Number.MAX_VALUE], function * (op) {\n op = Y.Struct[op.struct].encode(op)\n if (op.struct !== 'Insert') {\n send.push(op)\n } else if (op.right == null || op.right[1] < (startSS[op.right[0]] || 0)) {\n // case 1. op.right is known\n var o = op\n // Remember: ?\n // -> set op.right\n // 1. to the first operation that is known (according to startSS)\n // 2. or to the first operation that has an origin that is not to the\n // right of op.\n // For this we maintain a list of ops which origins are not found yet.\n var missing_origins = [op]\n var newright = op.right\n while (true) {\n if (o.left == null) {\n op.left = null\n send.push(op)\n if (!Y.utils.compareIds(o.id, op.id)) {\n o = Y.Struct[op.struct].encode(o)\n o.right = missing_origins[missing_origins.length - 1].id\n send.push(o)\n }\n break\n }\n o = yield* this.getInsertion(o.left)\n // we set another o, check if we can reduce $missing_origins\n while (missing_origins.length > 0 && Y.utils.matchesId(o, missing_origins[missing_origins.length - 1].origin)) {\n missing_origins.pop()\n }\n if (o.id[1] < (startSS[o.id[0]] || 0)) {\n // case 2. o is known\n op.left = Y.utils.getLastId(o)\n send.push(op)\n break\n } else if (Y.utils.matchesId(o, op.origin)) {\n // case 3. o is op.origin\n op.left = op.origin\n send.push(op)\n op = Y.Struct[op.struct].encode(o)\n op.right = newright\n if (missing_origins.length > 0) {\n console.log('This should not happen .. :( please report this')\n }\n missing_origins = [op]\n } else {\n // case 4. send o, continue to find op.origin\n var s = Y.Struct[op.struct].encode(o)\n s.right = missing_origins[missing_origins.length - 1].id\n s.left = s.origin\n send.push(s)\n missing_origins.push(o)\n }\n }\n }\n })\n }\n return send.reverse()\n }\n /* this is what we used before.. use this as a reference..\n * makeOperationReady (startSS, op) {\n op = Y.Struct[op.struct].encode(op)\n op = Y.utils.copyObject(op) -- use copyoperation instead now!\n var o = op\n var ids = [op.id]\n // search for the new op.right\n // it is either the first known op (according to startSS)\n // or the o that has no origin to the right of op\n // (this is why we use the ids array)\n while (o.right != null) {\n var right = yield* this.getOperation(o.right)\n if (o.right[1] < (startSS[o.right[0]] || 0) || !ids.some(function (id) {\n return Y.utils.compareIds(id, right.origin)\n })) {\n break\n }\n ids.push(o.right)\n o = right\n }\n op.right = o.right\n op.left = op.origin\n return op\n }\n */\n * flush () {\n yield* this.os.flush()\n yield* this.ss.flush()\n yield* this.ds.flush()\n }\n }\n Y.Transaction = TransactionInterface\n}\n","/* @flow */\n'use strict'\n\n/*\n EventHandler is an helper class for constructing custom types.\n\n Why: When constructing custom types, you sometimes want your types to work\n synchronous: E.g.\n ``` Synchronous\n mytype.setSomething(\"yay\")\n mytype.getSomething() === \"yay\"\n ```\n versus\n ``` Asynchronous\n mytype.setSomething(\"yay\")\n mytype.getSomething() === undefined\n mytype.waitForSomething().then(function(){\n mytype.getSomething() === \"yay\"\n })\n ```\n\n The structures usually work asynchronously (you have to wait for the\n database request to finish). EventHandler helps you to make your type\n synchronous.\n*/\nmodule.exports = function (Y /* : any*/) {\n Y.utils = {}\n\n class EventListenerHandler {\n constructor () {\n this.eventListeners = []\n }\n destroy () {\n this.eventListeners = null\n }\n /*\n Basic event listener boilerplate...\n */\n addEventListener (f) {\n this.eventListeners.push(f)\n }\n removeEventListener (f) {\n this.eventListeners = this.eventListeners.filter(function (g) {\n return f !== g\n })\n }\n removeAllEventListeners () {\n this.eventListeners = []\n }\n callEventListeners (event) {\n for (var i = 0; i < this.eventListeners.length; i++) {\n try {\n this.eventListeners[i](event)\n } catch (e) {\n console.error('User events must not throw Errors!')\n }\n }\n }\n }\n Y.utils.EventListenerHandler = EventListenerHandler\n\n class EventHandler extends EventListenerHandler {\n /* ::\n waiting: Array;\n awaiting: number;\n onevent: Function;\n eventListeners: Array;\n */\n /*\n onevent: is called when the structure changes.\n\n Note: \"awaiting opertations\" is used to denote operations that were\n prematurely called. Events for received operations can not be executed until\n all prematurely called operations were executed (\"waiting operations\")\n */\n constructor (onevent /* : Function */) {\n super()\n this.waiting = []\n this.awaiting = 0\n this.onevent = onevent\n }\n destroy () {\n super.destroy()\n this.waiting = null\n this.awaiting = null\n this.onevent = null\n }\n /*\n Call this when a new operation arrives. It will be executed right away if\n there are no waiting operations, that you prematurely executed\n */\n receivedOp (op) {\n if (this.awaiting <= 0) {\n this.onevent(op)\n } else {\n this.waiting.push(op)\n }\n }\n /*\n You created some operations, and you want the `onevent` function to be\n called right away. Received operations will not be executed untill all\n prematurely called operations are executed\n */\n awaitAndPrematurelyCall (ops) {\n this.awaiting++\n ops.map(Y.utils.copyOperation).forEach(this.onevent)\n }\n * awaitOps (transaction, f, args) {\n function notSoSmartSort (array) {\n // this function sorts insertions in a executable order\n var result = []\n while (array.length > 0) {\n for (var i = 0; i < array.length; i++) {\n var independent = true\n for (var j = 0; j < array.length; j++) {\n if (Y.utils.matchesId(array[j], array[i].left)) {\n // array[i] depends on array[j]\n independent = false\n break\n }\n }\n if (independent) {\n result.push(array.splice(i, 1)[0])\n i--\n }\n }\n }\n return result\n }\n var before = this.waiting.length\n // somehow create new operations\n yield* f.apply(transaction, args)\n // remove all appended ops / awaited ops\n this.waiting.splice(before)\n if (this.awaiting > 0) this.awaiting--\n // if there are no awaited ops anymore, we can update all waiting ops, and send execute them (if there are still no awaited ops)\n if (this.awaiting === 0 && this.waiting.length > 0) {\n // update all waiting ops\n for (let i = 0; i < this.waiting.length; i++) {\n var o = this.waiting[i]\n if (o.struct === 'Insert') {\n var _o = yield* transaction.getInsertion(o.id)\n if (!Y.utils.compareIds(_o.id, o.id)) {\n // o got extended\n o.left = [o.id[0], o.id[1] - 1]\n } else if (_o.left == null) {\n o.left = null\n } else {\n // find next undeleted op\n var left = yield* transaction.getInsertion(_o.left)\n while (left.deleted != null) {\n if (left.left != null) {\n left = yield* transaction.getInsertion(left.left)\n } else {\n left = null\n break\n }\n }\n o.left = left != null ? Y.utils.getLastId(left) : null\n }\n }\n }\n // the previous stuff was async, so we have to check again!\n // We also pull changes from the bindings, if there exists such a method, this could increase awaiting too\n if (this._pullChanges != null) {\n this._pullChanges()\n }\n if (this.awaiting === 0) {\n // sort by type, execute inserts first\n var ins = []\n var dels = []\n this.waiting.forEach(function (o) {\n if (o.struct === 'Delete') {\n dels.push(o)\n } else {\n ins.push(o)\n }\n })\n // put in executable order\n ins = notSoSmartSort(ins)\n ins.forEach(this.onevent)\n dels.forEach(this.onevent)\n this.waiting = []\n }\n }\n }\n // TODO: Remove awaitedInserts and awaitedDeletes in favor of awaitedOps, as they are deprecated and do not always work\n // Do this in one of the coming releases that are breaking anyway\n /*\n Call this when you successfully awaited the execution of n Insert operations\n */\n awaitedInserts (n) {\n var ops = this.waiting.splice(this.waiting.length - n)\n for (var oid = 0; oid < ops.length; oid++) {\n var op = ops[oid]\n if (op.struct === 'Insert') {\n for (var i = this.waiting.length - 1; i >= 0; i--) {\n let w = this.waiting[i]\n // TODO: do I handle split operations correctly here? Super unlikely, but yeah..\n // Also: can this case happen? Can op be inserted in the middle of a larger op that is in $waiting?\n if (w.struct === 'Insert') {\n if (Y.utils.matchesId(w, op.left)) {\n // include the effect of op in w\n w.right = op.id\n // exclude the effect of w in op\n op.left = w.left\n } else if (Y.utils.compareIds(w.id, op.right)) {\n // similar..\n w.left = Y.utils.getLastId(op)\n op.right = w.right\n }\n }\n }\n } else {\n throw new Error('Expected Insert Operation!')\n }\n }\n this._tryCallEvents(n)\n }\n /*\n Call this when you successfully awaited the execution of n Delete operations\n */\n awaitedDeletes (n, newLeft) {\n var ops = this.waiting.splice(this.waiting.length - n)\n for (var j = 0; j < ops.length; j++) {\n var del = ops[j]\n if (del.struct === 'Delete') {\n if (newLeft != null) {\n for (var i = 0; i < this.waiting.length; i++) {\n let w = this.waiting[i]\n // We will just care about w.left\n if (w.struct === 'Insert' && Y.utils.compareIds(del.target, w.left)) {\n w.left = newLeft\n }\n }\n }\n } else {\n throw new Error('Expected Delete Operation!')\n }\n }\n this._tryCallEvents(n)\n }\n /* (private)\n Try to execute the events for the waiting operations\n */\n _tryCallEvents () {\n function notSoSmartSort (array) {\n var result = []\n while (array.length > 0) {\n for (var i = 0; i < array.length; i++) {\n var independent = true\n for (var j = 0; j < array.length; j++) {\n if (Y.utils.matchesId(array[j], array[i].left)) {\n // array[i] depends on array[j]\n independent = false\n break\n }\n }\n if (independent) {\n result.push(array.splice(i, 1)[0])\n i--\n }\n }\n }\n return result\n }\n if (this.awaiting > 0) this.awaiting--\n if (this.awaiting === 0 && this.waiting.length > 0) {\n var ins = []\n var dels = []\n this.waiting.forEach(function (o) {\n if (o.struct === 'Delete') {\n dels.push(o)\n } else {\n ins.push(o)\n }\n })\n ins = notSoSmartSort(ins)\n ins.forEach(this.onevent)\n dels.forEach(this.onevent)\n this.waiting = []\n }\n }\n }\n Y.utils.EventHandler = EventHandler\n\n /*\n A wrapper for the definition of a custom type.\n Every custom type must have three properties:\n\n * struct\n - Structname of this type\n * initType\n - Given a model, creates a custom type\n * class\n - the constructor of the custom type (e.g. in order to inherit from a type)\n */\n class CustomType { // eslint-disable-line\n /* ::\n struct: any;\n initType: any;\n class: Function;\n name: String;\n */\n constructor (def) {\n if (def.struct == null ||\n def.initType == null ||\n def.class == null ||\n def.name == null\n ) {\n throw new Error('Custom type was not initialized correctly!')\n }\n this.struct = def.struct\n this.initType = def.initType\n this.class = def.class\n this.name = def.name\n if (def.appendAdditionalInfo != null) {\n this.appendAdditionalInfo = def.appendAdditionalInfo\n }\n this.parseArguments = (def.parseArguments || function () {\n return [this]\n }).bind(this)\n this.parseArguments.typeDefinition = this\n }\n }\n Y.utils.CustomType = CustomType\n\n Y.utils.isTypeDefinition = function isTypeDefinition (v) {\n if (v != null) {\n if (v instanceof Y.utils.CustomType) return [v]\n else if (v.constructor === Array && v[0] instanceof Y.utils.CustomType) return v\n else if (v instanceof Function && v.typeDefinition instanceof Y.utils.CustomType) return [v.typeDefinition]\n }\n return false\n }\n\n /*\n Make a flat copy of an object\n (just copy properties)\n */\n function copyObject (o) {\n var c = {}\n for (var key in o) {\n c[key] = o[key]\n }\n return c\n }\n Y.utils.copyObject = copyObject\n\n /*\n Copy an operation, so that it can be manipulated.\n Note: You must not change subproperties (except o.content)!\n */\n function copyOperation (o) {\n o = copyObject(o)\n if (o.content != null) {\n o.content = o.content.map(function (c) { return c })\n }\n return o\n }\n\n Y.utils.copyOperation = copyOperation\n\n /*\n Defines a smaller relation on Id's\n */\n function smaller (a, b) {\n return a[0] < b[0] || (a[0] === b[0] && (a[1] < b[1] || typeof a[1] < typeof b[1]))\n }\n Y.utils.smaller = smaller\n\n function inDeletionRange (del, ins) {\n return del.target[0] === ins[0] && del.target[1] <= ins[1] && ins[1] < del.target[1] + (del.length || 1)\n }\n Y.utils.inDeletionRange = inDeletionRange\n\n function compareIds (id1, id2) {\n if (id1 == null || id2 == null) {\n return id1 === id2\n } else {\n return id1[0] === id2[0] && id1[1] === id2[1]\n }\n }\n Y.utils.compareIds = compareIds\n\n function matchesId (op, id) {\n if (id == null || op == null) {\n return id === op\n } else {\n if (id[0] === op.id[0]) {\n if (op.content == null) {\n return id[1] === op.id[1]\n } else {\n return id[1] >= op.id[1] && id[1] < op.id[1] + op.content.length\n }\n }\n }\n }\n Y.utils.matchesId = matchesId\n\n function getLastId (op) {\n if (op.content == null || op.content.length === 1) {\n return op.id\n } else {\n return [op.id[0], op.id[1] + op.content.length - 1]\n }\n }\n Y.utils.getLastId = getLastId\n\n function createEmptyOpsArray (n) {\n var a = new Array(n)\n for (var i = 0; i < a.length; i++) {\n a[i] = {\n id: [null, null]\n }\n }\n return a\n }\n\n function createSmallLookupBuffer (Store) {\n /*\n This buffer implements a very small buffer that temporarily stores operations\n after they are read / before they are written.\n The buffer basically implements FIFO. Often requested lookups will be re-queued every time they are looked up / written.\n\n It can speed up lookups on Operation Stores and State Stores. But it does not require notable use of memory or processing power.\n\n Good for os and ss, bot not for ds (because it often uses methods that require a flush)\n\n I tried to optimize this for performance, therefore no highlevel operations.\n */\n class SmallLookupBuffer extends Store {\n constructor (arg1, arg2) {\n // super(...arguments) -- do this when this is supported by stable nodejs\n super(arg1, arg2)\n this.writeBuffer = createEmptyOpsArray(5)\n this.readBuffer = createEmptyOpsArray(10)\n }\n * find (id, noSuperCall) {\n var i, r\n for (i = this.readBuffer.length - 1; i >= 0; i--) {\n r = this.readBuffer[i]\n // we don't have to use compareids, because id is always defined!\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n // found r\n // move r to the end of readBuffer\n for (; i < this.readBuffer.length - 1; i++) {\n this.readBuffer[i] = this.readBuffer[i + 1]\n }\n this.readBuffer[this.readBuffer.length - 1] = r\n return r\n }\n }\n var o\n for (i = this.writeBuffer.length - 1; i >= 0; i--) {\n r = this.writeBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n o = r\n break\n }\n }\n if (i < 0 && noSuperCall === undefined) {\n // did not reach break in last loop\n // read id and put it to the end of readBuffer\n o = yield* super.find(id)\n }\n if (o != null) {\n for (i = 0; i < this.readBuffer.length - 1; i++) {\n this.readBuffer[i] = this.readBuffer[i + 1]\n }\n this.readBuffer[this.readBuffer.length - 1] = o\n }\n return o\n }\n * put (o) {\n var id = o.id\n var i, r // helper variables\n for (i = this.writeBuffer.length - 1; i >= 0; i--) {\n r = this.writeBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n // is already in buffer\n // forget r, and move o to the end of writeBuffer\n for (; i < this.writeBuffer.length - 1; i++) {\n this.writeBuffer[i] = this.writeBuffer[i + 1]\n }\n this.writeBuffer[this.writeBuffer.length - 1] = o\n break\n }\n }\n if (i < 0) {\n // did not reach break in last loop\n // write writeBuffer[0]\n var write = this.writeBuffer[0]\n if (write.id[0] !== null) {\n yield* super.put(write)\n }\n // put o to the end of writeBuffer\n for (i = 0; i < this.writeBuffer.length - 1; i++) {\n this.writeBuffer[i] = this.writeBuffer[i + 1]\n }\n this.writeBuffer[this.writeBuffer.length - 1] = o\n }\n // check readBuffer for every occurence of o.id, overwrite if found\n // whether found or not, we'll append o to the readbuffer\n for (i = 0; i < this.readBuffer.length - 1; i++) {\n r = this.readBuffer[i + 1]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n this.readBuffer[i] = o\n } else {\n this.readBuffer[i] = r\n }\n }\n this.readBuffer[this.readBuffer.length - 1] = o\n }\n * delete (id) {\n var i, r\n for (i = 0; i < this.readBuffer.length; i++) {\n r = this.readBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n this.readBuffer[i] = {\n id: [null, null]\n }\n }\n }\n yield* this.flush()\n yield* super.delete(id)\n }\n * findWithLowerBound (id) {\n var o = yield* this.find(id, true)\n if (o != null) {\n return o\n } else {\n yield* this.flush()\n return yield* super.findWithLowerBound.apply(this, arguments)\n }\n }\n * findWithUpperBound (id) {\n var o = yield* this.find(id, true)\n if (o != null) {\n return o\n } else {\n yield* this.flush()\n return yield* super.findWithUpperBound.apply(this, arguments)\n }\n }\n * findNext () {\n yield* this.flush()\n return yield* super.findNext.apply(this, arguments)\n }\n * findPrev () {\n yield* this.flush()\n return yield* super.findPrev.apply(this, arguments)\n }\n * iterate () {\n yield* this.flush()\n yield* super.iterate.apply(this, arguments)\n }\n * flush () {\n for (var i = 0; i < this.writeBuffer.length; i++) {\n var write = this.writeBuffer[i]\n if (write.id[0] !== null) {\n yield* super.put(write)\n this.writeBuffer[i] = {\n id: [null, null]\n }\n }\n }\n }\n }\n return SmallLookupBuffer\n }\n Y.utils.createSmallLookupBuffer = createSmallLookupBuffer\n}\n","/* @flow */\n'use strict'\n\nrequire('./Connector.js')(Y)\nrequire('./Database.js')(Y)\nrequire('./Transaction.js')(Y)\nrequire('./Struct.js')(Y)\nrequire('./Utils.js')(Y)\nrequire('./Connectors/Test.js')(Y)\n\nvar requiringModules = {}\n\nmodule.exports = Y\nY.requiringModules = requiringModules\n\nY.extend = function (name, value) {\n if (value instanceof Y.utils.CustomType) {\n Y[name] = value.parseArguments\n } else {\n Y[name] = value\n }\n if (requiringModules[name] != null) {\n requiringModules[name].resolve()\n delete requiringModules[name]\n }\n}\n\nY.requestModules = requestModules\nfunction requestModules (modules) {\n // determine if this module was compiled for es5 or es6 (y.js vs. y.es6)\n // if Insert.execute is a Function, then it isnt a generator..\n // then load the es5(.js) files..\n var extention = typeof regeneratorRuntime !== 'undefined' ? '.js' : '.es6'\n var promises = []\n for (var i = 0; i < modules.length; i++) {\n var module = modules[i].split('(')[0]\n var modulename = 'y-' + module.toLowerCase()\n if (Y[module] == null) {\n if (requiringModules[module] == null) {\n // module does not exist\n if (typeof window !== 'undefined' && window.Y !== 'undefined') {\n var imported = document.createElement('script')\n imported.src = Y.sourceDir + '/' + modulename + '/' + modulename + extention\n document.head.appendChild(imported)\n\n let requireModule = {}\n requiringModules[module] = requireModule\n requireModule.promise = new Promise(function (resolve) {\n requireModule.resolve = resolve\n })\n promises.push(requireModule.promise)\n } else {\n console.info('YJS: Please do not depend on automatic requiring of modules anymore! Extend modules as follows `require(\\'y-modulename\\')(Y)`')\n require(modulename)(Y)\n }\n } else {\n promises.push(requiringModules[modules[i]].promise)\n }\n }\n }\n return Promise.all(promises)\n}\n\n/* ::\ntype MemoryOptions = {\n name: 'memory'\n}\ntype IndexedDBOptions = {\n name: 'indexeddb',\n namespace: string\n}\ntype DbOptions = MemoryOptions | IndexedDBOptions\n\ntype WebRTCOptions = {\n name: 'webrtc',\n room: string\n}\ntype WebsocketsClientOptions = {\n name: 'websockets-client',\n room: string\n}\ntype ConnectionOptions = WebRTCOptions | WebsocketsClientOptions\n\ntype YOptions = {\n connector: ConnectionOptions,\n db: DbOptions,\n types: Array,\n sourceDir: string,\n share: {[key: string]: TypeName}\n}\n*/\n\nfunction Y (opts/* :YOptions */) /* :Promise */ {\n opts.types = opts.types != null ? opts.types : []\n var modules = [opts.db.name, opts.connector.name].concat(opts.types)\n for (var name in opts.share) {\n modules.push(opts.share[name])\n }\n Y.sourceDir = opts.sourceDir\n return new Promise(function (resolve, reject) {\n setTimeout(function () {\n Y.requestModules(modules).then(function () {\n if (opts == null) reject('An options object is expected! ')\n else if (opts.connector == null) reject('You must specify a connector! (missing connector property)')\n else if (opts.connector.name == null) reject('You must specify connector name! (missing connector.name property)')\n else if (opts.db == null) reject('You must specify a database! (missing db property)')\n else if (opts.connector.name == null) reject('You must specify db name! (missing db.name property)')\n else if (opts.share == null) reject('You must specify a set of shared types!')\n else {\n var yconfig = new YConfig(opts)\n yconfig.db.whenUserIdSet(function () {\n yconfig.init(function () {\n resolve(yconfig)\n })\n })\n }\n }).catch(reject)\n }, 0)\n })\n}\n\nclass YConfig {\n /* ::\n db: Y.AbstractDatabase;\n connector: Y.AbstractConnector;\n share: {[key: string]: any};\n options: Object;\n */\n constructor (opts, callback) {\n this.options = opts\n this.db = new Y[opts.db.name](this, opts.db)\n this.connector = new Y[opts.connector.name](this, opts.connector)\n }\n init (callback) {\n var opts = this.options\n var share = {}\n this.share = share\n this.db.requestTransaction(function * requestTransaction () {\n // create shared object\n for (var propertyname in opts.share) {\n var typeConstructor = opts.share[propertyname].split('(')\n var typeName = typeConstructor.splice(0, 1)\n var args = []\n if (typeConstructor.length === 1) {\n try {\n args = JSON.parse('[' + typeConstructor[0].split(')')[0] + ']')\n } catch (e) {\n throw new Error('Was not able to parse type definition! (share.' + propertyname + ')')\n }\n }\n var type = Y[typeName]\n var typedef = type.typeDefinition\n var id = ['_', typedef.struct + '_' + typeName + '_' + propertyname + '_' + typeConstructor]\n share[propertyname] = yield* this.createType(type.apply(typedef, args), id)\n }\n this.store.whenTransactionsFinished()\n .then(callback)\n })\n }\n isConnected () {\n return this.connector.isSynced\n }\n disconnect () {\n return this.connector.disconnect()\n }\n reconnect () {\n return this.connector.reconnect()\n }\n destroy () {\n if (this.connector.destroy != null) {\n this.connector.destroy()\n } else {\n this.connector.disconnect()\n }\n var self = this\n this.db.requestTransaction(function * () {\n yield* self.db.destroy()\n self.connector = null\n self.db = null\n })\n }\n}\n\nif (typeof window !== 'undefined') {\n window.Y = Y\n}\n"]} \ No newline at end of file +{"version":3,"sources":["node_modules/browser-pack/_prelude.js","src/Connector.js","src/Connectors/Test.js","src/Database.js","src/Struct.js","src/Transaction.js","src/Utils.js","src/y.js"],"names":[],"mappings":"AAAA;ACAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC9ZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACrKA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC9fA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC1ZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACzkCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AChuBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA","file":"y.es6","sourceRoot":"/source/","sourcesContent":["(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o;\n whenSyncedListeners: Array;\n currentSyncTarget: ?UserId;\n syncingClients: Array;\n forwardToSyncingClients: boolean;\n debug: boolean;\n broadcastedHB: boolean;\n syncStep2: Promise;\n userId: UserId;\n send: Function;\n broadcast: Function;\n broadcastOpBuffer: Array;\n protocolVersion: number;\n */\n /*\n opts contains the following information:\n role : String Role of this client (\"master\" or \"slave\")\n userId : String Uniquely defines the user.\n debug: Boolean Whether to print debug messages (optional)\n */\n constructor (y, opts) {\n this.y = y\n if (opts == null) {\n opts = {}\n }\n if (opts.role == null || opts.role === 'master') {\n this.role = 'master'\n } else if (opts.role === 'slave') {\n this.role = 'slave'\n } else {\n throw new Error(\"Role must be either 'master' or 'slave'!\")\n }\n this.y.db.forwardAppliedOperations = opts.forwardAppliedOperations || false\n this.role = opts.role\n this.connections = {}\n this.isSynced = false\n this.userEventListeners = []\n this.whenSyncedListeners = []\n this.currentSyncTarget = null\n this.syncingClients = []\n this.forwardToSyncingClients = opts.forwardToSyncingClients !== false\n this.debug = opts.debug === true\n this.broadcastedHB = false\n this.syncStep2 = Promise.resolve()\n this.broadcastOpBuffer = []\n this.protocolVersion = 11\n }\n reconnect () {\n }\n disconnect () {\n this.connections = {}\n this.isSynced = false\n this.currentSyncTarget = null\n this.broadcastedHB = false\n this.syncingClients = []\n this.whenSyncedListeners = []\n return this.y.db.stopGarbageCollector()\n }\n setUserId (userId) {\n if (this.userId == null) {\n this.userId = userId\n return this.y.db.setUserId(userId)\n } else {\n return null\n }\n }\n onUserEvent (f) {\n this.userEventListeners.push(f)\n }\n userLeft (user) {\n if (this.connections[user] != null) {\n delete this.connections[user]\n if (user === this.currentSyncTarget) {\n this.currentSyncTarget = null\n this.findNextSyncTarget()\n }\n this.syncingClients = this.syncingClients.filter(function (cli) {\n return cli !== user\n })\n for (var f of this.userEventListeners) {\n f({\n action: 'userLeft',\n user: user\n })\n }\n }\n }\n userJoined (user, role) {\n if (role == null) {\n throw new Error('You must specify the role of the joined user!')\n }\n if (this.connections[user] != null) {\n throw new Error('This user already joined!')\n }\n this.connections[user] = {\n isSynced: false,\n role: role\n }\n for (var f of this.userEventListeners) {\n f({\n action: 'userJoined',\n user: user,\n role: role\n })\n }\n if (this.currentSyncTarget == null) {\n this.findNextSyncTarget()\n }\n }\n // Execute a function _when_ we are connected.\n // If not connected, wait until connected\n whenSynced (f) {\n if (this.isSynced) {\n f()\n } else {\n this.whenSyncedListeners.push(f)\n }\n }\n /*\n\n returns false, if there is no sync target\n true otherwise\n */\n findNextSyncTarget () {\n if (this.currentSyncTarget != null || this.isSynced) {\n return // \"The current sync has not finished!\"\n }\n\n var syncUser = null\n for (var uid in this.connections) {\n if (!this.connections[uid].isSynced) {\n syncUser = uid\n break\n }\n }\n var conn = this\n if (syncUser != null) {\n this.currentSyncTarget = syncUser\n this.y.db.requestTransaction(function *() {\n var stateSet = yield* this.getStateSet()\n var deleteSet = yield* this.getDeleteSet()\n conn.send(syncUser, {\n type: 'sync step 1',\n stateSet: stateSet,\n deleteSet: deleteSet,\n protocolVersion: conn.protocolVersion\n })\n })\n } else {\n this.y.db.requestTransaction(function *() {\n // it is crucial that isSynced is set at the time garbageCollectAfterSync is called\n conn.isSynced = true\n yield* this.garbageCollectAfterSync()\n // call whensynced listeners\n for (var f of conn.whenSyncedListeners) {\n f()\n }\n conn.whenSyncedListeners = []\n })\n }\n }\n send (uid, message) {\n if (this.debug) {\n console.log(`send ${this.userId} -> ${uid}: ${message.type}`, message) // eslint-disable-line\n }\n }\n /*\n Buffer operations, and broadcast them when ready.\n */\n broadcastOps (ops) {\n ops = ops.map(function (op) {\n return Y.Struct[op.struct].encode(op)\n })\n var self = this\n function broadcastOperations () {\n if (self.broadcastOpBuffer.length > 0) {\n self.broadcast({\n type: 'update',\n ops: self.broadcastOpBuffer\n })\n self.broadcastOpBuffer = []\n }\n }\n if (this.broadcastOpBuffer.length === 0) {\n this.broadcastOpBuffer = ops\n if (this.y.db.transactionInProgress) {\n this.y.db.whenTransactionsFinished().then(broadcastOperations)\n } else {\n setTimeout(broadcastOperations, 0)\n }\n } else {\n this.broadcastOpBuffer = this.broadcastOpBuffer.concat(ops)\n }\n }\n /*\n You received a raw message, and you know that it is intended for Yjs. Then call this function.\n */\n receiveMessage (sender/* :UserId */, message/* :Message */) {\n if (sender === this.userId) {\n return\n }\n if (this.debug) {\n console.log(`receive ${sender} -> ${this.userId}: ${message.type}`, JSON.parse(JSON.stringify(message))) // eslint-disable-line\n }\n if (message.protocolVersion != null && message.protocolVersion !== this.protocolVersion) {\n console.error(\n `You tried to sync with a yjs instance that has a different protocol version\n (You: ${this.protocolVersion}, Client: ${message.protocolVersion}).\n The sync was stopped. You need to upgrade your dependencies (especially Yjs & the Connector)!\n `)\n this.send(sender, {\n type: 'sync stop',\n protocolVersion: this.protocolVersion\n })\n return\n }\n if (message.type === 'sync step 1') {\n let conn = this\n let m = message\n this.y.db.requestTransaction(function *() {\n var currentStateSet = yield* this.getStateSet()\n yield* this.applyDeleteSet(m.deleteSet)\n\n var ds = yield* this.getDeleteSet()\n var ops = yield* this.getOperations(m.stateSet)\n conn.send(sender, {\n type: 'sync step 2',\n os: ops,\n stateSet: currentStateSet,\n deleteSet: ds,\n protocolVersion: this.protocolVersion\n })\n if (this.forwardToSyncingClients) {\n conn.syncingClients.push(sender)\n setTimeout(function () {\n conn.syncingClients = conn.syncingClients.filter(function (cli) {\n return cli !== sender\n })\n conn.send(sender, {\n type: 'sync done'\n })\n }, 5000) // TODO: conn.syncingClientDuration)\n } else {\n conn.send(sender, {\n type: 'sync done'\n })\n }\n conn._setSyncedWith(sender)\n })\n } else if (message.type === 'sync step 2') {\n let conn = this\n var broadcastHB = !this.broadcastedHB\n this.broadcastedHB = true\n var db = this.y.db\n var defer = {}\n defer.promise = new Promise(function (resolve) {\n defer.resolve = resolve\n })\n this.syncStep2 = defer.promise\n let m /* :MessageSyncStep2 */ = message\n db.requestTransaction(function * () {\n yield* this.applyDeleteSet(m.deleteSet)\n this.store.apply(m.os)\n db.requestTransaction(function * () {\n var ops = yield* this.getOperations(m.stateSet)\n if (ops.length > 0) {\n if (!broadcastHB) { // TODO: consider to broadcast here..\n conn.send(sender, {\n type: 'update',\n ops: ops\n })\n } else {\n // broadcast only once!\n conn.broadcastOps(ops)\n }\n }\n defer.resolve()\n })\n })\n } else if (message.type === 'sync done') {\n var self = this\n this.syncStep2.then(function () {\n self._setSyncedWith(sender)\n })\n } else if (message.type === 'update') {\n if (this.forwardToSyncingClients) {\n for (var client of this.syncingClients) {\n this.send(client, message)\n }\n }\n if (this.y.db.forwardAppliedOperations) {\n var delops = message.ops.filter(function (o) {\n return o.struct === 'Delete'\n })\n if (delops.length > 0) {\n this.broadcastOps(delops)\n }\n }\n this.y.db.apply(message.ops)\n }\n }\n _setSyncedWith (user) {\n var conn = this.connections[user]\n if (conn != null) {\n conn.isSynced = true\n }\n if (user === this.currentSyncTarget) {\n this.currentSyncTarget = null\n this.findNextSyncTarget()\n }\n }\n /*\n Currently, the HB encodes operations as JSON. For the moment I want to keep it\n that way. Maybe we support encoding in the HB as XML in the future, but for now I don't want\n too much overhead. Y is very likely to get changed a lot in the future\n\n Because we don't want to encode JSON as string (with character escaping, wich makes it pretty much unreadable)\n we encode the JSON as XML.\n\n When the HB support encoding as XML, the format should look pretty much like this.\n\n does not support primitive values as array elements\n expects an ltx (less than xml) object\n */\n parseMessageFromXml (m/* :any */) {\n function parseArray (node) {\n for (var n of node.children) {\n if (n.getAttribute('isArray') === 'true') {\n return parseArray(n)\n } else {\n return parseObject(n)\n }\n }\n }\n function parseObject (node/* :any */) {\n var json = {}\n for (var attrName in node.attrs) {\n var value = node.attrs[attrName]\n var int = parseInt(value, 10)\n if (isNaN(int) || ('' + int) !== value) {\n json[attrName] = value\n } else {\n json[attrName] = int\n }\n }\n for (var n/* :any */ in node.children) {\n var name = n.name\n if (n.getAttribute('isArray') === 'true') {\n json[name] = parseArray(n)\n } else {\n json[name] = parseObject(n)\n }\n }\n return json\n }\n parseObject(m)\n }\n /*\n encode message in xml\n we use string because Strophe only accepts an \"xml-string\"..\n So {a:4,b:{c:5}} will look like\n \n \n \n m - ltx element\n json - Object\n */\n encodeMessageToXml (msg, obj) {\n // attributes is optional\n function encodeObject (m, json) {\n for (var name in json) {\n var value = json[name]\n if (name == null) {\n // nop\n } else if (value.constructor === Object) {\n encodeObject(m.c(name), value)\n } else if (value.constructor === Array) {\n encodeArray(m.c(name), value)\n } else {\n m.setAttribute(name, value)\n }\n }\n }\n function encodeArray (m, array) {\n m.setAttribute('isArray', 'true')\n for (var e of array) {\n if (e.constructor === Object) {\n encodeObject(m.c('array-element'), e)\n } else {\n encodeArray(m.c('array-element'), e)\n }\n }\n }\n if (obj.constructor === Object) {\n encodeObject(msg.c('y', { xmlns: 'http://y.ninja/connector-stanza' }), obj)\n } else if (obj.constructor === Array) {\n encodeArray(msg.c('y', { xmlns: 'http://y.ninja/connector-stanza' }), obj)\n } else {\n throw new Error(\"I can't encode this json!\")\n }\n }\n }\n Y.AbstractConnector = AbstractConnector\n}\n","/* global getRandom, async */\n'use strict'\n\nmodule.exports = function (Y) {\n var globalRoom = {\n users: {},\n buffers: {}, // TODO: reimplement this idea. This does not cover all cases!! Here, you have a queue which is unrealistic (i.e. think about multiple incoming connections)\n removeUser: function (user) {\n for (var i in this.users) {\n this.users[i].userLeft(user)\n }\n delete this.users[user]\n delete this.buffers[user]\n },\n addUser: function (connector) {\n this.users[connector.userId] = connector\n this.buffers[connector.userId] = {}\n for (var uname in this.users) {\n if (uname !== connector.userId) {\n var u = this.users[uname]\n u.userJoined(connector.userId, 'master')\n connector.userJoined(u.userId, 'master')\n }\n }\n },\n whenTransactionsFinished: function () {\n var ps = []\n for (var name in this.users) {\n ps.push(this.users[name].y.db.whenTransactionsFinished())\n }\n return Promise.all(ps)\n },\n flushOne: function flushOne () {\n var bufs = []\n for (var receiver in globalRoom.buffers) {\n let buff = globalRoom.buffers[receiver]\n var push = false\n for (let sender in buff) {\n if (buff[sender].length > 0) {\n push = true\n break\n }\n }\n if (push) {\n bufs.push(receiver)\n }\n }\n if (bufs.length > 0) {\n var userId = getRandom(bufs)\n let buff = globalRoom.buffers[userId]\n let sender = getRandom(Object.keys(buff))\n var m = buff[sender].shift()\n if (buff[sender].length === 0) {\n delete buff[sender]\n }\n var user = globalRoom.users[userId]\n user.receiveMessage(m[0], m[1])\n return user.y.db.whenTransactionsFinished()\n } else {\n return false\n }\n },\n flushAll: function () {\n return new Promise(function (resolve) {\n // flushes may result in more created operations,\n // flush until there is nothing more to flush\n function nextFlush () {\n var c = globalRoom.flushOne()\n if (c) {\n while (c) {\n c = globalRoom.flushOne()\n }\n globalRoom.whenTransactionsFinished().then(nextFlush)\n } else {\n setTimeout(function () {\n var c = globalRoom.flushOne()\n if (c) {\n c.then(function () {\n globalRoom.whenTransactionsFinished().then(nextFlush)\n })\n } else {\n resolve()\n }\n }, 0)\n }\n }\n globalRoom.whenTransactionsFinished().then(nextFlush)\n })\n }\n }\n Y.utils.globalRoom = globalRoom\n\n var userIdCounter = 0\n\n class Test extends Y.AbstractConnector {\n constructor (y, options) {\n if (options === undefined) {\n throw new Error('Options must not be undefined!')\n }\n options.role = 'master'\n options.forwardToSyncingClients = false\n super(y, options)\n this.setUserId((userIdCounter++) + '').then(() => {\n globalRoom.addUser(this)\n })\n this.globalRoom = globalRoom\n this.syncingClientDuration = 0\n }\n receiveMessage (sender, m) {\n super.receiveMessage(sender, JSON.parse(JSON.stringify(m)))\n }\n send (userId, message) {\n var buffer = globalRoom.buffers[userId]\n if (buffer != null) {\n if (buffer[this.userId] == null) {\n buffer[this.userId] = []\n }\n buffer[this.userId].push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n broadcast (message) {\n for (var key in globalRoom.buffers) {\n var buff = globalRoom.buffers[key]\n if (buff[this.userId] == null) {\n buff[this.userId] = []\n }\n buff[this.userId].push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n isDisconnected () {\n return globalRoom.users[this.userId] == null\n }\n reconnect () {\n if (this.isDisconnected()) {\n globalRoom.addUser(this)\n super.reconnect()\n }\n return Y.utils.globalRoom.flushAll()\n }\n disconnect () {\n if (!this.isDisconnected()) {\n globalRoom.removeUser(this.userId)\n super.disconnect()\n }\n return this.y.db.whenTransactionsFinished()\n }\n flush () {\n var self = this\n return async(function * () {\n var buff = globalRoom.buffers[self.userId]\n while (Object.keys(buff).length > 0) {\n var sender = getRandom(Object.keys(buff))\n var m = buff[sender].shift()\n if (buff[sender].length === 0) {\n delete buff[sender]\n }\n this.receiveMessage(m[0], m[1])\n }\n yield self.whenTransactionsFinished()\n })\n }\n }\n\n Y.Test = Test\n}\n","/* @flow */\n'use strict'\n\nmodule.exports = function (Y /* :any */) {\n /*\n Partial definition of an OperationStore.\n TODO: name it Database, operation store only holds operations.\n\n A database definition must alse define the following methods:\n * logTable() (optional)\n - show relevant information information in a table\n * requestTransaction(makeGen)\n - request a transaction\n * destroy()\n - destroy the database\n */\n class AbstractDatabase {\n /* ::\n y: YConfig;\n forwardAppliedOperations: boolean;\n listenersById: Object;\n listenersByIdExecuteNow: Array;\n listenersByIdRequestPending: boolean;\n initializedTypes: Object;\n whenUserIdSetListener: ?Function;\n waitingTransactions: Array;\n transactionInProgress: boolean;\n executeOrder: Array;\n gc1: Array;\n gc2: Array;\n gcTimeout: number;\n gcInterval: any;\n garbageCollect: Function;\n executeOrder: Array; // for debugging only\n userId: UserId;\n opClock: number;\n transactionsFinished: ?{promise: Promise, resolve: any};\n transact: (x: ?Generator) => any;\n */\n constructor (y, opts) {\n this.y = y\n var os = this\n this.userId = null\n var resolve\n this.userIdPromise = new Promise(function (r) {\n resolve = r\n })\n this.userIdPromise.resolve = resolve\n // whether to broadcast all applied operations (insert & delete hook)\n this.forwardAppliedOperations = false\n // E.g. this.listenersById[id] : Array\n this.listenersById = {}\n // Execute the next time a transaction is requested\n this.listenersByIdExecuteNow = []\n // A transaction is requested\n this.listenersByIdRequestPending = false\n /* To make things more clear, the following naming conventions:\n * ls : we put this.listenersById on ls\n * l : Array\n * id : Id (can't use as property name)\n * sid : String (converted from id via JSON.stringify\n so we can use it as a property name)\n\n Always remember to first overwrite\n a property before you iterate over it!\n */\n // TODO: Use ES7 Weak Maps. This way types that are no longer user,\n // wont be kept in memory.\n this.initializedTypes = {}\n this.waitingTransactions = []\n this.transactionInProgress = false\n this.transactionIsFlushed = false\n if (typeof YConcurrency_TestingMode !== 'undefined') {\n this.executeOrder = []\n }\n this.gc1 = [] // first stage\n this.gc2 = [] // second stage -> after that, remove the op\n this.gcTimeout = !opts.gcTimeout ? 50000 : opts.gcTimeouts\n function garbageCollect () {\n return os.whenTransactionsFinished().then(function () {\n if (os.gc1.length > 0 || os.gc2.length > 0) {\n if (!os.y.isConnected()) {\n console.warn('gc should be empty when disconnected!')\n }\n return new Promise((resolve) => {\n os.requestTransaction(function * () {\n if (os.y.connector != null && os.y.connector.isSynced) {\n for (var i = 0; i < os.gc2.length; i++) {\n var oid = os.gc2[i]\n yield* this.garbageCollectOperation(oid)\n }\n os.gc2 = os.gc1\n os.gc1 = []\n }\n // TODO: Use setInterval here instead (when garbageCollect is called several times there will be several timeouts..)\n if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n resolve()\n })\n })\n } else {\n // TODO: see above\n if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n return Promise.resolve()\n }\n })\n }\n this.garbageCollect = garbageCollect\n if (this.gcTimeout > 0) {\n garbageCollect()\n }\n }\n queueGarbageCollector (id) {\n if (this.y.isConnected()) {\n this.gc1.push(id)\n }\n }\n emptyGarbageCollector () {\n return new Promise(resolve => {\n var check = () => {\n if (this.gc1.length > 0 || this.gc2.length > 0) {\n this.garbageCollect().then(check)\n } else {\n resolve()\n }\n }\n setTimeout(check, 0)\n })\n }\n addToDebug () {\n if (typeof YConcurrency_TestingMode !== 'undefined') {\n var command /* :string */ = Array.prototype.map.call(arguments, function (s) {\n if (typeof s === 'string') {\n return s\n } else {\n return JSON.stringify(s)\n }\n }).join('').replace(/\"/g, \"'\").replace(/,/g, ', ').replace(/:/g, ': ')\n this.executeOrder.push(command)\n }\n }\n getDebugData () {\n console.log(this.executeOrder.join('\\n'))\n }\n stopGarbageCollector () {\n var self = this\n return new Promise(function (resolve) {\n self.requestTransaction(function * () {\n var ungc /* :Array */ = self.gc1.concat(self.gc2)\n self.gc1 = []\n self.gc2 = []\n for (var i = 0; i < ungc.length; i++) {\n var op = yield* this.getOperation(ungc[i])\n if (op != null) {\n delete op.gc\n yield* this.setOperation(op)\n }\n }\n resolve()\n })\n })\n }\n /*\n Try to add to GC.\n\n TODO: rename this function\n\n Rulez:\n * Only gc if this user is online\n * The most left element in a list must not be gc'd.\n => There is at least one element in the list\n\n returns true iff op was added to GC\n */\n * addToGarbageCollector (op, left) {\n if (\n op.gc == null &&\n op.deleted === true\n ) {\n var gc = false\n if (left != null && left.deleted === true) {\n gc = true\n } else if (op.content != null && op.content.length > 1) {\n op = yield* this.getInsertionCleanStart([op.id[0], op.id[1] + 1])\n gc = true\n }\n if (gc) {\n op.gc = true\n yield* this.setOperation(op)\n this.store.queueGarbageCollector(op.id)\n return true\n }\n }\n return false\n }\n removeFromGarbageCollector (op) {\n function filter (o) {\n return !Y.utils.compareIds(o, op.id)\n }\n this.gc1 = this.gc1.filter(filter)\n this.gc2 = this.gc2.filter(filter)\n delete op.gc\n }\n * destroy () {\n clearInterval(this.gcInterval)\n this.gcInterval = null\n for (var key in this.initializedTypes) {\n var type = this.initializedTypes[key]\n if (type._destroy != null) {\n type._destroy()\n } else {\n console.error('The type you included does not provide destroy functionality, it will remain in memory (updating your packages will help).')\n }\n }\n }\n setUserId (userId) {\n if (!this.userIdPromise.inProgress) {\n this.userIdPromise.inProgress = true\n var self = this\n self.requestTransaction(function * () {\n self.userId = userId\n var state = yield* this.getState(userId)\n self.opClock = state.clock\n self.userIdPromise.resolve(userId)\n })\n }\n return this.userIdPromise\n }\n whenUserIdSet (f) {\n this.userIdPromise.then(f)\n }\n getNextOpId (numberOfIds) {\n if (numberOfIds == null) {\n throw new Error('getNextOpId expects the number of created ids to create!')\n } else if (this.userId == null) {\n throw new Error('OperationStore not yet initialized!')\n } else {\n var id = [this.userId, this.opClock]\n this.opClock += numberOfIds\n return id\n }\n }\n /*\n Apply a list of operations.\n\n * get a transaction\n * check whether all Struct.*.requiredOps are in the OS\n * check if it is an expected op (otherwise wait for it)\n * check if was deleted, apply a delete operation after op was applied\n */\n apply (ops) {\n for (var i = 0; i < ops.length; i++) {\n var o = ops[i]\n if (o.id == null || o.id[0] !== this.y.connector.userId) {\n var required = Y.Struct[o.struct].requiredOps(o)\n if (o.requires != null) {\n required = required.concat(o.requires)\n }\n this.whenOperationsExist(required, o)\n }\n }\n }\n /*\n op is executed as soon as every operation requested is available.\n Note that Transaction can (and should) buffer requests.\n */\n whenOperationsExist (ids, op) {\n if (ids.length > 0) {\n let listener = {\n op: op,\n missing: ids.length\n }\n\n for (let i = 0; i < ids.length; i++) {\n let id = ids[i]\n let sid = JSON.stringify(id)\n let l = this.listenersById[sid]\n if (l == null) {\n l = []\n this.listenersById[sid] = l\n }\n l.push(listener)\n }\n } else {\n this.listenersByIdExecuteNow.push({\n op: op\n })\n }\n\n if (this.listenersByIdRequestPending) {\n return\n }\n\n this.listenersByIdRequestPending = true\n var store = this\n\n this.requestTransaction(function * () {\n var exeNow = store.listenersByIdExecuteNow\n store.listenersByIdExecuteNow = []\n\n var ls = store.listenersById\n store.listenersById = {}\n\n store.listenersByIdRequestPending = false\n\n for (let key = 0; key < exeNow.length; key++) {\n let o = exeNow[key].op\n yield* store.tryExecute.call(this, o)\n }\n\n for (var sid in ls) {\n var l = ls[sid]\n var id = JSON.parse(sid)\n var op\n if (typeof id[1] === 'string') {\n op = yield* this.getOperation(id)\n } else {\n op = yield* this.getInsertion(id)\n }\n if (op == null) {\n store.listenersById[sid] = l\n } else {\n for (let i = 0; i < l.length; i++) {\n let listener = l[i]\n let o = listener.op\n if (--listener.missing === 0) {\n yield* store.tryExecute.call(this, o)\n }\n }\n }\n }\n })\n }\n /*\n Actually execute an operation, when all expected operations are available.\n */\n /* :: // TODO: this belongs somehow to transaction\n store: Object;\n getOperation: any;\n isGarbageCollected: any;\n addOperation: any;\n whenOperationsExist: any;\n */\n * tryExecute (op) {\n this.store.addToDebug('yield* this.store.tryExecute.call(this, ', JSON.stringify(op), ')')\n if (op.struct === 'Delete') {\n yield* Y.Struct.Delete.execute.call(this, op)\n // this is now called in Transaction.deleteOperation!\n // yield* this.store.operationAdded(this, op)\n } else {\n // check if this op was defined\n var defined = yield* this.getInsertion(op.id)\n while (defined != null && defined.content != null) {\n // check if this op has a longer content in the case it is defined\n if (defined.id[1] + defined.content.length < op.id[1] + op.content.length) {\n var overlapSize = defined.content.length - (op.id[1] - defined.id[1])\n op.content.splice(0, overlapSize)\n op.id = [op.id[0], op.id[1] + overlapSize]\n op.left = Y.utils.getLastId(defined)\n op.origin = op.left\n defined = yield* this.getOperation(op.id) // getOperation suffices here\n } else {\n break\n }\n }\n if (defined == null) {\n var opid = op.id\n var isGarbageCollected = yield* this.isGarbageCollected(opid)\n if (!isGarbageCollected) {\n yield* Y.Struct[op.struct].execute.call(this, op)\n yield* this.addOperation(op)\n yield* this.store.operationAdded(this, op)\n if (!Y.utils.compareIds(opid, op.id)) {\n // operationAdded changed op\n op = yield* this.getOperation(opid)\n }\n // if insertion, try to combine with left\n yield* this.tryCombineWithLeft(op)\n }\n }\n }\n }\n /*\n * Called by a transaction when an operation is added.\n * This function is especially important for y-indexeddb, where several instances may share a single database.\n * Every time an operation is created by one instance, it is send to all other instances and operationAdded is called\n *\n * If it's not a Delete operation:\n * * Checks if another operation is executable (listenersById)\n * * Update state, if possible\n *\n * Always:\n * * Call type\n */\n * operationAdded (transaction, op) {\n if (op.struct === 'Delete') {\n var target = yield* transaction.getInsertion(op.target)\n var type = this.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(transaction, op)\n }\n } else {\n // increase SS\n yield* transaction.updateState(op.id[0])\n var opLen = op.content != null ? op.content.length : 1\n for (let i = 0; i < opLen; i++) {\n // notify whenOperation listeners (by id)\n var sid = JSON.stringify([op.id[0], op.id[1] + i])\n var l = this.listenersById[sid]\n delete this.listenersById[sid]\n if (l != null) {\n for (var key in l) {\n var listener = l[key]\n if (--listener.missing === 0) {\n this.whenOperationsExist([], listener.op)\n }\n }\n }\n }\n var t = this.initializedTypes[JSON.stringify(op.parent)]\n\n // if parent is deleted, mark as gc'd and return\n if (op.parent != null) {\n var parentIsDeleted = yield* transaction.isDeleted(op.parent)\n if (parentIsDeleted) {\n yield* transaction.deleteList(op.id)\n return\n }\n }\n\n // notify parent, if it was instanciated as a custom type\n if (t != null) {\n let o = Y.utils.copyOperation(op)\n yield* t._changed(transaction, o)\n }\n if (!op.deleted) {\n // Delete if DS says this is actually deleted\n var len = op.content != null ? op.content.length : 1\n var startId = op.id // You must not use op.id in the following loop, because op will change when deleted\n for (let i = 0; i < len; i++) {\n var id = [startId[0], startId[1] + i]\n var opIsDeleted = yield* transaction.isDeleted(id)\n if (opIsDeleted) {\n var delop = {\n struct: 'Delete',\n target: id\n }\n yield* this.tryExecute.call(transaction, delop)\n }\n }\n }\n }\n }\n whenTransactionsFinished () {\n if (this.transactionInProgress) {\n if (this.transactionsFinished == null) {\n var resolve\n var promise = new Promise(function (r) {\n resolve = r\n })\n this.transactionsFinished = {\n resolve: resolve,\n promise: promise\n }\n return promise\n } else {\n return this.transactionsFinished.promise\n }\n } else {\n return Promise.resolve()\n }\n }\n // Check if there is another transaction request.\n // * the last transaction is always a flush :)\n getNextRequest () {\n if (this.waitingTransactions.length === 0) {\n if (this.transactionIsFlushed) {\n this.transactionInProgress = false\n this.transactionIsFlushed = false\n if (this.transactionsFinished != null) {\n this.transactionsFinished.resolve()\n this.transactionsFinished = null\n }\n return null\n } else {\n this.transactionIsFlushed = true\n return function * () {\n yield* this.flush()\n }\n }\n } else {\n this.transactionIsFlushed = false\n return this.waitingTransactions.shift()\n }\n }\n requestTransaction (makeGen/* :any */, callImmediately) {\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n setTimeout(() => {\n this.transact(this.getNextRequest())\n }, 0)\n }\n }\n }\n Y.AbstractDatabase = AbstractDatabase\n}\n","/* @flow */\n'use strict'\n\n/*\n An operation also defines the structure of a type. This is why operation and\n structure are used interchangeably here.\n\n It must be of the type Object. I hope to achieve some performance\n improvements when working on databases that support the json format.\n\n An operation must have the following properties:\n\n * encode\n - Encode the structure in a readable format (preferably string- todo)\n * decode (todo)\n - decode structure to json\n * execute\n - Execute the semantics of an operation.\n * requiredOps\n - Operations that are required to execute this operation.\n*/\nmodule.exports = function (Y/* :any */) {\n var Struct = {\n /* This is the only operation that is actually not a structure, because\n it is not stored in the OS. This is why it _does not_ have an id\n\n op = {\n target: Id\n }\n */\n Delete: {\n encode: function (op) {\n return op\n },\n requiredOps: function (op) {\n return [] // [op.target]\n },\n execute: function * (op) {\n return yield* this.deleteOperation(op.target, op.length || 1)\n }\n },\n Insert: {\n /* {\n content: [any],\n opContent: Id,\n id: Id,\n left: Id,\n origin: Id,\n right: Id,\n parent: Id,\n parentSub: string (optional), // child of Map type\n }\n */\n encode: function (op/* :Insertion */) /* :Insertion */ {\n // TODO: you could not send the \"left\" property, then you also have to\n // \"op.left = null\" in $execute or $decode\n var e/* :any */ = {\n id: op.id,\n left: op.left,\n right: op.right,\n origin: op.origin,\n parent: op.parent,\n struct: op.struct\n }\n if (op.parentSub != null) {\n e.parentSub = op.parentSub\n }\n if (op.hasOwnProperty('opContent')) {\n e.opContent = op.opContent\n } else {\n e.content = op.content.slice()\n }\n\n return e\n },\n requiredOps: function (op) {\n var ids = []\n if (op.left != null) {\n ids.push(op.left)\n }\n if (op.right != null) {\n ids.push(op.right)\n }\n if (op.origin != null && !Y.utils.compareIds(op.left, op.origin)) {\n ids.push(op.origin)\n }\n // if (op.right == null && op.left == null) {\n ids.push(op.parent)\n\n if (op.opContent != null) {\n ids.push(op.opContent)\n }\n return ids\n },\n getDistanceToOrigin: function * (op) {\n if (op.left == null) {\n return 0\n } else {\n var d = 0\n var o = yield* this.getInsertion(op.left)\n while (!Y.utils.matchesId(o, op.origin)) {\n d++\n if (o.left == null) {\n break\n } else {\n o = yield* this.getInsertion(o.left)\n }\n }\n return d\n }\n },\n /*\n # $this has to find a unique position between origin and the next known character\n # case 1: $origin equals $o.origin: the $creator parameter decides if left or right\n # let $OL= [o1,o2,o3,o4], whereby $this is to be inserted between o1 and o4\n # o2,o3 and o4 origin is 1 (the position of o2)\n # there is the case that $this.creator < o2.creator, but o3.creator < $this.creator\n # then o2 knows o3. Since on another client $OL could be [o1,o3,o4] the problem is complex\n # therefore $this would be always to the right of o3\n # case 2: $origin < $o.origin\n # if current $this insert_position > $o origin: $this ins\n # else $insert_position will not change\n # (maybe we encounter case 1 later, then this will be to the right of $o)\n # case 3: $origin > $o.origin\n # $this insert_position is to the left of $o (forever!)\n */\n execute: function * (op) {\n var i // loop counter\n\n // during this function some ops may get split into two pieces (e.g. with getInsertionCleanEnd)\n // We try to merge them later, if possible\n var tryToRemergeLater = []\n\n if (op.origin != null) { // TODO: !== instead of !=\n // we save in origin that op originates in it\n // we need that later when we eventually garbage collect origin (see transaction)\n var origin = yield* this.getInsertionCleanEnd(op.origin)\n if (origin.originOf == null) {\n origin.originOf = []\n }\n origin.originOf.push(op.id)\n yield* this.setOperation(origin)\n if (origin.right != null) {\n tryToRemergeLater.push(origin.right)\n }\n }\n var distanceToOrigin = i = yield* Struct.Insert.getDistanceToOrigin.call(this, op) // most cases: 0 (starts from 0)\n\n // now we begin to insert op in the list of insertions..\n var o\n var parent\n var start\n\n // find o. o is the first conflicting operation\n if (op.left != null) {\n o = yield* this.getInsertionCleanEnd(op.left)\n if (!Y.utils.compareIds(op.left, op.origin) && o.right != null) {\n // only if not added previously\n tryToRemergeLater.push(o.right)\n }\n o = (o.right == null) ? null : yield* this.getOperation(o.right)\n } else { // left == null\n parent = yield* this.getOperation(op.parent)\n let startId = op.parentSub ? parent.map[op.parentSub] : parent.start\n start = startId == null ? null : yield* this.getOperation(startId)\n o = start\n }\n\n // make sure to split op.right if necessary (also add to tryCombineWithLeft)\n if (op.right != null) {\n tryToRemergeLater.push(op.right)\n yield* this.getInsertionCleanStart(op.right)\n }\n\n // handle conflicts\n while (true) {\n if (o != null && !Y.utils.compareIds(o.id, op.right)) {\n var oOriginDistance = yield* Struct.Insert.getDistanceToOrigin.call(this, o)\n if (oOriginDistance === i) {\n // case 1\n if (o.id[0] < op.id[0]) {\n op.left = Y.utils.getLastId(o)\n distanceToOrigin = i + 1 // just ignore o.content.length, doesn't make a difference\n }\n } else if (oOriginDistance < i) {\n // case 2\n if (i - distanceToOrigin <= oOriginDistance) {\n op.left = Y.utils.getLastId(o)\n distanceToOrigin = i + 1 // just ignore o.content.length, doesn't make a difference\n }\n } else {\n break\n }\n i++\n if (o.right != null) {\n o = yield* this.getInsertion(o.right)\n } else {\n o = null\n }\n } else {\n break\n }\n }\n\n // reconnect..\n var left = null\n var right = null\n if (parent == null) {\n parent = yield* this.getOperation(op.parent)\n }\n\n // reconnect left and set right of op\n if (op.left != null) {\n left = yield* this.getInsertion(op.left)\n // link left\n op.right = left.right\n left.right = op.id\n\n yield* this.setOperation(left)\n } else {\n // set op.right from parent, if necessary\n op.right = op.parentSub ? parent.map[op.parentSub] || null : parent.start\n }\n // reconnect right\n if (op.right != null) {\n // TODO: wanna connect right too?\n right = yield* this.getOperation(op.right)\n right.left = Y.utils.getLastId(op)\n\n // if right exists, and it is supposed to be gc'd. Remove it from the gc\n if (right.gc != null) {\n if (right.content != null && right.content.length > 1) {\n right = yield* this.getInsertionCleanEnd(right.id)\n }\n this.store.removeFromGarbageCollector(right)\n }\n yield* this.setOperation(right)\n }\n\n // update parents .map/start/end properties\n if (op.parentSub != null) {\n if (left == null) {\n parent.map[op.parentSub] = op.id\n yield* this.setOperation(parent)\n }\n // is a child of a map struct.\n // Then also make sure that only the most left element is not deleted\n // We do not call the type in this case (this is what the third parameter is for)\n if (op.right != null) {\n yield* this.deleteOperation(op.right, 1, true)\n }\n if (op.left != null) {\n yield* this.deleteOperation(op.id, 1, true)\n }\n } else {\n if (right == null || left == null) {\n if (right == null) {\n parent.end = Y.utils.getLastId(op)\n }\n if (left == null) {\n parent.start = op.id\n }\n yield* this.setOperation(parent)\n }\n }\n\n // try to merge original op.left and op.origin\n for (let i = 0; i < tryToRemergeLater.length; i++) {\n var m = yield* this.getOperation(tryToRemergeLater[i])\n yield* this.tryCombineWithLeft(m)\n }\n }\n },\n List: {\n /*\n {\n start: null,\n end: null,\n struct: \"List\",\n type: \"\",\n id: this.os.getNextOpId(1)\n }\n */\n create: function (id) {\n return {\n start: null,\n end: null,\n struct: 'List',\n id: id\n }\n },\n encode: function (op) {\n var e = {\n struct: 'List',\n id: op.id,\n type: op.type\n }\n if (op.requires != null) {\n e.requires = op.requires\n }\n if (op.info != null) {\n e.info = op.info\n }\n return e\n },\n requiredOps: function () {\n /*\n var ids = []\n if (op.start != null) {\n ids.push(op.start)\n }\n if (op.end != null){\n ids.push(op.end)\n }\n return ids\n */\n return []\n },\n execute: function * (op) {\n op.start = null\n op.end = null\n },\n ref: function * (op, pos) {\n if (op.start == null) {\n return null\n }\n var res = null\n var o = yield* this.getOperation(op.start)\n\n while (true) {\n if (!o.deleted) {\n res = o\n pos--\n }\n if (pos >= 0 && o.right != null) {\n o = yield* this.getOperation(o.right)\n } else {\n break\n }\n }\n return res\n },\n map: function * (o, f) {\n o = o.start\n var res = []\n while (o != null) { // TODO: change to != (at least some convention)\n var operation = yield* this.getOperation(o)\n if (!operation.deleted) {\n res.push(f(operation))\n }\n o = operation.right\n }\n return res\n }\n },\n Map: {\n /*\n {\n map: {},\n struct: \"Map\",\n type: \"\",\n id: this.os.getNextOpId(1)\n }\n */\n create: function (id) {\n return {\n id: id,\n map: {},\n struct: 'Map'\n }\n },\n encode: function (op) {\n var e = {\n struct: 'Map',\n type: op.type,\n id: op.id,\n map: {} // overwrite map!!\n }\n if (op.requires != null) {\n e.requires = op.requires\n }\n if (op.info != null) {\n e.info = op.info\n }\n return e\n },\n requiredOps: function () {\n return []\n },\n execute: function * () {},\n /*\n Get a property by name\n */\n get: function * (op, name) {\n var oid = op.map[name]\n if (oid != null) {\n var res = yield* this.getOperation(oid)\n if (res == null || res.deleted) {\n return void 0\n } else if (res.opContent == null) {\n return res.content[0]\n } else {\n return yield* this.getType(res.opContent)\n }\n }\n }\n }\n }\n Y.Struct = Struct\n}\n","/* @flow */\n'use strict'\n\n/*\n Partial definition of a transaction\n\n A transaction provides all the the async functionality on a database.\n\n By convention, a transaction has the following properties:\n * ss for StateSet\n * os for OperationStore\n * ds for DeleteStore\n\n A transaction must also define the following methods:\n * checkDeleteStoreForState(state)\n - When increasing the state of a user, an operation with an higher id\n may already be garbage collected, and therefore it will never be received.\n update the state to reflect this knowledge. This won't call a method to save the state!\n * getDeleteSet(id)\n - Get the delete set in a readable format:\n {\n \"userX\": [\n [5,1], // starting from position 5, one operations is deleted\n [9,4] // starting from position 9, four operations are deleted\n ],\n \"userY\": ...\n }\n * getOpsFromDeleteSet(ds) -- TODO: just call this.deleteOperation(id) here\n - get a set of deletions that need to be applied in order to get to\n achieve the state of the supplied ds\n * setOperation(op)\n - write `op` to the database.\n Note: this is allowed to return an in-memory object.\n E.g. the Memory adapter returns the object that it has in-memory.\n Changing values on this object will be stored directly in the database\n without calling this function. Therefore,\n setOperation may have no functionality in some adapters. This also has\n implications on the way we use operations that were served from the database.\n We try not to call copyObject, if not necessary.\n * addOperation(op)\n - add an operation to the database.\n This may only be called once for every op.id\n Must return a function that returns the next operation in the database (ordered by id)\n * getOperation(id)\n * removeOperation(id)\n - remove an operation from the database. This is called when an operation\n is garbage collected.\n * setState(state)\n - `state` is of the form\n {\n user: \"1\",\n clock: 4\n } <- meaning that we have four operations from user \"1\"\n (with these id's respectively: 0, 1, 2, and 3)\n * getState(user)\n * getStateVector()\n - Get the state of the OS in the form\n [{\n user: \"userX\",\n clock: 11\n },\n ..\n ]\n * getStateSet()\n - Get the state of the OS in the form\n {\n \"userX\": 11,\n \"userY\": 22\n }\n * getOperations(startSS)\n - Get the all the operations that are necessary in order to achive the\n stateSet of this user, starting from a stateSet supplied by another user\n * makeOperationReady(ss, op)\n - this is called only by `getOperations(startSS)`. It makes an operation\n applyable on a given SS.\n*/\nmodule.exports = function (Y/* :any */) {\n class TransactionInterface {\n /* ::\n store: Y.AbstractDatabase;\n ds: Store;\n os: Store;\n ss: Store;\n */\n /*\n Get a type based on the id of its model.\n If it does not exist yes, create it.\n TODO: delete type from store.initializedTypes[id] when corresponding id was deleted!\n */\n * getType (id, args) {\n var sid = JSON.stringify(id)\n var t = this.store.initializedTypes[sid]\n if (t == null) {\n var op/* :MapStruct | ListStruct */ = yield* this.getOperation(id)\n if (op != null) {\n t = yield* Y[op.type].typeDefinition.initType.call(this, this.store, op, args)\n this.store.initializedTypes[sid] = t\n }\n }\n return t\n }\n * createType (typedefinition, id) {\n var structname = typedefinition[0].struct\n id = id || this.store.getNextOpId(1)\n var op\n if (id[0] === '_') {\n op = yield* this.getOperation(id)\n } else {\n op = Y.Struct[structname].create(id)\n op.type = typedefinition[0].name\n }\n if (typedefinition[0].appendAdditionalInfo != null) {\n yield* typedefinition[0].appendAdditionalInfo.call(this, op, typedefinition[1])\n }\n if (op[0] === '_') {\n yield* this.setOperation(op)\n } else {\n yield* this.applyCreatedOperations([op])\n }\n return yield* this.getType(id, typedefinition[1])\n }\n /* createType (typedefinition, id) {\n var structname = typedefinition[0].struct\n id = id || this.store.getNextOpId(1)\n var op = Y.Struct[structname].create(id)\n op.type = typedefinition[0].name\n if (typedefinition[0].appendAdditionalInfo != null) {\n yield* typedefinition[0].appendAdditionalInfo.call(this, op, typedefinition[1])\n }\n // yield* this.applyCreatedOperations([op])\n yield* Y.Struct[op.struct].execute.call(this, op)\n yield* this.addOperation(op)\n yield* this.store.operationAdded(this, op)\n return yield* this.getType(id, typedefinition[1])\n }*/\n /*\n Apply operations that this user created (no remote ones!)\n * does not check for Struct.*.requiredOps()\n * also broadcasts it through the connector\n */\n * applyCreatedOperations (ops) {\n var send = []\n for (var i = 0; i < ops.length; i++) {\n var op = ops[i]\n yield* this.store.tryExecute.call(this, op)\n if (op.id == null || typeof op.id[1] !== 'string') {\n send.push(Y.Struct[op.struct].encode(op))\n }\n }\n if (!this.store.y.connector.isDisconnected() && send.length > 0) { // TODO: && !this.store.forwardAppliedOperations (but then i don't send delete ops)\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcastOps(send)\n }\n }\n\n * deleteList (start) {\n while (start != null) {\n start = yield* this.getOperation(start)\n if (!start.gc) {\n start.gc = true\n start.deleted = true\n yield* this.setOperation(start)\n var delLength = start.content != null ? start.content.length : 1\n yield* this.markDeleted(start.id, delLength)\n if (start.opContent != null) {\n yield* this.deleteOperation(start.opContent)\n }\n this.store.queueGarbageCollector(start.id)\n }\n start = start.right\n }\n }\n\n /*\n Mark an operation as deleted, and add it to the GC, if possible.\n */\n * deleteOperation (targetId, length, preventCallType) /* :Generator */ {\n if (length == null) {\n length = 1\n }\n yield* this.markDeleted(targetId, length)\n while (length > 0) {\n var callType = false\n var target = yield* this.os.findWithUpperBound([targetId[0], targetId[1] + length - 1])\n var targetLength = target != null && target.content != null ? target.content.length : 1\n if (target == null || target.id[0] !== targetId[0] || target.id[1] + targetLength <= targetId[1]) {\n // does not exist or is not in the range of the deletion\n target = null\n length = 0\n } else {\n // does exist, check if it is too long\n if (!target.deleted) {\n if (target.id[1] < targetId[1]) {\n // starts to the left of the deletion range\n target = yield* this.getInsertionCleanStart(targetId)\n targetLength = target.content.length // must have content property!\n }\n if (target.id[1] + targetLength > targetId[1] + length) {\n // ends to the right of the deletion range\n target = yield* this.getInsertionCleanEnd([targetId[0], targetId[1] + length - 1])\n targetLength = target.content.length\n }\n }\n length = target.id[1] - targetId[1]\n }\n\n if (target != null) {\n if (!target.deleted) {\n callType = true\n // set deleted & notify type\n target.deleted = true\n // delete containing lists\n if (target.start != null) {\n // TODO: don't do it like this .. -.-\n yield* this.deleteList(target.start)\n // yield* this.deleteList(target.id) -- do not gc itself because this may still get referenced\n }\n if (target.map != null) {\n for (var name in target.map) {\n yield* this.deleteList(target.map[name])\n }\n // TODO: here to.. (see above)\n // yield* this.deleteList(target.id) -- see above\n }\n if (target.opContent != null) {\n yield* this.deleteOperation(target.opContent)\n // target.opContent = null\n }\n if (target.requires != null) {\n for (var i = 0; i < target.requires.length; i++) {\n yield* this.deleteOperation(target.requires[i])\n }\n }\n }\n var left\n if (target.left != null) {\n left = yield* this.getInsertion(target.left)\n } else {\n left = null\n }\n\n // set here because it was deleted and/or gc'd\n yield* this.setOperation(target)\n\n /*\n Check if it is possible to add right to the gc.\n Because this delete can't be responsible for left being gc'd,\n we don't have to add left to the gc..\n */\n var right\n if (target.right != null) {\n right = yield* this.getOperation(target.right)\n } else {\n right = null\n }\n if (callType && !preventCallType) {\n yield* this.store.operationAdded(this, {\n struct: 'Delete',\n target: target.id,\n length: targetLength\n })\n }\n // need to gc in the end!\n yield* this.store.addToGarbageCollector.call(this, target, left)\n if (right != null) {\n yield* this.store.addToGarbageCollector.call(this, right, target)\n }\n }\n }\n }\n /*\n Mark an operation as deleted&gc'd\n */\n * markGarbageCollected (id, len) {\n // this.mem.push([\"gc\", id]);\n this.store.addToDebug('yield* this.markGarbageCollected(', id, ', ', len, ')')\n var n = yield* this.markDeleted(id, len)\n if (n.id[1] < id[1] && !n.gc) {\n // un-extend left\n var newlen = n.len - (id[1] - n.id[1])\n n.len -= newlen\n yield* this.ds.put(n)\n n = {id: id, len: newlen, gc: false}\n yield* this.ds.put(n)\n }\n // get prev&next before adding a new operation\n var prev = yield* this.ds.findPrev(id)\n var next = yield* this.ds.findNext(id)\n\n if (id[1] + len < n.id[1] + n.len && !n.gc) {\n // un-extend right\n yield* this.ds.put({id: [id[0], id[1] + len], len: n.len - len, gc: false})\n n.len = len\n }\n // set gc'd\n n.gc = true\n // can extend left?\n if (\n prev != null &&\n prev.gc &&\n Y.utils.compareIds([prev.id[0], prev.id[1] + prev.len], n.id)\n ) {\n prev.len += n.len\n yield* this.ds.delete(n.id)\n n = prev\n // ds.put n here?\n }\n // can extend right?\n if (\n next != null &&\n next.gc &&\n Y.utils.compareIds([n.id[0], n.id[1] + n.len], next.id)\n ) {\n n.len += next.len\n yield* this.ds.delete(next.id)\n }\n yield* this.ds.put(n)\n yield* this.updateState(n.id[0])\n }\n /*\n Mark an operation as deleted.\n\n returns the delete node\n */\n * markDeleted (id, length) {\n if (length == null) {\n length = 1\n }\n // this.mem.push([\"del\", id]);\n var n = yield* this.ds.findWithUpperBound(id)\n if (n != null && n.id[0] === id[0]) {\n if (n.id[1] <= id[1] && id[1] <= n.id[1] + n.len) {\n // id is in n's range\n var diff = id[1] + length - (n.id[1] + n.len) // overlapping right\n if (diff > 0) {\n // id+length overlaps n\n if (!n.gc) {\n n.len += diff\n } else {\n diff = n.id[1] + n.len - id[1] // overlapping left (id till n.end)\n if (diff < length) {\n // a partial deletion\n n = {id: [id[0], id[1] + diff], len: length - diff, gc: false}\n yield* this.ds.put(n)\n } else {\n // already gc'd\n throw new Error('Cannot happen! (it dit though.. :()')\n // return n\n }\n }\n } else {\n // no overlapping, already deleted\n return n\n }\n } else {\n // cannot extend left (there is no left!)\n n = {id: id, len: length, gc: false}\n yield* this.ds.put(n) // TODO: you double-put !!\n }\n } else {\n // cannot extend left\n n = {id: id, len: length, gc: false}\n yield* this.ds.put(n)\n }\n // can extend right?\n var next = yield* this.ds.findNext(n.id)\n if (\n next != null &&\n n.id[0] === next.id[0] &&\n n.id[1] + n.len >= next.id[1]\n ) {\n diff = n.id[1] + n.len - next.id[1] // from next.start to n.end\n while (diff >= 0) {\n // n overlaps with next\n if (next.gc) {\n // gc is stronger, so reduce length of n\n n.len -= diff\n if (diff >= next.len) {\n // delete the missing range after next\n diff = diff - next.len // missing range after next\n if (diff > 0) {\n yield* this.ds.put(n) // unneccessary? TODO!\n yield* this.markDeleted([next.id[0], next.id[1] + next.len], diff)\n }\n }\n break\n } else {\n // we can extend n with next\n if (diff > next.len) {\n // n is even longer than next\n // get next.next, and try to extend it\n var _next = yield* this.ds.findNext(next.id)\n yield* this.ds.delete(next.id)\n if (_next == null || n.id[0] !== _next.id[0]) {\n break\n } else {\n next = _next\n diff = n.id[1] + n.len - next.id[1] // from next.start to n.end\n // continue!\n }\n } else {\n // n just partially overlaps with next. extend n, delete next, and break this loop\n n.len += next.len - diff\n yield* this.ds.delete(next.id)\n break\n }\n }\n }\n }\n yield* this.ds.put(n)\n return n\n }\n /*\n Call this method when the client is connected&synced with the\n other clients (e.g. master). This will query the database for\n operations that can be gc'd and add them to the garbage collector.\n */\n * garbageCollectAfterSync () {\n if (this.store.gc1.length > 0 || this.store.gc2.length > 0) {\n console.warn('gc should be empty after sync')\n }\n yield* this.os.iterate(this, null, null, function * (op) {\n if (op.gc) {\n delete op.gc\n yield* this.setOperation(op)\n }\n if (op.parent != null) {\n var parentDeleted = yield* this.isDeleted(op.parent)\n if (parentDeleted) {\n op.gc = true\n if (!op.deleted) {\n yield* this.markDeleted(op.id, op.content != null ? op.content.length : 1)\n op.deleted = true\n if (op.opContent != null) {\n yield* this.deleteOperation(op.opContent)\n }\n if (op.requires != null) {\n for (var i = 0; i < op.requires.length; i++) {\n yield* this.deleteOperation(op.requires[i])\n }\n }\n }\n yield* this.setOperation(op)\n this.store.gc1.push(op.id) // this is ok becaues its shortly before sync (otherwise use queueGarbageCollector!)\n return\n }\n }\n if (op.deleted) {\n var left = null\n if (op.left != null) {\n left = yield* this.getInsertion(op.left)\n }\n yield* this.store.addToGarbageCollector.call(this, op, left)\n }\n })\n }\n /*\n Really remove an op and all its effects.\n The complicated case here is the Insert operation:\n * reset left\n * reset right\n * reset parent.start\n * reset parent.end\n * reset origins of all right ops\n */\n * garbageCollectOperation (id) {\n this.store.addToDebug('yield* this.garbageCollectOperation(', id, ')')\n var o = yield* this.getOperation(id)\n yield* this.markGarbageCollected(id, (o != null && o.content != null) ? o.content.length : 1) // always mark gc'd\n // if op exists, then clean that mess up..\n if (o != null) {\n var deps = []\n if (o.opContent != null) {\n deps.push(o.opContent)\n }\n if (o.requires != null) {\n deps = deps.concat(o.requires)\n }\n for (var i = 0; i < deps.length; i++) {\n var dep = yield* this.getOperation(deps[i])\n if (dep != null) {\n if (!dep.deleted) {\n yield* this.deleteOperation(dep.id)\n dep = yield* this.getOperation(dep.id)\n }\n dep.gc = true\n yield* this.setOperation(dep)\n this.store.queueGarbageCollector(dep.id)\n } else {\n yield* this.markGarbageCollected(deps[i], 1)\n }\n }\n\n // remove gc'd op from the left op, if it exists\n if (o.left != null) {\n var left = yield* this.getInsertion(o.left)\n left.right = o.right\n yield* this.setOperation(left)\n }\n // remove gc'd op from the right op, if it exists\n // also reset origins of right ops\n if (o.right != null) {\n var right = yield* this.getOperation(o.right)\n right.left = o.left\n\n if (o.originOf != null && o.originOf.length > 0) {\n // find new origin of right ops\n // origin is the first left deleted operation\n var neworigin = o.left\n var neworigin_ = null\n while (neworigin != null) {\n neworigin_ = yield* this.getInsertion(neworigin)\n if (neworigin_.deleted) {\n break\n }\n neworigin = neworigin_.left\n }\n\n // reset origin of all right ops (except first right - duh!),\n\n /* ** The following code does not rely on the the originOf property **\n I recently added originOf to all Insert Operations (see Struct.Insert.execute),\n which saves which operations originate in a Insert operation.\n Garbage collecting without originOf is more memory efficient, but is nearly impossible for large texts, or lists!\n But I keep this code for now\n ```\n // reset origin of right\n right.origin = neworigin\n // search until you find origin pointer to the left of o\n if (right.right != null) {\n var i = yield* this.getOperation(right.right)\n var ids = [o.id, o.right]\n while (ids.some(function (id) {\n return Y.utils.compareIds(id, i.origin)\n })) {\n if (Y.utils.compareIds(i.origin, o.id)) {\n // reset origin of i\n i.origin = neworigin\n yield* this.setOperation(i)\n }\n // get next i\n if (i.right == null) {\n break\n } else {\n ids.push(i.id)\n i = yield* this.getOperation(i.right)\n }\n }\n }\n ```\n */\n // ** Now the new implementation starts **\n // reset neworigin of all originOf[*]\n for (var _i in o.originOf) {\n var originsIn = yield* this.getOperation(o.originOf[_i])\n if (originsIn != null) {\n originsIn.origin = neworigin\n yield* this.setOperation(originsIn)\n }\n }\n if (neworigin != null) {\n if (neworigin_.originOf == null) {\n neworigin_.originOf = o.originOf\n } else {\n neworigin_.originOf = o.originOf.concat(neworigin_.originOf)\n }\n yield* this.setOperation(neworigin_)\n }\n // we don't need to set right here, because\n // right should be in o.originOf => it is set it the previous for loop\n } else {\n // we didn't need to reset the origin of right\n // so we have to set right here\n yield* this.setOperation(right)\n }\n }\n // o may originate in another operation.\n // Since o is deleted, we have to reset o.origin's `originOf` property\n if (o.origin != null) {\n var origin = yield* this.getInsertion(o.origin)\n origin.originOf = origin.originOf.filter(function (_id) {\n return !Y.utils.compareIds(id, _id)\n })\n yield* this.setOperation(origin)\n }\n var parent\n if (o.parent != null) {\n parent = yield* this.getOperation(o.parent)\n }\n // remove gc'd op from parent, if it exists\n if (parent != null) {\n var setParent = false // whether to save parent to the os\n if (o.parentSub != null) {\n if (Y.utils.compareIds(parent.map[o.parentSub], o.id)) {\n setParent = true\n if (o.right != null) {\n parent.map[o.parentSub] = o.right\n } else {\n delete parent.map[o.parentSub]\n }\n }\n } else {\n if (Y.utils.compareIds(parent.start, o.id)) {\n // gc'd op is the start\n setParent = true\n parent.start = o.right\n }\n if (Y.utils.matchesId(o, parent.end)) {\n // gc'd op is the end\n setParent = true\n parent.end = o.left\n }\n }\n if (setParent) {\n yield* this.setOperation(parent)\n }\n }\n // finally remove it from the os\n yield* this.removeOperation(o.id)\n }\n }\n * checkDeleteStoreForState (state) {\n var n = yield* this.ds.findWithUpperBound([state.user, state.clock])\n if (n != null && n.id[0] === state.user && n.gc) {\n state.clock = Math.max(state.clock, n.id[1] + n.len)\n }\n }\n * updateState (user) {\n var state = yield* this.getState(user)\n yield* this.checkDeleteStoreForState(state)\n var o = yield* this.getInsertion([user, state.clock])\n var oLength = (o != null && o.content != null) ? o.content.length : 1\n while (o != null && user === o.id[0] && o.id[1] <= state.clock && o.id[1] + oLength > state.clock) {\n // either its a new operation (1. case), or it is an operation that was deleted, but is not yet in the OS\n state.clock += oLength\n yield* this.checkDeleteStoreForState(state)\n o = yield* this.os.findNext(o.id)\n oLength = (o != null && o.content != null) ? o.content.length : 1\n }\n yield* this.setState(state)\n }\n /*\n apply a delete set in order to get\n the state of the supplied ds\n */\n * applyDeleteSet (ds) {\n var deletions = []\n\n for (var user in ds) {\n var dv = ds[user]\n var pos = 0\n var d = dv[pos]\n yield* this.ds.iterate(this, [user, 0], [user, Number.MAX_VALUE], function * (n) {\n // cases:\n // 1. d deletes something to the right of n\n // => go to next n (break)\n // 2. d deletes something to the left of n\n // => create deletions\n // => reset d accordingly\n // *)=> if d doesn't delete anything anymore, go to next d (continue)\n // 3. not 2) and d deletes something that also n deletes\n // => reset d so that it doesn't contain n's deletion\n // *)=> if d does not delete anything anymore, go to next d (continue)\n while (d != null) {\n var diff = 0 // describe the diff of length in 1) and 2)\n if (n.id[1] + n.len <= d[0]) {\n // 1)\n break\n } else if (d[0] < n.id[1]) {\n // 2)\n // delete maximum the len of d\n // else delete as much as possible\n diff = Math.min(n.id[1] - d[0], d[1])\n deletions.push([user, d[0], diff, d[2]])\n } else {\n // 3)\n diff = n.id[1] + n.len - d[0] // never null (see 1)\n if (d[2] && !n.gc) {\n // d marks as gc'd but n does not\n // then delete either way\n deletions.push([user, d[0], Math.min(diff, d[1]), d[2]])\n }\n }\n if (d[1] <= diff) {\n // d doesn't delete anything anymore\n d = dv[++pos]\n } else {\n d[0] = d[0] + diff // reset pos\n d[1] = d[1] - diff // reset length\n }\n }\n })\n // for the rest.. just apply it\n for (; pos < dv.length; pos++) {\n d = dv[pos]\n deletions.push([user, d[0], d[1], d[2]])\n }\n }\n for (var i = 0; i < deletions.length; i++) {\n var del = deletions[i]\n // always try to delete..\n yield* this.deleteOperation([del[0], del[1]], del[2])\n if (del[3]) {\n // gc..\n yield* this.markGarbageCollected([del[0], del[1]], del[2]) // always mark gc'd\n // remove operation..\n var counter = del[1] + del[2]\n while (counter >= del[1]) {\n var o = yield* this.os.findWithUpperBound([del[0], counter - 1])\n if (o == null) {\n break\n }\n var oLen = o.content != null ? o.content.length : 1\n if (o.id[0] !== del[0] || o.id[1] + oLen <= del[1]) {\n // not in range\n break\n }\n if (o.id[1] + oLen > del[1] + del[2]) {\n // overlaps right\n o = yield* this.getInsertionCleanEnd([del[0], del[1] + del[2] - 1])\n }\n if (o.id[1] < del[1]) {\n // overlaps left\n o = yield* this.getInsertionCleanStart([del[0], del[1]])\n }\n counter = o.id[1]\n yield* this.garbageCollectOperation(o.id)\n }\n }\n if (this.store.forwardAppliedOperations) {\n var ops = []\n ops.push({struct: 'Delete', target: [d[0], d[1]], length: del[2]})\n this.store.y.connector.broadcastOps(ops)\n }\n }\n }\n * isGarbageCollected (id) {\n var n = yield* this.ds.findWithUpperBound(id)\n return n != null && n.id[0] === id[0] && id[1] < n.id[1] + n.len && n.gc\n }\n /*\n A DeleteSet (ds) describes all the deleted ops in the OS\n */\n * getDeleteSet () {\n var ds = {}\n yield* this.ds.iterate(this, null, null, function * (n) {\n var user = n.id[0]\n var counter = n.id[1]\n var len = n.len\n var gc = n.gc\n var dv = ds[user]\n if (dv === void 0) {\n dv = []\n ds[user] = dv\n }\n dv.push([counter, len, gc])\n })\n return ds\n }\n * isDeleted (id) {\n var n = yield* this.ds.findWithUpperBound(id)\n return n != null && n.id[0] === id[0] && id[1] < n.id[1] + n.len\n }\n * setOperation (op) {\n yield* this.os.put(op)\n return op\n }\n * addOperation (op) {\n yield* this.os.put(op)\n if (!this.store.y.connector.isDisconnected() && this.store.forwardAppliedOperations && typeof op.id[1] !== 'string') {\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcastOps([op])\n }\n }\n // if insertion, try to combine with left insertion (if both have content property)\n * tryCombineWithLeft (op) {\n if (\n op != null &&\n op.left != null &&\n op.content != null &&\n op.left[0] === op.id[0] &&\n Y.utils.compareIds(op.left, op.origin)\n ) {\n var left = yield* this.getInsertion(op.left)\n if (left.content != null &&\n left.id[1] + left.content.length === op.id[1] &&\n left.originOf.length === 1 &&\n !left.gc && !left.deleted &&\n !op.gc && !op.deleted\n ) {\n // combine!\n if (op.originOf != null) {\n left.originOf = op.originOf\n } else {\n delete left.originOf\n }\n left.content = left.content.concat(op.content)\n left.right = op.right\n yield* this.os.delete(op.id)\n yield* this.setOperation(left)\n }\n }\n }\n * getInsertion (id) {\n var ins = yield* this.os.findWithUpperBound(id)\n if (ins == null) {\n return null\n } else {\n var len = ins.content != null ? ins.content.length : 1 // in case of opContent\n if (id[0] === ins.id[0] && id[1] < ins.id[1] + len) {\n return ins\n } else {\n return null\n }\n }\n }\n * getInsertionCleanStartEnd (id) {\n yield* this.getInsertionCleanStart(id)\n return yield* this.getInsertionCleanEnd(id)\n }\n // Return an insertion such that id is the first element of content\n // This function manipulates an operation, if necessary\n * getInsertionCleanStart (id) {\n var ins = yield* this.getInsertion(id)\n if (ins != null) {\n if (ins.id[1] === id[1]) {\n return ins\n } else {\n var left = Y.utils.copyObject(ins)\n ins.content = left.content.splice(id[1] - ins.id[1])\n ins.id = id\n var leftLid = Y.utils.getLastId(left)\n ins.origin = leftLid\n left.originOf = [ins.id]\n left.right = ins.id\n ins.left = leftLid\n // debugger // check\n yield* this.setOperation(left)\n yield* this.setOperation(ins)\n if (left.gc) {\n this.store.queueGarbageCollector(ins.id)\n }\n return ins\n }\n } else {\n return null\n }\n }\n // Return an insertion such that id is the last element of content\n // This function manipulates an operation, if necessary\n * getInsertionCleanEnd (id) {\n var ins = yield* this.getInsertion(id)\n if (ins != null) {\n if (ins.content == null || (ins.id[1] + ins.content.length - 1 === id[1])) {\n return ins\n } else {\n var right = Y.utils.copyObject(ins)\n right.content = ins.content.splice(id[1] - ins.id[1] + 1) // cut off remainder\n right.id = [id[0], id[1] + 1]\n var insLid = Y.utils.getLastId(ins)\n right.origin = insLid\n ins.originOf = [right.id]\n ins.right = right.id\n right.left = insLid\n // debugger // check\n yield* this.setOperation(right)\n yield* this.setOperation(ins)\n if (ins.gc) {\n this.store.queueGarbageCollector(right.id)\n }\n return ins\n }\n } else {\n return null\n }\n }\n * getOperation (id/* :any */)/* :Transaction */ {\n var o = yield* this.os.find(id)\n if (id[0] !== '_' || o != null) {\n return o\n } else { // type is string\n // generate this operation?\n var comp = id[1].split('_')\n if (comp.length > 1) {\n var struct = comp[0]\n var op = Y.Struct[struct].create(id)\n op.type = comp[1]\n yield* this.setOperation(op)\n return op\n } else {\n // won't be called. but just in case..\n console.error('Unexpected case. How can this happen?')\n debugger // eslint-disable-line\n return null\n }\n }\n }\n * removeOperation (id) {\n yield* this.os.delete(id)\n }\n * setState (state) {\n var val = {\n id: [state.user],\n clock: state.clock\n }\n yield* this.ss.put(val)\n }\n * getState (user) {\n var n = yield* this.ss.find([user])\n var clock = n == null ? null : n.clock\n if (clock == null) {\n clock = 0\n }\n return {\n user: user,\n clock: clock\n }\n }\n * getStateVector () {\n var stateVector = []\n yield* this.ss.iterate(this, null, null, function * (n) {\n stateVector.push({\n user: n.id[0],\n clock: n.clock\n })\n })\n return stateVector\n }\n * getStateSet () {\n var ss = {}\n yield* this.ss.iterate(this, null, null, function * (n) {\n ss[n.id[0]] = n.clock\n })\n return ss\n }\n /*\n Here, we make all missing operations executable for the receiving user.\n\n Notes:\n startSS: denotes to the SV that the remote user sent\n currSS: denotes to the state vector that the user should have if he\n applies all already sent operations (increases is each step)\n\n We face several problems:\n * Execute op as is won't work because ops depend on each other\n -> find a way so that they do not anymore\n * When changing left, must not go more to the left than the origin\n * When changing right, you have to consider that other ops may have op\n as their origin, this means that you must not set one of these ops\n as the new right (interdependencies of ops)\n * can't just go to the right until you find the first known operation,\n With currSS\n -> interdependency of ops is a problem\n With startSS\n -> leads to inconsistencies when two users join at the same time.\n Then the position depends on the order of execution -> error!\n\n Solution:\n -> re-create originial situation\n -> set op.left = op.origin (which never changes)\n -> set op.right\n to the first operation that is known (according to startSS)\n or to the first operation that has an origin that is not to the\n right of op.\n -> Enforces unique execution order -> happy user\n\n Improvements: TODO\n * Could set left to origin, or the first known operation\n (startSS or currSS.. ?)\n -> Could be necessary when I turn GC again.\n -> Is a bad(ish) idea because it requires more computation\n\n What we do:\n * Iterate over all missing operations.\n * When there is an operation, where the right op is known, send this op all missing ops to the left to the user\n * I explained above what we have to do with each operation. Here is how we do it efficiently:\n 1. Go to the left until you find either op.origin, or a known operation (let o denote current operation in the iteration)\n 2. Found a known operation -> set op.left = o, and send it to the user. stop\n 3. Found o = op.origin -> set op.left = op.origin, and send it to the user. start again from 1. (set op = o)\n 4. Found some o -> set o.right = op, o.left = o.origin, send it to the user, continue\n */\n * getOperations (startSS) {\n // TODO: use bounds here!\n if (startSS == null) {\n startSS = {}\n }\n var send = []\n\n var endSV = yield* this.getStateVector()\n for (var endState of endSV) {\n var user = endState.user\n if (user === '_') {\n continue\n }\n var startPos = startSS[user] || 0\n if (startPos > 0) {\n // There is a change that [user, startPos] is in a composed Insertion (with a smaller counter)\n // find out if that is the case\n var firstMissing = yield* this.getInsertion([user, startPos])\n if (firstMissing != null) {\n // update startPos\n startPos = firstMissing.id[1]\n }\n }\n yield* this.os.iterate(this, [user, startPos], [user, Number.MAX_VALUE], function * (op) {\n op = Y.Struct[op.struct].encode(op)\n if (op.struct !== 'Insert') {\n send.push(op)\n } else if (op.right == null || op.right[1] < (startSS[op.right[0]] || 0)) {\n // case 1. op.right is known\n var o = op\n // Remember: ?\n // -> set op.right\n // 1. to the first operation that is known (according to startSS)\n // 2. or to the first operation that has an origin that is not to the\n // right of op.\n // For this we maintain a list of ops which origins are not found yet.\n var missing_origins = [op]\n var newright = op.right\n while (true) {\n if (o.left == null) {\n op.left = null\n send.push(op)\n if (!Y.utils.compareIds(o.id, op.id)) {\n o = Y.Struct[op.struct].encode(o)\n o.right = missing_origins[missing_origins.length - 1].id\n send.push(o)\n }\n break\n }\n o = yield* this.getInsertion(o.left)\n // we set another o, check if we can reduce $missing_origins\n while (missing_origins.length > 0 && Y.utils.matchesId(o, missing_origins[missing_origins.length - 1].origin)) {\n missing_origins.pop()\n }\n if (o.id[1] < (startSS[o.id[0]] || 0)) {\n // case 2. o is known\n op.left = Y.utils.getLastId(o)\n send.push(op)\n break\n } else if (Y.utils.matchesId(o, op.origin)) {\n // case 3. o is op.origin\n op.left = op.origin\n send.push(op)\n op = Y.Struct[op.struct].encode(o)\n op.right = newright\n if (missing_origins.length > 0) {\n console.log('This should not happen .. :( please report this')\n }\n missing_origins = [op]\n } else {\n // case 4. send o, continue to find op.origin\n var s = Y.Struct[op.struct].encode(o)\n s.right = missing_origins[missing_origins.length - 1].id\n s.left = s.origin\n send.push(s)\n missing_origins.push(o)\n }\n }\n }\n })\n }\n return send.reverse()\n }\n /* this is what we used before.. use this as a reference..\n * makeOperationReady (startSS, op) {\n op = Y.Struct[op.struct].encode(op)\n op = Y.utils.copyObject(op) -- use copyoperation instead now!\n var o = op\n var ids = [op.id]\n // search for the new op.right\n // it is either the first known op (according to startSS)\n // or the o that has no origin to the right of op\n // (this is why we use the ids array)\n while (o.right != null) {\n var right = yield* this.getOperation(o.right)\n if (o.right[1] < (startSS[o.right[0]] || 0) || !ids.some(function (id) {\n return Y.utils.compareIds(id, right.origin)\n })) {\n break\n }\n ids.push(o.right)\n o = right\n }\n op.right = o.right\n op.left = op.origin\n return op\n }\n */\n * flush () {\n yield* this.os.flush()\n yield* this.ss.flush()\n yield* this.ds.flush()\n }\n }\n Y.Transaction = TransactionInterface\n}\n","/* @flow */\n'use strict'\n\n/*\n EventHandler is an helper class for constructing custom types.\n\n Why: When constructing custom types, you sometimes want your types to work\n synchronous: E.g.\n ``` Synchronous\n mytype.setSomething(\"yay\")\n mytype.getSomething() === \"yay\"\n ```\n versus\n ``` Asynchronous\n mytype.setSomething(\"yay\")\n mytype.getSomething() === undefined\n mytype.waitForSomething().then(function(){\n mytype.getSomething() === \"yay\"\n })\n ```\n\n The structures usually work asynchronously (you have to wait for the\n database request to finish). EventHandler helps you to make your type\n synchronous.\n*/\nmodule.exports = function (Y /* : any*/) {\n Y.utils = {}\n\n class EventListenerHandler {\n constructor () {\n this.eventListeners = []\n }\n destroy () {\n this.eventListeners = null\n }\n /*\n Basic event listener boilerplate...\n */\n addEventListener (f) {\n this.eventListeners.push(f)\n }\n removeEventListener (f) {\n this.eventListeners = this.eventListeners.filter(function (g) {\n return f !== g\n })\n }\n removeAllEventListeners () {\n this.eventListeners = []\n }\n callEventListeners (event) {\n for (var i = 0; i < this.eventListeners.length; i++) {\n try {\n this.eventListeners[i](event)\n } catch (e) {\n console.error('User events must not throw Errors!')\n }\n }\n }\n }\n Y.utils.EventListenerHandler = EventListenerHandler\n\n class EventHandler extends EventListenerHandler {\n /* ::\n waiting: Array;\n awaiting: number;\n onevent: Function;\n eventListeners: Array;\n */\n /*\n onevent: is called when the structure changes.\n\n Note: \"awaiting opertations\" is used to denote operations that were\n prematurely called. Events for received operations can not be executed until\n all prematurely called operations were executed (\"waiting operations\")\n */\n constructor (onevent /* : Function */) {\n super()\n this.waiting = []\n this.awaiting = 0\n this.onevent = onevent\n }\n destroy () {\n super.destroy()\n this.waiting = null\n this.awaiting = null\n this.onevent = null\n }\n /*\n Call this when a new operation arrives. It will be executed right away if\n there are no waiting operations, that you prematurely executed\n */\n receivedOp (op) {\n if (this.awaiting <= 0) {\n this.onevent(op)\n } else if (op.struct === 'Delete') {\n var self = this\n function checkDelete (d) {\n if (d.length == null) {\n throw new Error('This shouldn\\'t happen! d.length must be defined!')\n }\n // we check if o deletes something in self.waiting\n // if so, we remove the deleted operation\n for (var w = 0; w < self.waiting.length; w++) {\n var i = self.waiting[w]\n if (i.struct === 'Insert' && i.id[0] === d.target[0]) {\n var iLength = i.hasOwnProperty('content') ? i.content.length : 1\n var dStart = d.target[1]\n var dEnd = d.target[1] + (d.length || 1)\n var iStart = i.id[1]\n var iEnd = i.id[1] + iLength\n // Check if they don't overlap\n if (iEnd <= dStart || dEnd <= iStart) {\n // no overlapping\n continue\n }\n // we check all overlapping cases. All cases:\n /*\n 1) iiiii\n ddddd\n --> modify i and d\n 2) iiiiiii\n ddddd\n --> modify i, remove d\n 3) iiiiiii\n ddd\n --> remove d, modify i, and create another i (for the right hand side)\n 4) iiiii\n ddddddd\n --> remove i, modify d\n 5) iiiiiii\n ddddddd\n --> remove both i and d (**)\n 6) iiiiiii\n ddddd\n --> modify i, remove d\n 7) iii\n ddddddd\n --> remove i, create and apply two d with checkDelete(d) (**)\n 8) iiiii\n ddddddd\n --> remove i, modify d (**)\n 9) iiiii\n ddddd\n --> modify i and d\n (**) (also check if i contains content or type)\n */\n // TODO: I left some debugger statements, because I want to debug all cases once in production. REMEMBER END TODO\n if (iStart < dStart) {\n if (dStart < iEnd) {\n if (iEnd < dEnd) {\n // Case 1\n // remove the right part of i's content\n i.content.splice(dStart - iStart)\n // remove the start of d's deletion\n d.length = dEnd - iEnd\n d.target = [d.target[0], iEnd]\n continue\n } else if (iEnd === dEnd) {\n // Case 2\n i.content.splice(dStart - iStart)\n // remove d, we do that by simply ending this function\n return\n } else { // (dEnd < iEnd)\n // Case 3\n var newI = {\n id: [i.id[0], dEnd],\n content: i.content.slice(dEnd - iStart),\n struct: 'Insert'\n }\n self.waiting.push(newI)\n i.content.splice(dStart - iStart)\n return\n }\n }\n } else if (dStart === iStart) {\n if (iEnd < dEnd) {\n // Case 4\n d.length = dEnd - iEnd\n d.target = [d.target[0], iEnd]\n i.content = []\n continue\n } else if (iEnd === dEnd) {\n // Case 5\n self.waiting.splice(w, 1)\n return\n } else { // (dEnd < iEnd)\n // Case 6\n i.content = i.content.slice(dEnd - iStart)\n i.id = [i.id[0], dEnd]\n return\n }\n } else { // (dStart < iStart)\n if (iStart < dEnd) {\n // they overlap\n /*\n 7) iii\n ddddddd\n --> remove i, create and apply two d with checkDelete(d) (**)\n 8) iiiii\n ddddddd\n --> remove i, modify d (**)\n 9) iiiii\n ddddd\n --> modify i and d\n */\n if (iEnd < dEnd) {\n // Case 7\n debugger\n self.waiting.splice(w, 1)\n checkDelete({\n target: [d.target[0], dStart],\n length: iStart - dStart,\n struct: 'Delete'\n })\n checkDelete({\n target: [d.target[0], iEnd],\n length: iEnd - dEnd,\n struct: 'Delete'\n })\n return\n } else if (iEnd === dEnd) {\n // Case 8\n self.waiting.splice(w, 1)\n w--\n d.length -= iLength\n continue\n } else { // dEnd < iEnd\n // Case 9\n d.length = iStart - dStart\n i.content.splice(0, dEnd - iStart)\n i.id = [i.id[0], dEnd]\n continue\n }\n }\n }\n }\n }\n // finished with remaining operations\n self.waiting.push(d)\n }\n checkDelete(op)\n } else {\n this.waiting.push(op)\n }\n }\n /*\n You created some operations, and you want the `onevent` function to be\n called right away. Received operations will not be executed untill all\n prematurely called operations are executed\n */\n awaitAndPrematurelyCall (ops) {\n this.awaiting++\n ops.map(Y.utils.copyOperation).forEach(this.onevent)\n }\n * awaitOps (transaction, f, args) {\n function notSoSmartSort (array) {\n // this function sorts insertions in a executable order\n var result = []\n while (array.length > 0) {\n for (var i = 0; i < array.length; i++) {\n var independent = true\n for (var j = 0; j < array.length; j++) {\n if (Y.utils.matchesId(array[j], array[i].left)) {\n // array[i] depends on array[j]\n independent = false\n break\n }\n }\n if (independent) {\n result.push(array.splice(i, 1)[0])\n i--\n }\n }\n }\n return result\n }\n var before = this.waiting.length\n // somehow create new operations\n yield* f.apply(transaction, args)\n // remove all appended ops / awaited ops\n this.waiting.splice(before)\n if (this.awaiting > 0) this.awaiting--\n // if there are no awaited ops anymore, we can update all waiting ops, and send execute them (if there are still no awaited ops)\n if (this.awaiting === 0 && this.waiting.length > 0) {\n // update all waiting ops\n for (let i = 0; i < this.waiting.length; i++) {\n var o = this.waiting[i]\n if (o.struct === 'Insert') {\n var _o = yield* transaction.getInsertion(o.id)\n if (!Y.utils.compareIds(_o.id, o.id)) {\n // o got extended\n o.left = [o.id[0], o.id[1] - 1]\n } else if (_o.left == null) {\n o.left = null\n } else {\n // find next undeleted op\n var left = yield* transaction.getInsertion(_o.left)\n while (left.deleted != null) {\n if (left.left != null) {\n left = yield* transaction.getInsertion(left.left)\n } else {\n left = null\n break\n }\n }\n o.left = left != null ? Y.utils.getLastId(left) : null\n }\n }\n }\n // the previous stuff was async, so we have to check again!\n // We also pull changes from the bindings, if there exists such a method, this could increase awaiting too\n if (this._pullChanges != null) {\n this._pullChanges()\n }\n if (this.awaiting === 0) {\n // sort by type, execute inserts first\n var ins = []\n var dels = []\n this.waiting.forEach(function (o) {\n if (o.struct === 'Delete') {\n dels.push(o)\n } else {\n ins.push(o)\n }\n })\n this.waiting = []\n // put in executable order\n ins = notSoSmartSort(ins)\n // this.onevent can trigger the creation of another operation\n // -> check if this.awaiting increased & stop computation if it does\n for (var i = 0; i < ins.length; i++) {\n if (this.awaiting === 0) {\n this.onevent(ins[i])\n } else {\n this.waiting = this.waiting.concat(ins.slice(i))\n break\n }\n }\n for (var i = 0; i < dels.length; i++) {\n if (this.awaiting === 0) {\n this.onevent(dels[i])\n } else {\n this.waiting = this.waiting.concat(dels.slice(i))\n break\n }\n }\n }\n }\n }\n // TODO: Remove awaitedInserts and awaitedDeletes in favor of awaitedOps, as they are deprecated and do not always work\n // Do this in one of the coming releases that are breaking anyway\n /*\n Call this when you successfully awaited the execution of n Insert operations\n */\n awaitedInserts (n) {\n var ops = this.waiting.splice(this.waiting.length - n)\n for (var oid = 0; oid < ops.length; oid++) {\n var op = ops[oid]\n if (op.struct === 'Insert') {\n for (var i = this.waiting.length - 1; i >= 0; i--) {\n let w = this.waiting[i]\n // TODO: do I handle split operations correctly here? Super unlikely, but yeah..\n // Also: can this case happen? Can op be inserted in the middle of a larger op that is in $waiting?\n if (w.struct === 'Insert') {\n if (Y.utils.matchesId(w, op.left)) {\n // include the effect of op in w\n w.right = op.id\n // exclude the effect of w in op\n op.left = w.left\n } else if (Y.utils.compareIds(w.id, op.right)) {\n // similar..\n w.left = Y.utils.getLastId(op)\n op.right = w.right\n }\n }\n }\n } else {\n throw new Error('Expected Insert Operation!')\n }\n }\n this._tryCallEvents(n)\n }\n /*\n Call this when you successfully awaited the execution of n Delete operations\n */\n awaitedDeletes (n, newLeft) {\n var ops = this.waiting.splice(this.waiting.length - n)\n for (var j = 0; j < ops.length; j++) {\n var del = ops[j]\n if (del.struct === 'Delete') {\n if (newLeft != null) {\n for (var i = 0; i < this.waiting.length; i++) {\n let w = this.waiting[i]\n // We will just care about w.left\n if (w.struct === 'Insert' && Y.utils.compareIds(del.target, w.left)) {\n w.left = newLeft\n }\n }\n }\n } else {\n throw new Error('Expected Delete Operation!')\n }\n }\n this._tryCallEvents(n)\n }\n /* (private)\n Try to execute the events for the waiting operations\n */\n _tryCallEvents () {\n function notSoSmartSort (array) {\n var result = []\n while (array.length > 0) {\n for (var i = 0; i < array.length; i++) {\n var independent = true\n for (var j = 0; j < array.length; j++) {\n if (Y.utils.matchesId(array[j], array[i].left)) {\n // array[i] depends on array[j]\n independent = false\n break\n }\n }\n if (independent) {\n result.push(array.splice(i, 1)[0])\n i--\n }\n }\n }\n return result\n }\n if (this.awaiting > 0) this.awaiting--\n if (this.awaiting === 0 && this.waiting.length > 0) {\n var ins = []\n var dels = []\n this.waiting.forEach(function (o) {\n if (o.struct === 'Delete') {\n dels.push(o)\n } else {\n ins.push(o)\n }\n })\n ins = notSoSmartSort(ins)\n ins.forEach(this.onevent)\n dels.forEach(this.onevent)\n this.waiting = []\n }\n }\n }\n Y.utils.EventHandler = EventHandler\n\n /*\n A wrapper for the definition of a custom type.\n Every custom type must have three properties:\n\n * struct\n - Structname of this type\n * initType\n - Given a model, creates a custom type\n * class\n - the constructor of the custom type (e.g. in order to inherit from a type)\n */\n class CustomType { // eslint-disable-line\n /* ::\n struct: any;\n initType: any;\n class: Function;\n name: String;\n */\n constructor (def) {\n if (def.struct == null ||\n def.initType == null ||\n def.class == null ||\n def.name == null\n ) {\n throw new Error('Custom type was not initialized correctly!')\n }\n this.struct = def.struct\n this.initType = def.initType\n this.class = def.class\n this.name = def.name\n if (def.appendAdditionalInfo != null) {\n this.appendAdditionalInfo = def.appendAdditionalInfo\n }\n this.parseArguments = (def.parseArguments || function () {\n return [this]\n }).bind(this)\n this.parseArguments.typeDefinition = this\n }\n }\n Y.utils.CustomType = CustomType\n\n Y.utils.isTypeDefinition = function isTypeDefinition (v) {\n if (v != null) {\n if (v instanceof Y.utils.CustomType) return [v]\n else if (v.constructor === Array && v[0] instanceof Y.utils.CustomType) return v\n else if (v instanceof Function && v.typeDefinition instanceof Y.utils.CustomType) return [v.typeDefinition]\n }\n return false\n }\n\n /*\n Make a flat copy of an object\n (just copy properties)\n */\n function copyObject (o) {\n var c = {}\n for (var key in o) {\n c[key] = o[key]\n }\n return c\n }\n Y.utils.copyObject = copyObject\n\n /*\n Copy an operation, so that it can be manipulated.\n Note: You must not change subproperties (except o.content)!\n */\n function copyOperation (o) {\n o = copyObject(o)\n if (o.content != null) {\n o.content = o.content.map(function (c) { return c })\n }\n return o\n }\n\n Y.utils.copyOperation = copyOperation\n\n /*\n Defines a smaller relation on Id's\n */\n function smaller (a, b) {\n return a[0] < b[0] || (a[0] === b[0] && (a[1] < b[1] || typeof a[1] < typeof b[1]))\n }\n Y.utils.smaller = smaller\n\n function inDeletionRange (del, ins) {\n return del.target[0] === ins[0] && del.target[1] <= ins[1] && ins[1] < del.target[1] + (del.length || 1)\n }\n Y.utils.inDeletionRange = inDeletionRange\n\n function compareIds (id1, id2) {\n if (id1 == null || id2 == null) {\n return id1 === id2\n } else {\n return id1[0] === id2[0] && id1[1] === id2[1]\n }\n }\n Y.utils.compareIds = compareIds\n\n function matchesId (op, id) {\n if (id == null || op == null) {\n return id === op\n } else {\n if (id[0] === op.id[0]) {\n if (op.content == null) {\n return id[1] === op.id[1]\n } else {\n return id[1] >= op.id[1] && id[1] < op.id[1] + op.content.length\n }\n }\n }\n }\n Y.utils.matchesId = matchesId\n\n function getLastId (op) {\n if (op.content == null || op.content.length === 1) {\n return op.id\n } else {\n return [op.id[0], op.id[1] + op.content.length - 1]\n }\n }\n Y.utils.getLastId = getLastId\n\n function createEmptyOpsArray (n) {\n var a = new Array(n)\n for (var i = 0; i < a.length; i++) {\n a[i] = {\n id: [null, null]\n }\n }\n return a\n }\n\n function createSmallLookupBuffer (Store) {\n /*\n This buffer implements a very small buffer that temporarily stores operations\n after they are read / before they are written.\n The buffer basically implements FIFO. Often requested lookups will be re-queued every time they are looked up / written.\n\n It can speed up lookups on Operation Stores and State Stores. But it does not require notable use of memory or processing power.\n\n Good for os and ss, bot not for ds (because it often uses methods that require a flush)\n\n I tried to optimize this for performance, therefore no highlevel operations.\n */\n class SmallLookupBuffer extends Store {\n constructor (arg1, arg2) {\n // super(...arguments) -- do this when this is supported by stable nodejs\n super(arg1, arg2)\n this.writeBuffer = createEmptyOpsArray(5)\n this.readBuffer = createEmptyOpsArray(10)\n }\n * find (id, noSuperCall) {\n var i, r\n for (i = this.readBuffer.length - 1; i >= 0; i--) {\n r = this.readBuffer[i]\n // we don't have to use compareids, because id is always defined!\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n // found r\n // move r to the end of readBuffer\n for (; i < this.readBuffer.length - 1; i++) {\n this.readBuffer[i] = this.readBuffer[i + 1]\n }\n this.readBuffer[this.readBuffer.length - 1] = r\n return r\n }\n }\n var o\n for (i = this.writeBuffer.length - 1; i >= 0; i--) {\n r = this.writeBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n o = r\n break\n }\n }\n if (i < 0 && noSuperCall === undefined) {\n // did not reach break in last loop\n // read id and put it to the end of readBuffer\n o = yield* super.find(id)\n }\n if (o != null) {\n for (i = 0; i < this.readBuffer.length - 1; i++) {\n this.readBuffer[i] = this.readBuffer[i + 1]\n }\n this.readBuffer[this.readBuffer.length - 1] = o\n }\n return o\n }\n * put (o) {\n var id = o.id\n var i, r // helper variables\n for (i = this.writeBuffer.length - 1; i >= 0; i--) {\n r = this.writeBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n // is already in buffer\n // forget r, and move o to the end of writeBuffer\n for (; i < this.writeBuffer.length - 1; i++) {\n this.writeBuffer[i] = this.writeBuffer[i + 1]\n }\n this.writeBuffer[this.writeBuffer.length - 1] = o\n break\n }\n }\n if (i < 0) {\n // did not reach break in last loop\n // write writeBuffer[0]\n var write = this.writeBuffer[0]\n if (write.id[0] !== null) {\n yield* super.put(write)\n }\n // put o to the end of writeBuffer\n for (i = 0; i < this.writeBuffer.length - 1; i++) {\n this.writeBuffer[i] = this.writeBuffer[i + 1]\n }\n this.writeBuffer[this.writeBuffer.length - 1] = o\n }\n // check readBuffer for every occurence of o.id, overwrite if found\n // whether found or not, we'll append o to the readbuffer\n for (i = 0; i < this.readBuffer.length - 1; i++) {\n r = this.readBuffer[i + 1]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n this.readBuffer[i] = o\n } else {\n this.readBuffer[i] = r\n }\n }\n this.readBuffer[this.readBuffer.length - 1] = o\n }\n * delete (id) {\n var i, r\n for (i = 0; i < this.readBuffer.length; i++) {\n r = this.readBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n this.readBuffer[i] = {\n id: [null, null]\n }\n }\n }\n yield* this.flush()\n yield* super.delete(id)\n }\n * findWithLowerBound (id) {\n var o = yield* this.find(id, true)\n if (o != null) {\n return o\n } else {\n yield* this.flush()\n return yield* super.findWithLowerBound.apply(this, arguments)\n }\n }\n * findWithUpperBound (id) {\n var o = yield* this.find(id, true)\n if (o != null) {\n return o\n } else {\n yield* this.flush()\n return yield* super.findWithUpperBound.apply(this, arguments)\n }\n }\n * findNext () {\n yield* this.flush()\n return yield* super.findNext.apply(this, arguments)\n }\n * findPrev () {\n yield* this.flush()\n return yield* super.findPrev.apply(this, arguments)\n }\n * iterate () {\n yield* this.flush()\n yield* super.iterate.apply(this, arguments)\n }\n * flush () {\n for (var i = 0; i < this.writeBuffer.length; i++) {\n var write = this.writeBuffer[i]\n if (write.id[0] !== null) {\n yield* super.put(write)\n this.writeBuffer[i] = {\n id: [null, null]\n }\n }\n }\n }\n }\n return SmallLookupBuffer\n }\n Y.utils.createSmallLookupBuffer = createSmallLookupBuffer\n}\n","/* @flow */\n'use strict'\n\nrequire('./Connector.js')(Y)\nrequire('./Database.js')(Y)\nrequire('./Transaction.js')(Y)\nrequire('./Struct.js')(Y)\nrequire('./Utils.js')(Y)\nrequire('./Connectors/Test.js')(Y)\n\nvar requiringModules = {}\n\nmodule.exports = Y\nY.requiringModules = requiringModules\n\nY.extend = function (name, value) {\n if (value instanceof Y.utils.CustomType) {\n Y[name] = value.parseArguments\n } else {\n Y[name] = value\n }\n if (requiringModules[name] != null) {\n requiringModules[name].resolve()\n delete requiringModules[name]\n }\n}\n\nY.requestModules = requestModules\nfunction requestModules (modules) {\n // determine if this module was compiled for es5 or es6 (y.js vs. y.es6)\n // if Insert.execute is a Function, then it isnt a generator..\n // then load the es5(.js) files..\n var extention = typeof regeneratorRuntime !== 'undefined' ? '.js' : '.es6'\n var promises = []\n for (var i = 0; i < modules.length; i++) {\n var module = modules[i].split('(')[0]\n var modulename = 'y-' + module.toLowerCase()\n if (Y[module] == null) {\n if (requiringModules[module] == null) {\n // module does not exist\n if (typeof window !== 'undefined' && window.Y !== 'undefined') {\n var imported = document.createElement('script')\n imported.src = Y.sourceDir + '/' + modulename + '/' + modulename + extention\n document.head.appendChild(imported)\n\n let requireModule = {}\n requiringModules[module] = requireModule\n requireModule.promise = new Promise(function (resolve) {\n requireModule.resolve = resolve\n })\n promises.push(requireModule.promise)\n } else {\n console.info('YJS: Please do not depend on automatic requiring of modules anymore! Extend modules as follows `require(\\'y-modulename\\')(Y)`')\n require(modulename)(Y)\n }\n } else {\n promises.push(requiringModules[modules[i]].promise)\n }\n }\n }\n return Promise.all(promises)\n}\n\n/* ::\ntype MemoryOptions = {\n name: 'memory'\n}\ntype IndexedDBOptions = {\n name: 'indexeddb',\n namespace: string\n}\ntype DbOptions = MemoryOptions | IndexedDBOptions\n\ntype WebRTCOptions = {\n name: 'webrtc',\n room: string\n}\ntype WebsocketsClientOptions = {\n name: 'websockets-client',\n room: string\n}\ntype ConnectionOptions = WebRTCOptions | WebsocketsClientOptions\n\ntype YOptions = {\n connector: ConnectionOptions,\n db: DbOptions,\n types: Array,\n sourceDir: string,\n share: {[key: string]: TypeName}\n}\n*/\n\nfunction Y (opts/* :YOptions */) /* :Promise */ {\n opts.types = opts.types != null ? opts.types : []\n var modules = [opts.db.name, opts.connector.name].concat(opts.types)\n for (var name in opts.share) {\n modules.push(opts.share[name])\n }\n Y.sourceDir = opts.sourceDir\n return new Promise(function (resolve, reject) {\n setTimeout(function () {\n Y.requestModules(modules).then(function () {\n if (opts == null) reject('An options object is expected! ')\n else if (opts.connector == null) reject('You must specify a connector! (missing connector property)')\n else if (opts.connector.name == null) reject('You must specify connector name! (missing connector.name property)')\n else if (opts.db == null) reject('You must specify a database! (missing db property)')\n else if (opts.connector.name == null) reject('You must specify db name! (missing db.name property)')\n else if (opts.share == null) reject('You must specify a set of shared types!')\n else {\n var yconfig = new YConfig(opts)\n yconfig.db.whenUserIdSet(function () {\n yconfig.init(function () {\n resolve(yconfig)\n })\n })\n }\n }).catch(reject)\n }, 0)\n })\n}\n\nclass YConfig {\n /* ::\n db: Y.AbstractDatabase;\n connector: Y.AbstractConnector;\n share: {[key: string]: any};\n options: Object;\n */\n constructor (opts, callback) {\n this.options = opts\n this.db = new Y[opts.db.name](this, opts.db)\n this.connector = new Y[opts.connector.name](this, opts.connector)\n }\n init (callback) {\n var opts = this.options\n var share = {}\n this.share = share\n this.db.requestTransaction(function * requestTransaction () {\n // create shared object\n for (var propertyname in opts.share) {\n var typeConstructor = opts.share[propertyname].split('(')\n var typeName = typeConstructor.splice(0, 1)\n var args = []\n if (typeConstructor.length === 1) {\n try {\n args = JSON.parse('[' + typeConstructor[0].split(')')[0] + ']')\n } catch (e) {\n throw new Error('Was not able to parse type definition! (share.' + propertyname + ')')\n }\n }\n var type = Y[typeName]\n var typedef = type.typeDefinition\n var id = ['_', typedef.struct + '_' + typeName + '_' + propertyname + '_' + typeConstructor]\n share[propertyname] = yield* this.createType(type.apply(typedef, args), id)\n }\n this.store.whenTransactionsFinished()\n .then(callback)\n })\n }\n isConnected () {\n return this.connector.isSynced\n }\n disconnect () {\n return this.connector.disconnect()\n }\n reconnect () {\n return this.connector.reconnect()\n }\n destroy () {\n if (this.connector.destroy != null) {\n this.connector.destroy()\n } else {\n this.connector.disconnect()\n }\n var self = this\n this.db.requestTransaction(function * () {\n yield* self.db.destroy()\n self.connector = null\n self.db = null\n })\n }\n}\n\nif (typeof window !== 'undefined') {\n window.Y = Y\n}\n"]} \ No newline at end of file diff --git a/y.js b/y.js index 3e8098dd..bcc2588d 100644 --- a/y.js +++ b/y.js @@ -1,4 +1,7172 @@ -!function e(t,r,n){function i(s,o){if(!r[s]){if(!t[s]){var u="function"==typeof require&&require;if(!o&&u)return u(s,!0);if(a)return a(s,!0);var c=new Error("Cannot find module '"+s+"'");throw c.code="MODULE_NOT_FOUND",c}var l=r[s]={exports:{}};t[s][0].call(l.exports,function(e){var r=t[s][1][e];return i(r?r:e)},l,l.exports,e,t,r,n)}return r[s].exports}for(var a="function"==typeof require&&require,s=0;s1)for(var r=1;r=0;--n){var i=this.tryEntries[n],a=i.completion;if("root"===i.tryLoc)return t("end");if(i.tryLoc<=this.prev){var s=m.call(i,"catchLoc"),o=m.call(i,"finallyLoc");if(s&&o){if(this.prev=0;--r){var n=this.tryEntries[r];if(n.tryLoc<=this.prev&&m.call(n,"finallyLoc")&&this.prev=0;--t){var r=this.tryEntries[t];if(r.finallyLoc===e)return this.complete(r.completion,r.afterLoc),p(r),C}},"catch":function(e){for(var t=this.tryEntries.length-1;t>=0;--t){var r=this.tryEntries[t];if(r.tryLoc===e){var n=r.completion;if("throw"===n.type){var i=n.arg;p(r)}return i}}throw new Error("illegal catch attempt")},delegateYield:function(e,t,r){return this.delegate={iterator:b(e),resultName:t,nextLoc:r},C}}}("object"===("undefined"==typeof r?"undefined":n(r))?r:"object"===("undefined"==typeof window?"undefined":n(window))?window:"object"===("undefined"==typeof self?"undefined":n(self))?self:void 0)}).call(this,e("_process"),"undefined"!=typeof global?global:"undefined"!=typeof self?self:"undefined"!=typeof window?window:{})},{_process:1}],3:[function(e,t,r){"use strict";console.warn("The regenerator/runtime module is deprecated; please import regenerator-runtime/runtime instead."),t.exports=e("regenerator-runtime/runtime")},{"regenerator-runtime/runtime":2}],4:[function(e,t,r){"use strict";function n(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}var i=function(){function e(e,t){for(var r=0;r "+e+": "+t.type,t)}},{key:"broadcastOps",value:function(t){function r(){n.broadcastOpBuffer.length>0&&(n.broadcast({type:"update",ops:n.broadcastOpBuffer}),n.broadcastOpBuffer=[])}t=t.map(function(t){return e.Struct[t.struct].encode(t)});var n=this;0===this.broadcastOpBuffer.length?(this.broadcastOpBuffer=t,this.y.db.transactionInProgress?this.y.db.whenTransactionsFinished().then(r):setTimeout(r,0)):this.broadcastOpBuffer=this.broadcastOpBuffer.concat(t)}},{key:"receiveMessage",value:function(e,t){var r=this;if(e!==this.userId){if(this.debug&&console.log("receive "+e+" -> "+this.userId+": "+t.type,JSON.parse(JSON.stringify(t))),null!=t.protocolVersion&&t.protocolVersion!==this.protocolVersion)return console.error("You tried to sync with a yjs instance that has a different protocol version\n (You: "+this.protocolVersion+", Client: "+t.protocolVersion+").\n The sync was stopped. You need to upgrade your dependencies (especially Yjs & the Connector)!\n "),void this.send(e,{type:"sync stop",protocolVersion:this.protocolVersion});if("sync step 1"===t.type)!function(){var n=r,i=t;r.y.db.requestTransaction(regeneratorRuntime.mark(function a(){var t,r,s;return regeneratorRuntime.wrap(function(a){for(;;)switch(a.prev=a.next){case 0:return a.delegateYield(this.getStateSet(),"t0",1);case 1:return t=a.t0,a.delegateYield(this.applyDeleteSet(i.deleteSet),"t1",3);case 3:return a.delegateYield(this.getDeleteSet(),"t2",4);case 4:return r=a.t2,a.delegateYield(this.getOperations(i.stateSet),"t3",6);case 6:s=a.t3,n.send(e,{type:"sync step 2",os:s,stateSet:t,deleteSet:r,protocolVersion:this.protocolVersion}),this.forwardToSyncingClients?(n.syncingClients.push(e),setTimeout(function(){n.syncingClients=n.syncingClients.filter(function(t){return t!==e}),n.send(e,{type:"sync done"})},5e3)):n.send(e,{type:"sync done"}),n._setSyncedWith(e);case 10:case"end":return a.stop()}},a,this)}))}();else if("sync step 2"===t.type){var n,i,a;!function(){var s=r;n=!r.broadcastedHB,r.broadcastedHB=!0,i=r.y.db,a={},a.promise=new Promise(function(e){a.resolve=e}),r.syncStep2=a.promise;var o=t;i.requestTransaction(regeneratorRuntime.mark(function u(){return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.delegateYield(this.applyDeleteSet(o.deleteSet),"t0",1);case 1:this.store.apply(o.os),i.requestTransaction(regeneratorRuntime.mark(function r(){var t;return regeneratorRuntime.wrap(function(r){for(;;)switch(r.prev=r.next){case 0:return r.delegateYield(this.getOperations(o.stateSet),"t0",1);case 1:t=r.t0,t.length>0&&(n?s.broadcastOps(t):s.send(e,{type:"update",ops:t})),a.resolve();case 4:case"end":return r.stop()}},r,this)}));case 3:case"end":return t.stop()}},u,this)}))}()}else if("sync done"===t.type){var s=this;this.syncStep2.then(function(){s._setSyncedWith(e)})}else if("update"===t.type){if(this.forwardToSyncingClients){var o=!0,u=!1,c=void 0;try{for(var l,d=this.syncingClients[Symbol.iterator]();!(o=(l=d.next()).done);o=!0){var f=l.value;this.send(f,t)}}catch(h){u=!0,c=h}finally{try{!o&&d["return"]&&d["return"]()}finally{if(u)throw c}}}if(this.y.db.forwardAppliedOperations){var p=t.ops.filter(function(e){return"Delete"===e.struct});p.length>0&&this.broadcastOps(p)}this.y.db.apply(t.ops)}}}},{key:"_setSyncedWith",value:function(e){var t=this.connections[e];null!=t&&(t.isSynced=!0),e===this.currentSyncTarget&&(this.currentSyncTarget=null,this.findNextSyncTarget())}},{key:"parseMessageFromXml",value:function(e){function t(e){var n=!0,i=!1,a=void 0;try{for(var s,o=e.children[Symbol.iterator]();!(n=(s=o.next()).done);n=!0){var u=s.value;return"true"===u.getAttribute("isArray")?t(u):r(u)}}catch(c){i=!0,a=c}finally{try{!n&&o["return"]&&o["return"]()}finally{if(i)throw a}}}function r(e){var n={};for(var i in e.attrs){var a=e.attrs[i],s=parseInt(a,10);isNaN(s)||""+s!==a?n[i]=a:n[i]=s}for(var o in e.children){var u=o.name;"true"===o.getAttribute("isArray")?n[u]=t(o):n[u]=r(o)}return n}r(e)}},{key:"encodeMessageToXml",value:function(e,t){function r(e,t){for(var i in t){var a=t[i];null==i||(a.constructor===Object?r(e.c(i),a):a.constructor===Array?n(e.c(i),a):e.setAttribute(i,a))}}function n(e,t){e.setAttribute("isArray","true");var i=!0,a=!1,s=void 0;try{for(var o,u=t[Symbol.iterator]();!(i=(o=u.next()).done);i=!0){var c=o.value;c.constructor===Object?r(e.c("array-element"),c):n(e.c("array-element"),c)}}catch(l){a=!0,s=l}finally{try{!i&&u["return"]&&u["return"]()}finally{if(a)throw s}}}if(t.constructor===Object)r(e.c("y",{xmlns:"http://y.ninja/connector-stanza"}),t);else{if(t.constructor!==Array)throw new Error("I can't encode this json!");n(e.c("y",{xmlns:"http://y.ninja/connector-stanza"}),t)}}}]),t}();e.AbstractConnector=t}},{}],5:[function(e,t,r){"use strict";function n(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function i(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function a(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}var s=function(){function e(e,t){for(var r=0;r0){i=!0;break}i&&e.push(r)}if(e.length>0){var s=getRandom(e),o=t.buffers[s],u=getRandom(Object.keys(o)),c=o[u].shift();0===o[u].length&&delete o[u];var l=t.users[s];return l.receiveMessage(c[0],c[1]),l.y.db.whenTransactionsFinished()}return!1},flushAll:function(){return new Promise(function(e){function r(){var n=t.flushOne();if(n){for(;n;)n=t.flushOne();t.whenTransactionsFinished().then(r)}else setTimeout(function(){var n=t.flushOne();n?n.then(function(){t.whenTransactionsFinished().then(r)}):e()},0)}t.whenTransactionsFinished().then(r)})}};e.utils.globalRoom=t;var r=0,u=function(u){function c(e,a){if(n(this,c),void 0===a)throw new Error("Options must not be undefined!");a.role="master",a.forwardToSyncingClients=!1;var s=i(this,Object.getPrototypeOf(c).call(this,e,a));return s.setUserId(r++ +"").then(function(){t.addUser(s)}),s.globalRoom=t,s.syncingClientDuration=0,s}return a(c,u),s(c,[{key:"receiveMessage",value:function(e,t){o(Object.getPrototypeOf(c.prototype),"receiveMessage",this).call(this,e,JSON.parse(JSON.stringify(t)))}},{key:"send",value:function(e,r){var n=t.buffers[e];null!=n&&(null==n[this.userId]&&(n[this.userId]=[]),n[this.userId].push(JSON.parse(JSON.stringify([this.userId,r]))))}},{key:"broadcast",value:function(e){for(var r in t.buffers){var n=t.buffers[r];null==n[this.userId]&&(n[this.userId]=[]),n[this.userId].push(JSON.parse(JSON.stringify([this.userId,e])))}}},{key:"isDisconnected",value:function(){return null==t.users[this.userId]}},{key:"reconnect",value:function(){return this.isDisconnected()&&(t.addUser(this),o(Object.getPrototypeOf(c.prototype),"reconnect",this).call(this)),e.utils.globalRoom.flushAll()}},{key:"disconnect",value:function(){return this.isDisconnected()||(t.removeUser(this.userId),o(Object.getPrototypeOf(c.prototype),"disconnect",this).call(this)),this.y.db.whenTransactionsFinished()}},{key:"flush",value:function(){var e=this;return async(regeneratorRuntime.mark(function r(){var n,i,a;return regeneratorRuntime.wrap(function(r){for(;;)switch(r.prev=r.next){case 0:for(n=t.buffers[e.userId];Object.keys(n).length>0;)i=getRandom(Object.keys(n)),a=n[i].shift(),0===n[i].length&&delete n[i],this.receiveMessage(a[0],a[1]);return r.next=4,e.whenTransactionsFinished();case 4:case"end":return r.stop()}},r,this)}))}}]),c}(e.AbstractConnector);e.Test=u}},{}],6:[function(e,t,r){"use strict";function n(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}var i=function(){function e(e,t){for(var r=0;r0||a.gc2.length>0?(a.y.isConnected()||console.warn("gc should be empty when disconnected!"),new Promise(function(e){a.requestTransaction(regeneratorRuntime.mark(function t(){var r,n;return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:if(null==a.y.connector||!a.y.connector.isSynced){t.next=10;break}r=0;case 2:if(!(r0&&(a.gcInterval=setTimeout(i,a.gcTimeout)),e();case 12:case"end":return t.stop()}},t,this)}))})):(a.gcTimeout>0&&(a.gcInterval=setTimeout(i,a.gcTimeout)),Promise.resolve())})}n(this,t),this.y=e;var a=this;this.userId=null;var s;this.userIdPromise=new Promise(function(e){s=e}),this.userIdPromise.resolve=s,this.forwardAppliedOperations=!1,this.listenersById={},this.listenersByIdExecuteNow=[],this.listenersByIdRequestPending=!1,this.initializedTypes={},this.waitingTransactions=[],this.transactionInProgress=!1,this.transactionIsFlushed=!1,"undefined"!=typeof YConcurrency_TestingMode&&(this.executeOrder=[]),this.gc1=[],this.gc2=[],this.gcTimeout=r.gcTimeout?r.gcTimeouts:5e4,this.garbageCollect=i,this.gcTimeout>0&&i()}return i(t,[{key:"queueGarbageCollector",value:function(e){this.y.isConnected()&&this.gc1.push(e)}},{key:"emptyGarbageCollector",value:function(){var e=this;return new Promise(function(t){var r=function n(){e.gc1.length>0||e.gc2.length>0?e.garbageCollect().then(n):t()};setTimeout(r,0)})}},{key:"addToDebug",value:function(){if("undefined"!=typeof YConcurrency_TestingMode){var e=Array.prototype.map.call(arguments,function(e){return"string"==typeof e?e:JSON.stringify(e)}).join("").replace(/"/g,"'").replace(/,/g,", ").replace(/:/g,": ");this.executeOrder.push(e)}}},{key:"getDebugData",value:function(){console.log(this.executeOrder.join("\n"))}},{key:"stopGarbageCollector",value:function(){var e=this;return new Promise(function(t){e.requestTransaction(regeneratorRuntime.mark(function r(){var n,i,a;return regeneratorRuntime.wrap(function(r){for(;;)switch(r.prev=r.next){case 0:n=e.gc1.concat(e.gc2),e.gc1=[],e.gc2=[],i=0;case 4:if(!(i1)){r.next=10;break}return r.delegateYield(this.getInsertionCleanStart([e.id[0],e.id[1]+1]),"t0",8);case 8:e=r.t0,n=!0;case 10:if(!n){r.next=15;break}return e.gc=!0,r.delegateYield(this.setOperation(e),"t1",13);case 13:return this.store.queueGarbageCollector(e.id),r.abrupt("return",!0);case 15:return r.abrupt("return",!1);case 16:case"end":return r.stop()}},r,this)})},{key:"removeFromGarbageCollector",value:function(t){function r(r){return!e.utils.compareIds(r,t.id)}this.gc1=this.gc1.filter(r),this.gc2=this.gc2.filter(r),delete t.gc}},{key:"destroy",value:regeneratorRuntime.mark(function a(){var e,t;return regeneratorRuntime.wrap(function(r){for(;;)switch(r.prev=r.next){case 0:clearInterval(this.gcInterval),this.gcInterval=null;for(e in this.initializedTypes)t=this.initializedTypes[e],null!=t._destroy?t._destroy():console.error("The type you included does not provide destroy functionality, it will remain in memory (updating your packages will help).");case 3:case"end":return r.stop()}},a,this)})},{key:"setUserId",value:function(e){if(!this.userIdPromise.inProgress){this.userIdPromise.inProgress=!0;var t=this;t.requestTransaction(regeneratorRuntime.mark(function r(){var n;return regeneratorRuntime.wrap(function(r){for(;;)switch(r.prev=r.next){case 0:return t.userId=e,r.delegateYield(this.getState(e),"t0",2);case 2:n=r.t0,t.opClock=n.clock,t.userIdPromise.resolve(e);case 5:case"end":return r.stop()}},r,this)}))}return this.userIdPromise}},{key:"whenUserIdSet",value:function(e){this.userIdPromise.then(e)}},{key:"getNextOpId",value:function(e){if(null==e)throw new Error("getNextOpId expects the number of created ids to create!");if(null==this.userId)throw new Error("OperationStore not yet initialized!");var t=[this.userId,this.opClock];return this.opClock+=e,t}},{key:"apply",value:function(t){for(var r=0;r0)for(var r={op:t,missing:e.length},n=0;ns;s++)if(u=JSON.stringify([r.id[0],r.id[1]+s]),c=this.listenersById[u],delete this.listenersById[u],null!=c)for(l in c)d=c[l],0===--d.missing&&this.whenOperationsExist([],d.op);if(f=this.initializedTypes[JSON.stringify(r.parent)],null==r.parent){o.next=18;break}return o.delegateYield(t.isDeleted(r.parent),"t3",14);case 14:if(h=o.t3,!h){o.next=18;break}return o.delegateYield(t.deleteList(r.id),"t4",17);case 17:return o.abrupt("return");case 18:if(null==f){o.next=21;break}return p=e.utils.copyOperation(r),o.delegateYield(f._changed(t,p),"t5",21);case 21:if(r.deleted){o.next=35;break}g=null!=r.content?r.content.length:1,b=r.id,y=0;case 25:if(!(g>y)){o.next=35;break}return v=[b[0],b[1]+y],o.delegateYield(t.isDeleted(v),"t6",28);case 28:if(m=o.t6,!m){o.next=32;break}return k={struct:"Delete",target:v},o.delegateYield(this.tryExecute.call(t,k),"t7",32);case 32:y++,o.next=25;break;case 35:case"end":return o.stop()}},o,this)})},{key:"whenTransactionsFinished",value:function(){if(this.transactionInProgress){if(null==this.transactionsFinished){var e,t=new Promise(function(t){e=t});return this.transactionsFinished={resolve:e,promise:t},t}return this.transactionsFinished.promise}return Promise.resolve()}},{key:"getNextRequest",value:function(){return 0===this.waitingTransactions.length?this.transactionIsFlushed?(this.transactionInProgress=!1,this.transactionIsFlushed=!1,null!=this.transactionsFinished&&(this.transactionsFinished.resolve(),this.transactionsFinished=null),null):(this.transactionIsFlushed=!0,regeneratorRuntime.mark(function e(){return regeneratorRuntime.wrap(function(e){for(;;)switch(e.prev=e.next){case 0:return e.delegateYield(this.flush(),"t0",1);case 1:case"end":return e.stop()}},e,this)})):(this.transactionIsFlushed=!1,this.waitingTransactions.shift())}},{key:"requestTransaction",value:function(e,t){var r=this;this.waitingTransactions.push(e),this.transactionInProgress||(this.transactionInProgress=!0,setTimeout(function(){r.transact(r.getNextRequest())},0))}}]),t}();e.AbstractDatabase=t}},{}],7:[function(e,t,r){"use strict";t.exports=function(e){var t={Delete:{encode:function(e){return e},requiredOps:function(e){return[]},execute:regeneratorRuntime.mark(function r(e){return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.delegateYield(this.deleteOperation(e.target,e.length||1),"t0",1);case 1:return t.abrupt("return",t.t0);case 2:case"end":return t.stop()}},r,this)})},Insert:{encode:function(e){var t={id:e.id,left:e.left,right:e.right,origin:e.origin,parent:e.parent,struct:e.struct};return null!=e.parentSub&&(t.parentSub=e.parentSub),e.hasOwnProperty("opContent")?t.opContent=e.opContent:t.content=e.content.slice(),t},requiredOps:function(t){var r=[];return null!=t.left&&r.push(t.left),null!=t.right&&r.push(t.right), -null==t.origin||e.utils.compareIds(t.left,t.origin)||r.push(t.origin),r.push(t.parent),null!=t.opContent&&r.push(t.opContent),r},getDistanceToOrigin:regeneratorRuntime.mark(function n(t){var r,i;return regeneratorRuntime.wrap(function(n){for(;;)switch(n.prev=n.next){case 0:if(null!=t.left){n.next=4;break}return n.abrupt("return",0);case 4:return r=0,n.delegateYield(this.getInsertion(t.left),"t0",6);case 6:i=n.t0;case 7:if(e.utils.matchesId(i,t.origin)){n.next=17;break}if(r++,null!=i.left){n.next=13;break}return n.abrupt("break",17);case 13:return n.delegateYield(this.getInsertion(i.left),"t1",14);case 14:i=n.t1;case 15:n.next=7;break;case 17:return n.abrupt("return",r);case 18:case"end":return n.stop()}},n,this)}),execute:regeneratorRuntime.mark(function i(r){var n,a,s,o,u,c,l,d,f,h,p,g,b;return regeneratorRuntime.wrap(function(i){for(;;)switch(i.prev=i.next){case 0:if(a=[],null==r.origin){i.next=8;break}return i.delegateYield(this.getInsertionCleanEnd(r.origin),"t0",3);case 3:return s=i.t0,null==s.originOf&&(s.originOf=[]),s.originOf.push(r.id),i.delegateYield(this.setOperation(s),"t1",7);case 7:null!=s.right&&a.push(s.right);case 8:return i.delegateYield(t.Insert.getDistanceToOrigin.call(this,r),"t2",9);case 9:if(o=n=i.t2,null==r.left){i.next=23;break}return i.delegateYield(this.getInsertionCleanEnd(r.left),"t3",12);case 12:if(u=i.t3,e.utils.compareIds(r.left,r.origin)||null==u.right||a.push(u.right),null!=u.right){i.next=18;break}i.t4=null,i.next=20;break;case 18:return i.delegateYield(this.getOperation(u.right),"t5",19);case 19:i.t4=i.t5;case 20:u=i.t4,i.next=34;break;case 23:return i.delegateYield(this.getOperation(r.parent),"t6",24);case 24:if(c=i.t6,d=r.parentSub?c.map[r.parentSub]:c.start,null!=d){i.next=30;break}i.t7=null,i.next=32;break;case 30:return i.delegateYield(this.getOperation(d),"t8",31);case 31:i.t7=i.t8;case 32:l=i.t7,u=l;case 34:if(null==r.right){i.next=37;break}return a.push(r.right),i.delegateYield(this.getInsertionCleanStart(r.right),"t9",37);case 37:if(null==u||e.utils.compareIds(u.id,r.right)){i.next=59;break}return i.delegateYield(t.Insert.getDistanceToOrigin.call(this,u),"t10",40);case 40:if(f=i.t10,f!==n){i.next=45;break}u.id[0]f)){i.next=49;break}f>=n-o&&(r.left=e.utils.getLastId(u),o=n+1),i.next=50;break;case 49:return i.abrupt("break",62);case 50:if(n++,null==u.right){i.next=56;break}return i.delegateYield(this.getInsertion(u.right),"t11",53);case 53:u=i.t11,i.next=57;break;case 56:u=null;case 57:i.next=60;break;case 59:return i.abrupt("break",62);case 60:i.next=37;break;case 62:if(h=null,p=null,null!=c){i.next=67;break}return i.delegateYield(this.getOperation(r.parent),"t12",66);case 66:c=i.t12;case 67:if(null==r.left){i.next=75;break}return i.delegateYield(this.getInsertion(r.left),"t13",69);case 69:return h=i.t13,r.right=h.right,h.right=r.id,i.delegateYield(this.setOperation(h),"t14",73);case 73:i.next=76;break;case 75:r.right=r.parentSub?c.map[r.parentSub]||null:c.start;case 76:if(null==r.right){i.next=86;break}return i.delegateYield(this.getOperation(r.right),"t15",78);case 78:if(p=i.t15,p.left=e.utils.getLastId(r),null==p.gc){i.next=85;break}if(!(null!=p.content&&p.content.length>1)){i.next=84;break}return i.delegateYield(this.getInsertionCleanEnd(p.id),"t16",83);case 83:p=i.t16;case 84:this.store.removeFromGarbageCollector(p);case 85:return i.delegateYield(this.setOperation(p),"t17",86);case 86:if(null==r.parentSub){i.next=96;break}if(null!=h){i.next=90;break}return c.map[r.parentSub]=r.id,i.delegateYield(this.setOperation(c),"t18",90);case 90:if(null==r.right){i.next=92;break}return i.delegateYield(this.deleteOperation(r.right,1,!0),"t19",92);case 92:if(null==r.left){i.next=94;break}return i.delegateYield(this.deleteOperation(r.id,1,!0),"t20",94);case 94:i.next=100;break;case 96:if(null!=p&&null!=h){i.next=100;break}return null==p&&(c.end=e.utils.getLastId(r)),null==h&&(c.start=r.id),i.delegateYield(this.setOperation(c),"t21",100);case 100:g=0;case 101:if(!(g=0&&null!=n.right)){i.next=12;break}return i.delegateYield(this.getOperation(n.right),"t1",9);case 9:n=i.t1,i.next=13;break;case 12:return i.abrupt("break",15);case 13:i.next=5;break;case 15:return i.abrupt("return",r);case 16:case"end":return i.stop()}},s,this)}),map:regeneratorRuntime.mark(function o(e,t){var r,n;return regeneratorRuntime.wrap(function(i){for(;;)switch(i.prev=i.next){case 0:e=e.start,r=[];case 2:if(null==e){i.next=9;break}return i.delegateYield(this.getOperation(e),"t0",4);case 4:n=i.t0,n.deleted||r.push(t(n)),e=n.right,i.next=2;break;case 9:return i.abrupt("return",r);case 10:case"end":return i.stop()}},o,this)})},Map:{create:function(e){return{id:e,map:{},struct:"Map"}},encode:function(e){var t={struct:"Map",type:e.type,id:e.id,map:{}};return null!=e.requires&&(t.requires=e.requires),null!=e.info&&(t.info=e.info),t},requiredOps:function(){return[]},execute:regeneratorRuntime.mark(function u(){return regeneratorRuntime.wrap(function(e){for(;;)switch(e.prev=e.next){case 0:case"end":return e.stop()}},u,this)}),get:regeneratorRuntime.mark(function c(e,t){var r,n;return regeneratorRuntime.wrap(function(i){for(;;)switch(i.prev=i.next){case 0:if(r=e.map[t],null==r){i.next=14;break}return i.delegateYield(this.getOperation(r),"t0",3);case 3:if(n=i.t0,null!=n&&!n.deleted){i.next=8;break}return i.abrupt("return",void 0);case 8:if(null!=n.opContent){i.next=12;break}return i.abrupt("return",n.content[0]);case 12:return i.delegateYield(this.getType(n.opContent),"t1",13);case 13:return i.abrupt("return",i.t1);case 14:case"end":return i.stop()}},c,this)})}};e.Struct=t}},{}],8:[function(e,t,r){"use strict";function n(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}var i=function(){function e(e,t){for(var r=0;r0&&this.store.y.connector.broadcastOps(r);case 10:case"end":return a.stop()}},s,this)})},{key:"deleteList",value:regeneratorRuntime.mark(function o(e){var t;return regeneratorRuntime.wrap(function(r){for(;;)switch(r.prev=r.next){case 0:if(null==e){r.next=15;break}return r.delegateYield(this.getOperation(e),"t0",2);case 2:if(e=r.t0,e.gc){r.next=12;break}return e.gc=!0,e.deleted=!0,r.delegateYield(this.setOperation(e),"t1",7);case 7:return t=null!=e.content?e.content.length:1,r.delegateYield(this.markDeleted(e.id,t),"t2",9);case 9:if(null==e.opContent){r.next=11;break}return r.delegateYield(this.deleteOperation(e.opContent),"t3",11);case 11:this.store.queueGarbageCollector(e.id);case 12:e=e.right,r.next=0;break;case 15:case"end":return r.stop()}},o,this)})},{key:"deleteOperation",value:regeneratorRuntime.mark(function u(e,t,r){var n,i,a,s,o,c,l;return regeneratorRuntime.wrap(function(u){for(;;)switch(u.prev=u.next){case 0:return null==t&&(t=1),u.delegateYield(this.markDeleted(e,t),"t0",2);case 2:if(!(t>0)){u.next=64;break}return n=!1,u.delegateYield(this.os.findWithUpperBound([e[0],e[1]+t-1]),"t1",5);case 5:if(i=u.t1,a=null!=i&&null!=i.content?i.content.length:1,!(null==i||i.id[0]!==e[0]||i.id[1]+a<=e[1])){u.next=12;break}i=null,t=0,u.next=22;break;case 12:if(i.deleted){u.next=21;break}if(!(i.id[1]e[1]+t)){u.next=21;break}return u.delegateYield(this.getInsertionCleanEnd([e[0],e[1]+t-1]),"t3",19);case 19:i=u.t3,a=i.content.length;case 21:t=i.id[1]-e[1];case 22:if(null==i){u.next=62;break}if(i.deleted){u.next=44;break}if(n=!0,i.deleted=!0,null==i.start){u.next=28;break}return u.delegateYield(this.deleteList(i.start),"t4",28);case 28:if(null==i.map){u.next=35;break}u.t5=regeneratorRuntime.keys(i.map);case 30:if((u.t6=u.t5()).done){u.next=35;break}return s=u.t6.value,u.delegateYield(this.deleteList(i.map[s]),"t7",33);case 33:u.next=30;break;case 35:if(null==i.opContent){u.next=37;break}return u.delegateYield(this.deleteOperation(i.opContent),"t8",37);case 37:if(null==i.requires){u.next=44;break}o=0;case 39:if(!(o0)){s.next=20;break}if(r.gc){s.next=11;break}r.len+=n,s.next=18;break;case 11:if(n=r.id[1]+r.len-e[1],!(t>n)){s.next=17;break}return r={id:[e[0],e[1]+n],len:t-n,gc:!1},s.delegateYield(this.ds.put(r),"t1",15);case 15:s.next=18;break;case 17:throw new Error("Cannot happen! (it dit though.. :()");case 18:s.next=21;break;case 20:return s.abrupt("return",r);case 21:s.next=25;break;case 23:return r={id:e,len:t,gc:!1},s.delegateYield(this.ds.put(r),"t2",25);case 25:s.next=29;break;case 27:return r={id:e,len:t,gc:!1},s.delegateYield(this.ds.put(r),"t3",29);case 29:return s.delegateYield(this.ds.findNext(r.id),"t4",30);case 30:if(i=s.t4,!(null!=i&&r.id[0]===i.id[0]&&r.id[1]+r.len>=i.id[1])){s.next=61;break}n=r.id[1]+r.len-i.id[1];case 33:if(!(n>=0)){s.next=61;break}if(!i.gc){s.next=44;break}if(r.len-=n,!(n>=i.len)){s.next=41;break}if(n-=i.len,!(n>0)){s.next=41;break}return s.delegateYield(this.ds.put(r),"t5",40);case 40:return s.delegateYield(this.markDeleted([i.id[0],i.id[1]+i.len],n),"t6",41);case 41:return s.abrupt("break",61);case 44:if(!(n>i.len)){s.next=56;break}return s.delegateYield(this.ds.findNext(i.id),"t7",46);case 46:return a=s.t7,s.delegateYield(this.ds["delete"](i.id),"t8",48);case 48:if(null!=a&&r.id[0]===a.id[0]){s.next=52;break}return s.abrupt("break",61);case 52:i=a,n=r.id[1]+r.len-i.id[1];case 54:s.next=59;break;case 56:return r.len+=i.len-n,s.delegateYield(this.ds["delete"](i.id),"t9",58);case 58:return s.abrupt("break",61);case 59:s.next=33;break;case 61:return s.delegateYield(this.ds.put(r),"t10",62);case 62:return s.abrupt("return",r);case 63:case"end":return s.stop()}},l,this)})},{key:"garbageCollectAfterSync",value:regeneratorRuntime.mark(function d(){return regeneratorRuntime.wrap(function(e){for(;;)switch(e.prev=e.next){case 0:return(this.store.gc1.length>0||this.store.gc2.length>0)&&console.warn("gc should be empty after sync"),e.delegateYield(this.os.iterate(this,null,null,regeneratorRuntime.mark(function t(e){var r,n,i;return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:if(!e.gc){t.next=3;break}return delete e.gc,t.delegateYield(this.setOperation(e),"t0",3);case 3:if(null==e.parent){t.next=23;break}return t.delegateYield(this.isDeleted(e.parent),"t1",5);case 5:if(r=t.t1,!r){t.next=23;break}if(e.gc=!0,e.deleted){t.next=20;break}return t.delegateYield(this.markDeleted(e.id,null!=e.content?e.content.length:1),"t2",10);case 10:if(e.deleted=!0,null==e.opContent){t.next=13;break}return t.delegateYield(this.deleteOperation(e.opContent),"t3",13);case 13:if(null==e.requires){t.next=20;break}n=0;case 15:if(!(n0)){f.next=61;break}u=r.left,c=null;case 38:if(null==u){f.next=46;break}return f.delegateYield(this.getInsertion(u),"t10",40);case 40:if(c=f.t10,!c.deleted){f.next=43;break}return f.abrupt("break",46);case 43:u=c.left,f.next=38;break;case 46:f.t11=regeneratorRuntime.keys(r.originOf);case 47:if((f.t12=f.t11()).done){f.next=56;break}return l=f.t12.value,f.delegateYield(this.getOperation(r.originOf[l]),"t13",50);case 50:if(d=f.t13,null==d){f.next=54;break}return d.origin=u,f.delegateYield(this.setOperation(d),"t14",54);case 54:f.next=47;break;case 56:if(null==u){f.next=59;break}return null==c.originOf?c.originOf=r.originOf:c.originOf=r.originOf.concat(c.originOf),f.delegateYield(this.setOperation(c),"t15",59);case 59:f.next=62;break;case 61:return f.delegateYield(this.setOperation(o),"t16",62);case 62:if(null==r.origin){f.next=67;break}return f.delegateYield(this.getInsertion(r.origin),"t17",64);case 64:return h=f.t17,h.originOf=h.originOf.filter(function(r){return!e.utils.compareIds(t,r)}),f.delegateYield(this.setOperation(h),"t18",67);case 67:if(null==r.parent){f.next=70;break}return f.delegateYield(this.getOperation(r.parent),"t19",69);case 69:p=f.t19;case 70:if(null==p){f.next=75;break}if(g=!1,null!=r.parentSub?e.utils.compareIds(p.map[r.parentSub],r.id)&&(g=!0,null!=r.right?p.map[r.parentSub]=r.right:delete p.map[r.parentSub]):(e.utils.compareIds(p.start,r.id)&&(g=!0,p.start=r.right),e.utils.matchesId(r,p.end)&&(g=!0,p.end=r.left)),!g){f.next=75;break}return f.delegateYield(this.setOperation(p),"t20",75);case 75:return f.delegateYield(this.removeOperation(r.id),"t21",76);case 76:case"end":return f.stop()}},f,this)})},{key:"checkDeleteStoreForState",value:regeneratorRuntime.mark(function h(e){var t;return regeneratorRuntime.wrap(function(r){for(;;)switch(r.prev=r.next){case 0:return r.delegateYield(this.ds.findWithUpperBound([e.user,e.clock]),"t0",1);case 1:t=r.t0,null!=t&&t.id[0]===e.user&&t.gc&&(e.clock=Math.max(e.clock,t.id[1]+t.len));case 3:case"end":return r.stop()}},h,this)})},{key:"updateState",value:regeneratorRuntime.mark(function p(e){var t,r,n;return regeneratorRuntime.wrap(function(i){for(;;)switch(i.prev=i.next){case 0:return i.delegateYield(this.getState(e),"t0",1);case 1:return t=i.t0,i.delegateYield(this.checkDeleteStoreForState(t),"t1",3);case 3:return i.delegateYield(this.getInsertion([e,t.clock]),"t2",4);case 4:r=i.t2,n=null!=r&&null!=r.content?r.content.length:1;case 6:if(!(null!=r&&e===r.id[0]&&r.id[1]<=t.clock&&r.id[1]+n>t.clock)){i.next=14;break}return t.clock+=n,i.delegateYield(this.checkDeleteStoreForState(t),"t3",9);case 9:return i.delegateYield(this.os.findNext(r.id),"t4",10);case 10:r=i.t4,n=null!=r&&null!=r.content?r.content.length:1,i.next=6;break;case 14:return i.delegateYield(this.setState(t),"t5",15);case 15:case"end":return i.stop()}},p,this)})},{key:"applyDeleteSet",value:regeneratorRuntime.mark(function g(e){var t,r,n,i,a,s,o,u,c,l,d;return regeneratorRuntime.wrap(function(f){for(;;)switch(f.prev=f.next){case 0:t=[],f.t0=regeneratorRuntime.keys(e);case 2:if((f.t1=f.t0()).done){f.next=11;break}return r=f.t1.value,n=e[r],i=0,a=n[i],f.delegateYield(this.ds.iterate(this,[r,0],[r,Number.MAX_VALUE],regeneratorRuntime.mark(function h(e){var s;return regeneratorRuntime.wrap(function(o){for(;;)switch(o.prev=o.next){case 0:if(null==a){o.next=10;break}if(s=0,!(e.id[1]+e.len<=a[0])){o.next=6;break}return o.abrupt("break",10);case 6:a[0]=o[1])){f.next=36;break}return f.delegateYield(this.os.findWithUpperBound([o[0],u-1]),"t5",20);case 20:if(c=f.t5,null!=c){f.next=23;break}return f.abrupt("break",36);case 23:if(l=null!=c.content?c.content.length:1,!(c.id[0]!==o[0]||c.id[1]+l<=o[1])){f.next=26;break}return f.abrupt("break",36);case 26:if(!(c.id[1]+l>o[1]+o[2])){f.next=29;break}return f.delegateYield(this.getInsertionCleanEnd([o[0],o[1]+o[2]-1]),"t6",28);case 28:c=f.t6;case 29:if(!(c.id[1]1)){s.next=15;break}return i=n[0],a=e.Struct[i].create(t),a.type=n[1],s.delegateYield(this.setOperation(a),"t1",12);case 12:return s.abrupt("return",a);case 15:return console.error("Unexpected case. How can this happen?"),s.abrupt("return",null);case 18:case"end":return s.stop()}},I,this)})},{key:"removeOperation",value:regeneratorRuntime.mark(function S(e){return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return t.delegateYield(this.os["delete"](e),"t0",1);case 1:case"end":return t.stop()}},S,this)})},{key:"setState",value:regeneratorRuntime.mark(function T(e){var t;return regeneratorRuntime.wrap(function(r){for(;;)switch(r.prev=r.next){case 0:return t={id:[e.user],clock:e.clock},r.delegateYield(this.ss.put(t),"t0",2);case 2:case"end":return r.stop()}},T,this)})},{key:"getState",value:regeneratorRuntime.mark(function C(e){var t,r;return regeneratorRuntime.wrap(function(n){for(;;)switch(n.prev=n.next){case 0:return n.delegateYield(this.ss.find([e]),"t0",1);case 1:return t=n.t0,r=null==t?null:t.clock,null==r&&(r=0),n.abrupt("return",{user:e,clock:r});case 5:case"end":return n.stop()}},C,this)})},{key:"getStateVector",value:regeneratorRuntime.mark(function E(){var e;return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return e=[],t.delegateYield(this.ss.iterate(this,null,null,regeneratorRuntime.mark(function r(t){return regeneratorRuntime.wrap(function(r){for(;;)switch(r.prev=r.next){case 0:e.push({user:t.id[0],clock:t.clock});case 1:case"end":return r.stop()}},r,this)})),"t0",2);case 2:return t.abrupt("return",e);case 3:case"end":return t.stop()}},E,this)})},{key:"getStateSet",value:regeneratorRuntime.mark(function L(){var e;return regeneratorRuntime.wrap(function(t){for(;;)switch(t.prev=t.next){case 0:return e={},t.delegateYield(this.ss.iterate(this,null,null,regeneratorRuntime.mark(function r(t){return regeneratorRuntime.wrap(function(r){for(;;)switch(r.prev=r.next){case 0:e[t.id[0]]=t.clock;case 1:case"end":return r.stop()}},r,this)})),"t0",2);case 2:return t.abrupt("return",e);case 3:case"end":return t.stop()}},L,this)})},{key:"getOperations",value:regeneratorRuntime.mark(function B(t){var r,n,i,a,s,o,u,c,l,d,f;return regeneratorRuntime.wrap(function(h){for(;;)switch(h.prev=h.next){case 0:return null==t&&(t={}),r=[],h.delegateYield(this.getStateVector(),"t0",3);case 3:n=h.t0,i=!0,a=!1,s=void 0,h.prev=7,o=n[Symbol.iterator]();case 9:if(i=(u=o.next()).done){h.next=23;break}if(c=u.value,l=c.user,"_"!==l){h.next=14;break}return h.abrupt("continue",20);case 14:if(d=t[l]||0,!(d>0)){h.next=19;break}return h.delegateYield(this.getInsertion([l,d]),"t1",17);case 17:f=h.t1,null!=f&&(d=f.id[1]);case 19:return h.delegateYield(this.os.iterate(this,[l,d],[l,Number.MAX_VALUE],regeneratorRuntime.mark(function p(n){var i,a,s,o;return regeneratorRuntime.wrap(function(u){for(;;)switch(u.prev=u.next){case 0:if(n=e.Struct[n.struct].encode(n),"Insert"===n.struct){u.next=5;break}r.push(n),u.next=27;break;case 5:if(!(null==n.right||n.right[1]<(t[n.right[0]]||0))){u.next=27;break}i=n,a=[n],s=n.right;case 9:if(null!=i.left){u.next=15;break}return n.left=null,r.push(n),e.utils.compareIds(i.id,n.id)||(i=e.Struct[n.struct].encode(i),i.right=a[a.length-1].id,r.push(i)),u.abrupt("break",27);case 15:return u.delegateYield(this.getInsertion(i.left),"t0",16); -case 16:for(i=u.t0;a.length>0&&e.utils.matchesId(i,a[a.length-1].origin);)a.pop();if(!(i.id[1]<(t[i.id[0]]||0))){u.next=24;break}return n.left=e.utils.getLastId(i),r.push(n),u.abrupt("break",27);case 24:e.utils.matchesId(i,n.origin)?(n.left=n.origin,r.push(n),n=e.Struct[n.struct].encode(i),n.right=s,a.length>0&&console.log("This should not happen .. :( please report this"),a=[n]):(o=e.Struct[n.struct].encode(i),o.right=a[a.length-1].id,o.left=o.origin,r.push(o),a.push(i));case 25:u.next=9;break;case 27:case"end":return u.stop()}},p,this)})),"t2",20);case 20:i=!0,h.next=9;break;case 23:h.next=29;break;case 25:h.prev=25,h.t3=h["catch"](7),a=!0,s=h.t3;case 29:h.prev=29,h.prev=30,!i&&o["return"]&&o["return"]();case 32:if(h.prev=32,!a){h.next=35;break}throw s;case 35:return h.finish(32);case 36:return h.finish(29);case 37:return h.abrupt("return",r.reverse());case 38:case"end":return h.stop()}},B,this,[[7,25,29,37],[30,,32,36]])})},{key:"flush",value:regeneratorRuntime.mark(function j(){return regeneratorRuntime.wrap(function(e){for(;;)switch(e.prev=e.next){case 0:return e.delegateYield(this.os.flush(),"t0",1);case 1:return e.delegateYield(this.ss.flush(),"t1",2);case 2:return e.delegateYield(this.ds.flush(),"t2",3);case 3:case"end":return e.stop()}},j,this)})}]),t}();e.Transaction=t}},{}],9:[function(e,t,r){"use strict";function n(e,t){if(!e)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!t||"object"!=typeof t&&"function"!=typeof t?e:t}function i(e,t){if("function"!=typeof t&&null!==t)throw new TypeError("Super expression must either be null or a function, not "+typeof t);e.prototype=Object.create(t&&t.prototype,{constructor:{value:e,enumerable:!1,writable:!0,configurable:!0}}),t&&(Object.setPrototypeOf?Object.setPrototypeOf(e,t):e.__proto__=t)}function a(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}var s="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(e){return typeof e}:function(e){return e&&"function"==typeof Symbol&&e.constructor===Symbol?"symbol":typeof e},o=function c(e,t,r){null===e&&(e=Function.prototype);var n=Object.getOwnPropertyDescriptor(e,t);if(void 0===n){var i=Object.getPrototypeOf(e);return null===i?void 0:c(i,t,r)}if("value"in n)return n.value;var a=n.get;return void 0===a?void 0:a.call(r)},u=function(){function e(e,t){for(var r=0;r=e.id[1]&&t[1]=0)){r.next=10;break}if(a=this.readBuffer[i],a.id[1]!==e[1]||a.id[0]!==e[0]){r.next=7;break}for(;i=0)){r.next=19;break}if(a=this.writeBuffer[i],a.id[1]!==e[1]||a.id[0]!==e[0]){r.next=16;break}return s=a,r.abrupt("break",19);case 16:i--,r.next=11;break;case 19:if(!(0>i&&void 0===n)){r.next=22;break}return r.delegateYield(o(Object.getPrototypeOf(t.prototype),"find",this).call(this,e),"t0",21);case 21:s=r.t0;case 22:if(null!=s){for(i=0;i=0)){s.next=11;break}if(i=this.writeBuffer[n],i.id[1]!==r[1]||i.id[0]!==r[0]){s.next=8;break}for(;nn)){s.next=17;break}if(a=this.writeBuffer[0],null===a.id[0]){s.next=15;break}return s.delegateYield(o(Object.getPrototypeOf(t.prototype),"put",this).call(this,a),"t0",15);case 15:for(n=0;n0;)for(var n=0;n0&&this.awaiting--,!(0===this.awaiting&&this.waiting.length>0)){s.next=38;break}o=0;case 7:if(!(o=0;a--){var s=this.waiting[a];"Insert"===s.struct&&(e.utils.matchesId(s,i.left)?(s.right=i.id,i.left=s.left):e.utils.compareIds(s.id,i.right)&&(s.left=e.utils.getLastId(i),i.right=s.right))}}this._tryCallEvents(t)}},{key:"awaitedDeletes",value:function(t,r){for(var n=this.waiting.splice(this.waiting.length-t),i=0;i0;)for(var n=0;n0&&this.awaiting--,0===this.awaiting&&this.waiting.length>0){var r=[],n=[];this.waiting.forEach(function(e){"Delete"===e.struct?n.push(e):r.push(e)}),r=t(r),r.forEach(this.onevent),n.forEach(this.onevent),this.waiting=[]}}}]),r}(b);e.utils.EventHandler=y;var v=function m(e){if(a(this,m),null==e.struct||null==e.initType||null==e["class"]||null==e.name)throw new Error("Custom type was not initialized correctly!");this.struct=e.struct,this.initType=e.initType,this["class"]=e["class"],this.name=e.name,null!=e.appendAdditionalInfo&&(this.appendAdditionalInfo=e.appendAdditionalInfo),this.parseArguments=(e.parseArguments||function(){return[this]}).bind(this),this.parseArguments.typeDefinition=this};e.utils.CustomType=v,e.utils.isTypeDefinition=function(t){if(null!=t){if(t instanceof e.utils.CustomType)return[t];if(t.constructor===Array&&t[0]instanceof e.utils.CustomType)return t;if(t instanceof Function&&t.typeDefinition instanceof e.utils.CustomType)return[t.typeDefinition]}return!1},e.utils.copyObject=t,e.utils.copyOperation=r,e.utils.smaller=c,e.utils.inDeletionRange=l,e.utils.compareIds=d,e.utils.matchesId=f,e.utils.getLastId=h,e.utils.createSmallLookupBuffer=g}},{}],10:[function(e,t,r){"use strict";function n(e,t){if(!(e instanceof t))throw new TypeError("Cannot call a class as a function")}function i(t){for(var r="undefined"!=typeof regeneratorRuntime?".js":".es6",n=[],i=0;i 1) { + for (var i = 1; i < arguments.length; i++) { + args[i - 1] = arguments[i]; + } + } + queue.push(new Item(fun, args)); + if (queue.length === 1 && !draining) { + setTimeout(drainQueue, 0); + } +}; + +// v8 likes predictible objects +function Item(fun, array) { + this.fun = fun; + this.array = array; +} +Item.prototype.run = function () { + this.fun.apply(null, this.array); +}; +process.title = 'browser'; +process.browser = true; +process.env = {}; +process.argv = []; +process.version = ''; // empty string to avoid regexp issues +process.versions = {}; + +function noop() {} + +process.on = noop; +process.addListener = noop; +process.once = noop; +process.off = noop; +process.removeListener = noop; +process.removeAllListeners = noop; +process.emit = noop; + +process.binding = function (name) { + throw new Error('process.binding is not supported'); +}; + +process.cwd = function () { return '/' }; +process.chdir = function (dir) { + throw new Error('process.chdir is not supported'); +}; +process.umask = function() { return 0; }; + +},{}],2:[function(require,module,exports){ +(function (process,global){ +"use strict"; + +var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol ? "symbol" : typeof obj; }; + +/** + * Copyright (c) 2014, Facebook, Inc. + * All rights reserved. + * + * This source code is licensed under the BSD-style license found in the + * https://raw.github.com/facebook/regenerator/master/LICENSE file. An + * additional grant of patent rights can be found in the PATENTS file in + * the same directory. + */ + +!function (global) { + "use strict"; + + var hasOwn = Object.prototype.hasOwnProperty; + var undefined; // More compressible than void 0. + var $Symbol = typeof Symbol === "function" ? Symbol : {}; + var iteratorSymbol = $Symbol.iterator || "@@iterator"; + var toStringTagSymbol = $Symbol.toStringTag || "@@toStringTag"; + + var inModule = (typeof module === "undefined" ? "undefined" : _typeof(module)) === "object"; + var runtime = global.regeneratorRuntime; + if (runtime) { + if (inModule) { + // If regeneratorRuntime is defined globally and we're in a module, + // make the exports object identical to regeneratorRuntime. + module.exports = runtime; + } + // Don't bother evaluating the rest of this file if the runtime was + // already defined globally. + return; + } + + // Define the runtime globally (as expected by generated code) as either + // module.exports (if we're in a module) or a new, empty object. + runtime = global.regeneratorRuntime = inModule ? module.exports : {}; + + function wrap(innerFn, outerFn, self, tryLocsList) { + // If outerFn provided, then outerFn.prototype instanceof Generator. + var generator = Object.create((outerFn || Generator).prototype); + var context = new Context(tryLocsList || []); + + // The ._invoke method unifies the implementations of the .next, + // .throw, and .return methods. + generator._invoke = makeInvokeMethod(innerFn, self, context); + + return generator; + } + runtime.wrap = wrap; + + // Try/catch helper to minimize deoptimizations. Returns a completion + // record like context.tryEntries[i].completion. This interface could + // have been (and was previously) designed to take a closure to be + // invoked without arguments, but in all the cases we care about we + // already have an existing method we want to call, so there's no need + // to create a new function object. We can even get away with assuming + // the method takes exactly one argument, since that happens to be true + // in every case, so we don't have to touch the arguments object. The + // only additional allocation required is the completion record, which + // has a stable shape and so hopefully should be cheap to allocate. + function tryCatch(fn, obj, arg) { + try { + return { type: "normal", arg: fn.call(obj, arg) }; + } catch (err) { + return { type: "throw", arg: err }; + } + } + + var GenStateSuspendedStart = "suspendedStart"; + var GenStateSuspendedYield = "suspendedYield"; + var GenStateExecuting = "executing"; + var GenStateCompleted = "completed"; + + // Returning this object from the innerFn has the same effect as + // breaking out of the dispatch switch statement. + var ContinueSentinel = {}; + + // Dummy constructor functions that we use as the .constructor and + // .constructor.prototype properties for functions that return Generator + // objects. For full spec compliance, you may wish to configure your + // minifier not to mangle the names of these two functions. + function Generator() {} + function GeneratorFunction() {} + function GeneratorFunctionPrototype() {} + + var Gp = GeneratorFunctionPrototype.prototype = Generator.prototype; + GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype; + GeneratorFunctionPrototype.constructor = GeneratorFunction; + GeneratorFunctionPrototype[toStringTagSymbol] = GeneratorFunction.displayName = "GeneratorFunction"; + + // Helper for defining the .next, .throw, and .return methods of the + // Iterator interface in terms of a single ._invoke method. + function defineIteratorMethods(prototype) { + ["next", "throw", "return"].forEach(function (method) { + prototype[method] = function (arg) { + return this._invoke(method, arg); + }; + }); + } + + runtime.isGeneratorFunction = function (genFun) { + var ctor = typeof genFun === "function" && genFun.constructor; + return ctor ? ctor === GeneratorFunction || + // For the native GeneratorFunction constructor, the best we can + // do is to check its .name property. + (ctor.displayName || ctor.name) === "GeneratorFunction" : false; + }; + + runtime.mark = function (genFun) { + if (Object.setPrototypeOf) { + Object.setPrototypeOf(genFun, GeneratorFunctionPrototype); + } else { + genFun.__proto__ = GeneratorFunctionPrototype; + if (!(toStringTagSymbol in genFun)) { + genFun[toStringTagSymbol] = "GeneratorFunction"; + } + } + genFun.prototype = Object.create(Gp); + return genFun; + }; + + // Within the body of any async function, `await x` is transformed to + // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test + // `value instanceof AwaitArgument` to determine if the yielded value is + // meant to be awaited. Some may consider the name of this method too + // cutesy, but they are curmudgeons. + runtime.awrap = function (arg) { + return new AwaitArgument(arg); + }; + + function AwaitArgument(arg) { + this.arg = arg; + } + + function AsyncIterator(generator) { + function invoke(method, arg, resolve, reject) { + var record = tryCatch(generator[method], generator, arg); + if (record.type === "throw") { + reject(record.arg); + } else { + var result = record.arg; + var value = result.value; + if (value instanceof AwaitArgument) { + return Promise.resolve(value.arg).then(function (value) { + invoke("next", value, resolve, reject); + }, function (err) { + invoke("throw", err, resolve, reject); + }); + } + + return Promise.resolve(value).then(function (unwrapped) { + // When a yielded Promise is resolved, its final value becomes + // the .value of the Promise<{value,done}> result for the + // current iteration. If the Promise is rejected, however, the + // result for this iteration will be rejected with the same + // reason. Note that rejections of yielded Promises are not + // thrown back into the generator function, as is the case + // when an awaited Promise is rejected. This difference in + // behavior between yield and await is important, because it + // allows the consumer to decide what to do with the yielded + // rejection (swallow it and continue, manually .throw it back + // into the generator, abandon iteration, whatever). With + // await, by contrast, there is no opportunity to examine the + // rejection reason outside the generator function, so the + // only option is to throw it from the await expression, and + // let the generator function handle the exception. + result.value = unwrapped; + resolve(result); + }, reject); + } + } + + if ((typeof process === "undefined" ? "undefined" : _typeof(process)) === "object" && process.domain) { + invoke = process.domain.bind(invoke); + } + + var previousPromise; + + function enqueue(method, arg) { + function callInvokeWithMethodAndArg() { + return new Promise(function (resolve, reject) { + invoke(method, arg, resolve, reject); + }); + } + + return previousPromise = + // If enqueue has been called before, then we want to wait until + // all previous Promises have been resolved before calling invoke, + // so that results are always delivered in the correct order. If + // enqueue has not been called before, then it is important to + // call invoke immediately, without waiting on a callback to fire, + // so that the async generator function has the opportunity to do + // any necessary setup in a predictable way. This predictability + // is why the Promise constructor synchronously invokes its + // executor callback, and why async functions synchronously + // execute code before the first await. Since we implement simple + // async functions in terms of async generators, it is especially + // important to get this right, even though it requires care. + previousPromise ? previousPromise.then(callInvokeWithMethodAndArg, + // Avoid propagating failures to Promises returned by later + // invocations of the iterator. + callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); + } + + // Define the unified helper method that is used to implement .next, + // .throw, and .return (see defineIteratorMethods). + this._invoke = enqueue; + } + + defineIteratorMethods(AsyncIterator.prototype); + + // Note that simple async functions are implemented on top of + // AsyncIterator objects; they just return a Promise for the value of + // the final result produced by the iterator. + runtime.async = function (innerFn, outerFn, self, tryLocsList) { + var iter = new AsyncIterator(wrap(innerFn, outerFn, self, tryLocsList)); + + return runtime.isGeneratorFunction(outerFn) ? iter // If outerFn is a generator, return the full iterator. + : iter.next().then(function (result) { + return result.done ? result.value : iter.next(); + }); + }; + + function makeInvokeMethod(innerFn, self, context) { + var state = GenStateSuspendedStart; + + return function invoke(method, arg) { + if (state === GenStateExecuting) { + throw new Error("Generator is already running"); + } + + if (state === GenStateCompleted) { + if (method === "throw") { + throw arg; + } + + // Be forgiving, per 25.3.3.3.3 of the spec: + // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume + return doneResult(); + } + + while (true) { + var delegate = context.delegate; + if (delegate) { + if (method === "return" || method === "throw" && delegate.iterator[method] === undefined) { + // A return or throw (when the delegate iterator has no throw + // method) always terminates the yield* loop. + context.delegate = null; + + // If the delegate iterator has a return method, give it a + // chance to clean up. + var returnMethod = delegate.iterator["return"]; + if (returnMethod) { + var record = tryCatch(returnMethod, delegate.iterator, arg); + if (record.type === "throw") { + // If the return method threw an exception, let that + // exception prevail over the original return or throw. + method = "throw"; + arg = record.arg; + continue; + } + } + + if (method === "return") { + // Continue with the outer return, now that the delegate + // iterator has been terminated. + continue; + } + } + + var record = tryCatch(delegate.iterator[method], delegate.iterator, arg); + + if (record.type === "throw") { + context.delegate = null; + + // Like returning generator.throw(uncaught), but without the + // overhead of an extra function call. + method = "throw"; + arg = record.arg; + continue; + } + + // Delegate generator ran and handled its own exceptions so + // regardless of what the method was, we continue as if it is + // "next" with an undefined arg. + method = "next"; + arg = undefined; + + var info = record.arg; + if (info.done) { + context[delegate.resultName] = info.value; + context.next = delegate.nextLoc; + } else { + state = GenStateSuspendedYield; + return info; + } + + context.delegate = null; + } + + if (method === "next") { + // Setting context._sent for legacy support of Babel's + // function.sent implementation. + context.sent = context._sent = arg; + } else if (method === "throw") { + if (state === GenStateSuspendedStart) { + state = GenStateCompleted; + throw arg; + } + + if (context.dispatchException(arg)) { + // If the dispatched exception was caught by a catch block, + // then let that catch block handle the exception normally. + method = "next"; + arg = undefined; + } + } else if (method === "return") { + context.abrupt("return", arg); + } + + state = GenStateExecuting; + + var record = tryCatch(innerFn, self, context); + if (record.type === "normal") { + // If an exception is thrown from innerFn, we leave state === + // GenStateExecuting and loop back for another invocation. + state = context.done ? GenStateCompleted : GenStateSuspendedYield; + + var info = { + value: record.arg, + done: context.done + }; + + if (record.arg === ContinueSentinel) { + if (context.delegate && method === "next") { + // Deliberately forget the last sent value so that we don't + // accidentally pass it on to the delegate. + arg = undefined; + } + } else { + return info; + } + } else if (record.type === "throw") { + state = GenStateCompleted; + // Dispatch the exception by looping back around to the + // context.dispatchException(arg) call above. + method = "throw"; + arg = record.arg; + } + } + }; + } + + // Define Generator.prototype.{next,throw,return} in terms of the + // unified ._invoke helper method. + defineIteratorMethods(Gp); + + Gp[iteratorSymbol] = function () { + return this; + }; + + Gp[toStringTagSymbol] = "Generator"; + + Gp.toString = function () { + return "[object Generator]"; + }; + + function pushTryEntry(locs) { + var entry = { tryLoc: locs[0] }; + + if (1 in locs) { + entry.catchLoc = locs[1]; + } + + if (2 in locs) { + entry.finallyLoc = locs[2]; + entry.afterLoc = locs[3]; + } + + this.tryEntries.push(entry); + } + + function resetTryEntry(entry) { + var record = entry.completion || {}; + record.type = "normal"; + delete record.arg; + entry.completion = record; + } + + function Context(tryLocsList) { + // The root entry object (effectively a try statement without a catch + // or a finally block) gives us a place to store values thrown from + // locations where there is no enclosing try statement. + this.tryEntries = [{ tryLoc: "root" }]; + tryLocsList.forEach(pushTryEntry, this); + this.reset(true); + } + + runtime.keys = function (object) { + var keys = []; + for (var key in object) { + keys.push(key); + } + keys.reverse(); + + // Rather than returning an object with a next method, we keep + // things simple and return the next function itself. + return function next() { + while (keys.length) { + var key = keys.pop(); + if (key in object) { + next.value = key; + next.done = false; + return next; + } + } + + // To avoid creating an additional object, we just hang the .value + // and .done properties off the next function object itself. This + // also ensures that the minifier will not anonymize the function. + next.done = true; + return next; + }; + }; + + function values(iterable) { + if (iterable) { + var iteratorMethod = iterable[iteratorSymbol]; + if (iteratorMethod) { + return iteratorMethod.call(iterable); + } + + if (typeof iterable.next === "function") { + return iterable; + } + + if (!isNaN(iterable.length)) { + var i = -1, + next = function next() { + while (++i < iterable.length) { + if (hasOwn.call(iterable, i)) { + next.value = iterable[i]; + next.done = false; + return next; + } + } + + next.value = undefined; + next.done = true; + + return next; + }; + + return next.next = next; + } + } + + // Return an iterator with no values. + return { next: doneResult }; + } + runtime.values = values; + + function doneResult() { + return { value: undefined, done: true }; + } + + Context.prototype = { + constructor: Context, + + reset: function reset(skipTempReset) { + this.prev = 0; + this.next = 0; + // Resetting context._sent for legacy support of Babel's + // function.sent implementation. + this.sent = this._sent = undefined; + this.done = false; + this.delegate = null; + + this.tryEntries.forEach(resetTryEntry); + + if (!skipTempReset) { + for (var name in this) { + // Not sure about the optimal order of these conditions: + if (name.charAt(0) === "t" && hasOwn.call(this, name) && !isNaN(+name.slice(1))) { + this[name] = undefined; + } + } + } + }, + + stop: function stop() { + this.done = true; + + var rootEntry = this.tryEntries[0]; + var rootRecord = rootEntry.completion; + if (rootRecord.type === "throw") { + throw rootRecord.arg; + } + + return this.rval; + }, + + dispatchException: function dispatchException(exception) { + if (this.done) { + throw exception; + } + + var context = this; + function handle(loc, caught) { + record.type = "throw"; + record.arg = exception; + context.next = loc; + return !!caught; + } + + for (var i = this.tryEntries.length - 1; i >= 0; --i) { + var entry = this.tryEntries[i]; + var record = entry.completion; + + if (entry.tryLoc === "root") { + // Exception thrown outside of any try block that could handle + // it, so set the completion value of the entire function to + // throw the exception. + return handle("end"); + } + + if (entry.tryLoc <= this.prev) { + var hasCatch = hasOwn.call(entry, "catchLoc"); + var hasFinally = hasOwn.call(entry, "finallyLoc"); + + if (hasCatch && hasFinally) { + if (this.prev < entry.catchLoc) { + return handle(entry.catchLoc, true); + } else if (this.prev < entry.finallyLoc) { + return handle(entry.finallyLoc); + } + } else if (hasCatch) { + if (this.prev < entry.catchLoc) { + return handle(entry.catchLoc, true); + } + } else if (hasFinally) { + if (this.prev < entry.finallyLoc) { + return handle(entry.finallyLoc); + } + } else { + throw new Error("try statement without catch or finally"); + } + } + } + }, + + abrupt: function abrupt(type, arg) { + for (var i = this.tryEntries.length - 1; i >= 0; --i) { + var entry = this.tryEntries[i]; + if (entry.tryLoc <= this.prev && hasOwn.call(entry, "finallyLoc") && this.prev < entry.finallyLoc) { + var finallyEntry = entry; + break; + } + } + + if (finallyEntry && (type === "break" || type === "continue") && finallyEntry.tryLoc <= arg && arg <= finallyEntry.finallyLoc) { + // Ignore the finally entry if control is not jumping to a + // location outside the try/catch block. + finallyEntry = null; + } + + var record = finallyEntry ? finallyEntry.completion : {}; + record.type = type; + record.arg = arg; + + if (finallyEntry) { + this.next = finallyEntry.finallyLoc; + } else { + this.complete(record); + } + + return ContinueSentinel; + }, + + complete: function complete(record, afterLoc) { + if (record.type === "throw") { + throw record.arg; + } + + if (record.type === "break" || record.type === "continue") { + this.next = record.arg; + } else if (record.type === "return") { + this.rval = record.arg; + this.next = "end"; + } else if (record.type === "normal" && afterLoc) { + this.next = afterLoc; + } + }, + + finish: function finish(finallyLoc) { + for (var i = this.tryEntries.length - 1; i >= 0; --i) { + var entry = this.tryEntries[i]; + if (entry.finallyLoc === finallyLoc) { + this.complete(entry.completion, entry.afterLoc); + resetTryEntry(entry); + return ContinueSentinel; + } + } + }, + + "catch": function _catch(tryLoc) { + for (var i = this.tryEntries.length - 1; i >= 0; --i) { + var entry = this.tryEntries[i]; + if (entry.tryLoc === tryLoc) { + var record = entry.completion; + if (record.type === "throw") { + var thrown = record.arg; + resetTryEntry(entry); + } + return thrown; + } + } + + // The context.catch method must only be called with a location + // argument that corresponds to a known catch block. + throw new Error("illegal catch attempt"); + }, + + delegateYield: function delegateYield(iterable, resultName, nextLoc) { + this.delegate = { + iterator: values(iterable), + resultName: resultName, + nextLoc: nextLoc + }; + + return ContinueSentinel; + } + }; +}( +// Among the various tricks for obtaining a reference to the global +// object, this seems to be the most reliable technique that does not +// use indirect eval (which violates Content Security Policy). +(typeof global === "undefined" ? "undefined" : _typeof(global)) === "object" ? global : (typeof window === "undefined" ? "undefined" : _typeof(window)) === "object" ? window : (typeof self === "undefined" ? "undefined" : _typeof(self)) === "object" ? self : undefined); + +}).call(this,require('_process'),typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : typeof window !== "undefined" ? window : {}) + +},{"_process":1}],3:[function(require,module,exports){ +"use strict"; + +console.warn("The regenerator/runtime module is deprecated; " + "please import regenerator-runtime/runtime instead."); + +module.exports = require("regenerator-runtime/runtime"); + +},{"regenerator-runtime/runtime":2}],4:[function(require,module,exports){ +/* @flow */ +'use strict'; + +var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +module.exports = function (Y /* :any */) { + var AbstractConnector = function () { + /* :: + y: YConfig; + role: SyncRole; + connections: Object; + isSynced: boolean; + userEventListeners: Array; + whenSyncedListeners: Array; + currentSyncTarget: ?UserId; + syncingClients: Array; + forwardToSyncingClients: boolean; + debug: boolean; + broadcastedHB: boolean; + syncStep2: Promise; + userId: UserId; + send: Function; + broadcast: Function; + broadcastOpBuffer: Array; + protocolVersion: number; + */ + /* + opts contains the following information: + role : String Role of this client ("master" or "slave") + userId : String Uniquely defines the user. + debug: Boolean Whether to print debug messages (optional) + */ + + function AbstractConnector(y, opts) { + _classCallCheck(this, AbstractConnector); + + this.y = y; + if (opts == null) { + opts = {}; + } + if (opts.role == null || opts.role === 'master') { + this.role = 'master'; + } else if (opts.role === 'slave') { + this.role = 'slave'; + } else { + throw new Error("Role must be either 'master' or 'slave'!"); + } + this.y.db.forwardAppliedOperations = opts.forwardAppliedOperations || false; + this.role = opts.role; + this.connections = {}; + this.isSynced = false; + this.userEventListeners = []; + this.whenSyncedListeners = []; + this.currentSyncTarget = null; + this.syncingClients = []; + this.forwardToSyncingClients = opts.forwardToSyncingClients !== false; + this.debug = opts.debug === true; + this.broadcastedHB = false; + this.syncStep2 = Promise.resolve(); + this.broadcastOpBuffer = []; + this.protocolVersion = 11; + } + + _createClass(AbstractConnector, [{ + key: 'reconnect', + value: function reconnect() {} + }, { + key: 'disconnect', + value: function disconnect() { + this.connections = {}; + this.isSynced = false; + this.currentSyncTarget = null; + this.broadcastedHB = false; + this.syncingClients = []; + this.whenSyncedListeners = []; + return this.y.db.stopGarbageCollector(); + } + }, { + key: 'setUserId', + value: function setUserId(userId) { + if (this.userId == null) { + this.userId = userId; + return this.y.db.setUserId(userId); + } else { + return null; + } + } + }, { + key: 'onUserEvent', + value: function onUserEvent(f) { + this.userEventListeners.push(f); + } + }, { + key: 'userLeft', + value: function userLeft(user) { + if (this.connections[user] != null) { + delete this.connections[user]; + if (user === this.currentSyncTarget) { + this.currentSyncTarget = null; + this.findNextSyncTarget(); + } + this.syncingClients = this.syncingClients.filter(function (cli) { + return cli !== user; + }); + var _iteratorNormalCompletion = true; + var _didIteratorError = false; + var _iteratorError = undefined; + + try { + for (var _iterator = this.userEventListeners[Symbol.iterator](), _step; !(_iteratorNormalCompletion = (_step = _iterator.next()).done); _iteratorNormalCompletion = true) { + var f = _step.value; + + f({ + action: 'userLeft', + user: user + }); + } + } catch (err) { + _didIteratorError = true; + _iteratorError = err; + } finally { + try { + if (!_iteratorNormalCompletion && _iterator.return) { + _iterator.return(); + } + } finally { + if (_didIteratorError) { + throw _iteratorError; + } + } + } + } + } + }, { + key: 'userJoined', + value: function userJoined(user, role) { + if (role == null) { + throw new Error('You must specify the role of the joined user!'); + } + if (this.connections[user] != null) { + throw new Error('This user already joined!'); + } + this.connections[user] = { + isSynced: false, + role: role + }; + var _iteratorNormalCompletion2 = true; + var _didIteratorError2 = false; + var _iteratorError2 = undefined; + + try { + for (var _iterator2 = this.userEventListeners[Symbol.iterator](), _step2; !(_iteratorNormalCompletion2 = (_step2 = _iterator2.next()).done); _iteratorNormalCompletion2 = true) { + var f = _step2.value; + + f({ + action: 'userJoined', + user: user, + role: role + }); + } + } catch (err) { + _didIteratorError2 = true; + _iteratorError2 = err; + } finally { + try { + if (!_iteratorNormalCompletion2 && _iterator2.return) { + _iterator2.return(); + } + } finally { + if (_didIteratorError2) { + throw _iteratorError2; + } + } + } + + if (this.currentSyncTarget == null) { + this.findNextSyncTarget(); + } + } + // Execute a function _when_ we are connected. + // If not connected, wait until connected + + }, { + key: 'whenSynced', + value: function whenSynced(f) { + if (this.isSynced) { + f(); + } else { + this.whenSyncedListeners.push(f); + } + } + /* + returns false, if there is no sync target + true otherwise + */ + + }, { + key: 'findNextSyncTarget', + value: function findNextSyncTarget() { + if (this.currentSyncTarget != null || this.isSynced) { + return; // "The current sync has not finished!" + } + + var syncUser = null; + for (var uid in this.connections) { + if (!this.connections[uid].isSynced) { + syncUser = uid; + break; + } + } + var conn = this; + if (syncUser != null) { + this.currentSyncTarget = syncUser; + this.y.db.requestTransaction(regeneratorRuntime.mark(function _callee() { + var stateSet, deleteSet; + return regeneratorRuntime.wrap(function _callee$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + return _context.delegateYield(this.getStateSet(), 't0', 1); + + case 1: + stateSet = _context.t0; + return _context.delegateYield(this.getDeleteSet(), 't1', 3); + + case 3: + deleteSet = _context.t1; + + conn.send(syncUser, { + type: 'sync step 1', + stateSet: stateSet, + deleteSet: deleteSet, + protocolVersion: conn.protocolVersion + }); + + case 5: + case 'end': + return _context.stop(); + } + } + }, _callee, this); + })); + } else { + this.y.db.requestTransaction(regeneratorRuntime.mark(function _callee2() { + var _iteratorNormalCompletion3, _didIteratorError3, _iteratorError3, _iterator3, _step3, f; + + return regeneratorRuntime.wrap(function _callee2$(_context2) { + while (1) { + switch (_context2.prev = _context2.next) { + case 0: + // it is crucial that isSynced is set at the time garbageCollectAfterSync is called + conn.isSynced = true; + return _context2.delegateYield(this.garbageCollectAfterSync(), 't0', 2); + + case 2: + // call whensynced listeners + _iteratorNormalCompletion3 = true; + _didIteratorError3 = false; + _iteratorError3 = undefined; + _context2.prev = 5; + for (_iterator3 = conn.whenSyncedListeners[Symbol.iterator](); !(_iteratorNormalCompletion3 = (_step3 = _iterator3.next()).done); _iteratorNormalCompletion3 = true) { + f = _step3.value; + + f(); + } + _context2.next = 13; + break; + + case 9: + _context2.prev = 9; + _context2.t1 = _context2['catch'](5); + _didIteratorError3 = true; + _iteratorError3 = _context2.t1; + + case 13: + _context2.prev = 13; + _context2.prev = 14; + + if (!_iteratorNormalCompletion3 && _iterator3.return) { + _iterator3.return(); + } + + case 16: + _context2.prev = 16; + + if (!_didIteratorError3) { + _context2.next = 19; + break; + } + + throw _iteratorError3; + + case 19: + return _context2.finish(16); + + case 20: + return _context2.finish(13); + + case 21: + conn.whenSyncedListeners = []; + + case 22: + case 'end': + return _context2.stop(); + } + } + }, _callee2, this, [[5, 9, 13, 21], [14,, 16, 20]]); + })); + } + } + }, { + key: 'send', + value: function send(uid, message) { + if (this.debug) { + console.log('send ' + this.userId + ' -> ' + uid + ': ' + message.type, message); // eslint-disable-line + } + } + /* + Buffer operations, and broadcast them when ready. + */ + + }, { + key: 'broadcastOps', + value: function broadcastOps(ops) { + ops = ops.map(function (op) { + return Y.Struct[op.struct].encode(op); + }); + var self = this; + function broadcastOperations() { + if (self.broadcastOpBuffer.length > 0) { + self.broadcast({ + type: 'update', + ops: self.broadcastOpBuffer + }); + self.broadcastOpBuffer = []; + } + } + if (this.broadcastOpBuffer.length === 0) { + this.broadcastOpBuffer = ops; + if (this.y.db.transactionInProgress) { + this.y.db.whenTransactionsFinished().then(broadcastOperations); + } else { + setTimeout(broadcastOperations, 0); + } + } else { + this.broadcastOpBuffer = this.broadcastOpBuffer.concat(ops); + } + } + /* + You received a raw message, and you know that it is intended for Yjs. Then call this function. + */ + + }, { + key: 'receiveMessage', + value: function receiveMessage(sender /* :UserId */, message /* :Message */) { + var _this = this; + + if (sender === this.userId) { + return; + } + if (this.debug) { + console.log('receive ' + sender + ' -> ' + this.userId + ': ' + message.type, JSON.parse(JSON.stringify(message))); // eslint-disable-line + } + if (message.protocolVersion != null && message.protocolVersion !== this.protocolVersion) { + console.error('You tried to sync with a yjs instance that has a different protocol version\n (You: ' + this.protocolVersion + ', Client: ' + message.protocolVersion + ').\n The sync was stopped. You need to upgrade your dependencies (especially Yjs & the Connector)!\n '); + this.send(sender, { + type: 'sync stop', + protocolVersion: this.protocolVersion + }); + return; + } + if (message.type === 'sync step 1') { + (function () { + var conn = _this; + var m = message; + _this.y.db.requestTransaction(regeneratorRuntime.mark(function _callee3() { + var currentStateSet, ds, ops; + return regeneratorRuntime.wrap(function _callee3$(_context3) { + while (1) { + switch (_context3.prev = _context3.next) { + case 0: + return _context3.delegateYield(this.getStateSet(), 't0', 1); + + case 1: + currentStateSet = _context3.t0; + return _context3.delegateYield(this.applyDeleteSet(m.deleteSet), 't1', 3); + + case 3: + return _context3.delegateYield(this.getDeleteSet(), 't2', 4); + + case 4: + ds = _context3.t2; + return _context3.delegateYield(this.getOperations(m.stateSet), 't3', 6); + + case 6: + ops = _context3.t3; + + conn.send(sender, { + type: 'sync step 2', + os: ops, + stateSet: currentStateSet, + deleteSet: ds, + protocolVersion: this.protocolVersion + }); + if (this.forwardToSyncingClients) { + conn.syncingClients.push(sender); + setTimeout(function () { + conn.syncingClients = conn.syncingClients.filter(function (cli) { + return cli !== sender; + }); + conn.send(sender, { + type: 'sync done' + }); + }, 5000); // TODO: conn.syncingClientDuration) + } else { + conn.send(sender, { + type: 'sync done' + }); + } + conn._setSyncedWith(sender); + + case 10: + case 'end': + return _context3.stop(); + } + } + }, _callee3, this); + })); + })(); + } else if (message.type === 'sync step 2') { + var broadcastHB; + var db; + var defer; + + (function () { + var conn = _this; + broadcastHB = !_this.broadcastedHB; + + _this.broadcastedHB = true; + db = _this.y.db; + defer = {}; + + defer.promise = new Promise(function (resolve) { + defer.resolve = resolve; + }); + _this.syncStep2 = defer.promise; + var m /* :MessageSyncStep2 */ = message; + db.requestTransaction(regeneratorRuntime.mark(function _callee5() { + return regeneratorRuntime.wrap(function _callee5$(_context5) { + while (1) { + switch (_context5.prev = _context5.next) { + case 0: + return _context5.delegateYield(this.applyDeleteSet(m.deleteSet), 't0', 1); + + case 1: + this.store.apply(m.os); + db.requestTransaction(regeneratorRuntime.mark(function _callee4() { + var ops; + return regeneratorRuntime.wrap(function _callee4$(_context4) { + while (1) { + switch (_context4.prev = _context4.next) { + case 0: + return _context4.delegateYield(this.getOperations(m.stateSet), 't0', 1); + + case 1: + ops = _context4.t0; + + if (ops.length > 0) { + if (!broadcastHB) { + // TODO: consider to broadcast here.. + conn.send(sender, { + type: 'update', + ops: ops + }); + } else { + // broadcast only once! + conn.broadcastOps(ops); + } + } + defer.resolve(); + + case 4: + case 'end': + return _context4.stop(); + } + } + }, _callee4, this); + })); + + case 3: + case 'end': + return _context5.stop(); + } + } + }, _callee5, this); + })); + })(); + } else if (message.type === 'sync done') { + var self = this; + this.syncStep2.then(function () { + self._setSyncedWith(sender); + }); + } else if (message.type === 'update') { + if (this.forwardToSyncingClients) { + var _iteratorNormalCompletion4 = true; + var _didIteratorError4 = false; + var _iteratorError4 = undefined; + + try { + for (var _iterator4 = this.syncingClients[Symbol.iterator](), _step4; !(_iteratorNormalCompletion4 = (_step4 = _iterator4.next()).done); _iteratorNormalCompletion4 = true) { + var client = _step4.value; + + this.send(client, message); + } + } catch (err) { + _didIteratorError4 = true; + _iteratorError4 = err; + } finally { + try { + if (!_iteratorNormalCompletion4 && _iterator4.return) { + _iterator4.return(); + } + } finally { + if (_didIteratorError4) { + throw _iteratorError4; + } + } + } + } + if (this.y.db.forwardAppliedOperations) { + var delops = message.ops.filter(function (o) { + return o.struct === 'Delete'; + }); + if (delops.length > 0) { + this.broadcastOps(delops); + } + } + this.y.db.apply(message.ops); + } + } + }, { + key: '_setSyncedWith', + value: function _setSyncedWith(user) { + var conn = this.connections[user]; + if (conn != null) { + conn.isSynced = true; + } + if (user === this.currentSyncTarget) { + this.currentSyncTarget = null; + this.findNextSyncTarget(); + } + } + /* + Currently, the HB encodes operations as JSON. For the moment I want to keep it + that way. Maybe we support encoding in the HB as XML in the future, but for now I don't want + too much overhead. Y is very likely to get changed a lot in the future + Because we don't want to encode JSON as string (with character escaping, wich makes it pretty much unreadable) + we encode the JSON as XML. + When the HB support encoding as XML, the format should look pretty much like this. + does not support primitive values as array elements + expects an ltx (less than xml) object + */ + + }, { + key: 'parseMessageFromXml', + value: function parseMessageFromXml(m /* :any */) { + function parseArray(node) { + var _iteratorNormalCompletion5 = true; + var _didIteratorError5 = false; + var _iteratorError5 = undefined; + + try { + for (var _iterator5 = node.children[Symbol.iterator](), _step5; !(_iteratorNormalCompletion5 = (_step5 = _iterator5.next()).done); _iteratorNormalCompletion5 = true) { + var n = _step5.value; + + if (n.getAttribute('isArray') === 'true') { + return parseArray(n); + } else { + return parseObject(n); + } + } + } catch (err) { + _didIteratorError5 = true; + _iteratorError5 = err; + } finally { + try { + if (!_iteratorNormalCompletion5 && _iterator5.return) { + _iterator5.return(); + } + } finally { + if (_didIteratorError5) { + throw _iteratorError5; + } + } + } + } + function parseObject(node /* :any */) { + var json = {}; + for (var attrName in node.attrs) { + var value = node.attrs[attrName]; + var int = parseInt(value, 10); + if (isNaN(int) || '' + int !== value) { + json[attrName] = value; + } else { + json[attrName] = int; + } + } + for (var n /* :any */ in node.children) { + var name = n.name; + if (n.getAttribute('isArray') === 'true') { + json[name] = parseArray(n); + } else { + json[name] = parseObject(n); + } + } + return json; + } + parseObject(m); + } + /* + encode message in xml + we use string because Strophe only accepts an "xml-string".. + So {a:4,b:{c:5}} will look like + + + + m - ltx element + json - Object + */ + + }, { + key: 'encodeMessageToXml', + value: function encodeMessageToXml(msg, obj) { + // attributes is optional + function encodeObject(m, json) { + for (var name in json) { + var value = json[name]; + if (name == null) { + // nop + } else if (value.constructor === Object) { + encodeObject(m.c(name), value); + } else if (value.constructor === Array) { + encodeArray(m.c(name), value); + } else { + m.setAttribute(name, value); + } + } + } + function encodeArray(m, array) { + m.setAttribute('isArray', 'true'); + var _iteratorNormalCompletion6 = true; + var _didIteratorError6 = false; + var _iteratorError6 = undefined; + + try { + for (var _iterator6 = array[Symbol.iterator](), _step6; !(_iteratorNormalCompletion6 = (_step6 = _iterator6.next()).done); _iteratorNormalCompletion6 = true) { + var e = _step6.value; + + if (e.constructor === Object) { + encodeObject(m.c('array-element'), e); + } else { + encodeArray(m.c('array-element'), e); + } + } + } catch (err) { + _didIteratorError6 = true; + _iteratorError6 = err; + } finally { + try { + if (!_iteratorNormalCompletion6 && _iterator6.return) { + _iterator6.return(); + } + } finally { + if (_didIteratorError6) { + throw _iteratorError6; + } + } + } + } + if (obj.constructor === Object) { + encodeObject(msg.c('y', { xmlns: 'http://y.ninja/connector-stanza' }), obj); + } else if (obj.constructor === Array) { + encodeArray(msg.c('y', { xmlns: 'http://y.ninja/connector-stanza' }), obj); + } else { + throw new Error("I can't encode this json!"); + } + } + }]); + + return AbstractConnector; + }(); + + Y.AbstractConnector = AbstractConnector; +}; + +},{}],5:[function(require,module,exports){ +/* global getRandom, async */ +'use strict'; + +var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); + +var _get = function get(object, property, receiver) { if (object === null) object = Function.prototype; var desc = Object.getOwnPropertyDescriptor(object, property); if (desc === undefined) { var parent = Object.getPrototypeOf(object); if (parent === null) { return undefined; } else { return get(parent, property, receiver); } } else if ("value" in desc) { return desc.value; } else { var getter = desc.get; if (getter === undefined) { return undefined; } return getter.call(receiver); } }; + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } + +function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } + +module.exports = function (Y) { + var globalRoom = { + users: {}, + buffers: {}, // TODO: reimplement this idea. This does not cover all cases!! Here, you have a queue which is unrealistic (i.e. think about multiple incoming connections) + removeUser: function removeUser(user) { + for (var i in this.users) { + this.users[i].userLeft(user); + } + delete this.users[user]; + delete this.buffers[user]; + }, + addUser: function addUser(connector) { + this.users[connector.userId] = connector; + this.buffers[connector.userId] = {}; + for (var uname in this.users) { + if (uname !== connector.userId) { + var u = this.users[uname]; + u.userJoined(connector.userId, 'master'); + connector.userJoined(u.userId, 'master'); + } + } + }, + whenTransactionsFinished: function whenTransactionsFinished() { + var ps = []; + for (var name in this.users) { + ps.push(this.users[name].y.db.whenTransactionsFinished()); + } + return Promise.all(ps); + }, + flushOne: function flushOne() { + var bufs = []; + for (var receiver in globalRoom.buffers) { + var buff = globalRoom.buffers[receiver]; + var push = false; + for (var sender in buff) { + if (buff[sender].length > 0) { + push = true; + break; + } + } + if (push) { + bufs.push(receiver); + } + } + if (bufs.length > 0) { + var userId = getRandom(bufs); + var _buff = globalRoom.buffers[userId]; + var _sender = getRandom(Object.keys(_buff)); + var m = _buff[_sender].shift(); + if (_buff[_sender].length === 0) { + delete _buff[_sender]; + } + var user = globalRoom.users[userId]; + user.receiveMessage(m[0], m[1]); + return user.y.db.whenTransactionsFinished(); + } else { + return false; + } + }, + flushAll: function flushAll() { + return new Promise(function (resolve) { + // flushes may result in more created operations, + // flush until there is nothing more to flush + function nextFlush() { + var c = globalRoom.flushOne(); + if (c) { + while (c) { + c = globalRoom.flushOne(); + } + globalRoom.whenTransactionsFinished().then(nextFlush); + } else { + setTimeout(function () { + var c = globalRoom.flushOne(); + if (c) { + c.then(function () { + globalRoom.whenTransactionsFinished().then(nextFlush); + }); + } else { + resolve(); + } + }, 0); + } + } + globalRoom.whenTransactionsFinished().then(nextFlush); + }); + } + }; + Y.utils.globalRoom = globalRoom; + + var userIdCounter = 0; + + var Test = function (_Y$AbstractConnector) { + _inherits(Test, _Y$AbstractConnector); + + function Test(y, options) { + _classCallCheck(this, Test); + + if (options === undefined) { + throw new Error('Options must not be undefined!'); + } + options.role = 'master'; + options.forwardToSyncingClients = false; + + var _this = _possibleConstructorReturn(this, Object.getPrototypeOf(Test).call(this, y, options)); + + _this.setUserId(userIdCounter++ + '').then(function () { + globalRoom.addUser(_this); + }); + _this.globalRoom = globalRoom; + _this.syncingClientDuration = 0; + return _this; + } + + _createClass(Test, [{ + key: 'receiveMessage', + value: function receiveMessage(sender, m) { + _get(Object.getPrototypeOf(Test.prototype), 'receiveMessage', this).call(this, sender, JSON.parse(JSON.stringify(m))); + } + }, { + key: 'send', + value: function send(userId, message) { + var buffer = globalRoom.buffers[userId]; + if (buffer != null) { + if (buffer[this.userId] == null) { + buffer[this.userId] = []; + } + buffer[this.userId].push(JSON.parse(JSON.stringify([this.userId, message]))); + } + } + }, { + key: 'broadcast', + value: function broadcast(message) { + for (var key in globalRoom.buffers) { + var buff = globalRoom.buffers[key]; + if (buff[this.userId] == null) { + buff[this.userId] = []; + } + buff[this.userId].push(JSON.parse(JSON.stringify([this.userId, message]))); + } + } + }, { + key: 'isDisconnected', + value: function isDisconnected() { + return globalRoom.users[this.userId] == null; + } + }, { + key: 'reconnect', + value: function reconnect() { + if (this.isDisconnected()) { + globalRoom.addUser(this); + _get(Object.getPrototypeOf(Test.prototype), 'reconnect', this).call(this); + } + return Y.utils.globalRoom.flushAll(); + } + }, { + key: 'disconnect', + value: function disconnect() { + if (!this.isDisconnected()) { + globalRoom.removeUser(this.userId); + _get(Object.getPrototypeOf(Test.prototype), 'disconnect', this).call(this); + } + return this.y.db.whenTransactionsFinished(); + } + }, { + key: 'flush', + value: function flush() { + var self = this; + return async(regeneratorRuntime.mark(function _callee() { + var buff, sender, m; + return regeneratorRuntime.wrap(function _callee$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + buff = globalRoom.buffers[self.userId]; + + while (Object.keys(buff).length > 0) { + sender = getRandom(Object.keys(buff)); + m = buff[sender].shift(); + + if (buff[sender].length === 0) { + delete buff[sender]; + } + this.receiveMessage(m[0], m[1]); + } + _context.next = 4; + return self.whenTransactionsFinished(); + + case 4: + case 'end': + return _context.stop(); + } + } + }, _callee, this); + })); + } + }]); + + return Test; + }(Y.AbstractConnector); + + Y.Test = Test; +}; + +},{}],6:[function(require,module,exports){ +/* @flow */ +'use strict'; + +var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +module.exports = function (Y /* :any */) { + /* + Partial definition of an OperationStore. + TODO: name it Database, operation store only holds operations. + A database definition must alse define the following methods: + * logTable() (optional) + - show relevant information information in a table + * requestTransaction(makeGen) + - request a transaction + * destroy() + - destroy the database + */ + + var AbstractDatabase = function () { + /* :: + y: YConfig; + forwardAppliedOperations: boolean; + listenersById: Object; + listenersByIdExecuteNow: Array; + listenersByIdRequestPending: boolean; + initializedTypes: Object; + whenUserIdSetListener: ?Function; + waitingTransactions: Array; + transactionInProgress: boolean; + executeOrder: Array; + gc1: Array; + gc2: Array; + gcTimeout: number; + gcInterval: any; + garbageCollect: Function; + executeOrder: Array; // for debugging only + userId: UserId; + opClock: number; + transactionsFinished: ?{promise: Promise, resolve: any}; + transact: (x: ?Generator) => any; + */ + + function AbstractDatabase(y, opts) { + _classCallCheck(this, AbstractDatabase); + + this.y = y; + var os = this; + this.userId = null; + var resolve; + this.userIdPromise = new Promise(function (r) { + resolve = r; + }); + this.userIdPromise.resolve = resolve; + // whether to broadcast all applied operations (insert & delete hook) + this.forwardAppliedOperations = false; + // E.g. this.listenersById[id] : Array + this.listenersById = {}; + // Execute the next time a transaction is requested + this.listenersByIdExecuteNow = []; + // A transaction is requested + this.listenersByIdRequestPending = false; + /* To make things more clear, the following naming conventions: + * ls : we put this.listenersById on ls + * l : Array + * id : Id (can't use as property name) + * sid : String (converted from id via JSON.stringify + so we can use it as a property name) + Always remember to first overwrite + a property before you iterate over it! + */ + // TODO: Use ES7 Weak Maps. This way types that are no longer user, + // wont be kept in memory. + this.initializedTypes = {}; + this.waitingTransactions = []; + this.transactionInProgress = false; + this.transactionIsFlushed = false; + if (typeof YConcurrency_TestingMode !== 'undefined') { + this.executeOrder = []; + } + this.gc1 = []; // first stage + this.gc2 = []; // second stage -> after that, remove the op + this.gcTimeout = !opts.gcTimeout ? 50000 : opts.gcTimeouts; + function garbageCollect() { + return os.whenTransactionsFinished().then(function () { + if (os.gc1.length > 0 || os.gc2.length > 0) { + if (!os.y.isConnected()) { + console.warn('gc should be empty when disconnected!'); + } + return new Promise(function (resolve) { + os.requestTransaction(regeneratorRuntime.mark(function _callee() { + var i, oid; + return regeneratorRuntime.wrap(function _callee$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + if (!(os.y.connector != null && os.y.connector.isSynced)) { + _context.next = 10; + break; + } + + i = 0; + + case 2: + if (!(i < os.gc2.length)) { + _context.next = 8; + break; + } + + oid = os.gc2[i]; + return _context.delegateYield(this.garbageCollectOperation(oid), 't0', 5); + + case 5: + i++; + _context.next = 2; + break; + + case 8: + os.gc2 = os.gc1; + os.gc1 = []; + + case 10: + // TODO: Use setInterval here instead (when garbageCollect is called several times there will be several timeouts..) + if (os.gcTimeout > 0) { + os.gcInterval = setTimeout(garbageCollect, os.gcTimeout); + } + resolve(); + + case 12: + case 'end': + return _context.stop(); + } + } + }, _callee, this); + })); + }); + } else { + // TODO: see above + if (os.gcTimeout > 0) { + os.gcInterval = setTimeout(garbageCollect, os.gcTimeout); + } + return Promise.resolve(); + } + }); + } + this.garbageCollect = garbageCollect; + if (this.gcTimeout > 0) { + garbageCollect(); + } + } + + _createClass(AbstractDatabase, [{ + key: 'queueGarbageCollector', + value: function queueGarbageCollector(id) { + if (this.y.isConnected()) { + this.gc1.push(id); + } + } + }, { + key: 'emptyGarbageCollector', + value: function emptyGarbageCollector() { + var _this = this; + + return new Promise(function (resolve) { + var check = function check() { + if (_this.gc1.length > 0 || _this.gc2.length > 0) { + _this.garbageCollect().then(check); + } else { + resolve(); + } + }; + setTimeout(check, 0); + }); + } + }, { + key: 'addToDebug', + value: function addToDebug() { + if (typeof YConcurrency_TestingMode !== 'undefined') { + var command /* :string */ = Array.prototype.map.call(arguments, function (s) { + if (typeof s === 'string') { + return s; + } else { + return JSON.stringify(s); + } + }).join('').replace(/"/g, "'").replace(/,/g, ', ').replace(/:/g, ': '); + this.executeOrder.push(command); + } + } + }, { + key: 'getDebugData', + value: function getDebugData() { + console.log(this.executeOrder.join('\n')); + } + }, { + key: 'stopGarbageCollector', + value: function stopGarbageCollector() { + var self = this; + return new Promise(function (resolve) { + self.requestTransaction(regeneratorRuntime.mark(function _callee2() { + var ungc /* :Array */, i, op; + return regeneratorRuntime.wrap(function _callee2$(_context2) { + while (1) { + switch (_context2.prev = _context2.next) { + case 0: + ungc = self.gc1.concat(self.gc2); + + self.gc1 = []; + self.gc2 = []; + i = 0; + + case 4: + if (!(i < ungc.length)) { + _context2.next = 13; + break; + } + + return _context2.delegateYield(this.getOperation(ungc[i]), 't0', 6); + + case 6: + op = _context2.t0; + + if (!(op != null)) { + _context2.next = 10; + break; + } + + delete op.gc; + return _context2.delegateYield(this.setOperation(op), 't1', 10); + + case 10: + i++; + _context2.next = 4; + break; + + case 13: + resolve(); + + case 14: + case 'end': + return _context2.stop(); + } + } + }, _callee2, this); + })); + }); + } + /* + Try to add to GC. + TODO: rename this function + Rulez: + * Only gc if this user is online + * The most left element in a list must not be gc'd. + => There is at least one element in the list + returns true iff op was added to GC + */ + + }, { + key: 'addToGarbageCollector', + value: regeneratorRuntime.mark(function addToGarbageCollector(op, left) { + var gc; + return regeneratorRuntime.wrap(function addToGarbageCollector$(_context3) { + while (1) { + switch (_context3.prev = _context3.next) { + case 0: + if (!(op.gc == null && op.deleted === true)) { + _context3.next = 15; + break; + } + + gc = false; + + if (!(left != null && left.deleted === true)) { + _context3.next = 6; + break; + } + + gc = true; + _context3.next = 10; + break; + + case 6: + if (!(op.content != null && op.content.length > 1)) { + _context3.next = 10; + break; + } + + return _context3.delegateYield(this.getInsertionCleanStart([op.id[0], op.id[1] + 1]), 't0', 8); + + case 8: + op = _context3.t0; + + gc = true; + + case 10: + if (!gc) { + _context3.next = 15; + break; + } + + op.gc = true; + return _context3.delegateYield(this.setOperation(op), 't1', 13); + + case 13: + this.store.queueGarbageCollector(op.id); + return _context3.abrupt('return', true); + + case 15: + return _context3.abrupt('return', false); + + case 16: + case 'end': + return _context3.stop(); + } + } + }, addToGarbageCollector, this); + }) + }, { + key: 'removeFromGarbageCollector', + value: function removeFromGarbageCollector(op) { + function filter(o) { + return !Y.utils.compareIds(o, op.id); + } + this.gc1 = this.gc1.filter(filter); + this.gc2 = this.gc2.filter(filter); + delete op.gc; + } + }, { + key: 'destroy', + value: regeneratorRuntime.mark(function destroy() { + var key, type; + return regeneratorRuntime.wrap(function destroy$(_context4) { + while (1) { + switch (_context4.prev = _context4.next) { + case 0: + clearInterval(this.gcInterval); + this.gcInterval = null; + for (key in this.initializedTypes) { + type = this.initializedTypes[key]; + + if (type._destroy != null) { + type._destroy(); + } else { + console.error('The type you included does not provide destroy functionality, it will remain in memory (updating your packages will help).'); + } + } + + case 3: + case 'end': + return _context4.stop(); + } + } + }, destroy, this); + }) + }, { + key: 'setUserId', + value: function setUserId(userId) { + if (!this.userIdPromise.inProgress) { + this.userIdPromise.inProgress = true; + var self = this; + self.requestTransaction(regeneratorRuntime.mark(function _callee3() { + var state; + return regeneratorRuntime.wrap(function _callee3$(_context5) { + while (1) { + switch (_context5.prev = _context5.next) { + case 0: + self.userId = userId; + return _context5.delegateYield(this.getState(userId), 't0', 2); + + case 2: + state = _context5.t0; + + self.opClock = state.clock; + self.userIdPromise.resolve(userId); + + case 5: + case 'end': + return _context5.stop(); + } + } + }, _callee3, this); + })); + } + return this.userIdPromise; + } + }, { + key: 'whenUserIdSet', + value: function whenUserIdSet(f) { + this.userIdPromise.then(f); + } + }, { + key: 'getNextOpId', + value: function getNextOpId(numberOfIds) { + if (numberOfIds == null) { + throw new Error('getNextOpId expects the number of created ids to create!'); + } else if (this.userId == null) { + throw new Error('OperationStore not yet initialized!'); + } else { + var id = [this.userId, this.opClock]; + this.opClock += numberOfIds; + return id; + } + } + /* + Apply a list of operations. + * get a transaction + * check whether all Struct.*.requiredOps are in the OS + * check if it is an expected op (otherwise wait for it) + * check if was deleted, apply a delete operation after op was applied + */ + + }, { + key: 'apply', + value: function apply(ops) { + for (var i = 0; i < ops.length; i++) { + var o = ops[i]; + if (o.id == null || o.id[0] !== this.y.connector.userId) { + var required = Y.Struct[o.struct].requiredOps(o); + if (o.requires != null) { + required = required.concat(o.requires); + } + this.whenOperationsExist(required, o); + } + } + } + /* + op is executed as soon as every operation requested is available. + Note that Transaction can (and should) buffer requests. + */ + + }, { + key: 'whenOperationsExist', + value: function whenOperationsExist(ids, op) { + if (ids.length > 0) { + var listener = { + op: op, + missing: ids.length + }; + + for (var i = 0; i < ids.length; i++) { + var id = ids[i]; + var sid = JSON.stringify(id); + var l = this.listenersById[sid]; + if (l == null) { + l = []; + this.listenersById[sid] = l; + } + l.push(listener); + } + } else { + this.listenersByIdExecuteNow.push({ + op: op + }); + } + + if (this.listenersByIdRequestPending) { + return; + } + + this.listenersByIdRequestPending = true; + var store = this; + + this.requestTransaction(regeneratorRuntime.mark(function _callee4() { + var exeNow, ls, key, o, sid, l, id, op, _i, _listener, _o; + + return regeneratorRuntime.wrap(function _callee4$(_context6) { + while (1) { + switch (_context6.prev = _context6.next) { + case 0: + exeNow = store.listenersByIdExecuteNow; + + store.listenersByIdExecuteNow = []; + + ls = store.listenersById; + + store.listenersById = {}; + + store.listenersByIdRequestPending = false; + + key = 0; + + case 6: + if (!(key < exeNow.length)) { + _context6.next = 12; + break; + } + + o = exeNow[key].op; + return _context6.delegateYield(store.tryExecute.call(this, o), 't0', 9); + + case 9: + key++; + _context6.next = 6; + break; + + case 12: + _context6.t1 = regeneratorRuntime.keys(ls); + + case 13: + if ((_context6.t2 = _context6.t1()).done) { + _context6.next = 39; + break; + } + + sid = _context6.t2.value; + l = ls[sid]; + id = JSON.parse(sid); + + if (!(typeof id[1] === 'string')) { + _context6.next = 22; + break; + } + + return _context6.delegateYield(this.getOperation(id), 't3', 19); + + case 19: + op = _context6.t3; + _context6.next = 24; + break; + + case 22: + return _context6.delegateYield(this.getInsertion(id), 't4', 23); + + case 23: + op = _context6.t4; + + case 24: + if (!(op == null)) { + _context6.next = 28; + break; + } + + store.listenersById[sid] = l; + _context6.next = 37; + break; + + case 28: + _i = 0; + + case 29: + if (!(_i < l.length)) { + _context6.next = 37; + break; + } + + _listener = l[_i]; + _o = _listener.op; + + if (!(--_listener.missing === 0)) { + _context6.next = 34; + break; + } + + return _context6.delegateYield(store.tryExecute.call(this, _o), 't5', 34); + + case 34: + _i++; + _context6.next = 29; + break; + + case 37: + _context6.next = 13; + break; + + case 39: + case 'end': + return _context6.stop(); + } + } + }, _callee4, this); + })); + } + /* + Actually execute an operation, when all expected operations are available. + */ + /* :: // TODO: this belongs somehow to transaction + store: Object; + getOperation: any; + isGarbageCollected: any; + addOperation: any; + whenOperationsExist: any; + */ + + }, { + key: 'tryExecute', + value: regeneratorRuntime.mark(function tryExecute(op) { + var defined, overlapSize, opid, isGarbageCollected; + return regeneratorRuntime.wrap(function tryExecute$(_context7) { + while (1) { + switch (_context7.prev = _context7.next) { + case 0: + this.store.addToDebug('yield* this.store.tryExecute.call(this, ', JSON.stringify(op), ')'); + + if (!(op.struct === 'Delete')) { + _context7.next = 5; + break; + } + + return _context7.delegateYield(Y.Struct.Delete.execute.call(this, op), 't0', 3); + + case 3: + _context7.next = 33; + break; + + case 5: + return _context7.delegateYield(this.getInsertion(op.id), 't1', 6); + + case 6: + defined = _context7.t1; + + case 7: + if (!(defined != null && defined.content != null)) { + _context7.next = 21; + break; + } + + if (!(defined.id[1] + defined.content.length < op.id[1] + op.content.length)) { + _context7.next = 18; + break; + } + + overlapSize = defined.content.length - (op.id[1] - defined.id[1]); + + op.content.splice(0, overlapSize); + op.id = [op.id[0], op.id[1] + overlapSize]; + op.left = Y.utils.getLastId(defined); + op.origin = op.left; + return _context7.delegateYield(this.getOperation(op.id), 't2', 15); + + case 15: + defined = _context7.t2; + _context7.next = 19; + break; + + case 18: + return _context7.abrupt('break', 21); + + case 19: + _context7.next = 7; + break; + + case 21: + if (!(defined == null)) { + _context7.next = 33; + break; + } + + opid = op.id; + return _context7.delegateYield(this.isGarbageCollected(opid), 't3', 24); + + case 24: + isGarbageCollected = _context7.t3; + + if (isGarbageCollected) { + _context7.next = 33; + break; + } + + return _context7.delegateYield(Y.Struct[op.struct].execute.call(this, op), 't4', 27); + + case 27: + return _context7.delegateYield(this.addOperation(op), 't5', 28); + + case 28: + return _context7.delegateYield(this.store.operationAdded(this, op), 't6', 29); + + case 29: + if (Y.utils.compareIds(opid, op.id)) { + _context7.next = 32; + break; + } + + return _context7.delegateYield(this.getOperation(opid), 't7', 31); + + case 31: + op = _context7.t7; + + case 32: + return _context7.delegateYield(this.tryCombineWithLeft(op), 't8', 33); + + case 33: + case 'end': + return _context7.stop(); + } + } + }, tryExecute, this); + }) + /* + * Called by a transaction when an operation is added. + * This function is especially important for y-indexeddb, where several instances may share a single database. + * Every time an operation is created by one instance, it is send to all other instances and operationAdded is called + * + * If it's not a Delete operation: + * * Checks if another operation is executable (listenersById) + * * Update state, if possible + * + * Always: + * * Call type + */ + + }, { + key: 'operationAdded', + value: regeneratorRuntime.mark(function operationAdded(transaction, op) { + var target, type, opLen, i, sid, l, key, listener, t, parentIsDeleted, o, len, startId, _i2, id, opIsDeleted, delop; + + return regeneratorRuntime.wrap(function operationAdded$(_context8) { + while (1) { + switch (_context8.prev = _context8.next) { + case 0: + if (!(op.struct === 'Delete')) { + _context8.next = 8; + break; + } + + return _context8.delegateYield(transaction.getInsertion(op.target), 't0', 2); + + case 2: + target = _context8.t0; + type = this.initializedTypes[JSON.stringify(target.parent)]; + + if (!(type != null)) { + _context8.next = 6; + break; + } + + return _context8.delegateYield(type._changed(transaction, op), 't1', 6); + + case 6: + _context8.next = 35; + break; + + case 8: + return _context8.delegateYield(transaction.updateState(op.id[0]), 't2', 9); + + case 9: + opLen = op.content != null ? op.content.length : 1; + + for (i = 0; i < opLen; i++) { + // notify whenOperation listeners (by id) + sid = JSON.stringify([op.id[0], op.id[1] + i]); + l = this.listenersById[sid]; + + delete this.listenersById[sid]; + if (l != null) { + for (key in l) { + listener = l[key]; + + if (--listener.missing === 0) { + this.whenOperationsExist([], listener.op); + } + } + } + } + t = this.initializedTypes[JSON.stringify(op.parent)]; + + // if parent is deleted, mark as gc'd and return + + if (!(op.parent != null)) { + _context8.next = 18; + break; + } + + return _context8.delegateYield(transaction.isDeleted(op.parent), 't3', 14); + + case 14: + parentIsDeleted = _context8.t3; + + if (!parentIsDeleted) { + _context8.next = 18; + break; + } + + return _context8.delegateYield(transaction.deleteList(op.id), 't4', 17); + + case 17: + return _context8.abrupt('return'); + + case 18: + if (!(t != null)) { + _context8.next = 21; + break; + } + + o = Y.utils.copyOperation(op); + return _context8.delegateYield(t._changed(transaction, o), 't5', 21); + + case 21: + if (op.deleted) { + _context8.next = 35; + break; + } + + // Delete if DS says this is actually deleted + len = op.content != null ? op.content.length : 1; + startId = op.id; // You must not use op.id in the following loop, because op will change when deleted + + _i2 = 0; + + case 25: + if (!(_i2 < len)) { + _context8.next = 35; + break; + } + + id = [startId[0], startId[1] + _i2]; + return _context8.delegateYield(transaction.isDeleted(id), 't6', 28); + + case 28: + opIsDeleted = _context8.t6; + + if (!opIsDeleted) { + _context8.next = 32; + break; + } + + delop = { + struct: 'Delete', + target: id + }; + return _context8.delegateYield(this.tryExecute.call(transaction, delop), 't7', 32); + + case 32: + _i2++; + _context8.next = 25; + break; + + case 35: + case 'end': + return _context8.stop(); + } + } + }, operationAdded, this); + }) + }, { + key: 'whenTransactionsFinished', + value: function whenTransactionsFinished() { + if (this.transactionInProgress) { + if (this.transactionsFinished == null) { + var resolve; + var promise = new Promise(function (r) { + resolve = r; + }); + this.transactionsFinished = { + resolve: resolve, + promise: promise + }; + return promise; + } else { + return this.transactionsFinished.promise; + } + } else { + return Promise.resolve(); + } + } + // Check if there is another transaction request. + // * the last transaction is always a flush :) + + }, { + key: 'getNextRequest', + value: function getNextRequest() { + if (this.waitingTransactions.length === 0) { + if (this.transactionIsFlushed) { + this.transactionInProgress = false; + this.transactionIsFlushed = false; + if (this.transactionsFinished != null) { + this.transactionsFinished.resolve(); + this.transactionsFinished = null; + } + return null; + } else { + this.transactionIsFlushed = true; + return regeneratorRuntime.mark(function _callee5() { + return regeneratorRuntime.wrap(function _callee5$(_context9) { + while (1) { + switch (_context9.prev = _context9.next) { + case 0: + return _context9.delegateYield(this.flush(), 't0', 1); + + case 1: + case 'end': + return _context9.stop(); + } + } + }, _callee5, this); + }); + } + } else { + this.transactionIsFlushed = false; + return this.waitingTransactions.shift(); + } + } + }, { + key: 'requestTransaction', + value: function requestTransaction(makeGen /* :any */, callImmediately) { + var _this2 = this; + + this.waitingTransactions.push(makeGen); + if (!this.transactionInProgress) { + this.transactionInProgress = true; + setTimeout(function () { + _this2.transact(_this2.getNextRequest()); + }, 0); + } + } + }]); + + return AbstractDatabase; + }(); + + Y.AbstractDatabase = AbstractDatabase; +}; + +},{}],7:[function(require,module,exports){ +/* @flow */ +'use strict'; + +/* + An operation also defines the structure of a type. This is why operation and + structure are used interchangeably here. + + It must be of the type Object. I hope to achieve some performance + improvements when working on databases that support the json format. + + An operation must have the following properties: + + * encode + - Encode the structure in a readable format (preferably string- todo) + * decode (todo) + - decode structure to json + * execute + - Execute the semantics of an operation. + * requiredOps + - Operations that are required to execute this operation. +*/ + +module.exports = function (Y /* :any */) { + var Struct = { + /* This is the only operation that is actually not a structure, because + it is not stored in the OS. This is why it _does not_ have an id + op = { + target: Id + } + */ + Delete: { + encode: function encode(op) { + return op; + }, + requiredOps: function requiredOps(op) { + return []; // [op.target] + }, + execute: regeneratorRuntime.mark(function execute(op) { + return regeneratorRuntime.wrap(function execute$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + return _context.delegateYield(this.deleteOperation(op.target, op.length || 1), 't0', 1); + + case 1: + return _context.abrupt('return', _context.t0); + + case 2: + case 'end': + return _context.stop(); + } + } + }, execute, this); + }) + }, + Insert: { + /* { + content: [any], + opContent: Id, + id: Id, + left: Id, + origin: Id, + right: Id, + parent: Id, + parentSub: string (optional), // child of Map type + } + */ + encode: function encode(op /* :Insertion */) /* :Insertion */{ + // TODO: you could not send the "left" property, then you also have to + // "op.left = null" in $execute or $decode + var e /* :any */ = { + id: op.id, + left: op.left, + right: op.right, + origin: op.origin, + parent: op.parent, + struct: op.struct + }; + if (op.parentSub != null) { + e.parentSub = op.parentSub; + } + if (op.hasOwnProperty('opContent')) { + e.opContent = op.opContent; + } else { + e.content = op.content.slice(); + } + + return e; + }, + requiredOps: function requiredOps(op) { + var ids = []; + if (op.left != null) { + ids.push(op.left); + } + if (op.right != null) { + ids.push(op.right); + } + if (op.origin != null && !Y.utils.compareIds(op.left, op.origin)) { + ids.push(op.origin); + } + // if (op.right == null && op.left == null) { + ids.push(op.parent); + + if (op.opContent != null) { + ids.push(op.opContent); + } + return ids; + }, + getDistanceToOrigin: regeneratorRuntime.mark(function getDistanceToOrigin(op) { + var d, o; + return regeneratorRuntime.wrap(function getDistanceToOrigin$(_context2) { + while (1) { + switch (_context2.prev = _context2.next) { + case 0: + if (!(op.left == null)) { + _context2.next = 4; + break; + } + + return _context2.abrupt('return', 0); + + case 4: + d = 0; + return _context2.delegateYield(this.getInsertion(op.left), 't0', 6); + + case 6: + o = _context2.t0; + + case 7: + if (Y.utils.matchesId(o, op.origin)) { + _context2.next = 17; + break; + } + + d++; + + if (!(o.left == null)) { + _context2.next = 13; + break; + } + + return _context2.abrupt('break', 17); + + case 13: + return _context2.delegateYield(this.getInsertion(o.left), 't1', 14); + + case 14: + o = _context2.t1; + + case 15: + _context2.next = 7; + break; + + case 17: + return _context2.abrupt('return', d); + + case 18: + case 'end': + return _context2.stop(); + } + } + }, getDistanceToOrigin, this); + }), + /* + # $this has to find a unique position between origin and the next known character + # case 1: $origin equals $o.origin: the $creator parameter decides if left or right + # let $OL= [o1,o2,o3,o4], whereby $this is to be inserted between o1 and o4 + # o2,o3 and o4 origin is 1 (the position of o2) + # there is the case that $this.creator < o2.creator, but o3.creator < $this.creator + # then o2 knows o3. Since on another client $OL could be [o1,o3,o4] the problem is complex + # therefore $this would be always to the right of o3 + # case 2: $origin < $o.origin + # if current $this insert_position > $o origin: $this ins + # else $insert_position will not change + # (maybe we encounter case 1 later, then this will be to the right of $o) + # case 3: $origin > $o.origin + # $this insert_position is to the left of $o (forever!) + */ + execute: regeneratorRuntime.mark(function execute(op) { + var i, tryToRemergeLater, origin, distanceToOrigin, o, parent, start, startId, oOriginDistance, left, right, _i, m; + + return regeneratorRuntime.wrap(function execute$(_context3) { + while (1) { + switch (_context3.prev = _context3.next) { + case 0: + // loop counter + + // during this function some ops may get split into two pieces (e.g. with getInsertionCleanEnd) + // We try to merge them later, if possible + tryToRemergeLater = []; + + if (!(op.origin != null)) { + _context3.next = 8; + break; + } + + return _context3.delegateYield(this.getInsertionCleanEnd(op.origin), 't0', 3); + + case 3: + origin = _context3.t0; + + if (origin.originOf == null) { + origin.originOf = []; + } + origin.originOf.push(op.id); + return _context3.delegateYield(this.setOperation(origin), 't1', 7); + + case 7: + if (origin.right != null) { + tryToRemergeLater.push(origin.right); + } + + case 8: + return _context3.delegateYield(Struct.Insert.getDistanceToOrigin.call(this, op), 't2', 9); + + case 9: + distanceToOrigin = i = _context3.t2; + + if (!(op.left != null)) { + _context3.next = 23; + break; + } + + return _context3.delegateYield(this.getInsertionCleanEnd(op.left), 't3', 12); + + case 12: + o = _context3.t3; + + if (!Y.utils.compareIds(op.left, op.origin) && o.right != null) { + // only if not added previously + tryToRemergeLater.push(o.right); + } + + if (!(o.right == null)) { + _context3.next = 18; + break; + } + + _context3.t4 = null; + _context3.next = 20; + break; + + case 18: + return _context3.delegateYield(this.getOperation(o.right), 't5', 19); + + case 19: + _context3.t4 = _context3.t5; + + case 20: + o = _context3.t4; + _context3.next = 34; + break; + + case 23: + return _context3.delegateYield(this.getOperation(op.parent), 't6', 24); + + case 24: + parent = _context3.t6; + startId = op.parentSub ? parent.map[op.parentSub] : parent.start; + + if (!(startId == null)) { + _context3.next = 30; + break; + } + + _context3.t7 = null; + _context3.next = 32; + break; + + case 30: + return _context3.delegateYield(this.getOperation(startId), 't8', 31); + + case 31: + _context3.t7 = _context3.t8; + + case 32: + start = _context3.t7; + + o = start; + + case 34: + if (!(op.right != null)) { + _context3.next = 37; + break; + } + + tryToRemergeLater.push(op.right); + return _context3.delegateYield(this.getInsertionCleanStart(op.right), 't9', 37); + + case 37: + if (!true) { + _context3.next = 62; + break; + } + + if (!(o != null && !Y.utils.compareIds(o.id, op.right))) { + _context3.next = 59; + break; + } + + return _context3.delegateYield(Struct.Insert.getDistanceToOrigin.call(this, o), 't10', 40); + + case 40: + oOriginDistance = _context3.t10; + + if (!(oOriginDistance === i)) { + _context3.next = 45; + break; + } + + // case 1 + if (o.id[0] < op.id[0]) { + op.left = Y.utils.getLastId(o); + distanceToOrigin = i + 1; // just ignore o.content.length, doesn't make a difference + } + _context3.next = 50; + break; + + case 45: + if (!(oOriginDistance < i)) { + _context3.next = 49; + break; + } + + // case 2 + if (i - distanceToOrigin <= oOriginDistance) { + op.left = Y.utils.getLastId(o); + distanceToOrigin = i + 1; // just ignore o.content.length, doesn't make a difference + } + _context3.next = 50; + break; + + case 49: + return _context3.abrupt('break', 62); + + case 50: + i++; + + if (!(o.right != null)) { + _context3.next = 56; + break; + } + + return _context3.delegateYield(this.getInsertion(o.right), 't11', 53); + + case 53: + o = _context3.t11; + _context3.next = 57; + break; + + case 56: + o = null; + + case 57: + _context3.next = 60; + break; + + case 59: + return _context3.abrupt('break', 62); + + case 60: + _context3.next = 37; + break; + + case 62: + + // reconnect.. + left = null; + right = null; + + if (!(parent == null)) { + _context3.next = 67; + break; + } + + return _context3.delegateYield(this.getOperation(op.parent), 't12', 66); + + case 66: + parent = _context3.t12; + + case 67: + if (!(op.left != null)) { + _context3.next = 75; + break; + } + + return _context3.delegateYield(this.getInsertion(op.left), 't13', 69); + + case 69: + left = _context3.t13; + + // link left + op.right = left.right; + left.right = op.id; + + return _context3.delegateYield(this.setOperation(left), 't14', 73); + + case 73: + _context3.next = 76; + break; + + case 75: + // set op.right from parent, if necessary + op.right = op.parentSub ? parent.map[op.parentSub] || null : parent.start; + + case 76: + if (!(op.right != null)) { + _context3.next = 86; + break; + } + + return _context3.delegateYield(this.getOperation(op.right), 't15', 78); + + case 78: + right = _context3.t15; + + right.left = Y.utils.getLastId(op); + + // if right exists, and it is supposed to be gc'd. Remove it from the gc + + if (!(right.gc != null)) { + _context3.next = 85; + break; + } + + if (!(right.content != null && right.content.length > 1)) { + _context3.next = 84; + break; + } + + return _context3.delegateYield(this.getInsertionCleanEnd(right.id), 't16', 83); + + case 83: + right = _context3.t16; + + case 84: + this.store.removeFromGarbageCollector(right); + + case 85: + return _context3.delegateYield(this.setOperation(right), 't17', 86); + + case 86: + if (!(op.parentSub != null)) { + _context3.next = 96; + break; + } + + if (!(left == null)) { + _context3.next = 90; + break; + } + + parent.map[op.parentSub] = op.id; + return _context3.delegateYield(this.setOperation(parent), 't18', 90); + + case 90: + if (!(op.right != null)) { + _context3.next = 92; + break; + } + + return _context3.delegateYield(this.deleteOperation(op.right, 1, true), 't19', 92); + + case 92: + if (!(op.left != null)) { + _context3.next = 94; + break; + } + + return _context3.delegateYield(this.deleteOperation(op.id, 1, true), 't20', 94); + + case 94: + _context3.next = 100; + break; + + case 96: + if (!(right == null || left == null)) { + _context3.next = 100; + break; + } + + if (right == null) { + parent.end = Y.utils.getLastId(op); + } + if (left == null) { + parent.start = op.id; + } + return _context3.delegateYield(this.setOperation(parent), 't21', 100); + + case 100: + _i = 0; + + case 101: + if (!(_i < tryToRemergeLater.length)) { + _context3.next = 108; + break; + } + + return _context3.delegateYield(this.getOperation(tryToRemergeLater[_i]), 't22', 103); + + case 103: + m = _context3.t22; + return _context3.delegateYield(this.tryCombineWithLeft(m), 't23', 105); + + case 105: + _i++; + _context3.next = 101; + break; + + case 108: + case 'end': + return _context3.stop(); + } + } + }, execute, this); + }) + }, + List: { + /* + { + start: null, + end: null, + struct: "List", + type: "", + id: this.os.getNextOpId(1) + } + */ + create: function create(id) { + return { + start: null, + end: null, + struct: 'List', + id: id + }; + }, + encode: function encode(op) { + var e = { + struct: 'List', + id: op.id, + type: op.type + }; + if (op.requires != null) { + e.requires = op.requires; + } + if (op.info != null) { + e.info = op.info; + } + return e; + }, + requiredOps: function requiredOps() { + /* + var ids = [] + if (op.start != null) { + ids.push(op.start) + } + if (op.end != null){ + ids.push(op.end) + } + return ids + */ + return []; + }, + execute: regeneratorRuntime.mark(function execute(op) { + return regeneratorRuntime.wrap(function execute$(_context4) { + while (1) { + switch (_context4.prev = _context4.next) { + case 0: + op.start = null; + op.end = null; + + case 2: + case 'end': + return _context4.stop(); + } + } + }, execute, this); + }), + ref: regeneratorRuntime.mark(function ref(op, pos) { + var res, o; + return regeneratorRuntime.wrap(function ref$(_context5) { + while (1) { + switch (_context5.prev = _context5.next) { + case 0: + if (!(op.start == null)) { + _context5.next = 2; + break; + } + + return _context5.abrupt('return', null); + + case 2: + res = null; + return _context5.delegateYield(this.getOperation(op.start), 't0', 4); + + case 4: + o = _context5.t0; + + case 5: + if (!true) { + _context5.next = 15; + break; + } + + if (!o.deleted) { + res = o; + pos--; + } + + if (!(pos >= 0 && o.right != null)) { + _context5.next = 12; + break; + } + + return _context5.delegateYield(this.getOperation(o.right), 't1', 9); + + case 9: + o = _context5.t1; + _context5.next = 13; + break; + + case 12: + return _context5.abrupt('break', 15); + + case 13: + _context5.next = 5; + break; + + case 15: + return _context5.abrupt('return', res); + + case 16: + case 'end': + return _context5.stop(); + } + } + }, ref, this); + }), + map: regeneratorRuntime.mark(function map(o, f) { + var res, operation; + return regeneratorRuntime.wrap(function map$(_context6) { + while (1) { + switch (_context6.prev = _context6.next) { + case 0: + o = o.start; + res = []; + + case 2: + if (!(o != null)) { + _context6.next = 9; + break; + } + + return _context6.delegateYield(this.getOperation(o), 't0', 4); + + case 4: + operation = _context6.t0; + + if (!operation.deleted) { + res.push(f(operation)); + } + o = operation.right; + _context6.next = 2; + break; + + case 9: + return _context6.abrupt('return', res); + + case 10: + case 'end': + return _context6.stop(); + } + } + }, map, this); + }) + }, + Map: { + /* + { + map: {}, + struct: "Map", + type: "", + id: this.os.getNextOpId(1) + } + */ + create: function create(id) { + return { + id: id, + map: {}, + struct: 'Map' + }; + }, + encode: function encode(op) { + var e = { + struct: 'Map', + type: op.type, + id: op.id, + map: {} // overwrite map!! + }; + if (op.requires != null) { + e.requires = op.requires; + } + if (op.info != null) { + e.info = op.info; + } + return e; + }, + requiredOps: function requiredOps() { + return []; + }, + execute: regeneratorRuntime.mark(function execute() { + return regeneratorRuntime.wrap(function execute$(_context7) { + while (1) { + switch (_context7.prev = _context7.next) { + case 0: + case 'end': + return _context7.stop(); + } + } + }, execute, this); + }), + /* + Get a property by name + */ + get: regeneratorRuntime.mark(function get(op, name) { + var oid, res; + return regeneratorRuntime.wrap(function get$(_context8) { + while (1) { + switch (_context8.prev = _context8.next) { + case 0: + oid = op.map[name]; + + if (!(oid != null)) { + _context8.next = 14; + break; + } + + return _context8.delegateYield(this.getOperation(oid), 't0', 3); + + case 3: + res = _context8.t0; + + if (!(res == null || res.deleted)) { + _context8.next = 8; + break; + } + + return _context8.abrupt('return', void 0); + + case 8: + if (!(res.opContent == null)) { + _context8.next = 12; + break; + } + + return _context8.abrupt('return', res.content[0]); + + case 12: + return _context8.delegateYield(this.getType(res.opContent), 't1', 13); + + case 13: + return _context8.abrupt('return', _context8.t1); + + case 14: + case 'end': + return _context8.stop(); + } + } + }, get, this); + }) + } + }; + Y.Struct = Struct; +}; + +},{}],8:[function(require,module,exports){ +/* @flow */ +'use strict'; + +/* + Partial definition of a transaction + + A transaction provides all the the async functionality on a database. + + By convention, a transaction has the following properties: + * ss for StateSet + * os for OperationStore + * ds for DeleteStore + + A transaction must also define the following methods: + * checkDeleteStoreForState(state) + - When increasing the state of a user, an operation with an higher id + may already be garbage collected, and therefore it will never be received. + update the state to reflect this knowledge. This won't call a method to save the state! + * getDeleteSet(id) + - Get the delete set in a readable format: + { + "userX": [ + [5,1], // starting from position 5, one operations is deleted + [9,4] // starting from position 9, four operations are deleted + ], + "userY": ... + } + * getOpsFromDeleteSet(ds) -- TODO: just call this.deleteOperation(id) here + - get a set of deletions that need to be applied in order to get to + achieve the state of the supplied ds + * setOperation(op) + - write `op` to the database. + Note: this is allowed to return an in-memory object. + E.g. the Memory adapter returns the object that it has in-memory. + Changing values on this object will be stored directly in the database + without calling this function. Therefore, + setOperation may have no functionality in some adapters. This also has + implications on the way we use operations that were served from the database. + We try not to call copyObject, if not necessary. + * addOperation(op) + - add an operation to the database. + This may only be called once for every op.id + Must return a function that returns the next operation in the database (ordered by id) + * getOperation(id) + * removeOperation(id) + - remove an operation from the database. This is called when an operation + is garbage collected. + * setState(state) + - `state` is of the form + { + user: "1", + clock: 4 + } <- meaning that we have four operations from user "1" + (with these id's respectively: 0, 1, 2, and 3) + * getState(user) + * getStateVector() + - Get the state of the OS in the form + [{ + user: "userX", + clock: 11 + }, + .. + ] + * getStateSet() + - Get the state of the OS in the form + { + "userX": 11, + "userY": 22 + } + * getOperations(startSS) + - Get the all the operations that are necessary in order to achive the + stateSet of this user, starting from a stateSet supplied by another user + * makeOperationReady(ss, op) + - this is called only by `getOperations(startSS)`. It makes an operation + applyable on a given SS. +*/ + +var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +module.exports = function (Y /* :any */) { + var TransactionInterface = function () { + function TransactionInterface() { + _classCallCheck(this, TransactionInterface); + } + + _createClass(TransactionInterface, [{ + key: 'getType', + + /* :: + store: Y.AbstractDatabase; + ds: Store; + os: Store; + ss: Store; + */ + /* + Get a type based on the id of its model. + If it does not exist yes, create it. + TODO: delete type from store.initializedTypes[id] when corresponding id was deleted! + */ + value: regeneratorRuntime.mark(function getType(id, args) { + var sid, t, op /* :MapStruct | ListStruct */; + return regeneratorRuntime.wrap(function getType$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + sid = JSON.stringify(id); + t = this.store.initializedTypes[sid]; + + if (!(t == null)) { + _context.next = 9; + break; + } + + return _context.delegateYield(this.getOperation(id), 't0', 4); + + case 4: + op = _context.t0; + + if (!(op != null)) { + _context.next = 9; + break; + } + + return _context.delegateYield(Y[op.type].typeDefinition.initType.call(this, this.store, op, args), 't1', 7); + + case 7: + t = _context.t1; + + this.store.initializedTypes[sid] = t; + + case 9: + return _context.abrupt('return', t); + + case 10: + case 'end': + return _context.stop(); + } + } + }, getType, this); + }) + }, { + key: 'createType', + value: regeneratorRuntime.mark(function createType(typedefinition, id) { + var structname, op; + return regeneratorRuntime.wrap(function createType$(_context2) { + while (1) { + switch (_context2.prev = _context2.next) { + case 0: + structname = typedefinition[0].struct; + + id = id || this.store.getNextOpId(1); + + if (!(id[0] === '_')) { + _context2.next = 7; + break; + } + + return _context2.delegateYield(this.getOperation(id), 't0', 4); + + case 4: + op = _context2.t0; + _context2.next = 9; + break; + + case 7: + op = Y.Struct[structname].create(id); + op.type = typedefinition[0].name; + + case 9: + if (!(typedefinition[0].appendAdditionalInfo != null)) { + _context2.next = 11; + break; + } + + return _context2.delegateYield(typedefinition[0].appendAdditionalInfo.call(this, op, typedefinition[1]), 't1', 11); + + case 11: + if (!(op[0] === '_')) { + _context2.next = 15; + break; + } + + return _context2.delegateYield(this.setOperation(op), 't2', 13); + + case 13: + _context2.next = 16; + break; + + case 15: + return _context2.delegateYield(this.applyCreatedOperations([op]), 't3', 16); + + case 16: + return _context2.delegateYield(this.getType(id, typedefinition[1]), 't4', 17); + + case 17: + return _context2.abrupt('return', _context2.t4); + + case 18: + case 'end': + return _context2.stop(); + } + } + }, createType, this); + }) + /* createType (typedefinition, id) { + var structname = typedefinition[0].struct + id = id || this.store.getNextOpId(1) + var op = Y.Struct[structname].create(id) + op.type = typedefinition[0].name + if (typedefinition[0].appendAdditionalInfo != null) { + yield* typedefinition[0].appendAdditionalInfo.call(this, op, typedefinition[1]) + } + // yield* this.applyCreatedOperations([op]) + yield* Y.Struct[op.struct].execute.call(this, op) + yield* this.addOperation(op) + yield* this.store.operationAdded(this, op) + return yield* this.getType(id, typedefinition[1]) + }*/ + /* + Apply operations that this user created (no remote ones!) + * does not check for Struct.*.requiredOps() + * also broadcasts it through the connector + */ + + }, { + key: 'applyCreatedOperations', + value: regeneratorRuntime.mark(function applyCreatedOperations(ops) { + var send, i, op; + return regeneratorRuntime.wrap(function applyCreatedOperations$(_context3) { + while (1) { + switch (_context3.prev = _context3.next) { + case 0: + send = []; + i = 0; + + case 2: + if (!(i < ops.length)) { + _context3.next = 9; + break; + } + + op = ops[i]; + return _context3.delegateYield(this.store.tryExecute.call(this, op), 't0', 5); + + case 5: + if (op.id == null || typeof op.id[1] !== 'string') { + send.push(Y.Struct[op.struct].encode(op)); + } + + case 6: + i++; + _context3.next = 2; + break; + + case 9: + if (!this.store.y.connector.isDisconnected() && send.length > 0) { + // TODO: && !this.store.forwardAppliedOperations (but then i don't send delete ops) + // is connected, and this is not going to be send in addOperation + this.store.y.connector.broadcastOps(send); + } + + case 10: + case 'end': + return _context3.stop(); + } + } + }, applyCreatedOperations, this); + }) + }, { + key: 'deleteList', + value: regeneratorRuntime.mark(function deleteList(start) { + var delLength; + return regeneratorRuntime.wrap(function deleteList$(_context4) { + while (1) { + switch (_context4.prev = _context4.next) { + case 0: + if (!(start != null)) { + _context4.next = 15; + break; + } + + return _context4.delegateYield(this.getOperation(start), 't0', 2); + + case 2: + start = _context4.t0; + + if (start.gc) { + _context4.next = 12; + break; + } + + start.gc = true; + start.deleted = true; + return _context4.delegateYield(this.setOperation(start), 't1', 7); + + case 7: + delLength = start.content != null ? start.content.length : 1; + return _context4.delegateYield(this.markDeleted(start.id, delLength), 't2', 9); + + case 9: + if (!(start.opContent != null)) { + _context4.next = 11; + break; + } + + return _context4.delegateYield(this.deleteOperation(start.opContent), 't3', 11); + + case 11: + this.store.queueGarbageCollector(start.id); + + case 12: + start = start.right; + _context4.next = 0; + break; + + case 15: + case 'end': + return _context4.stop(); + } + } + }, deleteList, this); + }) + + /* + Mark an operation as deleted, and add it to the GC, if possible. + */ + + }, { + key: 'deleteOperation', + value: regeneratorRuntime.mark(function deleteOperation(targetId, length, preventCallType) { + var callType, target, targetLength, name, i, left, right; + return regeneratorRuntime.wrap(function deleteOperation$(_context5) { + while (1) { + switch (_context5.prev = _context5.next) { + case 0: + if (length == null) { + length = 1; + } + return _context5.delegateYield(this.markDeleted(targetId, length), 't0', 2); + + case 2: + if (!(length > 0)) { + _context5.next = 64; + break; + } + + callType = false; + return _context5.delegateYield(this.os.findWithUpperBound([targetId[0], targetId[1] + length - 1]), 't1', 5); + + case 5: + target = _context5.t1; + targetLength = target != null && target.content != null ? target.content.length : 1; + + if (!(target == null || target.id[0] !== targetId[0] || target.id[1] + targetLength <= targetId[1])) { + _context5.next = 12; + break; + } + + // does not exist or is not in the range of the deletion + target = null; + length = 0; + _context5.next = 22; + break; + + case 12: + if (target.deleted) { + _context5.next = 21; + break; + } + + if (!(target.id[1] < targetId[1])) { + _context5.next = 17; + break; + } + + return _context5.delegateYield(this.getInsertionCleanStart(targetId), 't2', 15); + + case 15: + target = _context5.t2; + + targetLength = target.content.length; // must have content property! + + case 17: + if (!(target.id[1] + targetLength > targetId[1] + length)) { + _context5.next = 21; + break; + } + + return _context5.delegateYield(this.getInsertionCleanEnd([targetId[0], targetId[1] + length - 1]), 't3', 19); + + case 19: + target = _context5.t3; + + targetLength = target.content.length; + + case 21: + length = target.id[1] - targetId[1]; + + case 22: + if (!(target != null)) { + _context5.next = 62; + break; + } + + if (target.deleted) { + _context5.next = 44; + break; + } + + callType = true; + // set deleted & notify type + target.deleted = true; + // delete containing lists + + if (!(target.start != null)) { + _context5.next = 28; + break; + } + + return _context5.delegateYield(this.deleteList(target.start), 't4', 28); + + case 28: + if (!(target.map != null)) { + _context5.next = 35; + break; + } + + _context5.t5 = regeneratorRuntime.keys(target.map); + + case 30: + if ((_context5.t6 = _context5.t5()).done) { + _context5.next = 35; + break; + } + + name = _context5.t6.value; + return _context5.delegateYield(this.deleteList(target.map[name]), 't7', 33); + + case 33: + _context5.next = 30; + break; + + case 35: + if (!(target.opContent != null)) { + _context5.next = 37; + break; + } + + return _context5.delegateYield(this.deleteOperation(target.opContent), 't8', 37); + + case 37: + if (!(target.requires != null)) { + _context5.next = 44; + break; + } + + i = 0; + + case 39: + if (!(i < target.requires.length)) { + _context5.next = 44; + break; + } + + return _context5.delegateYield(this.deleteOperation(target.requires[i]), 't9', 41); + + case 41: + i++; + _context5.next = 39; + break; + + case 44: + if (!(target.left != null)) { + _context5.next = 49; + break; + } + + return _context5.delegateYield(this.getInsertion(target.left), 't10', 46); + + case 46: + left = _context5.t10; + _context5.next = 50; + break; + + case 49: + left = null; + + case 50: + return _context5.delegateYield(this.setOperation(target), 't11', 51); + + case 51: + if (!(target.right != null)) { + _context5.next = 56; + break; + } + + return _context5.delegateYield(this.getOperation(target.right), 't12', 53); + + case 53: + right = _context5.t12; + _context5.next = 57; + break; + + case 56: + right = null; + + case 57: + if (!(callType && !preventCallType)) { + _context5.next = 59; + break; + } + + return _context5.delegateYield(this.store.operationAdded(this, { + struct: 'Delete', + target: target.id, + length: targetLength + }), 't13', 59); + + case 59: + return _context5.delegateYield(this.store.addToGarbageCollector.call(this, target, left), 't14', 60); + + case 60: + if (!(right != null)) { + _context5.next = 62; + break; + } + + return _context5.delegateYield(this.store.addToGarbageCollector.call(this, right, target), 't15', 62); + + case 62: + _context5.next = 2; + break; + + case 64: + case 'end': + return _context5.stop(); + } + } + }, deleteOperation, this); + }) + /* + Mark an operation as deleted&gc'd + */ + + }, { + key: 'markGarbageCollected', + value: regeneratorRuntime.mark(function markGarbageCollected(id, len) { + var n, newlen, prev, next; + return regeneratorRuntime.wrap(function markGarbageCollected$(_context6) { + while (1) { + switch (_context6.prev = _context6.next) { + case 0: + // this.mem.push(["gc", id]); + this.store.addToDebug('yield* this.markGarbageCollected(', id, ', ', len, ')'); + return _context6.delegateYield(this.markDeleted(id, len), 't0', 2); + + case 2: + n = _context6.t0; + + if (!(n.id[1] < id[1] && !n.gc)) { + _context6.next = 9; + break; + } + + // un-extend left + newlen = n.len - (id[1] - n.id[1]); + + n.len -= newlen; + return _context6.delegateYield(this.ds.put(n), 't1', 7); + + case 7: + n = { id: id, len: newlen, gc: false }; + return _context6.delegateYield(this.ds.put(n), 't2', 9); + + case 9: + return _context6.delegateYield(this.ds.findPrev(id), 't3', 10); + + case 10: + prev = _context6.t3; + return _context6.delegateYield(this.ds.findNext(id), 't4', 12); + + case 12: + next = _context6.t4; + + if (!(id[1] + len < n.id[1] + n.len && !n.gc)) { + _context6.next = 16; + break; + } + + return _context6.delegateYield(this.ds.put({ id: [id[0], id[1] + len], len: n.len - len, gc: false }), 't5', 15); + + case 15: + n.len = len; + + case 16: + // set gc'd + n.gc = true; + // can extend left? + + if (!(prev != null && prev.gc && Y.utils.compareIds([prev.id[0], prev.id[1] + prev.len], n.id))) { + _context6.next = 21; + break; + } + + prev.len += n.len; + return _context6.delegateYield(this.ds.delete(n.id), 't6', 20); + + case 20: + n = prev; + // ds.put n here? + + case 21: + if (!(next != null && next.gc && Y.utils.compareIds([n.id[0], n.id[1] + n.len], next.id))) { + _context6.next = 24; + break; + } + + n.len += next.len; + return _context6.delegateYield(this.ds.delete(next.id), 't7', 24); + + case 24: + return _context6.delegateYield(this.ds.put(n), 't8', 25); + + case 25: + return _context6.delegateYield(this.updateState(n.id[0]), 't9', 26); + + case 26: + case 'end': + return _context6.stop(); + } + } + }, markGarbageCollected, this); + }) + /* + Mark an operation as deleted. + returns the delete node + */ + + }, { + key: 'markDeleted', + value: regeneratorRuntime.mark(function markDeleted(id, length) { + var n, diff, next, _next; + + return regeneratorRuntime.wrap(function markDeleted$(_context7) { + while (1) { + switch (_context7.prev = _context7.next) { + case 0: + if (length == null) { + length = 1; + } + // this.mem.push(["del", id]); + return _context7.delegateYield(this.ds.findWithUpperBound(id), 't0', 2); + + case 2: + n = _context7.t0; + + if (!(n != null && n.id[0] === id[0])) { + _context7.next = 27; + break; + } + + if (!(n.id[1] <= id[1] && id[1] <= n.id[1] + n.len)) { + _context7.next = 23; + break; + } + + // id is in n's range + diff = id[1] + length - (n.id[1] + n.len); // overlapping right + + if (!(diff > 0)) { + _context7.next = 20; + break; + } + + if (n.gc) { + _context7.next = 11; + break; + } + + n.len += diff; + _context7.next = 18; + break; + + case 11: + diff = n.id[1] + n.len - id[1]; // overlapping left (id till n.end) + + if (!(diff < length)) { + _context7.next = 17; + break; + } + + // a partial deletion + n = { id: [id[0], id[1] + diff], len: length - diff, gc: false }; + return _context7.delegateYield(this.ds.put(n), 't1', 15); + + case 15: + _context7.next = 18; + break; + + case 17: + throw new Error('Cannot happen! (it dit though.. :()'); + + case 18: + _context7.next = 21; + break; + + case 20: + return _context7.abrupt('return', n); + + case 21: + _context7.next = 25; + break; + + case 23: + // cannot extend left (there is no left!) + n = { id: id, len: length, gc: false }; + return _context7.delegateYield(this.ds.put(n), 't2', 25); + + case 25: + _context7.next = 29; + break; + + case 27: + // cannot extend left + n = { id: id, len: length, gc: false }; + return _context7.delegateYield(this.ds.put(n), 't3', 29); + + case 29: + return _context7.delegateYield(this.ds.findNext(n.id), 't4', 30); + + case 30: + next = _context7.t4; + + if (!(next != null && n.id[0] === next.id[0] && n.id[1] + n.len >= next.id[1])) { + _context7.next = 61; + break; + } + + diff = n.id[1] + n.len - next.id[1]; // from next.start to n.end + + case 33: + if (!(diff >= 0)) { + _context7.next = 61; + break; + } + + if (!next.gc) { + _context7.next = 44; + break; + } + + // gc is stronger, so reduce length of n + n.len -= diff; + + if (!(diff >= next.len)) { + _context7.next = 41; + break; + } + + // delete the missing range after next + diff = diff - next.len; // missing range after next + + if (!(diff > 0)) { + _context7.next = 41; + break; + } + + return _context7.delegateYield(this.ds.put(n), 't5', 40); + + case 40: + return _context7.delegateYield(this.markDeleted([next.id[0], next.id[1] + next.len], diff), 't6', 41); + + case 41: + return _context7.abrupt('break', 61); + + case 44: + if (!(diff > next.len)) { + _context7.next = 56; + break; + } + + return _context7.delegateYield(this.ds.findNext(next.id), 't7', 46); + + case 46: + _next = _context7.t7; + return _context7.delegateYield(this.ds.delete(next.id), 't8', 48); + + case 48: + if (!(_next == null || n.id[0] !== _next.id[0])) { + _context7.next = 52; + break; + } + + return _context7.abrupt('break', 61); + + case 52: + next = _next; + diff = n.id[1] + n.len - next.id[1]; // from next.start to n.end + // continue! + + case 54: + _context7.next = 59; + break; + + case 56: + // n just partially overlaps with next. extend n, delete next, and break this loop + n.len += next.len - diff; + return _context7.delegateYield(this.ds.delete(next.id), 't9', 58); + + case 58: + return _context7.abrupt('break', 61); + + case 59: + _context7.next = 33; + break; + + case 61: + return _context7.delegateYield(this.ds.put(n), 't10', 62); + + case 62: + return _context7.abrupt('return', n); + + case 63: + case 'end': + return _context7.stop(); + } + } + }, markDeleted, this); + }) + /* + Call this method when the client is connected&synced with the + other clients (e.g. master). This will query the database for + operations that can be gc'd and add them to the garbage collector. + */ + + }, { + key: 'garbageCollectAfterSync', + value: regeneratorRuntime.mark(function garbageCollectAfterSync() { + return regeneratorRuntime.wrap(function garbageCollectAfterSync$(_context9) { + while (1) { + switch (_context9.prev = _context9.next) { + case 0: + if (this.store.gc1.length > 0 || this.store.gc2.length > 0) { + console.warn('gc should be empty after sync'); + } + return _context9.delegateYield(this.os.iterate(this, null, null, regeneratorRuntime.mark(function _callee(op) { + var parentDeleted, i, left; + return regeneratorRuntime.wrap(function _callee$(_context8) { + while (1) { + switch (_context8.prev = _context8.next) { + case 0: + if (!op.gc) { + _context8.next = 3; + break; + } + + delete op.gc; + return _context8.delegateYield(this.setOperation(op), 't0', 3); + + case 3: + if (!(op.parent != null)) { + _context8.next = 23; + break; + } + + return _context8.delegateYield(this.isDeleted(op.parent), 't1', 5); + + case 5: + parentDeleted = _context8.t1; + + if (!parentDeleted) { + _context8.next = 23; + break; + } + + op.gc = true; + + if (op.deleted) { + _context8.next = 20; + break; + } + + return _context8.delegateYield(this.markDeleted(op.id, op.content != null ? op.content.length : 1), 't2', 10); + + case 10: + op.deleted = true; + + if (!(op.opContent != null)) { + _context8.next = 13; + break; + } + + return _context8.delegateYield(this.deleteOperation(op.opContent), 't3', 13); + + case 13: + if (!(op.requires != null)) { + _context8.next = 20; + break; + } + + i = 0; + + case 15: + if (!(i < op.requires.length)) { + _context8.next = 20; + break; + } + + return _context8.delegateYield(this.deleteOperation(op.requires[i]), 't4', 17); + + case 17: + i++; + _context8.next = 15; + break; + + case 20: + return _context8.delegateYield(this.setOperation(op), 't5', 21); + + case 21: + this.store.gc1.push(op.id); // this is ok becaues its shortly before sync (otherwise use queueGarbageCollector!) + return _context8.abrupt('return'); + + case 23: + if (!op.deleted) { + _context8.next = 29; + break; + } + + left = null; + + if (!(op.left != null)) { + _context8.next = 28; + break; + } + + return _context8.delegateYield(this.getInsertion(op.left), 't6', 27); + + case 27: + left = _context8.t6; + + case 28: + return _context8.delegateYield(this.store.addToGarbageCollector.call(this, op, left), 't7', 29); + + case 29: + case 'end': + return _context8.stop(); + } + } + }, _callee, this); + })), 't0', 2); + + case 2: + case 'end': + return _context9.stop(); + } + } + }, garbageCollectAfterSync, this); + }) + /* + Really remove an op and all its effects. + The complicated case here is the Insert operation: + * reset left + * reset right + * reset parent.start + * reset parent.end + * reset origins of all right ops + */ + + }, { + key: 'garbageCollectOperation', + value: regeneratorRuntime.mark(function garbageCollectOperation(id) { + var o, deps, i, dep, left, right, neworigin, neworigin_, _i, originsIn, origin, parent, setParent; + + return regeneratorRuntime.wrap(function garbageCollectOperation$(_context10) { + while (1) { + switch (_context10.prev = _context10.next) { + case 0: + this.store.addToDebug('yield* this.garbageCollectOperation(', id, ')'); + return _context10.delegateYield(this.getOperation(id), 't0', 2); + + case 2: + o = _context10.t0; + return _context10.delegateYield(this.markGarbageCollected(id, o != null && o.content != null ? o.content.length : 1), 't1', 4); + + case 4: + if (!(o != null)) { + _context10.next = 76; + break; + } + + deps = []; + + if (o.opContent != null) { + deps.push(o.opContent); + } + if (o.requires != null) { + deps = deps.concat(o.requires); + } + i = 0; + + case 9: + if (!(i < deps.length)) { + _context10.next = 26; + break; + } + + return _context10.delegateYield(this.getOperation(deps[i]), 't2', 11); + + case 11: + dep = _context10.t2; + + if (!(dep != null)) { + _context10.next = 22; + break; + } + + if (dep.deleted) { + _context10.next = 17; + break; + } + + return _context10.delegateYield(this.deleteOperation(dep.id), 't3', 15); + + case 15: + return _context10.delegateYield(this.getOperation(dep.id), 't4', 16); + + case 16: + dep = _context10.t4; + + case 17: + dep.gc = true; + return _context10.delegateYield(this.setOperation(dep), 't5', 19); + + case 19: + this.store.queueGarbageCollector(dep.id); + _context10.next = 23; + break; + + case 22: + return _context10.delegateYield(this.markGarbageCollected(deps[i], 1), 't6', 23); + + case 23: + i++; + _context10.next = 9; + break; + + case 26: + if (!(o.left != null)) { + _context10.next = 31; + break; + } + + return _context10.delegateYield(this.getInsertion(o.left), 't7', 28); + + case 28: + left = _context10.t7; + + left.right = o.right; + return _context10.delegateYield(this.setOperation(left), 't8', 31); + + case 31: + if (!(o.right != null)) { + _context10.next = 62; + break; + } + + return _context10.delegateYield(this.getOperation(o.right), 't9', 33); + + case 33: + right = _context10.t9; + + right.left = o.left; + + if (!(o.originOf != null && o.originOf.length > 0)) { + _context10.next = 61; + break; + } + + // find new origin of right ops + // origin is the first left deleted operation + neworigin = o.left; + neworigin_ = null; + + case 38: + if (!(neworigin != null)) { + _context10.next = 46; + break; + } + + return _context10.delegateYield(this.getInsertion(neworigin), 't10', 40); + + case 40: + neworigin_ = _context10.t10; + + if (!neworigin_.deleted) { + _context10.next = 43; + break; + } + + return _context10.abrupt('break', 46); + + case 43: + neworigin = neworigin_.left; + _context10.next = 38; + break; + + case 46: + _context10.t11 = regeneratorRuntime.keys(o.originOf); + + case 47: + if ((_context10.t12 = _context10.t11()).done) { + _context10.next = 56; + break; + } + + _i = _context10.t12.value; + return _context10.delegateYield(this.getOperation(o.originOf[_i]), 't13', 50); + + case 50: + originsIn = _context10.t13; + + if (!(originsIn != null)) { + _context10.next = 54; + break; + } + + originsIn.origin = neworigin; + return _context10.delegateYield(this.setOperation(originsIn), 't14', 54); + + case 54: + _context10.next = 47; + break; + + case 56: + if (!(neworigin != null)) { + _context10.next = 59; + break; + } + + if (neworigin_.originOf == null) { + neworigin_.originOf = o.originOf; + } else { + neworigin_.originOf = o.originOf.concat(neworigin_.originOf); + } + return _context10.delegateYield(this.setOperation(neworigin_), 't15', 59); + + case 59: + _context10.next = 62; + break; + + case 61: + return _context10.delegateYield(this.setOperation(right), 't16', 62); + + case 62: + if (!(o.origin != null)) { + _context10.next = 67; + break; + } + + return _context10.delegateYield(this.getInsertion(o.origin), 't17', 64); + + case 64: + origin = _context10.t17; + + origin.originOf = origin.originOf.filter(function (_id) { + return !Y.utils.compareIds(id, _id); + }); + return _context10.delegateYield(this.setOperation(origin), 't18', 67); + + case 67: + if (!(o.parent != null)) { + _context10.next = 70; + break; + } + + return _context10.delegateYield(this.getOperation(o.parent), 't19', 69); + + case 69: + parent = _context10.t19; + + case 70: + if (!(parent != null)) { + _context10.next = 75; + break; + } + + setParent = false; // whether to save parent to the os + + if (o.parentSub != null) { + if (Y.utils.compareIds(parent.map[o.parentSub], o.id)) { + setParent = true; + if (o.right != null) { + parent.map[o.parentSub] = o.right; + } else { + delete parent.map[o.parentSub]; + } + } + } else { + if (Y.utils.compareIds(parent.start, o.id)) { + // gc'd op is the start + setParent = true; + parent.start = o.right; + } + if (Y.utils.matchesId(o, parent.end)) { + // gc'd op is the end + setParent = true; + parent.end = o.left; + } + } + + if (!setParent) { + _context10.next = 75; + break; + } + + return _context10.delegateYield(this.setOperation(parent), 't20', 75); + + case 75: + return _context10.delegateYield(this.removeOperation(o.id), 't21', 76); + + case 76: + case 'end': + return _context10.stop(); + } + } + }, garbageCollectOperation, this); + }) + }, { + key: 'checkDeleteStoreForState', + value: regeneratorRuntime.mark(function checkDeleteStoreForState(state) { + var n; + return regeneratorRuntime.wrap(function checkDeleteStoreForState$(_context11) { + while (1) { + switch (_context11.prev = _context11.next) { + case 0: + return _context11.delegateYield(this.ds.findWithUpperBound([state.user, state.clock]), 't0', 1); + + case 1: + n = _context11.t0; + + if (n != null && n.id[0] === state.user && n.gc) { + state.clock = Math.max(state.clock, n.id[1] + n.len); + } + + case 3: + case 'end': + return _context11.stop(); + } + } + }, checkDeleteStoreForState, this); + }) + }, { + key: 'updateState', + value: regeneratorRuntime.mark(function updateState(user) { + var state, o, oLength; + return regeneratorRuntime.wrap(function updateState$(_context12) { + while (1) { + switch (_context12.prev = _context12.next) { + case 0: + return _context12.delegateYield(this.getState(user), 't0', 1); + + case 1: + state = _context12.t0; + return _context12.delegateYield(this.checkDeleteStoreForState(state), 't1', 3); + + case 3: + return _context12.delegateYield(this.getInsertion([user, state.clock]), 't2', 4); + + case 4: + o = _context12.t2; + oLength = o != null && o.content != null ? o.content.length : 1; + + case 6: + if (!(o != null && user === o.id[0] && o.id[1] <= state.clock && o.id[1] + oLength > state.clock)) { + _context12.next = 14; + break; + } + + // either its a new operation (1. case), or it is an operation that was deleted, but is not yet in the OS + state.clock += oLength; + return _context12.delegateYield(this.checkDeleteStoreForState(state), 't3', 9); + + case 9: + return _context12.delegateYield(this.os.findNext(o.id), 't4', 10); + + case 10: + o = _context12.t4; + + oLength = o != null && o.content != null ? o.content.length : 1; + _context12.next = 6; + break; + + case 14: + return _context12.delegateYield(this.setState(state), 't5', 15); + + case 15: + case 'end': + return _context12.stop(); + } + } + }, updateState, this); + }) + /* + apply a delete set in order to get + the state of the supplied ds + */ + + }, { + key: 'applyDeleteSet', + value: regeneratorRuntime.mark(function applyDeleteSet(ds) { + var deletions, user, dv, pos, d, i, del, counter, o, oLen, ops; + return regeneratorRuntime.wrap(function applyDeleteSet$(_context14) { + while (1) { + switch (_context14.prev = _context14.next) { + case 0: + deletions = []; + _context14.t0 = regeneratorRuntime.keys(ds); + + case 2: + if ((_context14.t1 = _context14.t0()).done) { + _context14.next = 11; + break; + } + + user = _context14.t1.value; + dv = ds[user]; + pos = 0; + d = dv[pos]; + return _context14.delegateYield(this.ds.iterate(this, [user, 0], [user, Number.MAX_VALUE], regeneratorRuntime.mark(function _callee2(n) { + var diff; + return regeneratorRuntime.wrap(function _callee2$(_context13) { + while (1) { + switch (_context13.prev = _context13.next) { + case 0: + if (!(d != null)) { + _context13.next = 10; + break; + } + + diff = 0; // describe the diff of length in 1) and 2) + + if (!(n.id[1] + n.len <= d[0])) { + _context13.next = 6; + break; + } + + return _context13.abrupt('break', 10); + + case 6: + if (d[0] < n.id[1]) { + // 2) + // delete maximum the len of d + // else delete as much as possible + diff = Math.min(n.id[1] - d[0], d[1]); + deletions.push([user, d[0], diff, d[2]]); + } else { + // 3) + diff = n.id[1] + n.len - d[0]; // never null (see 1) + if (d[2] && !n.gc) { + // d marks as gc'd but n does not + // then delete either way + deletions.push([user, d[0], Math.min(diff, d[1]), d[2]]); + } + } + + case 7: + if (d[1] <= diff) { + // d doesn't delete anything anymore + d = dv[++pos]; + } else { + d[0] = d[0] + diff; // reset pos + d[1] = d[1] - diff; // reset length + } + _context13.next = 0; + break; + + case 10: + case 'end': + return _context13.stop(); + } + } + }, _callee2, this); + })), 't2', 8); + + case 8: + // for the rest.. just apply it + for (; pos < dv.length; pos++) { + d = dv[pos]; + deletions.push([user, d[0], d[1], d[2]]); + } + _context14.next = 2; + break; + + case 11: + i = 0; + + case 12: + if (!(i < deletions.length)) { + _context14.next = 40; + break; + } + + del = deletions[i]; + // always try to delete.. + + return _context14.delegateYield(this.deleteOperation([del[0], del[1]], del[2]), 't3', 15); + + case 15: + if (!del[3]) { + _context14.next = 36; + break; + } + + return _context14.delegateYield(this.markGarbageCollected([del[0], del[1]], del[2]), 't4', 17); + + case 17: + // always mark gc'd + // remove operation.. + counter = del[1] + del[2]; + + case 18: + if (!(counter >= del[1])) { + _context14.next = 36; + break; + } + + return _context14.delegateYield(this.os.findWithUpperBound([del[0], counter - 1]), 't5', 20); + + case 20: + o = _context14.t5; + + if (!(o == null)) { + _context14.next = 23; + break; + } + + return _context14.abrupt('break', 36); + + case 23: + oLen = o.content != null ? o.content.length : 1; + + if (!(o.id[0] !== del[0] || o.id[1] + oLen <= del[1])) { + _context14.next = 26; + break; + } + + return _context14.abrupt('break', 36); + + case 26: + if (!(o.id[1] + oLen > del[1] + del[2])) { + _context14.next = 29; + break; + } + + return _context14.delegateYield(this.getInsertionCleanEnd([del[0], del[1] + del[2] - 1]), 't6', 28); + + case 28: + o = _context14.t6; + + case 29: + if (!(o.id[1] < del[1])) { + _context14.next = 32; + break; + } + + return _context14.delegateYield(this.getInsertionCleanStart([del[0], del[1]]), 't7', 31); + + case 31: + o = _context14.t7; + + case 32: + counter = o.id[1]; + return _context14.delegateYield(this.garbageCollectOperation(o.id), 't8', 34); + + case 34: + _context14.next = 18; + break; + + case 36: + if (this.store.forwardAppliedOperations) { + ops = []; + + ops.push({ struct: 'Delete', target: [d[0], d[1]], length: del[2] }); + this.store.y.connector.broadcastOps(ops); + } + + case 37: + i++; + _context14.next = 12; + break; + + case 40: + case 'end': + return _context14.stop(); + } + } + }, applyDeleteSet, this); + }) + }, { + key: 'isGarbageCollected', + value: regeneratorRuntime.mark(function isGarbageCollected(id) { + var n; + return regeneratorRuntime.wrap(function isGarbageCollected$(_context15) { + while (1) { + switch (_context15.prev = _context15.next) { + case 0: + return _context15.delegateYield(this.ds.findWithUpperBound(id), 't0', 1); + + case 1: + n = _context15.t0; + return _context15.abrupt('return', n != null && n.id[0] === id[0] && id[1] < n.id[1] + n.len && n.gc); + + case 3: + case 'end': + return _context15.stop(); + } + } + }, isGarbageCollected, this); + }) + /* + A DeleteSet (ds) describes all the deleted ops in the OS + */ + + }, { + key: 'getDeleteSet', + value: regeneratorRuntime.mark(function getDeleteSet() { + var ds; + return regeneratorRuntime.wrap(function getDeleteSet$(_context17) { + while (1) { + switch (_context17.prev = _context17.next) { + case 0: + ds = {}; + return _context17.delegateYield(this.ds.iterate(this, null, null, regeneratorRuntime.mark(function _callee3(n) { + var user, counter, len, gc, dv; + return regeneratorRuntime.wrap(function _callee3$(_context16) { + while (1) { + switch (_context16.prev = _context16.next) { + case 0: + user = n.id[0]; + counter = n.id[1]; + len = n.len; + gc = n.gc; + dv = ds[user]; + + if (dv === void 0) { + dv = []; + ds[user] = dv; + } + dv.push([counter, len, gc]); + + case 7: + case 'end': + return _context16.stop(); + } + } + }, _callee3, this); + })), 't0', 2); + + case 2: + return _context17.abrupt('return', ds); + + case 3: + case 'end': + return _context17.stop(); + } + } + }, getDeleteSet, this); + }) + }, { + key: 'isDeleted', + value: regeneratorRuntime.mark(function isDeleted(id) { + var n; + return regeneratorRuntime.wrap(function isDeleted$(_context18) { + while (1) { + switch (_context18.prev = _context18.next) { + case 0: + return _context18.delegateYield(this.ds.findWithUpperBound(id), 't0', 1); + + case 1: + n = _context18.t0; + return _context18.abrupt('return', n != null && n.id[0] === id[0] && id[1] < n.id[1] + n.len); + + case 3: + case 'end': + return _context18.stop(); + } + } + }, isDeleted, this); + }) + }, { + key: 'setOperation', + value: regeneratorRuntime.mark(function setOperation(op) { + return regeneratorRuntime.wrap(function setOperation$(_context19) { + while (1) { + switch (_context19.prev = _context19.next) { + case 0: + return _context19.delegateYield(this.os.put(op), 't0', 1); + + case 1: + return _context19.abrupt('return', op); + + case 2: + case 'end': + return _context19.stop(); + } + } + }, setOperation, this); + }) + }, { + key: 'addOperation', + value: regeneratorRuntime.mark(function addOperation(op) { + return regeneratorRuntime.wrap(function addOperation$(_context20) { + while (1) { + switch (_context20.prev = _context20.next) { + case 0: + return _context20.delegateYield(this.os.put(op), 't0', 1); + + case 1: + if (!this.store.y.connector.isDisconnected() && this.store.forwardAppliedOperations && typeof op.id[1] !== 'string') { + // is connected, and this is not going to be send in addOperation + this.store.y.connector.broadcastOps([op]); + } + + case 2: + case 'end': + return _context20.stop(); + } + } + }, addOperation, this); + }) + // if insertion, try to combine with left insertion (if both have content property) + + }, { + key: 'tryCombineWithLeft', + value: regeneratorRuntime.mark(function tryCombineWithLeft(op) { + var left; + return regeneratorRuntime.wrap(function tryCombineWithLeft$(_context21) { + while (1) { + switch (_context21.prev = _context21.next) { + case 0: + if (!(op != null && op.left != null && op.content != null && op.left[0] === op.id[0] && Y.utils.compareIds(op.left, op.origin))) { + _context21.next = 9; + break; + } + + return _context21.delegateYield(this.getInsertion(op.left), 't0', 2); + + case 2: + left = _context21.t0; + + if (!(left.content != null && left.id[1] + left.content.length === op.id[1] && left.originOf.length === 1 && !left.gc && !left.deleted && !op.gc && !op.deleted)) { + _context21.next = 9; + break; + } + + // combine! + if (op.originOf != null) { + left.originOf = op.originOf; + } else { + delete left.originOf; + } + left.content = left.content.concat(op.content); + left.right = op.right; + return _context21.delegateYield(this.os.delete(op.id), 't1', 8); + + case 8: + return _context21.delegateYield(this.setOperation(left), 't2', 9); + + case 9: + case 'end': + return _context21.stop(); + } + } + }, tryCombineWithLeft, this); + }) + }, { + key: 'getInsertion', + value: regeneratorRuntime.mark(function getInsertion(id) { + var ins, len; + return regeneratorRuntime.wrap(function getInsertion$(_context22) { + while (1) { + switch (_context22.prev = _context22.next) { + case 0: + return _context22.delegateYield(this.os.findWithUpperBound(id), 't0', 1); + + case 1: + ins = _context22.t0; + + if (!(ins == null)) { + _context22.next = 6; + break; + } + + return _context22.abrupt('return', null); + + case 6: + len = ins.content != null ? ins.content.length : 1; // in case of opContent + + if (!(id[0] === ins.id[0] && id[1] < ins.id[1] + len)) { + _context22.next = 11; + break; + } + + return _context22.abrupt('return', ins); + + case 11: + return _context22.abrupt('return', null); + + case 12: + case 'end': + return _context22.stop(); + } + } + }, getInsertion, this); + }) + }, { + key: 'getInsertionCleanStartEnd', + value: regeneratorRuntime.mark(function getInsertionCleanStartEnd(id) { + return regeneratorRuntime.wrap(function getInsertionCleanStartEnd$(_context23) { + while (1) { + switch (_context23.prev = _context23.next) { + case 0: + return _context23.delegateYield(this.getInsertionCleanStart(id), 't0', 1); + + case 1: + return _context23.delegateYield(this.getInsertionCleanEnd(id), 't1', 2); + + case 2: + return _context23.abrupt('return', _context23.t1); + + case 3: + case 'end': + return _context23.stop(); + } + } + }, getInsertionCleanStartEnd, this); + }) + // Return an insertion such that id is the first element of content + // This function manipulates an operation, if necessary + + }, { + key: 'getInsertionCleanStart', + value: regeneratorRuntime.mark(function getInsertionCleanStart(id) { + var ins, left, leftLid; + return regeneratorRuntime.wrap(function getInsertionCleanStart$(_context24) { + while (1) { + switch (_context24.prev = _context24.next) { + case 0: + return _context24.delegateYield(this.getInsertion(id), 't0', 1); + + case 1: + ins = _context24.t0; + + if (!(ins != null)) { + _context24.next = 21; + break; + } + + if (!(ins.id[1] === id[1])) { + _context24.next = 7; + break; + } + + return _context24.abrupt('return', ins); + + case 7: + left = Y.utils.copyObject(ins); + + ins.content = left.content.splice(id[1] - ins.id[1]); + ins.id = id; + leftLid = Y.utils.getLastId(left); + + ins.origin = leftLid; + left.originOf = [ins.id]; + left.right = ins.id; + ins.left = leftLid; + // debugger // check + return _context24.delegateYield(this.setOperation(left), 't1', 16); + + case 16: + return _context24.delegateYield(this.setOperation(ins), 't2', 17); + + case 17: + if (left.gc) { + this.store.queueGarbageCollector(ins.id); + } + return _context24.abrupt('return', ins); + + case 19: + _context24.next = 22; + break; + + case 21: + return _context24.abrupt('return', null); + + case 22: + case 'end': + return _context24.stop(); + } + } + }, getInsertionCleanStart, this); + }) + // Return an insertion such that id is the last element of content + // This function manipulates an operation, if necessary + + }, { + key: 'getInsertionCleanEnd', + value: regeneratorRuntime.mark(function getInsertionCleanEnd(id) { + var ins, right, insLid; + return regeneratorRuntime.wrap(function getInsertionCleanEnd$(_context25) { + while (1) { + switch (_context25.prev = _context25.next) { + case 0: + return _context25.delegateYield(this.getInsertion(id), 't0', 1); + + case 1: + ins = _context25.t0; + + if (!(ins != null)) { + _context25.next = 21; + break; + } + + if (!(ins.content == null || ins.id[1] + ins.content.length - 1 === id[1])) { + _context25.next = 7; + break; + } + + return _context25.abrupt('return', ins); + + case 7: + right = Y.utils.copyObject(ins); + + right.content = ins.content.splice(id[1] - ins.id[1] + 1); // cut off remainder + right.id = [id[0], id[1] + 1]; + insLid = Y.utils.getLastId(ins); + + right.origin = insLid; + ins.originOf = [right.id]; + ins.right = right.id; + right.left = insLid; + // debugger // check + return _context25.delegateYield(this.setOperation(right), 't1', 16); + + case 16: + return _context25.delegateYield(this.setOperation(ins), 't2', 17); + + case 17: + if (ins.gc) { + this.store.queueGarbageCollector(right.id); + } + return _context25.abrupt('return', ins); + + case 19: + _context25.next = 22; + break; + + case 21: + return _context25.abrupt('return', null); + + case 22: + case 'end': + return _context25.stop(); + } + } + }, getInsertionCleanEnd, this); + }) + }, { + key: 'getOperation', + value: regeneratorRuntime.mark(function getOperation(id /* :any */) { + var o, comp, struct, op; + return regeneratorRuntime.wrap(function getOperation$(_context26) { + while (1) { + switch (_context26.prev = _context26.next) { + case 0: + return _context26.delegateYield(this.os.find(id), 't0', 1); + + case 1: + o = _context26.t0; + + if (!(id[0] !== '_' || o != null)) { + _context26.next = 6; + break; + } + + return _context26.abrupt('return', o); + + case 6: + // type is string + // generate this operation? + comp = id[1].split('_'); + + if (!(comp.length > 1)) { + _context26.next = 15; + break; + } + + struct = comp[0]; + op = Y.Struct[struct].create(id); + + op.type = comp[1]; + return _context26.delegateYield(this.setOperation(op), 't1', 12); + + case 12: + return _context26.abrupt('return', op); + + case 15: + // won't be called. but just in case.. + console.error('Unexpected case. How can this happen?'); + debugger; // eslint-disable-line + return _context26.abrupt('return', null); + + case 18: + case 'end': + return _context26.stop(); + } + } + }, getOperation, this); + }) + }, { + key: 'removeOperation', + value: regeneratorRuntime.mark(function removeOperation(id) { + return regeneratorRuntime.wrap(function removeOperation$(_context27) { + while (1) { + switch (_context27.prev = _context27.next) { + case 0: + return _context27.delegateYield(this.os.delete(id), 't0', 1); + + case 1: + case 'end': + return _context27.stop(); + } + } + }, removeOperation, this); + }) + }, { + key: 'setState', + value: regeneratorRuntime.mark(function setState(state) { + var val; + return regeneratorRuntime.wrap(function setState$(_context28) { + while (1) { + switch (_context28.prev = _context28.next) { + case 0: + val = { + id: [state.user], + clock: state.clock + }; + return _context28.delegateYield(this.ss.put(val), 't0', 2); + + case 2: + case 'end': + return _context28.stop(); + } + } + }, setState, this); + }) + }, { + key: 'getState', + value: regeneratorRuntime.mark(function getState(user) { + var n, clock; + return regeneratorRuntime.wrap(function getState$(_context29) { + while (1) { + switch (_context29.prev = _context29.next) { + case 0: + return _context29.delegateYield(this.ss.find([user]), 't0', 1); + + case 1: + n = _context29.t0; + clock = n == null ? null : n.clock; + + if (clock == null) { + clock = 0; + } + return _context29.abrupt('return', { + user: user, + clock: clock + }); + + case 5: + case 'end': + return _context29.stop(); + } + } + }, getState, this); + }) + }, { + key: 'getStateVector', + value: regeneratorRuntime.mark(function getStateVector() { + var stateVector; + return regeneratorRuntime.wrap(function getStateVector$(_context31) { + while (1) { + switch (_context31.prev = _context31.next) { + case 0: + stateVector = []; + return _context31.delegateYield(this.ss.iterate(this, null, null, regeneratorRuntime.mark(function _callee4(n) { + return regeneratorRuntime.wrap(function _callee4$(_context30) { + while (1) { + switch (_context30.prev = _context30.next) { + case 0: + stateVector.push({ + user: n.id[0], + clock: n.clock + }); + + case 1: + case 'end': + return _context30.stop(); + } + } + }, _callee4, this); + })), 't0', 2); + + case 2: + return _context31.abrupt('return', stateVector); + + case 3: + case 'end': + return _context31.stop(); + } + } + }, getStateVector, this); + }) + }, { + key: 'getStateSet', + value: regeneratorRuntime.mark(function getStateSet() { + var ss; + return regeneratorRuntime.wrap(function getStateSet$(_context33) { + while (1) { + switch (_context33.prev = _context33.next) { + case 0: + ss = {}; + return _context33.delegateYield(this.ss.iterate(this, null, null, regeneratorRuntime.mark(function _callee5(n) { + return regeneratorRuntime.wrap(function _callee5$(_context32) { + while (1) { + switch (_context32.prev = _context32.next) { + case 0: + ss[n.id[0]] = n.clock; + + case 1: + case 'end': + return _context32.stop(); + } + } + }, _callee5, this); + })), 't0', 2); + + case 2: + return _context33.abrupt('return', ss); + + case 3: + case 'end': + return _context33.stop(); + } + } + }, getStateSet, this); + }) + /* + Here, we make all missing operations executable for the receiving user. + Notes: + startSS: denotes to the SV that the remote user sent + currSS: denotes to the state vector that the user should have if he + applies all already sent operations (increases is each step) + We face several problems: + * Execute op as is won't work because ops depend on each other + -> find a way so that they do not anymore + * When changing left, must not go more to the left than the origin + * When changing right, you have to consider that other ops may have op + as their origin, this means that you must not set one of these ops + as the new right (interdependencies of ops) + * can't just go to the right until you find the first known operation, + With currSS + -> interdependency of ops is a problem + With startSS + -> leads to inconsistencies when two users join at the same time. + Then the position depends on the order of execution -> error! + Solution: + -> re-create originial situation + -> set op.left = op.origin (which never changes) + -> set op.right + to the first operation that is known (according to startSS) + or to the first operation that has an origin that is not to the + right of op. + -> Enforces unique execution order -> happy user + Improvements: TODO + * Could set left to origin, or the first known operation + (startSS or currSS.. ?) + -> Could be necessary when I turn GC again. + -> Is a bad(ish) idea because it requires more computation + What we do: + * Iterate over all missing operations. + * When there is an operation, where the right op is known, send this op all missing ops to the left to the user + * I explained above what we have to do with each operation. Here is how we do it efficiently: + 1. Go to the left until you find either op.origin, or a known operation (let o denote current operation in the iteration) + 2. Found a known operation -> set op.left = o, and send it to the user. stop + 3. Found o = op.origin -> set op.left = op.origin, and send it to the user. start again from 1. (set op = o) + 4. Found some o -> set o.right = op, o.left = o.origin, send it to the user, continue + */ + + }, { + key: 'getOperations', + value: regeneratorRuntime.mark(function getOperations(startSS) { + var send, endSV, _iteratorNormalCompletion, _didIteratorError, _iteratorError, _iterator, _step, endState, user, startPos, firstMissing; + + return regeneratorRuntime.wrap(function getOperations$(_context35) { + while (1) { + switch (_context35.prev = _context35.next) { + case 0: + // TODO: use bounds here! + if (startSS == null) { + startSS = {}; + } + send = []; + return _context35.delegateYield(this.getStateVector(), 't0', 3); + + case 3: + endSV = _context35.t0; + _iteratorNormalCompletion = true; + _didIteratorError = false; + _iteratorError = undefined; + _context35.prev = 7; + _iterator = endSV[Symbol.iterator](); + + case 9: + if (_iteratorNormalCompletion = (_step = _iterator.next()).done) { + _context35.next = 23; + break; + } + + endState = _step.value; + user = endState.user; + + if (!(user === '_')) { + _context35.next = 14; + break; + } + + return _context35.abrupt('continue', 20); + + case 14: + startPos = startSS[user] || 0; + + if (!(startPos > 0)) { + _context35.next = 19; + break; + } + + return _context35.delegateYield(this.getInsertion([user, startPos]), 't1', 17); + + case 17: + firstMissing = _context35.t1; + + if (firstMissing != null) { + // update startPos + startPos = firstMissing.id[1]; + } + + case 19: + return _context35.delegateYield(this.os.iterate(this, [user, startPos], [user, Number.MAX_VALUE], regeneratorRuntime.mark(function _callee6(op) { + var o, missing_origins, newright, s; + return regeneratorRuntime.wrap(function _callee6$(_context34) { + while (1) { + switch (_context34.prev = _context34.next) { + case 0: + op = Y.Struct[op.struct].encode(op); + + if (!(op.struct !== 'Insert')) { + _context34.next = 5; + break; + } + + send.push(op); + _context34.next = 27; + break; + + case 5: + if (!(op.right == null || op.right[1] < (startSS[op.right[0]] || 0))) { + _context34.next = 27; + break; + } + + // case 1. op.right is known + o = op; + // Remember: ? + // -> set op.right + // 1. to the first operation that is known (according to startSS) + // 2. or to the first operation that has an origin that is not to the + // right of op. + // For this we maintain a list of ops which origins are not found yet. + + missing_origins = [op]; + newright = op.right; + + case 9: + if (!true) { + _context34.next = 27; + break; + } + + if (!(o.left == null)) { + _context34.next = 15; + break; + } + + op.left = null; + send.push(op); + if (!Y.utils.compareIds(o.id, op.id)) { + o = Y.Struct[op.struct].encode(o); + o.right = missing_origins[missing_origins.length - 1].id; + send.push(o); + } + return _context34.abrupt('break', 27); + + case 15: + return _context34.delegateYield(this.getInsertion(o.left), 't0', 16); + + case 16: + o = _context34.t0; + + // we set another o, check if we can reduce $missing_origins + while (missing_origins.length > 0 && Y.utils.matchesId(o, missing_origins[missing_origins.length - 1].origin)) { + missing_origins.pop(); + } + + if (!(o.id[1] < (startSS[o.id[0]] || 0))) { + _context34.next = 24; + break; + } + + // case 2. o is known + op.left = Y.utils.getLastId(o); + send.push(op); + return _context34.abrupt('break', 27); + + case 24: + if (Y.utils.matchesId(o, op.origin)) { + // case 3. o is op.origin + op.left = op.origin; + send.push(op); + op = Y.Struct[op.struct].encode(o); + op.right = newright; + if (missing_origins.length > 0) { + console.log('This should not happen .. :( please report this'); + } + missing_origins = [op]; + } else { + // case 4. send o, continue to find op.origin + s = Y.Struct[op.struct].encode(o); + + s.right = missing_origins[missing_origins.length - 1].id; + s.left = s.origin; + send.push(s); + missing_origins.push(o); + } + + case 25: + _context34.next = 9; + break; + + case 27: + case 'end': + return _context34.stop(); + } + } + }, _callee6, this); + })), 't2', 20); + + case 20: + _iteratorNormalCompletion = true; + _context35.next = 9; + break; + + case 23: + _context35.next = 29; + break; + + case 25: + _context35.prev = 25; + _context35.t3 = _context35['catch'](7); + _didIteratorError = true; + _iteratorError = _context35.t3; + + case 29: + _context35.prev = 29; + _context35.prev = 30; + + if (!_iteratorNormalCompletion && _iterator.return) { + _iterator.return(); + } + + case 32: + _context35.prev = 32; + + if (!_didIteratorError) { + _context35.next = 35; + break; + } + + throw _iteratorError; + + case 35: + return _context35.finish(32); + + case 36: + return _context35.finish(29); + + case 37: + return _context35.abrupt('return', send.reverse()); + + case 38: + case 'end': + return _context35.stop(); + } + } + }, getOperations, this, [[7, 25, 29, 37], [30,, 32, 36]]); + }) + /* this is what we used before.. use this as a reference.. + * makeOperationReady (startSS, op) { + op = Y.Struct[op.struct].encode(op) + op = Y.utils.copyObject(op) -- use copyoperation instead now! + var o = op + var ids = [op.id] + // search for the new op.right + // it is either the first known op (according to startSS) + // or the o that has no origin to the right of op + // (this is why we use the ids array) + while (o.right != null) { + var right = yield* this.getOperation(o.right) + if (o.right[1] < (startSS[o.right[0]] || 0) || !ids.some(function (id) { + return Y.utils.compareIds(id, right.origin) + })) { + break + } + ids.push(o.right) + o = right + } + op.right = o.right + op.left = op.origin + return op + } + */ + + }, { + key: 'flush', + value: regeneratorRuntime.mark(function flush() { + return regeneratorRuntime.wrap(function flush$(_context36) { + while (1) { + switch (_context36.prev = _context36.next) { + case 0: + return _context36.delegateYield(this.os.flush(), 't0', 1); + + case 1: + return _context36.delegateYield(this.ss.flush(), 't1', 2); + + case 2: + return _context36.delegateYield(this.ds.flush(), 't2', 3); + + case 3: + case 'end': + return _context36.stop(); + } + } + }, flush, this); + }) + }]); + + return TransactionInterface; + }(); + + Y.Transaction = TransactionInterface; +}; + +},{}],9:[function(require,module,exports){ +/* @flow */ +'use strict'; + +/* + EventHandler is an helper class for constructing custom types. + + Why: When constructing custom types, you sometimes want your types to work + synchronous: E.g. + ``` Synchronous + mytype.setSomething("yay") + mytype.getSomething() === "yay" + ``` + versus + ``` Asynchronous + mytype.setSomething("yay") + mytype.getSomething() === undefined + mytype.waitForSomething().then(function(){ + mytype.getSomething() === "yay" + }) + ``` + + The structures usually work asynchronously (you have to wait for the + database request to finish). EventHandler helps you to make your type + synchronous. +*/ + +var _typeof = typeof Symbol === "function" && typeof Symbol.iterator === "symbol" ? function (obj) { return typeof obj; } : function (obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol ? "symbol" : typeof obj; }; + +var _get = function get(object, property, receiver) { if (object === null) object = Function.prototype; var desc = Object.getOwnPropertyDescriptor(object, property); if (desc === undefined) { var parent = Object.getPrototypeOf(object); if (parent === null) { return undefined; } else { return get(parent, property, receiver); } } else if ("value" in desc) { return desc.value; } else { var getter = desc.get; if (getter === undefined) { return undefined; } return getter.call(receiver); } }; + +var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); + +function _possibleConstructorReturn(self, call) { if (!self) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return call && (typeof call === "object" || typeof call === "function") ? call : self; } + +function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function, not " + typeof superClass); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, enumerable: false, writable: true, configurable: true } }); if (superClass) Object.setPrototypeOf ? Object.setPrototypeOf(subClass, superClass) : subClass.__proto__ = superClass; } + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +module.exports = function (Y /* : any*/) { + Y.utils = {}; + + var EventListenerHandler = function () { + function EventListenerHandler() { + _classCallCheck(this, EventListenerHandler); + + this.eventListeners = []; + } + + _createClass(EventListenerHandler, [{ + key: 'destroy', + value: function destroy() { + this.eventListeners = null; + } + /* + Basic event listener boilerplate... + */ + + }, { + key: 'addEventListener', + value: function addEventListener(f) { + this.eventListeners.push(f); + } + }, { + key: 'removeEventListener', + value: function removeEventListener(f) { + this.eventListeners = this.eventListeners.filter(function (g) { + return f !== g; + }); + } + }, { + key: 'removeAllEventListeners', + value: function removeAllEventListeners() { + this.eventListeners = []; + } + }, { + key: 'callEventListeners', + value: function callEventListeners(event) { + for (var i = 0; i < this.eventListeners.length; i++) { + try { + this.eventListeners[i](event); + } catch (e) { + console.error('User events must not throw Errors!'); + } + } + } + }]); + + return EventListenerHandler; + }(); + + Y.utils.EventListenerHandler = EventListenerHandler; + + var EventHandler = function (_EventListenerHandler) { + _inherits(EventHandler, _EventListenerHandler); + + /* :: + waiting: Array; + awaiting: number; + onevent: Function; + eventListeners: Array; + */ + /* + onevent: is called when the structure changes. + Note: "awaiting opertations" is used to denote operations that were + prematurely called. Events for received operations can not be executed until + all prematurely called operations were executed ("waiting operations") + */ + + function EventHandler(onevent /* : Function */) { + _classCallCheck(this, EventHandler); + + var _this = _possibleConstructorReturn(this, Object.getPrototypeOf(EventHandler).call(this)); + + _this.waiting = []; + _this.awaiting = 0; + _this.onevent = onevent; + return _this; + } + + _createClass(EventHandler, [{ + key: 'destroy', + value: function destroy() { + _get(Object.getPrototypeOf(EventHandler.prototype), 'destroy', this).call(this); + this.waiting = null; + this.awaiting = null; + this.onevent = null; + } + /* + Call this when a new operation arrives. It will be executed right away if + there are no waiting operations, that you prematurely executed + */ + + }, { + key: 'receivedOp', + value: function receivedOp(op) { + var _this2 = this; + + if (this.awaiting <= 0) { + this.onevent(op); + } else if (op.struct === 'Delete') { + var self; + + (function () { + var checkDelete = function checkDelete(d) { + if (d.length == null) { + throw new Error('This shouldn\'t happen! d.length must be defined!'); + } + // we check if o deletes something in self.waiting + // if so, we remove the deleted operation + for (var w = 0; w < self.waiting.length; w++) { + var i = self.waiting[w]; + if (i.struct === 'Insert' && i.id[0] === d.target[0]) { + var iLength = i.hasOwnProperty('content') ? i.content.length : 1; + var dStart = d.target[1]; + var dEnd = d.target[1] + (d.length || 1); + var iStart = i.id[1]; + var iEnd = i.id[1] + iLength; + // Check if they don't overlap + if (iEnd <= dStart || dEnd <= iStart) { + // no overlapping + continue; + } + // we check all overlapping cases. All cases: + /* + 1) iiiii + ddddd + --> modify i and d + 2) iiiiiii + ddddd + --> modify i, remove d + 3) iiiiiii + ddd + --> remove d, modify i, and create another i (for the right hand side) + 4) iiiii + ddddddd + --> remove i, modify d + 5) iiiiiii + ddddddd + --> remove both i and d (**) + 6) iiiiiii + ddddd + --> modify i, remove d + 7) iii + ddddddd + --> remove i, create and apply two d with checkDelete(d) (**) + 8) iiiii + ddddddd + --> remove i, modify d (**) + 9) iiiii + ddddd + --> modify i and d + (**) (also check if i contains content or type) + */ + // TODO: I left some debugger statements, because I want to debug all cases once in production. REMEMBER END TODO + if (iStart < dStart) { + if (dStart < iEnd) { + if (iEnd < dEnd) { + // Case 1 + // remove the right part of i's content + i.content.splice(dStart - iStart); + // remove the start of d's deletion + d.length = dEnd - iEnd; + d.target = [d.target[0], iEnd]; + continue; + } else if (iEnd === dEnd) { + // Case 2 + i.content.splice(dStart - iStart); + // remove d, we do that by simply ending this function + return; + } else { + // (dEnd < iEnd) + // Case 3 + var newI = { + id: [i.id[0], dEnd], + content: i.content.slice(dEnd - iStart), + struct: 'Insert' + }; + self.waiting.push(newI); + i.content.splice(dStart - iStart); + return; + } + } + } else if (dStart === iStart) { + if (iEnd < dEnd) { + // Case 4 + d.length = dEnd - iEnd; + d.target = [d.target[0], iEnd]; + i.content = []; + continue; + } else if (iEnd === dEnd) { + // Case 5 + self.waiting.splice(w, 1); + return; + } else { + // (dEnd < iEnd) + // Case 6 + i.content = i.content.slice(dEnd - iStart); + i.id = [i.id[0], dEnd]; + return; + } + } else { + // (dStart < iStart) + if (iStart < dEnd) { + // they overlap + /* + 7) iii + ddddddd + --> remove i, create and apply two d with checkDelete(d) (**) + 8) iiiii + ddddddd + --> remove i, modify d (**) + 9) iiiii + ddddd + --> modify i and d + */ + if (iEnd < dEnd) { + // Case 7 + debugger; + self.waiting.splice(w, 1); + checkDelete({ + target: [d.target[0], dStart], + length: iStart - dStart, + struct: 'Delete' + }); + checkDelete({ + target: [d.target[0], iEnd], + length: iEnd - dEnd, + struct: 'Delete' + }); + return; + } else if (iEnd === dEnd) { + // Case 8 + self.waiting.splice(w, 1); + w--; + d.length -= iLength; + continue; + } else { + // dEnd < iEnd + // Case 9 + d.length = iStart - dStart; + i.content.splice(0, dEnd - iStart); + i.id = [i.id[0], dEnd]; + continue; + } + } + } + } + } + // finished with remaining operations + self.waiting.push(d); + }; + + self = _this2; + + checkDelete(op); + })(); + } else { + this.waiting.push(op); + } + } + /* + You created some operations, and you want the `onevent` function to be + called right away. Received operations will not be executed untill all + prematurely called operations are executed + */ + + }, { + key: 'awaitAndPrematurelyCall', + value: function awaitAndPrematurelyCall(ops) { + this.awaiting++; + ops.map(Y.utils.copyOperation).forEach(this.onevent); + } + }, { + key: 'awaitOps', + value: regeneratorRuntime.mark(function awaitOps(transaction, f, args) { + var notSoSmartSort, before, _i, o, _o, left, ins, dels, i; + + return regeneratorRuntime.wrap(function awaitOps$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + notSoSmartSort = function notSoSmartSort(array) { + // this function sorts insertions in a executable order + var result = []; + while (array.length > 0) { + for (var i = 0; i < array.length; i++) { + var independent = true; + for (var j = 0; j < array.length; j++) { + if (Y.utils.matchesId(array[j], array[i].left)) { + // array[i] depends on array[j] + independent = false; + break; + } + } + if (independent) { + result.push(array.splice(i, 1)[0]); + i--; + } + } + } + return result; + }; + + before = this.waiting.length; + // somehow create new operations + + return _context.delegateYield(f.apply(transaction, args), 't0', 3); + + case 3: + // remove all appended ops / awaited ops + this.waiting.splice(before); + if (this.awaiting > 0) this.awaiting--; + // if there are no awaited ops anymore, we can update all waiting ops, and send execute them (if there are still no awaited ops) + + if (!(this.awaiting === 0 && this.waiting.length > 0)) { + _context.next = 65; + break; + } + + _i = 0; + + case 7: + if (!(_i < this.waiting.length)) { + _context.next = 36; + break; + } + + o = this.waiting[_i]; + + if (!(o.struct === 'Insert')) { + _context.next = 33; + break; + } + + return _context.delegateYield(transaction.getInsertion(o.id), 't1', 11); + + case 11: + _o = _context.t1; + + if (Y.utils.compareIds(_o.id, o.id)) { + _context.next = 16; + break; + } + + // o got extended + o.left = [o.id[0], o.id[1] - 1]; + _context.next = 33; + break; + + case 16: + if (!(_o.left == null)) { + _context.next = 20; + break; + } + + o.left = null; + _context.next = 33; + break; + + case 20: + return _context.delegateYield(transaction.getInsertion(_o.left), 't2', 21); + + case 21: + left = _context.t2; + + case 22: + if (!(left.deleted != null)) { + _context.next = 32; + break; + } + + if (!(left.left != null)) { + _context.next = 28; + break; + } + + return _context.delegateYield(transaction.getInsertion(left.left), 't3', 25); + + case 25: + left = _context.t3; + _context.next = 30; + break; + + case 28: + left = null; + return _context.abrupt('break', 32); + + case 30: + _context.next = 22; + break; + + case 32: + o.left = left != null ? Y.utils.getLastId(left) : null; + + case 33: + _i++; + _context.next = 7; + break; + + case 36: + // the previous stuff was async, so we have to check again! + // We also pull changes from the bindings, if there exists such a method, this could increase awaiting too + if (this._pullChanges != null) { + this._pullChanges(); + } + + if (!(this.awaiting === 0)) { + _context.next = 65; + break; + } + + // sort by type, execute inserts first + ins = []; + dels = []; + + this.waiting.forEach(function (o) { + if (o.struct === 'Delete') { + dels.push(o); + } else { + ins.push(o); + } + }); + this.waiting = []; + // put in executable order + ins = notSoSmartSort(ins); + // this.onevent can trigger the creation of another operation + // -> check if this.awaiting increased & stop computation if it does + i = 0; + + case 44: + if (!(i < ins.length)) { + _context.next = 54; + break; + } + + if (!(this.awaiting === 0)) { + _context.next = 49; + break; + } + + this.onevent(ins[i]); + _context.next = 51; + break; + + case 49: + this.waiting = this.waiting.concat(ins.slice(i)); + return _context.abrupt('break', 54); + + case 51: + i++; + _context.next = 44; + break; + + case 54: + i = 0; + + case 55: + if (!(i < dels.length)) { + _context.next = 65; + break; + } + + if (!(this.awaiting === 0)) { + _context.next = 60; + break; + } + + this.onevent(dels[i]); + _context.next = 62; + break; + + case 60: + this.waiting = this.waiting.concat(dels.slice(i)); + return _context.abrupt('break', 65); + + case 62: + i++; + _context.next = 55; + break; + + case 65: + case 'end': + return _context.stop(); + } + } + }, awaitOps, this); + }) + // TODO: Remove awaitedInserts and awaitedDeletes in favor of awaitedOps, as they are deprecated and do not always work + // Do this in one of the coming releases that are breaking anyway + /* + Call this when you successfully awaited the execution of n Insert operations + */ + + }, { + key: 'awaitedInserts', + value: function awaitedInserts(n) { + var ops = this.waiting.splice(this.waiting.length - n); + for (var oid = 0; oid < ops.length; oid++) { + var op = ops[oid]; + if (op.struct === 'Insert') { + for (var i = this.waiting.length - 1; i >= 0; i--) { + var w = this.waiting[i]; + // TODO: do I handle split operations correctly here? Super unlikely, but yeah.. + // Also: can this case happen? Can op be inserted in the middle of a larger op that is in $waiting? + if (w.struct === 'Insert') { + if (Y.utils.matchesId(w, op.left)) { + // include the effect of op in w + w.right = op.id; + // exclude the effect of w in op + op.left = w.left; + } else if (Y.utils.compareIds(w.id, op.right)) { + // similar.. + w.left = Y.utils.getLastId(op); + op.right = w.right; + } + } + } + } else { + throw new Error('Expected Insert Operation!'); + } + } + this._tryCallEvents(n); + } + /* + Call this when you successfully awaited the execution of n Delete operations + */ + + }, { + key: 'awaitedDeletes', + value: function awaitedDeletes(n, newLeft) { + var ops = this.waiting.splice(this.waiting.length - n); + for (var j = 0; j < ops.length; j++) { + var del = ops[j]; + if (del.struct === 'Delete') { + if (newLeft != null) { + for (var i = 0; i < this.waiting.length; i++) { + var w = this.waiting[i]; + // We will just care about w.left + if (w.struct === 'Insert' && Y.utils.compareIds(del.target, w.left)) { + w.left = newLeft; + } + } + } + } else { + throw new Error('Expected Delete Operation!'); + } + } + this._tryCallEvents(n); + } + /* (private) + Try to execute the events for the waiting operations + */ + + }, { + key: '_tryCallEvents', + value: function _tryCallEvents() { + function notSoSmartSort(array) { + var result = []; + while (array.length > 0) { + for (var i = 0; i < array.length; i++) { + var independent = true; + for (var j = 0; j < array.length; j++) { + if (Y.utils.matchesId(array[j], array[i].left)) { + // array[i] depends on array[j] + independent = false; + break; + } + } + if (independent) { + result.push(array.splice(i, 1)[0]); + i--; + } + } + } + return result; + } + if (this.awaiting > 0) this.awaiting--; + if (this.awaiting === 0 && this.waiting.length > 0) { + var ins = []; + var dels = []; + this.waiting.forEach(function (o) { + if (o.struct === 'Delete') { + dels.push(o); + } else { + ins.push(o); + } + }); + ins = notSoSmartSort(ins); + ins.forEach(this.onevent); + dels.forEach(this.onevent); + this.waiting = []; + } + } + }]); + + return EventHandler; + }(EventListenerHandler); + + Y.utils.EventHandler = EventHandler; + + /* + A wrapper for the definition of a custom type. + Every custom type must have three properties: + * struct + - Structname of this type + * initType + - Given a model, creates a custom type + * class + - the constructor of the custom type (e.g. in order to inherit from a type) + */ + + var CustomType = // eslint-disable-line + /* :: + struct: any; + initType: any; + class: Function; + name: String; + */ + function CustomType(def) { + _classCallCheck(this, CustomType); + + if (def.struct == null || def.initType == null || def.class == null || def.name == null) { + throw new Error('Custom type was not initialized correctly!'); + } + this.struct = def.struct; + this.initType = def.initType; + this.class = def.class; + this.name = def.name; + if (def.appendAdditionalInfo != null) { + this.appendAdditionalInfo = def.appendAdditionalInfo; + } + this.parseArguments = (def.parseArguments || function () { + return [this]; + }).bind(this); + this.parseArguments.typeDefinition = this; + }; + + Y.utils.CustomType = CustomType; + + Y.utils.isTypeDefinition = function isTypeDefinition(v) { + if (v != null) { + if (v instanceof Y.utils.CustomType) return [v];else if (v.constructor === Array && v[0] instanceof Y.utils.CustomType) return v;else if (v instanceof Function && v.typeDefinition instanceof Y.utils.CustomType) return [v.typeDefinition]; + } + return false; + }; + + /* + Make a flat copy of an object + (just copy properties) + */ + function copyObject(o) { + var c = {}; + for (var key in o) { + c[key] = o[key]; + } + return c; + } + Y.utils.copyObject = copyObject; + + /* + Copy an operation, so that it can be manipulated. + Note: You must not change subproperties (except o.content)! + */ + function copyOperation(o) { + o = copyObject(o); + if (o.content != null) { + o.content = o.content.map(function (c) { + return c; + }); + } + return o; + } + + Y.utils.copyOperation = copyOperation; + + /* + Defines a smaller relation on Id's + */ + function smaller(a, b) { + return a[0] < b[0] || a[0] === b[0] && (a[1] < b[1] || _typeof(a[1]) < _typeof(b[1])); + } + Y.utils.smaller = smaller; + + function inDeletionRange(del, ins) { + return del.target[0] === ins[0] && del.target[1] <= ins[1] && ins[1] < del.target[1] + (del.length || 1); + } + Y.utils.inDeletionRange = inDeletionRange; + + function compareIds(id1, id2) { + if (id1 == null || id2 == null) { + return id1 === id2; + } else { + return id1[0] === id2[0] && id1[1] === id2[1]; + } + } + Y.utils.compareIds = compareIds; + + function matchesId(op, id) { + if (id == null || op == null) { + return id === op; + } else { + if (id[0] === op.id[0]) { + if (op.content == null) { + return id[1] === op.id[1]; + } else { + return id[1] >= op.id[1] && id[1] < op.id[1] + op.content.length; + } + } + } + } + Y.utils.matchesId = matchesId; + + function getLastId(op) { + if (op.content == null || op.content.length === 1) { + return op.id; + } else { + return [op.id[0], op.id[1] + op.content.length - 1]; + } + } + Y.utils.getLastId = getLastId; + + function createEmptyOpsArray(n) { + var a = new Array(n); + for (var i = 0; i < a.length; i++) { + a[i] = { + id: [null, null] + }; + } + return a; + } + + function createSmallLookupBuffer(Store) { + /* + This buffer implements a very small buffer that temporarily stores operations + after they are read / before they are written. + The buffer basically implements FIFO. Often requested lookups will be re-queued every time they are looked up / written. + It can speed up lookups on Operation Stores and State Stores. But it does not require notable use of memory or processing power. + Good for os and ss, bot not for ds (because it often uses methods that require a flush) + I tried to optimize this for performance, therefore no highlevel operations. + */ + + var SmallLookupBuffer = function (_Store) { + _inherits(SmallLookupBuffer, _Store); + + function SmallLookupBuffer(arg1, arg2) { + _classCallCheck(this, SmallLookupBuffer); + + var _this3 = _possibleConstructorReturn(this, Object.getPrototypeOf(SmallLookupBuffer).call(this, arg1, arg2)); + // super(...arguments) -- do this when this is supported by stable nodejs + + + _this3.writeBuffer = createEmptyOpsArray(5); + _this3.readBuffer = createEmptyOpsArray(10); + return _this3; + } + + _createClass(SmallLookupBuffer, [{ + key: 'find', + value: regeneratorRuntime.mark(function find(id, noSuperCall) { + var i, r, o; + return regeneratorRuntime.wrap(function find$(_context2) { + while (1) { + switch (_context2.prev = _context2.next) { + case 0: + i = this.readBuffer.length - 1; + + case 1: + if (!(i >= 0)) { + _context2.next = 10; + break; + } + + r = this.readBuffer[i]; + // we don't have to use compareids, because id is always defined! + + if (!(r.id[1] === id[1] && r.id[0] === id[0])) { + _context2.next = 7; + break; + } + + // found r + // move r to the end of readBuffer + for (; i < this.readBuffer.length - 1; i++) { + this.readBuffer[i] = this.readBuffer[i + 1]; + } + this.readBuffer[this.readBuffer.length - 1] = r; + return _context2.abrupt('return', r); + + case 7: + i--; + _context2.next = 1; + break; + + case 10: + i = this.writeBuffer.length - 1; + + case 11: + if (!(i >= 0)) { + _context2.next = 19; + break; + } + + r = this.writeBuffer[i]; + + if (!(r.id[1] === id[1] && r.id[0] === id[0])) { + _context2.next = 16; + break; + } + + o = r; + return _context2.abrupt('break', 19); + + case 16: + i--; + _context2.next = 11; + break; + + case 19: + if (!(i < 0 && noSuperCall === undefined)) { + _context2.next = 22; + break; + } + + return _context2.delegateYield(_get(Object.getPrototypeOf(SmallLookupBuffer.prototype), 'find', this).call(this, id), 't0', 21); + + case 21: + o = _context2.t0; + + case 22: + if (o != null) { + for (i = 0; i < this.readBuffer.length - 1; i++) { + this.readBuffer[i] = this.readBuffer[i + 1]; + } + this.readBuffer[this.readBuffer.length - 1] = o; + } + return _context2.abrupt('return', o); + + case 24: + case 'end': + return _context2.stop(); + } + } + }, find, this); + }) + }, { + key: 'put', + value: regeneratorRuntime.mark(function put(o) { + var id, i, r, write; + return regeneratorRuntime.wrap(function put$(_context3) { + while (1) { + switch (_context3.prev = _context3.next) { + case 0: + id = o.id; + i = this.writeBuffer.length - 1; + + case 2: + if (!(i >= 0)) { + _context3.next = 11; + break; + } + + r = this.writeBuffer[i]; + + if (!(r.id[1] === id[1] && r.id[0] === id[0])) { + _context3.next = 8; + break; + } + + // is already in buffer + // forget r, and move o to the end of writeBuffer + for (; i < this.writeBuffer.length - 1; i++) { + this.writeBuffer[i] = this.writeBuffer[i + 1]; + } + this.writeBuffer[this.writeBuffer.length - 1] = o; + return _context3.abrupt('break', 11); + + case 8: + i--; + _context3.next = 2; + break; + + case 11: + if (!(i < 0)) { + _context3.next = 17; + break; + } + + // did not reach break in last loop + // write writeBuffer[0] + write = this.writeBuffer[0]; + + if (!(write.id[0] !== null)) { + _context3.next = 15; + break; + } + + return _context3.delegateYield(_get(Object.getPrototypeOf(SmallLookupBuffer.prototype), 'put', this).call(this, write), 't0', 15); + + case 15: + // put o to the end of writeBuffer + for (i = 0; i < this.writeBuffer.length - 1; i++) { + this.writeBuffer[i] = this.writeBuffer[i + 1]; + } + this.writeBuffer[this.writeBuffer.length - 1] = o; + + case 17: + // check readBuffer for every occurence of o.id, overwrite if found + // whether found or not, we'll append o to the readbuffer + for (i = 0; i < this.readBuffer.length - 1; i++) { + r = this.readBuffer[i + 1]; + if (r.id[1] === id[1] && r.id[0] === id[0]) { + this.readBuffer[i] = o; + } else { + this.readBuffer[i] = r; + } + } + this.readBuffer[this.readBuffer.length - 1] = o; + + case 19: + case 'end': + return _context3.stop(); + } + } + }, put, this); + }) + }, { + key: 'delete', + value: regeneratorRuntime.mark(function _delete(id) { + var i, r; + return regeneratorRuntime.wrap(function _delete$(_context4) { + while (1) { + switch (_context4.prev = _context4.next) { + case 0: + for (i = 0; i < this.readBuffer.length; i++) { + r = this.readBuffer[i]; + if (r.id[1] === id[1] && r.id[0] === id[0]) { + this.readBuffer[i] = { + id: [null, null] + }; + } + } + return _context4.delegateYield(this.flush(), 't0', 2); + + case 2: + return _context4.delegateYield(_get(Object.getPrototypeOf(SmallLookupBuffer.prototype), 'delete', this).call(this, id), 't1', 3); + + case 3: + case 'end': + return _context4.stop(); + } + } + }, _delete, this); + }) + }, { + key: 'findWithLowerBound', + value: regeneratorRuntime.mark(function findWithLowerBound(id) { + var o, + _args5 = arguments; + return regeneratorRuntime.wrap(function findWithLowerBound$(_context5) { + while (1) { + switch (_context5.prev = _context5.next) { + case 0: + return _context5.delegateYield(this.find(id, true), 't0', 1); + + case 1: + o = _context5.t0; + + if (!(o != null)) { + _context5.next = 6; + break; + } + + return _context5.abrupt('return', o); + + case 6: + return _context5.delegateYield(this.flush(), 't1', 7); + + case 7: + return _context5.delegateYield(_get(Object.getPrototypeOf(SmallLookupBuffer.prototype), 'findWithLowerBound', this).apply(this, _args5), 't2', 8); + + case 8: + return _context5.abrupt('return', _context5.t2); + + case 9: + case 'end': + return _context5.stop(); + } + } + }, findWithLowerBound, this); + }) + }, { + key: 'findWithUpperBound', + value: regeneratorRuntime.mark(function findWithUpperBound(id) { + var o, + _args6 = arguments; + return regeneratorRuntime.wrap(function findWithUpperBound$(_context6) { + while (1) { + switch (_context6.prev = _context6.next) { + case 0: + return _context6.delegateYield(this.find(id, true), 't0', 1); + + case 1: + o = _context6.t0; + + if (!(o != null)) { + _context6.next = 6; + break; + } + + return _context6.abrupt('return', o); + + case 6: + return _context6.delegateYield(this.flush(), 't1', 7); + + case 7: + return _context6.delegateYield(_get(Object.getPrototypeOf(SmallLookupBuffer.prototype), 'findWithUpperBound', this).apply(this, _args6), 't2', 8); + + case 8: + return _context6.abrupt('return', _context6.t2); + + case 9: + case 'end': + return _context6.stop(); + } + } + }, findWithUpperBound, this); + }) + }, { + key: 'findNext', + value: regeneratorRuntime.mark(function findNext() { + var _args7 = arguments; + return regeneratorRuntime.wrap(function findNext$(_context7) { + while (1) { + switch (_context7.prev = _context7.next) { + case 0: + return _context7.delegateYield(this.flush(), 't0', 1); + + case 1: + return _context7.delegateYield(_get(Object.getPrototypeOf(SmallLookupBuffer.prototype), 'findNext', this).apply(this, _args7), 't1', 2); + + case 2: + return _context7.abrupt('return', _context7.t1); + + case 3: + case 'end': + return _context7.stop(); + } + } + }, findNext, this); + }) + }, { + key: 'findPrev', + value: regeneratorRuntime.mark(function findPrev() { + var _args8 = arguments; + return regeneratorRuntime.wrap(function findPrev$(_context8) { + while (1) { + switch (_context8.prev = _context8.next) { + case 0: + return _context8.delegateYield(this.flush(), 't0', 1); + + case 1: + return _context8.delegateYield(_get(Object.getPrototypeOf(SmallLookupBuffer.prototype), 'findPrev', this).apply(this, _args8), 't1', 2); + + case 2: + return _context8.abrupt('return', _context8.t1); + + case 3: + case 'end': + return _context8.stop(); + } + } + }, findPrev, this); + }) + }, { + key: 'iterate', + value: regeneratorRuntime.mark(function iterate() { + var _args9 = arguments; + return regeneratorRuntime.wrap(function iterate$(_context9) { + while (1) { + switch (_context9.prev = _context9.next) { + case 0: + return _context9.delegateYield(this.flush(), 't0', 1); + + case 1: + return _context9.delegateYield(_get(Object.getPrototypeOf(SmallLookupBuffer.prototype), 'iterate', this).apply(this, _args9), 't1', 2); + + case 2: + case 'end': + return _context9.stop(); + } + } + }, iterate, this); + }) + }, { + key: 'flush', + value: regeneratorRuntime.mark(function flush() { + var i, write; + return regeneratorRuntime.wrap(function flush$(_context10) { + while (1) { + switch (_context10.prev = _context10.next) { + case 0: + i = 0; + + case 1: + if (!(i < this.writeBuffer.length)) { + _context10.next = 9; + break; + } + + write = this.writeBuffer[i]; + + if (!(write.id[0] !== null)) { + _context10.next = 6; + break; + } + + return _context10.delegateYield(_get(Object.getPrototypeOf(SmallLookupBuffer.prototype), 'put', this).call(this, write), 't0', 5); + + case 5: + this.writeBuffer[i] = { + id: [null, null] + }; + + case 6: + i++; + _context10.next = 1; + break; + + case 9: + case 'end': + return _context10.stop(); + } + } + }, flush, this); + }) + }]); + + return SmallLookupBuffer; + }(Store); + + return SmallLookupBuffer; + } + Y.utils.createSmallLookupBuffer = createSmallLookupBuffer; +}; + +},{}],10:[function(require,module,exports){ +/* @flow */ +'use strict'; + +var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); + +function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } + +require('./Connector.js')(Y); +require('./Database.js')(Y); +require('./Transaction.js')(Y); +require('./Struct.js')(Y); +require('./Utils.js')(Y); +require('./Connectors/Test.js')(Y); + +var requiringModules = {}; + +module.exports = Y; +Y.requiringModules = requiringModules; + +Y.extend = function (name, value) { + if (value instanceof Y.utils.CustomType) { + Y[name] = value.parseArguments; + } else { + Y[name] = value; + } + if (requiringModules[name] != null) { + requiringModules[name].resolve(); + delete requiringModules[name]; + } +}; + +Y.requestModules = requestModules; +function requestModules(modules) { + // determine if this module was compiled for es5 or es6 (y.js vs. y.es6) + // if Insert.execute is a Function, then it isnt a generator.. + // then load the es5(.js) files.. + var extention = typeof regeneratorRuntime !== 'undefined' ? '.js' : '.es6'; + var promises = []; + for (var i = 0; i < modules.length; i++) { + var module = modules[i].split('(')[0]; + var modulename = 'y-' + module.toLowerCase(); + if (Y[module] == null) { + if (requiringModules[module] == null) { + // module does not exist + if (typeof window !== 'undefined' && window.Y !== 'undefined') { + var imported; + + (function () { + imported = document.createElement('script'); + + imported.src = Y.sourceDir + '/' + modulename + '/' + modulename + extention; + document.head.appendChild(imported); + + var requireModule = {}; + requiringModules[module] = requireModule; + requireModule.promise = new Promise(function (resolve) { + requireModule.resolve = resolve; + }); + promises.push(requireModule.promise); + })(); + } else { + console.info('YJS: Please do not depend on automatic requiring of modules anymore! Extend modules as follows `require(\'y-modulename\')(Y)`'); + require(modulename)(Y); + } + } else { + promises.push(requiringModules[modules[i]].promise); + } + } + } + return Promise.all(promises); +} + +/* :: +type MemoryOptions = { + name: 'memory' +} +type IndexedDBOptions = { + name: 'indexeddb', + namespace: string +} +type DbOptions = MemoryOptions | IndexedDBOptions + +type WebRTCOptions = { + name: 'webrtc', + room: string +} +type WebsocketsClientOptions = { + name: 'websockets-client', + room: string +} +type ConnectionOptions = WebRTCOptions | WebsocketsClientOptions + +type YOptions = { + connector: ConnectionOptions, + db: DbOptions, + types: Array, + sourceDir: string, + share: {[key: string]: TypeName} +} +*/ + +function Y(opts /* :YOptions */) /* :Promise */{ + opts.types = opts.types != null ? opts.types : []; + var modules = [opts.db.name, opts.connector.name].concat(opts.types); + for (var name in opts.share) { + modules.push(opts.share[name]); + } + Y.sourceDir = opts.sourceDir; + return new Promise(function (resolve, reject) { + setTimeout(function () { + Y.requestModules(modules).then(function () { + if (opts == null) reject('An options object is expected! ');else if (opts.connector == null) reject('You must specify a connector! (missing connector property)');else if (opts.connector.name == null) reject('You must specify connector name! (missing connector.name property)');else if (opts.db == null) reject('You must specify a database! (missing db property)');else if (opts.connector.name == null) reject('You must specify db name! (missing db.name property)');else if (opts.share == null) reject('You must specify a set of shared types!');else { + var yconfig = new YConfig(opts); + yconfig.db.whenUserIdSet(function () { + yconfig.init(function () { + resolve(yconfig); + }); + }); + } + }).catch(reject); + }, 0); + }); +} + +var YConfig = function () { + /* :: + db: Y.AbstractDatabase; + connector: Y.AbstractConnector; + share: {[key: string]: any}; + options: Object; + */ + + function YConfig(opts, callback) { + _classCallCheck(this, YConfig); + + this.options = opts; + this.db = new Y[opts.db.name](this, opts.db); + this.connector = new Y[opts.connector.name](this, opts.connector); + } + + _createClass(YConfig, [{ + key: 'init', + value: function init(callback) { + var opts = this.options; + var share = {}; + this.share = share; + this.db.requestTransaction(regeneratorRuntime.mark(function requestTransaction() { + var propertyname, typeConstructor, typeName, args, type, typedef, id; + return regeneratorRuntime.wrap(function requestTransaction$(_context) { + while (1) { + switch (_context.prev = _context.next) { + case 0: + _context.t0 = regeneratorRuntime.keys(opts.share); + + case 1: + if ((_context.t1 = _context.t0()).done) { + _context.next = 21; + break; + } + + propertyname = _context.t1.value; + typeConstructor = opts.share[propertyname].split('('); + typeName = typeConstructor.splice(0, 1); + args = []; + + if (!(typeConstructor.length === 1)) { + _context.next = 14; + break; + } + + _context.prev = 7; + + args = JSON.parse('[' + typeConstructor[0].split(')')[0] + ']'); + _context.next = 14; + break; + + case 11: + _context.prev = 11; + _context.t2 = _context['catch'](7); + throw new Error('Was not able to parse type definition! (share.' + propertyname + ')'); + + case 14: + type = Y[typeName]; + typedef = type.typeDefinition; + id = ['_', typedef.struct + '_' + typeName + '_' + propertyname + '_' + typeConstructor]; + return _context.delegateYield(this.createType(type.apply(typedef, args), id), 't3', 18); + + case 18: + share[propertyname] = _context.t3; + _context.next = 1; + break; + + case 21: + this.store.whenTransactionsFinished().then(callback); + + case 22: + case 'end': + return _context.stop(); + } + } + }, requestTransaction, this, [[7, 11]]); + })); + } + }, { + key: 'isConnected', + value: function isConnected() { + return this.connector.isSynced; + } + }, { + key: 'disconnect', + value: function disconnect() { + return this.connector.disconnect(); + } + }, { + key: 'reconnect', + value: function reconnect() { + return this.connector.reconnect(); + } + }, { + key: 'destroy', + value: function destroy() { + if (this.connector.destroy != null) { + this.connector.destroy(); + } else { + this.connector.disconnect(); + } + var self = this; + this.db.requestTransaction(regeneratorRuntime.mark(function _callee() { + return regeneratorRuntime.wrap(function _callee$(_context2) { + while (1) { + switch (_context2.prev = _context2.next) { + case 0: + return _context2.delegateYield(self.db.destroy(), 't0', 1); + + case 1: + self.connector = null; + self.db = null; + + case 3: + case 'end': + return _context2.stop(); + } + } + }, _callee, this); + })); + } + }]); + + return YConfig; +}(); + +if (typeof window !== 'undefined') { + window.Y = Y; +} + +},{"./Connector.js":4,"./Connectors/Test.js":5,"./Database.js":6,"./Struct.js":7,"./Transaction.js":8,"./Utils.js":9}]},{},[3,10]) + + //# sourceMappingURL=y.js.map diff --git a/y.js.map b/y.js.map index 723f91ad..50027d68 100644 --- a/y.js.map +++ b/y.js.map @@ -1 +1 @@ -{"version":3,"sources":["node_modules/browser-pack/_prelude.js","node_modules/process/browser.js","y.js","node_modules/regenerator-runtime/runtime.js","node_modules/regenerator/runtime.js","src/Connector.js","src/Connectors/Test.js","src/Database.js","src/Struct.js","src/Transaction.js","src/Utils.js","src/y.js"],"names":["e","t","n","r","s","o","u","a","require","i","f","Error","code","l","exports","call","length","1","module","cleanUpNextTick","draining","currentQueue","queue","concat","queueIndex","drainQueue","timeout","setTimeout","len","run","clearTimeout","Item","fun","array","this","noop","process","nextTick","args","Array","arguments","push","prototype","apply","title","browser","env","argv","version","versions","on","addListener","once","off","removeListener","removeAllListeners","emit","binding","name","cwd","chdir","dir","umask","2","global","_typeof","Symbol","iterator","obj","constructor","wrap","innerFn","outerFn","self","tryLocsList","generator","Object","create","Generator","context","Context","_invoke","makeInvokeMethod","tryCatch","fn","arg","type","err","GeneratorFunction","GeneratorFunctionPrototype","defineIteratorMethods","forEach","method","AwaitArgument","AsyncIterator","invoke","resolve","reject","record","result","value","Promise","then","unwrapped","enqueue","callInvokeWithMethodAndArg","previousPromise","domain","bind","state","GenStateSuspendedStart","GenStateExecuting","GenStateCompleted","doneResult","delegate","undefined","returnMethod","info","done","GenStateSuspendedYield","resultName","next","nextLoc","sent","_sent","dispatchException","abrupt","ContinueSentinel","pushTryEntry","locs","entry","tryLoc","catchLoc","finallyLoc","afterLoc","tryEntries","resetTryEntry","completion","reset","values","iterable","iteratorMethod","iteratorSymbol","isNaN","hasOwn","hasOwnProperty","$Symbol","toStringTagSymbol","toStringTag","inModule","runtime","regeneratorRuntime","Gp","displayName","isGeneratorFunction","genFun","ctor","mark","setPrototypeOf","__proto__","awrap","async","iter","toString","keys","object","key","reverse","pop","skipTempReset","prev","charAt","slice","stop","rootEntry","rootRecord","rval","exception","handle","loc","caught","hasCatch","hasFinally","finallyEntry","complete","finish","catch","thrown","delegateYield","window","_process","3","console","warn","regenerator-runtime/runtime","4","_classCallCheck","instance","Constructor","TypeError","_createClass","defineProperties","target","props","descriptor","enumerable","configurable","writable","defineProperty","protoProps","staticProps","Y","AbstractConnector","y","opts","role","db","forwardAppliedOperations","connections","isSynced","userEventListeners","whenSyncedListeners","currentSyncTarget","syncingClients","forwardToSyncingClients","debug","broadcastedHB","syncStep2","broadcastOpBuffer","protocolVersion","stopGarbageCollector","userId","setUserId","user","findNextSyncTarget","filter","cli","_iteratorNormalCompletion","_didIteratorError","_iteratorError","_step","_iterator","action","_iteratorNormalCompletion2","_didIteratorError2","_iteratorError2","_step2","_iterator2","syncUser","uid","conn","requestTransaction","_callee","stateSet","deleteSet","_context","getStateSet","t0","getDeleteSet","t1","send","_callee2","_iteratorNormalCompletion3","_didIteratorError3","_iteratorError3","_iterator3","_step3","_context2","garbageCollectAfterSync","message","log","ops","broadcastOperations","broadcast","map","op","Struct","struct","encode","transactionInProgress","whenTransactionsFinished","sender","_this","JSON","parse","stringify","error","m","_callee3","currentStateSet","ds","_context3","applyDeleteSet","t2","getOperations","t3","os","_setSyncedWith","broadcastHB","defer","promise","_callee5","_context5","store","_callee4","_context4","broadcastOps","_iteratorNormalCompletion4","_didIteratorError4","_iteratorError4","_step4","_iterator4","client","delops","parseArray","node","_iteratorNormalCompletion5","_didIteratorError5","_iteratorError5","_step5","_iterator5","children","getAttribute","parseObject","json","attrName","attrs","int","parseInt","msg","encodeObject","c","encodeArray","setAttribute","_iteratorNormalCompletion6","_didIteratorError6","_iteratorError6","_step6","_iterator6","xmlns","5","_possibleConstructorReturn","ReferenceError","_inherits","subClass","superClass","_get","get","property","receiver","Function","desc","getOwnPropertyDescriptor","parent","getPrototypeOf","getter","globalRoom","users","buffers","removeUser","userLeft","addUser","connector","uname","userJoined","ps","all","flushOne","bufs","buff","getRandom","_buff","_sender","shift","receiveMessage","flushAll","nextFlush","utils","userIdCounter","Test","_Y$AbstractConnector","options","syncingClientDuration","buffer","isDisconnected","6","AbstractDatabase","garbageCollect","gc1","gc2","isConnected","oid","garbageCollectOperation","gcTimeout","gcInterval","userIdPromise","listenersById","listenersByIdExecuteNow","listenersByIdRequestPending","initializedTypes","waitingTransactions","transactionIsFlushed","YConcurrency_TestingMode","executeOrder","gcTimeouts","id","check","command","join","replace","ungc","getOperation","gc","setOperation","addToGarbageCollector","left","deleted","content","getInsertionCleanStart","queueGarbageCollector","compareIds","destroy","clearInterval","_destroy","inProgress","getState","opClock","clock","numberOfIds","required","requiredOps","requires","whenOperationsExist","ids","listener","missing","sid","exeNow","ls","_i","_listener","_o","_context6","tryExecute","getInsertion","t4","defined","overlapSize","isGarbageCollected","_context7","addToDebug","Delete","execute","splice","getLastId","origin","addOperation","operationAdded","tryCombineWithLeft","transaction","opLen","parentIsDeleted","startId","_i2","opIsDeleted","delop","_context8","_changed","updateState","isDeleted","deleteList","copyOperation","t6","transactionsFinished","_context9","flush","makeGen","callImmediately","_this2","transact","getNextRequest","7","deleteOperation","Insert","right","parentSub","opContent","getDistanceToOrigin","d","matchesId","tryToRemergeLater","distanceToOrigin","start","oOriginDistance","getInsertionCleanEnd","originOf","t5","t7","t8","t10","t11","t12","t13","t15","t16","removeFromGarbageCollector","end","t22","List","ref","pos","res","operation","Map","getType","8","TransactionInterface","typeDefinition","initType","createType","typedefinition","structname","getNextOpId","appendAdditionalInfo","applyCreatedOperations","delLength","markDeleted","targetId","preventCallType","callType","targetLength","findWithUpperBound","markGarbageCollected","newlen","put","findPrev","findNext","diff","_next","iterate","parentDeleted","deps","dep","neworigin","neworigin_","originsIn","setParent","_context10","t9","t17","_id","t19","removeOperation","checkDeleteStoreForState","_context11","Math","max","oLength","_context12","setState","deletions","dv","del","counter","oLen","_context14","Number","MAX_VALUE","_context13","min","_context15","_context17","_context16","_context18","_context19","_context20","_context21","ins","_context22","getInsertionCleanStartEnd","_context23","leftLid","_context24","copyObject","insLid","_context25","comp","_context26","find","split","_context27","val","_context28","ss","_context29","getStateVector","stateVector","_context31","_context30","_context33","_context32","startSS","endSV","endState","startPos","firstMissing","_context35","_callee6","missing_origins","newright","_context34","_context36","Transaction","9","smaller","b","inDeletionRange","id1","id2","createEmptyOpsArray","createSmallLookupBuffer","Store","SmallLookupBuffer","_Store","arg1","arg2","writeBuffer","readBuffer","noSuperCall","write","_delete","findWithLowerBound","_args5","_args6","_args7","_args8","_args9","EventListenerHandler","eventListeners","g","event","EventHandler","_EventListenerHandler","onevent","waiting","awaiting","awaitOps","notSoSmartSort","before","dels","independent","j","_pullChanges","w","_tryCallEvents","newLeft","CustomType","def","parseArguments","isTypeDefinition","v","10","requestModules","modules","extention","promises","modulename","toLowerCase","requiringModules","imported","document","createElement","src","sourceDir","head","appendChild","requireModule","types","share","yconfig","YConfig","whenUserIdSet","init","extend","callback","propertyname","typeConstructor","typeName","typedef","disconnect","reconnect","./Connector.js","./Connectors/Test.js","./Database.js","./Struct.js","./Transaction.js","./Utils.js"],"mappings":"CAAA,QAAAA,GAAAC,EAAAC,EAAAC,GAAA,QAAAC,GAAAC,EAAAC,GAAA,IAAAJ,EAAAG,GAAA,CAAA,IAAAJ,EAAAI,GAAA,CAAA,GAAAE,GAAA,kBAAAC,UAAAA,OAAA,KAAAF,GAAAC,EAAA,MAAAA,GAAAF,GAAA,EAAA,IAAAI,EAAA,MAAAA,GAAAJ,GAAA,EAAA,IAAAK,GAAA,GAAAC,OAAA,uBAAAN,EAAA,IAAA,MAAAK,GAAAE,KAAA,mBAAAF,EAAA,GAAAG,GAAAX,EAAAG,IAAAS,WAAAb,GAAAI,GAAA,GAAAU,KAAAF,EAAAC,QAAA,SAAAd,GAAA,GAAAE,GAAAD,EAAAI,GAAA,GAAAL,EAAA,OAAAI,GAAAF,EAAAA,EAAAF,IAAAa,EAAAA,EAAAC,QAAAd,EAAAC,EAAAC,EAAAC,GAAA,MAAAD,GAAAG,GAAAS,QAAA,IAAA,GAAAL,GAAA,kBAAAD,UAAAA,QAAAH,EAAA,EAAAA,EAAAF,EAAAa,OAAAX,IAAAD,EAAAD,EAAAE,GAAA,OAAAD,KAAAa,GAAA,SAAAT,EAAAU,EAAAJ,GCQA,QAAAK,KACAC,GAAAC,IAGAD,GAAA,EACAC,EAAAL,OACAM,EAAAD,EAAAE,OAAAD,GAEAE,EAAA,GAEAF,EAAAN,QACAS,KAIA,QAAAA,KACA,IAAAL,EAAA,CAGA,GAAAM,GAAAC,WAAAR,EACAC,IAAA,CAGA,KADA,GAAAQ,GAAAN,EAAAN,OACAY,GAAA,CAGA,IAFAP,EAAAC,EACAA,OACAE,EAAAI,GACAP,GACAA,EAAAG,GAAAK,KAGAL,GAAA,GACAI,EAAAN,EAAAN,OAEAK,EAAA,KACAD,GAAA,EACAU,aAAAJ,IAiBA,QAAAK,GAAAC,EAAAC,GACAC,KAAAF,IAAAA,EACAE,KAAAD,MAAAA,EAYA,QAAAE,MAzEA,GAGAd,GAHAe,EAAAlB,EAAAJ,WACAQ,KACAF,GAAA,EAEAI,EAAA,EAyCAY,GAAAC,SAAA,SAAAL,GACA,GAAAM,GAAA,GAAAC,OAAAC,UAAAxB,OAAA,EACA,IAAAwB,UAAAxB,OAAA,EACA,IAAA,GAAAP,GAAA,EAAAA,EAAA+B,UAAAxB,OAAAP,IACA6B,EAAA7B,EAAA,GAAA+B,UAAA/B,EAGAa,GAAAmB,KAAA,GAAAV,GAAAC,EAAAM,IACA,IAAAhB,EAAAN,QAAAI,GACAO,WAAAF,EAAA,IASAM,EAAAW,UAAAb,IAAA,WACAK,KAAAF,IAAAW,MAAA,KAAAT,KAAAD,QAEAG,EAAAQ,MAAA,UACAR,EAAAS,SAAA,EACAT,EAAAU,OACAV,EAAAW,QACAX,EAAAY,QAAA,GACAZ,EAAAa,YAIAb,EAAAc,GAAAf,EACAC,EAAAe,YAAAhB,EACAC,EAAAgB,KAAAjB,EACAC,EAAAiB,IAAAlB,EACAC,EAAAkB,eAAAnB,EACAC,EAAAmB,mBAAApB,EACAC,EAAAoB,KAAArB,EAEAC,EAAAqB,QAAA,SAAAC,GACA,KAAA,IAAA/C,OAAA,qCAGAyB,EAAAuB,IAAA,WAAA,MAAA,KACAvB,EAAAwB,MAAA,SAAAC,GACA,KAAA,IAAAlD,OAAA,mCAEAyB,EAAA0B,MAAA,WAAA,MAAA,SCGMC,GAAG,SAASvD,EAAQU,EAAOJ,IACjC,SAAWsB,EAAQ4B,GACnB,YAEA,IAAIC,GAA4B,kBAAXC,SAAoD,gBAApBA,QAAOC,SAAwB,SAAUC,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAXF,SAAyBE,EAAIC,cAAgBH,OAAS,eAAkBE,KC1FxO,SAASJ,GA0BT,QAASM,GAAKC,EAASC,EAASC,EAAMC,GAEpC,GAAIC,GAAYC,OAAOC,QAAQL,GAAWM,GAAWpC,WACjDqC,EAAU,GAAIC,GAAQN,MAM1B,OAFAC,GAAUM,QAAUC,EAAiBX,EAASE,EAAMM,GAE7CJ,EAcT,QAASQ,GAASC,EAAIhB,EAAKiB,GACzB,IACE,OAASC,KAAM,SAAUD,IAAKD,EAAGrE,KAAKqD,EAAKiB,IAC3C,MAAOE,GACP,OAASD,KAAM,QAASD,IAAKE,IAiBjC,QAAST,MACT,QAASU,MACT,QAASC,MAST,QAASC,GAAsBhD,IAC5B,OAAQ,QAAS,UAAUiD,QAAQ,SAASC,GAC3ClD,EAAUkD,GAAU,SAASP,GAC3B,MAAOnD,MAAK+C,QAAQW,EAAQP,MAqClC,QAASQ,GAAcR,GACrBnD,KAAKmD,IAAMA,EAGb,QAASS,GAAcnB,GACrB,QAASoB,GAAOH,EAAQP,EAAKW,EAASC,GACpC,GAAIC,GAASf,EAASR,EAAUiB,GAASjB,EAAWU,EACpD,IAAoB,UAAhBa,EAAOZ,KAEJ,CACL,GAAIa,GAASD,EAAOb,IAChBe,EAAQD,EAAOC,KACnB,OAAIA,aAAiBP,GACZQ,QAAQL,QAAQI,EAAMf,KAAKiB,KAAK,SAASF,GAC9CL,EAAO,OAAQK,EAAOJ,EAASC,IAC9B,SAASV,GACVQ,EAAO,QAASR,EAAKS,EAASC,KAI3BI,QAAQL,QAAQI,GAAOE,KAAK,SAASC,GAgB1CJ,EAAOC,MAAQG,EACfP,EAAQG,IACPF,GA9BHA,EAAOC,EAAOb,KAwClB,QAASmB,GAAQZ,EAAQP,GACvB,QAASoB,KACP,MAAO,IAAIJ,SAAQ,SAASL,EAASC,GACnCF,EAAOH,EAAQP,EAAKW,EAASC,KAIjC,MAAOS,GAaLA,EAAkBA,EAAgBJ,KAChCG,EAGAA,GACEA,IA/Be,YAAnB,mBAAOrE,GAAP,YAAA6B,EAAO7B,KAAwBA,EAAQuE,SACzCZ,EAAS3D,EAAQuE,OAAOC,KAAKb,GAG/B,IAAIW,EAgCJxE,MAAK+C,QAAUuB,EAoBjB,QAAStB,GAAiBX,EAASE,EAAMM,GACvC,GAAI8B,GAAQC,CAEZ,OAAO,UAAgBlB,EAAQP,GAC7B,GAAIwB,IAAUE,EACZ,KAAM,IAAIpG,OAAM,+BAGlB,IAAIkG,IAAUG,EAAmB,CAC/B,GAAe,UAAXpB,EACF,KAAMP,EAKR,OAAO4B,KAGT,OAAa,CACX,GAAIC,GAAWnC,EAAQmC,QACvB,IAAIA,EAAU,CACZ,GAAe,WAAXtB,GACY,UAAXA,GAAsBsB,EAAS/C,SAASyB,KAAYuB,EAAY,CAGnEpC,EAAQmC,SAAW,IAInB,IAAIE,GAAeF,EAAS/C,SAAS,SACrC,IAAIiD,EAAc,CAChB,GAAIlB,GAASf,EAASiC,EAAcF,EAAS/C,SAAUkB,EACvD,IAAoB,UAAhBa,EAAOZ,KAAkB,CAG3BM,EAAS,QACTP,EAAMa,EAAOb,GACb,WAIJ,GAAe,WAAXO,EAGF,SAIJ,GAAIM,GAASf,EACX+B,EAAS/C,SAASyB,GAClBsB,EAAS/C,SACTkB,EAGF,IAAoB,UAAhBa,EAAOZ,KAAkB,CAC3BP,EAAQmC,SAAW,KAInBtB,EAAS,QACTP,EAAMa,EAAOb,GACb,UAMFO,EAAS,OACTP,EAAM8B,CAEN,IAAIE,GAAOnB,EAAOb,GAClB,KAAIgC,EAAKC,KAKP,MADAT,GAAQU,EACDF,CAJPtC,GAAQmC,EAASM,YAAcH,EAAKjB,MACpCrB,EAAQ0C,KAAOP,EAASQ,QAM1B3C,EAAQmC,SAAW,KAGrB,GAAe,SAAXtB,EAGFb,EAAQ4C,KAAO5C,EAAQ6C,MAAQvC,MAE1B,IAAe,UAAXO,EAAoB,CAC7B,GAAIiB,IAAUC,EAEZ,KADAD,GAAQG,EACF3B,CAGJN,GAAQ8C,kBAAkBxC,KAG5BO,EAAS,OACTP,EAAM8B,OAGY,WAAXvB,GACTb,EAAQ+C,OAAO,SAAUzC,EAG3BwB,GAAQE,CAER,IAAIb,GAASf,EAASZ,EAASE,EAAMM,EACrC,IAAoB,WAAhBmB,EAAOZ,KAAmB,CAG5BuB,EAAQ9B,EAAQuC,KACZN,EACAO,CAEJ,IAAIF,IACFjB,MAAOF,EAAOb,IACdiC,KAAMvC,EAAQuC,KAGhB,IAAIpB,EAAOb,MAAQ0C,EAOjB,MAAOV,EANHtC,GAAQmC,UAAuB,SAAXtB,IAGtBP,EAAM8B,OAMe,UAAhBjB,EAAOZ,OAChBuB,EAAQG,EAGRpB,EAAS,QACTP,EAAMa,EAAOb,OAoBrB,QAAS2C,GAAaC,GACpB,GAAIC,IAAUC,OAAQF,EAAK,GAEvB,KAAKA,KACPC,EAAME,SAAWH,EAAK,IAGpB,IAAKA,KACPC,EAAMG,WAAaJ,EAAK,GACxBC,EAAMI,SAAWL,EAAK,IAGxB/F,KAAKqG,WAAW9F,KAAKyF,GAGvB,QAASM,GAAcN,GACrB,GAAIhC,GAASgC,EAAMO,cACnBvC,GAAOZ,KAAO,eACPY,GAAOb,IACd6C,EAAMO,WAAavC,EAGrB,QAASlB,GAAQN,GAIfxC,KAAKqG,aAAgBJ,OAAQ,SAC7BzD,EAAYiB,QAAQqC,EAAc9F,MAClCA,KAAKwG,OAAM,GA8Bb,QAASC,GAAOC,GACd,GAAIA,EAAU,CACZ,GAAIC,GAAiBD,EAASE,EAC9B,IAAID,EACF,MAAOA,GAAe9H,KAAK6H,EAG7B,IAA6B,kBAAlBA,GAASnB,KAClB,MAAOmB,EAGT,KAAKG,MAAMH,EAAS5H,QAAS,CAC3B,GAAIP,GAAI,GAAIgH,EAAO,QAASA,KAC1B,OAAShH,EAAImI,EAAS5H,QACpB,GAAIgI,EAAOjI,KAAK6H,EAAUnI,GAGxB,MAFAgH,GAAKrB,MAAQwC,EAASnI,GACtBgH,EAAKH,MAAO,EACLG,CAOX,OAHAA,GAAKrB,MAAQe,EACbM,EAAKH,MAAO,EAELG,EAGT,OAAOA,GAAKA,KAAOA,GAKvB,OAASA,KAAMR,GAIjB,QAASA,KACP,OAASb,MAAOe,EAAWG,MAAM,GAjdnC,GACIH,GADA6B,EAASpE,OAAOlC,UAAUuG,eAE1BC,EAA4B,kBAAXhF,QAAwBA,UACzC4E,EAAiBI,EAAQ/E,UAAY,aACrCgF,EAAoBD,EAAQE,aAAe,gBAE3CC,EAA6B,YAAlB,mBAAOnI,GAAP,YAAA+C,EAAO/C,IAClBoI,EAAUtF,EAAOuF,kBACrB,IAAID,EAQF,YAPID,IAGFnI,EAAOJ,QAAUwI,GASrBA,GAAUtF,EAAOuF,mBAAqBF,EAAWnI,EAAOJ,WAaxDwI,EAAQhF,KAAOA,CAoBf,IAAIwC,GAAyB,iBACzBS,EAAyB,iBACzBR,EAAoB,YACpBC,EAAoB,YAIpBe,KAUAyB,EAAK/D,EAA2B/C,UAAYoC,EAAUpC,SAC1D8C,GAAkB9C,UAAY8G,EAAGnF,YAAcoB,EAC/CA,EAA2BpB,YAAcmB,EACzCC,EAA2B0D,GAAqB3D,EAAkBiE,YAAc,oBAYhFH,EAAQI,oBAAsB,SAASC,GACrC,GAAIC,GAAyB,kBAAXD,IAAyBA,EAAOtF,WAClD,OAAOuF,GACHA,IAASpE,GAG2B,uBAAnCoE,EAAKH,aAAeG,EAAKlG,OAC1B,GAGN4F,EAAQO,KAAO,SAASF,GAUtB,MATI/E,QAAOkF,eACTlF,OAAOkF,eAAeH,EAAQlE,IAE9BkE,EAAOI,UAAYtE,EACb0D,IAAqBQ,KACzBA,EAAOR,GAAqB,sBAGhCQ,EAAOjH,UAAYkC,OAAOC,OAAO2E,GAC1BG,GAQTL,EAAQU,MAAQ,SAAS3E,GACvB,MAAO,IAAIQ,GAAcR,IAoF3BK,EAAsBI,EAAcpD,WAKpC4G,EAAQW,MAAQ,SAAS1F,EAASC,EAASC,EAAMC,GAC/C,GAAIwF,GAAO,GAAIpE,GACbxB,EAAKC,EAASC,EAASC,EAAMC,GAG/B,OAAO4E,GAAQI,oBAAoBlF,GAC/B0F,EACAA,EAAKzC,OAAOnB,KAAK,SAASH,GACxB,MAAOA,GAAOmB,KAAOnB,EAAOC,MAAQ8D,EAAKzC,UAkJjD/B,EAAsB8D,GAEtBA,EAAGV,GAAkB,WACnB,MAAO5G,OAGTsH,EAAGL,GAAqB,YAExBK,EAAGW,SAAW,WACZ,MAAO,sBAkCTb,EAAQc,KAAO,SAASC,GACtB,GAAID,KACJ,KAAK,GAAIE,KAAOD,GACdD,EAAK3H,KAAK6H,EAMZ,OAJAF,GAAKG,UAIE,QAAS9C,KACd,KAAO2C,EAAKpJ,QAAQ,CAClB,GAAIsJ,GAAMF,EAAKI,KACf,IAAIF,IAAOD,GAGT,MAFA5C,GAAKrB,MAAQkE,EACb7C,EAAKH,MAAO,EACLG,EAQX,MADAA,GAAKH,MAAO,EACLG,IAsCX6B,EAAQX,OAASA,EAMjB3D,EAAQtC,WACN2B,YAAaW,EAEb0D,MAAO,SAAS+B,GAWd,GAVAvI,KAAKwI,KAAO,EACZxI,KAAKuF,KAAO,EAGZvF,KAAKyF,KAAOzF,KAAK0F,MAAQT,EACzBjF,KAAKoF,MAAO,EACZpF,KAAKgF,SAAW,KAEhBhF,KAAKqG,WAAW5C,QAAQ6C,IAEnBiC,EACH,IAAK,GAAI/G,KAAQxB,MAEQ,MAAnBwB,EAAKiH,OAAO,IACZ3B,EAAOjI,KAAKmB,KAAMwB,KACjBqF,OAAOrF,EAAKkH,MAAM,MACrB1I,KAAKwB,GAAQyD,IAMrB0D,KAAM,WACJ3I,KAAKoF,MAAO,CAEZ,IAAIwD,GAAY5I,KAAKqG,WAAW,GAC5BwC,EAAaD,EAAUrC,UAC3B,IAAwB,UAApBsC,EAAWzF,KACb,KAAMyF,GAAW1F,GAGnB,OAAOnD,MAAK8I,MAGdnD,kBAAmB,SAASoD,GAM1B,QAASC,GAAOC,EAAKC,GAInB,MAHAlF,GAAOZ,KAAO,QACdY,EAAOb,IAAM4F,EACblG,EAAQ0C,KAAO0D,IACNC,EATX,GAAIlJ,KAAKoF,KACP,KAAM2D,EAWR,KAAK,GARDlG,GAAU7C,KAQLzB,EAAIyB,KAAKqG,WAAWvH,OAAS,EAAGP,GAAK,IAAKA,EAAG,CACpD,GAAIyH,GAAQhG,KAAKqG,WAAW9H,GACxByF,EAASgC,EAAMO,UAEnB,IAAqB,SAAjBP,EAAMC,OAIR,MAAO+C,GAAO,MAGhB,IAAIhD,EAAMC,QAAUjG,KAAKwI,KAAM,CAC7B,GAAIW,GAAWrC,EAAOjI,KAAKmH,EAAO,YAC9BoD,EAAatC,EAAOjI,KAAKmH,EAAO,aAEpC,IAAImD,GAAYC,EAAY,CAC1B,GAAIpJ,KAAKwI,KAAOxC,EAAME,SACpB,MAAO8C,GAAOhD,EAAME,UAAU,EACzB,IAAIlG,KAAKwI,KAAOxC,EAAMG,WAC3B,MAAO6C,GAAOhD,EAAMG,gBAGjB,IAAIgD,GACT,GAAInJ,KAAKwI,KAAOxC,EAAME,SACpB,MAAO8C,GAAOhD,EAAME,UAAU,OAG3B,CAAA,IAAIkD,EAMT,KAAM,IAAI3K,OAAM,yCALhB,IAAIuB,KAAKwI,KAAOxC,EAAMG,WACpB,MAAO6C,GAAOhD,EAAMG,gBAU9BP,OAAQ,SAASxC,EAAMD,GACrB,IAAK,GAAI5E,GAAIyB,KAAKqG,WAAWvH,OAAS,EAAGP,GAAK,IAAKA,EAAG,CACpD,GAAIyH,GAAQhG,KAAKqG,WAAW9H,EAC5B,IAAIyH,EAAMC,QAAUjG,KAAKwI,MACrB1B,EAAOjI,KAAKmH,EAAO,eACnBhG,KAAKwI,KAAOxC,EAAMG,WAAY,CAChC,GAAIkD,GAAerD,CACnB,QAIAqD,IACU,UAATjG,GACS,aAATA,IACDiG,EAAapD,QAAU9C,GACvBA,GAAOkG,EAAalD,aAGtBkD,EAAe,KAGjB,IAAIrF,GAASqF,EAAeA,EAAa9C,aAUzC,OATAvC,GAAOZ,KAAOA,EACdY,EAAOb,IAAMA,EAETkG,EACFrJ,KAAKuF,KAAO8D,EAAalD,WAEzBnG,KAAKsJ,SAAStF,GAGT6B,GAGTyD,SAAU,SAAStF,EAAQoC,GACzB,GAAoB,UAAhBpC,EAAOZ,KACT,KAAMY,GAAOb,GAGK,WAAhBa,EAAOZ,MACS,aAAhBY,EAAOZ,KACTpD,KAAKuF,KAAOvB,EAAOb,IACM,WAAhBa,EAAOZ,MAChBpD,KAAK8I,KAAO9E,EAAOb,IACnBnD,KAAKuF,KAAO,OACa,WAAhBvB,EAAOZ,MAAqBgD,IACrCpG,KAAKuF,KAAOa,IAIhBmD,OAAQ,SAASpD,GACf,IAAK,GAAI5H,GAAIyB,KAAKqG,WAAWvH,OAAS,EAAGP,GAAK,IAAKA,EAAG,CACpD,GAAIyH,GAAQhG,KAAKqG,WAAW9H,EAC5B,IAAIyH,EAAMG,aAAeA,EAGvB,MAFAnG,MAAKsJ,SAAStD,EAAMO,WAAYP,EAAMI,UACtCE,EAAcN,GACPH,IAKb2D,QAAS,SAASvD,GAChB,IAAK,GAAI1H,GAAIyB,KAAKqG,WAAWvH,OAAS,EAAGP,GAAK,IAAKA,EAAG,CACpD,GAAIyH,GAAQhG,KAAKqG,WAAW9H,EAC5B,IAAIyH,EAAMC,SAAWA,EAAQ,CAC3B,GAAIjC,GAASgC,EAAMO,UACnB,IAAoB,UAAhBvC,EAAOZ,KAAkB,CAC3B,GAAIqG,GAASzF,EAAOb,GACpBmD,GAAcN,GAEhB,MAAOyD,IAMX,KAAM,IAAIhL,OAAM,0BAGlBiL,cAAe,SAAShD,EAAUpB,EAAYE,GAO5C,MANAxF,MAAKgF,UACH/C,SAAUwE,EAAOC,GACjBpB,WAAYA,EACZE,QAASA,GAGJK,KAOO,YAAlB,mBAAO/D,GAAP,YAAAC,EAAOD,IAAsBA,EACX,YAAlB,mBAAO6H,QAAP,YAAA5H,EAAO4H,SAAsBA,OACb,YAAhB,mBAAOpH,MAAP,YAAAR,EAAOQ,OAAoBA,KAA3B0C,UD0ECpG,KAAKmB,KAAK1B,EAAQ,YAA8B,mBAAXwD,QAAyBA,OAAyB,mBAATS,MAAuBA,KAAyB,mBAAXoH,QAAyBA,aAE5IC,SAAW,IAAIC,GAAG,SAASvL,EAAQU,EAAOJ,GAC7C,YEvuBAkL,SAAQC,KACN,oGAIF/K,EAAOJ,QAAUN,EAAQ,iCFwuBtB0L,8BAA8B,IAAIC,GAAG,SAAS3L,EAAQU,EAAOJ,GG5uBhE,YHkvBA,SAASsL,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAIC,WAAU,qCAFhH,GAAIC,GAAe,WAAc,QAASC,GAAiBC,EAAQC,GAAS,IAAK,GAAIlM,GAAI,EAAGA,EAAIkM,EAAM3L,OAAQP,IAAK,CAAE,GAAImM,GAAaD,EAAMlM,EAAImM,GAAWC,WAAaD,EAAWC,aAAc,EAAOD,EAAWE,cAAe,EAAU,SAAWF,KAAYA,EAAWG,UAAW,GAAMnI,OAAOoI,eAAeN,EAAQE,EAAWtC,IAAKsC,IAAiB,MAAO,UAAUN,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAYR,EAAiBH,EAAY5J,UAAWuK,GAAiBC,GAAaT,EAAiBH,EAAaY,GAAqBZ,KG9uBhiBpL,GAAOJ,QAAU,SAAUqM,GAAa,GAChCC,GADgC,WA2BpC,QAAAA,GAAaC,EAAGC,GAKd,GALoBlB,EAAAlK,KAAAkL,GACpBlL,KAAKmL,EAAIA,EACG,MAARC,IACFA,MAEe,MAAbA,EAAKC,MAA8B,WAAdD,EAAKC,KAC5BrL,KAAKqL,KAAO,aACP,CAAA,GAAkB,UAAdD,EAAKC,KAGd,KAAM,IAAI5M,OAAM,2CAFhBuB,MAAKqL,KAAO,QAIdrL,KAAKmL,EAAEG,GAAGC,yBAA2BH,EAAKG,2BAA4B,EACtEvL,KAAKqL,KAAOD,EAAKC,KACjBrL,KAAKwL,eACLxL,KAAKyL,UAAW,EAChBzL,KAAK0L,sBACL1L,KAAK2L,uBACL3L,KAAK4L,kBAAoB,KACzB5L,KAAK6L,kBACL7L,KAAK8L,wBAA0BV,EAAKU,2BAA4B,EAChE9L,KAAK+L,MAAQX,EAAKW,SAAU,EAC5B/L,KAAKgM,eAAgB,EACrBhM,KAAKiM,UAAY9H,QAAQL,UACzB9D,KAAKkM,qBACLlM,KAAKmM,gBAAkB,GApDW,MAAA7B,GAAAY,IAAA9C,IAAA,YAAAlE,MAAA,eAAAkE,IAAA,aAAAlE,MAAA,WA+DlC,MANAlE,MAAKwL,eACLxL,KAAKyL,UAAW,EAChBzL,KAAK4L,kBAAoB,KACzB5L,KAAKgM,eAAgB,EACrBhM,KAAK6L,kBACL7L,KAAK2L,uBACE3L,KAAKmL,EAAEG,GAAGc,0BA/DiBhE,IAAA,YAAAlE,MAAA,SAiEzBmI,GACT,MAAmB,OAAfrM,KAAKqM,QACPrM,KAAKqM,OAASA,EACPrM,KAAKmL,EAAEG,GAAGgB,UAAUD,IAEpB,QAtEyBjE,IAAA,cAAAlE,MAAA,SAyEvB1F,GACXwB,KAAK0L,mBAAmBnL,KAAK/B,MA1EK4J,IAAA,WAAAlE,MAAA,SA4E1BqI,GACR,GAA8B,MAA1BvM,KAAKwL,YAAYe,GAAe,OAC3BvM,MAAKwL,YAAYe,GACpBA,IAASvM,KAAK4L,oBAChB5L,KAAK4L,kBAAoB,KACzB5L,KAAKwM,sBAEPxM,KAAK6L,eAAiB7L,KAAK6L,eAAeY,OAAO,SAAUC,GACzD,MAAOA,KAAQH,GAPiB,IAAAI,IAAA,EAAAC,GAAA,EAAAC,EAAA5H,MAAA,KASlC,IAAA,GAAA6H,GAAAC,EAAc/M,KAAK0L,mBAAnB1J,OAAAC,cAAA0K,GAAAG,EAAAC,EAAAxH,QAAAH,MAAAuH,GAAA,EAAuC,CAAA,GAA9BnO,GAA8BsO,EAAA5I,KACrC1F,IACEwO,OAAQ,WACRT,KAAMA,KAZwB,MAAAlJ,GAAAuJ,GAAA,EAAAC,EAAAxJ,EAAA,QAAA,KAAAsJ,GAAAI,EAAAA,WAAAA,EAAAA,YAAA,QAAA,GAAAH,EAAA,KAAAC,SA7EFzE,IAAA,aAAAlE,MAAA,SA8FxBqI,EAAMlB,GAChB,GAAY,MAARA,EACF,KAAM,IAAI5M,OAAM,gDAElB,IAA8B,MAA1BuB,KAAKwL,YAAYe,GACnB,KAAM,IAAI9N,OAAM,4BAElBuB,MAAKwL,YAAYe,IACfd,UAAU,EACVJ,KAAMA,EATc,IAAA4B,IAAA,EAAAC,GAAA,EAAAC,EAAAlI,MAAA,KAWtB,IAAA,GAAAmI,GAAAC,EAAcrN,KAAK0L,mBAAnB1J,OAAAC,cAAAgL,GAAAG,EAAAC,EAAA9H,QAAAH,MAAA6H,GAAA,EAAuC,CAAA,GAA9BzO,GAA8B4O,EAAAlJ,KACrC1F,IACEwO,OAAQ,aACRT,KAAMA,EACNlB,KAAMA,KAfY,MAAAhI,GAAA6J,GAAA,EAAAC,EAAA9J,EAAA,QAAA,KAAA4J,GAAAI,EAAAA,WAAAA,EAAAA,YAAA,QAAA,GAAAH,EAAA,KAAAC,IAkBQ,MAA1BnN,KAAK4L,mBACP5L,KAAKwM,wBAjH2BpE,IAAA,aAAAlE,MAAA,SAsHxB1F,GACNwB,KAAKyL,SACPjN,IAEAwB,KAAK2L,oBAAoBpL,KAAK/B,MA1HE4J,IAAA,qBAAAlE,MAAA,WAmIlC,GAA8B,MAA1BlE,KAAK4L,oBAA6B5L,KAAKyL,SAA3C,CAIA,GAAI6B,GAAW,IACf,KAAK,GAAIC,KAAOvN,MAAKwL,YACnB,IAAKxL,KAAKwL,YAAY+B,GAAK9B,SAAU,CACnC6B,EAAWC,CACX,OAGJ,GAAIC,GAAOxN,IACK,OAAZsN,GACFtN,KAAK4L,kBAAoB0B,EACzBtN,KAAKmL,EAAEG,GAAGmC,mBAAVpG,mBAAAM,KAA6B,QAAA+F,KAAA,GACvBC,GACAC,CAFuB,OAAAvG,oBAAAjF,KAAA,SAAAyL,GAAA,OAAA,OAAAA,EAAArF,KAAAqF,EAAAtI,MAAA,IAAA,GAAA,MAAAsI,GAAAnE,cACL1J,KAAK8N,cADA,KAAA,EAAA,KAAA,GAAA,MACvBH,GADuBE,EAAAE,GAAAF,EAAAnE,cAEJ1J,KAAKgO,eAFD,KAAA,EAAA,KAAA,GAEvBJ,EAFuBC,EAAAI,GAG3BT,EAAKU,KAAKZ,GACRlK,KAAM,cACNuK,SAAUA,EACVC,UAAWA,EACXzB,gBAAiBqB,EAAKrB,iBAPG,KAAA,GAAA,IAAA,MAAA,MAAA0B,GAAAlF,SAAA+E,EAAA1N,UAW7BA,KAAKmL,EAAEG,GAAGmC,mBAAVpG,mBAAAM,KAA6B,QAAAwG,KAAA,GAAAC,GAAAC,EAAAC,EAAAC,EAAAC,EAKlBhQ,CALkB,OAAA6I,oBAAAjF,KAAA,SAAAqM,GAAA,OAAA,OAAAA,EAAAjG,KAAAiG,EAAAlJ,MAAA,IAAA,GAAA,MAE3BiI,GAAK/B,UAAW,EAFWgD,EAAA/E,cAGpB1J,KAAK0O,0BAHe,KAAA,EAAA,KAAA,GAK3B,IAL2BN,GAAA,EAAAC,GAAA,EAAAC,EAAArJ,OAAAwJ,EAAAjG,KAAA,EAK3B+F,EAAcf,EAAK7B,oBAAnB3J,OAAAC,cAAAmM,GAAAI,EAAAD,EAAAhJ,QAAAH,MAAAgJ,GAAA,GAAS5P,EAA+BgQ,EAAAtK,QALbuK,GAAAlJ,KAAA,EAAA,MAAA,KAAA,GAAAkJ,EAAAjG,KAAA,EAAAiG,EAAAR,GAAAQ,EAAA,SAAA,GAAAJ,GAAA,EAAAC,EAAAG,EAAAR,EAAA,KAAA,IAAAQ,EAAAjG,KAAA,GAAAiG,EAAAjG,KAAA,IAAA4F,GAAAG,EAAAA,WAAAA,EAAAA,WAAA,KAAA,IAAA,GAAAE,EAAAjG,KAAA,IAAA6F,EAAA,CAAAI,EAAAlJ,KAAA,EAAA,OAAA,KAAA+I,EAAA,KAAA,IAAA,MAAAG,GAAAlF,OAAA,GAAA,KAAA,IAAA,MAAAkF,GAAAlF,OAAA,GAAA,KAAA,IAQ3BiE,EAAK7B,sBARsB,KAAA,IAAA,IAAA,MAAA,MAAA8C,GAAA9F,SAAAwF,EAAAnO,OAAA,EAAA,EAAA,GAAA,KAAA,GAAA,CAAA,GAAA,aA5JGoI,IAAA,OAAAlE,MAAA,SAwK9BqJ,EAAKoB,GACL3O,KAAK+L,OACPjC,QAAQ8E,IAAR,QAAoB5O,KAAKqM,OAAzB,OAAsCkB,EAAtC,KAA8CoB,EAAQvL,KAAQuL,MA1K9BvG,IAAA,eAAAlE,MAAA,SAgLtB2K,GAKZ,QAASC,KACHvM,EAAK2J,kBAAkBpN,OAAS,IAClCyD,EAAKwM,WACH3L,KAAM,SACNyL,IAAKtM,EAAK2J,oBAEZ3J,EAAK2J,sBAVT2C,EAAMA,EAAIG,IAAI,SAAUC,GACtB,MAAOhE,GAAEiE,OAAOD,EAAGE,QAAQC,OAAOH,IAEpC,IAAI1M,GAAOvC,IAU2B,KAAlCA,KAAKkM,kBAAkBpN,QACzBkB,KAAKkM,kBAAoB2C,EACrB7O,KAAKmL,EAAEG,GAAG+D,sBACZrP,KAAKmL,EAAEG,GAAGgE,2BAA2BlL,KAAK0K,GAE1CrP,WAAWqP,EAAqB,IAGlC9O,KAAKkM,kBAAoBlM,KAAKkM,kBAAkB7M,OAAOwP,MAtMvBzG,IAAA,iBAAAlE,MAAA,SA4MpBqL,EAAqBZ,GAAuB,GAAAa,GAAAxP,IAC1D,IAAIuP,IAAWvP,KAAKqM,OAApB,CAMA,GAHIrM,KAAK+L,OACPjC,QAAQ8E,IAAR,WAAuBW,EAAvB,OAAoCvP,KAAKqM,OAAzC,KAAoDsC,EAAQvL,KAAQqM,KAAKC,MAAMD,KAAKE,UAAUhB,KAEjE,MAA3BA,EAAQxC,iBAA2BwC,EAAQxC,kBAAoBnM,KAAKmM,gBAUtE,MATArC,SAAQ8F,MAAR,gGAEU5P,KAAKmM,gBAFf,aAE2CwC,EAAQxC,gBAFnD,+HAKAnM,MAAKkO,KAAKqB,GACRnM,KAAM,YACN+I,gBAAiBnM,KAAKmM,iBAI1B,IAAqB,gBAAjBwC,EAAQvL,MAAwB,WAClC,GAAIoK,GAAAgC,EACAK,EAAIlB,CACRa,GAAKrE,EAAEG,GAAGmC,mBAAVpG,mBAAAM,KAA6B,QAAAmI,KAAA,GACvBC,GAGAC,EACAnB,CALuB,OAAAxH,oBAAAjF,KAAA,SAAA6N,GAAA,OAAA,OAAAA,EAAAzH,KAAAyH,EAAA1K,MAAA,IAAA,GAAA,MAAA0K,GAAAvG,cACE1J,KAAK8N,cADP,KAAA,EAAA,KAAA,GAAA,MACvBiC,GADuBE,EAAAlC,GAAAkC,EAAAvG,cAEpB1J,KAAKkQ,eAAeL,EAAEjC,WAFF,KAAA,EAAA,KAAA,GAAA,MAAAqC,GAAAvG,cAIX1J,KAAKgO,eAJM,KAAA,EAAA,KAAA,GAAA,MAIvBgC,GAJuBC,EAAAE,GAAAF,EAAAvG,cAKV1J,KAAKoQ,cAAcP,EAAElC,UALX,KAAA,EAAA,KAAA,GAKvBkB,EALuBoB,EAAAI,GAM3B7C,EAAKU,KAAKqB,GACRnM,KAAM,cACNkN,GAAIzB,EACJlB,SAAUoC,EACVnC,UAAWoC,EACX7D,gBAAiBnM,KAAKmM,kBAEpBnM,KAAK8L,yBACP0B,EAAK3B,eAAetL,KAAKgP,GACzB9P,WAAW,WACT+N,EAAK3B,eAAiB2B,EAAK3B,eAAeY,OAAO,SAAUC,GACzD,MAAOA,KAAQ6C,IAEjB/B,EAAKU,KAAKqB,GACRnM,KAAM,eAEP,MAEHoK,EAAKU,KAAKqB,GACRnM,KAAM,cAGVoK,EAAK+C,eAAehB,EA5BO,KAAA,IAAA,IAAA,MAAA,MAAAU,GAAAtH,SAAAmH,EAAA9P,gBA8BxB,IAAqB,gBAAjB2O,EAAQvL,KAAwB,CAAA,GAErCoN,GAEAlF,EACAmF,GALqC,WACzC,GAAIjD,GAAAgC,CACAgB,IAAehB,EAAKxD,cACxBwD,EAAKxD,eAAgB,EACjBV,EAAKkE,EAAKrE,EAAEG,GACZmF,KACJA,EAAMC,QAAU,GAAIvM,SAAQ,SAAUL,GACpC2M,EAAM3M,QAAUA,IAElB0L,EAAKvD,UAAYwE,EAAMC,OACvB,IAAIb,GAA4BlB,CAChCrD,GAAGmC,mBAAHpG,mBAAAM,KAAsB,QAAAgJ,KAAA,MAAAtJ,oBAAAjF,KAAA,SAAAwO,GAAA,OAAA,OAAAA,EAAApI,KAAAoI,EAAArL,MAAA,IAAA,GAAA,MAAAqL,GAAAlH,cACb1J,KAAKkQ,eAAeL,EAAEjC,WADT,KAAA,EAAA,KAAA,GAEpB5N,KAAK6Q,MAAMpQ,MAAMoP,EAAES,IACnBhF,EAAGmC,mBAAHpG,mBAAAM,KAAsB,QAAAmJ,KAAA,GAChBjC,EADgB,OAAAxH,oBAAAjF,KAAA,SAAA2O,GAAA,OAAA,OAAAA,EAAAvI,KAAAuI,EAAAxL,MAAA,IAAA,GAAA,MAAAwL,GAAArH,cACH1J,KAAKoQ,cAAcP,EAAElC,UADlB,KAAA,EAAA,KAAA,GAChBkB,EADgBkC,EAAAhD,GAEhBc,EAAI/P,OAAS,IACV0R,EAOHhD,EAAKwD,aAAanC,GANlBrB,EAAKU,KAAKqB,GACRnM,KAAM,SACNyL,IAAKA,KAOX4B,EAAM3M,SAbc,KAAA,GAAA,IAAA,MAAA,MAAAiN,GAAApI,SAAAmI,EAAA9Q,QAHF,KAAA,GAAA,IAAA,MAAA,MAAA4Q,GAAAjI,SAAAgI,EAAA3Q,gBAmBjB,IAAqB,cAAjB2O,EAAQvL,KAAsB,CACvC,GAAIb,GAAOvC,IACXA,MAAKiM,UAAU7H,KAAK,WAClB7B,EAAKgO,eAAehB,SAEjB,IAAqB,WAAjBZ,EAAQvL,KAAmB,CACpC,GAAIpD,KAAK8L,wBAAyB,CAAA,GAAAmF,IAAA,EAAAC,GAAA,EAAAC,EAAAlM,MAAA,KAChC,IAAA,GAAAmM,GAAAC,EAAmBrR,KAAK6L,eAAxB7J,OAAAC,cAAAgP,GAAAG,EAAAC,EAAA9L,QAAAH,MAAA6L,GAAA,EAAwC,CAAA,GAA/BK,GAA+BF,EAAAlN,KACtClE,MAAKkO,KAAKoD,EAAQ3C,IAFY,MAAAtL,GAAA6N,GAAA,EAAAC,EAAA9N,EAAA,QAAA,KAAA4N,GAAAI,EAAAA,WAAAA,EAAAA,YAAA,QAAA,GAAAH,EAAA,KAAAC,KAKlC,GAAInR,KAAKmL,EAAEG,GAAGC,yBAA0B,CACtC,GAAIgG,GAAS5C,EAAQE,IAAIpC,OAAO,SAAUtO,GACxC,MAAoB,WAAbA,EAAEgR,QAEPoC,GAAOzS,OAAS,GAClBkB,KAAKgR,aAAaO,GAGtBvR,KAAKmL,EAAEG,GAAG7K,MAAMkO,EAAQE,UAjTQzG,IAAA,iBAAAlE,MAAA,SAoTpBqI,GACd,GAAIiB,GAAOxN,KAAKwL,YAAYe,EAChB,OAARiB,IACFA,EAAK/B,UAAW,GAEdc,IAASvM,KAAK4L,oBAChB5L,KAAK4L,kBAAoB,KACzB5L,KAAKwM,yBA3T2BpE,IAAA,sBAAAlE,MAAA,SA2Uf2L,GACnB,QAAS2B,GAAYC,GAAM,GAAAC,IAAA,EAAAC,GAAA,EAAAC,EAAA3M,MAAA,KACzB,IAAA,GAAA4M,GAAAC,EAAcL,EAAKM,SAAnB/P,OAAAC,cAAAyP,GAAAG,EAAAC,EAAAvM,QAAAH,MAAAsM,GAAA,EAA6B,CAAA,GAApB1T,GAAoB6T,EAAA3N,KAC3B,OAAkC,SAA9BlG,EAAEgU,aAAa,WACVR,EAAWxT,GAEXiU,EAAYjU,IALE,MAAAqF,GAAAsO,GAAA,EAAAC,EAAAvO,EAAA,QAAA,KAAAqO,GAAAI,EAAAA,WAAAA,EAAAA,YAAA,QAAA,GAAAH,EAAA,KAAAC,KAS3B,QAASK,GAAaR,GACpB,GAAIS,KACJ,KAAK,GAAIC,KAAYV,GAAKW,MAAO,CAC/B,GAAIlO,GAAQuN,EAAKW,MAAMD,GACnBE,EAAMC,SAASpO,EAAO,GACtB2C,OAAMwL,IAAS,GAAKA,IAASnO,EAC/BgO,EAAKC,GAAYjO,EAEjBgO,EAAKC,GAAYE,EAGrB,IAAK,GAAIrU,KAAeyT,GAAKM,SAAU,CACrC,GAAIvQ,GAAOxD,EAAEwD,IACqB,UAA9BxD,EAAEgU,aAAa,WACjBE,EAAK1Q,GAAQgQ,EAAWxT,GAExBkU,EAAK1Q,GAAQyQ,EAAYjU,GAG7B,MAAOkU,GAETD,EAAYpC,MA1WsBzH,IAAA,qBAAAlE,MAAA,SAsXhBqO,EAAKrQ,GAEvB,QAASsQ,GAAc3C,EAAGqC,GACxB,IAAK,GAAI1Q,KAAQ0Q,GAAM,CACrB,GAAIhO,GAAQgO,EAAK1Q,EACL,OAARA,IAEO0C,EAAM/B,cAAgBO,OAC/B8P,EAAa3C,EAAE4C,EAAEjR,GAAO0C,GACfA,EAAM/B,cAAgB9B,MAC/BqS,EAAY7C,EAAE4C,EAAEjR,GAAO0C,GAEvB2L,EAAE8C,aAAanR,EAAM0C,KAI3B,QAASwO,GAAa7C,EAAG9P,GACvB8P,EAAE8C,aAAa,UAAW,OADI,IAAAC,IAAA,EAAAC,GAAA,EAAAC,EAAA7N,MAAA,KAE9B,IAAA,GAAA8N,GAAAC,EAAcjT,EAAdiC,OAAAC,cAAA2Q,GAAAG,EAAAC,EAAAzN,QAAAH,MAAAwN,GAAA,EAAqB,CAAA,GAAZ9U,GAAYiV,EAAA7O,KACfpG,GAAEqE,cAAgBO,OACpB8P,EAAa3C,EAAE4C,EAAE,iBAAkB3U,GAEnC4U,EAAY7C,EAAE4C,EAAE,iBAAkB3U,IANR,MAAAuF,GAAAwP,GAAA,EAAAC,EAAAzP,EAAA,QAAA,KAAAuP,GAAAI,EAAAA,WAAAA,EAAAA,YAAA,QAAA,GAAAH,EAAA,KAAAC,KAUhC,GAAI5Q,EAAIC,cAAgBO,OACtB8P,EAAaD,EAAIE,EAAE,KAAOQ,MAAO,oCAAsC/Q,OAClE,CAAA,GAAIA,EAAIC,cAAgB9B,MAG7B,KAAM,IAAI5B,OAAM,4BAFhBiU,GAAYH,EAAIE,EAAE,KAAOQ,MAAO,oCAAsC/Q,QAnZtCgJ,IAyZtCD,GAAEC,kBAAoBA,QH2gClBgI,GAAG,SAAS5U,EAAQU,EAAOJ,GIt6CjC,YJ86CA,SAASsL,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAIC,WAAU,qCAEhH,QAAS8I,GAA2B5Q,EAAM1D,GAAQ,IAAK0D,EAAQ,KAAM,IAAI6Q,gBAAe,4DAAgE,QAAOvU,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B0D,EAAP1D,EAElO,QAASwU,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAIlJ,WAAU,iEAAoEkJ,GAAeD,GAAS9S,UAAYkC,OAAOC,OAAO4Q,GAAcA,EAAW/S,WAAa2B,aAAe+B,MAAOoP,EAAU3I,YAAY,EAAOE,UAAU,EAAMD,cAAc,KAAe2I,IAAY7Q,OAAOkF,eAAiBlF,OAAOkF,eAAe0L,EAAUC,GAAcD,EAASzL,UAAY0L,GARje,GAAIjJ,GAAe,WAAc,QAASC,GAAiBC,EAAQC,GAAS,IAAK,GAAIlM,GAAI,EAAGA,EAAIkM,EAAM3L,OAAQP,IAAK,CAAE,GAAImM,GAAaD,EAAMlM,EAAImM,GAAWC,WAAaD,EAAWC,aAAc,EAAOD,EAAWE,cAAe,EAAU,SAAWF,KAAYA,EAAWG,UAAW,GAAMnI,OAAOoI,eAAeN,EAAQE,EAAWtC,IAAKsC,IAAiB,MAAO,UAAUN,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAYR,EAAiBH,EAAY5J,UAAWuK,GAAiBC,GAAaT,EAAiBH,EAAaY,GAAqBZ,MAE5hBoJ,EAAO,QAASC,GAAItL,EAAQuL,EAAUC,GAA2B,OAAXxL,IAAiBA,EAASyL,SAASpT,UAAW,IAAIqT,GAAOnR,OAAOoR,yBAAyB3L,EAAQuL,EAAW,IAAazO,SAAT4O,EAAoB,CAAE,GAAIE,GAASrR,OAAOsR,eAAe7L,EAAS,OAAe,QAAX4L,EAA0B9O,OAA2BwO,EAAIM,EAAQL,EAAUC,GAAoB,GAAI,SAAWE,GAAQ,MAAOA,GAAK3P,KAAgB,IAAI+P,GAASJ,EAAKJ,GAAK,OAAexO,UAAXgP,EAA+BhP,OAAoBgP,EAAOpV,KAAK8U,GI16C5d3U,GAAOJ,QAAU,SAAUqM,GACzB,GAAIiJ,IACFC,SACAC,WACAC,WAAY,SAAU9H,GACpB,IAAK,GAAIhO,KAAKyB,MAAKmU,MACjBnU,KAAKmU,MAAM5V,GAAG+V,SAAS/H,SAElBvM,MAAKmU,MAAM5H,SACXvM,MAAKoU,QAAQ7H,IAEtBgI,QAAS,SAAUC,GACjBxU,KAAKmU,MAAMK,EAAUnI,QAAUmI,EAC/BxU,KAAKoU,QAAQI,EAAUnI,UACvB,KAAK,GAAIoI,KAASzU,MAAKmU,MACrB,GAAIM,IAAUD,EAAUnI,OAAQ,CAC9B,GAAIjO,GAAI4B,KAAKmU,MAAMM,EACnBrW,GAAEsW,WAAWF,EAAUnI,OAAQ,UAC/BmI,EAAUE,WAAWtW,EAAEiO,OAAQ,YAIrCiD,yBAA0B,WACxB,GAAIqF,KACJ,KAAK,GAAInT,KAAQxB,MAAKmU,MACpBQ,EAAGpU,KAAKP,KAAKmU,MAAM3S,GAAM2J,EAAEG,GAAGgE,2BAEhC,OAAOnL,SAAQyQ,IAAID,IAErBE,SAAU,WACR,GAAIC,KACJ,KAAK,GAAInB,KAAYO,GAAWE,QAAS,CACvC,GAAIW,GAAOb,EAAWE,QAAQT,GAC1BpT,GAAO,CACX,KAAK,GAAIgP,KAAUwF,GACjB,GAAIA,EAAKxF,GAAQzQ,OAAS,EAAG,CAC3ByB,GAAO,CACP,OAGAA,GACFuU,EAAKvU,KAAKoT,GAGd,GAAImB,EAAKhW,OAAS,EAAG,CACnB,GAAIuN,GAAS2I,UAAUF,GACnBG,EAAOf,EAAWE,QAAQ/H,GAC1B6I,EAASF,UAAUtS,OAAOwF,KAAK+M,IAC/BpF,EAAIoF,EAAKC,GAAQC,OACO,KAAxBF,EAAKC,GAAQpW,cACRmW,GAAKC,EAEd,IAAI3I,GAAO2H,EAAWC,MAAM9H,EAE5B,OADAE,GAAK6I,eAAevF,EAAE,GAAIA,EAAE,IACrBtD,EAAKpB,EAAEG,GAAGgE,2BAEjB,OAAO,GAGX+F,SAAU,WACR,MAAO,IAAIlR,SAAQ,SAAUL,GAG3B,QAASwR,KACP,GAAI7C,GAAIyB,EAAWW,UACnB,IAAIpC,EAAG,CACL,KAAOA,GACLA,EAAIyB,EAAWW,UAEjBX,GAAW5E,2BAA2BlL,KAAKkR,OAE3C7V,YAAW,WACT,GAAIgT,GAAIyB,EAAWW,UACfpC,GACFA,EAAErO,KAAK,WACL8P,EAAW5E,2BAA2BlL,KAAKkR,KAG7CxR,KAED,GAGPoQ,EAAW5E,2BAA2BlL,KAAKkR,MAIjDrK,GAAEsK,MAAMrB,WAAaA,CAErB,IAAIsB,GAAgB,EAEdC,EA3FsB,SAAAC,GA4F1B,QAAAD,GAAatK,EAAGwK,GACd,GADuBzL,EAAAlK,KAAAyV,GACPxQ,SAAZ0Q,EACF,KAAM,IAAIlX,OAAM,iCAElBkX,GAAQtK,KAAO,SACfsK,EAAQ7J,yBAA0B,CALX,IAAA0D,GAAA2D,EAAAnT,KAAA0C,OAAAsR,eAAAyB,GAAA5W,KAAAmB,KAMjBmL,EAAGwK,GANc,OAOvBnG,GAAKlD,UAAWkJ,KAAmB,IAAIpR,KAAK,WAC1C8P,EAAWK,QAAX/E,KAEFA,EAAK0E,WAAaA,EAClB1E,EAAKoG,sBAAwB,EAXNpG,EA5FC,MAAA6D,GAAAoC,EAAAC,GAAApL,EAAAmL,IAAArN,IAAA,iBAAAlE,MAAA,SAyGVqL,EAAQM,GACtB2D,EAAA9Q,OAAAsR,eAAAyB,EAAAjV,WAAA,iBAAAR,MAAAnB,KAAAmB,KAAqBuP,EAAQE,KAAKC,MAAMD,KAAKE,UAAUE,QA1G/BzH,IAAA,OAAAlE,MAAA,SA4GpBmI,EAAQsC,GACZ,GAAIkH,GAAS3B,EAAWE,QAAQ/H,EAClB,OAAVwJ,IACyB,MAAvBA,EAAO7V,KAAKqM,UACdwJ,EAAO7V,KAAKqM,YAEdwJ,EAAO7V,KAAKqM,QAAQ9L,KAAKkP,KAAKC,MAAMD,KAAKE,WAAW3P,KAAKqM,OAAQsC,UAlH3CvG,IAAA,YAAAlE,MAAA,SAqHfyK,GACT,IAAK,GAAIvG,KAAO8L,GAAWE,QAAS,CAClC,GAAIW,GAAOb,EAAWE,QAAQhM,EACL,OAArB2M,EAAK/U,KAAKqM,UACZ0I,EAAK/U,KAAKqM,YAEZ0I,EAAK/U,KAAKqM,QAAQ9L,KAAKkP,KAAKC,MAAMD,KAAKE,WAAW3P,KAAKqM,OAAQsC,UA3HzCvG,IAAA,iBAAAlE,MAAA,WA+HxB,MAAwC,OAAjCgQ,EAAWC,MAAMnU,KAAKqM,WA/HLjE,IAAA,YAAAlE,MAAA,WAsIxB,MAJIlE,MAAK8V,mBACP5B,EAAWK,QAAQvU,MACnBwT,EAAA9Q,OAAAsR,eAAAyB,EAAAjV,WAAA,YAAAR,MAAAnB,KAAAmB,OAEKiL,EAAEsK,MAAMrB,WAAWmB,cAtIFjN,IAAA,aAAAlE,MAAA,WA6IxB,MAJKlE,MAAK8V,mBACR5B,EAAWG,WAAWrU,KAAKqM,QAC3BmH,EAAA9Q,OAAAsR,eAAAyB,EAAAjV,WAAA,aAAAR,MAAAnB,KAAAmB,OAEKA,KAAKmL,EAAEG,GAAGgE,8BA7IOlH,IAAA,QAAAlE,MAAA,WAgJxB,GAAI3B,GAAOvC,IACX,OAAO+H,OAAAV,mBAAAM,KAAM,QAAA+F,KAAA,GACPqH,GAEExF,EACAM,CAJK,OAAAxI,oBAAAjF,KAAA,SAAAyL,GAAA,OAAA,OAAAA,EAAArF,KAAAqF,EAAAtI,MAAA,IAAA,GAEX,IADIwP,EAAOb,EAAWE,QAAQ7R,EAAK8J,QAC5B3J,OAAOwF,KAAK6M,GAAMjW,OAAS,GAC5ByQ,EAASyF,UAAUtS,OAAOwF,KAAK6M,IAC/BlF,EAAIkF,EAAKxF,GAAQ4F,QACO,IAAxBJ,EAAKxF,GAAQzQ,cACRiW,GAAKxF,GAEdvP,KAAKoV,eAAevF,EAAE,GAAIA,EAAE,GARnB,OAAAhC,GAAAtI,KAAA,EAULhD,EAAK+M,0BAVA,KAAA,GAAA,IAAA,MAAA,MAAAzB,GAAAlF,SAAA+E,EAAA1N,aAjJWyV,GA2FTxK,EAAEC,kBAqErBD,GAAEwK,KAAOA,QJ69CLM,GAAG,SAASzX,EAAQU,EAAOJ,GK/nDjC,YLqoDA,SAASsL,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAIC,WAAU,qCAFhH,GAAIC,GAAe,WAAc,QAASC,GAAiBC,EAAQC,GAAS,IAAK,GAAIlM,GAAI,EAAGA,EAAIkM,EAAM3L,OAAQP,IAAK,CAAE,GAAImM,GAAaD,EAAMlM,EAAImM,GAAWC,WAAaD,EAAWC,aAAc,EAAOD,EAAWE,cAAe,EAAU,SAAWF,KAAYA,EAAWG,UAAW,GAAMnI,OAAOoI,eAAeN,EAAQE,EAAWtC,IAAKsC,IAAiB,MAAO,UAAUN,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAYR,EAAiBH,EAAY5J,UAAWuK,GAAiBC,GAAaT,EAAiBH,EAAaY,GAAqBZ,KKjoDhiBpL,GAAOJ,QAAU,SAAUqM,GAAc,GAajC+K,GAbiC,WAoCrC,QAAAA,GAAa7K,EAAGC,GAuCd,QAAS6K,KACP,MAAO3F,GAAGhB,2BAA2BlL,KAAK,WACxC,MAAIkM,GAAG4F,IAAIpX,OAAS,GAAKwR,EAAG6F,IAAIrX,OAAS,GAClCwR,EAAGnF,EAAEiL,eACRtM,QAAQC,KAAK,yCAER,GAAI5F,SAAQ,SAACL,GAClBwM,EAAG7C,mBAAHpG,mBAAAM,KAAsB,QAAA+F,KAAA,GAETnP,GACH8X,CAHY,OAAAhP,oBAAAjF,KAAA,SAAAyL,GAAA,OAAA,OAAAA,EAAArF,KAAAqF,EAAAtI,MAAA,IAAA,GAAA,GACE,MAAlB+K,EAAGnF,EAAEqJ,YAAqBlE,EAAGnF,EAAEqJ,UAAU/I,SADzB,CAAAoC,EAAAtI,KAAA,EAAA,OAEThH,EAAI,CAFK,KAAA,GAAA,KAEFA,EAAI+R,EAAG6F,IAAIrX,QAFT,CAAA+O,EAAAtI,KAAA,CAAA,OAAA,MAGZ8Q,GAAM/F,EAAG6F,IAAI5X,GAHDsP,EAAAnE,cAIT1J,KAAKsW,wBAAwBD,GAJpB,KAAA,EAAA,KAAA,GAEiB9X,IAFjBsP,EAAAtI,KAAA,CAAA,MAAA,KAAA,GAMlB+K,EAAG6F,IAAM7F,EAAG4F,IACZ5F,EAAG4F,MAPe,KAAA,IAUhB5F,EAAGiG,UAAY,IACjBjG,EAAGkG,WAAa/W,WAAWwW,EAAgB3F,EAAGiG,YAEhDzS,GAboB,KAAA,IAAA,IAAA,MAAA,MAAA+J,GAAAlF,SAAA+E,EAAA1N,aAkBpBsQ,EAAGiG,UAAY,IACjBjG,EAAGkG,WAAa/W,WAAWwW,EAAgB3F,EAAGiG,YAEzCpS,QAAQL,aAnEDoG,EAAAlK,KAAAgW,GACpBhW,KAAKmL,EAAIA,CACT,IAAImF,GAAKtQ,IACTA,MAAKqM,OAAS,IACd,IAAIvI,EACJ9D,MAAKyW,cAAgB,GAAItS,SAAQ,SAAUlG,GACzC6F,EAAU7F,IAEZ+B,KAAKyW,cAAc3S,QAAUA,EAE7B9D,KAAKuL,0BAA2B,EAEhCvL,KAAK0W,iBAEL1W,KAAK2W,2BAEL3W,KAAK4W,6BAA8B,EAanC5W,KAAK6W,oBACL7W,KAAK8W,uBACL9W,KAAKqP,uBAAwB,EAC7BrP,KAAK+W,sBAAuB,EACY,mBAA7BC,4BACThX,KAAKiX,iBAEPjX,KAAKkW,OACLlW,KAAKmW,OACLnW,KAAKuW,UAAanL,EAAKmL,UAAoBnL,EAAK8L,WAAb,IAiCnClX,KAAKiW,eAAiBA,EAClBjW,KAAKuW,UAAY,GACnBN,IA7GiC,MAAA3L,GAAA0L,IAAA5N,IAAA,wBAAAlE,MAAA,SAgHdiT,GACjBnX,KAAKmL,EAAEiL,eACTpW,KAAKkW,IAAI3V,KAAK4W,MAlHmB/O,IAAA,wBAAAlE,MAAA,WAqHZ,GAAAsL,GAAAxP,IACvB,OAAO,IAAImE,SAAQ,SAAAL,GACjB,GAAIsT,GAAQ,QAARA,KACE5H,EAAK0G,IAAIpX,OAAS,GAAK0Q,EAAK2G,IAAIrX,OAAS,EAC3C0Q,EAAKyG,iBAAiB7R,KAAKgT,GAE3BtT,IAGJrE,YAAW2X,EAAO,QA9HehP,IAAA,aAAAlE,MAAA,WAkInC,GAAwC,mBAA7B8S,0BAA0C,CACnD,GAAIK,GAAwBhX,MAAMG,UAAUwO,IAAInQ,KAAKyB,UAAW,SAAUpC,GACxE,MAAiB,gBAANA,GACFA,EAEAuR,KAAKE,UAAUzR,KAEvBoZ,KAAK,IAAIC,QAAQ,KAAM,KAAKA,QAAQ,KAAM,MAAMA,QAAQ,KAAM,KACjEvX,MAAKiX,aAAa1W,KAAK8W,OA1IUjP,IAAA,eAAAlE,MAAA,WA8InC4F,QAAQ8E,IAAI5O,KAAKiX,aAAaK,KAAK,UA9IAlP,IAAA,uBAAAlE,MAAA,WAiJnC,GAAI3B,GAAOvC,IACX,OAAO,IAAImE,SAAQ,SAAUL,GAC3BvB,EAAKkL,mBAALpG,mBAAAM,KAAwB,QAAAwG,KAAA,GAClBqJ,GAGKjZ,EACH0Q,CALgB,OAAA5H,oBAAAjF,KAAA,SAAAqM,GAAA,OAAA,OAAAA,EAAAjG,KAAAiG,EAAAlJ,MAAA,IAAA,GAClBiS,EAA4BjV,EAAK2T,IAAI7W,OAAOkD,EAAK4T,KACrD5T,EAAK2T,OACL3T,EAAK4T,OACI5X,EAAI,CAJS,KAAA,GAAA,KAINA,EAAIiZ,EAAK1Y,QAJH,CAAA2P,EAAAlJ,KAAA,EAAA,OAAA,MAAAkJ,GAAA/E,cAKJ1J,KAAKyX,aAAaD,EAAKjZ,IALnB,KAAA,EAAA,KAAA,GAAA,GAKhB0Q,EALgBR,EAAAV,GAMV,MAANkB,EANgB,CAAAR,EAAAlJ,KAAA,EAAA,OAAA,aAOX0J,GAAGyI,GAPQjJ,EAAA/E,cAQX1J,KAAK2X,aAAa1I,GARP,KAAA,GAAA,KAAA,IAIW1Q,IAJXkQ,EAAAlJ,KAAA,CAAA,MAAA,KAAA,IAWtBzB,GAXsB,KAAA,IAAA,IAAA,MAAA,MAAA2K,GAAA9F,SAAAwF,EAAAnO,cAnJSoI,IAAA,wBAAAlE,MAAAmD,mBAAAM,KAAA,QAAAiQ,GA8KZ3I,EAAI4I,GA9KQ,GAmL7BH,EAnL6B,OAAArQ,oBAAAjF,KAAA,SAAA6N,GAAA,OAAA,OAAAA,EAAAzH,KAAAyH,EAAA1K,MAAA,IAAA,GAAA,GAgLxB,MAAT0J,EAAGyI,IACHzI,EAAG6I,WAAY,EAjLkB,CAAA7H,EAAA1K,KAAA,EAAA,OAAA,GAmL7BmS,GAAK,EACG,MAARG,GAAgBA,EAAKC,WAAY,EApLJ,CAAA7H,EAAA1K,KAAA,CAAA,OAqL/BmS,GAAK,EArL0BzH,EAAA1K,KAAA,EAAA,MAAA,KAAA,GAAA,KAsLR,MAAd0J,EAAG8I,SAAmB9I,EAAG8I,QAAQjZ,OAAS,GAtLpB,CAAAmR,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cAuLnB1J,KAAKgY,wBAAwB/I,EAAGkI,GAAG,GAAIlI,EAAGkI,GAAG,GAAK,IAvL/B,KAAA,EAAA,KAAA,GAuL/BlI,EAvL+BgB,EAAAlC,GAwL/B2J,GAAK,CAxL0B,KAAA,IAAA,IA0L7BA,EA1L6B,CAAAzH,EAAA1K,KAAA,EAAA,OAAA,MA2L/B0J,GAAGyI,IAAK,EA3LuBzH,EAAAvG,cA4LxB1J,KAAK2X,aAAa1I,GA5LM,KAAA,GAAA,KAAA,IAAA,MA6L/BjP,MAAK6Q,MAAMoH,sBAAsBhJ,EAAGkI,IA7LLlH,EAAArK,OAAA,UA8LxB,EA9LwB,KAAA,IAAA,MAAAqK,GAAArK,OAAA,UAiM5B,EAjM4B,KAAA,IAAA,IAAA,MAAA,MAAAqK,GAAAtH,SAAAiP,EAAA5X,UAAAoI,IAAA,6BAAAlE,MAAA,SAmMT+K,GAC1B,QAASxC,GAAQtO,GACf,OAAQ8M,EAAEsK,MAAM2C,WAAW/Z,EAAG8Q,EAAGkI,IAEnCnX,KAAKkW,IAAMlW,KAAKkW,IAAIzJ,OAAOA,GAC3BzM,KAAKmW,IAAMnW,KAAKmW,IAAI1J,OAAOA,SACpBwC,GAAGyI,MAzMyBtP,IAAA,UAAAlE,MAAAmD,mBAAAM,KAAA,QAAAwQ,KAAA,GA8M1B/P,GACHhF,CA/M6B,OAAAiE,oBAAAjF,KAAA,SAAA2O,GAAA,OAAA,OAAAA,EAAAvI,KAAAuI,EAAAxL,MAAA,IAAA,GA4MnC6S,cAAcpY,KAAKwW,YACnBxW,KAAKwW,WAAa,IAClB,KAASpO,IAAOpI,MAAK6W,iBACfzT,EAAOpD,KAAK6W,iBAAiBzO,GACZ,MAAjBhF,EAAKiV,SACPjV,EAAKiV,WAELvO,QAAQ8F,MAAM,6HAnNiB,KAAA,GAAA,IAAA,MAAA,MAAAmB,GAAApI,SAAAwP,EAAAnY,UAAAoI,IAAA,YAAAlE,MAAA,SAuN1BmI,GACT,IAAKrM,KAAKyW,cAAc6B,WAAY,CAClCtY,KAAKyW,cAAc6B,YAAa,CAChC,IAAI/V,GAAOvC,IACXuC,GAAKkL,mBAALpG,mBAAAM,KAAwB,QAAAmI,KAAA,GAElBnL,EAFkB,OAAA0C,oBAAAjF,KAAA,SAAAwO,GAAA,OAAA,OAAAA,EAAApI,KAAAoI,EAAArL,MAAA,IAAA,GAAA,MACtBhD,GAAK8J,OAASA,EADQuE,EAAAlH,cAEH1J,KAAKuY,SAASlM,GAFX,KAAA,EAAA,KAAA,GAElB1H,EAFkBiM,EAAA7C,GAGtBxL,EAAKiW,QAAU7T,EAAM8T,MACrBlW,EAAKkU,cAAc3S,QAAQuI,EAJL,KAAA,GAAA,IAAA,MAAA,MAAAuE,GAAAjI,SAAAmH,EAAA9P,SAO1B,MAAOA,MAAKyW,iBAlOuBrO,IAAA,gBAAAlE,MAAA,SAoOtB1F,GACbwB,KAAKyW,cAAcrS,KAAK5F,MArOW4J,IAAA,cAAAlE,MAAA,SAuOxBwU,GACX,GAAmB,MAAfA,EACF,KAAM,IAAIja,OAAM,2DACX,IAAmB,MAAfuB,KAAKqM,OACd,KAAM,IAAI5N,OAAM,sCAEhB,IAAI0Y,IAAMnX,KAAKqM,OAAQrM,KAAKwY,QAE5B,OADAxY,MAAKwY,SAAWE,EACTvB,KA/O0B/O,IAAA,QAAAlE,MAAA,SA0P9B2K,GACL,IAAK,GAAItQ,GAAI,EAAGA,EAAIsQ,EAAI/P,OAAQP,IAAK,CACnC,GAAIJ,GAAI0Q,EAAItQ,EACZ,IAAY,MAARJ,EAAEgZ,IAAchZ,EAAEgZ,GAAG,KAAOnX,KAAKmL,EAAEqJ,UAAUnI,OAAQ,CACvD,GAAIsM,GAAW1N,EAAEiE,OAAO/Q,EAAEgR,QAAQyJ,YAAYza,EAC5B,OAAdA,EAAE0a,WACJF,EAAWA,EAAStZ,OAAOlB,EAAE0a,WAE/B7Y,KAAK8Y,oBAAoBH,EAAUxa,QAlQJiK,IAAA,sBAAAlE,MAAA,SA0QhB6U,EAAK9J,GACxB,GAAI8J,EAAIja,OAAS,EAMf,IAAK,GALDka,IACF/J,GAAIA,EACJgK,QAASF,EAAIja,QAGNP,EAAI,EAAGA,EAAIwa,EAAIja,OAAQP,IAAK,CACnC,GAAI4Y,GAAK4B,EAAIxa,GACT2a,EAAMzJ,KAAKE,UAAUwH,GACrBxY,EAAIqB,KAAK0W,cAAcwC,EAClB,OAALva,IACFA,KACAqB,KAAK0W,cAAcwC,GAAOva,GAE5BA,EAAE4B,KAAKyY,OAGThZ,MAAK2W,wBAAwBpW,MAC3B0O,GAAIA,GAIR,KAAIjP,KAAK4W,4BAAT,CAIA5W,KAAK4W,6BAA8B,CACnC,IAAI/F,GAAQ7Q,IAEZA,MAAKyN,mBAALpG,mBAAAM,KAAwB,QAAAmJ,KAAA,GAClBqI,GAGAC,EAKKhR,EACHjK,EAIG+a,EACHva,EACAwY,EACAlI,EASOoK,EACHC,EACAC,CA5BY,OAAAlS,oBAAAjF,KAAA,SAAAoX,GAAA,OAAA,OAAAA,EAAAhR,KAAAgR,EAAAjU,MAAA,IAAA,GAClB4T,EAAStI,EAAM8F,wBACnB9F,EAAM8F,2BAEFyC,EAAKvI,EAAM6F,cACf7F,EAAM6F,iBAEN7F,EAAM+F,6BAA8B,EAE3BxO,EAAM,CATO,KAAA,GAAA,KASJA,EAAM+Q,EAAOra,QATT,CAAA0a,EAAAjU,KAAA,EAAA,OAAA,MAUhBpH,GAAIgb,EAAO/Q,GAAK6G,GAVAuK,EAAA9P,cAWbmH,EAAM4I,WAAW5a,KAAKmB,KAAM7B,GAXf,KAAA,EAAA,KAAA,GASiBiK,IATjBoR,EAAAjU,KAAA,CAAA,MAAA,KAAA,IAAAiU,EAAAvL,GAAA5G,mBAAAa,KAcNkR,EAdM,KAAA,IAAA,IAAAI,EAAArJ,GAAAqJ,EAAAvL,MAAA7I,KAAA,CAAAoU,EAAAjU,KAAA,EAAA,OAAA,GAcb2T,EAdaM,EAAArJ,GAAAjM,MAehBvF,EAAIya,EAAGF,GACP/B,EAAK1H,KAAKC,MAAMwJ,GAEC,gBAAV/B,GAAG,GAlBM,CAAAqC,EAAAjU,KAAA,EAAA,OAAA,MAAAiU,GAAA9P,cAmBN1J,KAAKyX,aAAaN,GAnBZ,KAAA,GAAA,KAAA,IAmBlBlI,EAnBkBuK,EAAAnJ,GAAAmJ,EAAAjU,KAAA,EAAA,MAAA,KAAA,IAAA,MAAAiU,GAAA9P,cAqBN1J,KAAK0Z,aAAavC,GArBZ,KAAA,GAAA,KAAA,IAqBlBlI,EArBkBuK,EAAAG,EAAA,KAAA,IAAA,GAuBV,MAAN1K,EAvBgB,CAAAuK,EAAAjU,KAAA,EAAA,OAwBlBsL,EAAM6F,cAAcwC,GAAOva,EAxBT6a,EAAAjU,KAAA,EAAA,MAAA,KAAA,IA0BT8T,EAAI,CA1BK,KAAA,IAAA,KA0BFA,EAAI1a,EAAEG,QA1BJ,CAAA0a,EAAAjU,KAAA,EAAA,OAAA,GA2BZ+T,EAAW3a,EAAE0a,GACbE,EAAID,EAASrK,GACU,MAArBqK,EAASL,QA7BC,CAAAO,EAAAjU,KAAA,EAAA,OAAA,MAAAiU,GAAA9P,cA8BPmH,EAAM4I,WAAW5a,KAAKmB,KAAMuZ,GA9BrB,KAAA,GAAA,KAAA,IA0BYF,IA1BZG,EAAAjU,KAAA,EAAA,MAAA,KAAA,IAAAiU,EAAAjU,KAAA,EAAA,MAAA,KAAA,IAAA,IAAA,MAAA,MAAAiU,GAAA7Q,SAAAmI,EAAA9Q,aAxSWoI,IAAA,aAAAlE,MAAAmD,mBAAAM,KAAA,QAAA8R,GAuVvBxK,GAvVuB,GA+V7B2K,GAIIC,EAWFC,CA9W2B,OAAAzS,oBAAAjF,KAAA,SAAA2X,GAAA,OAAA,OAAAA,EAAAvR,KAAAuR,EAAAxU,MAAA,IAAA,GAAA,GAwVnCvF,KAAK6Q,MAAMmJ,WAAW,2CAA4CvK,KAAKE,UAAUV,GAAK,KACpE,WAAdA,EAAGE,OAzV4B,CAAA4K,EAAAxU,KAAA,CAAA,OAAA,MAAAwU,GAAArQ,cA0V1BuB,EAAEiE,OAAO+K,OAAOC,QAAQrb,KAAKmB,KAAMiP,GA1VT,KAAA,EAAA,KAAA,GAAA8K,EAAAxU,KAAA,EAAA,MAAA,KAAA,GAAA,MAAAwU,GAAArQ,cA+VZ1J,KAAK0Z,aAAazK,EAAGkI,IA/VT,KAAA,EAAA,KAAA,GA+V7ByC,EA/V6BG,EAAA9L,EAAA,KAAA,GAAA,GAgWf,MAAX2L,GAAsC,MAAnBA,EAAQ7B,QAhWD,CAAAgC,EAAAxU,KAAA,EAAA,OAAA,KAkW3BqU,EAAQzC,GAAG,GAAKyC,EAAQ7B,QAAQjZ,OAASmQ,EAAGkI,GAAG,GAAKlI,EAAG8I,QAAQjZ,QAlWpC,CAAAib,EAAAxU,KAAA,EAAA,OAAA,MAmWzBsU,GAAcD,EAAQ7B,QAAQjZ,QAAUmQ,EAAGkI,GAAG,GAAKyC,EAAQzC,GAAG,IAClElI,EAAG8I,QAAQoC,OAAO,EAAGN,GACrB5K,EAAGkI,IAAMlI,EAAGkI,GAAG,GAAIlI,EAAGkI,GAAG,GAAK0C,GAC9B5K,EAAG4I,KAAO5M,EAAEsK,MAAM6E,UAAUR,GAC5B3K,EAAGoL,OAASpL,EAAG4I,KAvWckC,EAAArQ,cAwWZ1J,KAAKyX,aAAaxI,EAAGkI,IAxWT,KAAA,GAAA,KAAA,IAwW7ByC,EAxW6BG,EAAA5J,GAAA4J,EAAAxU,KAAA,EAAA,MAAA,KAAA,IAAA,MAAAwU,GAAAnU,OAAA,QAAA,GAAA,KAAA,IAAAmU,EAAAxU,KAAA,CAAA,MAAA,KAAA,IAAA,GA6WlB,MAAXqU,EA7W6B,CAAAG,EAAAxU,KAAA,EAAA,OAAA,MAAAwU,GAAArQ,cA8WC1J,KAAK8Z,mBAAmB7K,EAAGkI,IA9W5B,KAAA,GAAA,KAAA,IAAA,GA8W3B2C,EA9W2BC,EAAA1J,GAAA,CAAA0J,EAAAxU,KAAA,EAAA,OAAA,MAAAwU,GAAArQ,cAgXtBuB,EAAEiE,OAAOD,EAAGE,QAAQ+K,QAAQrb,KAAKmB,KAAMiP,GAhXjB,KAAA,GAAA,KAAA,IAAA,MAAA8K,GAAArQ,cAiXtB1J,KAAKsa,aAAarL,GAjXI,KAAA,GAAA,KAAA,IAAA,MAAA8K,GAAArQ,cAkXtB1J,KAAK6Q,MAAM0J,eAAeva,KAAMiP,GAlXV,KAAA,GAAA,KAAA,IAAA,MAAA8K,GAAArQ,cAqXtB1J,KAAKwa,mBAAmBvL,GArXF,KAAA,GAAA,KAAA,IAAA,IAAA,MAAA,MAAA8K,GAAApR,SAAA8Q,EAAAzZ,UAAAoI,IAAA,iBAAAlE,MAAAmD,mBAAAM,KAAA,QAAA4S,GAsYnBE,EAAaxL,GAtYM,GAwY7BzE,GACApH,EAOAsX,EACKnc,EAEH2a,EACAva,EAGOyJ,EACH4Q,EAONjb,EAIE4c,EASAxc,EAKAuB,EACAkb,EACKC,EACH1D,EACA2D,EAEEC,CAvbuB,OAAA1T,oBAAAjF,KAAA,SAAA4Y,GAAA,OAAA,OAAAA,EAAAxS,KAAAwS,EAAAzV,MAAA,IAAA,GAAA,GAuYjB,WAAd0J,EAAGE,OAvY4B,CAAA6L,EAAAzV,KAAA,CAAA,OAAA,MAAAyV,GAAAtR,cAwYb+Q,EAAYf,aAAazK,EAAGzE,QAxYf,KAAA,EAAA,KAAA,GAAA,GAwY7BA,EAxY6BwQ,EAAAjN,GAyY7B3K,EAAOpD,KAAK6W,iBAAiBpH,KAAKE,UAAUnF,EAAOuJ,SAC3C,MAAR3Q,EA1Y6B,CAAA4X,EAAAzV,KAAA,CAAA,OAAA,MAAAyV,GAAAtR,cA2YxBtG,EAAK6X,SAASR,EAAaxL,GA3YH,KAAA,EAAA,KAAA,GAAA+L,EAAAzV,KAAA,EAAA,MAAA,KAAA,GAAA,MAAAyV,GAAAtR,cA+Y1B+Q,EAAYS,YAAYjM,EAAGkI,GAAG,IA/YJ,KAAA,EAAA,KAAA,GAiZjC,IADIuD,EAAsB,MAAdzL,EAAG8I,QAAkB9I,EAAG8I,QAAQjZ,OAAS,EAC5CP,EAAI,EAAOmc,EAAJnc,EAAWA,IAKzB,GAHI2a,EAAMzJ,KAAKE,WAAWV,EAAGkI,GAAG,GAAIlI,EAAGkI,GAAG,GAAK5Y,IAC3CI,EAAIqB,KAAK0W,cAAcwC,SACpBlZ,MAAK0W,cAAcwC,GACjB,MAALva,EACF,IAASyJ,IAAOzJ,GACVqa,EAAWra,EAAEyJ,GACU,MAArB4Q,EAASC,SACbjZ,KAAK8Y,uBAAwBE,EAAS/J,GA1Zb,IA+Z7BlR,EAAIiC,KAAK6W,iBAAiBpH,KAAKE,UAAUV,EAAG8E,SAG/B,MAAb9E,EAAG8E,OAla0B,CAAAiH,EAAAzV,KAAA,EAAA,OAAA,MAAAyV,GAAAtR,cAmaF+Q,EAAYU,UAAUlM,EAAG8E,QAnavB,KAAA,GAAA,KAAA,IAAA,GAma3B4G,EAna2BK,EAAA3K,IAoa3BsK,EApa2B,CAAAK,EAAAzV,KAAA,EAAA,OAAA,MAAAyV,GAAAtR,cAqatB+Q,EAAYW,WAAWnM,EAAGkI,IAraJ,KAAA,GAAA,KAAA,IAAA,MAAA6D,GAAApV,OAAA,SAAA,KAAA,IAAA,GA2axB,MAAL7H,EA3a6B,CAAAid,EAAAzV,KAAA,EAAA,OAAA,MA4a3BpH,GAAI8M,EAAEsK,MAAM8F,cAAcpM,GA5aC+L,EAAAtR,cA6axB3L,EAAEkd,SAASR,EAAatc,GA7aA,KAAA,GAAA,KAAA,IAAA,GA+a5B8Q,EAAG6I,QA/ayB,CAAAkD,EAAAzV,KAAA,EAAA,OAib3B7F,EAAoB,MAAduP,EAAG8I,QAAkB9I,EAAG8I,QAAQjZ,OAAS,EAC/C8b,EAAU3L,EAAGkI,GACR0D,EAAI,CAnbkB,KAAA,IAAA,KAmbXnb,EAAJmb,GAnbe,CAAAG,EAAAzV,KAAA,EAAA,OAAA,MAobzB4R,IAAMyD,EAAQ,GAAIA,EAAQ,GAAKC,GApbNG,EAAAtR,cAqbJ+Q,EAAYU,UAAUhE,GArblB,KAAA,GAAA,KAAA,IAAA,GAqbzB2D,EArbyBE,EAAAM,IAsbzBR,EAtbyB,CAAAE,EAAAzV,KAAA,EAAA,OAAA,MAubvBwV,IACF5L,OAAQ,SACR3E,OAAQ2M,GAzbiB6D,EAAAtR,cA2bpB1J,KAAKyZ,WAAW5a,KAAK4b,EAAaM,GA3bd,KAAA,GAAA,KAAA,IAmbNF,IAnbMG,EAAAzV,KAAA,EAAA,MAAA,KAAA,IAAA,IAAA,MAAA,MAAAyV,GAAArS,SAAA4R,EAAAva,UAAAoI,IAAA,2BAAAlE,MAAA,WAkcnC,GAAIlE,KAAKqP,sBAAuB,CAC9B,GAAiC,MAA7BrP,KAAKub,qBAA8B,CACrC,GAAIzX,GACA4M,EAAU,GAAIvM,SAAQ,SAAUlG,GAClC6F,EAAU7F,GAMZ,OAJA+B,MAAKub,sBACHzX,QAASA,EACT4M,QAASA,GAEJA,EAEP,MAAO1Q,MAAKub,qBAAqB7K,QAGnC,MAAOvM,SAAQL,aAjdkBsE,IAAA,iBAAAlE,MAAA,WAudnC,MAAwC,KAApClE,KAAK8W,oBAAoBhY,OACvBkB,KAAK+W,sBACP/W,KAAKqP,uBAAwB,EAC7BrP,KAAK+W,sBAAuB,EACK,MAA7B/W,KAAKub,uBACPvb,KAAKub,qBAAqBzX,UAC1B9D,KAAKub,qBAAuB,MAEvB,OAEPvb,KAAK+W,sBAAuB,EAC5B1P,mBAAAM,KAAO,QAAAgJ,KAAA,MAAAtJ,oBAAAjF,KAAA,SAAAoZ,GAAA,OAAA,OAAAA,EAAAhT,KAAAgT,EAAAjW,MAAA,IAAA,GAAA,MAAAiW,GAAA9R,cACE1J,KAAKyb,QADP,KAAA,EAAA,KAAA,GAAA,IAAA,MAAA,MAAAD,GAAA7S,SAAAgI,EAAA3Q,UAKTA,KAAK+W,sBAAuB,EACrB/W,KAAK8W,oBAAoB3B,YAxeC/M,IAAA,qBAAAlE,MAAA,SA2ejBwX,EAAmBC,GAAiB,GAAAC,GAAA5b,IACtDA,MAAK8W,oBAAoBvW,KAAKmb,GACzB1b,KAAKqP,wBACRrP,KAAKqP,uBAAwB,EAC7B5P,WAAW,WACTmc,EAAKC,SAASD,EAAKE,mBAClB,QAjf8B9F,IAqfvC/K,GAAE+K,iBAAmBA,QL6gEjB+F,GAAG,SAASzd,EAAQU,EAAOJ,GMpgFjC,YAoBAI,GAAOJ,QAAU,SAAUqM,GACzB,GAAIiE,IAQF+K,QACE7K,OAAQ,SAAUH,GAChB,MAAOA,IAET2J,YAAa,SAAU3J,GACrB,UAEFiL,QAAA7S,mBAAAM,KAAS,QAAAuS,GAAYjL,GAAZ,MAAA5H,oBAAAjF,KAAA,SAAAyL,GAAA,OAAA,OAAAA,EAAArF,KAAAqF,EAAAtI,MAAA,IAAA,GAAA,MAAAsI,GAAAnE,cACO1J,KAAKgc,gBAAgB/M,EAAGzE,OAAQyE,EAAGnQ,QAAU,GADpD,KAAA,EAAA,KAAA,GAAA,MAAA+O,GAAAjI,OAAA,SAAAiI,EAAAE,GAAA,KAAA,GAAA,IAAA,MAAA,MAAAF,GAAAlF,SAAAuR,EAAAla,SAIXic,QAYE7M,OAAQ,SAAUH,GAGhB,GAAInR,IACFqZ,GAAIlI,EAAGkI,GACPU,KAAM5I,EAAG4I,KACTqE,MAAOjN,EAAGiN,MACV7B,OAAQpL,EAAGoL,OACXtG,OAAQ9E,EAAG8E,OACX5E,OAAQF,EAAGE,OAWb,OAToB,OAAhBF,EAAGkN,YACLre,EAAEqe,UAAYlN,EAAGkN,WAEflN,EAAGlI,eAAe,aACpBjJ,EAAEse,UAAYnN,EAAGmN,UAEjBte,EAAEia,QAAU9I,EAAG8I,QAAQrP,QAGlB5K,GAET8a,YAAa,SAAU3J,GACrB,GAAI8J,KAgBJ,OAfe,OAAX9J,EAAG4I,MACLkB,EAAIxY,KAAK0O,EAAG4I,MAEE,MAAZ5I,EAAGiN,OACLnD,EAAIxY,KAAK0O,EAAGiN;AAEG,MAAbjN,EAAGoL,QAAmBpP,EAAEsK,MAAM2C,WAAWjJ,EAAG4I,KAAM5I,EAAGoL,SACvDtB,EAAIxY,KAAK0O,EAAGoL,QAGdtB,EAAIxY,KAAK0O,EAAG8E,QAEQ,MAAhB9E,EAAGmN,WACLrD,EAAIxY,KAAK0O,EAAGmN,WAEPrD,GAETsD,oBAAAhV,mBAAAM,KAAqB,QAAA0U,GAAYpN,GAAZ,GAIbqN,GACAne,CALa,OAAAkJ,oBAAAjF,KAAA,SAAAqM,GAAA,OAAA,OAAAA,EAAAjG,KAAAiG,EAAAlJ,MAAA,IAAA,GAAA,GACJ,MAAX0J,EAAG4I,KADY,CAAApJ,EAAAlJ,KAAA,CAAA,OAAA,MAAAkJ,GAAA7I,OAAA,SAEV,EAFU,KAAA,GAAA,MAIb0W,GAAI,EAJS7N,EAAA/E,cAKF1J,KAAK0Z,aAAazK,EAAG4I,MALnB,KAAA,EAAA,KAAA,GAKb1Z,EALasQ,EAAAV,EAAA,KAAA,GAAA,GAMT9C,EAAEsK,MAAMgH,UAAUpe,EAAG8Q,EAAGoL,QANf,CAAA5L,EAAAlJ,KAAA,EAAA,OAAA,GAOf+W,IACc,MAAVne,EAAE0Z,KARS,CAAApJ,EAAAlJ,KAAA,EAAA,OAAA,MAAAkJ,GAAA7I,OAAA,QAAA,GAAA,KAAA,IAAA,MAAA6I,GAAA/E,cAWF1J,KAAK0Z,aAAavb,EAAE0Z,MAXlB,KAAA,GAAA,KAAA,IAWb1Z,EAXasQ,EAAAR,EAAA,KAAA,IAAAQ,EAAAlJ,KAAA,CAAA,MAAA,KAAA,IAAA,MAAAkJ,GAAA7I,OAAA,SAcV0W,EAdU,KAAA,IAAA,IAAA,MAAA,MAAA7N,GAAA9F,SAAA0T,EAAArc,QAgCrBka,QAAA7S,mBAAAM,KAAS,QAAAuS,GAAYjL,GAAZ,GACH1Q,GAIAie,EAKEnC,EAUFoC,EAGAte,EACA4V,EACA2I,EAYE9B,EAcE+B,EA4BJ9E,EACAqE,EA6DK7C,EACHxJ,CA9IC,OAAAxI,oBAAAjF,KAAA,SAAA6N,GAAA,OAAA,OAAAA,EAAAzH,KAAAyH,EAAA1K,MAAA,IAAA,GAAA,GAKHiX,KAEa,MAAbvN,EAAGoL,OAPA,CAAApK,EAAA1K,KAAA,CAAA,OAAA,MAAA0K,GAAAvG,cAUe1J,KAAK4c,qBAAqB3N,EAAGoL,QAV5C,KAAA,EAAA,KAAA,GAAA,MAUDA,GAVCpK,EAAAlC,GAWkB,MAAnBsM,EAAOwC,WACTxC,EAAOwC,aAETxC,EAAOwC,SAAStc,KAAK0O,EAAGkI,IAdnBlH,EAAAvG,cAeE1J,KAAK2X,aAAa0C,GAfpB,KAAA,EAAA,KAAA,GAgBe,MAAhBA,EAAO6B,OACTM,EAAkBjc,KAAK8Z,EAAO6B,MAjB3B,KAAA,GAAA,MAAAjM,GAAAvG,cAoB2BwF,EAAO+M,OAAOI,oBAAoBxd,KAAKmB,KAAMiP,GApBxE,KAAA,EAAA,KAAA,GAAA,GAoBHwN,EAAmBle,EApBhB0R,EAAAE,GA4BQ,MAAXlB,EAAG4I,KA5BA,CAAA5H,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cA6BM1J,KAAK4c,qBAAqB3N,EAAG4I,MA7BnC,KAAA,GAAA,KAAA,IAAA,GA6BL1Z,EA7BK8R,EAAAI,GA8BApF,EAAEsK,MAAM2C,WAAWjJ,EAAG4I,KAAM5I,EAAGoL,SAAsB,MAAXlc,EAAE+d,OAE/CM,EAAkBjc,KAAKpC,EAAE+d,OAEX,MAAX/d,EAAE+d,MAlCF,CAAAjM,EAAA1K,KAAA,EAAA,OAAA0K,EAAA0J,GAkCmB,KAlCnB1J,EAAA1K,KAAA,EAAA,MAAA,KAAA,IAAA,MAAA0K,GAAAvG,cAkCiC1J,KAAKyX,aAAatZ,EAAE+d,OAlCrD,KAAA,GAAA,KAAA,IAAAjM,EAAA0J,GAAA1J,EAAA6M,EAAA,KAAA,IAkCL3e,EAlCK8R,EAAA0J,GAAA1J,EAAA1K,KAAA,EAAA,MAAA,KAAA,IAAA,MAAA0K,GAAAvG,cAoCW1J,KAAKyX,aAAaxI,EAAG8E,QApChC,KAAA,GAAA,KAAA,IAAA,GAoCLA,EApCK9D,EAAAqL,GAqCDV,EAAU3L,EAAGkN,UAAYpI,EAAO/E,IAAIC,EAAGkN,WAAapI,EAAO2I,MAC5C,MAAX9B,EAtCH,CAAA3K,EAAA1K,KAAA,EAAA,OAAA0K,EAAA8M,GAsCqB,KAtCrB9M,EAAA1K,KAAA,EAAA,MAAA,KAAA,IAAA,MAAA0K,GAAAvG,cAsCmC1J,KAAKyX,aAAamD,GAtCrD,KAAA,GAAA,KAAA,IAAA3K,EAAA8M,GAAA9M,EAAA+M,EAAA,KAAA,IAsCLN,EAtCKzM,EAAA8M,GAuCL5e,EAAIue,CAvCC,KAAA,IAAA,GA2CS,MAAZzN,EAAGiN,MA3CA,CAAAjM,EAAA1K,KAAA,EAAA,OAAA,MA4CLiX,GAAkBjc,KAAK0O,EAAGiN,OA5CrBjM,EAAAvG,cA6CE1J,KAAKgY,uBAAuB/I,EAAGiN,OA7CjC,KAAA,GAAA,KAAA,IAAA,GAkDI,MAAL/d,GAAc8M,EAAEsK,MAAM2C,WAAW/Z,EAAEgZ,GAAIlI,EAAGiN,OAlDzC,CAAAjM,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cAmD0BwF,EAAO+M,OAAOI,oBAAoBxd,KAAKmB,KAAM7B,GAnDvE,MAAA,GAAA,KAAA,IAAA,GAmDCwe,EAnDD1M,EAAAgN,IAoDCN,IAAoBpe,EApDrB,CAAA0R,EAAA1K,KAAA,EAAA,OAsDGpH,EAAEgZ,GAAG,GAAKlI,EAAGkI,GAAG,KAClBlI,EAAG4I,KAAO5M,EAAEsK,MAAM6E,UAAUjc,GAC5Bse,EAAmBle,EAAI,GAxDxB0R,EAAA1K,KAAA,EAAA,MAAA,KAAA,IAAA,KA0D0BhH,EAAlBoe,GA1DR,CAAA1M,EAAA1K,KAAA,EAAA,OA4D2BoX,GAAxBpe,EAAIke,IACNxN,EAAG4I,KAAO5M,EAAEsK,MAAM6E,UAAUjc,GAC5Bse,EAAmBle,EAAI,GA9DxB0R,EAAA1K,KAAA,EAAA,MAAA,KAAA,IAAA,MAAA0K,GAAArK,OAAA,QAAA,GAAA,KAAA,IAAA,GAmEHrH,IACe,MAAXJ,EAAE+d,MApEH,CAAAjM,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cAqEU1J,KAAK0Z,aAAavb,EAAE+d,OArE9B,MAAA,GAAA,KAAA,IAqED/d,EArEC8R,EAAAiN,IAAAjN,EAAA1K,KAAA,EAAA,MAAA,KAAA,IAuEDpH,EAAI,IAvEH,KAAA,IAAA8R,EAAA1K,KAAA,EAAA,MAAA,KAAA,IAAA,MAAA0K,GAAArK,OAAA,QAAA,GAAA,KAAA,IAAAqK,EAAA1K,KAAA,EAAA,MAAA,KAAA,IAAA,GA+EHsS,EAAO,KACPqE,EAAQ,KACE,MAAVnI,EAjFG,CAAA9D,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cAkFW1J,KAAKyX,aAAaxI,EAAG8E,QAlFhC,MAAA,GAAA,KAAA,IAkFLA,EAlFK9D,EAAAkN,GAAA,KAAA,IAAA,GAsFQ,MAAXlO,EAAG4I,KAtFA,CAAA5H,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cAuFS1J,KAAK0Z,aAAazK,EAAG4I,MAvF9B,MAAA,GAAA,KAAA,IAAA,MAuFLA,GAvFK5H,EAAAmN,IAyFLnO,EAAGiN,MAAQrE,EAAKqE,MAChBrE,EAAKqE,MAAQjN,EAAGkI,GA1FXlH,EAAAvG,cA4FE1J,KAAK2X,aAAaE,GA5FpB,MAAA,GAAA,KAAA,IAAA5H,EAAA1K,KAAA,EAAA,MAAA,KAAA,IA+FL0J,EAAGiN,MAAQjN,EAAGkN,UAAYpI,EAAO/E,IAAIC,EAAGkN,YAAc,KAAOpI,EAAO2I,KA/F/D,KAAA,IAAA,GAkGS,MAAZzN,EAAGiN,MAlGA,CAAAjM,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cAoGU1J,KAAKyX,aAAaxI,EAAGiN,OApG/B,MAAA,GAAA,KAAA,IAAA,GAoGLA,EApGKjM,EAAAoN,IAqGLnB,EAAMrE,KAAO5M,EAAEsK,MAAM6E,UAAUnL,GAGf,MAAZiN,EAAMxE,GAxGL,CAAAzH,EAAA1K,KAAA,EAAA,OAAA,KAyGkB,MAAjB2W,EAAMnE,SAAmBmE,EAAMnE,QAAQjZ,OAAS,GAzGjD,CAAAmR,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cA0Gc1J,KAAK4c,qBAAqBV,EAAM/E,IA1G9C,MAAA,GAAA,KAAA,IA0GD+E,EA1GCjM,EAAAqN,GAAA,KAAA,IA4GHtd,KAAK6Q,MAAM0M,2BAA2BrB,EA5GnC,KAAA,IAAA,MAAAjM,GAAAvG,cA8GE1J,KAAK2X,aAAauE,GA9GpB,MAAA,GAAA,KAAA,IAAA,GAkHa,MAAhBjN,EAAGkN,UAlHA,CAAAlM,EAAA1K,KAAA,EAAA,OAAA,GAmHO,MAARsS,EAnHC,CAAA5H,EAAA1K,KAAA,EAAA,OAAA,MAoHHwO,GAAO/E,IAAIC,EAAGkN,WAAalN,EAAGkI,GApH3BlH,EAAAvG,cAqHI1J,KAAK2X,aAAa5D,GArHtB,MAAA,GAAA,KAAA,IAAA,GA0HW,MAAZ9E,EAAGiN,MA1HF,CAAAjM,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cA2HI1J,KAAKgc,gBAAgB/M,EAAGiN,MAAO,GAAG,GA3HtC,MAAA,GAAA,KAAA,IAAA,GA6HU,MAAXjN,EAAG4I,KA7HF,CAAA5H,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cA8HI1J,KAAKgc,gBAAgB/M,EAAGkI,GAAI,GAAG,GA9HnC,MAAA,GAAA,KAAA,IAAAlH,EAAA1K,KAAA,GAAA,MAAA,KAAA,IAAA,GAiIQ,MAAT2W,GAAyB,MAARrE,EAjIhB,CAAA5H,EAAA1K,KAAA,GAAA,OAAA,MAkIU,OAAT2W,IACFnI,EAAOyJ,IAAMvS,EAAEsK,MAAM6E,UAAUnL,IAErB,MAAR4I,IACF9D,EAAO2I,MAAQzN,EAAGkI,IAtIjBlH,EAAAvG,cAwII1J,KAAK2X,aAAa5D,GAxItB,MAAA,IAAA,KAAA,KA6IEsF,EAAI,CA7IN,KAAA,KAAA,KA6ISA,EAAImD,EAAkB1d,QA7I/B,CAAAmR,EAAA1K,KAAA,GAAA,OAAA,MAAA0K,GAAAvG,cA8IU1J,KAAKyX,aAAa+E,EAAkBnD,IA9I9C,MAAA,IAAA,KAAA,KAAA,MA8IDxJ,GA9ICI,EAAAwN,IAAAxN,EAAAvG,cA+IE1J,KAAKwa,mBAAmB3K,GA/I1B,MAAA,IAAA,KAAA,KA6IuCwJ,IA7IvCpJ,EAAA1K,KAAA,GAAA,MAAA,KAAA,KAAA,IAAA,MAAA,MAAA0K,GAAAtH,SAAAuR,EAAAla,SAmJX0d,MAUE/a,OAAQ,SAAUwU,GAChB,OACEuF,MAAO,KACPc,IAAK,KACLrO,OAAQ,OACRgI,GAAIA,IAGR/H,OAAQ,SAAUH,GAChB,GAAInR,IACFqR,OAAQ,OACRgI,GAAIlI,EAAGkI,GACP/T,KAAM6L,EAAG7L,KAQX,OANmB,OAAf6L,EAAG4J,WACL/a,EAAE+a,SAAW5J,EAAG4J,UAEH,MAAX5J,EAAG9J,OACLrH,EAAEqH,KAAO8J,EAAG9J,MAEPrH,GAET8a,YAAa,WAWX,UAEFsB,QAAA7S,mBAAAM,KAAS,QAAAuS,GAAYjL,GAAZ,MAAA5H,oBAAAjF,KAAA,SAAA2O,GAAA,OAAA,OAAAA,EAAAvI,KAAAuI,EAAAxL,MAAA,IAAA,GACP0J,EAAGyN,MAAQ,KACXzN,EAAGuO,IAAM,IAFF,KAAA,GAAA,IAAA,MAAA,MAAAzM,GAAApI,SAAAuR,EAAAla,QAIT2d,IAAAtW,mBAAAM,KAAK,QAAAgW,GAAY1O,EAAI2O,GAAhB,GAICC,GACA1f,CALD,OAAAkJ,oBAAAjF,KAAA,SAAAwO,GAAA,OAAA,OAAAA,EAAApI,KAAAoI,EAAArL,MAAA,IAAA,GAAA,GACa,MAAZ0J,EAAGyN,MADJ,CAAA9L,EAAArL,KAAA,CAAA,OAAA,MAAAqL,GAAAhL,OAAA,SAEM,KAFN,KAAA,GAAA,MAICiY,GAAM,KAJPjN,EAAAlH,cAKY1J,KAAKyX,aAAaxI,EAAGyN,OALjC,KAAA,EAAA,KAAA,GAKCve,EALDyS,EAAA7C,EAAA,KAAA,GAAA,GAQI5P,EAAE2Z,UACL+F,EAAM1f,EACNyf,OAEEA,GAAO,GAAgB,MAAXzf,EAAE+d,OAZjB,CAAAtL,EAAArL,KAAA,EAAA,OAAA,MAAAqL,GAAAlH,cAaY1J,KAAKyX,aAAatZ,EAAE+d,OAbhC,KAAA,EAAA,KAAA,GAaC/d,EAbDyS,EAAA3C,GAAA2C,EAAArL,KAAA,EAAA,MAAA,KAAA,IAAA,MAAAqL,GAAAhL,OAAA,QAAA,GAAA,KAAA,IAAAgL,EAAArL,KAAA,CAAA,MAAA,KAAA,IAAA,MAAAqL,GAAAhL,OAAA,SAkBIiY,EAlBJ,KAAA,IAAA,IAAA,MAAA,MAAAjN,GAAAjI,SAAAgV,EAAA3d,QAoBLgP,IAAA3H,mBAAAM,KAAK,QAAAqH,GAAY7Q,EAAGK,GAAf,GAECqf,GAEEC,CAJH,OAAAzW,oBAAAjF,KAAA,SAAAoX,GAAA,OAAA,OAAAA,EAAAhR,KAAAgR,EAAAjU,MAAA,IAAA,GACHpH,EAAIA,EAAEue,MACFmB,IAFD,KAAA,GAAA,GAGS,MAAL1f,EAHJ,CAAAqb,EAAAjU,KAAA,CAAA,OAAA,MAAAiU,GAAA9P,cAIsB1J,KAAKyX,aAAatZ,GAJxC,KAAA,EAAA,KAAA,GAIG2f,EAJHtE,EAAAzL,GAKI+P,EAAUhG,SACb+F,EAAItd,KAAK/B,EAAEsf,IAEb3f,EAAI2f,EAAU5B,MARb1C,EAAAjU,KAAA,CAAA,MAAA,KAAA,GAAA,MAAAiU,GAAA5T,OAAA,SAUIiY,EAVJ,KAAA,IAAA,IAAA,MAAA,MAAArE,GAAA7Q,SAAAqG,EAAAhP,SAaP+d,KASEpb,OAAQ,SAAUwU,GAChB,OACEA,GAAIA,EACJnI,OACAG,OAAQ,QAGZC,OAAQ,SAAUH,GAChB,GAAInR,IACFqR,OAAQ,MACR/L,KAAM6L,EAAG7L,KACT+T,GAAIlI,EAAGkI,GACPnI,OAQF,OANmB,OAAfC,EAAG4J,WACL/a,EAAE+a,SAAW5J,EAAG4J,UAEH,MAAX5J,EAAG9J,OACLrH,EAAEqH,KAAO8J,EAAG9J,MAEPrH,GAET8a,YAAa,WACX,UAEFsB,QAAA7S,mBAAAM,KAAS,QAAAuS,KAAA,MAAA7S,oBAAAjF,KAAA,SAAA2X,GAAA,OAAA,OAAAA,EAAAvR,KAAAuR,EAAAxU,MAAA,IAAA,GAAA,IAAA,MAAA,MAAAwU,GAAApR,SAAAuR,EAAAla,QAITyT,IAAApM,mBAAAM,KAAK,QAAA8L,GAAYxE,EAAIzN,GAAhB,GACC6U,GAEEwH,CAHH,OAAAxW,oBAAAjF,KAAA,SAAA4Y,GAAA,OAAA,OAAAA,EAAAxS,KAAAwS,EAAAzV,MAAA,IAAA,GAAA,GACC8Q,EAAMpH,EAAGD,IAAIxN,GACN,MAAP6U,EAFD,CAAA2E,EAAAzV,KAAA,EAAA,OAAA,MAAAyV,GAAAtR,cAGgB1J,KAAKyX,aAAapB,GAHlC,KAAA,EAAA,KAAA,GAAA,GAGGwH,EAHH7C,EAAAjN,GAIU,MAAP8P,IAAeA,EAAI/F,QAJtB,CAAAkD,EAAAzV,KAAA,CAAA,OAAA,MAAAyV,GAAApV,OAAA,SAKQ,OALR,KAAA,GAAA,GAM2B,MAAjBiY,EAAIzB,UANd,CAAApB,EAAAzV,KAAA,EAAA,OAAA,MAAAyV,GAAApV,OAAA,SAOQiY,EAAI9F,QAAQ,GAPpB,KAAA,IAAA,MAAAiD,GAAAtR,cASe1J,KAAKge,QAAQH,EAAIzB,WAThC,KAAA,GAAA,KAAA,IAAA,MAAApB,GAAApV,OAAA,SAAAoV,EAAA/M,GAAA,KAAA,IAAA,IAAA,MAAA,MAAA+M,GAAArS,SAAA8K,EAAAzT,SAeTiL,GAAEiE,OAASA,QNo3FP+O,GAAG,SAAS3f,EAAQU,EAAOJ,GO3wGjC,YP21GA,SAASsL,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAIC,WAAU,qCAFhH,GAAIC,GAAe,WAAc,QAASC,GAAiBC,EAAQC,GAAS,IAAK,GAAIlM,GAAI,EAAGA,EAAIkM,EAAM3L,OAAQP,IAAK,CAAE,GAAImM,GAAaD,EAAMlM,EAAImM,GAAWC,WAAaD,EAAWC,aAAc,EAAOD,EAAWE,cAAe,EAAU,SAAWF,KAAYA,EAAWG,UAAW,GAAMnI,OAAOoI,eAAeN,EAAQE,EAAWtC,IAAKsC,IAAiB,MAAO,UAAUN,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAYR,EAAiBH,EAAY5J,UAAWuK,GAAiBC,GAAaT,EAAiBH,EAAaY,GAAqBZ,KO9wGhiBpL,GAAOJ,QAAU,SAAUqM,GAAa,GAChCiT,GADgC,WAAA,QAAAA,KAAAhU,EAAAlK,KAAAke,GAAA,MAAA5T,GAAA4T,IAAA9V,IAAA,UAAAlE,MAAAmD,mBAAAM,KAAA,QAAAqW,GAazB7G,EAAI/W,GAbqB,GAc9B8Y,GACAnb,EAEEkR,CAjB4B,OAAA5H,oBAAAjF,KAAA,SAAAyL,GAAA,OAAA,OAAAA,EAAArF,KAAAqF,EAAAtI,MAAA,IAAA,GAAA,GAc9B2T,EAAMzJ,KAAKE,UAAUwH,GACrBpZ,EAAIiC,KAAK6Q,MAAMgG,iBAAiBqC,GAC3B,MAALnb,EAhB8B,CAAA8P,EAAAtI,KAAA,CAAA,OAAA,MAAAsI,GAAAnE,cAiBa1J,KAAKyX,aAAaN,GAjB/B,KAAA,EAAA,KAAA,GAAA,GAiB5BlI,EAjB4BpB,EAAAE,GAkBtB,MAANkB,EAlB4B,CAAApB,EAAAtI,KAAA,CAAA,OAAA,MAAAsI,GAAAnE,cAmBnBuB,EAAEgE,EAAG7L,MAAM+a,eAAeC,SAASvf,KAAKmB,KAAMA,KAAK6Q,MAAO5B,EAAI7O,GAnB3C,KAAA,EAAA,KAAA,GAmB9BrC,EAnB8B8P,EAAAI,GAoB9BjO,KAAK6Q,MAAMgG,iBAAiBqC,GAAOnb,CApBL,KAAA,GAAA,MAAA8P,GAAAjI,OAAA,SAuB3B7H,EAvB2B,KAAA,IAAA,IAAA,MAAA,MAAA8P,GAAAlF,SAAAqV,EAAAhe,UAAAoI,IAAA,aAAAlE,MAAAmD,mBAAAM,KAAA,QAAA0W,GAyBtBC,EAAgBnH,GAzBM,GA0B9BoH,GAEAtP,CA5B8B,OAAA5H,oBAAAjF,KAAA,SAAAqM,GAAA,OAAA,OAAAA,EAAAjG,KAAAiG,EAAAlJ,MAAA,IAAA,GAAA,GA0B9BgZ,EAAaD,EAAe,GAAGnP,OACnCgI,EAAKA,GAAMnX,KAAK6Q,MAAM2N,YAAY,GAEpB,MAAVrH,EAAG,GA7B2B,CAAA1I,EAAAlJ,KAAA,CAAA,OAAA,MAAAkJ,GAAA/E,cA8BpB1J,KAAKyX,aAAaN,GA9BE,KAAA,EAAA,KAAA,GA8BhClI,EA9BgCR,EAAAV,GAAAU,EAAAlJ,KAAA,CAAA,MAAA,KAAA,GAgChC0J,EAAKhE,EAAEiE,OAAOqP,GAAY5b,OAAOwU,GACjClI,EAAG7L,KAAOkb,EAAe,GAAG9c,IAjCI,KAAA,GAAA,GAmCY,MAA1C8c,EAAe,GAAGG,qBAnCY,CAAAhQ,EAAAlJ,KAAA,EAAA,OAAA,MAAAkJ,GAAA/E,cAoCzB4U,EAAe,GAAGG,qBAAqB5f,KAAKmB,KAAMiP,EAAIqP,EAAe,IApC5C,KAAA,GAAA,KAAA,IAAA,GAsCpB,MAAVrP,EAAG,GAtC2B,CAAAR,EAAAlJ,KAAA,EAAA,OAAA,MAAAkJ,GAAA/E,cAuCzB1J,KAAK2X,aAAa1I,GAvCO,KAAA,GAAA,KAAA,IAAAR,EAAAlJ,KAAA,EAAA,MAAA,KAAA,IAAA,MAAAkJ,GAAA/E,cAyCzB1J,KAAK0e,wBAAwBzP,IAzCJ,KAAA,GAAA,KAAA,IAAA,MAAAR,GAAA/E,cA2CpB1J,KAAKge,QAAQ7G,EAAImH,EAAe,IA3CZ,KAAA,GAAA,KAAA,IAAA,MAAA7P,GAAA7I,OAAA,SAAA6I,EAAAkL,GAAA,KAAA,IAAA,IAAA,MAAA,MAAAlL,GAAA9F,SAAA0V,EAAAre,UAAAoI,IAAA,yBAAAlE,MAAAmD,mBAAAM,KAAA,QAAA+W,GAgEV7P,GAhEU,GAiE9BX,GACK3P,EACH0Q,CAnE4B,OAAA5H,oBAAAjF,KAAA,SAAA6N,GAAA,OAAA,OAAAA,EAAAzH,KAAAyH,EAAA1K,MAAA,IAAA,GAiE9B2I,KACK3P,EAAI,CAlEqB,KAAA,GAAA,KAkElBA,EAAIsQ,EAAI/P,QAlEU,CAAAmR,EAAA1K,KAAA,CAAA,OAAA,MAmE5B0J,GAAKJ,EAAItQ,GAnEmB0R,EAAAvG,cAoEzB1J,KAAK6Q,MAAM4I,WAAW5a,KAAKmB,KAAMiP,GApER,KAAA,EAAA,KAAA,IAqEnB,MAATA,EAAGkI,IAAkC,gBAAblI,GAAGkI,GAAG,KAChCjJ,EAAK3N,KAAK0K,EAAEiE,OAAOD,EAAGE,QAAQC,OAAOH,GAtEP,KAAA,GAkEF1Q,IAlEE0R,EAAA1K,KAAA,CAAA,MAAA,KAAA,IAyE7BvF,KAAK6Q,MAAM1F,EAAEqJ,UAAUsB,kBAAoB5H,EAAKpP,OAAS,GAE5DkB,KAAK6Q,MAAM1F,EAAEqJ,UAAUxD,aAAa9C,EA3EJ,KAAA,IAAA,IAAA,MAAA,MAAA+B,GAAAtH,SAAA+V,EAAA1e,UAAAoI,IAAA,aAAAlE,MAAAmD,mBAAAM,KAAA,QAAAyT,GA+EtBsB,GA/EsB,GAsF1BiC,EAtF0B,OAAAtX,oBAAAjF,KAAA,SAAA2O,GAAA,OAAA,OAAAA,EAAAvI,KAAAuI,EAAAxL,MAAA,IAAA,GAAA,GAgFlB,MAATmX,EAhF2B,CAAA3L,EAAAxL,KAAA,EAAA,OAAA,MAAAwL,GAAArH,cAiFjB1J,KAAKyX,aAAaiF,GAjFD,KAAA,EAAA,KAAA,GAAA,GAiFhCA,EAjFgC3L,EAAAhD,GAkF3B2O,EAAMhF,GAlFqB,CAAA3G,EAAAxL,KAAA,EAAA,OAAA,MAmF9BmX,GAAMhF,IAAK,EACXgF,EAAM5E,SAAU,EApFc/G,EAAArH,cAqFvB1J,KAAK2X,aAAa+E,GArFK,KAAA,EAAA,KAAA,GAAA,MAsF1BiC,GAA6B,MAAjBjC,EAAM3E,QAAkB2E,EAAM3E,QAAQjZ,OAAS,EAtFjCiS,EAAArH,cAuFvB1J,KAAK4e,YAAYlC,EAAMvF,GAAIwH,GAvFJ,KAAA,EAAA,KAAA,GAAA,GAwFP,MAAnBjC,EAAMN,UAxFoB,CAAArL,EAAAxL,KAAA,EAAA,OAAA,MAAAwL,GAAArH,cAyFrB1J,KAAKgc,gBAAgBU,EAAMN,WAzFN,KAAA,GAAA,KAAA,IA2F9Bpc,KAAK6Q,MAAMoH,sBAAsByE,EAAMvF,GA3FT,KAAA,IA6FhCuF,EAAQA,EAAMR,MA7FkBnL,EAAAxL,KAAA,CAAA,MAAA,KAAA,IAAA,IAAA,MAAA,MAAAwL,GAAApI,SAAAyS,EAAApb,UAAAoI,IAAA,kBAAAlE,MAAAmD,mBAAAM,KAAA,QAAAqU,GAoGjB6C,EAAU/f,EAAQggB,GApGD,GA0G5BC,GACAvU,EACAwU,EAkCWxd,EAWAjD,EAKTsZ,EAeAqE,CA7K0B,OAAA7U,oBAAAjF,KAAA,SAAAwO,GAAA,OAAA,OAAAA,EAAApI,KAAAoI,EAAArL,MAAA,IAAA,GAAA,MAqGpB,OAAVzG,IACFA,EAAS,GAtGuB8R,EAAAlH,cAwG3B1J,KAAK4e,YAAYC,EAAU/f,GAxGA,KAAA,EAAA,KAAA,GAAA,KAyG3BA,EAAS,GAzGkB,CAAA8R,EAAArL,KAAA,EAAA,OAAA,MA0G5BwZ,IAAW,EA1GiBnO,EAAAlH,cA2GZ1J,KAAKsQ,GAAG2O,oBAAoBJ,EAAS,GAAIA,EAAS,GAAK/f,EAAS,IA3GpD,KAAA,EAAA,KAAA,GAAA,GA2G5B0L,EA3G4BoG,EAAA3C,GA4G5B+Q,EAAyB,MAAVxU,GAAoC,MAAlBA,EAAOuN,QAAkBvN,EAAOuN,QAAQjZ,OAAS,IACxE,MAAV0L,GAAkBA,EAAO2M,GAAG,KAAO0H,EAAS,IAAMrU,EAAO2M,GAAG,GAAK6H,GAAgBH,EAAS,IA7G9D,CAAAjO,EAAArL,KAAA,EAAA,OA+G9BiF,EAAS,KACT1L,EAAS,EAhHqB8R,EAAArL,KAAA,EAAA,MAAA,KAAA,IAAA,GAmHzBiF,EAAOsN,QAnHkB,CAAAlH,EAAArL,KAAA,EAAA,OAAA,KAoHxBiF,EAAO2M,GAAG,GAAK0H,EAAS,IApHA,CAAAjO,EAAArL,KAAA,EAAA,OAAA,MAAAqL,GAAAlH,cAsHV1J,KAAKgY,uBAAuB6G,GAtHlB,KAAA,GAAA,KAAA,IAsH1BrU,EAtH0BoG,EAAAT,GAuH1B6O,EAAexU,EAAOuN,QAAQjZ,MAvHJ,KAAA,IAAA,KAyHxB0L,EAAO2M,GAAG,GAAK6H,EAAeH,EAAS,GAAK/f,GAzHpB,CAAA8R,EAAArL,KAAA,EAAA,OAAA,MAAAqL,GAAAlH,cA2HV1J,KAAK4c,sBAAsBiC,EAAS,GAAIA,EAAS,GAAK/f,EAAS,IA3HrD,KAAA,GAAA,KAAA,IA2H1B0L,EA3H0BoG,EAAAP,GA4H1B2O,EAAexU,EAAOuN,QAAQjZ,MA5HJ,KAAA,IA+H9BA,EAAS0L,EAAO2M,GAAG,GAAK0H,EAAS,EA/HH,KAAA,IAAA,GAkIlB,MAAVrU,EAlI4B,CAAAoG,EAAArL,KAAA,EAAA,OAAA,GAmIzBiF,EAAOsN,QAnIkB,CAAAlH,EAAArL,KAAA,EAAA,OAAA,GAoI5BwZ,GAAW,EAEXvU,EAAOsN,SAAU,EAEG,MAAhBtN,EAAOkS,MAxIiB,CAAA9L,EAAArL,KAAA,EAAA,OAAA,MAAAqL,GAAAlH,cA0InB1J,KAAKob,WAAW5Q,EAAOkS,OA1IJ,KAAA,GAAA,KAAA,IAAA,GA6IV,MAAdlS,EAAOwE,IA7IiB,CAAA4B,EAAArL,KAAA,EAAA,OAAAqL,EAAAkM,GAAAzV,mBAAAa,KA8ITsC,EAAOwE,IA9IE,KAAA,IAAA,IAAA4B,EAAA0K,GAAA1K,EAAAkM,MAAA1X,KAAA,CAAAwL,EAAArL,KAAA,EAAA,OAAA,MA8IjB/D,GA9IiBoP,EAAA0K,GAAApX,MAAA0M,EAAAlH,cA+IjB1J,KAAKob,WAAW5Q,EAAOwE,IAAIxN,IA/IV,KAAA,GAAA,KAAA,IAAAoP,EAAArL,KAAA,EAAA,MAAA,KAAA,IAAA,GAoJJ,MAApBiF,EAAO4R,UApJiB,CAAAxL,EAAArL,KAAA,EAAA,OAAA,MAAAqL,GAAAlH,cAqJnB1J,KAAKgc,gBAAgBxR,EAAO4R,WArJT,KAAA,GAAA,KAAA,IAAA,GAwJL,MAAnB5R,EAAOqO,SAxJiB,CAAAjI,EAAArL,KAAA,EAAA,OAyJjBhH,EAAI,CAzJa,KAAA,IAAA,KAyJVA,EAAIiM,EAAOqO,SAAS/Z,QAzJV,CAAA8R,EAAArL,KAAA,EAAA,OAAA,MAAAqL,GAAAlH,cA0JjB1J,KAAKgc,gBAAgBxR,EAAOqO,SAASta,IA1JpB,KAAA,GAAA,KAAA,IAyJkBA,IAzJlBqS,EAAArL,KAAA,EAAA,MAAA,KAAA,IAAA,GA+JX,MAAfiF,EAAOqN,KA/JmB,CAAAjH,EAAArL,KAAA,EAAA,OAAA,MAAAqL,GAAAlH,cAgKd1J,KAAK0Z,aAAalP,EAAOqN,MAhKX,MAAA,GAAA,KAAA,IAgK5BA,EAhK4BjH,EAAAqM,IAAArM,EAAArL,KAAA,EAAA,MAAA,KAAA,IAkK5BsS,EAAO,IAlKqB,KAAA,IAAA,MAAAjH,GAAAlH,cAsKvB1J,KAAK2X,aAAanN,GAtKK,MAAA,GAAA,KAAA,IAAA,GA8KV,MAAhBA,EAAO0R,MA9KmB,CAAAtL,EAAArL,KAAA,EAAA,OAAA,MAAAqL,GAAAlH,cA+Kb1J,KAAKyX,aAAajN,EAAO0R,OA/KZ,MAAA,GAAA,KAAA,IA+K5BA,EA/K4BtL,EAAAuM,IAAAvM,EAAArL,KAAA,EAAA,MAAA,KAAA,IAiL5B2W,EAAQ,IAjLoB,KAAA,IAAA,IAmL1B6C,GAAaD,EAnLa,CAAAlO,EAAArL,KAAA,EAAA,OAAA,MAAAqL,GAAAlH,cAoLrB1J,KAAK6Q,MAAM0J,eAAeva,MAC/BmP,OAAQ,SACR3E,OAAQA,EAAO2M,GACfrY,OAAQkgB,IAvLkB,MAAA,GAAA,KAAA,IAAA,MAAApO,GAAAlH,cA2LvB1J,KAAK6Q,MAAM+G,sBAAsB/Y,KAAKmB,KAAMwK,EAAQqN,GA3L7B,MAAA,GAAA,KAAA,IAAA,GA4LjB,MAATqE,EA5L0B,CAAAtL,EAAArL,KAAA,EAAA,OAAA,MAAAqL,GAAAlH,cA6LrB1J,KAAK6Q,MAAM+G,sBAAsB/Y,KAAKmB,KAAMkc,EAAO1R,GA7L9B,MAAA,GAAA,KAAA,IAAAoG,EAAArL,KAAA,CAAA,MAAA,KAAA,IAAA,IAAA,MAAA,MAAAqL,GAAAjI,SAAAqT,EAAAhc,UAAAoI,IAAA,uBAAAlE,MAAAmD,mBAAAM,KAAA,QAAAuX,GAqMZ/H,EAAIzX,GArMQ,GAwM9B1B,GAGEmhB,EAOF3W,EACAjD,CAnN8B,OAAA8B,oBAAAjF,KAAA,SAAAoX,GAAA,OAAA,OAAAA,EAAAhR,KAAAgR,EAAAjU,MAAA,IAAA,GAAA,MAuMlCvF,MAAK6Q,MAAMmJ,WAAW,oCAAqC7C,EAAI,KAAMzX,EAAK,KAvMxC8Z,EAAA9P,cAwMnB1J,KAAK4e,YAAYzH,EAAIzX,GAxMF,KAAA,EAAA,KAAA,GAAA,GAwM9B1B,EAxM8Bwb,EAAAzL,KAyM9B/P,EAAEmZ,GAAG,GAAKA,EAAG,KAAOnZ,EAAE0Z,GAzMQ,CAAA8B,EAAAjU,KAAA,CAAA,OAAA,MA2M5B4Z,GAASnhB,EAAE0B,KAAOyX,EAAG,GAAKnZ,EAAEmZ,GAAG,IACnCnZ,EAAE0B,KAAOyf,EA5MuB3F,EAAA9P,cA6MzB1J,KAAKgQ,GAAGoP,IAAIphB,GA7Ma,KAAA,EAAA,KAAA,GAAA,MA8MhCA,IAAKmZ,GAAIA,EAAIzX,IAAKyf,EAAQzH,IAAI,GA9ME8B,EAAA9P,cA+MzB1J,KAAKgQ,GAAGoP,IAAIphB,GA/Ma,KAAA,EAAA,KAAA,GAAA,MAAAwb,GAAA9P,cAkNhB1J,KAAKgQ,GAAGqP,SAASlI,GAlND,KAAA,GAAA,KAAA,IAAA,MAkN9B3O,GAlN8BgR,EAAAnJ,GAAAmJ,EAAA9P,cAmNhB1J,KAAKgQ,GAAGsP,SAASnI,GAnND,KAAA,GAAA,KAAA,IAAA,GAmN9B5R,EAnN8BiU,EAAAG,KAqN9BxC,EAAG,GAAKzX,EAAM1B,EAAEmZ,GAAG,GAAKnZ,EAAE0B,MAAQ1B,EAAE0Z,GArNN,CAAA8B,EAAAjU,KAAA,EAAA,OAAA,MAAAiU,GAAA9P,cAuNzB1J,KAAKgQ,GAAGoP,KAAKjI,IAAKA,EAAG,GAAIA,EAAG,GAAKzX,GAAMA,IAAK1B,EAAE0B,IAAMA,EAAKgY,IAAI,IAvNpC,KAAA,GAAA,KAAA,IAwNhC1Z,EAAE0B,IAAMA,CAxNwB,KAAA,IAAA,GA2NlC1B,EAAE0Z,IAAK,EAGG,MAARlP,IACAA,EAAKkP,KACLzM,EAAEsK,MAAM2C,YAAY1P,EAAK2O,GAAG,GAAI3O,EAAK2O,GAAG,GAAK3O,EAAK9I,KAAM1B,EAAEmZ,IAhO1B,CAAAqC,EAAAjU,KAAA,EAAA,OAAA,MAkOhCiD,GAAK9I,KAAO1B,EAAE0B,IAlOkB8Z,EAAA9P,cAmOzB1J,KAAKgQ,GAALhQ,UAAehC,EAAEmZ,IAnOQ,KAAA,GAAA,KAAA,IAoOhCnZ,EAAIwK,CApO4B,KAAA,IAAA,GAyOxB,MAARjD,IACAA,EAAKmS,KACLzM,EAAEsK,MAAM2C,YAAYla,EAAEmZ,GAAG,GAAInZ,EAAEmZ,GAAG,GAAKnZ,EAAE0B,KAAM6F,EAAK4R,IA3OpB,CAAAqC,EAAAjU,KAAA,EAAA,OAAA,MA6OhCvH,GAAE0B,KAAO6F,EAAK7F,IA7OkB8Z,EAAA9P,cA8OzB1J,KAAKgQ,GAALhQ,UAAeuF,EAAK4R,IA9OK,KAAA,GAAA,KAAA,IAAA,MAAAqC,GAAA9P,cAgP3B1J,KAAKgQ,GAAGoP,IAAIphB,GAhPe,KAAA,GAAA,KAAA,IAAA,MAAAwb,GAAA9P,cAiP3B1J,KAAKkb,YAAYld,EAAEmZ,GAAG,IAjPK,KAAA,GAAA,KAAA,IAAA,IAAA,MAAA,MAAAqC,GAAA7Q,SAAAuW,EAAAlf,UAAAoI,IAAA,cAAAlE,MAAAmD,mBAAAM,KAAA,QAAAiX,GAwPrBzH,EAAIrY,GAxPiB,GA6P9Bd,GAIIuhB,EAgCJha,EA0BQia,CA3TsB,OAAAnY,oBAAAjF,KAAA,SAAA2X,GAAA,OAAA,OAAAA,EAAAvR,KAAAuR,EAAAxU,MAAA,IAAA,GAAA,MAyPpB,OAAVzG,IACFA,EAAS,GA1PuBib,EAAArQ,cA6PnB1J,KAAKgQ,GAAGiP,mBAAmB9H,GA7PR,KAAA,EAAA,KAAA,GAAA,GA6P9BnZ,EA7P8B+b,EAAAhM,GA8PzB,MAAL/P,GAAaA,EAAEmZ,GAAG,KAAOA,EAAG,GA9PE,CAAA4C,EAAAxU,KAAA,EAAA,OAAA,KA+P5BvH,EAAEmZ,GAAG,IAAMA,EAAG,IAAMA,EAAG,IAAMnZ,EAAEmZ,GAAG,GAAKnZ,EAAE0B,KA/Pb,CAAAqa,EAAAxU,KAAA,EAAA,OAAA,GAiQ1Bga,EAAOpI,EAAG,GAAKrY,GAAUd,EAAEmZ,GAAG,GAAKnZ,EAAE0B,OACrC6f,EAAO,GAlQmB,CAAAxF,EAAAxU,KAAA,EAAA,OAAA,GAoQvBvH,EAAE0Z,GApQqB,CAAAqC,EAAAxU,KAAA,EAAA,OAqQ1BvH,EAAE0B,KAAO6f,EArQiBxF,EAAAxU,KAAA,EAAA,MAAA,KAAA,IAAA,GAuQ1Bga,EAAOvhB,EAAEmZ,GAAG,GAAKnZ,EAAE0B,IAAMyX,EAAG,KACjBrY,EAAPygB,GAxQsB,CAAAxF,EAAAxU,KAAA,EAAA,OAAA,MA0QxBvH,IAAKmZ,IAAKA,EAAG,GAAIA,EAAG,GAAKoI,GAAO7f,IAAKZ,EAASygB,EAAM7H,IAAI,GA1QhCqC,EAAArQ,cA2QjB1J,KAAKgQ,GAAGoP,IAAIphB,GA3QK,KAAA,GAAA,KAAA,IAAA+b,EAAAxU,KAAA,EAAA,MAAA,KAAA,IAAA,KA8QlB,IAAI9G,OAAM,sCA9QQ,KAAA,IAAAsb,EAAAxU,KAAA,EAAA,MAAA,KAAA,IAAA,MAAAwU,GAAAnU,OAAA,SAoRrB5H,EApRqB,KAAA,IAAA+b,EAAAxU,KAAA,EAAA,MAAA,KAAA,IAAA,MAwR9BvH,IAAKmZ,GAAIA,EAAIzX,IAAKZ,EAAQ4Y,IAAI,GAxRAqC,EAAArQ,cAyRvB1J,KAAKgQ,GAAGoP,IAAIphB,GAzRW,KAAA,GAAA,KAAA,IAAA+b,EAAAxU,KAAA,EAAA,MAAA,KAAA,IAAA,MA6RhCvH,IAAKmZ,GAAIA,EAAIzX,IAAKZ,EAAQ4Y,IAAI,GA7REqC,EAAArQ,cA8RzB1J,KAAKgQ,GAAGoP,IAAIphB,GA9Ra,KAAA,GAAA,KAAA,IAAA,MAAA+b,GAAArQ,cAiShB1J,KAAKgQ,GAAGsP,SAASthB,EAAEmZ,IAjSH,KAAA,GAAA,KAAA,IAAA,GAiS9B5R,EAjS8BwU,EAAAJ,KAmSxB,MAARpU,GACAvH,EAAEmZ,GAAG,KAAO5R,EAAK4R,GAAG,IACpBnZ,EAAEmZ,GAAG,GAAKnZ,EAAE0B,KAAO6F,EAAK4R,GAAG,IArSK,CAAA4C,EAAAxU,KAAA,EAAA,OAuShCga,EAAOvhB,EAAEmZ,GAAG,GAAKnZ,EAAE0B,IAAM6F,EAAK4R,GAAG,EAvSD,KAAA,IAAA,KAwSzBoI,GAAQ,GAxSiB,CAAAxF,EAAAxU,KAAA,EAAA,OAAA,IA0S1BA,EAAKmS,GA1SqB,CAAAqC,EAAAxU,KAAA,EAAA,OAAA,GA4S5BvH,EAAE0B,KAAO6f,IACLA,GAAQha,EAAK7F,KA7SW,CAAAqa,EAAAxU,KAAA,EAAA,OAAA,GA+S1Bga,GAAcha,EAAK7F,MACf6f,EAAO,GAhTe,CAAAxF,EAAAxU,KAAA,EAAA,OAAA,MAAAwU,GAAArQ,cAiTjB1J,KAAKgQ,GAAGoP,IAAIphB,GAjTK,KAAA,GAAA,KAAA,IAAA,MAAA+b,GAAArQ,cAkTjB1J,KAAK4e,aAAarZ,EAAK4R,GAAG,GAAI5R,EAAK4R,GAAG,GAAK5R,EAAK7F,KAAM6f,GAlTrC,KAAA,GAAA,KAAA,IAAA,MAAAxF,GAAAnU,OAAA,QAAA,GAAA,KAAA,IAAA,KAwTxB2Z,EAAOha,EAAK7F,KAxTY,CAAAqa,EAAAxU,KAAA,EAAA,OAAA,MAAAwU,GAAArQ,cA2TP1J,KAAKgQ,GAAGsP,SAAS/Z,EAAK4R,IA3Tf,KAAA,GAAA,KAAA,IAAA,MA2TtBqI,GA3TsBzF,EAAAgD,GAAAhD,EAAArQ,cA4TnB1J,KAAKgQ,GAALhQ,UAAeuF,EAAK4R,IA5TD,KAAA,GAAA,KAAA,IAAA,GA6Tb,MAATqI,GAAiBxhB,EAAEmZ,GAAG,KAAOqI,EAAMrI,GAAG,GA7ThB,CAAA4C,EAAAxU,KAAA,EAAA,OAAA,MAAAwU,GAAAnU,OAAA,QAAA,GAAA,KAAA,IAgUxBL,EAAOia,EACPD,EAAOvhB,EAAEmZ,GAAG,GAAKnZ,EAAE0B,IAAM6F,EAAK4R,GAAG,EAjUT,KAAA,IAAA4C,EAAAxU,KAAA,EAAA,MAAA,KAAA,IAAA,MAsU1BvH,GAAE0B,KAAO6F,EAAK7F,IAAM6f,EAtUMxF,EAAArQ,cAuUnB1J,KAAKgQ,GAALhQ,UAAeuF,EAAK4R,IAvUD,KAAA,GAAA,KAAA,IAAA,MAAA4C,GAAAnU,OAAA,QAAA,GAAA,KAAA,IAAAmU,EAAAxU,KAAA,EAAA,MAAA,KAAA,IAAA,MAAAwU,GAAArQ,cA6U3B1J,KAAKgQ,GAAGoP,IAAIphB,GA7Ue,MAAA,GAAA,KAAA,IAAA,MAAA+b,GAAAnU,OAAA,SA8U3B5H,EA9U2B,KAAA,IAAA,IAAA,MAAA,MAAA+b,GAAApR,SAAAiW,EAAA5e,UAAAoI,IAAA,0BAAAlE,MAAAmD,mBAAAM,KAAA,QAAA+G,KAAA,MAAArH,oBAAAjF,KAAA,SAAAoZ,GAAA,OAAA,OAAAA,EAAAhT,KAAAgT,EAAAjW,MAAA,IAAA,GAAA,OAsV9BvF,KAAK6Q,MAAMqF,IAAIpX,OAAS,GAAKkB,KAAK6Q,MAAMsF,IAAIrX,OAAS,IACvDgL,QAAQC,KAAK,iCAvVmByR,EAAA9R,cAyV3B1J,KAAKsQ,GAAGmP,QAAQzf,KAAM,KAAM,KAA5BqH,mBAAAM,KAAkC,QAAA+F,GAAYuB,GAAZ,GAMjCyQ,GAUWnhB,EAWXsZ,CA3BiC,OAAAxQ,oBAAAjF,KAAA,SAAA4Y,GAAA,OAAA,OAAAA,EAAAxS,KAAAwS,EAAAzV,MAAA,IAAA,GAAA,IACnC0J,EAAGyI,GADgC,CAAAsD,EAAAzV,KAAA,CAAA,OAAA,aAE9B0J,GAAGyI,GAF2BsD,EAAAtR,cAG9B1J,KAAK2X,aAAa1I,GAHY,KAAA,EAAA,KAAA,GAAA,GAKtB,MAAbA,EAAG8E,OALgC,CAAAiH,EAAAzV,KAAA,EAAA,OAAA,MAAAyV,GAAAtR,cAMV1J,KAAKmb,UAAUlM,EAAG8E,QANR,KAAA,EAAA,KAAA,GAAA,GAMjC2L,EANiC1E,EAAA/M,IAOjCyR,EAPiC,CAAA1E,EAAAzV,KAAA,EAAA,OAAA,GAQnC0J,EAAGyI,IAAK,EACHzI,EAAG6I,QAT2B,CAAAkD,EAAAzV,KAAA,EAAA,OAAA,MAAAyV,GAAAtR,cAU1B1J,KAAK4e,YAAY3P,EAAGkI,GAAkB,MAAdlI,EAAG8I,QAAkB9I,EAAG8I,QAAQjZ,OAAS,GAVvC,KAAA,GAAA,KAAA,IAAA,GAWjCmQ,EAAG6I,SAAU,EACO,MAAhB7I,EAAGmN,UAZ0B,CAAApB,EAAAzV,KAAA,EAAA,OAAA,MAAAyV,GAAAtR,cAaxB1J,KAAKgc,gBAAgB/M,EAAGmN,WAbA,KAAA,GAAA,KAAA,IAAA,GAed,MAAfnN,EAAG4J,SAf0B,CAAAmC,EAAAzV,KAAA,EAAA,OAgBtBhH,EAAI,CAhBkB,KAAA,IAAA,KAgBfA,EAAI0Q,EAAG4J,SAAS/Z,QAhBD,CAAAkc,EAAAzV,KAAA,EAAA,OAAA,MAAAyV,GAAAtR,cAiBtB1J,KAAKgc,gBAAgB/M,EAAG4J,SAASta,IAjBX,KAAA,GAAA,KAAA,IAgBSA,IAhBTyc,EAAAzV,KAAA,EAAA,MAAA,KAAA,IAAA,MAAAyV,GAAAtR,cAqB5B1J,KAAK2X,aAAa1I,GArBU,KAAA,GAAA,KAAA,IAAA,MAsBnCjP,MAAK6Q,MAAMqF,IAAI3V,KAAK0O,EAAGkI,IAtBY6D,EAAApV,OAAA,SAAA,KAAA,IAAA,IA0BnCqJ,EAAG6I,QA1BgC,CAAAkD,EAAAzV,KAAA,EAAA,OAAA,GA2BjCsS,EAAO,KACI,MAAX5I,EAAG4I,KA5B8B,CAAAmD,EAAAzV,KAAA,EAAA,OAAA,MAAAyV,GAAAtR,cA6BrB1J,KAAK0Z,aAAazK,EAAG4I,MA7BA,KAAA,GAAA,KAAA,IA6BnCA,EA7BmCmD,EAAAM,EAAA,KAAA,IAAA,MAAAN,GAAAtR,cA+B9B1J,KAAK6Q,MAAM+G,sBAAsB/Y,KAAKmB,KAAMiP,EAAI4I,GA/BlB,KAAA,GAAA,KAAA,IAAA,IAAA,MAAA,MAAAmD,GAAArS,SAAA+E,EAAA1N,SAzVP,KAAA,EAAA,KAAA,GAAA,IAAA,MAAA,MAAAwb,GAAA7S,SAAA+F,EAAA1O,UAAAoI,IAAA,0BAAAlE,MAAAmD,mBAAAM,KAAA,QAAA2O,GAqYTa,GArYS,GAuY9BhZ,GAIEwhB,EAOKphB,EACHqhB,EAgBA/H,EAOAqE,EAME2D,EACAC,EA4CKzG,EACH0G,EAyBJ1F,EAMFtG,EAMEiM,CAngB0B,OAAA3Y,oBAAAjF,KAAA,SAAA6d,GAAA,OAAA,OAAAA,EAAAzX,KAAAyX,EAAA1a,MAAA,IAAA,GAAA,MAsYlCvF,MAAK6Q,MAAMmJ,WAAW,uCAAwC7C,EAAI,KAtYhC8I,EAAAvW,cAuYnB1J,KAAKyX,aAAaN,GAvYC,KAAA,EAAA,KAAA,GAAA,MAuY9BhZ,GAvY8B8hB,EAAAlS,GAAAkS,EAAAvW,cAwY3B1J,KAAKkf,qBAAqB/H,EAAU,MAALhZ,GAA0B,MAAbA,EAAE4Z,QAAmB5Z,EAAE4Z,QAAQjZ,OAAS,GAxYzD,KAAA,EAAA,KAAA,GAAA,GA0YzB,MAALX,EA1Y8B,CAAA8hB,EAAA1a,KAAA,EAAA,OA2Y5Boa,KACe,MAAfxhB,EAAEie,WACJuD,EAAKpf,KAAKpC,EAAEie,WAEI,MAAdje,EAAE0a,WACJ8G,EAAOA,EAAKtgB,OAAOlB,EAAE0a,WAEdta,EAAI,CAlZmB,KAAA,GAAA,KAkZhBA,EAAIohB,EAAK7gB,QAlZO,CAAAmhB,EAAA1a,KAAA,EAAA,OAAA,MAAA0a,GAAAvW,cAmZb1J,KAAKyX,aAAakI,EAAKphB,IAnZV,KAAA,GAAA,KAAA,IAAA,GAmZ1BqhB,EAnZ0BK,EAAA9P,GAoZnB,MAAPyP,EApZ0B,CAAAK,EAAA1a,KAAA,EAAA,OAAA,GAqZvBqa,EAAI9H,QArZmB,CAAAmI,EAAA1a,KAAA,EAAA,OAAA,MAAA0a,GAAAvW,cAsZnB1J,KAAKgc,gBAAgB4D,EAAIzI,IAtZN,KAAA,GAAA,KAAA,IAAA,MAAA8I,GAAAvW,cAuZb1J,KAAKyX,aAAamI,EAAIzI,IAvZT,KAAA,GAAA,KAAA,IAuZ1ByI,EAvZ0BK,EAAAtG,EAAA,KAAA,IAAA,MAyZ5BiG,GAAIlI,IAAK,EAzZmBuI,EAAAvW,cA0ZrB1J,KAAK2X,aAAaiI,GA1ZG,KAAA,GAAA,KAAA,IA2Z5B5f,KAAK6Q,MAAMoH,sBAAsB2H,EAAIzI,IA3ZT8I,EAAA1a,KAAA,EAAA,MAAA,KAAA,IAAA,MAAA0a,GAAAvW,cA6ZrB1J,KAAKkf,qBAAqBS,EAAKphB,GAAI,GA7Zd,KAAA,GAAA,KAAA,IAkZCA,IAlZD0hB,EAAA1a,KAAA,CAAA,MAAA,KAAA,IAAA,GAkalB,MAAVpH,EAAE0Z,KAla0B,CAAAoI,EAAA1a,KAAA,EAAA,OAAA,MAAA0a,GAAAvW,cAmaZ1J,KAAK0Z,aAAavb,EAAE0Z,MAnaR,KAAA,GAAA,KAAA,IAAA,MAma1BA,GAna0BoI,EAAAlD,GAoa9BlF,EAAKqE,MAAQ/d,EAAE+d,MApae+D,EAAAvW,cAqavB1J,KAAK2X,aAAaE,GAraK,KAAA,GAAA,KAAA,IAAA,GAyajB,MAAX1Z,EAAE+d,MAza0B,CAAA+D,EAAA1a,KAAA,EAAA,OAAA,MAAA0a,GAAAvW,cA0aX1J,KAAKyX,aAAatZ,EAAE+d,OA1aT,KAAA,GAAA,KAAA,IAAA,GA0a1BA,EA1a0B+D,EAAAC,GA2a9BhE,EAAMrE,KAAO1Z,EAAE0Z,OAEG,MAAd1Z,EAAE0e,UAAoB1e,EAAE0e,SAAS/d,OAAS,GA7ahB,CAAAmhB,EAAA1a,KAAA,EAAA,OAgbxBsa,EAAY1hB,EAAE0Z,KACdiI,EAAa,IAjbW,KAAA,IAAA,GAkbR,MAAbD,EAlbqB,CAAAI,EAAA1a,KAAA,EAAA,OAAA,MAAA0a,GAAAvW,cAmbN1J,KAAK0Z,aAAamG,GAnbZ,MAAA,GAAA,KAAA,IAAA,GAmb1BC,EAnb0BG,EAAAhD,KAobtB6C,EAAWhI,QApbW,CAAAmI,EAAA1a,KAAA,EAAA,OAAA,MAAA0a,GAAAra,OAAA,QAAA,GAAA,KAAA,IAub1Bia,EAAYC,EAAWjI,KAvbGoI,EAAA1a,KAAA,EAAA,MAAA,KAAA,IAAA0a,EAAA/C,IAAA7V,mBAAAa,KA6db/J,EAAE0e,SA7dW,KAAA,IAAA,IAAAoD,EAAA9C,IAAA8C,EAAA/C,OAAA9X,KAAA,CAAA6a,EAAA1a,KAAA,EAAA,OAAA,MA6dnB8T,GA7dmB4G,EAAA9C,IAAAjZ,MAAA+b,EAAAvW,cA8dH1J,KAAKyX,aAAatZ,EAAE0e,SAASxD,IA9d1B,MAAA,GAAA,KAAA,IAAA,GA8dtB0G,EA9dsBE,EAAA7C,IA+dT,MAAb2C,EA/dsB,CAAAE,EAAA1a,KAAA,EAAA,OAAA,MAgexBwa,GAAU1F,OAASwF,EAheKI,EAAAvW,cAiejB1J,KAAK2X,aAAaoI,GAjeD,MAAA,GAAA,KAAA,IAAAE,EAAA1a,KAAA,EAAA,MAAA,KAAA,IAAA,GAoeX,MAAbsa,EApewB,CAAAI,EAAA1a,KAAA,EAAA,OAAA,MAqeC,OAAvBua,EAAWjD,SACbiD,EAAWjD,SAAW1e,EAAE0e,SAExBiD,EAAWjD,SAAW1e,EAAE0e,SAASxd,OAAOygB,EAAWjD,UAxe3BoD,EAAAvW,cA0enB1J,KAAK2X,aAAamI,GA1eC,MAAA,GAAA,KAAA,IAAAG,EAAA1a,KAAA,EAAA,MAAA,KAAA,IAAA,MAAA0a,GAAAvW,cAifrB1J,KAAK2X,aAAauE,GAjfG,MAAA,GAAA,KAAA,IAAA,GAsfhB,MAAZ/d,EAAEkc,OAtf0B,CAAA4F,EAAA1a,KAAA,EAAA,OAAA,MAAA0a,GAAAvW,cAufV1J,KAAK0Z,aAAavb,EAAEkc,QAvfV,MAAA,GAAA,KAAA,IAAA,MAuf1BA,GAvf0B4F,EAAAE,IAwf9B9F,EAAOwC,SAAWxC,EAAOwC,SAASpQ,OAAO,SAAU2T,GACjD,OAAQnV,EAAEsK,MAAM2C,WAAWf,EAAIiJ,KAzfHH,EAAAvW,cA2fvB1J,KAAK2X,aAAa0C,GA3fK,MAAA,GAAA,KAAA,IAAA,GA8fhB,MAAZlc,EAAE4V,OA9f0B,CAAAkM,EAAA1a,KAAA,EAAA,OAAA,MAAA0a,GAAAvW,cA+fd1J,KAAKyX,aAAatZ,EAAE4V,QA/fN,MAAA,GAAA,KAAA,IA+f9BA,EA/f8BkM,EAAAI,GAAA,KAAA,IAAA,GAkgBlB,MAAVtM,EAlgB4B,CAAAkM,EAAA1a,KAAA,EAAA,OAAA,GAmgB1Bya,GAAY,EACG,MAAf7hB,EAAEge,UACAlR,EAAEsK,MAAM2C,WAAWnE,EAAO/E,IAAI7Q,EAAEge,WAAYhe,EAAEgZ,MAChD6I,GAAY,EACG,MAAX7hB,EAAE+d,MACJnI,EAAO/E,IAAI7Q,EAAEge,WAAahe,EAAE+d,YAErBnI,GAAO/E,IAAI7Q,EAAEge,aAIpBlR,EAAEsK,MAAM2C,WAAWnE,EAAO2I,MAAOve,EAAEgZ,MAErC6I,GAAY,EACZjM,EAAO2I,MAAQve,EAAE+d,OAEfjR,EAAEsK,MAAMgH,UAAUpe,EAAG4V,EAAOyJ,OAE9BwC,GAAY,EACZjM,EAAOyJ,IAAMrf,EAAE0Z,QAGfmI,EAzhB0B,CAAAC,EAAA1a,KAAA,EAAA,OAAA,MAAA0a,GAAAvW,cA0hBrB1J,KAAK2X,aAAa5D,GA1hBG,MAAA,GAAA,KAAA,IAAA,MAAAkM,GAAAvW,cA8hBzB1J,KAAKsgB,gBAAgBniB,EAAEgZ,IA9hBE,MAAA,GAAA,KAAA,IAAA,IAAA,MAAA,MAAA8I,GAAAtX,SAAA2N,EAAAtW,UAAAoI,IAAA,2BAAAlE,MAAAmD,mBAAAM,KAAA,QAAA4Y,GAiiBR5b,GAjiBQ,GAkiB9B3G,EAliB8B,OAAAqJ,oBAAAjF,KAAA,SAAAoe,GAAA,OAAA,OAAAA,EAAAhY,KAAAgY,EAAAjb,MAAA,IAAA,GAAA,MAAAib,GAAA9W,cAkiBnB1J,KAAKgQ,GAAGiP,oBAAoBta,EAAM4H,KAAM5H,EAAM8T,QAliB3B,KAAA,EAAA,KAAA,GAkiB9Bza,EAliB8BwiB,EAAAzS,GAmiBzB,MAAL/P,GAAaA,EAAEmZ,GAAG,KAAOxS,EAAM4H,MAAQvO,EAAE0Z,KAC3C/S,EAAM8T,MAAQgI,KAAKC,IAAI/b,EAAM8T,MAAOza,EAAEmZ,GAAG,GAAKnZ,EAAE0B,KApiBhB,KAAA,GAAA,IAAA,MAAA,MAAA8gB,GAAA7X,SAAA4X,EAAAvgB,UAAAoI,IAAA,cAAAlE,MAAAmD,mBAAAM,KAAA,QAAAuT,GAuiBrB3O,GAviBqB,GAwiB9B5H,GAEAxG,EACAwiB,CA3iB8B,OAAAtZ,oBAAAjF,KAAA,SAAAwe,GAAA,OAAA,OAAAA,EAAApY,KAAAoY,EAAArb,MAAA,IAAA,GAAA,MAAAqb,GAAAlX,cAwiBf1J,KAAKuY,SAAShM,GAxiBC,KAAA,EAAA,KAAA,GAAA,MAwiB9B5H,GAxiB8Bic,EAAA7S,GAAA6S,EAAAlX,cAyiB3B1J,KAAKugB,yBAAyB5b,GAziBH,KAAA,EAAA,KAAA,GAAA,MAAAic,GAAAlX,cA0iBnB1J,KAAK0Z,cAAcnN,EAAM5H,EAAM8T,QA1iBZ,KAAA,EAAA,KAAA,GA0iB9Bta,EA1iB8ByiB,EAAAzQ,GA2iB9BwQ,EAAgB,MAALxiB,GAA0B,MAAbA,EAAE4Z,QAAmB5Z,EAAE4Z,QAAQjZ,OAAS,CA3iBlC,KAAA,GAAA,KA4iBtB,MAALX,GAAaoO,IAASpO,EAAEgZ,GAAG,IAAMhZ,EAAEgZ,GAAG,IAAMxS,EAAM8T,OAASta,EAAEgZ,GAAG,GAAKwJ,EAAUhc,EAAM8T,OA5iB1D,CAAAmI,EAAArb,KAAA,EAAA,OAAA,MA8iBhCZ,GAAM8T,OAASkI,EA9iBiBC,EAAAlX,cA+iBzB1J,KAAKugB,yBAAyB5b,GA/iBL,KAAA,EAAA,KAAA,GAAA,MAAAic,GAAAlX,cAgjBrB1J,KAAKsQ,GAAGgP,SAASnhB,EAAEgZ,IAhjBE,KAAA,GAAA,KAAA,IAgjBhChZ,EAhjBgCyiB,EAAAjH,GAijBhCgH,EAAgB,MAALxiB,GAA0B,MAAbA,EAAE4Z,QAAmB5Z,EAAE4Z,QAAQjZ,OAAS,EAjjBhC8hB,EAAArb,KAAA,CAAA,MAAA,KAAA,IAAA,MAAAqb,GAAAlX,cAmjB3B1J,KAAK6gB,SAASlc,GAnjBa,KAAA,GAAA,KAAA,IAAA,IAAA,MAAA,MAAAic,GAAAjY,SAAAuS,EAAAlb,UAAAoI,IAAA,iBAAAlE,MAAAmD,mBAAAM,KAAA,QAAAuI,GAyjBlBF,GAzjBkB,GA0jB9B8Q,GAEKvU,EACHwU,EACAnD,EACAtB,EA+CG/d,EACHyiB,EAOEC,EAEE9iB,EAIA+iB,EAkBFrS,CA9oB0B,OAAAxH,oBAAAjF,KAAA,SAAA+e,GAAA,OAAA,OAAAA,EAAA3Y,KAAA2Y,EAAA5b,MAAA,IAAA,GA0jB9Bub,KA1jB8BK,EAAApT,GAAA1G,mBAAAa,KA4jBjB8H,EA5jBiB,KAAA,GAAA,IAAAmR,EAAAlT,GAAAkT,EAAApT,MAAA3I,KAAA,CAAA+b,EAAA5b,KAAA,EAAA,OAAA,MA4jBzBgH,GA5jByB4U,EAAAlT,GAAA/J,MA6jB5B6c,EAAK/Q,EAAGzD,GACRqR,EAAM,EACNtB,EAAIyE,EAAGnD,GA/jBqBuD,EAAAzX,cAgkBzB1J,KAAKgQ,GAAGyP,QAAQzf,MAAOuM,EAAM,IAAKA,EAAM6U,OAAOC,WAA/Cha,mBAAAM,KAA2D,QAAAwG,GAAYnQ,GAAZ,GAY1DuhB,EAZ0D,OAAAlY,oBAAAjF,KAAA,SAAAkf,GAAA,OAAA,OAAAA,EAAA9Y,KAAA8Y,EAAA/b,MAAA,IAAA,GAAA,GAWpD,MAAL+W,EAXyD,CAAAgF,EAAA/b,KAAA,EAAA,OAAA,GAY1Dga,EAAO,IACPvhB,EAAEmZ,GAAG,GAAKnZ,EAAE0B,KAAO4c,EAAE,IAbqC,CAAAgF,EAAA/b,KAAA,CAAA,OAAA,MAAA+b,GAAA1b,OAAA,QAAA,GAAA,KAAA,GAgBnD0W,EAAE,GAAKte,EAAEmZ,GAAG,IAIrBoI,EAAOkB,KAAKc,IAAIvjB,EAAEmZ,GAAG,GAAKmF,EAAE,GAAIA,EAAE,IAClCwE,EAAUvgB,MAAMgM,EAAM+P,EAAE,GAAIiD,EAAMjD,EAAE,OAGpCiD,EAAOvhB,EAAEmZ,GAAG,GAAKnZ,EAAE0B,IAAM4c,EAAE,GACvBA,EAAE,KAAOte,EAAE0Z,IAGboJ,EAAUvgB,MAAMgM,EAAM+P,EAAE,GAAImE,KAAKc,IAAIhC,EAAMjD,EAAE,IAAKA,EAAE,KA5BM,KAAA,GA+B1DA,EAAE,IAAMiD,EAEVjD,EAAIyE,IAAKnD,IAETtB,EAAE,GAAKA,EAAE,GAAKiD,EACdjD,EAAE,GAAKA,EAAE,GAAKiD,GApC8C+B,EAAA/b,KAAA,CAAA,MAAA,KAAA,IAAA,IAAA,MAAA,MAAA+b,GAAA3Y,SAAAwF,EAAAnO,SAhkBlC,KAAA,EAAA,KAAA,GAymBhC,KAAO4d,EAAMmD,EAAGjiB,OAAQ8e,IACtBtB,EAAIyE,EAAGnD,GACPkD,EAAUvgB,MAAMgM,EAAM+P,EAAE,GAAIA,EAAE,GAAIA,EAAE,IA3mBN6E,GAAA5b,KAAA,CAAA,MAAA,KAAA,IA8mBzBhH,EAAI,CA9mBqB,KAAA,IAAA,KA8mBlBA,EAAIuiB,EAAUhiB,QA9mBI,CAAAqiB,EAAA5b,KAAA,EAAA,OAAA,MA+mB5Byb,GAAMF,EAAUviB,GA/mBY4iB,EAAAzX,cAinBzB1J,KAAKgc,iBAAiBgF,EAAI,GAAIA,EAAI,IAAKA,EAAI,IAjnBlB,KAAA,GAAA,KAAA,IAAA,IAknB5BA,EAAI,GAlnBwB,CAAAG,EAAA5b,KAAA,EAAA,OAAA,MAAA4b,GAAAzX,cAonBvB1J,KAAKkf,sBAAsB8B,EAAI,GAAIA,EAAI,IAAKA,EAAI,IApnBzB,KAAA,GAAA,KAAA,IAsnB1BC,EAAUD,EAAI,GAAKA,EAAI,EAtnBG,KAAA,IAAA,KAunBvBC,GAAWD,EAAI,IAvnBQ,CAAAG,EAAA5b,KAAA,EAAA,OAAA,MAAA4b,GAAAzX,cAwnBb1J,KAAKsQ,GAAG2O,oBAAoB+B,EAAI,GAAIC,EAAU,IAxnBjC,KAAA,GAAA,KAAA,IAAA,GAwnBxB9iB,EAxnBwBgjB,EAAArE,GAynBnB,MAAL3e,EAznBwB,CAAAgjB,EAAA5b,KAAA,EAAA,OAAA,MAAA4b,GAAAvb,OAAA,QAAA,GAAA,KAAA,IAAA,GA4nBxBsb,EAAoB,MAAb/iB,EAAE4Z,QAAkB5Z,EAAE4Z,QAAQjZ,OAAS,IAC9CX,EAAEgZ,GAAG,KAAO6J,EAAI,IAAM7iB,EAAEgZ,GAAG,GAAK+J,GAAQF,EAAI,IA7nBpB,CAAAG,EAAA5b,KAAA,EAAA,OAAA,MAAA4b,GAAAvb,OAAA,QAAA,GAAA,KAAA,IAAA,KAioBxBzH,EAAEgZ,GAAG,GAAK+J,EAAOF,EAAI,GAAKA,EAAI,IAjoBN,CAAAG,EAAA5b,KAAA,EAAA,OAAA,MAAA4b,GAAAzX,cAmoBf1J,KAAK4c,sBAAsBoE,EAAI,GAAIA,EAAI,GAAKA,EAAI,GAAK,IAnoBtC,KAAA,GAAA,KAAA,IAmoB1B7iB,EAnoB0BgjB,EAAA7F,EAAA,KAAA,IAAA,KAqoBxBnd,EAAEgZ,GAAG,GAAK6J,EAAI,IAroBU,CAAAG,EAAA5b,KAAA,EAAA,OAAA,MAAA4b,GAAAzX,cAuoBf1J,KAAKgY,wBAAwBgJ,EAAI,GAAIA,EAAI,KAvoB1B,KAAA,GAAA,KAAA,IAuoB1B7iB,EAvoB0BgjB,EAAApE,EAAA,KAAA,IAAA,MAyoB5BkE,GAAU9iB,EAAEgZ,GAAG,GAzoBagK,EAAAzX,cA0oBrB1J,KAAKsW,wBAAwBnY,EAAEgZ,IA1oBV,KAAA,GAAA,KAAA,IAAAgK,EAAA5b,KAAA,EAAA,MAAA,KAAA,IA6oB5BvF,KAAK6Q,MAAMtF,2BACTsD,KACJA,EAAItO,MAAM4O,OAAQ,SAAU3E,QAAS8R,EAAE,GAAIA,EAAE,IAAKxd,OAAQkiB,EAAI,KAC9DhhB,KAAK6Q,MAAM1F,EAAEqJ,UAAUxD,aAAanC,GAhpBN,KAAA,IA8mBItQ,IA9mBJ4iB,EAAA5b,KAAA,EAAA,MAAA,KAAA,IAAA,IAAA,MAAA,MAAA4b,GAAAxY,SAAAuH,EAAAlQ,UAAAoI,IAAA,qBAAAlE,MAAAmD,mBAAAM,KAAA,QAAAmS,GAopBd3C,GAppBc,GAqpB9BnZ,EArpB8B,OAAAqJ,oBAAAjF,KAAA,SAAAof,GAAA,OAAA,OAAAA,EAAAhZ,KAAAgZ,EAAAjc,MAAA,IAAA,GAAA,MAAAic,GAAA9X,cAqpBnB1J,KAAKgQ,GAAGiP,mBAAmB9H,GArpBR,KAAA,EAAA,KAAA,GAAA,MAqpB9BnZ,GArpB8BwjB,EAAAzT,GAAAyT,EAAA5b,OAAA,SAspBtB,MAAL5H,GAAaA,EAAEmZ,GAAG,KAAOA,EAAG,IAAMA,EAAG,GAAKnZ,EAAEmZ,GAAG,GAAKnZ,EAAE0B,KAAO1B,EAAE0Z,GAtpBpC,KAAA,GAAA,IAAA,MAAA,MAAA8J,GAAA7Y,SAAAmR,EAAA9Z,UAAAoI,IAAA,eAAAlE,MAAAmD,mBAAAM,KAAA,QAAAqG,KAAA,GA4pB9BgC,EA5pB8B,OAAA3I,oBAAAjF,KAAA,SAAAqf,GAAA,OAAA,OAAAA,EAAAjZ,KAAAiZ,EAAAlc,MAAA,IAAA,GAAA,MA4pB9ByK,MA5pB8ByR,EAAA/X,cA6pB3B1J,KAAKgQ,GAAGyP,QAAQzf,KAAM,KAAM,KAA5BqH,mBAAAM,KAAkC,QAAAmI,GAAY9R,GAAZ,GACnCuO,GACA0U,EACAvhB,EACAgY,EACAqJ,CALmC,OAAA1Z,oBAAAjF,KAAA,SAAAsf,GAAA,OAAA,OAAAA,EAAAlZ,KAAAkZ,EAAAnc,MAAA,IAAA,GACnCgH,EAAOvO,EAAEmZ,GAAG,GACZ8J,EAAUjjB,EAAEmZ,GAAG,GACfzX,EAAM1B,EAAE0B,IACRgY,EAAK1Z,EAAE0Z,GACPqJ,EAAK/Q,EAAGzD,GACD,SAAPwU,IACFA,KACA/Q,EAAGzD,GAAQwU,GAEbA,EAAGxgB,MAAM0gB,EAASvhB,EAAKgY,GAVgB,KAAA,GAAA,IAAA,MAAA,MAAAgK,GAAA/Y,SAAAmH,EAAA9P,SA7pBP,KAAA,EAAA,KAAA,GAAA,MAAAyhB,GAAA7b,OAAA,SAyqB3BoK,EAzqB2B,KAAA,GAAA,IAAA,MAAA,MAAAyR,GAAA9Y,SAAAqF,EAAAhO,UAAAoI,IAAA,YAAAlE,MAAAmD,mBAAAM,KAAA,QAAAwT,GA2qBvBhE,GA3qBuB,GA4qB9BnZ,EA5qB8B,OAAAqJ,oBAAAjF,KAAA,SAAAuf,GAAA,OAAA,OAAAA,EAAAnZ,KAAAmZ,EAAApc,MAAA,IAAA,GAAA,MAAAoc,GAAAjY,cA4qBnB1J,KAAKgQ,GAAGiP,mBAAmB9H,GA5qBR,KAAA,EAAA,KAAA,GAAA,MA4qB9BnZ,GA5qB8B2jB,EAAA5T,GAAA4T,EAAA/b,OAAA,SA6qBtB,MAAL5H,GAAaA,EAAEmZ,GAAG,KAAOA,EAAG,IAAMA,EAAG,GAAKnZ,EAAEmZ,GAAG,GAAKnZ,EAAE0B,IA7qB3B,KAAA,GAAA,IAAA,MAAA,MAAAiiB,GAAAhZ,SAAAwS,EAAAnb,UAAAoI,IAAA,eAAAlE,MAAAmD,mBAAAM,KAAA,QAAAgQ,GA+qBpB1I,GA/qBoB,MAAA5H,oBAAAjF,KAAA,SAAAwf,GAAA,OAAA,OAAAA,EAAApZ,KAAAoZ,EAAArc,MAAA,IAAA,GAAA,MAAAqc,GAAAlY,cAgrB3B1J,KAAKsQ,GAAG8O,IAAInQ,GAhrBe,KAAA,EAAA,KAAA,GAAA,MAAA2S,GAAAhc,OAAA,SAirB3BqJ,EAjrB2B,KAAA,GAAA,IAAA,MAAA,MAAA2S,GAAAjZ,SAAAgP,EAAA3X,UAAAoI,IAAA,eAAAlE,MAAAmD,mBAAAM,KAAA,QAAA2S,GAmrBpBrL,GAnrBoB,MAAA5H,oBAAAjF,KAAA,SAAAyf,GAAA,OAAA,OAAAA,EAAArZ,KAAAqZ,EAAAtc,MAAA,IAAA,GAAA,MAAAsc,GAAAnY,cAorB3B1J,KAAKsQ,GAAG8O,IAAInQ,GAprBe,KAAA,EAAA,KAAA,IAqrB7BjP,KAAK6Q,MAAM1F,EAAEqJ,UAAUsB,kBAAoB9V,KAAK6Q,MAAMtF,0BAAgD,gBAAb0D,GAAGkI,GAAG,IAElGnX,KAAK6Q,MAAM1F,EAAEqJ,UAAUxD,cAAc/B,GAvrBL,KAAA,GAAA,IAAA,MAAA,MAAA4S,GAAAlZ,SAAA2R,EAAAta,UAAAoI,IAAA,qBAAAlE,MAAAmD,mBAAAM,KAAA,QAAA6S,GA2rBdvL,GA3rBc,GAmsB5B4I,EAnsB4B,OAAAxQ,oBAAAjF,KAAA,SAAA0f,GAAA,OAAA,OAAAA,EAAAtZ,KAAAsZ,EAAAvc,MAAA,IAAA,GAAA,GA6rB1B,MAAN0J,GACW,MAAXA,EAAG4I,MACW,MAAd5I,EAAG8I,SACH9I,EAAG4I,KAAK,KAAO5I,EAAGkI,GAAG,KACrBlM,EAAEsK,MAAM2C,WAAWjJ,EAAG4I,KAAM5I,EAAGoL,QAjsBC,CAAAyH,EAAAvc,KAAA,CAAA,OAAA,MAAAuc,GAAApY,cAmsBd1J,KAAK0Z,aAAazK,EAAG4I,MAnsBP,KAAA,EAAA,KAAA,GAAA,GAmsB5BA,EAnsB4BiK,EAAA/T,GAosBZ,MAAhB8J,EAAKE,SACLF,EAAKV,GAAG,GAAKU,EAAKE,QAAQjZ,SAAWmQ,EAAGkI,GAAG,IAClB,IAAzBU,EAAKgF,SAAS/d,QACb+Y,EAAKH,IAAOG,EAAKC,SACjB7I,EAAGyI,IAAOzI,EAAG6I,QAxsBc,CAAAgK,EAAAvc,KAAA,CAAA,OAAA,MA2sBX,OAAf0J,EAAG4N,SACLhF,EAAKgF,SAAW5N,EAAG4N,eAEZhF,GAAKgF,SAEdhF,EAAKE,QAAUF,EAAKE,QAAQ1Y,OAAO4P,EAAG8I,SACtCF,EAAKqE,MAAQjN,EAAGiN,MAjtBc4F,EAAApY,cAktBvB1J,KAAKsQ,GAALtQ,UAAeiP,EAAGkI,IAltBK,KAAA,EAAA,KAAA,GAAA,MAAA2K,GAAApY,cAmtBvB1J,KAAK2X,aAAaE,GAntBK,KAAA,EAAA,KAAA,GAAA,IAAA,MAAA,MAAAiK,GAAAnZ,SAAA6R,EAAAxa,UAAAoI,IAAA,eAAAlE,MAAAmD,mBAAAM,KAAA,QAAA+R,GAutBpBvC,GAvtBoB,GAwtB9B4K,GAIEriB,CA5tB4B,OAAA2H,oBAAAjF,KAAA,SAAA4f,GAAA,OAAA,OAAAA,EAAAxZ,KAAAwZ,EAAAzc,MAAA,IAAA,GAAA,MAAAyc,GAAAtY,cAwtBjB1J,KAAKsQ,GAAG2O,mBAAmB9H,GAxtBV,KAAA,EAAA,KAAA,GAAA,GAwtB9B4K,EAxtB8BC,EAAAjU,GAytBvB,MAAPgU,EAztB8B,CAAAC,EAAAzc,KAAA,CAAA,OAAA,MAAAyc,GAAApc,OAAA,SA0tBzB,KA1tByB,KAAA,GAAA,GA4tB5BlG,EAAqB,MAAfqiB,EAAIhK,QAAkBgK,EAAIhK,QAAQjZ,OAAS,IACjDqY,EAAG,KAAO4K,EAAI5K,GAAG,IAAMA,EAAG,GAAK4K,EAAI5K,GAAG,GAAKzX,GA7tBf,CAAAsiB,EAAAzc,KAAA,EAAA,OAAA,MAAAyc,GAAApc,OAAA,SA8tBvBmc,EA9tBuB,KAAA,IAAA,MAAAC,GAAApc,OAAA,SAguBvB,KAhuBuB,KAAA,IAAA,IAAA,MAAA,MAAAoc,GAAArZ,SAAA+Q,EAAA1Z,UAAAoI,IAAA,4BAAAlE,MAAAmD,mBAAAM,KAAA,QAAAsa,GAouBP9K,GApuBO,MAAA9P,oBAAAjF,KAAA,SAAA8f,GAAA,OAAA,OAAAA,EAAA1Z,KAAA0Z,EAAA3c,MAAA,IAAA,GAAA,MAAA2c,GAAAxY,cAquB3B1J,KAAKgY,uBAAuBb,GAruBD,KAAA,EAAA,KAAA,GAAA,MAAA+K,GAAAxY,cAsuBpB1J,KAAK4c,qBAAqBzF,GAtuBN,KAAA,EAAA,KAAA,GAAA,MAAA+K,GAAAtc,OAAA,SAAAsc,EAAAjU,GAAA,KAAA,GAAA,IAAA,MAAA,MAAAiU,GAAAvZ,SAAAsZ,EAAAjiB,UAAAoI,IAAA,yBAAAlE,MAAAmD,mBAAAM,KAAA,QAAAqQ,GA0uBVb,GA1uBU,GA2uB9B4K,GAKIlK,EAGAsK,CAnvB0B,OAAA9a,oBAAAjF,KAAA,SAAAggB,GAAA,OAAA,OAAAA,EAAA5Z,KAAA4Z,EAAA7c,MAAA,IAAA,GAAA,MAAA6c,GAAA1Y,cA2uBjB1J,KAAK0Z,aAAavC,GA3uBD,KAAA,EAAA,KAAA,GAAA,GA2uB9B4K,EA3uB8BK,EAAArU,GA4uBvB,MAAPgU,EA5uB8B,CAAAK,EAAA7c,KAAA,EAAA,OAAA,GA6uB5Bwc,EAAI5K,GAAG,KAAOA,EAAG,GA7uBW,CAAAiL,EAAA7c,KAAA,CAAA,OAAA,MAAA6c,GAAAxc,OAAA,SA8uBvBmc,EA9uBuB,KAAA,GAAA,MAgvB1BlK,GAAO5M,EAAEsK,MAAM8M,WAAWN,GAC9BA,EAAIhK,QAAUF,EAAKE,QAAQoC,OAAOhD,EAAG,GAAK4K,EAAI5K,GAAG,IACjD4K,EAAI5K,GAAKA,EACLgL,EAAUlX,EAAEsK,MAAM6E,UAAUvC,GAChCkK,EAAI1H,OAAS8H,EACbtK,EAAKgF,UAAYkF,EAAI5K,IACrBU,EAAKqE,MAAQ6F,EAAI5K,GACjB4K,EAAIlK,KAAOsK,EAvvBmBC,EAAA1Y,cAyvBvB1J,KAAK2X,aAAaE,GAzvBK,KAAA,GAAA,KAAA,IAAA,MAAAuK,GAAA1Y,cA0vBvB1J,KAAK2X,aAAaoK,GA1vBK,KAAA,GAAA,KAAA,IAAA,MA2vB1BlK,GAAKH,IACP1X,KAAK6Q,MAAMoH,sBAAsB8J,EAAI5K,IA5vBTiL,EAAAxc,OAAA,SA8vBvBmc,EA9vBuB,KAAA,IAAAK,EAAA7c,KAAA,EAAA,MAAA,KAAA,IAAA,MAAA6c,GAAAxc,OAAA,SAiwBzB,KAjwByB,KAAA,IAAA,IAAA,MAAA,MAAAwc,GAAAzZ,SAAAqP,EAAAhY,UAAAoI,IAAA,uBAAAlE,MAAAmD,mBAAAM,KAAA,QAAAiV,GAswBZzF,GAtwBY,GAuwB9B4K,GAKI7F,EAGAoG,CA/wB0B,OAAAjb,oBAAAjF,KAAA,SAAAmgB,GAAA,OAAA,OAAAA,EAAA/Z,KAAA+Z,EAAAhd,MAAA,IAAA,GAAA,MAAAgd,GAAA7Y,cAuwBjB1J,KAAK0Z,aAAavC,GAvwBD,KAAA,EAAA,KAAA,GAAA,GAuwB9B4K,EAvwB8BQ,EAAAxU,GAwwBvB,MAAPgU,EAxwB8B,CAAAQ,EAAAhd,KAAA,EAAA,OAAA,GAywBb,MAAfwc,EAAIhK,SAAoBgK,EAAI5K,GAAG,GAAK4K,EAAIhK,QAAQjZ,OAAS,IAAMqY,EAAG,GAzwBtC,CAAAoL,EAAAhd,KAAA,CAAA,OAAA,MAAAgd,GAAA3c,OAAA,SA0wBvBmc,EA1wBuB,KAAA,GAAA,MA4wB1B7F,GAAQjR,EAAEsK,MAAM8M,WAAWN,GAC/B7F,EAAMnE,QAAUgK,EAAIhK,QAAQoC,OAAOhD,EAAG,GAAK4K,EAAI5K,GAAG,GAAK,GACvD+E,EAAM/E,IAAMA,EAAG,GAAIA,EAAG,GAAK,GACvBmL,EAASrX,EAAEsK,MAAM6E,UAAU2H,GAC/B7F,EAAM7B,OAASiI,EACfP,EAAIlF,UAAYX,EAAM/E,IACtB4K,EAAI7F,MAAQA,EAAM/E,GAClB+E,EAAMrE,KAAOyK,EAnxBiBC,EAAA7Y,cAqxBvB1J,KAAK2X,aAAauE,GArxBK,KAAA,GAAA,KAAA,IAAA,MAAAqG,GAAA7Y,cAsxBvB1J,KAAK2X,aAAaoK,GAtxBK,KAAA,GAAA,KAAA,IAAA,MAuxB1BA,GAAIrK,IACN1X,KAAK6Q,MAAMoH,sBAAsBiE,EAAM/E,IAxxBXoL,EAAA3c,OAAA,SA0xBvBmc,EA1xBuB,KAAA,IAAAQ,EAAAhd,KAAA,EAAA,MAAA,KAAA,IAAA,MAAAgd,GAAA3c,OAAA,SA6xBzB,KA7xByB,KAAA,IAAA,IAAA,MAAA,MAAA2c,GAAA5Z,SAAAiU,EAAA5c,UAAAoI,IAAA,eAAAlE,MAAAmD,mBAAAM,KAAA,QAAA8P,GAgyBpBN,GAhyBoB,GAiyB9BhZ,GAKEqkB,EAEErT,EACAF,CAzyB0B,OAAA5H,oBAAAjF,KAAA,SAAAqgB,GAAA,OAAA,OAAAA,EAAAja,KAAAia,EAAAld,MAAA,IAAA,GAAA,MAAAkd,GAAA/Y,cAiyBnB1J,KAAKsQ,GAAGoS,KAAKvL,GAjyBM,KAAA,EAAA,KAAA,GAAA,GAiyB9BhZ,EAjyB8BskB,EAAA1U,GAkyBpB,MAAVoJ,EAAG,IAAmB,MAALhZ,EAlyBa,CAAAskB,EAAAld,KAAA,CAAA,OAAA,MAAAkd,GAAA7c,OAAA,SAmyBzBzH,EAnyByB,KAAA,GAAA,GAsyB5BqkB,EAAOrL,EAAG,GAAGwL,MAAM,OACnBH,EAAK1jB,OAAS,GAvyBc,CAAA2jB,EAAAld,KAAA,EAAA,OAAA,MAwyB1B4J,GAASqT,EAAK,GACdvT,EAAKhE,EAAEiE,OAAOC,GAAQxM,OAAOwU,GACjClI,EAAG7L,KAAOof,EAAK,GA1yBeC,EAAA/Y,cA2yBvB1J,KAAK2X,aAAa1I,GA3yBK,KAAA,GAAA,KAAA,IAAA,MAAAwT,GAAA7c,OAAA,SA4yBvBqJ,EA5yBuB,KAAA,IAAA,MA+yB9BnF,SAAQ8F,MAAM,yCA/yBgB6S,EAAA7c,OAAA,SAizBvB,KAjzBuB,KAAA,IAAA,IAAA,MAAA,MAAA6c,GAAA9Z,SAAA8O,EAAAzX,UAAAoI,IAAA,kBAAAlE,MAAAmD,mBAAAM,KAAA,QAAA2Y,GAqzBjBnJ,GArzBiB,MAAA9P,oBAAAjF,KAAA,SAAAwgB,GAAA,OAAA,OAAAA,EAAApa,KAAAoa,EAAArd,MAAA,IAAA,GAAA,MAAAqd,GAAAlZ,cAszB3B1J,KAAKsQ,GAALtQ,UAAemX,GAtzBY,KAAA,EAAA,KAAA,GAAA,IAAA,MAAA,MAAAyL,GAAAja,SAAA2X,EAAAtgB,UAAAoI,IAAA,WAAAlE,MAAAmD,mBAAAM,KAAA,QAAAkZ,GAwzBxBlc,GAxzBwB,GAyzB9Bke,EAzzB8B,OAAAxb,oBAAAjF,KAAA,SAAA0gB,GAAA,OAAA,OAAAA,EAAAta,KAAAsa,EAAAvd,MAAA,IAAA,GAAA,MAyzB9Bsd,IACF1L,IAAKxS,EAAM4H,MACXkM,MAAO9T,EAAM8T,OA3zBmBqK,EAAApZ,cA6zB3B1J,KAAK+iB,GAAG3D,IAAIyD,GA7zBe,KAAA,EAAA,KAAA,GAAA,IAAA,MAAA,MAAAC,GAAAna,SAAAkY,EAAA7gB,UAAAoI,IAAA,WAAAlE,MAAAmD,mBAAAM,KAAA,QAAA4Q,GA+zBxBhM,GA/zBwB,GAg0B9BvO,GACAya,CAj0B8B,OAAApR,oBAAAjF,KAAA,SAAA4gB,GAAA,OAAA,OAAAA,EAAAxa,KAAAwa,EAAAzd,MAAA,IAAA,GAAA,MAAAyd,GAAAtZ,cAg0BnB1J,KAAK+iB,GAAGL,MAAMnW,IAh0BK,KAAA,EAAA,KAAA,GAAA,MAg0B9BvO,GAh0B8BglB,EAAAjV,GAi0B9B0K,EAAa,MAALza,EAAY,KAAOA,EAAEya,MACpB,MAATA,IACFA,EAAQ,GAn0BwBuK,EAAApd,OAAA,UAs0BhC2G,KAAMA,EACNkM,MAAOA,GAv0ByB,KAAA,GAAA,IAAA,MAAA,MAAAuK,GAAAra,SAAA4P,EAAAvY,UAAAoI,IAAA,iBAAAlE,MAAAmD,mBAAAM,KAAA,QAAAsb,KAAA,GA20B9BC,EA30B8B,OAAA7b,oBAAAjF,KAAA,SAAA+gB,GAAA,OAAA,OAAAA,EAAA3a,KAAA2a,EAAA5d,MAAA,IAAA,GAAA,MA20B9B2d,MA30B8BC,EAAAzZ,cA40B3B1J,KAAK+iB,GAAGtD,QAAQzf,KAAM,KAAM,KAA5BqH,mBAAAM,KAAkC,QAAAmJ,GAAY9S,GAAZ,MAAAqJ,oBAAAjF,KAAA,SAAAghB,GAAA,OAAA,OAAAA,EAAA5a,KAAA4a,EAAA7d,MAAA,IAAA,GACvC2d,EAAY3iB,MACVgM,KAAMvO,EAAEmZ,GAAG,GACXsB,MAAOza,EAAEya,OAH4B,KAAA,GAAA,IAAA,MAAA,MAAA2K,GAAAza,SAAAmI,EAAA9Q,SA50BP,KAAA,EAAA,KAAA,GAAA,MAAAmjB,GAAAvd,OAAA,SAk1B3Bsd,EAl1B2B,KAAA,GAAA,IAAA,MAAA,MAAAC,GAAAxa,SAAAsa,EAAAjjB,UAAAoI,IAAA,cAAAlE,MAAAmD,mBAAAM,KAAA,QAAAmG,KAAA,GAq1B9BiV,EAr1B8B,OAAA1b,oBAAAjF,KAAA,SAAAihB,GAAA,OAAA,OAAAA,EAAA7a,KAAA6a,EAAA9d,MAAA,IAAA,GAAA,MAq1B9Bwd,MAr1B8BM,EAAA3Z,cAs1B3B1J,KAAK+iB,GAAGtD,QAAQzf,KAAM,KAAM,KAA5BqH,mBAAAM,KAAkC,QAAAgJ,GAAY3S,GAAZ,MAAAqJ,oBAAAjF,KAAA,SAAAkhB,GAAA,OAAA,OAAAA,EAAA9a,KAAA8a,EAAA/d,MAAA,IAAA,GACvCwd,EAAG/kB,EAAEmZ,GAAG,IAAMnZ,EAAEya,KADuB,KAAA,GAAA,IAAA,MAAA,MAAA6K,GAAA3a,SAAAgI,EAAA3Q,SAt1BP,KAAA,EAAA,KAAA,GAAA,MAAAqjB,GAAAzd,OAAA,SAy1B3Bmd,EAz1B2B,KAAA,GAAA,IAAA,MAAA,MAAAM,GAAA1a,SAAAmF,EAAA9N,UAAAoI,IAAA,gBAAAlE,MAAAmD,mBAAAM,KAAA,QAAAyI,GAy4BnBmT,GAz4BmB,GA84B9BrV,GAEAsV,EAh5B8B7W,EAAAC,EAAAC,EAAAE,EAAAD,EAi5BzB2W,EACHlX,EAIAmX,EAIEC,CA15B0B,OAAAtc,oBAAAjF,KAAA,SAAAwhB,GAAA,OAAA,OAAAA,EAAApb,KAAAob,EAAAre,MAAA,IAAA,GAAA,MA24BnB,OAAXge,IACFA,MAEErV,KA94B8B0V,EAAAla,cAg5Bf1J,KAAKijB,iBAh5BU,KAAA,EAAA,KAAA,GAg5B9BO,EAh5B8BI,EAAA7V,GAAApB,GAAA,EAAAC,GAAA,EAAAC,EAAA5H,OAAA2e,EAAApb,KAAA,EAAAuE,EAi5BbyW,EAj5BaxhB,OAAAC,WAAA,KAAA,GAAA,GAAA0K,GAAAG,EAAAC,EAAAxH,QAAAH,KAAA,CAAAwe,EAAAre,KAAA,EAAA,OAAA,GAi5BzBke,EAj5ByB3W,EAAA5I,MAk5B5BqI,EAAOkX,EAASlX,KACP,MAATA,EAn5B4B,CAAAqX,EAAAre,KAAA,EAAA,OAAA,MAAAqe,GAAAhe,OAAA,WAAA,GAAA,KAAA,IAAA,GAs5B5B8d,EAAWH,EAAQhX,IAAS,IAC5BmX,EAAW,GAv5BiB,CAAAE,EAAAre,KAAA,EAAA,OAAA,MAAAqe,GAAAla,cA05BJ1J,KAAK0Z,cAAcnN,EAAMmX,IA15BrB,KAAA,GAAA,KAAA,IA05B1BC,EA15B0BC,EAAA3V,GA25BV,MAAhB0V,IAEFD,EAAWC,EAAaxM,GAAG,GA75BC,KAAA,IAAA,MAAAyM,GAAAla,cAg6BzB1J,KAAKsQ,GAAGmP,QAAQzf,MAAOuM,EAAMmX,IAAYnX,EAAM6U,OAAOC,WAAtDha,mBAAAM,KAAkE,QAAAkc,GAAY5U,GAAZ,GAMjE9Q,GAOA2lB,EACAC,EAkCI7lB,CAhD6D,OAAAmJ,oBAAAjF,KAAA,SAAA4hB,GAAA,OAAA,OAAAA,EAAAxb,KAAAwb,EAAAze,MAAA,IAAA,GAAA,GACvE0J,EAAKhE,EAAEiE,OAAOD,EAAGE,QAAQC,OAAOH,GACd,WAAdA,EAAGE,OAFgE,CAAA6U,EAAAze,KAAA,CAAA,OAGrE2I,EAAK3N,KAAK0O,GAH2D+U,EAAAze,KAAA,EAAA,MAAA,KAAA,GAAA,KAIhD,MAAZ0J,EAAGiN,OAAiBjN,EAAGiN,MAAM,IAAMqH,EAAQtU,EAAGiN,MAAM,KAAO,IAJC,CAAA8H,EAAAze,KAAA,EAAA,OAMjEpH,EAAI8Q,EAOJ6U,GAAmB7U,GACnB8U,EAAW9U,EAAGiN,KAdmD,KAAA,GAAA,GAgBrD,MAAV/d,EAAE0Z,KAhB6D,CAAAmM,EAAAze,KAAA,EAAA,OAAA,MAiBjE0J,GAAG4I,KAAO,KACV3J,EAAK3N,KAAK0O,GACLhE,EAAEsK,MAAM2C,WAAW/Z,EAAEgZ,GAAIlI,EAAGkI,MAC/BhZ,EAAI8M,EAAEiE,OAAOD,EAAGE,QAAQC,OAAOjR,GAC/BA,EAAE+d,MAAQ4H,EAAgBA,EAAgBhlB,OAAS,GAAGqY,GACtDjJ,EAAK3N,KAAKpC,IAtBqD6lB,EAAApe,OAAA,QAAA,GAAA,KAAA,IAAA,MAAAoe,GAAAta,cA0BxD1J,KAAK0Z,aAAavb,EAAE0Z,MA1BoC,KAAA;AAAA,IAAA,IA4BnE,IAFA1Z,EA1BmE6lB,EAAAjW,GA4B5D+V,EAAgBhlB,OAAS,GAAKmM,EAAEsK,MAAMgH,UAAUpe,EAAG2lB,EAAgBA,EAAgBhlB,OAAS,GAAGub,SACpGyJ,EAAgBxb,KA7BiD,MA+B/DnK,EAAEgZ,GAAG,IAAMoM,EAAQplB,EAAEgZ,GAAG,KAAO,IA/BgC,CAAA6M,EAAAze,KAAA,EAAA,OAAA,MAiCjE0J,GAAG4I,KAAO5M,EAAEsK,MAAM6E,UAAUjc,GAC5B+P,EAAK3N,KAAK0O,GAlCuD+U,EAAApe,OAAA,QAAA,GAAA,KAAA,IAoCxDqF,EAAEsK,MAAMgH,UAAUpe,EAAG8Q,EAAGoL,SAEjCpL,EAAG4I,KAAO5I,EAAGoL,OACbnM,EAAK3N,KAAK0O,GACVA,EAAKhE,EAAEiE,OAAOD,EAAGE,QAAQC,OAAOjR,GAChC8Q,EAAGiN,MAAQ6H,EACPD,EAAgBhlB,OAAS,GAC3BgL,QAAQ8E,IAAI,mDAEdkV,GAAmB7U,KAGf/Q,EAAI+M,EAAEiE,OAAOD,EAAGE,QAAQC,OAAOjR,GACnCD,EAAEge,MAAQ4H,EAAgBA,EAAgBhlB,OAAS,GAAGqY,GACtDjZ,EAAE2Z,KAAO3Z,EAAEmc,OACXnM,EAAK3N,KAAKrC,GACV4lB,EAAgBvjB,KAAKpC,GApD4C,KAAA,IAAA6lB,EAAAze,KAAA,CAAA,MAAA,KAAA,IAAA,IAAA,MAAA,MAAAye,GAAArb,SAAAkb,EAAA7jB,SAh6BzC,KAAA,GAAA,KAAA,IAAA2M,GAAA,EAAAiX,EAAAre,KAAA,CAAA,MAAA,KAAA,IAAAqe,EAAAre,KAAA,EAAA,MAAA,KAAA,IAAAqe,EAAApb,KAAA,GAAAob,EAAAvT,GAAAuT,EAAA,SAAA,GAAAhX,GAAA,EAAAC,EAAA+W,EAAAvT,EAAA,KAAA,IAAAuT,EAAApb,KAAA,GAAAob,EAAApb,KAAA,IAAAmE,GAAAI,EAAAA,WAAAA,EAAAA,WAAA,KAAA,IAAA,GAAA6W,EAAApb,KAAA,IAAAoE,EAAA,CAAAgX,EAAAre,KAAA,EAAA,OAAA,KAAAsH,EAAA,KAAA,IAAA,MAAA+W,GAAAra,OAAA,GAAA,KAAA,IAAA,MAAAqa,GAAAra,OAAA,GAAA,KAAA,IAAA,MAAAqa,GAAAhe,OAAA,SA09B3BsI,EAAK7F,UA19BsB,KAAA,IAAA,IAAA,MAAA,MAAAub,GAAAjb,SAAAyH,EAAApQ,OAAA,EAAA,GAAA,GAAA,KAAA,GAAA,CAAA,GAAA,UAAAoI,IAAA,QAAAlE,MAAAmD,mBAAAM,KAAA,QAAA8T,KAAA,MAAApU,oBAAAjF,KAAA,SAAA6hB,GAAA,OAAA,OAAAA,EAAAzb,KAAAyb,EAAA1e,MAAA,IAAA,GAAA,MAAA0e,GAAAva,cAs/B3B1J,KAAKsQ,GAAGmL,QAt/BmB,KAAA,EAAA,KAAA,GAAA,MAAAwI,GAAAva,cAu/B3B1J,KAAK+iB,GAAGtH,QAv/BmB,KAAA,EAAA,KAAA,GAAA,MAAAwI,GAAAva,cAw/B3B1J,KAAKgQ,GAAGyL,QAx/BmB,KAAA,EAAA,KAAA,GAAA,IAAA,MAAA,MAAAwI,GAAAtb,SAAA8S,EAAAzb,WAAAke,IA2/BtCjT,GAAEiZ,YAAchG,QP2gJZiG,GAAG,SAAS7lB,EAAQU,EAAOJ,GQjlLjC,YRknLA,SAASuU,GAA2B5Q,EAAM1D,GAAQ,IAAK0D,EAAQ,KAAM,IAAI6Q,gBAAe,4DAAgE,QAAOvU,GAAyB,gBAATA,IAAqC,kBAATA,GAA8B0D,EAAP1D,EAElO,QAASwU,GAAUC,EAAUC,GAAc,GAA0B,kBAAfA,IAA4C,OAAfA,EAAuB,KAAM,IAAIlJ,WAAU,iEAAoEkJ,GAAeD,GAAS9S,UAAYkC,OAAOC,OAAO4Q,GAAcA,EAAW/S,WAAa2B,aAAe+B,MAAOoP,EAAU3I,YAAY,EAAOE,UAAU,EAAMD,cAAc,KAAe2I,IAAY7Q,OAAOkF,eAAiBlF,OAAOkF,eAAe0L,EAAUC,GAAcD,EAASzL,UAAY0L,GAEje,QAASrJ,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAIC,WAAU,qCAVhH,GAAItI,GAA4B,kBAAXC,SAAoD,gBAApBA,QAAOC,SAAwB,SAAUC,GAAO,aAAcA,IAAS,SAAUA,GAAO,MAAOA,IAAyB,kBAAXF,SAAyBE,EAAIC,cAAgBH,OAAS,eAAkBE,IAEtOsR,EAAO,QAASC,GAAItL,EAAQuL,EAAUC,GAA2B,OAAXxL,IAAiBA,EAASyL,SAASpT,UAAW,IAAIqT,GAAOnR,OAAOoR,yBAAyB3L,EAAQuL,EAAW,IAAazO,SAAT4O,EAAoB,CAAE,GAAIE,GAASrR,OAAOsR,eAAe7L,EAAS,OAAe,QAAX4L,EAA0B9O,OAA2BwO,EAAIM,EAAQL,EAAUC,GAAoB,GAAI,SAAWE,GAAQ,MAAOA,GAAK3P,KAAgB,IAAI+P,GAASJ,EAAKJ,GAAK,OAAexO,UAAXgP,EAA+BhP,OAAoBgP,EAAOpV,KAAK8U,IAExdrJ,EAAe,WAAc,QAASC,GAAiBC,EAAQC,GAAS,IAAK,GAAIlM,GAAI,EAAGA,EAAIkM,EAAM3L,OAAQP,IAAK,CAAE,GAAImM,GAAaD,EAAMlM,EAAImM,GAAWC,WAAaD,EAAWC,aAAc,EAAOD,EAAWE,cAAe,EAAU,SAAWF,KAAYA,EAAWG,UAAW,GAAMnI,OAAOoI,eAAeN,EAAQE,EAAWtC,IAAKsC,IAAiB,MAAO,UAAUN,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAYR,EAAiBH,EAAY5J,UAAWuK,GAAiBC,GAAaT,EAAiBH,EAAaY,GAAqBZ,KQxlLhiBpL,GAAOJ,QAAU,SAAUqM,GA2TzB,QAASoX,GAAYlkB,GACnB,GAAIsU,KACJ,KAAK,GAAIrK,KAAOjK,GACdsU,EAAErK,GAAOjK,EAAEiK,EAEb,OAAOqK,GAQT,QAAS4I,GAAeld,GAKtB,MAJAA,GAAIkkB,EAAWlkB,GACE,MAAbA,EAAE4Z,UACJ5Z,EAAE4Z,QAAU5Z,EAAE4Z,QAAQ/I,IAAI,SAAUyD,GAAK,MAAOA,MAE3CtU,EAQT,QAASimB,GAAS/lB,EAAGgmB,GACnB,MAAOhmB,GAAE,GAAKgmB,EAAE,IAAOhmB,EAAE,KAAOgmB,EAAE,KAAOhmB,EAAE,GAAKgmB,EAAE,IAAMtiB,EAAO1D,EAAE,IAAT0D,EAAqBsiB,EAAE,KAIjF,QAASC,GAAiBtD,EAAKe,GAC7B,MAAOf,GAAIxW,OAAO,KAAOuX,EAAI,IAAMf,EAAIxW,OAAO,IAAMuX,EAAI,IAAMA,EAAI,GAAKf,EAAIxW,OAAO,IAAMwW,EAAIliB,QAAU,GAIxG,QAASoZ,GAAYqM,EAAKC,GACxB,MAAW,OAAPD,GAAsB,MAAPC,EACVD,IAAQC,EAERD,EAAI,KAAOC,EAAI,IAAMD,EAAI,KAAOC,EAAI,GAK/C,QAASjI,GAAWtN,EAAIkI,GACtB,MAAU,OAANA,GAAoB,MAANlI,EACTkI,IAAOlI,EAEVkI,EAAG,KAAOlI,EAAGkI,GAAG,GACA,MAAdlI,EAAG8I,QACEZ,EAAG,KAAOlI,EAAGkI,GAAG,GAEhBA,EAAG,IAAMlI,EAAGkI,GAAG,IAAMA,EAAG,GAAKlI,EAAGkI,GAAG,GAAKlI,EAAG8I,QAAQjZ,OAJ9D,OAWJ,QAASsb,GAAWnL,GAClB,MAAkB,OAAdA,EAAG8I,SAAyC,IAAtB9I,EAAG8I,QAAQjZ,OAC5BmQ,EAAGkI,IAEFlI,EAAGkI,GAAG,GAAIlI,EAAGkI,GAAG,GAAKlI,EAAG8I,QAAQjZ,OAAS,GAKrD,QAAS2lB,GAAqBzmB,GAE5B,IAAK,GADDK,GAAI,GAAIgC,OAAMrC,GACTO,EAAI,EAAGA,EAAIF,EAAES,OAAQP,IAC5BF,EAAEE,IACA4Y,IAAK,KAAM,MAGf,OAAO9Y,GAGT,QAASqmB,GAAyBC,GAAO,GAYjCC,GAZiC,SAAAC,GAarC,QAAAD,GAAaE,EAAMC,GAAM7a,EAAAlK,KAAA4kB,EAAA,IAAAhJ,GAAAzI,EAAAnT,KAAA0C,OAAAsR,eAAA4Q,GAAA/lB,KAAAmB,KAEjB8kB,EAAMC,GAFW,OAGvBnJ,GAAKoJ,YAAcP,EAAoB,GACvC7I,EAAKqJ,WAAaR,EAAoB,IAJf7I,EAbY,MAAAvI,GAAAuR,EAAAC,GAAAva,EAAAsa,IAAAxc,IAAA,OAAAlE,MAAAmD,mBAAAM,KAAA,QAAA+a,GAmB7BvL,EAAI+N,GAnByB,GAoB/B3mB,GAAGN,EAcHE,CAlC+B,OAAAkJ,oBAAAjF,KAAA,SAAAqM,GAAA,OAAA,OAAAA,EAAAjG,KAAAiG,EAAAlJ,MAAA,IAAA,GAqB9BhH,EAAIyB,KAAKilB,WAAWnmB,OAAS,CArBC,KAAA,GAAA,KAqBEP,GAAK,GArBP,CAAAkQ,EAAAlJ,KAAA,EAAA,OAAA,GAsBjCtH,EAAI+B,KAAKilB,WAAW1mB,GAEhBN,EAAEkZ,GAAG,KAAOA,EAAG,IAAMlZ,EAAEkZ,GAAG,KAAOA,EAAG,GAxBP,CAAA1I,EAAAlJ,KAAA,CAAA,OA2B/B,KAAOhH,EAAIyB,KAAKilB,WAAWnmB,OAAS,EAAGP,IACrCyB,KAAKilB,WAAW1mB,GAAKyB,KAAKilB,WAAW1mB,EAAI,EA5BZ,OA8B/ByB,MAAKilB,WAAWjlB,KAAKilB,WAAWnmB,OAAS,GAAKb,EA9BfwQ,EAAA7I,OAAA,SA+BxB3H,EA/BwB,KAAA,GAqBUM,IArBVkQ,EAAAlJ,KAAA,CAAA,MAAA,KAAA,IAmC9BhH,EAAIyB,KAAKglB,YAAYlmB,OAAS,CAnCA,KAAA,IAAA,KAmCGP,GAAK,GAnCR,CAAAkQ,EAAAlJ,KAAA,EAAA,OAAA,GAoCjCtH,EAAI+B,KAAKglB,YAAYzmB,GACjBN,EAAEkZ,GAAG,KAAOA,EAAG,IAAMlZ,EAAEkZ,GAAG,KAAOA,EAAG,GArCP,CAAA1I,EAAAlJ,KAAA,EAAA,OAAA,MAsC/BpH,GAAIF,EAtC2BwQ,EAAA7I,OAAA,QAAA,GAAA,KAAA,IAmCWrH,IAnCXkQ,EAAAlJ,KAAA,EAAA,MAAA,KAAA,IAAA,KA0C3B,EAAJhH,GAAyB0G,SAAhBigB,GA1CsB,CAAAzW,EAAAlJ,KAAA,EAAA,OAAA,MAAAkJ,GAAA/E,cAAA8J,EAAA9Q,OAAAsR,eAAA4Q,EAAApkB,WAAA,OAAAR,MAAAnB,KAAAmB,KA6CXmX,GA7CW,KAAA,GAAA,KAAA,IA6CjChZ,EA7CiCsQ,EAAAV,EAAA,KAAA,IA+CnC,GAAS,MAAL5P,EAAW,CACb,IAAKI,EAAI,EAAGA,EAAIyB,KAAKilB,WAAWnmB,OAAS,EAAGP,IAC1CyB,KAAKilB,WAAW1mB,GAAKyB,KAAKilB,WAAW1mB,EAAI,EAE3CyB,MAAKilB,WAAWjlB,KAAKilB,WAAWnmB,OAAS,GAAKX,EAnDb,MAAAsQ,GAAA7I,OAAA,SAqD5BzH,EArD4B,KAAA,IAAA,IAAA,MAAA,MAAAsQ,GAAA9F,SAAA+Z,EAAA1iB,UAAAoI,IAAA,MAAAlE,MAAAmD,mBAAAM,KAAA,QAAAyX,GAuD9BjhB,GAvD8B,GAwD/BgZ,GACA5Y,EAAGN,EAgBDknB,CAzE6B,OAAA9d,oBAAAjF,KAAA,SAAA6N,GAAA,OAAA,OAAAA,EAAAzH,KAAAyH,EAAA1K,MAAA,IAAA,GAwD/B4R,EAAKhZ,EAAEgZ,GAEN5Y,EAAIyB,KAAKglB,YAAYlmB,OAAS,CA1DA,KAAA,GAAA,KA0DGP,GAAK,GA1DR,CAAA0R,EAAA1K,KAAA,EAAA,OAAA,GA2DjCtH,EAAI+B,KAAKglB,YAAYzmB,GACjBN,EAAEkZ,GAAG,KAAOA,EAAG,IAAMlZ,EAAEkZ,GAAG,KAAOA,EAAG,GA5DP,CAAAlH,EAAA1K,KAAA,CAAA,OA+D/B,KAAOhH,EAAIyB,KAAKglB,YAAYlmB,OAAS,EAAGP,IACtCyB,KAAKglB,YAAYzmB,GAAKyB,KAAKglB,YAAYzmB,EAAI,EAhEd,OAkE/ByB,MAAKglB,YAAYhlB,KAAKglB,YAAYlmB,OAAS,GAAKX,EAlEjB8R,EAAArK,OAAA,QAAA,GAAA,KAAA,GA0DWrH,IA1DX0R,EAAA1K,KAAA,CAAA,MAAA,KAAA,IAAA,KAsE3B,EAAJhH,GAtE+B,CAAA0R,EAAA1K,KAAA,EAAA,OAAA,GAyE7B4f,EAAQnlB,KAAKglB,YAAY,GACT,OAAhBG,EAAMhO,GAAG,GA1EoB,CAAAlH,EAAA1K,KAAA,EAAA,OAAA,MAAA0K,GAAAvG,cAAA8J,EAAA9Q,OAAAsR,eAAA4Q,EAAApkB,WAAA,MAAAR,MAAAnB,KAAAmB,KA2EdmlB,GA3Ec,KAAA,GAAA,KAAA,IA8EjC,IAAK5mB,EAAI,EAAGA,EAAIyB,KAAKglB,YAAYlmB,OAAS,EAAGP,IAC3CyB,KAAKglB,YAAYzmB,GAAKyB,KAAKglB,YAAYzmB,EAAI,EAE7CyB,MAAKglB,YAAYhlB,KAAKglB,YAAYlmB,OAAS,GAAKX,CAjFf,KAAA,IAqFnC,IAAKI,EAAI,EAAGA,EAAIyB,KAAKilB,WAAWnmB,OAAS,EAAGP,IAC1CN,EAAI+B,KAAKilB,WAAW1mB,EAAI,GACpBN,EAAEkZ,GAAG,KAAOA,EAAG,IAAMlZ,EAAEkZ,GAAG,KAAOA,EAAG,GACtCnX,KAAKilB,WAAW1mB,GAAKJ,EAErB6B,KAAKilB,WAAW1mB,GAAKN,CAGzB+B,MAAKilB,WAAWjlB,KAAKilB,WAAWnmB,OAAS,GAAKX,CA7FX,KAAA,IAAA,IAAA,MAAA,MAAA8R,GAAAtH,SAAAyW,EAAApf,UAAAoI,IAAA,SAAAlE,MAAAmD,mBAAAM,KAAA,QAAAyd,GA+F3BjO,GA/F2B,GAgG/B5Y,GAAGN,CAhG4B,OAAAoJ,oBAAAjF,KAAA,SAAA2O,GAAA,OAAA,OAAAA,EAAAvI,KAAAuI,EAAAxL,MAAA,IAAA,GAiGnC,IAAKhH,EAAI,EAAGA,EAAIyB,KAAKilB,WAAWnmB,OAAQP,IACtCN,EAAI+B,KAAKilB,WAAW1mB,GAChBN,EAAEkZ,GAAG,KAAOA,EAAG,IAAMlZ,EAAEkZ,GAAG,KAAOA,EAAG,KACtCnX,KAAKilB,WAAW1mB,IACd4Y,IAAK,KAAM,OArGkB,OAAApG,GAAArH,cAyG5B1J,KAAKyb,QAzGuB,KAAA,EAAA,KAAA,GAAA,MAAA1K,GAAArH,cAAA8J,EAAA9Q,OAAAsR,eAAA4Q,EAAApkB,WAAA,SAAAR,MAAAnB,KAAAmB,KA0GfmX,GA1Ge,KAAA,EAAA,KAAA,GAAA,IAAA,MAAA,MAAApG,GAAApI,SAAAyc,EAAAplB,UAAAoI,IAAA,qBAAAlE,MAAAmD,mBAAAM,KAAA,QAAA0d,GA4GflO,GA5Ge,GA6G/BhZ,GA7G+BmnB,EAAAhlB,SAAA,OAAA+G,oBAAAjF,KAAA,SAAAwO,GAAA,OAAA,OAAAA,EAAApI,KAAAoI,EAAArL,MAAA,IAAA,GAAA,MAAAqL,GAAAlH,cA6GpB1J,KAAK0iB,KAAKvL,GAAI,GA7GM,KAAA,EAAA,KAAA,GAAA,GA6G/BhZ,EA7G+ByS,EAAA7C,GA8G1B,MAAL5P,EA9G+B,CAAAyS,EAAArL,KAAA,CAAA,OAAA,MAAAqL,GAAAhL,OAAA,SA+G1BzH,EA/G0B,KAAA,GAAA,MAAAyS,GAAAlH,cAiH1B1J,KAAKyb,QAjHqB,KAAA,EAAA,KAAA,GAAA,MAAA7K,GAAAlH,cAkHnB8J,EAAA9Q,OAAAsR,eAAA4Q,EAAApkB,WAAA,qBAAAR,MAAyBS,MAAMT,KAA/BslB,GAlHmB,KAAA,EAAA,KAAA,GAAA,MAAA1U,GAAAhL,OAAA,SAAAgL,EAAAT,GAAA,KAAA,GAAA,IAAA,MAAA,MAAAS,GAAAjI,SAAA0c,EAAArlB,UAAAoI,IAAA,qBAAAlE,MAAAmD,mBAAAM,KAAA,QAAAsX,GAqHf9H,GArHe,GAsH/BhZ,GAtH+BonB,EAAAjlB,SAAA,OAAA+G,oBAAAjF,KAAA,SAAAoX,GAAA,OAAA,OAAAA,EAAAhR,KAAAgR,EAAAjU,MAAA,IAAA,GAAA,MAAAiU,GAAA9P,cAsHpB1J,KAAK0iB,KAAKvL,GAAI,GAtHM,KAAA,EAAA,KAAA,GAAA,GAsH/BhZ,EAtH+Bqb,EAAAzL,GAuH1B,MAAL5P,EAvH+B,CAAAqb,EAAAjU,KAAA,CAAA,OAAA,MAAAiU,GAAA5T,OAAA,SAwH1BzH,EAxH0B,KAAA,GAAA,MAAAqb,GAAA9P,cA0H1B1J,KAAKyb,QA1HqB,KAAA,EAAA,KAAA,GAAA,MAAAjC,GAAA9P,cA2HnB8J,EAAA9Q,OAAAsR,eAAA4Q,EAAApkB,WAAA,qBAAAR,MAAyBS,MAAMT,KAA/BulB,GA3HmB,KAAA,EAAA,KAAA,GAAA,MAAA/L,GAAA5T,OAAA,SAAA4T,EAAArJ,GAAA,KAAA,GAAA,IAAA,MAAA,MAAAqJ,GAAA7Q,SAAAsW,EAAAjf,UAAAoI,IAAA,WAAAlE,MAAAmD,mBAAAM,KAAA,QAAA2X,KAAA,GAAAkG,GAAAllB,SAAA,OAAA+G,oBAAAjF,KAAA,SAAA2X,GAAA,OAAA,OAAAA,EAAAvR,KAAAuR,EAAAxU,MAAA,IAAA,GAAA,MAAAwU,GAAArQ,cA+H5B1J,KAAKyb,QA/HuB,KAAA,EAAA,KAAA,GAAA,MAAA1B,GAAArQ,cAgIrB8J,EAAA9Q,OAAAsR,eAAA4Q,EAAApkB,WAAA,WAAAR,MAAeS,MAAMT,KAArBwlB,GAhIqB,KAAA,EAAA,KAAA,GAAA,MAAAzL,GAAAnU,OAAA,SAAAmU,EAAA9L,GAAA,KAAA,GAAA,IAAA,MAAA,MAAA8L,GAAApR,SAAA2W,EAAAtf,UAAAoI,IAAA,WAAAlE,MAAAmD,mBAAAM,KAAA,QAAA0X,KAAA,GAAAoG,GAAAnlB,SAAA,OAAA+G,oBAAAjF,KAAA,SAAA4Y,GAAA,OAAA,OAAAA,EAAAxS,KAAAwS,EAAAzV,MAAA,IAAA,GAAA,MAAAyV,GAAAtR,cAmI5B1J,KAAKyb,QAnIuB,KAAA,EAAA,KAAA,GAAA,MAAAT,GAAAtR,cAoIrB8J,EAAA9Q,OAAAsR,eAAA4Q,EAAApkB,WAAA,WAAAR,MAAeS,MAAMT,KAArBylB,GApIqB,KAAA,EAAA,KAAA,GAAA,MAAAzK,GAAApV,OAAA,SAAAoV,EAAA/M,GAAA,KAAA,GAAA,IAAA,MAAA,MAAA+M,GAAArS,SAAA0W,EAAArf,UAAAoI,IAAA,UAAAlE,MAAAmD,mBAAAM,KAAA,QAAA8X,KAAA,GAAAiG,GAAAplB,SAAA,OAAA+G,oBAAAjF,KAAA,SAAAoZ,GAAA,OAAA,OAAAA,EAAAhT,KAAAgT,EAAAjW,MAAA,IAAA,GAAA,MAAAiW,GAAA9R,cAuI5B1J,KAAKyb,QAvIuB,KAAA,EAAA,KAAA,GAAA,MAAAD,GAAA9R,cAwI5B8J,EAAA9Q,OAAAsR,eAAA4Q,EAAApkB,WAAA,UAAAR,MAAcS,MAAMT,KAApB0lB,GAxI4B,KAAA,EAAA,KAAA,GAAA,IAAA,MAAA,MAAAlK,GAAA7S,SAAA8W,EAAAzf,UAAAoI,IAAA,QAAAlE,MAAAmD,mBAAAM,KAAA,QAAA8T,KAAA,GA2I1Bld,GACH4mB,CA5I6B,OAAA9d,oBAAAjF,KAAA,SAAA6d,GAAA,OAAA,OAAAA,EAAAzX,KAAAyX,EAAA1a,MAAA,IAAA,GA2I1BhH,EAAI,CA3IsB,KAAA,GAAA,KA2InBA,EAAIyB,KAAKglB,YAAYlmB,QA3IF,CAAAmhB,EAAA1a,KAAA,CAAA,OAAA,GA4I7B4f,EAAQnlB,KAAKglB,YAAYzmB,GACT,OAAhB4mB,EAAMhO,GAAG,GA7IoB,CAAA8I,EAAA1a,KAAA,CAAA,OAAA,MAAA0a,GAAAvW,cAAA8J,EAAA9Q,OAAAsR,eAAA4Q,EAAApkB,WAAA,MAAAR,MAAAnB,KAAAmB,KA8IdmlB,GA9Ic,KAAA,EAAA,KAAA,GA+I/BnlB,KAAKglB,YAAYzmB,IACf4Y,IAAK,KAAM,MAhJkB,KAAA,GA2IU5Y,IA3IV0hB,EAAA1a,KAAA,CAAA,MAAA,KAAA,GAAA,IAAA,MAAA,MAAA0a,GAAAtX,SAAA8S,EAAAzb,WAAA4kB,GAYPD,EA0IhC,OAAOC,GA/hBT3Z,EAAEsK,QADqC,IAGjCoQ,GAHiC,WAIrC,QAAAA,KAAezb,EAAAlK,KAAA2lB,GACb3lB,KAAK4lB,kBAL8B,MAAAtb,GAAAqb,IAAAvd,IAAA,UAAAlE,MAAA,WAQnClE,KAAK4lB,eAAiB,QARaxd,IAAA,mBAAAlE,MAAA,SAanB1F,GAChBwB,KAAK4lB,eAAerlB,KAAK/B,MAdU4J,IAAA,sBAAAlE,MAAA,SAgBhB1F,GACnBwB,KAAK4lB,eAAiB5lB,KAAK4lB,eAAenZ,OAAO,SAAUoZ,GACzD,MAAOrnB,KAAMqnB,OAlBoBzd,IAAA,0BAAAlE,MAAA,WAsBnClE,KAAK4lB,qBAtB8Bxd,IAAA,qBAAAlE,MAAA,SAwBjB4hB,GAClB,IAAK,GAAIvnB,GAAI,EAAGA,EAAIyB,KAAK4lB,eAAe9mB,OAAQP,IAC9C,IACEyB,KAAK4lB,eAAernB,GAAGunB,GACvB,MAAOhoB,GACPgM,QAAQ8F,MAAM,2CA7BiB+V,IAkCvC1a,GAAEsK,MAAMoQ,qBAAuBA,CAlCQ,IAoCjCI,GApCiC,SAAAC,GAkDrC,QAAAD,GAAaE,GAA0B/b,EAAAlK,KAAA+lB,EAAA,IAAAvW,GAAA2D,EAAAnT,KAAA0C,OAAAsR,eAAA+R,GAAAlnB,KAAAmB,MAAA,OAErCwP,GAAK0W,WACL1W,EAAK2W,SAAW,EAChB3W,EAAKyW,QAAUA,EAJsBzW,EAlDF,MAAA6D,GAAA0S,EAAAC,GAAA1b,EAAAyb,IAAA3d,IAAA,UAAAlE,MAAA,WAyDnCsP,EAAA9Q,OAAAsR,eAAA+R,EAAAvlB,WAAA,UAAAR,MAAAnB,KAAAmB,MACAA,KAAKkmB,QAAU,KACflmB,KAAKmmB,SAAW,KAChBnmB,KAAKimB,QAAU,QA5DoB7d,IAAA,aAAAlE,MAAA,SAkEzB+K,GACNjP,KAAKmmB,UAAY,EACnBnmB,KAAKimB,QAAQhX,GAEbjP,KAAKkmB,QAAQ3lB,KAAK0O,MAtEe7G,IAAA,0BAAAlE,MAAA,SA8EZ2K,GACvB7O,KAAKmmB,WACLtX,EAAIG,IAAI/D,EAAEsK,MAAM8F,eAAe5X,QAAQzD,KAAKimB,YAhFT7d,IAAA,WAAAlE,MAAAmD,mBAAAM,KAAA,QAAAye,GAkFzB3L,EAAajc,EAAG4B,GAlFS,GAmF1BimB,GAqBLC,EASO/nB,EACHJ,EAEEob,EAQE1B,EAoBJkK,EACAwE,CAjJ2B,OAAAlf,oBAAAjF,KAAA,SAAAyL,GAAA,OAAA,OAAAA,EAAArF,KAAAqF,EAAAtI,MAAA,IAAA,GAAA,MAmF1B8gB,GAnF0B,SAmFVtmB,GAGvB,IADA,GAAIkE,MACGlE,EAAMjB,OAAS,GACpB,IAAK,GAAIP,GAAI,EAAGA,EAAIwB,EAAMjB,OAAQP,IAAK,CAErC,IAAK,GADDioB,IAAc,EACTC,EAAI,EAAGA,EAAI1mB,EAAMjB,OAAQ2nB,IAChC,GAAIxb,EAAEsK,MAAMgH,UAAUxc,EAAM0mB,GAAI1mB,EAAMxB,GAAGsZ,MAAO,CAE9C2O,GAAc,CACd,OAGAA,IACFviB,EAAO1D,KAAKR,EAAMoa,OAAO5b,EAAG,GAAG,IAC/BA,KAIN,MAAO0F,IAELqiB,EAAStmB,KAAKkmB,QAAQpnB,OAxGS+O,EAAAnE,cA0G5BlL,EAAEiC,MAAMga,EAAara,GA1GO,KAAA,EAAA,KAAA,GAAA,GA4GnCJ,KAAKkmB,QAAQ/L,OAAOmM,GAChBtmB,KAAKmmB,SAAW,GAAGnmB,KAAKmmB,aAEN,IAAlBnmB,KAAKmmB,UAAkBnmB,KAAKkmB,QAAQpnB,OAAS,GA/Gd,CAAA+O,EAAAtI,KAAA,EAAA,OAiHxBhH,EAAI,CAjHoB,KAAA,GAAA,KAiHjBA,EAAIyB,KAAKkmB,QAAQpnB,QAjHA,CAAA+O,EAAAtI,KAAA,EAAA,OAAA,GAkH3BpH,EAAI6B,KAAKkmB,QAAQ3nB,GACJ,WAAbJ,EAAEgR,OAnHyB,CAAAtB,EAAAtI,KAAA,EAAA,OAAA,MAAAsI,GAAAnE,cAoHb+Q,EAAYf,aAAavb,EAAEgZ,IApHd,KAAA,GAAA,KAAA,IAAA,GAoHzBoC,EApHyB1L,EAAAI,GAqHxBhD,EAAEsK,MAAM2C,WAAWqB,EAAGpC,GAAIhZ,EAAEgZ,IArHJ,CAAAtJ,EAAAtI,KAAA,EAAA,OAuH3BpH,EAAE0Z,MAAQ1Z,EAAEgZ,GAAG,GAAIhZ,EAAEgZ,GAAG,GAAK,GAvHFtJ,EAAAtI,KAAA,EAAA,MAAA,KAAA,IAAA,GAwHP,MAAXgU,EAAG1B,KAxHe,CAAAhK,EAAAtI,KAAA,EAAA,OAyH3BpH,EAAE0Z,KAAO,KAzHkBhK,EAAAtI,KAAA,EAAA,MAAA,KAAA,IAAA,MAAAsI,GAAAnE,cA4HT+Q,EAAYf,aAAaH,EAAG1B,MA5HnB,KAAA,GAAA,KAAA,IA4HvBA,EA5HuBhK,EAAAsC,EAAA,KAAA,IAAA,GA6HJ,MAAhB0H,EAAKC,QA7He,CAAAjK,EAAAtI,KAAA,EAAA,OAAA,GA8HR,MAAbsS,EAAKA,KA9HgB,CAAAhK,EAAAtI,KAAA,EAAA,OAAA,MAAAsI,GAAAnE,cA+HT+Q,EAAYf,aAAa7B,EAAKA,MA/HrB,KAAA,GAAA,KAAA,IA+HvBA,EA/HuBhK,EAAAwC,GAAAxC,EAAAtI,KAAA,EAAA,MAAA,KAAA,IAAA,MAiIvBsS,GAAO,KAjIgBhK,EAAAjI,OAAA,QAAA,GAAA,KAAA,IAAAiI,EAAAtI,KAAA,EAAA,MAAA,KAAA,IAqI3BpH,EAAE0Z,KAAe,MAARA,EAAe5M,EAAEsK,MAAM6E,UAAUvC,GAAQ,IArIvB,KAAA,IAiHQtZ,IAjHRsP,EAAAtI,KAAA,CAAA,MAAA,KAAA,IA2IR,MAArBvF,KAAK0mB,cACP1mB,KAAK0mB,eAEe,IAAlB1mB,KAAKmmB,WAEHpE,KACAwE,KACJvmB,KAAKkmB,QAAQziB,QAAQ,SAAUtF,GACZ,WAAbA,EAAEgR,OACJoX,EAAKhmB,KAAKpC,GAEV4jB,EAAIxhB,KAAKpC,KAIb4jB,EAAMsE,EAAetE,GACrBA,EAAIte,QAAQzD,KAAKimB,SACjBM,EAAK9iB,QAAQzD,KAAKimB,SAClBjmB,KAAKkmB,WA7J0B,KAAA,IAAA,IAAA,MAAA,MAAArY,GAAAlF,SAAAyd,EAAApmB,UAAAoI,IAAA,iBAAAlE,MAAA,SAsKrBlG,GAEd,IAAK,GADD6Q,GAAM7O,KAAKkmB,QAAQ/L,OAAOna,KAAKkmB,QAAQpnB,OAASd,GAC3CqY,EAAM,EAAGA,EAAMxH,EAAI/P,OAAQuX,IAAO,CACzC,GAAIpH,GAAKJ,EAAIwH,EACb,IAAkB,WAAdpH,EAAGE,OAmBL,KAAM,IAAI1Q,OAAM,6BAlBhB,KAAK,GAAIF,GAAIyB,KAAKkmB,QAAQpnB,OAAS,EAAGP,GAAK,EAAGA,IAAK,CACjD,GAAIooB,GAAI3mB,KAAKkmB,QAAQ3nB,EAGJ,YAAbooB,EAAExX,SACAlE,EAAEsK,MAAMgH,UAAUoK,EAAG1X,EAAG4I,OAE1B8O,EAAEzK,MAAQjN,EAAGkI,GAEblI,EAAG4I,KAAO8O,EAAE9O,MACH5M,EAAEsK,MAAM2C,WAAWyO,EAAExP,GAAIlI,EAAGiN,SAErCyK,EAAE9O,KAAO5M,EAAEsK,MAAM6E,UAAUnL,GAC3BA,EAAGiN,MAAQyK,EAAEzK,SAQvBlc,KAAK4mB,eAAe5oB,MAhMeoK,IAAA,iBAAAlE,MAAA,SAqMrBlG,EAAG6oB,GAEjB,IAAK,GADDhY,GAAM7O,KAAKkmB,QAAQ/L,OAAOna,KAAKkmB,QAAQpnB,OAASd,GAC3CyoB,EAAI,EAAGA,EAAI5X,EAAI/P,OAAQ2nB,IAAK,CACnC,GAAIzF,GAAMnS,EAAI4X,EACd,IAAmB,WAAfzF,EAAI7R,OAWN,KAAM,IAAI1Q,OAAM,6BAVhB,IAAe,MAAXooB,EACF,IAAK,GAAItoB,GAAI,EAAGA,EAAIyB,KAAKkmB,QAAQpnB,OAAQP,IAAK,CAC5C,GAAIooB,GAAI3mB,KAAKkmB,QAAQ3nB,EAEJ,YAAbooB,EAAExX,QAAuBlE,EAAEsK,MAAM2C,WAAW8I,EAAIxW,OAAQmc,EAAE9O,QAC5D8O,EAAE9O,KAAOgP,IAQnB7mB,KAAK4mB,eAAe5oB,MAvNeoK,IAAA,iBAAAlE,MAAA,WA6NnC,QAASmiB,GAAgBtmB,GAEvB,IADA,GAAIkE,MACGlE,EAAMjB,OAAS,GACpB,IAAK,GAAIP,GAAI,EAAGA,EAAIwB,EAAMjB,OAAQP,IAAK,CAErC,IAAK,GADDioB,IAAc,EACTC,EAAI,EAAGA,EAAI1mB,EAAMjB,OAAQ2nB,IAChC,GAAIxb,EAAEsK,MAAMgH,UAAUxc,EAAM0mB,GAAI1mB,EAAMxB,GAAGsZ,MAAO,CAE9C2O,GAAc,CACd,OAGAA,IACFviB,EAAO1D,KAAKR,EAAMoa,OAAO5b,EAAG,GAAG,IAC/BA,KAIN,MAAO0F,GAGT,GADIjE,KAAKmmB,SAAW,GAAGnmB,KAAKmmB,WACN,IAAlBnmB,KAAKmmB,UAAkBnmB,KAAKkmB,QAAQpnB,OAAS,EAAG,CAClD,GAAIijB,MACAwE,IACJvmB,MAAKkmB,QAAQziB,QAAQ,SAAUtF,GACZ,WAAbA,EAAEgR,OACJoX,EAAKhmB,KAAKpC,GAEV4jB,EAAIxhB,KAAKpC,KAGb4jB,EAAMsE,EAAetE,GACrBA,EAAIte,QAAQzD,KAAKimB,SACjBM,EAAK9iB,QAAQzD,KAAKimB,SAClBjmB,KAAKkmB,gBA/P4BH,GAoCZJ,EA+N3B1a,GAAEsK,MAAMwQ,aAAeA,CAnQgB,IAgRjCe,GAOJ,QAAAA,GAAaC,GACX,GADgB7c,EAAAlK,KAAA8mB,GACE,MAAdC,EAAI5X,QACU,MAAhB4X,EAAI3I,UACS,MAAb2I,EAAAA,UACY,MAAZA,EAAIvlB,KAEJ,KAAM,IAAI/C,OAAM,6CAElBuB,MAAKmP,OAAS4X,EAAI5X,OAClBnP,KAAKoe,SAAW2I,EAAI3I,SACpBpe,KAAAA,SAAa+mB,EAAAA,SACb/mB,KAAKwB,KAAOulB,EAAIvlB,KACgB,MAA5BulB,EAAItI,uBACNze,KAAKye,qBAAuBsI,EAAItI,sBAElCze,KAAKgnB,gBAAkBD,EAAIC,gBAAkB,WAC3C,OAAQhnB,QACP0E,KAAK1E,MACRA,KAAKgnB,eAAe7I,eAAiBne,KAGzCiL,GAAEsK,MAAMuR,WAAaA,EAErB7b,EAAEsK,MAAM0R,iBAAmB,SAA2BC,GACpD,GAAS,MAALA,EAAW,CACb,GAAIA,YAAajc,GAAEsK,MAAMuR,WAAY,OAAQI,EACxC,IAAIA,EAAE/kB,cAAgB9B,OAAS6mB,EAAE,YAAcjc,GAAEsK,MAAMuR,WAAY,MAAOI,EAC1E,IAAIA,YAAatT,WAAYsT,EAAE/I,yBAA0BlT,GAAEsK,MAAMuR,WAAY,OAAQI,EAAE/I,gBAE9F,OAAO,GAcTlT,EAAEsK,MAAM8M,WAAaA,EAcrBpX,EAAEsK,MAAM8F,cAAgBA,EAQxBpQ,EAAEsK,MAAM6O,QAAUA,EAKlBnZ,EAAEsK,MAAM+O,gBAAkBA,EAS1BrZ,EAAEsK,MAAM2C,WAAaA,EAerBjN,EAAEsK,MAAMgH,UAAYA,EASpBtR,EAAEsK,MAAM6E,UAAYA,EAoKpBnP,EAAEsK,MAAMmP,wBAA0BA,QRk+L9ByC,IAAI,SAAS7oB,EAAQU,EAAOJ,GS5hNlC,YTkiNA,SAASsL,GAAgBC,EAAUC,GAAe,KAAMD,YAAoBC,IAAgB,KAAM,IAAIC,WAAU,qCSvgNhH,QAAS+c,GAAgBC,GAMvB,IAAK,GAFDC,GAA0C,mBAAvBjgB,oBAAqC,MAAQ,OAChEkgB,KACKhpB,EAAI,EAAGA,EAAI8oB,EAAQvoB,OAAQP,IAAK,CACvC,GAAIS,GAASqoB,EAAQ9oB,GAAGokB,MAAM,KAAK,GAC/B6E,EAAa,KAAOxoB,EAAOyoB,aAC/B,IAAiB,MAAbxc,EAAEjM,GACJ,GAAgC,MAA5B0oB,EAAiB1oB,GAEnB,GAAsB,mBAAX2K,SAAuC,cAAbA,OAAOsB,EAAmB,CAAA,GACzD0c,IADyD,WACzDA,EAAWC,SAASC,cAAc,UACtCF,EAASG,IAAM7c,EAAE8c,UAAY,IAAMP,EAAa,IAAMA,EAAaF,EACnEM,SAASI,KAAKC,YAAYN,EAE1B,IAAIO,KACJR,GAAiB1oB,GAAUkpB,EAC3BA,EAAcxX,QAAU,GAAIvM,SAAQ,SAAUL,GAC5CokB,EAAcpkB,QAAUA,IAE1ByjB,EAAShnB,KAAK2nB,EAAcxX,gBAE5B5G,SAAQ3E,KAAK,+HACb7G,EAAQkpB,GAAYvc,OAGtBsc,GAAShnB,KAAKmnB,EAAiBL,EAAQ9oB,IAAImS,SAIjD,MAAOvM,SAAQyQ,IAAI2S,GAgCrB,QAAStc,GAAGG,GACVA,EAAK+c,MAAsB,MAAd/c,EAAK+c,MAAgB/c,EAAK+c,QACvC,IAAId,IAAWjc,EAAKE,GAAG9J,KAAM4J,EAAKoJ,UAAUhT,MAAMnC,OAAO+L,EAAK+c,MAC9D,KAAK,GAAI3mB,KAAQ4J,GAAKgd,MACpBf,EAAQ9mB,KAAK6K,EAAKgd,MAAM5mB,GAG1B,OADAyJ,GAAE8c,UAAY3c,EAAK2c,UACZ,GAAI5jB,SAAQ,SAAUL,EAASC,GACpCtE,WAAW,WACTwL,EAAEmc,eAAeC,GAASjjB,KAAK,WAC7B,GAAY,MAARgH,EAAcrH,EAAO,uCACpB,IAAsB,MAAlBqH,EAAKoJ,UAAmBzQ,EAAO,kEACnC,IAA2B,MAAvBqH,EAAKoJ,UAAUhT,KAAcuC,EAAO,0EACxC,IAAe,MAAXqH,EAAKE,GAAYvH,EAAO,0DAC5B,IAA2B,MAAvBqH,EAAKoJ,UAAUhT,KAAcuC,EAAO,4DACxC,IAAkB,MAAdqH,EAAKgd,MAAerkB,EAAO,+CAC/B,CACH,GAAIskB,GAAU,GAAIC,GAAQld,EAC1Bid,GAAQ/c,GAAGid,cAAc,WACvBF,EAAQG,KAAK,WACX1kB,EAAQukB,UAXhBpd,SAeSlH,IACR,KT46MP,GAAIuG,GAAe,WAAc,QAASC,GAAiBC,EAAQC,GAAS,IAAK,GAAIlM,GAAI,EAAGA,EAAIkM,EAAM3L,OAAQP,IAAK,CAAE,GAAImM,GAAaD,EAAMlM,EAAImM,GAAWC,WAAaD,EAAWC,aAAc,EAAOD,EAAWE,cAAe,EAAU,SAAWF,KAAYA,EAAWG,UAAW,GAAMnI,OAAOoI,eAAeN,EAAQE,EAAWtC,IAAKsC,IAAiB,MAAO,UAAUN,EAAaW,EAAYC,GAAiJ,MAA9HD,IAAYR,EAAiBH,EAAY5J,UAAWuK,GAAiBC,GAAaT,EAAiBH,EAAaY,GAAqBZ,KS9hNhiB9L,GAAQ,kBAAkB2M,GAC1B3M,EAAQ,iBAAiB2M,GACzB3M,EAAQ,oBAAoB2M,GAC5B3M,EAAQ,eAAe2M,GACvB3M,EAAQ,cAAc2M,GACtB3M,EAAQ,wBAAwB2M,EAEhC,IAAIyc,KAEJ1oB,GAAOJ,QAAUqM,EACjBA,EAAEyc,iBAAmBA,EAErBzc,EAAEwd,OAAS,SAAUjnB,EAAM0C,GACrBA,YAAiB+G,GAAEsK,MAAMuR,WAC3B7b,EAAEzJ,GAAQ0C,EAAM8iB,eAEhB/b,EAAEzJ,GAAQ0C,EAEkB,MAA1BwjB,EAAiBlmB,KACnBkmB,EAAiBlmB,GAAMsC,gBAChB4jB,GAAiBlmB,KAI5ByJ,EAAEmc,eAAiBA,CT+nNnB,ISjiNMkB,GTiiNQ,WS1hNZ,QAAAA,GAAald,EAAMsd,GAAUxe,EAAAlK,KAAAsoB,GAC3BtoB,KAAK2V,QAAUvK,EACfpL,KAAKsL,GAAK,GAAIL,GAAEG,EAAKE,GAAG9J,MAAMxB,KAAMoL,EAAKE,IACzCtL,KAAKwU,UAAY,GAAIvJ,GAAEG,EAAKoJ,UAAUhT,MAAMxB,KAAMoL,EAAKoJ,WTmpNzD,MA5GAlK,GAAage,IACXlgB,IAAK,OACLlE,MAAO,SSviNHwkB,GACJ,GAAItd,GAAOpL,KAAK2V,QACZyS,IACJpoB,MAAKooB,MAAQA,EACbpoB,KAAKsL,GAAGmC,mBAARpG,mBAAAM,KAA2B,QAAW8F,KAAX,GAEhBkb,GACHC,EACAC,EACAzoB,EAQAgD,EACA0lB,EACA3R,CAfmB,OAAA9P,oBAAAjF,KAAA,SAAAyL,GAAA,OAAA,OAAAA,EAAArF,KAAAqF,EAAAtI,MAAA,IAAA,GAAAsI,EAAAE,GAAA1G,mBAAAa,KAEAkD,EAAKgd,MAFL,KAAA,GAAA,IAAAva,EAAAI,GAAAJ,EAAAE,MAAA3I,KAAA,CAAAyI,EAAAtI,KAAA,EAAA,OAAA,GAEhBojB,EAFgB9a,EAAAI,GAAA/J,MAGnB0kB,EAAkBxd,EAAKgd,MAAMO,GAAchG,MAAM,KACjDkG,EAAWD,EAAgBzO,OAAO,EAAG,GACrC/Z,KAC2B,IAA3BwoB,EAAgB9pB,OANG,CAAA+O,EAAAtI,KAAA,EAAA,OAAAsI,EAAArF,KAAA,EAQnBpI,EAAOqP,KAAKC,MAAM,IAAMkZ,EAAgB,GAAGjG,MAAM,KAAK,GAAK,KARxC9U,EAAAtI,KAAA,EAAA,MAAA,KAAA,IAAA,KAAAsI,GAAArF,KAAA,GAAAqF,EAAAsC,GAAAtC,EAAA,SAAA,GAUb,GAAIpP,OAAM,iDAAmDkqB,EAAe,IAV/D,KAAA,IAAA,MAanBvlB,GAAO6H,EAAE4d,GACTC,EAAU1lB,EAAK+a,eACfhH,GAAM,IAAK2R,EAAQ3Z,OAAS,IAAM0Z,EAAW,IAAMF,EAAe,IAAMC,GAfrD/a,EAAAnE,cAgBM1J,KAAKqe,WAAWjb,EAAK3C,MAAMqoB,EAAS1oB,GAAO+W,GAhBjD,KAAA,GAAA,KAAA,IAgBvBiR,EAAMO,GAhBiB9a,EAAAwC,GAAAxC,EAAAtI,KAAA,CAAA,MAAA,KAAA,IAkBzBvF,KAAK6Q,MAAMvB,2BACRlL,KAAKskB,EAnBiB,KAAA,IAAA,IAAA,MAAA,MAAA7a,GAAAlF,SAAW8E,EAAXzN,OAAA,EAAA,YTimN3BoI,IAAK,cACLlE,MAAO,WS3kNP,MAAOlE,MAAKwU,UAAU/I,YT+kNtBrD,IAAK,aACLlE,MAAO,WS7kNP,MAAOlE,MAAKwU,UAAUuU,gBTilNtB3gB,IAAK,YACLlE,MAAO,WS/kNP,MAAOlE,MAAKwU,UAAUwU,eTmlNtB5gB,IAAK,UACLlE,MAAO,WSjlNuB,MAA1BlE,KAAKwU,UAAU2D,QACjBnY,KAAKwU,UAAU2D,UAEfnY,KAAKwU,UAAUuU,YAEjB,IAAIxmB,GAAOvC,IACXA,MAAKsL,GAAGmC,mBAARpG,mBAAAM,KAA2B,QAAA+F,KAAA,MAAArG,oBAAAjF,KAAA,SAAAqM,GAAA,OAAA,OAAAA,EAAAjG,KAAAiG,EAAAlJ,MAAA,IAAA,GAAA,MAAAkJ,GAAA/E,cAClBnH,EAAK+I,GAAG6M,UADU,KAAA,EAAA,KAAA,GAEzB5V,EAAKiS,UAAY,KACjBjS,EAAK+I,GAAK,IAHe,KAAA,GAAA,IAAA,MAAA,MAAAmD,GAAA9F,SAAA+E,EAAA1N,aTumNtBsoB,IS/lNa,oBAAX3e,UACTA,OAAOsB,EAAIA,KTqmNVge,iBAAiB,EAAEC,uBAAuB,EAAEC,gBAAgB,EAAEC,cAAc,EAAEC,mBAAmB,EAAEC,aAAa,SAAS,EAAE","file":"y.js","sourcesContent":["(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n setTimeout(drainQueue, 0);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n",null,"/**\n * Copyright (c) 2014, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * https://raw.github.com/facebook/regenerator/master/LICENSE file. An\n * additional grant of patent rights can be found in the PATENTS file in\n * the same directory.\n */\n\n!(function(global) {\n \"use strict\";\n\n var hasOwn = Object.prototype.hasOwnProperty;\n var undefined; // More compressible than void 0.\n var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n var inModule = typeof module === \"object\";\n var runtime = global.regeneratorRuntime;\n if (runtime) {\n if (inModule) {\n // If regeneratorRuntime is defined globally and we're in a module,\n // make the exports object identical to regeneratorRuntime.\n module.exports = runtime;\n }\n // Don't bother evaluating the rest of this file if the runtime was\n // already defined globally.\n return;\n }\n\n // Define the runtime globally (as expected by generated code) as either\n // module.exports (if we're in a module) or a new, empty object.\n runtime = global.regeneratorRuntime = inModule ? module.exports : {};\n\n function wrap(innerFn, outerFn, self, tryLocsList) {\n // If outerFn provided, then outerFn.prototype instanceof Generator.\n var generator = Object.create((outerFn || Generator).prototype);\n var context = new Context(tryLocsList || []);\n\n // The ._invoke method unifies the implementations of the .next,\n // .throw, and .return methods.\n generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n return generator;\n }\n runtime.wrap = wrap;\n\n // Try/catch helper to minimize deoptimizations. Returns a completion\n // record like context.tryEntries[i].completion. This interface could\n // have been (and was previously) designed to take a closure to be\n // invoked without arguments, but in all the cases we care about we\n // already have an existing method we want to call, so there's no need\n // to create a new function object. We can even get away with assuming\n // the method takes exactly one argument, since that happens to be true\n // in every case, so we don't have to touch the arguments object. The\n // only additional allocation required is the completion record, which\n // has a stable shape and so hopefully should be cheap to allocate.\n function tryCatch(fn, obj, arg) {\n try {\n return { type: \"normal\", arg: fn.call(obj, arg) };\n } catch (err) {\n return { type: \"throw\", arg: err };\n }\n }\n\n var GenStateSuspendedStart = \"suspendedStart\";\n var GenStateSuspendedYield = \"suspendedYield\";\n var GenStateExecuting = \"executing\";\n var GenStateCompleted = \"completed\";\n\n // Returning this object from the innerFn has the same effect as\n // breaking out of the dispatch switch statement.\n var ContinueSentinel = {};\n\n // Dummy constructor functions that we use as the .constructor and\n // .constructor.prototype properties for functions that return Generator\n // objects. For full spec compliance, you may wish to configure your\n // minifier not to mangle the names of these two functions.\n function Generator() {}\n function GeneratorFunction() {}\n function GeneratorFunctionPrototype() {}\n\n var Gp = GeneratorFunctionPrototype.prototype = Generator.prototype;\n GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n GeneratorFunctionPrototype.constructor = GeneratorFunction;\n GeneratorFunctionPrototype[toStringTagSymbol] = GeneratorFunction.displayName = \"GeneratorFunction\";\n\n // Helper for defining the .next, .throw, and .return methods of the\n // Iterator interface in terms of a single ._invoke method.\n function defineIteratorMethods(prototype) {\n [\"next\", \"throw\", \"return\"].forEach(function(method) {\n prototype[method] = function(arg) {\n return this._invoke(method, arg);\n };\n });\n }\n\n runtime.isGeneratorFunction = function(genFun) {\n var ctor = typeof genFun === \"function\" && genFun.constructor;\n return ctor\n ? ctor === GeneratorFunction ||\n // For the native GeneratorFunction constructor, the best we can\n // do is to check its .name property.\n (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n : false;\n };\n\n runtime.mark = function(genFun) {\n if (Object.setPrototypeOf) {\n Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n } else {\n genFun.__proto__ = GeneratorFunctionPrototype;\n if (!(toStringTagSymbol in genFun)) {\n genFun[toStringTagSymbol] = \"GeneratorFunction\";\n }\n }\n genFun.prototype = Object.create(Gp);\n return genFun;\n };\n\n // Within the body of any async function, `await x` is transformed to\n // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n // `value instanceof AwaitArgument` to determine if the yielded value is\n // meant to be awaited. Some may consider the name of this method too\n // cutesy, but they are curmudgeons.\n runtime.awrap = function(arg) {\n return new AwaitArgument(arg);\n };\n\n function AwaitArgument(arg) {\n this.arg = arg;\n }\n\n function AsyncIterator(generator) {\n function invoke(method, arg, resolve, reject) {\n var record = tryCatch(generator[method], generator, arg);\n if (record.type === \"throw\") {\n reject(record.arg);\n } else {\n var result = record.arg;\n var value = result.value;\n if (value instanceof AwaitArgument) {\n return Promise.resolve(value.arg).then(function(value) {\n invoke(\"next\", value, resolve, reject);\n }, function(err) {\n invoke(\"throw\", err, resolve, reject);\n });\n }\n\n return Promise.resolve(value).then(function(unwrapped) {\n // When a yielded Promise is resolved, its final value becomes\n // the .value of the Promise<{value,done}> result for the\n // current iteration. If the Promise is rejected, however, the\n // result for this iteration will be rejected with the same\n // reason. Note that rejections of yielded Promises are not\n // thrown back into the generator function, as is the case\n // when an awaited Promise is rejected. This difference in\n // behavior between yield and await is important, because it\n // allows the consumer to decide what to do with the yielded\n // rejection (swallow it and continue, manually .throw it back\n // into the generator, abandon iteration, whatever). With\n // await, by contrast, there is no opportunity to examine the\n // rejection reason outside the generator function, so the\n // only option is to throw it from the await expression, and\n // let the generator function handle the exception.\n result.value = unwrapped;\n resolve(result);\n }, reject);\n }\n }\n\n if (typeof process === \"object\" && process.domain) {\n invoke = process.domain.bind(invoke);\n }\n\n var previousPromise;\n\n function enqueue(method, arg) {\n function callInvokeWithMethodAndArg() {\n return new Promise(function(resolve, reject) {\n invoke(method, arg, resolve, reject);\n });\n }\n\n return previousPromise =\n // If enqueue has been called before, then we want to wait until\n // all previous Promises have been resolved before calling invoke,\n // so that results are always delivered in the correct order. If\n // enqueue has not been called before, then it is important to\n // call invoke immediately, without waiting on a callback to fire,\n // so that the async generator function has the opportunity to do\n // any necessary setup in a predictable way. This predictability\n // is why the Promise constructor synchronously invokes its\n // executor callback, and why async functions synchronously\n // execute code before the first await. Since we implement simple\n // async functions in terms of async generators, it is especially\n // important to get this right, even though it requires care.\n previousPromise ? previousPromise.then(\n callInvokeWithMethodAndArg,\n // Avoid propagating failures to Promises returned by later\n // invocations of the iterator.\n callInvokeWithMethodAndArg\n ) : callInvokeWithMethodAndArg();\n }\n\n // Define the unified helper method that is used to implement .next,\n // .throw, and .return (see defineIteratorMethods).\n this._invoke = enqueue;\n }\n\n defineIteratorMethods(AsyncIterator.prototype);\n\n // Note that simple async functions are implemented on top of\n // AsyncIterator objects; they just return a Promise for the value of\n // the final result produced by the iterator.\n runtime.async = function(innerFn, outerFn, self, tryLocsList) {\n var iter = new AsyncIterator(\n wrap(innerFn, outerFn, self, tryLocsList)\n );\n\n return runtime.isGeneratorFunction(outerFn)\n ? iter // If outerFn is a generator, return the full iterator.\n : iter.next().then(function(result) {\n return result.done ? result.value : iter.next();\n });\n };\n\n function makeInvokeMethod(innerFn, self, context) {\n var state = GenStateSuspendedStart;\n\n return function invoke(method, arg) {\n if (state === GenStateExecuting) {\n throw new Error(\"Generator is already running\");\n }\n\n if (state === GenStateCompleted) {\n if (method === \"throw\") {\n throw arg;\n }\n\n // Be forgiving, per 25.3.3.3.3 of the spec:\n // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n return doneResult();\n }\n\n while (true) {\n var delegate = context.delegate;\n if (delegate) {\n if (method === \"return\" ||\n (method === \"throw\" && delegate.iterator[method] === undefined)) {\n // A return or throw (when the delegate iterator has no throw\n // method) always terminates the yield* loop.\n context.delegate = null;\n\n // If the delegate iterator has a return method, give it a\n // chance to clean up.\n var returnMethod = delegate.iterator[\"return\"];\n if (returnMethod) {\n var record = tryCatch(returnMethod, delegate.iterator, arg);\n if (record.type === \"throw\") {\n // If the return method threw an exception, let that\n // exception prevail over the original return or throw.\n method = \"throw\";\n arg = record.arg;\n continue;\n }\n }\n\n if (method === \"return\") {\n // Continue with the outer return, now that the delegate\n // iterator has been terminated.\n continue;\n }\n }\n\n var record = tryCatch(\n delegate.iterator[method],\n delegate.iterator,\n arg\n );\n\n if (record.type === \"throw\") {\n context.delegate = null;\n\n // Like returning generator.throw(uncaught), but without the\n // overhead of an extra function call.\n method = \"throw\";\n arg = record.arg;\n continue;\n }\n\n // Delegate generator ran and handled its own exceptions so\n // regardless of what the method was, we continue as if it is\n // \"next\" with an undefined arg.\n method = \"next\";\n arg = undefined;\n\n var info = record.arg;\n if (info.done) {\n context[delegate.resultName] = info.value;\n context.next = delegate.nextLoc;\n } else {\n state = GenStateSuspendedYield;\n return info;\n }\n\n context.delegate = null;\n }\n\n if (method === \"next\") {\n // Setting context._sent for legacy support of Babel's\n // function.sent implementation.\n context.sent = context._sent = arg;\n\n } else if (method === \"throw\") {\n if (state === GenStateSuspendedStart) {\n state = GenStateCompleted;\n throw arg;\n }\n\n if (context.dispatchException(arg)) {\n // If the dispatched exception was caught by a catch block,\n // then let that catch block handle the exception normally.\n method = \"next\";\n arg = undefined;\n }\n\n } else if (method === \"return\") {\n context.abrupt(\"return\", arg);\n }\n\n state = GenStateExecuting;\n\n var record = tryCatch(innerFn, self, context);\n if (record.type === \"normal\") {\n // If an exception is thrown from innerFn, we leave state ===\n // GenStateExecuting and loop back for another invocation.\n state = context.done\n ? GenStateCompleted\n : GenStateSuspendedYield;\n\n var info = {\n value: record.arg,\n done: context.done\n };\n\n if (record.arg === ContinueSentinel) {\n if (context.delegate && method === \"next\") {\n // Deliberately forget the last sent value so that we don't\n // accidentally pass it on to the delegate.\n arg = undefined;\n }\n } else {\n return info;\n }\n\n } else if (record.type === \"throw\") {\n state = GenStateCompleted;\n // Dispatch the exception by looping back around to the\n // context.dispatchException(arg) call above.\n method = \"throw\";\n arg = record.arg;\n }\n }\n };\n }\n\n // Define Generator.prototype.{next,throw,return} in terms of the\n // unified ._invoke helper method.\n defineIteratorMethods(Gp);\n\n Gp[iteratorSymbol] = function() {\n return this;\n };\n\n Gp[toStringTagSymbol] = \"Generator\";\n\n Gp.toString = function() {\n return \"[object Generator]\";\n };\n\n function pushTryEntry(locs) {\n var entry = { tryLoc: locs[0] };\n\n if (1 in locs) {\n entry.catchLoc = locs[1];\n }\n\n if (2 in locs) {\n entry.finallyLoc = locs[2];\n entry.afterLoc = locs[3];\n }\n\n this.tryEntries.push(entry);\n }\n\n function resetTryEntry(entry) {\n var record = entry.completion || {};\n record.type = \"normal\";\n delete record.arg;\n entry.completion = record;\n }\n\n function Context(tryLocsList) {\n // The root entry object (effectively a try statement without a catch\n // or a finally block) gives us a place to store values thrown from\n // locations where there is no enclosing try statement.\n this.tryEntries = [{ tryLoc: \"root\" }];\n tryLocsList.forEach(pushTryEntry, this);\n this.reset(true);\n }\n\n runtime.keys = function(object) {\n var keys = [];\n for (var key in object) {\n keys.push(key);\n }\n keys.reverse();\n\n // Rather than returning an object with a next method, we keep\n // things simple and return the next function itself.\n return function next() {\n while (keys.length) {\n var key = keys.pop();\n if (key in object) {\n next.value = key;\n next.done = false;\n return next;\n }\n }\n\n // To avoid creating an additional object, we just hang the .value\n // and .done properties off the next function object itself. This\n // also ensures that the minifier will not anonymize the function.\n next.done = true;\n return next;\n };\n };\n\n function values(iterable) {\n if (iterable) {\n var iteratorMethod = iterable[iteratorSymbol];\n if (iteratorMethod) {\n return iteratorMethod.call(iterable);\n }\n\n if (typeof iterable.next === \"function\") {\n return iterable;\n }\n\n if (!isNaN(iterable.length)) {\n var i = -1, next = function next() {\n while (++i < iterable.length) {\n if (hasOwn.call(iterable, i)) {\n next.value = iterable[i];\n next.done = false;\n return next;\n }\n }\n\n next.value = undefined;\n next.done = true;\n\n return next;\n };\n\n return next.next = next;\n }\n }\n\n // Return an iterator with no values.\n return { next: doneResult };\n }\n runtime.values = values;\n\n function doneResult() {\n return { value: undefined, done: true };\n }\n\n Context.prototype = {\n constructor: Context,\n\n reset: function(skipTempReset) {\n this.prev = 0;\n this.next = 0;\n // Resetting context._sent for legacy support of Babel's\n // function.sent implementation.\n this.sent = this._sent = undefined;\n this.done = false;\n this.delegate = null;\n\n this.tryEntries.forEach(resetTryEntry);\n\n if (!skipTempReset) {\n for (var name in this) {\n // Not sure about the optimal order of these conditions:\n if (name.charAt(0) === \"t\" &&\n hasOwn.call(this, name) &&\n !isNaN(+name.slice(1))) {\n this[name] = undefined;\n }\n }\n }\n },\n\n stop: function() {\n this.done = true;\n\n var rootEntry = this.tryEntries[0];\n var rootRecord = rootEntry.completion;\n if (rootRecord.type === \"throw\") {\n throw rootRecord.arg;\n }\n\n return this.rval;\n },\n\n dispatchException: function(exception) {\n if (this.done) {\n throw exception;\n }\n\n var context = this;\n function handle(loc, caught) {\n record.type = \"throw\";\n record.arg = exception;\n context.next = loc;\n return !!caught;\n }\n\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n var record = entry.completion;\n\n if (entry.tryLoc === \"root\") {\n // Exception thrown outside of any try block that could handle\n // it, so set the completion value of the entire function to\n // throw the exception.\n return handle(\"end\");\n }\n\n if (entry.tryLoc <= this.prev) {\n var hasCatch = hasOwn.call(entry, \"catchLoc\");\n var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n if (hasCatch && hasFinally) {\n if (this.prev < entry.catchLoc) {\n return handle(entry.catchLoc, true);\n } else if (this.prev < entry.finallyLoc) {\n return handle(entry.finallyLoc);\n }\n\n } else if (hasCatch) {\n if (this.prev < entry.catchLoc) {\n return handle(entry.catchLoc, true);\n }\n\n } else if (hasFinally) {\n if (this.prev < entry.finallyLoc) {\n return handle(entry.finallyLoc);\n }\n\n } else {\n throw new Error(\"try statement without catch or finally\");\n }\n }\n }\n },\n\n abrupt: function(type, arg) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.tryLoc <= this.prev &&\n hasOwn.call(entry, \"finallyLoc\") &&\n this.prev < entry.finallyLoc) {\n var finallyEntry = entry;\n break;\n }\n }\n\n if (finallyEntry &&\n (type === \"break\" ||\n type === \"continue\") &&\n finallyEntry.tryLoc <= arg &&\n arg <= finallyEntry.finallyLoc) {\n // Ignore the finally entry if control is not jumping to a\n // location outside the try/catch block.\n finallyEntry = null;\n }\n\n var record = finallyEntry ? finallyEntry.completion : {};\n record.type = type;\n record.arg = arg;\n\n if (finallyEntry) {\n this.next = finallyEntry.finallyLoc;\n } else {\n this.complete(record);\n }\n\n return ContinueSentinel;\n },\n\n complete: function(record, afterLoc) {\n if (record.type === \"throw\") {\n throw record.arg;\n }\n\n if (record.type === \"break\" ||\n record.type === \"continue\") {\n this.next = record.arg;\n } else if (record.type === \"return\") {\n this.rval = record.arg;\n this.next = \"end\";\n } else if (record.type === \"normal\" && afterLoc) {\n this.next = afterLoc;\n }\n },\n\n finish: function(finallyLoc) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.finallyLoc === finallyLoc) {\n this.complete(entry.completion, entry.afterLoc);\n resetTryEntry(entry);\n return ContinueSentinel;\n }\n }\n },\n\n \"catch\": function(tryLoc) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.tryLoc === tryLoc) {\n var record = entry.completion;\n if (record.type === \"throw\") {\n var thrown = record.arg;\n resetTryEntry(entry);\n }\n return thrown;\n }\n }\n\n // The context.catch method must only be called with a location\n // argument that corresponds to a known catch block.\n throw new Error(\"illegal catch attempt\");\n },\n\n delegateYield: function(iterable, resultName, nextLoc) {\n this.delegate = {\n iterator: values(iterable),\n resultName: resultName,\n nextLoc: nextLoc\n };\n\n return ContinueSentinel;\n }\n };\n})(\n // Among the various tricks for obtaining a reference to the global\n // object, this seems to be the most reliable technique that does not\n // use indirect eval (which violates Content Security Policy).\n typeof global === \"object\" ? global :\n typeof window === \"object\" ? window :\n typeof self === \"object\" ? self : this\n);\n","console.warn(\n \"The regenerator/runtime module is deprecated; \" +\n \"please import regenerator-runtime/runtime instead.\"\n);\n\nmodule.exports = require(\"regenerator-runtime/runtime\");\n","/* @flow */\n'use strict'\n\nmodule.exports = function (Y/* :any */) {\n class AbstractConnector {\n /* ::\n y: YConfig;\n role: SyncRole;\n connections: Object;\n isSynced: boolean;\n userEventListeners: Array;\n whenSyncedListeners: Array;\n currentSyncTarget: ?UserId;\n syncingClients: Array;\n forwardToSyncingClients: boolean;\n debug: boolean;\n broadcastedHB: boolean;\n syncStep2: Promise;\n userId: UserId;\n send: Function;\n broadcast: Function;\n broadcastOpBuffer: Array;\n protocolVersion: number;\n */\n /*\n opts contains the following information:\n role : String Role of this client (\"master\" or \"slave\")\n userId : String Uniquely defines the user.\n debug: Boolean Whether to print debug messages (optional)\n */\n constructor (y, opts) {\n this.y = y\n if (opts == null) {\n opts = {}\n }\n if (opts.role == null || opts.role === 'master') {\n this.role = 'master'\n } else if (opts.role === 'slave') {\n this.role = 'slave'\n } else {\n throw new Error(\"Role must be either 'master' or 'slave'!\")\n }\n this.y.db.forwardAppliedOperations = opts.forwardAppliedOperations || false\n this.role = opts.role\n this.connections = {}\n this.isSynced = false\n this.userEventListeners = []\n this.whenSyncedListeners = []\n this.currentSyncTarget = null\n this.syncingClients = []\n this.forwardToSyncingClients = opts.forwardToSyncingClients !== false\n this.debug = opts.debug === true\n this.broadcastedHB = false\n this.syncStep2 = Promise.resolve()\n this.broadcastOpBuffer = []\n this.protocolVersion = 11\n }\n reconnect () {\n }\n disconnect () {\n this.connections = {}\n this.isSynced = false\n this.currentSyncTarget = null\n this.broadcastedHB = false\n this.syncingClients = []\n this.whenSyncedListeners = []\n return this.y.db.stopGarbageCollector()\n }\n setUserId (userId) {\n if (this.userId == null) {\n this.userId = userId\n return this.y.db.setUserId(userId)\n } else {\n return null\n }\n }\n onUserEvent (f) {\n this.userEventListeners.push(f)\n }\n userLeft (user) {\n if (this.connections[user] != null) {\n delete this.connections[user]\n if (user === this.currentSyncTarget) {\n this.currentSyncTarget = null\n this.findNextSyncTarget()\n }\n this.syncingClients = this.syncingClients.filter(function (cli) {\n return cli !== user\n })\n for (var f of this.userEventListeners) {\n f({\n action: 'userLeft',\n user: user\n })\n }\n }\n }\n userJoined (user, role) {\n if (role == null) {\n throw new Error('You must specify the role of the joined user!')\n }\n if (this.connections[user] != null) {\n throw new Error('This user already joined!')\n }\n this.connections[user] = {\n isSynced: false,\n role: role\n }\n for (var f of this.userEventListeners) {\n f({\n action: 'userJoined',\n user: user,\n role: role\n })\n }\n if (this.currentSyncTarget == null) {\n this.findNextSyncTarget()\n }\n }\n // Execute a function _when_ we are connected.\n // If not connected, wait until connected\n whenSynced (f) {\n if (this.isSynced) {\n f()\n } else {\n this.whenSyncedListeners.push(f)\n }\n }\n /*\n\n returns false, if there is no sync target\n true otherwise\n */\n findNextSyncTarget () {\n if (this.currentSyncTarget != null || this.isSynced) {\n return // \"The current sync has not finished!\"\n }\n\n var syncUser = null\n for (var uid in this.connections) {\n if (!this.connections[uid].isSynced) {\n syncUser = uid\n break\n }\n }\n var conn = this\n if (syncUser != null) {\n this.currentSyncTarget = syncUser\n this.y.db.requestTransaction(function *() {\n var stateSet = yield* this.getStateSet()\n var deleteSet = yield* this.getDeleteSet()\n conn.send(syncUser, {\n type: 'sync step 1',\n stateSet: stateSet,\n deleteSet: deleteSet,\n protocolVersion: conn.protocolVersion\n })\n })\n } else {\n this.y.db.requestTransaction(function *() {\n // it is crucial that isSynced is set at the time garbageCollectAfterSync is called\n conn.isSynced = true\n yield* this.garbageCollectAfterSync()\n // call whensynced listeners\n for (var f of conn.whenSyncedListeners) {\n f()\n }\n conn.whenSyncedListeners = []\n })\n }\n }\n send (uid, message) {\n if (this.debug) {\n console.log(`send ${this.userId} -> ${uid}: ${message.type}`, message) // eslint-disable-line\n }\n }\n /*\n Buffer operations, and broadcast them when ready.\n */\n broadcastOps (ops) {\n ops = ops.map(function (op) {\n return Y.Struct[op.struct].encode(op)\n })\n var self = this\n function broadcastOperations () {\n if (self.broadcastOpBuffer.length > 0) {\n self.broadcast({\n type: 'update',\n ops: self.broadcastOpBuffer\n })\n self.broadcastOpBuffer = []\n }\n }\n if (this.broadcastOpBuffer.length === 0) {\n this.broadcastOpBuffer = ops\n if (this.y.db.transactionInProgress) {\n this.y.db.whenTransactionsFinished().then(broadcastOperations)\n } else {\n setTimeout(broadcastOperations, 0)\n }\n } else {\n this.broadcastOpBuffer = this.broadcastOpBuffer.concat(ops)\n }\n }\n /*\n You received a raw message, and you know that it is intended for Yjs. Then call this function.\n */\n receiveMessage (sender/* :UserId */, message/* :Message */) {\n if (sender === this.userId) {\n return\n }\n if (this.debug) {\n console.log(`receive ${sender} -> ${this.userId}: ${message.type}`, JSON.parse(JSON.stringify(message))) // eslint-disable-line\n }\n if (message.protocolVersion != null && message.protocolVersion !== this.protocolVersion) {\n console.error(\n `You tried to sync with a yjs instance that has a different protocol version\n (You: ${this.protocolVersion}, Client: ${message.protocolVersion}).\n The sync was stopped. You need to upgrade your dependencies (especially Yjs & the Connector)!\n `)\n this.send(sender, {\n type: 'sync stop',\n protocolVersion: this.protocolVersion\n })\n return\n }\n if (message.type === 'sync step 1') {\n let conn = this\n let m = message\n this.y.db.requestTransaction(function *() {\n var currentStateSet = yield* this.getStateSet()\n yield* this.applyDeleteSet(m.deleteSet)\n\n var ds = yield* this.getDeleteSet()\n var ops = yield* this.getOperations(m.stateSet)\n conn.send(sender, {\n type: 'sync step 2',\n os: ops,\n stateSet: currentStateSet,\n deleteSet: ds,\n protocolVersion: this.protocolVersion\n })\n if (this.forwardToSyncingClients) {\n conn.syncingClients.push(sender)\n setTimeout(function () {\n conn.syncingClients = conn.syncingClients.filter(function (cli) {\n return cli !== sender\n })\n conn.send(sender, {\n type: 'sync done'\n })\n }, 5000) // TODO: conn.syncingClientDuration)\n } else {\n conn.send(sender, {\n type: 'sync done'\n })\n }\n conn._setSyncedWith(sender)\n })\n } else if (message.type === 'sync step 2') {\n let conn = this\n var broadcastHB = !this.broadcastedHB\n this.broadcastedHB = true\n var db = this.y.db\n var defer = {}\n defer.promise = new Promise(function (resolve) {\n defer.resolve = resolve\n })\n this.syncStep2 = defer.promise\n let m /* :MessageSyncStep2 */ = message\n db.requestTransaction(function * () {\n yield* this.applyDeleteSet(m.deleteSet)\n this.store.apply(m.os)\n db.requestTransaction(function * () {\n var ops = yield* this.getOperations(m.stateSet)\n if (ops.length > 0) {\n if (!broadcastHB) { // TODO: consider to broadcast here..\n conn.send(sender, {\n type: 'update',\n ops: ops\n })\n } else {\n // broadcast only once!\n conn.broadcastOps(ops)\n }\n }\n defer.resolve()\n })\n })\n } else if (message.type === 'sync done') {\n var self = this\n this.syncStep2.then(function () {\n self._setSyncedWith(sender)\n })\n } else if (message.type === 'update') {\n if (this.forwardToSyncingClients) {\n for (var client of this.syncingClients) {\n this.send(client, message)\n }\n }\n if (this.y.db.forwardAppliedOperations) {\n var delops = message.ops.filter(function (o) {\n return o.struct === 'Delete'\n })\n if (delops.length > 0) {\n this.broadcastOps(delops)\n }\n }\n this.y.db.apply(message.ops)\n }\n }\n _setSyncedWith (user) {\n var conn = this.connections[user]\n if (conn != null) {\n conn.isSynced = true\n }\n if (user === this.currentSyncTarget) {\n this.currentSyncTarget = null\n this.findNextSyncTarget()\n }\n }\n /*\n Currently, the HB encodes operations as JSON. For the moment I want to keep it\n that way. Maybe we support encoding in the HB as XML in the future, but for now I don't want\n too much overhead. Y is very likely to get changed a lot in the future\n\n Because we don't want to encode JSON as string (with character escaping, wich makes it pretty much unreadable)\n we encode the JSON as XML.\n\n When the HB support encoding as XML, the format should look pretty much like this.\n\n does not support primitive values as array elements\n expects an ltx (less than xml) object\n */\n parseMessageFromXml (m/* :any */) {\n function parseArray (node) {\n for (var n of node.children) {\n if (n.getAttribute('isArray') === 'true') {\n return parseArray(n)\n } else {\n return parseObject(n)\n }\n }\n }\n function parseObject (node/* :any */) {\n var json = {}\n for (var attrName in node.attrs) {\n var value = node.attrs[attrName]\n var int = parseInt(value, 10)\n if (isNaN(int) || ('' + int) !== value) {\n json[attrName] = value\n } else {\n json[attrName] = int\n }\n }\n for (var n/* :any */ in node.children) {\n var name = n.name\n if (n.getAttribute('isArray') === 'true') {\n json[name] = parseArray(n)\n } else {\n json[name] = parseObject(n)\n }\n }\n return json\n }\n parseObject(m)\n }\n /*\n encode message in xml\n we use string because Strophe only accepts an \"xml-string\"..\n So {a:4,b:{c:5}} will look like\n \n \n \n m - ltx element\n json - Object\n */\n encodeMessageToXml (msg, obj) {\n // attributes is optional\n function encodeObject (m, json) {\n for (var name in json) {\n var value = json[name]\n if (name == null) {\n // nop\n } else if (value.constructor === Object) {\n encodeObject(m.c(name), value)\n } else if (value.constructor === Array) {\n encodeArray(m.c(name), value)\n } else {\n m.setAttribute(name, value)\n }\n }\n }\n function encodeArray (m, array) {\n m.setAttribute('isArray', 'true')\n for (var e of array) {\n if (e.constructor === Object) {\n encodeObject(m.c('array-element'), e)\n } else {\n encodeArray(m.c('array-element'), e)\n }\n }\n }\n if (obj.constructor === Object) {\n encodeObject(msg.c('y', { xmlns: 'http://y.ninja/connector-stanza' }), obj)\n } else if (obj.constructor === Array) {\n encodeArray(msg.c('y', { xmlns: 'http://y.ninja/connector-stanza' }), obj)\n } else {\n throw new Error(\"I can't encode this json!\")\n }\n }\n }\n Y.AbstractConnector = AbstractConnector\n}\n","/* global getRandom, async */\n'use strict'\n\nmodule.exports = function (Y) {\n var globalRoom = {\n users: {},\n buffers: {}, // TODO: reimplement this idea. This does not cover all cases!! Here, you have a queue which is unrealistic (i.e. think about multiple incoming connections)\n removeUser: function (user) {\n for (var i in this.users) {\n this.users[i].userLeft(user)\n }\n delete this.users[user]\n delete this.buffers[user]\n },\n addUser: function (connector) {\n this.users[connector.userId] = connector\n this.buffers[connector.userId] = {}\n for (var uname in this.users) {\n if (uname !== connector.userId) {\n var u = this.users[uname]\n u.userJoined(connector.userId, 'master')\n connector.userJoined(u.userId, 'master')\n }\n }\n },\n whenTransactionsFinished: function () {\n var ps = []\n for (var name in this.users) {\n ps.push(this.users[name].y.db.whenTransactionsFinished())\n }\n return Promise.all(ps)\n },\n flushOne: function flushOne () {\n var bufs = []\n for (var receiver in globalRoom.buffers) {\n let buff = globalRoom.buffers[receiver]\n var push = false\n for (let sender in buff) {\n if (buff[sender].length > 0) {\n push = true\n break\n }\n }\n if (push) {\n bufs.push(receiver)\n }\n }\n if (bufs.length > 0) {\n var userId = getRandom(bufs)\n let buff = globalRoom.buffers[userId]\n let sender = getRandom(Object.keys(buff))\n var m = buff[sender].shift()\n if (buff[sender].length === 0) {\n delete buff[sender]\n }\n var user = globalRoom.users[userId]\n user.receiveMessage(m[0], m[1])\n return user.y.db.whenTransactionsFinished()\n } else {\n return false\n }\n },\n flushAll: function () {\n return new Promise(function (resolve) {\n // flushes may result in more created operations,\n // flush until there is nothing more to flush\n function nextFlush () {\n var c = globalRoom.flushOne()\n if (c) {\n while (c) {\n c = globalRoom.flushOne()\n }\n globalRoom.whenTransactionsFinished().then(nextFlush)\n } else {\n setTimeout(function () {\n var c = globalRoom.flushOne()\n if (c) {\n c.then(function () {\n globalRoom.whenTransactionsFinished().then(nextFlush)\n })\n } else {\n resolve()\n }\n }, 0)\n }\n }\n globalRoom.whenTransactionsFinished().then(nextFlush)\n })\n }\n }\n Y.utils.globalRoom = globalRoom\n\n var userIdCounter = 0\n\n class Test extends Y.AbstractConnector {\n constructor (y, options) {\n if (options === undefined) {\n throw new Error('Options must not be undefined!')\n }\n options.role = 'master'\n options.forwardToSyncingClients = false\n super(y, options)\n this.setUserId((userIdCounter++) + '').then(() => {\n globalRoom.addUser(this)\n })\n this.globalRoom = globalRoom\n this.syncingClientDuration = 0\n }\n receiveMessage (sender, m) {\n super.receiveMessage(sender, JSON.parse(JSON.stringify(m)))\n }\n send (userId, message) {\n var buffer = globalRoom.buffers[userId]\n if (buffer != null) {\n if (buffer[this.userId] == null) {\n buffer[this.userId] = []\n }\n buffer[this.userId].push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n broadcast (message) {\n for (var key in globalRoom.buffers) {\n var buff = globalRoom.buffers[key]\n if (buff[this.userId] == null) {\n buff[this.userId] = []\n }\n buff[this.userId].push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n isDisconnected () {\n return globalRoom.users[this.userId] == null\n }\n reconnect () {\n if (this.isDisconnected()) {\n globalRoom.addUser(this)\n super.reconnect()\n }\n return Y.utils.globalRoom.flushAll()\n }\n disconnect () {\n if (!this.isDisconnected()) {\n globalRoom.removeUser(this.userId)\n super.disconnect()\n }\n return this.y.db.whenTransactionsFinished()\n }\n flush () {\n var self = this\n return async(function * () {\n var buff = globalRoom.buffers[self.userId]\n while (Object.keys(buff).length > 0) {\n var sender = getRandom(Object.keys(buff))\n var m = buff[sender].shift()\n if (buff[sender].length === 0) {\n delete buff[sender]\n }\n this.receiveMessage(m[0], m[1])\n }\n yield self.whenTransactionsFinished()\n })\n }\n }\n\n Y.Test = Test\n}\n","/* @flow */\n'use strict'\n\nmodule.exports = function (Y /* :any */) {\n /*\n Partial definition of an OperationStore.\n TODO: name it Database, operation store only holds operations.\n\n A database definition must alse define the following methods:\n * logTable() (optional)\n - show relevant information information in a table\n * requestTransaction(makeGen)\n - request a transaction\n * destroy()\n - destroy the database\n */\n class AbstractDatabase {\n /* ::\n y: YConfig;\n forwardAppliedOperations: boolean;\n listenersById: Object;\n listenersByIdExecuteNow: Array;\n listenersByIdRequestPending: boolean;\n initializedTypes: Object;\n whenUserIdSetListener: ?Function;\n waitingTransactions: Array;\n transactionInProgress: boolean;\n executeOrder: Array;\n gc1: Array;\n gc2: Array;\n gcTimeout: number;\n gcInterval: any;\n garbageCollect: Function;\n executeOrder: Array; // for debugging only\n userId: UserId;\n opClock: number;\n transactionsFinished: ?{promise: Promise, resolve: any};\n transact: (x: ?Generator) => any;\n */\n constructor (y, opts) {\n this.y = y\n var os = this\n this.userId = null\n var resolve\n this.userIdPromise = new Promise(function (r) {\n resolve = r\n })\n this.userIdPromise.resolve = resolve\n // whether to broadcast all applied operations (insert & delete hook)\n this.forwardAppliedOperations = false\n // E.g. this.listenersById[id] : Array\n this.listenersById = {}\n // Execute the next time a transaction is requested\n this.listenersByIdExecuteNow = []\n // A transaction is requested\n this.listenersByIdRequestPending = false\n /* To make things more clear, the following naming conventions:\n * ls : we put this.listenersById on ls\n * l : Array\n * id : Id (can't use as property name)\n * sid : String (converted from id via JSON.stringify\n so we can use it as a property name)\n\n Always remember to first overwrite\n a property before you iterate over it!\n */\n // TODO: Use ES7 Weak Maps. This way types that are no longer user,\n // wont be kept in memory.\n this.initializedTypes = {}\n this.waitingTransactions = []\n this.transactionInProgress = false\n this.transactionIsFlushed = false\n if (typeof YConcurrency_TestingMode !== 'undefined') {\n this.executeOrder = []\n }\n this.gc1 = [] // first stage\n this.gc2 = [] // second stage -> after that, remove the op\n this.gcTimeout = !opts.gcTimeout ? 50000 : opts.gcTimeouts\n function garbageCollect () {\n return os.whenTransactionsFinished().then(function () {\n if (os.gc1.length > 0 || os.gc2.length > 0) {\n if (!os.y.isConnected()) {\n console.warn('gc should be empty when disconnected!')\n }\n return new Promise((resolve) => {\n os.requestTransaction(function * () {\n if (os.y.connector != null && os.y.connector.isSynced) {\n for (var i = 0; i < os.gc2.length; i++) {\n var oid = os.gc2[i]\n yield* this.garbageCollectOperation(oid)\n }\n os.gc2 = os.gc1\n os.gc1 = []\n }\n // TODO: Use setInterval here instead (when garbageCollect is called several times there will be several timeouts..)\n if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n resolve()\n })\n })\n } else {\n // TODO: see above\n if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n return Promise.resolve()\n }\n })\n }\n this.garbageCollect = garbageCollect\n if (this.gcTimeout > 0) {\n garbageCollect()\n }\n }\n queueGarbageCollector (id) {\n if (this.y.isConnected()) {\n this.gc1.push(id)\n }\n }\n emptyGarbageCollector () {\n return new Promise(resolve => {\n var check = () => {\n if (this.gc1.length > 0 || this.gc2.length > 0) {\n this.garbageCollect().then(check)\n } else {\n resolve()\n }\n }\n setTimeout(check, 0)\n })\n }\n addToDebug () {\n if (typeof YConcurrency_TestingMode !== 'undefined') {\n var command /* :string */ = Array.prototype.map.call(arguments, function (s) {\n if (typeof s === 'string') {\n return s\n } else {\n return JSON.stringify(s)\n }\n }).join('').replace(/\"/g, \"'\").replace(/,/g, ', ').replace(/:/g, ': ')\n this.executeOrder.push(command)\n }\n }\n getDebugData () {\n console.log(this.executeOrder.join('\\n'))\n }\n stopGarbageCollector () {\n var self = this\n return new Promise(function (resolve) {\n self.requestTransaction(function * () {\n var ungc /* :Array */ = self.gc1.concat(self.gc2)\n self.gc1 = []\n self.gc2 = []\n for (var i = 0; i < ungc.length; i++) {\n var op = yield* this.getOperation(ungc[i])\n if (op != null) {\n delete op.gc\n yield* this.setOperation(op)\n }\n }\n resolve()\n })\n })\n }\n /*\n Try to add to GC.\n\n TODO: rename this function\n\n Rulez:\n * Only gc if this user is online\n * The most left element in a list must not be gc'd.\n => There is at least one element in the list\n\n returns true iff op was added to GC\n */\n * addToGarbageCollector (op, left) {\n if (\n op.gc == null &&\n op.deleted === true\n ) {\n var gc = false\n if (left != null && left.deleted === true) {\n gc = true\n } else if (op.content != null && op.content.length > 1) {\n op = yield* this.getInsertionCleanStart([op.id[0], op.id[1] + 1])\n gc = true\n }\n if (gc) {\n op.gc = true\n yield* this.setOperation(op)\n this.store.queueGarbageCollector(op.id)\n return true\n }\n }\n return false\n }\n removeFromGarbageCollector (op) {\n function filter (o) {\n return !Y.utils.compareIds(o, op.id)\n }\n this.gc1 = this.gc1.filter(filter)\n this.gc2 = this.gc2.filter(filter)\n delete op.gc\n }\n * destroy () {\n clearInterval(this.gcInterval)\n this.gcInterval = null\n for (var key in this.initializedTypes) {\n var type = this.initializedTypes[key]\n if (type._destroy != null) {\n type._destroy()\n } else {\n console.error('The type you included does not provide destroy functionality, it will remain in memory (updating your packages will help).')\n }\n }\n }\n setUserId (userId) {\n if (!this.userIdPromise.inProgress) {\n this.userIdPromise.inProgress = true\n var self = this\n self.requestTransaction(function * () {\n self.userId = userId\n var state = yield* this.getState(userId)\n self.opClock = state.clock\n self.userIdPromise.resolve(userId)\n })\n }\n return this.userIdPromise\n }\n whenUserIdSet (f) {\n this.userIdPromise.then(f)\n }\n getNextOpId (numberOfIds) {\n if (numberOfIds == null) {\n throw new Error('getNextOpId expects the number of created ids to create!')\n } else if (this.userId == null) {\n throw new Error('OperationStore not yet initialized!')\n } else {\n var id = [this.userId, this.opClock]\n this.opClock += numberOfIds\n return id\n }\n }\n /*\n Apply a list of operations.\n\n * get a transaction\n * check whether all Struct.*.requiredOps are in the OS\n * check if it is an expected op (otherwise wait for it)\n * check if was deleted, apply a delete operation after op was applied\n */\n apply (ops) {\n for (var i = 0; i < ops.length; i++) {\n var o = ops[i]\n if (o.id == null || o.id[0] !== this.y.connector.userId) {\n var required = Y.Struct[o.struct].requiredOps(o)\n if (o.requires != null) {\n required = required.concat(o.requires)\n }\n this.whenOperationsExist(required, o)\n }\n }\n }\n /*\n op is executed as soon as every operation requested is available.\n Note that Transaction can (and should) buffer requests.\n */\n whenOperationsExist (ids, op) {\n if (ids.length > 0) {\n let listener = {\n op: op,\n missing: ids.length\n }\n\n for (let i = 0; i < ids.length; i++) {\n let id = ids[i]\n let sid = JSON.stringify(id)\n let l = this.listenersById[sid]\n if (l == null) {\n l = []\n this.listenersById[sid] = l\n }\n l.push(listener)\n }\n } else {\n this.listenersByIdExecuteNow.push({\n op: op\n })\n }\n\n if (this.listenersByIdRequestPending) {\n return\n }\n\n this.listenersByIdRequestPending = true\n var store = this\n\n this.requestTransaction(function * () {\n var exeNow = store.listenersByIdExecuteNow\n store.listenersByIdExecuteNow = []\n\n var ls = store.listenersById\n store.listenersById = {}\n\n store.listenersByIdRequestPending = false\n\n for (let key = 0; key < exeNow.length; key++) {\n let o = exeNow[key].op\n yield* store.tryExecute.call(this, o)\n }\n\n for (var sid in ls) {\n var l = ls[sid]\n var id = JSON.parse(sid)\n var op\n if (typeof id[1] === 'string') {\n op = yield* this.getOperation(id)\n } else {\n op = yield* this.getInsertion(id)\n }\n if (op == null) {\n store.listenersById[sid] = l\n } else {\n for (let i = 0; i < l.length; i++) {\n let listener = l[i]\n let o = listener.op\n if (--listener.missing === 0) {\n yield* store.tryExecute.call(this, o)\n }\n }\n }\n }\n })\n }\n /*\n Actually execute an operation, when all expected operations are available.\n */\n /* :: // TODO: this belongs somehow to transaction\n store: Object;\n getOperation: any;\n isGarbageCollected: any;\n addOperation: any;\n whenOperationsExist: any;\n */\n * tryExecute (op) {\n this.store.addToDebug('yield* this.store.tryExecute.call(this, ', JSON.stringify(op), ')')\n if (op.struct === 'Delete') {\n yield* Y.Struct.Delete.execute.call(this, op)\n // this is now called in Transaction.deleteOperation!\n // yield* this.store.operationAdded(this, op)\n } else {\n // check if this op was defined\n var defined = yield* this.getInsertion(op.id)\n while (defined != null && defined.content != null) {\n // check if this op has a longer content in the case it is defined\n if (defined.id[1] + defined.content.length < op.id[1] + op.content.length) {\n var overlapSize = defined.content.length - (op.id[1] - defined.id[1])\n op.content.splice(0, overlapSize)\n op.id = [op.id[0], op.id[1] + overlapSize]\n op.left = Y.utils.getLastId(defined)\n op.origin = op.left\n defined = yield* this.getOperation(op.id) // getOperation suffices here\n } else {\n break\n }\n }\n if (defined == null) {\n var isGarbageCollected = yield* this.isGarbageCollected(op.id)\n if (!isGarbageCollected) {\n yield* Y.Struct[op.struct].execute.call(this, op)\n yield* this.addOperation(op)\n yield* this.store.operationAdded(this, op)\n\n // if insertion, try to combine with left\n yield* this.tryCombineWithLeft(op)\n }\n }\n }\n }\n /*\n * Called by a transaction when an operation is added.\n * This function is especially important for y-indexeddb, where several instances may share a single database.\n * Every time an operation is created by one instance, it is send to all other instances and operationAdded is called\n *\n * If it's not a Delete operation:\n * * Checks if another operation is executable (listenersById)\n * * Update state, if possible\n *\n * Always:\n * * Call type\n */\n * operationAdded (transaction, op) {\n if (op.struct === 'Delete') {\n var target = yield* transaction.getInsertion(op.target)\n var type = this.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(transaction, op)\n }\n } else {\n // increase SS\n yield* transaction.updateState(op.id[0])\n var opLen = op.content != null ? op.content.length : 1\n for (let i = 0; i < opLen; i++) {\n // notify whenOperation listeners (by id)\n var sid = JSON.stringify([op.id[0], op.id[1] + i])\n var l = this.listenersById[sid]\n delete this.listenersById[sid]\n if (l != null) {\n for (var key in l) {\n var listener = l[key]\n if (--listener.missing === 0) {\n this.whenOperationsExist([], listener.op)\n }\n }\n }\n }\n var t = this.initializedTypes[JSON.stringify(op.parent)]\n\n // if parent is deleted, mark as gc'd and return\n if (op.parent != null) {\n var parentIsDeleted = yield* transaction.isDeleted(op.parent)\n if (parentIsDeleted) {\n yield* transaction.deleteList(op.id)\n return\n }\n }\n\n // notify parent, if it was instanciated as a custom type\n if (t != null) {\n let o = Y.utils.copyOperation(op)\n yield* t._changed(transaction, o)\n }\n if (!op.deleted) {\n // Delete if DS says this is actually deleted\n var len = op.content != null ? op.content.length : 1\n var startId = op.id // You must not use op.id in the following loop, because op will change when deleted\n for (let i = 0; i < len; i++) {\n var id = [startId[0], startId[1] + i]\n var opIsDeleted = yield* transaction.isDeleted(id)\n if (opIsDeleted) {\n var delop = {\n struct: 'Delete',\n target: id\n }\n yield* this.tryExecute.call(transaction, delop)\n }\n }\n }\n }\n }\n whenTransactionsFinished () {\n if (this.transactionInProgress) {\n if (this.transactionsFinished == null) {\n var resolve\n var promise = new Promise(function (r) {\n resolve = r\n })\n this.transactionsFinished = {\n resolve: resolve,\n promise: promise\n }\n return promise\n } else {\n return this.transactionsFinished.promise\n }\n } else {\n return Promise.resolve()\n }\n }\n // Check if there is another transaction request.\n // * the last transaction is always a flush :)\n getNextRequest () {\n if (this.waitingTransactions.length === 0) {\n if (this.transactionIsFlushed) {\n this.transactionInProgress = false\n this.transactionIsFlushed = false\n if (this.transactionsFinished != null) {\n this.transactionsFinished.resolve()\n this.transactionsFinished = null\n }\n return null\n } else {\n this.transactionIsFlushed = true\n return function * () {\n yield* this.flush()\n }\n }\n } else {\n this.transactionIsFlushed = false\n return this.waitingTransactions.shift()\n }\n }\n requestTransaction (makeGen/* :any */, callImmediately) {\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n setTimeout(() => {\n this.transact(this.getNextRequest())\n }, 0)\n }\n }\n }\n Y.AbstractDatabase = AbstractDatabase\n}\n","/* @flow */\n'use strict'\n\n/*\n An operation also defines the structure of a type. This is why operation and\n structure are used interchangeably here.\n\n It must be of the type Object. I hope to achieve some performance\n improvements when working on databases that support the json format.\n\n An operation must have the following properties:\n\n * encode\n - Encode the structure in a readable format (preferably string- todo)\n * decode (todo)\n - decode structure to json\n * execute\n - Execute the semantics of an operation.\n * requiredOps\n - Operations that are required to execute this operation.\n*/\nmodule.exports = function (Y/* :any */) {\n var Struct = {\n /* This is the only operation that is actually not a structure, because\n it is not stored in the OS. This is why it _does not_ have an id\n\n op = {\n target: Id\n }\n */\n Delete: {\n encode: function (op) {\n return op\n },\n requiredOps: function (op) {\n return [] // [op.target]\n },\n execute: function * (op) {\n return yield* this.deleteOperation(op.target, op.length || 1)\n }\n },\n Insert: {\n /* {\n content: [any],\n opContent: Id,\n id: Id,\n left: Id,\n origin: Id,\n right: Id,\n parent: Id,\n parentSub: string (optional), // child of Map type\n }\n */\n encode: function (op/* :Insertion */) /* :Insertion */ {\n // TODO: you could not send the \"left\" property, then you also have to\n // \"op.left = null\" in $execute or $decode\n var e/* :any */ = {\n id: op.id,\n left: op.left,\n right: op.right,\n origin: op.origin,\n parent: op.parent,\n struct: op.struct\n }\n if (op.parentSub != null) {\n e.parentSub = op.parentSub\n }\n if (op.hasOwnProperty('opContent')) {\n e.opContent = op.opContent\n } else {\n e.content = op.content.slice()\n }\n\n return e\n },\n requiredOps: function (op) {\n var ids = []\n if (op.left != null) {\n ids.push(op.left)\n }\n if (op.right != null) {\n ids.push(op.right)\n }\n if (op.origin != null && !Y.utils.compareIds(op.left, op.origin)) {\n ids.push(op.origin)\n }\n // if (op.right == null && op.left == null) {\n ids.push(op.parent)\n\n if (op.opContent != null) {\n ids.push(op.opContent)\n }\n return ids\n },\n getDistanceToOrigin: function * (op) {\n if (op.left == null) {\n return 0\n } else {\n var d = 0\n var o = yield* this.getInsertion(op.left)\n while (!Y.utils.matchesId(o, op.origin)) {\n d++\n if (o.left == null) {\n break\n } else {\n o = yield* this.getInsertion(o.left)\n }\n }\n return d\n }\n },\n /*\n # $this has to find a unique position between origin and the next known character\n # case 1: $origin equals $o.origin: the $creator parameter decides if left or right\n # let $OL= [o1,o2,o3,o4], whereby $this is to be inserted between o1 and o4\n # o2,o3 and o4 origin is 1 (the position of o2)\n # there is the case that $this.creator < o2.creator, but o3.creator < $this.creator\n # then o2 knows o3. Since on another client $OL could be [o1,o3,o4] the problem is complex\n # therefore $this would be always to the right of o3\n # case 2: $origin < $o.origin\n # if current $this insert_position > $o origin: $this ins\n # else $insert_position will not change\n # (maybe we encounter case 1 later, then this will be to the right of $o)\n # case 3: $origin > $o.origin\n # $this insert_position is to the left of $o (forever!)\n */\n execute: function * (op) {\n var i // loop counter\n\n // during this function some ops may get split into two pieces (e.g. with getInsertionCleanEnd)\n // We try to merge them later, if possible\n var tryToRemergeLater = []\n\n if (op.origin != null) { // TODO: !== instead of !=\n // we save in origin that op originates in it\n // we need that later when we eventually garbage collect origin (see transaction)\n var origin = yield* this.getInsertionCleanEnd(op.origin)\n if (origin.originOf == null) {\n origin.originOf = []\n }\n origin.originOf.push(op.id)\n yield* this.setOperation(origin)\n if (origin.right != null) {\n tryToRemergeLater.push(origin.right)\n }\n }\n var distanceToOrigin = i = yield* Struct.Insert.getDistanceToOrigin.call(this, op) // most cases: 0 (starts from 0)\n\n // now we begin to insert op in the list of insertions..\n var o\n var parent\n var start\n\n // find o. o is the first conflicting operation\n if (op.left != null) {\n o = yield* this.getInsertionCleanEnd(op.left)\n if (!Y.utils.compareIds(op.left, op.origin) && o.right != null) {\n // only if not added previously\n tryToRemergeLater.push(o.right)\n }\n o = (o.right == null) ? null : yield* this.getOperation(o.right)\n } else { // left == null\n parent = yield* this.getOperation(op.parent)\n let startId = op.parentSub ? parent.map[op.parentSub] : parent.start\n start = startId == null ? null : yield* this.getOperation(startId)\n o = start\n }\n\n // make sure to split op.right if necessary (also add to tryCombineWithLeft)\n if (op.right != null) {\n tryToRemergeLater.push(op.right)\n yield* this.getInsertionCleanStart(op.right)\n }\n\n // handle conflicts\n while (true) {\n if (o != null && !Y.utils.compareIds(o.id, op.right)) {\n var oOriginDistance = yield* Struct.Insert.getDistanceToOrigin.call(this, o)\n if (oOriginDistance === i) {\n // case 1\n if (o.id[0] < op.id[0]) {\n op.left = Y.utils.getLastId(o)\n distanceToOrigin = i + 1 // just ignore o.content.length, doesn't make a difference\n }\n } else if (oOriginDistance < i) {\n // case 2\n if (i - distanceToOrigin <= oOriginDistance) {\n op.left = Y.utils.getLastId(o)\n distanceToOrigin = i + 1 // just ignore o.content.length, doesn't make a difference\n }\n } else {\n break\n }\n i++\n if (o.right != null) {\n o = yield* this.getInsertion(o.right)\n } else {\n o = null\n }\n } else {\n break\n }\n }\n\n // reconnect..\n var left = null\n var right = null\n if (parent == null) {\n parent = yield* this.getOperation(op.parent)\n }\n\n // reconnect left and set right of op\n if (op.left != null) {\n left = yield* this.getInsertion(op.left)\n // link left\n op.right = left.right\n left.right = op.id\n\n yield* this.setOperation(left)\n } else {\n // set op.right from parent, if necessary\n op.right = op.parentSub ? parent.map[op.parentSub] || null : parent.start\n }\n // reconnect right\n if (op.right != null) {\n // TODO: wanna connect right too?\n right = yield* this.getOperation(op.right)\n right.left = Y.utils.getLastId(op)\n\n // if right exists, and it is supposed to be gc'd. Remove it from the gc\n if (right.gc != null) {\n if (right.content != null && right.content.length > 1) {\n right = yield* this.getInsertionCleanEnd(right.id)\n }\n this.store.removeFromGarbageCollector(right)\n }\n yield* this.setOperation(right)\n }\n\n // update parents .map/start/end properties\n if (op.parentSub != null) {\n if (left == null) {\n parent.map[op.parentSub] = op.id\n yield* this.setOperation(parent)\n }\n // is a child of a map struct.\n // Then also make sure that only the most left element is not deleted\n // We do not call the type in this case (this is what the third parameter is for)\n if (op.right != null) {\n yield* this.deleteOperation(op.right, 1, true)\n }\n if (op.left != null) {\n yield* this.deleteOperation(op.id, 1, true)\n }\n } else {\n if (right == null || left == null) {\n if (right == null) {\n parent.end = Y.utils.getLastId(op)\n }\n if (left == null) {\n parent.start = op.id\n }\n yield* this.setOperation(parent)\n }\n }\n\n // try to merge original op.left and op.origin\n for (let i = 0; i < tryToRemergeLater.length; i++) {\n var m = yield* this.getOperation(tryToRemergeLater[i])\n yield* this.tryCombineWithLeft(m)\n }\n }\n },\n List: {\n /*\n {\n start: null,\n end: null,\n struct: \"List\",\n type: \"\",\n id: this.os.getNextOpId(1)\n }\n */\n create: function (id) {\n return {\n start: null,\n end: null,\n struct: 'List',\n id: id\n }\n },\n encode: function (op) {\n var e = {\n struct: 'List',\n id: op.id,\n type: op.type\n }\n if (op.requires != null) {\n e.requires = op.requires\n }\n if (op.info != null) {\n e.info = op.info\n }\n return e\n },\n requiredOps: function () {\n /*\n var ids = []\n if (op.start != null) {\n ids.push(op.start)\n }\n if (op.end != null){\n ids.push(op.end)\n }\n return ids\n */\n return []\n },\n execute: function * (op) {\n op.start = null\n op.end = null\n },\n ref: function * (op, pos) {\n if (op.start == null) {\n return null\n }\n var res = null\n var o = yield* this.getOperation(op.start)\n\n while (true) {\n if (!o.deleted) {\n res = o\n pos--\n }\n if (pos >= 0 && o.right != null) {\n o = yield* this.getOperation(o.right)\n } else {\n break\n }\n }\n return res\n },\n map: function * (o, f) {\n o = o.start\n var res = []\n while (o != null) { // TODO: change to != (at least some convention)\n var operation = yield* this.getOperation(o)\n if (!operation.deleted) {\n res.push(f(operation))\n }\n o = operation.right\n }\n return res\n }\n },\n Map: {\n /*\n {\n map: {},\n struct: \"Map\",\n type: \"\",\n id: this.os.getNextOpId(1)\n }\n */\n create: function (id) {\n return {\n id: id,\n map: {},\n struct: 'Map'\n }\n },\n encode: function (op) {\n var e = {\n struct: 'Map',\n type: op.type,\n id: op.id,\n map: {} // overwrite map!!\n }\n if (op.requires != null) {\n e.requires = op.requires\n }\n if (op.info != null) {\n e.info = op.info\n }\n return e\n },\n requiredOps: function () {\n return []\n },\n execute: function * () {},\n /*\n Get a property by name\n */\n get: function * (op, name) {\n var oid = op.map[name]\n if (oid != null) {\n var res = yield* this.getOperation(oid)\n if (res == null || res.deleted) {\n return void 0\n } else if (res.opContent == null) {\n return res.content[0]\n } else {\n return yield* this.getType(res.opContent)\n }\n }\n }\n }\n }\n Y.Struct = Struct\n}\n","/* @flow */\n'use strict'\n\n/*\n Partial definition of a transaction\n\n A transaction provides all the the async functionality on a database.\n\n By convention, a transaction has the following properties:\n * ss for StateSet\n * os for OperationStore\n * ds for DeleteStore\n\n A transaction must also define the following methods:\n * checkDeleteStoreForState(state)\n - When increasing the state of a user, an operation with an higher id\n may already be garbage collected, and therefore it will never be received.\n update the state to reflect this knowledge. This won't call a method to save the state!\n * getDeleteSet(id)\n - Get the delete set in a readable format:\n {\n \"userX\": [\n [5,1], // starting from position 5, one operations is deleted\n [9,4] // starting from position 9, four operations are deleted\n ],\n \"userY\": ...\n }\n * getOpsFromDeleteSet(ds) -- TODO: just call this.deleteOperation(id) here\n - get a set of deletions that need to be applied in order to get to\n achieve the state of the supplied ds\n * setOperation(op)\n - write `op` to the database.\n Note: this is allowed to return an in-memory object.\n E.g. the Memory adapter returns the object that it has in-memory.\n Changing values on this object will be stored directly in the database\n without calling this function. Therefore,\n setOperation may have no functionality in some adapters. This also has\n implications on the way we use operations that were served from the database.\n We try not to call copyObject, if not necessary.\n * addOperation(op)\n - add an operation to the database.\n This may only be called once for every op.id\n Must return a function that returns the next operation in the database (ordered by id)\n * getOperation(id)\n * removeOperation(id)\n - remove an operation from the database. This is called when an operation\n is garbage collected.\n * setState(state)\n - `state` is of the form\n {\n user: \"1\",\n clock: 4\n } <- meaning that we have four operations from user \"1\"\n (with these id's respectively: 0, 1, 2, and 3)\n * getState(user)\n * getStateVector()\n - Get the state of the OS in the form\n [{\n user: \"userX\",\n clock: 11\n },\n ..\n ]\n * getStateSet()\n - Get the state of the OS in the form\n {\n \"userX\": 11,\n \"userY\": 22\n }\n * getOperations(startSS)\n - Get the all the operations that are necessary in order to achive the\n stateSet of this user, starting from a stateSet supplied by another user\n * makeOperationReady(ss, op)\n - this is called only by `getOperations(startSS)`. It makes an operation\n applyable on a given SS.\n*/\nmodule.exports = function (Y/* :any */) {\n class TransactionInterface {\n /* ::\n store: Y.AbstractDatabase;\n ds: Store;\n os: Store;\n ss: Store;\n */\n /*\n Get a type based on the id of its model.\n If it does not exist yes, create it.\n TODO: delete type from store.initializedTypes[id] when corresponding id was deleted!\n */\n * getType (id, args) {\n var sid = JSON.stringify(id)\n var t = this.store.initializedTypes[sid]\n if (t == null) {\n var op/* :MapStruct | ListStruct */ = yield* this.getOperation(id)\n if (op != null) {\n t = yield* Y[op.type].typeDefinition.initType.call(this, this.store, op, args)\n this.store.initializedTypes[sid] = t\n }\n }\n return t\n }\n * createType (typedefinition, id) {\n var structname = typedefinition[0].struct\n id = id || this.store.getNextOpId(1)\n var op\n if (id[0] === '_') {\n op = yield* this.getOperation(id)\n } else {\n op = Y.Struct[structname].create(id)\n op.type = typedefinition[0].name\n }\n if (typedefinition[0].appendAdditionalInfo != null) {\n yield* typedefinition[0].appendAdditionalInfo.call(this, op, typedefinition[1])\n }\n if (op[0] === '_') {\n yield* this.setOperation(op)\n } else {\n yield* this.applyCreatedOperations([op])\n }\n return yield* this.getType(id, typedefinition[1])\n }\n /* createType (typedefinition, id) {\n var structname = typedefinition[0].struct\n id = id || this.store.getNextOpId(1)\n var op = Y.Struct[structname].create(id)\n op.type = typedefinition[0].name\n if (typedefinition[0].appendAdditionalInfo != null) {\n yield* typedefinition[0].appendAdditionalInfo.call(this, op, typedefinition[1])\n }\n // yield* this.applyCreatedOperations([op])\n yield* Y.Struct[op.struct].execute.call(this, op)\n yield* this.addOperation(op)\n yield* this.store.operationAdded(this, op)\n return yield* this.getType(id, typedefinition[1])\n }*/\n /*\n Apply operations that this user created (no remote ones!)\n * does not check for Struct.*.requiredOps()\n * also broadcasts it through the connector\n */\n * applyCreatedOperations (ops) {\n var send = []\n for (var i = 0; i < ops.length; i++) {\n var op = ops[i]\n yield* this.store.tryExecute.call(this, op)\n if (op.id == null || typeof op.id[1] !== 'string') {\n send.push(Y.Struct[op.struct].encode(op))\n }\n }\n if (!this.store.y.connector.isDisconnected() && send.length > 0) { // TODO: && !this.store.forwardAppliedOperations (but then i don't send delete ops)\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcastOps(send)\n }\n }\n\n * deleteList (start) {\n while (start != null) {\n start = yield* this.getOperation(start)\n if (!start.gc) {\n start.gc = true\n start.deleted = true\n yield* this.setOperation(start)\n var delLength = start.content != null ? start.content.length : 1\n yield* this.markDeleted(start.id, delLength)\n if (start.opContent != null) {\n yield* this.deleteOperation(start.opContent)\n }\n this.store.queueGarbageCollector(start.id)\n }\n start = start.right\n }\n }\n\n /*\n Mark an operation as deleted, and add it to the GC, if possible.\n */\n * deleteOperation (targetId, length, preventCallType) /* :Generator */ {\n if (length == null) {\n length = 1\n }\n yield* this.markDeleted(targetId, length)\n while (length > 0) {\n var callType = false\n var target = yield* this.os.findWithUpperBound([targetId[0], targetId[1] + length - 1])\n var targetLength = target != null && target.content != null ? target.content.length : 1\n if (target == null || target.id[0] !== targetId[0] || target.id[1] + targetLength <= targetId[1]) {\n // does not exist or is not in the range of the deletion\n target = null\n length = 0\n } else {\n // does exist, check if it is too long\n if (!target.deleted) {\n if (target.id[1] < targetId[1]) {\n // starts to the left of the deletion range\n target = yield* this.getInsertionCleanStart(targetId)\n targetLength = target.content.length // must have content property!\n }\n if (target.id[1] + targetLength > targetId[1] + length) {\n // ends to the right of the deletion range\n target = yield* this.getInsertionCleanEnd([targetId[0], targetId[1] + length - 1])\n targetLength = target.content.length\n }\n }\n length = target.id[1] - targetId[1]\n }\n\n if (target != null) {\n if (!target.deleted) {\n callType = true\n // set deleted & notify type\n target.deleted = true\n // delete containing lists\n if (target.start != null) {\n // TODO: don't do it like this .. -.-\n yield* this.deleteList(target.start)\n // yield* this.deleteList(target.id) -- do not gc itself because this may still get referenced\n }\n if (target.map != null) {\n for (var name in target.map) {\n yield* this.deleteList(target.map[name])\n }\n // TODO: here to.. (see above)\n // yield* this.deleteList(target.id) -- see above\n }\n if (target.opContent != null) {\n yield* this.deleteOperation(target.opContent)\n // target.opContent = null\n }\n if (target.requires != null) {\n for (var i = 0; i < target.requires.length; i++) {\n yield* this.deleteOperation(target.requires[i])\n }\n }\n }\n var left\n if (target.left != null) {\n left = yield* this.getInsertion(target.left)\n } else {\n left = null\n }\n\n // set here because it was deleted and/or gc'd\n yield* this.setOperation(target)\n\n /*\n Check if it is possible to add right to the gc.\n Because this delete can't be responsible for left being gc'd,\n we don't have to add left to the gc..\n */\n var right\n if (target.right != null) {\n right = yield* this.getOperation(target.right)\n } else {\n right = null\n }\n if (callType && !preventCallType) {\n yield* this.store.operationAdded(this, {\n struct: 'Delete',\n target: target.id,\n length: targetLength\n })\n }\n // need to gc in the end!\n yield* this.store.addToGarbageCollector.call(this, target, left)\n if (right != null) {\n yield* this.store.addToGarbageCollector.call(this, right, target)\n }\n }\n }\n }\n /*\n Mark an operation as deleted&gc'd\n */\n * markGarbageCollected (id, len) {\n // this.mem.push([\"gc\", id]);\n this.store.addToDebug('yield* this.markGarbageCollected(', id, ', ', len, ')')\n var n = yield* this.markDeleted(id, len)\n if (n.id[1] < id[1] && !n.gc) {\n // un-extend left\n var newlen = n.len - (id[1] - n.id[1])\n n.len -= newlen\n yield* this.ds.put(n)\n n = {id: id, len: newlen, gc: false}\n yield* this.ds.put(n)\n }\n // get prev&next before adding a new operation\n var prev = yield* this.ds.findPrev(id)\n var next = yield* this.ds.findNext(id)\n\n if (id[1] + len < n.id[1] + n.len && !n.gc) {\n // un-extend right\n yield* this.ds.put({id: [id[0], id[1] + len], len: n.len - len, gc: false})\n n.len = len\n }\n // set gc'd\n n.gc = true\n // can extend left?\n if (\n prev != null &&\n prev.gc &&\n Y.utils.compareIds([prev.id[0], prev.id[1] + prev.len], n.id)\n ) {\n prev.len += n.len\n yield* this.ds.delete(n.id)\n n = prev\n // ds.put n here?\n }\n // can extend right?\n if (\n next != null &&\n next.gc &&\n Y.utils.compareIds([n.id[0], n.id[1] + n.len], next.id)\n ) {\n n.len += next.len\n yield* this.ds.delete(next.id)\n }\n yield* this.ds.put(n)\n yield* this.updateState(n.id[0])\n }\n /*\n Mark an operation as deleted.\n\n returns the delete node\n */\n * markDeleted (id, length) {\n if (length == null) {\n length = 1\n }\n // this.mem.push([\"del\", id]);\n var n = yield* this.ds.findWithUpperBound(id)\n if (n != null && n.id[0] === id[0]) {\n if (n.id[1] <= id[1] && id[1] <= n.id[1] + n.len) {\n // id is in n's range\n var diff = id[1] + length - (n.id[1] + n.len) // overlapping right\n if (diff > 0) {\n // id+length overlaps n\n if (!n.gc) {\n n.len += diff\n } else {\n diff = n.id[1] + n.len - id[1] // overlapping left (id till n.end)\n if (diff < length) {\n // a partial deletion\n n = {id: [id[0], id[1] + diff], len: length - diff, gc: false}\n yield* this.ds.put(n)\n } else {\n // already gc'd\n throw new Error('Cannot happen! (it dit though.. :()')\n // return n\n }\n }\n } else {\n // no overlapping, already deleted\n return n\n }\n } else {\n // cannot extend left (there is no left!)\n n = {id: id, len: length, gc: false}\n yield* this.ds.put(n) // TODO: you double-put !!\n }\n } else {\n // cannot extend left\n n = {id: id, len: length, gc: false}\n yield* this.ds.put(n)\n }\n // can extend right?\n var next = yield* this.ds.findNext(n.id)\n if (\n next != null &&\n n.id[0] === next.id[0] &&\n n.id[1] + n.len >= next.id[1]\n ) {\n diff = n.id[1] + n.len - next.id[1] // from next.start to n.end\n while (diff >= 0) {\n // n overlaps with next\n if (next.gc) {\n // gc is stronger, so reduce length of n\n n.len -= diff\n if (diff >= next.len) {\n // delete the missing range after next\n diff = diff - next.len // missing range after next\n if (diff > 0) {\n yield* this.ds.put(n) // unneccessary? TODO!\n yield* this.markDeleted([next.id[0], next.id[1] + next.len], diff)\n }\n }\n break\n } else {\n // we can extend n with next\n if (diff > next.len) {\n // n is even longer than next\n // get next.next, and try to extend it\n var _next = yield* this.ds.findNext(next.id)\n yield* this.ds.delete(next.id)\n if (_next == null || n.id[0] !== _next.id[0]) {\n break\n } else {\n next = _next\n diff = n.id[1] + n.len - next.id[1] // from next.start to n.end\n // continue!\n }\n } else {\n // n just partially overlaps with next. extend n, delete next, and break this loop\n n.len += next.len - diff\n yield* this.ds.delete(next.id)\n break\n }\n }\n }\n }\n yield* this.ds.put(n)\n return n\n }\n /*\n Call this method when the client is connected&synced with the\n other clients (e.g. master). This will query the database for\n operations that can be gc'd and add them to the garbage collector.\n */\n * garbageCollectAfterSync () {\n if (this.store.gc1.length > 0 || this.store.gc2.length > 0) {\n console.warn('gc should be empty after sync')\n }\n yield* this.os.iterate(this, null, null, function * (op) {\n if (op.gc) {\n delete op.gc\n yield* this.setOperation(op)\n }\n if (op.parent != null) {\n var parentDeleted = yield* this.isDeleted(op.parent)\n if (parentDeleted) {\n op.gc = true\n if (!op.deleted) {\n yield* this.markDeleted(op.id, op.content != null ? op.content.length : 1)\n op.deleted = true\n if (op.opContent != null) {\n yield* this.deleteOperation(op.opContent)\n }\n if (op.requires != null) {\n for (var i = 0; i < op.requires.length; i++) {\n yield* this.deleteOperation(op.requires[i])\n }\n }\n }\n yield* this.setOperation(op)\n this.store.gc1.push(op.id) // this is ok becaues its shortly before sync (otherwise use queueGarbageCollector!)\n return\n }\n }\n if (op.deleted) {\n var left = null\n if (op.left != null) {\n left = yield* this.getInsertion(op.left)\n }\n yield* this.store.addToGarbageCollector.call(this, op, left)\n }\n })\n }\n /*\n Really remove an op and all its effects.\n The complicated case here is the Insert operation:\n * reset left\n * reset right\n * reset parent.start\n * reset parent.end\n * reset origins of all right ops\n */\n * garbageCollectOperation (id) {\n this.store.addToDebug('yield* this.garbageCollectOperation(', id, ')')\n var o = yield* this.getOperation(id)\n yield* this.markGarbageCollected(id, (o != null && o.content != null) ? o.content.length : 1) // always mark gc'd\n // if op exists, then clean that mess up..\n if (o != null) {\n var deps = []\n if (o.opContent != null) {\n deps.push(o.opContent)\n }\n if (o.requires != null) {\n deps = deps.concat(o.requires)\n }\n for (var i = 0; i < deps.length; i++) {\n var dep = yield* this.getOperation(deps[i])\n if (dep != null) {\n if (!dep.deleted) {\n yield* this.deleteOperation(dep.id)\n dep = yield* this.getOperation(dep.id)\n }\n dep.gc = true\n yield* this.setOperation(dep)\n this.store.queueGarbageCollector(dep.id)\n } else {\n yield* this.markGarbageCollected(deps[i], 1)\n }\n }\n\n // remove gc'd op from the left op, if it exists\n if (o.left != null) {\n var left = yield* this.getInsertion(o.left)\n left.right = o.right\n yield* this.setOperation(left)\n }\n // remove gc'd op from the right op, if it exists\n // also reset origins of right ops\n if (o.right != null) {\n var right = yield* this.getOperation(o.right)\n right.left = o.left\n\n if (o.originOf != null && o.originOf.length > 0) {\n // find new origin of right ops\n // origin is the first left deleted operation\n var neworigin = o.left\n var neworigin_ = null\n while (neworigin != null) {\n neworigin_ = yield* this.getInsertion(neworigin)\n if (neworigin_.deleted) {\n break\n }\n neworigin = neworigin_.left\n }\n\n // reset origin of all right ops (except first right - duh!),\n\n /* ** The following code does not rely on the the originOf property **\n I recently added originOf to all Insert Operations (see Struct.Insert.execute),\n which saves which operations originate in a Insert operation.\n Garbage collecting without originOf is more memory efficient, but is nearly impossible for large texts, or lists!\n But I keep this code for now\n ```\n // reset origin of right\n right.origin = neworigin\n // search until you find origin pointer to the left of o\n if (right.right != null) {\n var i = yield* this.getOperation(right.right)\n var ids = [o.id, o.right]\n while (ids.some(function (id) {\n return Y.utils.compareIds(id, i.origin)\n })) {\n if (Y.utils.compareIds(i.origin, o.id)) {\n // reset origin of i\n i.origin = neworigin\n yield* this.setOperation(i)\n }\n // get next i\n if (i.right == null) {\n break\n } else {\n ids.push(i.id)\n i = yield* this.getOperation(i.right)\n }\n }\n }\n ```\n */\n // ** Now the new implementation starts **\n // reset neworigin of all originOf[*]\n for (var _i in o.originOf) {\n var originsIn = yield* this.getOperation(o.originOf[_i])\n if (originsIn != null) {\n originsIn.origin = neworigin\n yield* this.setOperation(originsIn)\n }\n }\n if (neworigin != null) {\n if (neworigin_.originOf == null) {\n neworigin_.originOf = o.originOf\n } else {\n neworigin_.originOf = o.originOf.concat(neworigin_.originOf)\n }\n yield* this.setOperation(neworigin_)\n }\n // we don't need to set right here, because\n // right should be in o.originOf => it is set it the previous for loop\n } else {\n // we didn't need to reset the origin of right\n // so we have to set right here\n yield* this.setOperation(right)\n }\n }\n // o may originate in another operation.\n // Since o is deleted, we have to reset o.origin's `originOf` property\n if (o.origin != null) {\n var origin = yield* this.getInsertion(o.origin)\n origin.originOf = origin.originOf.filter(function (_id) {\n return !Y.utils.compareIds(id, _id)\n })\n yield* this.setOperation(origin)\n }\n var parent\n if (o.parent != null) {\n parent = yield* this.getOperation(o.parent)\n }\n // remove gc'd op from parent, if it exists\n if (parent != null) {\n var setParent = false // whether to save parent to the os\n if (o.parentSub != null) {\n if (Y.utils.compareIds(parent.map[o.parentSub], o.id)) {\n setParent = true\n if (o.right != null) {\n parent.map[o.parentSub] = o.right\n } else {\n delete parent.map[o.parentSub]\n }\n }\n } else {\n if (Y.utils.compareIds(parent.start, o.id)) {\n // gc'd op is the start\n setParent = true\n parent.start = o.right\n }\n if (Y.utils.matchesId(o, parent.end)) {\n // gc'd op is the end\n setParent = true\n parent.end = o.left\n }\n }\n if (setParent) {\n yield* this.setOperation(parent)\n }\n }\n // finally remove it from the os\n yield* this.removeOperation(o.id)\n }\n }\n * checkDeleteStoreForState (state) {\n var n = yield* this.ds.findWithUpperBound([state.user, state.clock])\n if (n != null && n.id[0] === state.user && n.gc) {\n state.clock = Math.max(state.clock, n.id[1] + n.len)\n }\n }\n * updateState (user) {\n var state = yield* this.getState(user)\n yield* this.checkDeleteStoreForState(state)\n var o = yield* this.getInsertion([user, state.clock])\n var oLength = (o != null && o.content != null) ? o.content.length : 1\n while (o != null && user === o.id[0] && o.id[1] <= state.clock && o.id[1] + oLength > state.clock) {\n // either its a new operation (1. case), or it is an operation that was deleted, but is not yet in the OS\n state.clock += oLength\n yield* this.checkDeleteStoreForState(state)\n o = yield* this.os.findNext(o.id)\n oLength = (o != null && o.content != null) ? o.content.length : 1\n }\n yield* this.setState(state)\n }\n /*\n apply a delete set in order to get\n the state of the supplied ds\n */\n * applyDeleteSet (ds) {\n var deletions = []\n\n for (var user in ds) {\n var dv = ds[user]\n var pos = 0\n var d = dv[pos]\n yield* this.ds.iterate(this, [user, 0], [user, Number.MAX_VALUE], function * (n) {\n // cases:\n // 1. d deletes something to the right of n\n // => go to next n (break)\n // 2. d deletes something to the left of n\n // => create deletions\n // => reset d accordingly\n // *)=> if d doesn't delete anything anymore, go to next d (continue)\n // 3. not 2) and d deletes something that also n deletes\n // => reset d so that it doesn't contain n's deletion\n // *)=> if d does not delete anything anymore, go to next d (continue)\n while (d != null) {\n var diff = 0 // describe the diff of length in 1) and 2)\n if (n.id[1] + n.len <= d[0]) {\n // 1)\n break\n } else if (d[0] < n.id[1]) {\n // 2)\n // delete maximum the len of d\n // else delete as much as possible\n diff = Math.min(n.id[1] - d[0], d[1])\n deletions.push([user, d[0], diff, d[2]])\n } else {\n // 3)\n diff = n.id[1] + n.len - d[0] // never null (see 1)\n if (d[2] && !n.gc) {\n // d marks as gc'd but n does not\n // then delete either way\n deletions.push([user, d[0], Math.min(diff, d[1]), d[2]])\n }\n }\n if (d[1] <= diff) {\n // d doesn't delete anything anymore\n d = dv[++pos]\n } else {\n d[0] = d[0] + diff // reset pos\n d[1] = d[1] - diff // reset length\n }\n }\n })\n // for the rest.. just apply it\n for (; pos < dv.length; pos++) {\n d = dv[pos]\n deletions.push([user, d[0], d[1], d[2]])\n }\n }\n for (var i = 0; i < deletions.length; i++) {\n var del = deletions[i]\n // always try to delete..\n yield* this.deleteOperation([del[0], del[1]], del[2])\n if (del[3]) {\n // gc..\n yield* this.markGarbageCollected([del[0], del[1]], del[2]) // always mark gc'd\n // remove operation..\n var counter = del[1] + del[2]\n while (counter >= del[1]) {\n var o = yield* this.os.findWithUpperBound([del[0], counter - 1])\n if (o == null) {\n break\n }\n var oLen = o.content != null ? o.content.length : 1\n if (o.id[0] !== del[0] || o.id[1] + oLen <= del[1]) {\n // not in range\n break\n }\n if (o.id[1] + oLen > del[1] + del[2]) {\n // overlaps right\n o = yield* this.getInsertionCleanEnd([del[0], del[1] + del[2] - 1])\n }\n if (o.id[1] < del[1]) {\n // overlaps left\n o = yield* this.getInsertionCleanStart([del[0], del[1]])\n }\n counter = o.id[1]\n yield* this.garbageCollectOperation(o.id)\n }\n }\n if (this.store.forwardAppliedOperations) {\n var ops = []\n ops.push({struct: 'Delete', target: [d[0], d[1]], length: del[2]})\n this.store.y.connector.broadcastOps(ops)\n }\n }\n }\n * isGarbageCollected (id) {\n var n = yield* this.ds.findWithUpperBound(id)\n return n != null && n.id[0] === id[0] && id[1] < n.id[1] + n.len && n.gc\n }\n /*\n A DeleteSet (ds) describes all the deleted ops in the OS\n */\n * getDeleteSet () {\n var ds = {}\n yield* this.ds.iterate(this, null, null, function * (n) {\n var user = n.id[0]\n var counter = n.id[1]\n var len = n.len\n var gc = n.gc\n var dv = ds[user]\n if (dv === void 0) {\n dv = []\n ds[user] = dv\n }\n dv.push([counter, len, gc])\n })\n return ds\n }\n * isDeleted (id) {\n var n = yield* this.ds.findWithUpperBound(id)\n return n != null && n.id[0] === id[0] && id[1] < n.id[1] + n.len\n }\n * setOperation (op) {\n yield* this.os.put(op)\n return op\n }\n * addOperation (op) {\n yield* this.os.put(op)\n if (!this.store.y.connector.isDisconnected() && this.store.forwardAppliedOperations && typeof op.id[1] !== 'string') {\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcastOps([op])\n }\n }\n // if insertion, try to combine with left insertion (if both have content property)\n * tryCombineWithLeft (op) {\n if (\n op != null &&\n op.left != null &&\n op.content != null &&\n op.left[0] === op.id[0] &&\n Y.utils.compareIds(op.left, op.origin)\n ) {\n var left = yield* this.getInsertion(op.left)\n if (left.content != null &&\n left.id[1] + left.content.length === op.id[1] &&\n left.originOf.length === 1 &&\n !left.gc && !left.deleted &&\n !op.gc && !op.deleted\n ) {\n // combine!\n if (op.originOf != null) {\n left.originOf = op.originOf\n } else {\n delete left.originOf\n }\n left.content = left.content.concat(op.content)\n left.right = op.right\n yield* this.os.delete(op.id)\n yield* this.setOperation(left)\n }\n }\n }\n * getInsertion (id) {\n var ins = yield* this.os.findWithUpperBound(id)\n if (ins == null) {\n return null\n } else {\n var len = ins.content != null ? ins.content.length : 1 // in case of opContent\n if (id[0] === ins.id[0] && id[1] < ins.id[1] + len) {\n return ins\n } else {\n return null\n }\n }\n }\n * getInsertionCleanStartEnd (id) {\n yield* this.getInsertionCleanStart(id)\n return yield* this.getInsertionCleanEnd(id)\n }\n // Return an insertion such that id is the first element of content\n // This function manipulates an operation, if necessary\n * getInsertionCleanStart (id) {\n var ins = yield* this.getInsertion(id)\n if (ins != null) {\n if (ins.id[1] === id[1]) {\n return ins\n } else {\n var left = Y.utils.copyObject(ins)\n ins.content = left.content.splice(id[1] - ins.id[1])\n ins.id = id\n var leftLid = Y.utils.getLastId(left)\n ins.origin = leftLid\n left.originOf = [ins.id]\n left.right = ins.id\n ins.left = leftLid\n // debugger // check\n yield* this.setOperation(left)\n yield* this.setOperation(ins)\n if (left.gc) {\n this.store.queueGarbageCollector(ins.id)\n }\n return ins\n }\n } else {\n return null\n }\n }\n // Return an insertion such that id is the last element of content\n // This function manipulates an operation, if necessary\n * getInsertionCleanEnd (id) {\n var ins = yield* this.getInsertion(id)\n if (ins != null) {\n if (ins.content == null || (ins.id[1] + ins.content.length - 1 === id[1])) {\n return ins\n } else {\n var right = Y.utils.copyObject(ins)\n right.content = ins.content.splice(id[1] - ins.id[1] + 1) // cut off remainder\n right.id = [id[0], id[1] + 1]\n var insLid = Y.utils.getLastId(ins)\n right.origin = insLid\n ins.originOf = [right.id]\n ins.right = right.id\n right.left = insLid\n // debugger // check\n yield* this.setOperation(right)\n yield* this.setOperation(ins)\n if (ins.gc) {\n this.store.queueGarbageCollector(right.id)\n }\n return ins\n }\n } else {\n return null\n }\n }\n * getOperation (id/* :any */)/* :Transaction */ {\n var o = yield* this.os.find(id)\n if (id[0] !== '_' || o != null) {\n return o\n } else { // type is string\n // generate this operation?\n var comp = id[1].split('_')\n if (comp.length > 1) {\n var struct = comp[0]\n var op = Y.Struct[struct].create(id)\n op.type = comp[1]\n yield* this.setOperation(op)\n return op\n } else {\n // won't be called. but just in case..\n console.error('Unexpected case. How can this happen?')\n debugger // eslint-disable-line\n return null\n }\n }\n }\n * removeOperation (id) {\n yield* this.os.delete(id)\n }\n * setState (state) {\n var val = {\n id: [state.user],\n clock: state.clock\n }\n yield* this.ss.put(val)\n }\n * getState (user) {\n var n = yield* this.ss.find([user])\n var clock = n == null ? null : n.clock\n if (clock == null) {\n clock = 0\n }\n return {\n user: user,\n clock: clock\n }\n }\n * getStateVector () {\n var stateVector = []\n yield* this.ss.iterate(this, null, null, function * (n) {\n stateVector.push({\n user: n.id[0],\n clock: n.clock\n })\n })\n return stateVector\n }\n * getStateSet () {\n var ss = {}\n yield* this.ss.iterate(this, null, null, function * (n) {\n ss[n.id[0]] = n.clock\n })\n return ss\n }\n /*\n Here, we make all missing operations executable for the receiving user.\n\n Notes:\n startSS: denotes to the SV that the remote user sent\n currSS: denotes to the state vector that the user should have if he\n applies all already sent operations (increases is each step)\n\n We face several problems:\n * Execute op as is won't work because ops depend on each other\n -> find a way so that they do not anymore\n * When changing left, must not go more to the left than the origin\n * When changing right, you have to consider that other ops may have op\n as their origin, this means that you must not set one of these ops\n as the new right (interdependencies of ops)\n * can't just go to the right until you find the first known operation,\n With currSS\n -> interdependency of ops is a problem\n With startSS\n -> leads to inconsistencies when two users join at the same time.\n Then the position depends on the order of execution -> error!\n\n Solution:\n -> re-create originial situation\n -> set op.left = op.origin (which never changes)\n -> set op.right\n to the first operation that is known (according to startSS)\n or to the first operation that has an origin that is not to the\n right of op.\n -> Enforces unique execution order -> happy user\n\n Improvements: TODO\n * Could set left to origin, or the first known operation\n (startSS or currSS.. ?)\n -> Could be necessary when I turn GC again.\n -> Is a bad(ish) idea because it requires more computation\n\n What we do:\n * Iterate over all missing operations.\n * When there is an operation, where the right op is known, send this op all missing ops to the left to the user\n * I explained above what we have to do with each operation. Here is how we do it efficiently:\n 1. Go to the left until you find either op.origin, or a known operation (let o denote current operation in the iteration)\n 2. Found a known operation -> set op.left = o, and send it to the user. stop\n 3. Found o = op.origin -> set op.left = op.origin, and send it to the user. start again from 1. (set op = o)\n 4. Found some o -> set o.right = op, o.left = o.origin, send it to the user, continue\n */\n * getOperations (startSS) {\n // TODO: use bounds here!\n if (startSS == null) {\n startSS = {}\n }\n var send = []\n\n var endSV = yield* this.getStateVector()\n for (var endState of endSV) {\n var user = endState.user\n if (user === '_') {\n continue\n }\n var startPos = startSS[user] || 0\n if (startPos > 0) {\n // There is a change that [user, startPos] is in a composed Insertion (with a smaller counter)\n // find out if that is the case\n var firstMissing = yield* this.getInsertion([user, startPos])\n if (firstMissing != null) {\n // update startPos\n startPos = firstMissing.id[1]\n }\n }\n yield* this.os.iterate(this, [user, startPos], [user, Number.MAX_VALUE], function * (op) {\n op = Y.Struct[op.struct].encode(op)\n if (op.struct !== 'Insert') {\n send.push(op)\n } else if (op.right == null || op.right[1] < (startSS[op.right[0]] || 0)) {\n // case 1. op.right is known\n var o = op\n // Remember: ?\n // -> set op.right\n // 1. to the first operation that is known (according to startSS)\n // 2. or to the first operation that has an origin that is not to the\n // right of op.\n // For this we maintain a list of ops which origins are not found yet.\n var missing_origins = [op]\n var newright = op.right\n while (true) {\n if (o.left == null) {\n op.left = null\n send.push(op)\n if (!Y.utils.compareIds(o.id, op.id)) {\n o = Y.Struct[op.struct].encode(o)\n o.right = missing_origins[missing_origins.length - 1].id\n send.push(o)\n }\n break\n }\n o = yield* this.getInsertion(o.left)\n // we set another o, check if we can reduce $missing_origins\n while (missing_origins.length > 0 && Y.utils.matchesId(o, missing_origins[missing_origins.length - 1].origin)) {\n missing_origins.pop()\n }\n if (o.id[1] < (startSS[o.id[0]] || 0)) {\n // case 2. o is known\n op.left = Y.utils.getLastId(o)\n send.push(op)\n break\n } else if (Y.utils.matchesId(o, op.origin)) {\n // case 3. o is op.origin\n op.left = op.origin\n send.push(op)\n op = Y.Struct[op.struct].encode(o)\n op.right = newright\n if (missing_origins.length > 0) {\n console.log('This should not happen .. :( please report this')\n }\n missing_origins = [op]\n } else {\n // case 4. send o, continue to find op.origin\n var s = Y.Struct[op.struct].encode(o)\n s.right = missing_origins[missing_origins.length - 1].id\n s.left = s.origin\n send.push(s)\n missing_origins.push(o)\n }\n }\n }\n })\n }\n return send.reverse()\n }\n /* this is what we used before.. use this as a reference..\n * makeOperationReady (startSS, op) {\n op = Y.Struct[op.struct].encode(op)\n op = Y.utils.copyObject(op) -- use copyoperation instead now!\n var o = op\n var ids = [op.id]\n // search for the new op.right\n // it is either the first known op (according to startSS)\n // or the o that has no origin to the right of op\n // (this is why we use the ids array)\n while (o.right != null) {\n var right = yield* this.getOperation(o.right)\n if (o.right[1] < (startSS[o.right[0]] || 0) || !ids.some(function (id) {\n return Y.utils.compareIds(id, right.origin)\n })) {\n break\n }\n ids.push(o.right)\n o = right\n }\n op.right = o.right\n op.left = op.origin\n return op\n }\n */\n * flush () {\n yield* this.os.flush()\n yield* this.ss.flush()\n yield* this.ds.flush()\n }\n }\n Y.Transaction = TransactionInterface\n}\n","/* @flow */\n'use strict'\n\n/*\n EventHandler is an helper class for constructing custom types.\n\n Why: When constructing custom types, you sometimes want your types to work\n synchronous: E.g.\n ``` Synchronous\n mytype.setSomething(\"yay\")\n mytype.getSomething() === \"yay\"\n ```\n versus\n ``` Asynchronous\n mytype.setSomething(\"yay\")\n mytype.getSomething() === undefined\n mytype.waitForSomething().then(function(){\n mytype.getSomething() === \"yay\"\n })\n ```\n\n The structures usually work asynchronously (you have to wait for the\n database request to finish). EventHandler helps you to make your type\n synchronous.\n*/\nmodule.exports = function (Y /* : any*/) {\n Y.utils = {}\n\n class EventListenerHandler {\n constructor () {\n this.eventListeners = []\n }\n destroy () {\n this.eventListeners = null\n }\n /*\n Basic event listener boilerplate...\n */\n addEventListener (f) {\n this.eventListeners.push(f)\n }\n removeEventListener (f) {\n this.eventListeners = this.eventListeners.filter(function (g) {\n return f !== g\n })\n }\n removeAllEventListeners () {\n this.eventListeners = []\n }\n callEventListeners (event) {\n for (var i = 0; i < this.eventListeners.length; i++) {\n try {\n this.eventListeners[i](event)\n } catch (e) {\n console.error('User events must not throw Errors!')\n }\n }\n }\n }\n Y.utils.EventListenerHandler = EventListenerHandler\n\n class EventHandler extends EventListenerHandler {\n /* ::\n waiting: Array;\n awaiting: number;\n onevent: Function;\n eventListeners: Array;\n */\n /*\n onevent: is called when the structure changes.\n\n Note: \"awaiting opertations\" is used to denote operations that were\n prematurely called. Events for received operations can not be executed until\n all prematurely called operations were executed (\"waiting operations\")\n */\n constructor (onevent /* : Function */) {\n super()\n this.waiting = []\n this.awaiting = 0\n this.onevent = onevent\n }\n destroy () {\n super.destroy()\n this.waiting = null\n this.awaiting = null\n this.onevent = null\n }\n /*\n Call this when a new operation arrives. It will be executed right away if\n there are no waiting operations, that you prematurely executed\n */\n receivedOp (op) {\n if (this.awaiting <= 0) {\n this.onevent(op)\n } else {\n this.waiting.push(op)\n }\n }\n /*\n You created some operations, and you want the `onevent` function to be\n called right away. Received operations will not be executed untill all\n prematurely called operations are executed\n */\n awaitAndPrematurelyCall (ops) {\n this.awaiting++\n ops.map(Y.utils.copyOperation).forEach(this.onevent)\n }\n * awaitOps (transaction, f, args) {\n function notSoSmartSort (array) {\n // this function sorts insertions in a executable order\n var result = []\n while (array.length > 0) {\n for (var i = 0; i < array.length; i++) {\n var independent = true\n for (var j = 0; j < array.length; j++) {\n if (Y.utils.matchesId(array[j], array[i].left)) {\n // array[i] depends on array[j]\n independent = false\n break\n }\n }\n if (independent) {\n result.push(array.splice(i, 1)[0])\n i--\n }\n }\n }\n return result\n }\n var before = this.waiting.length\n // somehow create new operations\n yield* f.apply(transaction, args)\n // remove all appended ops / awaited ops\n this.waiting.splice(before)\n if (this.awaiting > 0) this.awaiting--\n // if there are no awaited ops anymore, we can update all waiting ops, and send execute them (if there are still no awaited ops)\n if (this.awaiting === 0 && this.waiting.length > 0) {\n // update all waiting ops\n for (let i = 0; i < this.waiting.length; i++) {\n var o = this.waiting[i]\n if (o.struct === 'Insert') {\n var _o = yield* transaction.getInsertion(o.id)\n if (!Y.utils.compareIds(_o.id, o.id)) {\n // o got extended\n o.left = [o.id[0], o.id[1] - 1]\n } else if (_o.left == null) {\n o.left = null\n } else {\n // find next undeleted op\n var left = yield* transaction.getInsertion(_o.left)\n while (left.deleted != null) {\n if (left.left != null) {\n left = yield* transaction.getInsertion(left.left)\n } else {\n left = null\n break\n }\n }\n o.left = left != null ? Y.utils.getLastId(left) : null\n }\n }\n }\n // the previous stuff was async, so we have to check again!\n // We also pull changes from the bindings, if there exists such a method, this could increase awaiting too\n if (this._pullChanges != null) {\n this._pullChanges()\n }\n if (this.awaiting === 0) {\n // sort by type, execute inserts first\n var ins = []\n var dels = []\n this.waiting.forEach(function (o) {\n if (o.struct === 'Delete') {\n dels.push(o)\n } else {\n ins.push(o)\n }\n })\n // put in executable order\n ins = notSoSmartSort(ins)\n ins.forEach(this.onevent)\n dels.forEach(this.onevent)\n this.waiting = []\n }\n }\n }\n // TODO: Remove awaitedInserts and awaitedDeletes in favor of awaitedOps, as they are deprecated and do not always work\n // Do this in one of the coming releases that are breaking anyway\n /*\n Call this when you successfully awaited the execution of n Insert operations\n */\n awaitedInserts (n) {\n var ops = this.waiting.splice(this.waiting.length - n)\n for (var oid = 0; oid < ops.length; oid++) {\n var op = ops[oid]\n if (op.struct === 'Insert') {\n for (var i = this.waiting.length - 1; i >= 0; i--) {\n let w = this.waiting[i]\n // TODO: do I handle split operations correctly here? Super unlikely, but yeah..\n // Also: can this case happen? Can op be inserted in the middle of a larger op that is in $waiting?\n if (w.struct === 'Insert') {\n if (Y.utils.matchesId(w, op.left)) {\n // include the effect of op in w\n w.right = op.id\n // exclude the effect of w in op\n op.left = w.left\n } else if (Y.utils.compareIds(w.id, op.right)) {\n // similar..\n w.left = Y.utils.getLastId(op)\n op.right = w.right\n }\n }\n }\n } else {\n throw new Error('Expected Insert Operation!')\n }\n }\n this._tryCallEvents(n)\n }\n /*\n Call this when you successfully awaited the execution of n Delete operations\n */\n awaitedDeletes (n, newLeft) {\n var ops = this.waiting.splice(this.waiting.length - n)\n for (var j = 0; j < ops.length; j++) {\n var del = ops[j]\n if (del.struct === 'Delete') {\n if (newLeft != null) {\n for (var i = 0; i < this.waiting.length; i++) {\n let w = this.waiting[i]\n // We will just care about w.left\n if (w.struct === 'Insert' && Y.utils.compareIds(del.target, w.left)) {\n w.left = newLeft\n }\n }\n }\n } else {\n throw new Error('Expected Delete Operation!')\n }\n }\n this._tryCallEvents(n)\n }\n /* (private)\n Try to execute the events for the waiting operations\n */\n _tryCallEvents () {\n function notSoSmartSort (array) {\n var result = []\n while (array.length > 0) {\n for (var i = 0; i < array.length; i++) {\n var independent = true\n for (var j = 0; j < array.length; j++) {\n if (Y.utils.matchesId(array[j], array[i].left)) {\n // array[i] depends on array[j]\n independent = false\n break\n }\n }\n if (independent) {\n result.push(array.splice(i, 1)[0])\n i--\n }\n }\n }\n return result\n }\n if (this.awaiting > 0) this.awaiting--\n if (this.awaiting === 0 && this.waiting.length > 0) {\n var ins = []\n var dels = []\n this.waiting.forEach(function (o) {\n if (o.struct === 'Delete') {\n dels.push(o)\n } else {\n ins.push(o)\n }\n })\n ins = notSoSmartSort(ins)\n ins.forEach(this.onevent)\n dels.forEach(this.onevent)\n this.waiting = []\n }\n }\n }\n Y.utils.EventHandler = EventHandler\n\n /*\n A wrapper for the definition of a custom type.\n Every custom type must have three properties:\n\n * struct\n - Structname of this type\n * initType\n - Given a model, creates a custom type\n * class\n - the constructor of the custom type (e.g. in order to inherit from a type)\n */\n class CustomType { // eslint-disable-line\n /* ::\n struct: any;\n initType: any;\n class: Function;\n name: String;\n */\n constructor (def) {\n if (def.struct == null ||\n def.initType == null ||\n def.class == null ||\n def.name == null\n ) {\n throw new Error('Custom type was not initialized correctly!')\n }\n this.struct = def.struct\n this.initType = def.initType\n this.class = def.class\n this.name = def.name\n if (def.appendAdditionalInfo != null) {\n this.appendAdditionalInfo = def.appendAdditionalInfo\n }\n this.parseArguments = (def.parseArguments || function () {\n return [this]\n }).bind(this)\n this.parseArguments.typeDefinition = this\n }\n }\n Y.utils.CustomType = CustomType\n\n Y.utils.isTypeDefinition = function isTypeDefinition (v) {\n if (v != null) {\n if (v instanceof Y.utils.CustomType) return [v]\n else if (v.constructor === Array && v[0] instanceof Y.utils.CustomType) return v\n else if (v instanceof Function && v.typeDefinition instanceof Y.utils.CustomType) return [v.typeDefinition]\n }\n return false\n }\n\n /*\n Make a flat copy of an object\n (just copy properties)\n */\n function copyObject (o) {\n var c = {}\n for (var key in o) {\n c[key] = o[key]\n }\n return c\n }\n Y.utils.copyObject = copyObject\n\n /*\n Copy an operation, so that it can be manipulated.\n Note: You must not change subproperties (except o.content)!\n */\n function copyOperation (o) {\n o = copyObject(o)\n if (o.content != null) {\n o.content = o.content.map(function (c) { return c })\n }\n return o\n }\n\n Y.utils.copyOperation = copyOperation\n\n /*\n Defines a smaller relation on Id's\n */\n function smaller (a, b) {\n return a[0] < b[0] || (a[0] === b[0] && (a[1] < b[1] || typeof a[1] < typeof b[1]))\n }\n Y.utils.smaller = smaller\n\n function inDeletionRange (del, ins) {\n return del.target[0] === ins[0] && del.target[1] <= ins[1] && ins[1] < del.target[1] + (del.length || 1)\n }\n Y.utils.inDeletionRange = inDeletionRange\n\n function compareIds (id1, id2) {\n if (id1 == null || id2 == null) {\n return id1 === id2\n } else {\n return id1[0] === id2[0] && id1[1] === id2[1]\n }\n }\n Y.utils.compareIds = compareIds\n\n function matchesId (op, id) {\n if (id == null || op == null) {\n return id === op\n } else {\n if (id[0] === op.id[0]) {\n if (op.content == null) {\n return id[1] === op.id[1]\n } else {\n return id[1] >= op.id[1] && id[1] < op.id[1] + op.content.length\n }\n }\n }\n }\n Y.utils.matchesId = matchesId\n\n function getLastId (op) {\n if (op.content == null || op.content.length === 1) {\n return op.id\n } else {\n return [op.id[0], op.id[1] + op.content.length - 1]\n }\n }\n Y.utils.getLastId = getLastId\n\n function createEmptyOpsArray (n) {\n var a = new Array(n)\n for (var i = 0; i < a.length; i++) {\n a[i] = {\n id: [null, null]\n }\n }\n return a\n }\n\n function createSmallLookupBuffer (Store) {\n /*\n This buffer implements a very small buffer that temporarily stores operations\n after they are read / before they are written.\n The buffer basically implements FIFO. Often requested lookups will be re-queued every time they are looked up / written.\n\n It can speed up lookups on Operation Stores and State Stores. But it does not require notable use of memory or processing power.\n\n Good for os and ss, bot not for ds (because it often uses methods that require a flush)\n\n I tried to optimize this for performance, therefore no highlevel operations.\n */\n class SmallLookupBuffer extends Store {\n constructor (arg1, arg2) {\n // super(...arguments) -- do this when this is supported by stable nodejs\n super(arg1, arg2)\n this.writeBuffer = createEmptyOpsArray(5)\n this.readBuffer = createEmptyOpsArray(10)\n }\n * find (id, noSuperCall) {\n var i, r\n for (i = this.readBuffer.length - 1; i >= 0; i--) {\n r = this.readBuffer[i]\n // we don't have to use compareids, because id is always defined!\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n // found r\n // move r to the end of readBuffer\n for (; i < this.readBuffer.length - 1; i++) {\n this.readBuffer[i] = this.readBuffer[i + 1]\n }\n this.readBuffer[this.readBuffer.length - 1] = r\n return r\n }\n }\n var o\n for (i = this.writeBuffer.length - 1; i >= 0; i--) {\n r = this.writeBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n o = r\n break\n }\n }\n if (i < 0 && noSuperCall === undefined) {\n // did not reach break in last loop\n // read id and put it to the end of readBuffer\n o = yield* super.find(id)\n }\n if (o != null) {\n for (i = 0; i < this.readBuffer.length - 1; i++) {\n this.readBuffer[i] = this.readBuffer[i + 1]\n }\n this.readBuffer[this.readBuffer.length - 1] = o\n }\n return o\n }\n * put (o) {\n var id = o.id\n var i, r // helper variables\n for (i = this.writeBuffer.length - 1; i >= 0; i--) {\n r = this.writeBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n // is already in buffer\n // forget r, and move o to the end of writeBuffer\n for (; i < this.writeBuffer.length - 1; i++) {\n this.writeBuffer[i] = this.writeBuffer[i + 1]\n }\n this.writeBuffer[this.writeBuffer.length - 1] = o\n break\n }\n }\n if (i < 0) {\n // did not reach break in last loop\n // write writeBuffer[0]\n var write = this.writeBuffer[0]\n if (write.id[0] !== null) {\n yield* super.put(write)\n }\n // put o to the end of writeBuffer\n for (i = 0; i < this.writeBuffer.length - 1; i++) {\n this.writeBuffer[i] = this.writeBuffer[i + 1]\n }\n this.writeBuffer[this.writeBuffer.length - 1] = o\n }\n // check readBuffer for every occurence of o.id, overwrite if found\n // whether found or not, we'll append o to the readbuffer\n for (i = 0; i < this.readBuffer.length - 1; i++) {\n r = this.readBuffer[i + 1]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n this.readBuffer[i] = o\n } else {\n this.readBuffer[i] = r\n }\n }\n this.readBuffer[this.readBuffer.length - 1] = o\n }\n * delete (id) {\n var i, r\n for (i = 0; i < this.readBuffer.length; i++) {\n r = this.readBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n this.readBuffer[i] = {\n id: [null, null]\n }\n }\n }\n yield* this.flush()\n yield* super.delete(id)\n }\n * findWithLowerBound (id) {\n var o = yield* this.find(id, true)\n if (o != null) {\n return o\n } else {\n yield* this.flush()\n return yield* super.findWithLowerBound.apply(this, arguments)\n }\n }\n * findWithUpperBound (id) {\n var o = yield* this.find(id, true)\n if (o != null) {\n return o\n } else {\n yield* this.flush()\n return yield* super.findWithUpperBound.apply(this, arguments)\n }\n }\n * findNext () {\n yield* this.flush()\n return yield* super.findNext.apply(this, arguments)\n }\n * findPrev () {\n yield* this.flush()\n return yield* super.findPrev.apply(this, arguments)\n }\n * iterate () {\n yield* this.flush()\n yield* super.iterate.apply(this, arguments)\n }\n * flush () {\n for (var i = 0; i < this.writeBuffer.length; i++) {\n var write = this.writeBuffer[i]\n if (write.id[0] !== null) {\n yield* super.put(write)\n this.writeBuffer[i] = {\n id: [null, null]\n }\n }\n }\n }\n }\n return SmallLookupBuffer\n }\n Y.utils.createSmallLookupBuffer = createSmallLookupBuffer\n}\n","/* @flow */\n'use strict'\n\nrequire('./Connector.js')(Y)\nrequire('./Database.js')(Y)\nrequire('./Transaction.js')(Y)\nrequire('./Struct.js')(Y)\nrequire('./Utils.js')(Y)\nrequire('./Connectors/Test.js')(Y)\n\nvar requiringModules = {}\n\nmodule.exports = Y\nY.requiringModules = requiringModules\n\nY.extend = function (name, value) {\n if (value instanceof Y.utils.CustomType) {\n Y[name] = value.parseArguments\n } else {\n Y[name] = value\n }\n if (requiringModules[name] != null) {\n requiringModules[name].resolve()\n delete requiringModules[name]\n }\n}\n\nY.requestModules = requestModules\nfunction requestModules (modules) {\n // determine if this module was compiled for es5 or es6 (y.js vs. y.es6)\n // if Insert.execute is a Function, then it isnt a generator..\n // then load the es5(.js) files..\n var extention = typeof regeneratorRuntime !== 'undefined' ? '.js' : '.es6'\n var promises = []\n for (var i = 0; i < modules.length; i++) {\n var module = modules[i].split('(')[0]\n var modulename = 'y-' + module.toLowerCase()\n if (Y[module] == null) {\n if (requiringModules[module] == null) {\n // module does not exist\n if (typeof window !== 'undefined' && window.Y !== 'undefined') {\n var imported = document.createElement('script')\n imported.src = Y.sourceDir + '/' + modulename + '/' + modulename + extention\n document.head.appendChild(imported)\n\n let requireModule = {}\n requiringModules[module] = requireModule\n requireModule.promise = new Promise(function (resolve) {\n requireModule.resolve = resolve\n })\n promises.push(requireModule.promise)\n } else {\n console.info('YJS: Please do not depend on automatic requiring of modules anymore! Extend modules as follows `require(\\'y-modulename\\')(Y)`')\n require(modulename)(Y)\n }\n } else {\n promises.push(requiringModules[modules[i]].promise)\n }\n }\n }\n return Promise.all(promises)\n}\n\n/* ::\ntype MemoryOptions = {\n name: 'memory'\n}\ntype IndexedDBOptions = {\n name: 'indexeddb',\n namespace: string\n}\ntype DbOptions = MemoryOptions | IndexedDBOptions\n\ntype WebRTCOptions = {\n name: 'webrtc',\n room: string\n}\ntype WebsocketsClientOptions = {\n name: 'websockets-client',\n room: string\n}\ntype ConnectionOptions = WebRTCOptions | WebsocketsClientOptions\n\ntype YOptions = {\n connector: ConnectionOptions,\n db: DbOptions,\n types: Array,\n sourceDir: string,\n share: {[key: string]: TypeName}\n}\n*/\n\nfunction Y (opts/* :YOptions */) /* :Promise */ {\n opts.types = opts.types != null ? opts.types : []\n var modules = [opts.db.name, opts.connector.name].concat(opts.types)\n for (var name in opts.share) {\n modules.push(opts.share[name])\n }\n Y.sourceDir = opts.sourceDir\n return new Promise(function (resolve, reject) {\n setTimeout(function () {\n Y.requestModules(modules).then(function () {\n if (opts == null) reject('An options object is expected! ')\n else if (opts.connector == null) reject('You must specify a connector! (missing connector property)')\n else if (opts.connector.name == null) reject('You must specify connector name! (missing connector.name property)')\n else if (opts.db == null) reject('You must specify a database! (missing db property)')\n else if (opts.connector.name == null) reject('You must specify db name! (missing db.name property)')\n else if (opts.share == null) reject('You must specify a set of shared types!')\n else {\n var yconfig = new YConfig(opts)\n yconfig.db.whenUserIdSet(function () {\n yconfig.init(function () {\n resolve(yconfig)\n })\n })\n }\n }).catch(reject)\n }, 0)\n })\n}\n\nclass YConfig {\n /* ::\n db: Y.AbstractDatabase;\n connector: Y.AbstractConnector;\n share: {[key: string]: any};\n options: Object;\n */\n constructor (opts, callback) {\n this.options = opts\n this.db = new Y[opts.db.name](this, opts.db)\n this.connector = new Y[opts.connector.name](this, opts.connector)\n }\n init (callback) {\n var opts = this.options\n var share = {}\n this.share = share\n this.db.requestTransaction(function * requestTransaction () {\n // create shared object\n for (var propertyname in opts.share) {\n var typeConstructor = opts.share[propertyname].split('(')\n var typeName = typeConstructor.splice(0, 1)\n var args = []\n if (typeConstructor.length === 1) {\n try {\n args = JSON.parse('[' + typeConstructor[0].split(')')[0] + ']')\n } catch (e) {\n throw new Error('Was not able to parse type definition! (share.' + propertyname + ')')\n }\n }\n var type = Y[typeName]\n var typedef = type.typeDefinition\n var id = ['_', typedef.struct + '_' + typeName + '_' + propertyname + '_' + typeConstructor]\n share[propertyname] = yield* this.createType(type.apply(typedef, args), id)\n }\n this.store.whenTransactionsFinished()\n .then(callback)\n })\n }\n isConnected () {\n return this.connector.isSynced\n }\n disconnect () {\n return this.connector.disconnect()\n }\n reconnect () {\n return this.connector.reconnect()\n }\n destroy () {\n if (this.connector.destroy != null) {\n this.connector.destroy()\n } else {\n this.connector.disconnect()\n }\n var self = this\n this.db.requestTransaction(function * () {\n yield* self.db.destroy()\n self.connector = null\n self.db = null\n })\n }\n}\n\nif (typeof window !== 'undefined') {\n window.Y = Y\n}\n"],"sourceRoot":"/source/"} \ No newline at end of file +{"version":3,"sources":["node_modules/browser-pack/_prelude.js","node_modules/process/browser.js","node_modules/regenerator-runtime/runtime.js","node_modules/regenerator/runtime.js","src/Connector.js","src/Connectors/Test.js","src/Database.js","src/Struct.js","src/Transaction.js","src/Utils.js","src/y.js"],"names":[],"mappings":"AAAA;ACAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;ACpFA,CAAE,UAAS,MAAT,EAAiB;AACjB;;AAEA,MAAI,SAAS,OAAO,SAAP,CAAiB,cAA9B;AACA,MAAI,SAAJ,C;AACA,MAAI,UAAU,OAAO,MAAP,KAAkB,UAAlB,GAA+B,MAA/B,GAAwC,EAAtD;AACA,MAAI,iBAAiB,QAAQ,QAAR,IAAoB,YAAzC;AACA,MAAI,oBAAoB,QAAQ,WAAR,IAAuB,eAA/C;;AAEA,MAAI,WAAW,QAAO,MAAP,yCAAO,MAAP,OAAkB,QAAjC;AACA,MAAI,UAAU,OAAO,kBAArB;AACA,MAAI,OAAJ,EAAa;AACX,QAAI,QAAJ,EAAc;;;AAGZ,aAAO,OAAP,GAAiB,OAAjB;AACD;;;AAGD;AACD;;;;AAID,YAAU,OAAO,kBAAP,GAA4B,WAAW,OAAO,OAAlB,GAA4B,EAAlE;;AAEA,WAAS,IAAT,CAAc,OAAd,EAAuB,OAAvB,EAAgC,IAAhC,EAAsC,WAAtC,EAAmD;;AAEjD,QAAI,YAAY,OAAO,MAAP,CAAc,CAAC,WAAW,SAAZ,EAAuB,SAArC,CAAhB;AACA,QAAI,UAAU,IAAI,OAAJ,CAAY,eAAe,EAA3B,CAAd;;;;AAIA,cAAU,OAAV,GAAoB,iBAAiB,OAAjB,EAA0B,IAA1B,EAAgC,OAAhC,CAApB;;AAEA,WAAO,SAAP;AACD;AACD,UAAQ,IAAR,GAAe,IAAf;;;;;;;;;;;;AAYA,WAAS,QAAT,CAAkB,EAAlB,EAAsB,GAAtB,EAA2B,GAA3B,EAAgC;AAC9B,QAAI;AACF,aAAO,EAAE,MAAM,QAAR,EAAkB,KAAK,GAAG,IAAH,CAAQ,GAAR,EAAa,GAAb,CAAvB,EAAP;AACD,KAFD,CAEE,OAAO,GAAP,EAAY;AACZ,aAAO,EAAE,MAAM,OAAR,EAAiB,KAAK,GAAtB,EAAP;AACD;AACF;;AAED,MAAI,yBAAyB,gBAA7B;AACA,MAAI,yBAAyB,gBAA7B;AACA,MAAI,oBAAoB,WAAxB;AACA,MAAI,oBAAoB,WAAxB;;;;AAIA,MAAI,mBAAmB,EAAvB;;;;;;AAMA,WAAS,SAAT,GAAqB,CAAE;AACvB,WAAS,iBAAT,GAA6B,CAAE;AAC/B,WAAS,0BAAT,GAAsC,CAAE;;AAExC,MAAI,KAAK,2BAA2B,SAA3B,GAAuC,UAAU,SAA1D;AACA,oBAAkB,SAAlB,GAA8B,GAAG,WAAH,GAAiB,0BAA/C;AACA,6BAA2B,WAA3B,GAAyC,iBAAzC;AACA,6BAA2B,iBAA3B,IAAgD,kBAAkB,WAAlB,GAAgC,mBAAhF;;;;AAIA,WAAS,qBAAT,CAA+B,SAA/B,EAA0C;AACxC,KAAC,MAAD,EAAS,OAAT,EAAkB,QAAlB,EAA4B,OAA5B,CAAoC,UAAS,MAAT,EAAiB;AACnD,gBAAU,MAAV,IAAoB,UAAS,GAAT,EAAc;AAChC,eAAO,KAAK,OAAL,CAAa,MAAb,EAAqB,GAArB,CAAP;AACD,OAFD;AAGD,KAJD;AAKD;;AAED,UAAQ,mBAAR,GAA8B,UAAS,MAAT,EAAiB;AAC7C,QAAI,OAAO,OAAO,MAAP,KAAkB,UAAlB,IAAgC,OAAO,WAAlD;AACA,WAAO,OACH,SAAS,iBAAT;;;AAGA,KAAC,KAAK,WAAL,IAAoB,KAAK,IAA1B,MAAoC,mBAJjC,GAKH,KALJ;AAMD,GARD;;AAUA,UAAQ,IAAR,GAAe,UAAS,MAAT,EAAiB;AAC9B,QAAI,OAAO,cAAX,EAA2B;AACzB,aAAO,cAAP,CAAsB,MAAtB,EAA8B,0BAA9B;AACD,KAFD,MAEO;AACL,aAAO,SAAP,GAAmB,0BAAnB;AACA,UAAI,EAAE,qBAAqB,MAAvB,CAAJ,EAAoC;AAClC,eAAO,iBAAP,IAA4B,mBAA5B;AACD;AACF;AACD,WAAO,SAAP,GAAmB,OAAO,MAAP,CAAc,EAAd,CAAnB;AACA,WAAO,MAAP;AACD,GAXD;;;;;;;AAkBA,UAAQ,KAAR,GAAgB,UAAS,GAAT,EAAc;AAC5B,WAAO,IAAI,aAAJ,CAAkB,GAAlB,CAAP;AACD,GAFD;;AAIA,WAAS,aAAT,CAAuB,GAAvB,EAA4B;AAC1B,SAAK,GAAL,GAAW,GAAX;AACD;;AAED,WAAS,aAAT,CAAuB,SAAvB,EAAkC;AAChC,aAAS,MAAT,CAAgB,MAAhB,EAAwB,GAAxB,EAA6B,OAA7B,EAAsC,MAAtC,EAA8C;AAC5C,UAAI,SAAS,SAAS,UAAU,MAAV,CAAT,EAA4B,SAA5B,EAAuC,GAAvC,CAAb;AACA,UAAI,OAAO,IAAP,KAAgB,OAApB,EAA6B;AAC3B,eAAO,OAAO,GAAd;AACD,OAFD,MAEO;AACL,YAAI,SAAS,OAAO,GAApB;AACA,YAAI,QAAQ,OAAO,KAAnB;AACA,YAAI,iBAAiB,aAArB,EAAoC;AAClC,iBAAO,QAAQ,OAAR,CAAgB,MAAM,GAAtB,EAA2B,IAA3B,CAAgC,UAAS,KAAT,EAAgB;AACrD,mBAAO,MAAP,EAAe,KAAf,EAAsB,OAAtB,EAA+B,MAA/B;AACD,WAFM,EAEJ,UAAS,GAAT,EAAc;AACf,mBAAO,OAAP,EAAgB,GAAhB,EAAqB,OAArB,EAA8B,MAA9B;AACD,WAJM,CAAP;AAKD;;AAED,eAAO,QAAQ,OAAR,CAAgB,KAAhB,EAAuB,IAAvB,CAA4B,UAAS,SAAT,EAAoB;;;;;;;;;;;;;;;;AAgBrD,iBAAO,KAAP,GAAe,SAAf;AACA,kBAAQ,MAAR;AACD,SAlBM,EAkBJ,MAlBI,CAAP;AAmBD;AACF;;AAED,QAAI,QAAO,OAAP,yCAAO,OAAP,OAAmB,QAAnB,IAA+B,QAAQ,MAA3C,EAAmD;AACjD,eAAS,QAAQ,MAAR,CAAe,IAAf,CAAoB,MAApB,CAAT;AACD;;AAED,QAAI,eAAJ;;AAEA,aAAS,OAAT,CAAiB,MAAjB,EAAyB,GAAzB,EAA8B;AAC5B,eAAS,0BAAT,GAAsC;AACpC,eAAO,IAAI,OAAJ,CAAY,UAAS,OAAT,EAAkB,MAAlB,EAA0B;AAC3C,iBAAO,MAAP,EAAe,GAAf,EAAoB,OAApB,EAA6B,MAA7B;AACD,SAFM,CAAP;AAGD;;AAED,aAAO;;;;;;;;;;;;;AAaL,wBAAkB,gBAAgB,IAAhB,CAChB,0BADgB;;;AAIhB,gCAJgB,CAAlB,GAKI,4BAlBN;AAmBD;;;;AAID,SAAK,OAAL,GAAe,OAAf;AACD;;AAED,wBAAsB,cAAc,SAApC;;;;;AAKA,UAAQ,KAAR,GAAgB,UAAS,OAAT,EAAkB,OAAlB,EAA2B,IAA3B,EAAiC,WAAjC,EAA8C;AAC5D,QAAI,OAAO,IAAI,aAAJ,CACT,KAAK,OAAL,EAAc,OAAd,EAAuB,IAAvB,EAA6B,WAA7B,CADS,CAAX;;AAIA,WAAO,QAAQ,mBAAR,CAA4B,OAA5B,IACH,I;AADG,MAEH,KAAK,IAAL,GAAY,IAAZ,CAAiB,UAAS,MAAT,EAAiB;AAChC,aAAO,OAAO,IAAP,GAAc,OAAO,KAArB,GAA6B,KAAK,IAAL,EAApC;AACD,KAFD,CAFJ;AAKD,GAVD;;AAYA,WAAS,gBAAT,CAA0B,OAA1B,EAAmC,IAAnC,EAAyC,OAAzC,EAAkD;AAChD,QAAI,QAAQ,sBAAZ;;AAEA,WAAO,SAAS,MAAT,CAAgB,MAAhB,EAAwB,GAAxB,EAA6B;AAClC,UAAI,UAAU,iBAAd,EAAiC;AAC/B,cAAM,IAAI,KAAJ,CAAU,8BAAV,CAAN;AACD;;AAED,UAAI,UAAU,iBAAd,EAAiC;AAC/B,YAAI,WAAW,OAAf,EAAwB;AACtB,gBAAM,GAAN;AACD;;;;AAID,eAAO,YAAP;AACD;;AAED,aAAO,IAAP,EAAa;AACX,YAAI,WAAW,QAAQ,QAAvB;AACA,YAAI,QAAJ,EAAc;AACZ,cAAI,WAAW,QAAX,IACC,WAAW,OAAX,IAAsB,SAAS,QAAT,CAAkB,MAAlB,MAA8B,SADzD,EACqE;;;AAGnE,oBAAQ,QAAR,GAAmB,IAAnB;;;;AAIA,gBAAI,eAAe,SAAS,QAAT,CAAkB,QAAlB,CAAnB;AACA,gBAAI,YAAJ,EAAkB;AAChB,kBAAI,SAAS,SAAS,YAAT,EAAuB,SAAS,QAAhC,EAA0C,GAA1C,CAAb;AACA,kBAAI,OAAO,IAAP,KAAgB,OAApB,EAA6B;;;AAG3B,yBAAS,OAAT;AACA,sBAAM,OAAO,GAAb;AACA;AACD;AACF;;AAED,gBAAI,WAAW,QAAf,EAAyB;;;AAGvB;AACD;AACF;;AAED,cAAI,SAAS,SACX,SAAS,QAAT,CAAkB,MAAlB,CADW,EAEX,SAAS,QAFE,EAGX,GAHW,CAAb;;AAMA,cAAI,OAAO,IAAP,KAAgB,OAApB,EAA6B;AAC3B,oBAAQ,QAAR,GAAmB,IAAnB;;;;AAIA,qBAAS,OAAT;AACA,kBAAM,OAAO,GAAb;AACA;AACD;;;;;AAKD,mBAAS,MAAT;AACA,gBAAM,SAAN;;AAEA,cAAI,OAAO,OAAO,GAAlB;AACA,cAAI,KAAK,IAAT,EAAe;AACb,oBAAQ,SAAS,UAAjB,IAA+B,KAAK,KAApC;AACA,oBAAQ,IAAR,GAAe,SAAS,OAAxB;AACD,WAHD,MAGO;AACL,oBAAQ,sBAAR;AACA,mBAAO,IAAP;AACD;;AAED,kBAAQ,QAAR,GAAmB,IAAnB;AACD;;AAED,YAAI,WAAW,MAAf,EAAuB;;;AAGrB,kBAAQ,IAAR,GAAe,QAAQ,KAAR,GAAgB,GAA/B;AAED,SALD,MAKO,IAAI,WAAW,OAAf,EAAwB;AAC7B,cAAI,UAAU,sBAAd,EAAsC;AACpC,oBAAQ,iBAAR;AACA,kBAAM,GAAN;AACD;;AAED,cAAI,QAAQ,iBAAR,CAA0B,GAA1B,CAAJ,EAAoC;;;AAGlC,qBAAS,MAAT;AACA,kBAAM,SAAN;AACD;AAEF,SAbM,MAaA,IAAI,WAAW,QAAf,EAAyB;AAC9B,kBAAQ,MAAR,CAAe,QAAf,EAAyB,GAAzB;AACD;;AAED,gBAAQ,iBAAR;;AAEA,YAAI,SAAS,SAAS,OAAT,EAAkB,IAAlB,EAAwB,OAAxB,CAAb;AACA,YAAI,OAAO,IAAP,KAAgB,QAApB,EAA8B;;;AAG5B,kBAAQ,QAAQ,IAAR,GACJ,iBADI,GAEJ,sBAFJ;;AAIA,cAAI,OAAO;AACT,mBAAO,OAAO,GADL;AAET,kBAAM,QAAQ;AAFL,WAAX;;AAKA,cAAI,OAAO,GAAP,KAAe,gBAAnB,EAAqC;AACnC,gBAAI,QAAQ,QAAR,IAAoB,WAAW,MAAnC,EAA2C;;;AAGzC,oBAAM,SAAN;AACD;AACF,WAND,MAMO;AACL,mBAAO,IAAP;AACD;AAEF,SAtBD,MAsBO,IAAI,OAAO,IAAP,KAAgB,OAApB,EAA6B;AAClC,kBAAQ,iBAAR;;;AAGA,mBAAS,OAAT;AACA,gBAAM,OAAO,GAAb;AACD;AACF;AACF,KAtID;AAuID;;;;AAID,wBAAsB,EAAtB;;AAEA,KAAG,cAAH,IAAqB,YAAW;AAC9B,WAAO,IAAP;AACD,GAFD;;AAIA,KAAG,iBAAH,IAAwB,WAAxB;;AAEA,KAAG,QAAH,GAAc,YAAW;AACvB,WAAO,oBAAP;AACD,GAFD;;AAIA,WAAS,YAAT,CAAsB,IAAtB,EAA4B;AAC1B,QAAI,QAAQ,EAAE,QAAQ,KAAK,CAAL,CAAV,EAAZ;;AAEA,QAAI,KAAK,IAAT,EAAe;AACb,YAAM,QAAN,GAAiB,KAAK,CAAL,CAAjB;AACD;;AAED,QAAI,KAAK,IAAT,EAAe;AACb,YAAM,UAAN,GAAmB,KAAK,CAAL,CAAnB;AACA,YAAM,QAAN,GAAiB,KAAK,CAAL,CAAjB;AACD;;AAED,SAAK,UAAL,CAAgB,IAAhB,CAAqB,KAArB;AACD;;AAED,WAAS,aAAT,CAAuB,KAAvB,EAA8B;AAC5B,QAAI,SAAS,MAAM,UAAN,IAAoB,EAAjC;AACA,WAAO,IAAP,GAAc,QAAd;AACA,WAAO,OAAO,GAAd;AACA,UAAM,UAAN,GAAmB,MAAnB;AACD;;AAED,WAAS,OAAT,CAAiB,WAAjB,EAA8B;;;;AAI5B,SAAK,UAAL,GAAkB,CAAC,EAAE,QAAQ,MAAV,EAAD,CAAlB;AACA,gBAAY,OAAZ,CAAoB,YAApB,EAAkC,IAAlC;AACA,SAAK,KAAL,CAAW,IAAX;AACD;;AAED,UAAQ,IAAR,GAAe,UAAS,MAAT,EAAiB;AAC9B,QAAI,OAAO,EAAX;AACA,SAAK,IAAI,GAAT,IAAgB,MAAhB,EAAwB;AACtB,WAAK,IAAL,CAAU,GAAV;AACD;AACD,SAAK,OAAL;;;;AAIA,WAAO,SAAS,IAAT,GAAgB;AACrB,aAAO,KAAK,MAAZ,EAAoB;AAClB,YAAI,MAAM,KAAK,GAAL,EAAV;AACA,YAAI,OAAO,MAAX,EAAmB;AACjB,eAAK,KAAL,GAAa,GAAb;AACA,eAAK,IAAL,GAAY,KAAZ;AACA,iBAAO,IAAP;AACD;AACF;;;;;AAKD,WAAK,IAAL,GAAY,IAAZ;AACA,aAAO,IAAP;AACD,KAfD;AAgBD,GAzBD;;AA2BA,WAAS,MAAT,CAAgB,QAAhB,EAA0B;AACxB,QAAI,QAAJ,EAAc;AACZ,UAAI,iBAAiB,SAAS,cAAT,CAArB;AACA,UAAI,cAAJ,EAAoB;AAClB,eAAO,eAAe,IAAf,CAAoB,QAApB,CAAP;AACD;;AAED,UAAI,OAAO,SAAS,IAAhB,KAAyB,UAA7B,EAAyC;AACvC,eAAO,QAAP;AACD;;AAED,UAAI,CAAC,MAAM,SAAS,MAAf,CAAL,EAA6B;AAC3B,YAAI,IAAI,CAAC,CAAT;YAAY,OAAO,SAAS,IAAT,GAAgB;AACjC,iBAAO,EAAE,CAAF,GAAM,SAAS,MAAtB,EAA8B;AAC5B,gBAAI,OAAO,IAAP,CAAY,QAAZ,EAAsB,CAAtB,CAAJ,EAA8B;AAC5B,mBAAK,KAAL,GAAa,SAAS,CAAT,CAAb;AACA,mBAAK,IAAL,GAAY,KAAZ;AACA,qBAAO,IAAP;AACD;AACF;;AAED,eAAK,KAAL,GAAa,SAAb;AACA,eAAK,IAAL,GAAY,IAAZ;;AAEA,iBAAO,IAAP;AACD,SAbD;;AAeA,eAAO,KAAK,IAAL,GAAY,IAAnB;AACD;AACF;;;AAGD,WAAO,EAAE,MAAM,UAAR,EAAP;AACD;AACD,UAAQ,MAAR,GAAiB,MAAjB;;AAEA,WAAS,UAAT,GAAsB;AACpB,WAAO,EAAE,OAAO,SAAT,EAAoB,MAAM,IAA1B,EAAP;AACD;;AAED,UAAQ,SAAR,GAAoB;AAClB,iBAAa,OADK;;AAGlB,WAAO,eAAS,aAAT,EAAwB;AAC7B,WAAK,IAAL,GAAY,CAAZ;AACA,WAAK,IAAL,GAAY,CAAZ;;;AAGA,WAAK,IAAL,GAAY,KAAK,KAAL,GAAa,SAAzB;AACA,WAAK,IAAL,GAAY,KAAZ;AACA,WAAK,QAAL,GAAgB,IAAhB;;AAEA,WAAK,UAAL,CAAgB,OAAhB,CAAwB,aAAxB;;AAEA,UAAI,CAAC,aAAL,EAAoB;AAClB,aAAK,IAAI,IAAT,IAAiB,IAAjB,EAAuB;;AAErB,cAAI,KAAK,MAAL,CAAY,CAAZ,MAAmB,GAAnB,IACA,OAAO,IAAP,CAAY,IAAZ,EAAkB,IAAlB,CADA,IAEA,CAAC,MAAM,CAAC,KAAK,KAAL,CAAW,CAAX,CAAP,CAFL,EAE4B;AAC1B,iBAAK,IAAL,IAAa,SAAb;AACD;AACF;AACF;AACF,KAxBiB;;AA0BlB,UAAM,gBAAW;AACf,WAAK,IAAL,GAAY,IAAZ;;AAEA,UAAI,YAAY,KAAK,UAAL,CAAgB,CAAhB,CAAhB;AACA,UAAI,aAAa,UAAU,UAA3B;AACA,UAAI,WAAW,IAAX,KAAoB,OAAxB,EAAiC;AAC/B,cAAM,WAAW,GAAjB;AACD;;AAED,aAAO,KAAK,IAAZ;AACD,KApCiB;;AAsClB,uBAAmB,2BAAS,SAAT,EAAoB;AACrC,UAAI,KAAK,IAAT,EAAe;AACb,cAAM,SAAN;AACD;;AAED,UAAI,UAAU,IAAd;AACA,eAAS,MAAT,CAAgB,GAAhB,EAAqB,MAArB,EAA6B;AAC3B,eAAO,IAAP,GAAc,OAAd;AACA,eAAO,GAAP,GAAa,SAAb;AACA,gBAAQ,IAAR,GAAe,GAAf;AACA,eAAO,CAAC,CAAC,MAAT;AACD;;AAED,WAAK,IAAI,IAAI,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CAAtC,EAAyC,KAAK,CAA9C,EAAiD,EAAE,CAAnD,EAAsD;AACpD,YAAI,QAAQ,KAAK,UAAL,CAAgB,CAAhB,CAAZ;AACA,YAAI,SAAS,MAAM,UAAnB;;AAEA,YAAI,MAAM,MAAN,KAAiB,MAArB,EAA6B;;;;AAI3B,iBAAO,OAAO,KAAP,CAAP;AACD;;AAED,YAAI,MAAM,MAAN,IAAgB,KAAK,IAAzB,EAA+B;AAC7B,cAAI,WAAW,OAAO,IAAP,CAAY,KAAZ,EAAmB,UAAnB,CAAf;AACA,cAAI,aAAa,OAAO,IAAP,CAAY,KAAZ,EAAmB,YAAnB,CAAjB;;AAEA,cAAI,YAAY,UAAhB,EAA4B;AAC1B,gBAAI,KAAK,IAAL,GAAY,MAAM,QAAtB,EAAgC;AAC9B,qBAAO,OAAO,MAAM,QAAb,EAAuB,IAAvB,CAAP;AACD,aAFD,MAEO,IAAI,KAAK,IAAL,GAAY,MAAM,UAAtB,EAAkC;AACvC,qBAAO,OAAO,MAAM,UAAb,CAAP;AACD;AAEF,WAPD,MAOO,IAAI,QAAJ,EAAc;AACnB,gBAAI,KAAK,IAAL,GAAY,MAAM,QAAtB,EAAgC;AAC9B,qBAAO,OAAO,MAAM,QAAb,EAAuB,IAAvB,CAAP;AACD;AAEF,WALM,MAKA,IAAI,UAAJ,EAAgB;AACrB,gBAAI,KAAK,IAAL,GAAY,MAAM,UAAtB,EAAkC;AAChC,qBAAO,OAAO,MAAM,UAAb,CAAP;AACD;AAEF,WALM,MAKA;AACL,kBAAM,IAAI,KAAJ,CAAU,wCAAV,CAAN;AACD;AACF;AACF;AACF,KAxFiB;;AA0FlB,YAAQ,gBAAS,IAAT,EAAe,GAAf,EAAoB;AAC1B,WAAK,IAAI,IAAI,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CAAtC,EAAyC,KAAK,CAA9C,EAAiD,EAAE,CAAnD,EAAsD;AACpD,YAAI,QAAQ,KAAK,UAAL,CAAgB,CAAhB,CAAZ;AACA,YAAI,MAAM,MAAN,IAAgB,KAAK,IAArB,IACA,OAAO,IAAP,CAAY,KAAZ,EAAmB,YAAnB,CADA,IAEA,KAAK,IAAL,GAAY,MAAM,UAFtB,EAEkC;AAChC,cAAI,eAAe,KAAnB;AACA;AACD;AACF;;AAED,UAAI,iBACC,SAAS,OAAT,IACA,SAAS,UAFV,KAGA,aAAa,MAAb,IAAuB,GAHvB,IAIA,OAAO,aAAa,UAJxB,EAIoC;;;AAGlC,uBAAe,IAAf;AACD;;AAED,UAAI,SAAS,eAAe,aAAa,UAA5B,GAAyC,EAAtD;AACA,aAAO,IAAP,GAAc,IAAd;AACA,aAAO,GAAP,GAAa,GAAb;;AAEA,UAAI,YAAJ,EAAkB;AAChB,aAAK,IAAL,GAAY,aAAa,UAAzB;AACD,OAFD,MAEO;AACL,aAAK,QAAL,CAAc,MAAd;AACD;;AAED,aAAO,gBAAP;AACD,KA1HiB;;AA4HlB,cAAU,kBAAS,MAAT,EAAiB,QAAjB,EAA2B;AACnC,UAAI,OAAO,IAAP,KAAgB,OAApB,EAA6B;AAC3B,cAAM,OAAO,GAAb;AACD;;AAED,UAAI,OAAO,IAAP,KAAgB,OAAhB,IACA,OAAO,IAAP,KAAgB,UADpB,EACgC;AAC9B,aAAK,IAAL,GAAY,OAAO,GAAnB;AACD,OAHD,MAGO,IAAI,OAAO,IAAP,KAAgB,QAApB,EAA8B;AACnC,aAAK,IAAL,GAAY,OAAO,GAAnB;AACA,aAAK,IAAL,GAAY,KAAZ;AACD,OAHM,MAGA,IAAI,OAAO,IAAP,KAAgB,QAAhB,IAA4B,QAAhC,EAA0C;AAC/C,aAAK,IAAL,GAAY,QAAZ;AACD;AACF,KA1IiB;;AA4IlB,YAAQ,gBAAS,UAAT,EAAqB;AAC3B,WAAK,IAAI,IAAI,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CAAtC,EAAyC,KAAK,CAA9C,EAAiD,EAAE,CAAnD,EAAsD;AACpD,YAAI,QAAQ,KAAK,UAAL,CAAgB,CAAhB,CAAZ;AACA,YAAI,MAAM,UAAN,KAAqB,UAAzB,EAAqC;AACnC,eAAK,QAAL,CAAc,MAAM,UAApB,EAAgC,MAAM,QAAtC;AACA,wBAAc,KAAd;AACA,iBAAO,gBAAP;AACD;AACF;AACF,KArJiB;;AAuJlB,aAAS,gBAAS,MAAT,EAAiB;AACxB,WAAK,IAAI,IAAI,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CAAtC,EAAyC,KAAK,CAA9C,EAAiD,EAAE,CAAnD,EAAsD;AACpD,YAAI,QAAQ,KAAK,UAAL,CAAgB,CAAhB,CAAZ;AACA,YAAI,MAAM,MAAN,KAAiB,MAArB,EAA6B;AAC3B,cAAI,SAAS,MAAM,UAAnB;AACA,cAAI,OAAO,IAAP,KAAgB,OAApB,EAA6B;AAC3B,gBAAI,SAAS,OAAO,GAApB;AACA,0BAAc,KAAd;AACD;AACD,iBAAO,MAAP;AACD;AACF;;;;AAID,YAAM,IAAI,KAAJ,CAAU,uBAAV,CAAN;AACD,KAvKiB;;AAyKlB,mBAAe,uBAAS,QAAT,EAAmB,UAAnB,EAA+B,OAA/B,EAAwC;AACrD,WAAK,QAAL,GAAgB;AACd,kBAAU,OAAO,QAAP,CADI;AAEd,oBAAY,UAFE;AAGd,iBAAS;AAHK,OAAhB;;AAMA,aAAO,gBAAP;AACD;AAjLiB,GAApB;AAmLD,CA1oBA;;;;AA8oBC,QAAO,MAAP,yCAAO,MAAP,OAAkB,QAAlB,GAA6B,MAA7B,GACA,QAAO,MAAP,yCAAO,MAAP,OAAkB,QAAlB,GAA6B,MAA7B,GACA,QAAO,IAAP,yCAAO,IAAP,OAAgB,QAAhB,GAA2B,IAA3B,YAhpBD,CAAD;;;;;;;ACVA,QAAQ,IAAR,CACE,mDACE,oDAFJ;;AAKA,OAAO,OAAP,GAAiB,QAAQ,6BAAR,CAAjB;;;;ACJA;;;;;;AAEA,OAAO,OAAP,GAAiB,UAAU,C,WAAV,EAAuB;AAAA,MAChC,iBADgC;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BpC,+BAAa,CAAb,EAAgB,IAAhB,EAAsB;AAAA;;AACpB,WAAK,CAAL,GAAS,CAAT;AACA,UAAI,QAAQ,IAAZ,EAAkB;AAChB,eAAO,EAAP;AACD;AACD,UAAI,KAAK,IAAL,IAAa,IAAb,IAAqB,KAAK,IAAL,KAAc,QAAvC,EAAiD;AAC/C,aAAK,IAAL,GAAY,QAAZ;AACD,OAFD,MAEO,IAAI,KAAK,IAAL,KAAc,OAAlB,EAA2B;AAChC,aAAK,IAAL,GAAY,OAAZ;AACD,OAFM,MAEA;AACL,cAAM,IAAI,KAAJ,CAAU,0CAAV,CAAN;AACD;AACD,WAAK,CAAL,CAAO,EAAP,CAAU,wBAAV,GAAqC,KAAK,wBAAL,IAAiC,KAAtE;AACA,WAAK,IAAL,GAAY,KAAK,IAAjB;AACA,WAAK,WAAL,GAAmB,EAAnB;AACA,WAAK,QAAL,GAAgB,KAAhB;AACA,WAAK,kBAAL,GAA0B,EAA1B;AACA,WAAK,mBAAL,GAA2B,EAA3B;AACA,WAAK,iBAAL,GAAyB,IAAzB;AACA,WAAK,cAAL,GAAsB,EAAtB;AACA,WAAK,uBAAL,GAA+B,KAAK,uBAAL,KAAiC,KAAhE;AACA,WAAK,KAAL,GAAa,KAAK,KAAL,KAAe,IAA5B;AACA,WAAK,aAAL,GAAqB,KAArB;AACA,WAAK,SAAL,GAAiB,QAAQ,OAAR,EAAjB;AACA,WAAK,iBAAL,GAAyB,EAAzB;AACA,WAAK,eAAL,GAAuB,EAAvB;AACD;;AArDmC;AAAA;AAAA,kCAsDvB,CACZ;AAvDmC;AAAA;AAAA,mCAwDtB;AACZ,aAAK,WAAL,GAAmB,EAAnB;AACA,aAAK,QAAL,GAAgB,KAAhB;AACA,aAAK,iBAAL,GAAyB,IAAzB;AACA,aAAK,aAAL,GAAqB,KAArB;AACA,aAAK,cAAL,GAAsB,EAAtB;AACA,aAAK,mBAAL,GAA2B,EAA3B;AACA,eAAO,KAAK,CAAL,CAAO,EAAP,CAAU,oBAAV,EAAP;AACD;AAhEmC;AAAA;AAAA,gCAiEzB,MAjEyB,EAiEjB;AACjB,YAAI,KAAK,MAAL,IAAe,IAAnB,EAAyB;AACvB,eAAK,MAAL,GAAc,MAAd;AACA,iBAAO,KAAK,CAAL,CAAO,EAAP,CAAU,SAAV,CAAoB,MAApB,CAAP;AACD,SAHD,MAGO;AACL,iBAAO,IAAP;AACD;AACF;AAxEmC;AAAA;AAAA,kCAyEvB,CAzEuB,EAyEpB;AACd,aAAK,kBAAL,CAAwB,IAAxB,CAA6B,CAA7B;AACD;AA3EmC;AAAA;AAAA,+BA4E1B,IA5E0B,EA4EpB;AACd,YAAI,KAAK,WAAL,CAAiB,IAAjB,KAA0B,IAA9B,EAAoC;AAClC,iBAAO,KAAK,WAAL,CAAiB,IAAjB,CAAP;AACA,cAAI,SAAS,KAAK,iBAAlB,EAAqC;AACnC,iBAAK,iBAAL,GAAyB,IAAzB;AACA,iBAAK,kBAAL;AACD;AACD,eAAK,cAAL,GAAsB,KAAK,cAAL,CAAoB,MAApB,CAA2B,UAAU,GAAV,EAAe;AAC9D,mBAAO,QAAQ,IAAf;AACD,WAFqB,CAAtB;AANkC;AAAA;AAAA;;AAAA;AASlC,iCAAc,KAAK,kBAAnB,8HAAuC;AAAA,kBAA9B,CAA8B;;AACrC,gBAAE;AACA,wBAAQ,UADR;AAEA,sBAAM;AAFN,eAAF;AAID;AAdiC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAenC;AACF;AA7FmC;AAAA;AAAA,iCA8FxB,IA9FwB,EA8FlB,IA9FkB,EA8FZ;AACtB,YAAI,QAAQ,IAAZ,EAAkB;AAChB,gBAAM,IAAI,KAAJ,CAAU,+CAAV,CAAN;AACD;AACD,YAAI,KAAK,WAAL,CAAiB,IAAjB,KAA0B,IAA9B,EAAoC;AAClC,gBAAM,IAAI,KAAJ,CAAU,2BAAV,CAAN;AACD;AACD,aAAK,WAAL,CAAiB,IAAjB,IAAyB;AACvB,oBAAU,KADa;AAEvB,gBAAM;AAFiB,SAAzB;AAPsB;AAAA;AAAA;;AAAA;AAWtB,gCAAc,KAAK,kBAAnB,mIAAuC;AAAA,gBAA9B,CAA8B;;AACrC,cAAE;AACA,sBAAQ,YADR;AAEA,oBAAM,IAFN;AAGA,oBAAM;AAHN,aAAF;AAKD;AAjBqB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAkBtB,YAAI,KAAK,iBAAL,IAA0B,IAA9B,EAAoC;AAClC,eAAK,kBAAL;AACD;AACF;;;;AAnHmC;AAAA;AAAA,iCAsHxB,CAtHwB,EAsHrB;AACb,YAAI,KAAK,QAAT,EAAmB;AACjB;AACD,SAFD,MAEO;AACL,eAAK,mBAAL,CAAyB,IAAzB,CAA8B,CAA9B;AACD;AACF;;;;;;AA5HmC;AAAA;AAAA,2CAkId;AACpB,YAAI,KAAK,iBAAL,IAA0B,IAA1B,IAAkC,KAAK,QAA3C,EAAqD;AACnD,iB;AACD;;AAED,YAAI,WAAW,IAAf;AACA,aAAK,IAAI,GAAT,IAAgB,KAAK,WAArB,EAAkC;AAChC,cAAI,CAAC,KAAK,WAAL,CAAiB,GAAjB,EAAsB,QAA3B,EAAqC;AACnC,uBAAW,GAAX;AACA;AACD;AACF;AACD,YAAI,OAAO,IAAX;AACA,YAAI,YAAY,IAAhB,EAAsB;AACpB,eAAK,iBAAL,GAAyB,QAAzB;AACA,eAAK,CAAL,CAAO,EAAP,CAAU,kBAAV,yBAA6B;AAAA,gBACvB,QADuB,EAEvB,SAFuB;AAAA;AAAA;AAAA;AAAA;AAAA,kDACL,KAAK,WAAL,EADK;;AAAA;AACvB,4BADuB;AAAA,kDAEJ,KAAK,YAAL,EAFI;;AAAA;AAEvB,6BAFuB;;AAG3B,yBAAK,IAAL,CAAU,QAAV,EAAoB;AAClB,4BAAM,aADY;AAElB,gCAAU,QAFQ;AAGlB,iCAAW,SAHO;AAIlB,uCAAiB,KAAK;AAJJ,qBAApB;;AAH2B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,WAA7B;AAUD,SAZD,MAYO;AACL,eAAK,CAAL,CAAO,EAAP,CAAU,kBAAV,yBAA6B;AAAA,qGAKlB,CALkB;;AAAA;AAAA;AAAA;AAAA;;AAE3B,yBAAK,QAAL,GAAgB,IAAhB;AAF2B,mDAGpB,KAAK,uBAAL,EAHoB;;AAAA;;AAAA;AAAA;AAAA;AAAA;AAK3B,sCAAc,KAAK,mBAAnB,2HAAwC;AAA/B,uBAA+B;;AACtC;AACD;AAP0B;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAQ3B,yBAAK,mBAAL,GAA2B,EAA3B;;AAR2B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,WAA7B;AAUD;AACF;AAvKmC;AAAA;AAAA,2BAwK9B,GAxK8B,EAwKzB,OAxKyB,EAwKhB;AAClB,YAAI,KAAK,KAAT,EAAgB;AACd,kBAAQ,GAAR,WAAoB,KAAK,MAAzB,YAAsC,GAAtC,UAA8C,QAAQ,IAAtD,EAA8D,OAA9D,E;AACD;AACF;;;;;AA5KmC;AAAA;AAAA,mCAgLtB,GAhLsB,EAgLjB;AACjB,cAAM,IAAI,GAAJ,CAAQ,UAAU,EAAV,EAAc;AAC1B,iBAAO,EAAE,MAAF,CAAS,GAAG,MAAZ,EAAoB,MAApB,CAA2B,EAA3B,CAAP;AACD,SAFK,CAAN;AAGA,YAAI,OAAO,IAAX;AACA,iBAAS,mBAAT,GAAgC;AAC9B,cAAI,KAAK,iBAAL,CAAuB,MAAvB,GAAgC,CAApC,EAAuC;AACrC,iBAAK,SAAL,CAAe;AACb,oBAAM,QADO;AAEb,mBAAK,KAAK;AAFG,aAAf;AAIA,iBAAK,iBAAL,GAAyB,EAAzB;AACD;AACF;AACD,YAAI,KAAK,iBAAL,CAAuB,MAAvB,KAAkC,CAAtC,EAAyC;AACvC,eAAK,iBAAL,GAAyB,GAAzB;AACA,cAAI,KAAK,CAAL,CAAO,EAAP,CAAU,qBAAd,EAAqC;AACnC,iBAAK,CAAL,CAAO,EAAP,CAAU,wBAAV,GAAqC,IAArC,CAA0C,mBAA1C;AACD,WAFD,MAEO;AACL,uBAAW,mBAAX,EAAgC,CAAhC;AACD;AACF,SAPD,MAOO;AACL,eAAK,iBAAL,GAAyB,KAAK,iBAAL,CAAuB,MAAvB,CAA8B,GAA9B,CAAzB;AACD;AACF;;;;;AAxMmC;AAAA;AAAA,qCA4MpB,M,cA5MoB,EA4MC,O,eA5MD,EA4MwB;AAAA;;AAC1D,YAAI,WAAW,KAAK,MAApB,EAA4B;AAC1B;AACD;AACD,YAAI,KAAK,KAAT,EAAgB;AACd,kBAAQ,GAAR,cAAuB,MAAvB,YAAoC,KAAK,MAAzC,UAAoD,QAAQ,IAA5D,EAAoE,KAAK,KAAL,CAAW,KAAK,SAAL,CAAe,OAAf,CAAX,CAApE,E;AACD;AACD,YAAI,QAAQ,eAAR,IAA2B,IAA3B,IAAmC,QAAQ,eAAR,KAA4B,KAAK,eAAxE,EAAyF;AACvF,kBAAQ,KAAR,mGAEU,KAAK,eAFf,kBAE2C,QAAQ,eAFnD;AAKA,eAAK,IAAL,CAAU,MAAV,EAAkB;AAChB,kBAAM,WADU;AAEhB,6BAAiB,KAAK;AAFN,WAAlB;AAIA;AACD;AACD,YAAI,QAAQ,IAAR,KAAiB,aAArB,EAAoC;AAAA;AAClC,gBAAI,YAAJ;AACA,gBAAI,IAAI,OAAR;AACA,kBAAK,CAAL,CAAO,EAAP,CAAU,kBAAV,yBAA6B;AAAA,kBACvB,eADuB,EAIvB,EAJuB,EAKvB,GALuB;AAAA;AAAA;AAAA;AAAA;AAAA,qDACE,KAAK,WAAL,EADF;;AAAA;AACvB,qCADuB;AAAA,qDAEpB,KAAK,cAAL,CAAoB,EAAE,SAAtB,CAFoB;;AAAA;AAAA,qDAIX,KAAK,YAAL,EAJW;;AAAA;AAIvB,wBAJuB;AAAA,qDAKV,KAAK,aAAL,CAAmB,EAAE,QAArB,CALU;;AAAA;AAKvB,yBALuB;;AAM3B,2BAAK,IAAL,CAAU,MAAV,EAAkB;AAChB,8BAAM,aADU;AAEhB,4BAAI,GAFY;AAGhB,kCAAU,eAHM;AAIhB,mCAAW,EAJK;AAKhB,yCAAiB,KAAK;AALN,uBAAlB;AAOA,0BAAI,KAAK,uBAAT,EAAkC;AAChC,6BAAK,cAAL,CAAoB,IAApB,CAAyB,MAAzB;AACA,mCAAW,YAAY;AACrB,+BAAK,cAAL,GAAsB,KAAK,cAAL,CAAoB,MAApB,CAA2B,UAAU,GAAV,EAAe;AAC9D,mCAAO,QAAQ,MAAf;AACD,2BAFqB,CAAtB;AAGA,+BAAK,IAAL,CAAU,MAAV,EAAkB;AAChB,kCAAM;AADU,2BAAlB;AAGD,yBAPD,EAOG,IAPH,E;AAQD,uBAVD,MAUO;AACL,+BAAK,IAAL,CAAU,MAAV,EAAkB;AAChB,kCAAM;AADU,2BAAlB;AAGD;AACD,2BAAK,cAAL,CAAoB,MAApB;;AA5B2B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,aAA7B;AAHkC;AAiCnC,SAjCD,MAiCO,IAAI,QAAQ,IAAR,KAAiB,aAArB,EAAoC;AAAA,cAErC,WAFqC;AAAA,cAIrC,EAJqC;AAAA,cAKrC,KALqC;;AAAA;AACzC,gBAAI,YAAJ;AACI,0BAAc,CAAC,MAAK,aAFiB;;AAGzC,kBAAK,aAAL,GAAqB,IAArB;AACI,iBAAK,MAAK,CAAL,CAAO,EAJyB;AAKrC,oBAAQ,EAL6B;;AAMzC,kBAAM,OAAN,GAAgB,IAAI,OAAJ,CAAY,UAAU,OAAV,EAAmB;AAC7C,oBAAM,OAAN,GAAgB,OAAhB;AACD,aAFe,CAAhB;AAGA,kBAAK,SAAL,GAAiB,MAAM,OAAvB;AACA,gBAAI,C,wBAAA,GAA4B,OAAhC;AACA,eAAG,kBAAH,yBAAsB;AAAA;AAAA;AAAA;AAAA;AAAA,qDACb,KAAK,cAAL,CAAoB,EAAE,SAAtB,CADa;;AAAA;AAEpB,2BAAK,KAAL,CAAW,KAAX,CAAiB,EAAE,EAAnB;AACA,yBAAG,kBAAH,yBAAsB;AAAA,4BAChB,GADgB;AAAA;AAAA;AAAA;AAAA;AAAA,+DACH,KAAK,aAAL,CAAmB,EAAE,QAArB,CADG;;AAAA;AAChB,mCADgB;;AAEpB,oCAAI,IAAI,MAAJ,GAAa,CAAjB,EAAoB;AAClB,sCAAI,CAAC,WAAL,EAAkB;;AAChB,yCAAK,IAAL,CAAU,MAAV,EAAkB;AAChB,4CAAM,QADU;AAEhB,2CAAK;AAFW,qCAAlB;AAID,mCALD,MAKO;;AAEL,yCAAK,YAAL,CAAkB,GAAlB;AACD;AACF;AACD,sCAAM,OAAN;;AAboB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uBAAtB;;AAHoB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,aAAtB;AAXyC;AA8B1C,SA9BM,MA8BA,IAAI,QAAQ,IAAR,KAAiB,WAArB,EAAkC;AACvC,cAAI,OAAO,IAAX;AACA,eAAK,SAAL,CAAe,IAAf,CAAoB,YAAY;AAC9B,iBAAK,cAAL,CAAoB,MAApB;AACD,WAFD;AAGD,SALM,MAKA,IAAI,QAAQ,IAAR,KAAiB,QAArB,EAA+B;AACpC,cAAI,KAAK,uBAAT,EAAkC;AAAA;AAAA;AAAA;;AAAA;AAChC,oCAAmB,KAAK,cAAxB,mIAAwC;AAAA,oBAA/B,MAA+B;;AACtC,qBAAK,IAAL,CAAU,MAAV,EAAkB,OAAlB;AACD;AAH+B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAIjC;AACD,cAAI,KAAK,CAAL,CAAO,EAAP,CAAU,wBAAd,EAAwC;AACtC,gBAAI,SAAS,QAAQ,GAAR,CAAY,MAAZ,CAAmB,UAAU,CAAV,EAAa;AAC3C,qBAAO,EAAE,MAAF,KAAa,QAApB;AACD,aAFY,CAAb;AAGA,gBAAI,OAAO,MAAP,GAAgB,CAApB,EAAuB;AACrB,mBAAK,YAAL,CAAkB,MAAlB;AACD;AACF;AACD,eAAK,CAAL,CAAO,EAAP,CAAU,KAAV,CAAgB,QAAQ,GAAxB;AACD;AACF;AAnTmC;AAAA;AAAA,qCAoTpB,IApToB,EAoTd;AACpB,YAAI,OAAO,KAAK,WAAL,CAAiB,IAAjB,CAAX;AACA,YAAI,QAAQ,IAAZ,EAAkB;AAChB,eAAK,QAAL,GAAgB,IAAhB;AACD;AACD,YAAI,SAAS,KAAK,iBAAlB,EAAqC;AACnC,eAAK,iBAAL,GAAyB,IAAzB;AACA,eAAK,kBAAL;AACD;AACF;;;;;;;;;;;;AA7TmC;AAAA;AAAA,0CA2Uf,C,WA3Ue,EA2UF;AAChC,iBAAS,UAAT,CAAqB,IAArB,EAA2B;AAAA;AAAA;AAAA;;AAAA;AACzB,kCAAc,KAAK,QAAnB,mIAA6B;AAAA,kBAApB,CAAoB;;AAC3B,kBAAI,EAAE,YAAF,CAAe,SAAf,MAA8B,MAAlC,EAA0C;AACxC,uBAAO,WAAW,CAAX,CAAP;AACD,eAFD,MAEO;AACL,uBAAO,YAAY,CAAZ,CAAP;AACD;AACF;AAPwB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAQ1B;AACD,iBAAS,WAAT,CAAsB,I,WAAtB,EAAsC;AACpC,cAAI,OAAO,EAAX;AACA,eAAK,IAAI,QAAT,IAAqB,KAAK,KAA1B,EAAiC;AAC/B,gBAAI,QAAQ,KAAK,KAAL,CAAW,QAAX,CAAZ;AACA,gBAAI,MAAM,SAAS,KAAT,EAAgB,EAAhB,CAAV;AACA,gBAAI,MAAM,GAAN,KAAe,KAAK,GAAN,KAAe,KAAjC,EAAwC;AACtC,mBAAK,QAAL,IAAiB,KAAjB;AACD,aAFD,MAEO;AACL,mBAAK,QAAL,IAAiB,GAAjB;AACD;AACF;AACD,eAAK,IAAI,C,WAAT,IAAwB,KAAK,QAA7B,EAAuC;AACrC,gBAAI,OAAO,EAAE,IAAb;AACA,gBAAI,EAAE,YAAF,CAAe,SAAf,MAA8B,MAAlC,EAA0C;AACxC,mBAAK,IAAL,IAAa,WAAW,CAAX,CAAb;AACD,aAFD,MAEO;AACL,mBAAK,IAAL,IAAa,YAAY,CAAZ,CAAb;AACD;AACF;AACD,iBAAO,IAAP;AACD;AACD,oBAAY,CAAZ;AACD;;;;;;;;;;;;AA3WmC;AAAA;AAAA,yCAsXhB,GAtXgB,EAsXX,GAtXW,EAsXN;;AAE5B,iBAAS,YAAT,CAAuB,CAAvB,EAA0B,IAA1B,EAAgC;AAC9B,eAAK,IAAI,IAAT,IAAiB,IAAjB,EAAuB;AACrB,gBAAI,QAAQ,KAAK,IAAL,CAAZ;AACA,gBAAI,QAAQ,IAAZ,EAAkB;;AAEjB,aAFD,MAEO,IAAI,MAAM,WAAN,KAAsB,MAA1B,EAAkC;AACvC,6BAAa,EAAE,CAAF,CAAI,IAAJ,CAAb,EAAwB,KAAxB;AACD,eAFM,MAEA,IAAI,MAAM,WAAN,KAAsB,KAA1B,EAAiC;AACtC,4BAAY,EAAE,CAAF,CAAI,IAAJ,CAAZ,EAAuB,KAAvB;AACD,eAFM,MAEA;AACL,kBAAE,YAAF,CAAe,IAAf,EAAqB,KAArB;AACD;AACF;AACF;AACD,iBAAS,WAAT,CAAsB,CAAtB,EAAyB,KAAzB,EAAgC;AAC9B,YAAE,YAAF,CAAe,SAAf,EAA0B,MAA1B;AAD8B;AAAA;AAAA;;AAAA;AAE9B,kCAAc,KAAd,mIAAqB;AAAA,kBAAZ,CAAY;;AACnB,kBAAI,EAAE,WAAF,KAAkB,MAAtB,EAA8B;AAC5B,6BAAa,EAAE,CAAF,CAAI,eAAJ,CAAb,EAAmC,CAAnC;AACD,eAFD,MAEO;AACL,4BAAY,EAAE,CAAF,CAAI,eAAJ,CAAZ,EAAkC,CAAlC;AACD;AACF;AAR6B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAS/B;AACD,YAAI,IAAI,WAAJ,KAAoB,MAAxB,EAAgC;AAC9B,uBAAa,IAAI,CAAJ,CAAM,GAAN,EAAW,EAAE,OAAO,iCAAT,EAAX,CAAb,EAAuE,GAAvE;AACD,SAFD,MAEO,IAAI,IAAI,WAAJ,KAAoB,KAAxB,EAA+B;AACpC,sBAAY,IAAI,CAAJ,CAAM,GAAN,EAAW,EAAE,OAAO,iCAAT,EAAX,CAAZ,EAAsE,GAAtE;AACD,SAFM,MAEA;AACL,gBAAM,IAAI,KAAJ,CAAU,2BAAV,CAAN;AACD;AACF;AAvZmC;;AAAA;AAAA;;AAyZtC,IAAE,iBAAF,GAAsB,iBAAtB;AACD,CA1ZD;;;;ACFA;;;;;;;;;;;;AAEA,OAAO,OAAP,GAAiB,UAAU,CAAV,EAAa;AAC5B,MAAI,aAAa;AACf,WAAO,EADQ;AAEf,aAAS,EAFM,E;AAGf,gBAAY,oBAAU,IAAV,EAAgB;AAC1B,WAAK,IAAI,CAAT,IAAc,KAAK,KAAnB,EAA0B;AACxB,aAAK,KAAL,CAAW,CAAX,EAAc,QAAd,CAAuB,IAAvB;AACD;AACD,aAAO,KAAK,KAAL,CAAW,IAAX,CAAP;AACA,aAAO,KAAK,OAAL,CAAa,IAAb,CAAP;AACD,KATc;AAUf,aAAS,iBAAU,SAAV,EAAqB;AAC5B,WAAK,KAAL,CAAW,UAAU,MAArB,IAA+B,SAA/B;AACA,WAAK,OAAL,CAAa,UAAU,MAAvB,IAAiC,EAAjC;AACA,WAAK,IAAI,KAAT,IAAkB,KAAK,KAAvB,EAA8B;AAC5B,YAAI,UAAU,UAAU,MAAxB,EAAgC;AAC9B,cAAI,IAAI,KAAK,KAAL,CAAW,KAAX,CAAR;AACA,YAAE,UAAF,CAAa,UAAU,MAAvB,EAA+B,QAA/B;AACA,oBAAU,UAAV,CAAqB,EAAE,MAAvB,EAA+B,QAA/B;AACD;AACF;AACF,KApBc;AAqBf,8BAA0B,oCAAY;AACpC,UAAI,KAAK,EAAT;AACA,WAAK,IAAI,IAAT,IAAiB,KAAK,KAAtB,EAA6B;AAC3B,WAAG,IAAH,CAAQ,KAAK,KAAL,CAAW,IAAX,EAAiB,CAAjB,CAAmB,EAAnB,CAAsB,wBAAtB,EAAR;AACD;AACD,aAAO,QAAQ,GAAR,CAAY,EAAZ,CAAP;AACD,KA3Bc;AA4Bf,cAAU,SAAS,QAAT,GAAqB;AAC7B,UAAI,OAAO,EAAX;AACA,WAAK,IAAI,QAAT,IAAqB,WAAW,OAAhC,EAAyC;AACvC,YAAI,OAAO,WAAW,OAAX,CAAmB,QAAnB,CAAX;AACA,YAAI,OAAO,KAAX;AACA,aAAK,IAAI,MAAT,IAAmB,IAAnB,EAAyB;AACvB,cAAI,KAAK,MAAL,EAAa,MAAb,GAAsB,CAA1B,EAA6B;AAC3B,mBAAO,IAAP;AACA;AACD;AACF;AACD,YAAI,IAAJ,EAAU;AACR,eAAK,IAAL,CAAU,QAAV;AACD;AACF;AACD,UAAI,KAAK,MAAL,GAAc,CAAlB,EAAqB;AACnB,YAAI,SAAS,UAAU,IAAV,CAAb;AACA,YAAI,QAAO,WAAW,OAAX,CAAmB,MAAnB,CAAX;AACA,YAAI,UAAS,UAAU,OAAO,IAAP,CAAY,KAAZ,CAAV,CAAb;AACA,YAAI,IAAI,MAAK,OAAL,EAAa,KAAb,EAAR;AACA,YAAI,MAAK,OAAL,EAAa,MAAb,KAAwB,CAA5B,EAA+B;AAC7B,iBAAO,MAAK,OAAL,CAAP;AACD;AACD,YAAI,OAAO,WAAW,KAAX,CAAiB,MAAjB,CAAX;AACA,aAAK,cAAL,CAAoB,EAAE,CAAF,CAApB,EAA0B,EAAE,CAAF,CAA1B;AACA,eAAO,KAAK,CAAL,CAAO,EAAP,CAAU,wBAAV,EAAP;AACD,OAXD,MAWO;AACL,eAAO,KAAP;AACD;AACF,KAzDc;AA0Df,cAAU,oBAAY;AACpB,aAAO,IAAI,OAAJ,CAAY,UAAU,OAAV,EAAmB;;;AAGpC,iBAAS,SAAT,GAAsB;AACpB,cAAI,IAAI,WAAW,QAAX,EAAR;AACA,cAAI,CAAJ,EAAO;AACL,mBAAO,CAAP,EAAU;AACR,kBAAI,WAAW,QAAX,EAAJ;AACD;AACD,uBAAW,wBAAX,GAAsC,IAAtC,CAA2C,SAA3C;AACD,WALD,MAKO;AACL,uBAAW,YAAY;AACrB,kBAAI,IAAI,WAAW,QAAX,EAAR;AACA,kBAAI,CAAJ,EAAO;AACL,kBAAE,IAAF,CAAO,YAAY;AACjB,6BAAW,wBAAX,GAAsC,IAAtC,CAA2C,SAA3C;AACD,iBAFD;AAGD,eAJD,MAIO;AACL;AACD;AACF,aATD,EASG,CATH;AAUD;AACF;AACD,mBAAW,wBAAX,GAAsC,IAAtC,CAA2C,SAA3C;AACD,OAxBM,CAAP;AAyBD;AApFc,GAAjB;AAsFA,IAAE,KAAF,CAAQ,UAAR,GAAqB,UAArB;;AAEA,MAAI,gBAAgB,CAApB;;AAzF4B,MA2FtB,IA3FsB;AAAA;;AA4F1B,kBAAa,CAAb,EAAgB,OAAhB,EAAyB;AAAA;;AACvB,UAAI,YAAY,SAAhB,EAA2B;AACzB,cAAM,IAAI,KAAJ,CAAU,gCAAV,CAAN;AACD;AACD,cAAQ,IAAR,GAAe,QAAf;AACA,cAAQ,uBAAR,GAAkC,KAAlC;;AALuB,0FAMjB,CANiB,EAMd,OANc;;AAOvB,YAAK,SAAL,CAAgB,eAAD,GAAoB,EAAnC,EAAuC,IAAvC,CAA4C,YAAM;AAChD,mBAAW,OAAX;AACD,OAFD;AAGA,YAAK,UAAL,GAAkB,UAAlB;AACA,YAAK,qBAAL,GAA6B,CAA7B;AAXuB;AAYxB;;AAxGyB;AAAA;AAAA,qCAyGV,MAzGU,EAyGF,CAzGE,EAyGC;AACzB,uFAAqB,MAArB,EAA6B,KAAK,KAAL,CAAW,KAAK,SAAL,CAAe,CAAf,CAAX,CAA7B;AACD;AA3GyB;AAAA;AAAA,2BA4GpB,MA5GoB,EA4GZ,OA5GY,EA4GH;AACrB,YAAI,SAAS,WAAW,OAAX,CAAmB,MAAnB,CAAb;AACA,YAAI,UAAU,IAAd,EAAoB;AAClB,cAAI,OAAO,KAAK,MAAZ,KAAuB,IAA3B,EAAiC;AAC/B,mBAAO,KAAK,MAAZ,IAAsB,EAAtB;AACD;AACD,iBAAO,KAAK,MAAZ,EAAoB,IAApB,CAAyB,KAAK,KAAL,CAAW,KAAK,SAAL,CAAe,CAAC,KAAK,MAAN,EAAc,OAAd,CAAf,CAAX,CAAzB;AACD;AACF;AApHyB;AAAA;AAAA,gCAqHf,OArHe,EAqHN;AAClB,aAAK,IAAI,GAAT,IAAgB,WAAW,OAA3B,EAAoC;AAClC,cAAI,OAAO,WAAW,OAAX,CAAmB,GAAnB,CAAX;AACA,cAAI,KAAK,KAAK,MAAV,KAAqB,IAAzB,EAA+B;AAC7B,iBAAK,KAAK,MAAV,IAAoB,EAApB;AACD;AACD,eAAK,KAAK,MAAV,EAAkB,IAAlB,CAAuB,KAAK,KAAL,CAAW,KAAK,SAAL,CAAe,CAAC,KAAK,MAAN,EAAc,OAAd,CAAf,CAAX,CAAvB;AACD;AACF;AA7HyB;AAAA;AAAA,uCA8HR;AAChB,eAAO,WAAW,KAAX,CAAiB,KAAK,MAAtB,KAAiC,IAAxC;AACD;AAhIyB;AAAA;AAAA,kCAiIb;AACX,YAAI,KAAK,cAAL,EAAJ,EAA2B;AACzB,qBAAW,OAAX,CAAmB,IAAnB;AACA;AACD;AACD,eAAO,EAAE,KAAF,CAAQ,UAAR,CAAmB,QAAnB,EAAP;AACD;AAvIyB;AAAA;AAAA,mCAwIZ;AACZ,YAAI,CAAC,KAAK,cAAL,EAAL,EAA4B;AAC1B,qBAAW,UAAX,CAAsB,KAAK,MAA3B;AACA;AACD;AACD,eAAO,KAAK,CAAL,CAAO,EAAP,CAAU,wBAAV,EAAP;AACD;AA9IyB;AAAA;AAAA,8BA+IjB;AACP,YAAI,OAAO,IAAX;AACA,eAAO,8BAAM;AAAA,cACP,IADO,EAGL,MAHK,EAIL,CAJK;AAAA;AAAA;AAAA;AAAA;AACP,sBADO,GACA,WAAW,OAAX,CAAmB,KAAK,MAAxB,CADA;;AAEX,yBAAO,OAAO,IAAP,CAAY,IAAZ,EAAkB,MAAlB,GAA2B,CAAlC,EAAqC;AAC/B,0BAD+B,GACtB,UAAU,OAAO,IAAP,CAAY,IAAZ,CAAV,CADsB;AAE/B,qBAF+B,GAE3B,KAAK,MAAL,EAAa,KAAb,EAF2B;;AAGnC,wBAAI,KAAK,MAAL,EAAa,MAAb,KAAwB,CAA5B,EAA+B;AAC7B,6BAAO,KAAK,MAAL,CAAP;AACD;AACD,yBAAK,cAAL,CAAoB,EAAE,CAAF,CAApB,EAA0B,EAAE,CAAF,CAA1B;AACD;AATU;AAAA,yBAUL,KAAK,wBAAL,EAVK;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,SAAN,EAAP;AAYD;AA7JyB;;AAAA;AAAA,IA2FT,EAAE,iBA3FO;;AAgK5B,IAAE,IAAF,GAAS,IAAT;AACD,CAjKD;;;;ACFA;;;;;;AAEA,OAAO,OAAP,GAAiB,UAAU,C,WAAV,EAAwB;;;;;;;;;;;;;AAAA,MAajC,gBAbiC;;;;;;;;;;;;;;;;;;;;;;;;AAoCrC,8BAAa,CAAb,EAAgB,IAAhB,EAAsB;AAAA;;AACpB,WAAK,CAAL,GAAS,CAAT;AACA,UAAI,KAAK,IAAT;AACA,WAAK,MAAL,GAAc,IAAd;AACA,UAAI,OAAJ;AACA,WAAK,aAAL,GAAqB,IAAI,OAAJ,CAAY,UAAU,CAAV,EAAa;AAC5C,kBAAU,CAAV;AACD,OAFoB,CAArB;AAGA,WAAK,aAAL,CAAmB,OAAnB,GAA6B,OAA7B;;AAEA,WAAK,wBAAL,GAAgC,KAAhC;;AAEA,WAAK,aAAL,GAAqB,EAArB;;AAEA,WAAK,uBAAL,GAA+B,EAA/B;;AAEA,WAAK,2BAAL,GAAmC,KAAnC;;;;;;;;;;;;AAaA,WAAK,gBAAL,GAAwB,EAAxB;AACA,WAAK,mBAAL,GAA2B,EAA3B;AACA,WAAK,qBAAL,GAA6B,KAA7B;AACA,WAAK,oBAAL,GAA4B,KAA5B;AACA,UAAI,OAAO,wBAAP,KAAoC,WAAxC,EAAqD;AACnD,aAAK,YAAL,GAAoB,EAApB;AACD;AACD,WAAK,GAAL,GAAW,EAAX,C;AACA,WAAK,GAAL,GAAW,EAAX,C;AACA,WAAK,SAAL,GAAiB,CAAC,KAAK,SAAN,GAAkB,KAAlB,GAA0B,KAAK,UAAhD;AACA,eAAS,cAAT,GAA2B;AACzB,eAAO,GAAG,wBAAH,GAA8B,IAA9B,CAAmC,YAAY;AACpD,cAAI,GAAG,GAAH,CAAO,MAAP,GAAgB,CAAhB,IAAqB,GAAG,GAAH,CAAO,MAAP,GAAgB,CAAzC,EAA4C;AAC1C,gBAAI,CAAC,GAAG,CAAH,CAAK,WAAL,EAAL,EAAyB;AACvB,sBAAQ,IAAR,CAAa,uCAAb;AACD;AACD,mBAAO,IAAI,OAAJ,CAAY,UAAC,OAAD,EAAa;AAC9B,iBAAG,kBAAH,yBAAsB;AAAA,oBAET,CAFS,EAGZ,GAHY;AAAA;AAAA;AAAA;AAAA;AAAA,8BAChB,GAAG,CAAH,CAAK,SAAL,IAAkB,IAAlB,IAA0B,GAAG,CAAH,CAAK,SAAL,CAAe,QADzB;AAAA;AAAA;AAAA;;AAET,yBAFS,GAEL,CAFK;;AAAA;AAAA,8BAEF,IAAI,GAAG,GAAH,CAAO,MAFT;AAAA;AAAA;AAAA;;AAGZ,2BAHY,GAGN,GAAG,GAAH,CAAO,CAAP,CAHM;AAAA,sDAIT,KAAK,uBAAL,CAA6B,GAA7B,CAJS;;AAAA;AAEiB,2BAFjB;AAAA;AAAA;;AAAA;AAMlB,2BAAG,GAAH,GAAS,GAAG,GAAZ;AACA,2BAAG,GAAH,GAAS,EAAT;;AAPkB;;AAUpB,4BAAI,GAAG,SAAH,GAAe,CAAnB,EAAsB;AACpB,6BAAG,UAAH,GAAgB,WAAW,cAAX,EAA2B,GAAG,SAA9B,CAAhB;AACD;AACD;;AAboB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,eAAtB;AAeD,aAhBM,CAAP;AAiBD,WArBD,MAqBO;;AAEL,gBAAI,GAAG,SAAH,GAAe,CAAnB,EAAsB;AACpB,iBAAG,UAAH,GAAgB,WAAW,cAAX,EAA2B,GAAG,SAA9B,CAAhB;AACD;AACD,mBAAO,QAAQ,OAAR,EAAP;AACD;AACF,SA7BM,CAAP;AA8BD;AACD,WAAK,cAAL,GAAsB,cAAtB;AACA,UAAI,KAAK,SAAL,GAAiB,CAArB,EAAwB;AACtB;AACD;AACF;;AA/GoC;AAAA;AAAA,4CAgHd,EAhHc,EAgHV;AACzB,YAAI,KAAK,CAAL,CAAO,WAAP,EAAJ,EAA0B;AACxB,eAAK,GAAL,CAAS,IAAT,CAAc,EAAd;AACD;AACF;AApHoC;AAAA;AAAA,8CAqHZ;AAAA;;AACvB,eAAO,IAAI,OAAJ,CAAY,mBAAW;AAC5B,cAAI,QAAQ,SAAR,KAAQ,GAAM;AAChB,gBAAI,MAAK,GAAL,CAAS,MAAT,GAAkB,CAAlB,IAAuB,MAAK,GAAL,CAAS,MAAT,GAAkB,CAA7C,EAAgD;AAC9C,oBAAK,cAAL,GAAsB,IAAtB,CAA2B,KAA3B;AACD,aAFD,MAEO;AACL;AACD;AACF,WAND;AAOA,qBAAW,KAAX,EAAkB,CAAlB;AACD,SATM,CAAP;AAUD;AAhIoC;AAAA;AAAA,mCAiIvB;AACZ,YAAI,OAAO,wBAAP,KAAoC,WAAxC,EAAqD;AACnD,cAAI,O,cAAA,GAAwB,MAAM,SAAN,CAAgB,GAAhB,CAAoB,IAApB,CAAyB,SAAzB,EAAoC,UAAU,CAAV,EAAa;AAC3E,gBAAI,OAAO,CAAP,KAAa,QAAjB,EAA2B;AACzB,qBAAO,CAAP;AACD,aAFD,MAEO;AACL,qBAAO,KAAK,SAAL,CAAe,CAAf,CAAP;AACD;AACF,WAN2B,EAMzB,IANyB,CAMpB,EANoB,EAMhB,OANgB,CAMR,IANQ,EAMF,GANE,EAMG,OANH,CAMW,IANX,EAMiB,IANjB,EAMuB,OANvB,CAM+B,IAN/B,EAMqC,IANrC,CAA5B;AAOA,eAAK,YAAL,CAAkB,IAAlB,CAAuB,OAAvB;AACD;AACF;AA5IoC;AAAA;AAAA,qCA6IrB;AACd,gBAAQ,GAAR,CAAY,KAAK,YAAL,CAAkB,IAAlB,CAAuB,IAAvB,CAAZ;AACD;AA/IoC;AAAA;AAAA,6CAgJb;AACtB,YAAI,OAAO,IAAX;AACA,eAAO,IAAI,OAAJ,CAAY,UAAU,OAAV,EAAmB;AACpC,eAAK,kBAAL,yBAAwB;AAAA,gBAClB,I,qBADkB,EAIb,CAJa,EAKhB,EALgB;AAAA;AAAA;AAAA;AAAA;AAClB,wBADkB,GACU,KAAK,GAAL,CAAS,MAAT,CAAgB,KAAK,GAArB,CADV;;AAEtB,yBAAK,GAAL,GAAW,EAAX;AACA,yBAAK,GAAL,GAAW,EAAX;AACS,qBAJa,GAIT,CAJS;;AAAA;AAAA,0BAIN,IAAI,KAAK,MAJH;AAAA;AAAA;AAAA;;AAAA,mDAKJ,KAAK,YAAL,CAAkB,KAAK,CAAL,CAAlB,CALI;;AAAA;AAKhB,sBALgB;;AAAA,0BAMhB,MAAM,IANU;AAAA;AAAA;AAAA;;AAOlB,2BAAO,GAAG,EAAV;AAPkB,mDAQX,KAAK,YAAL,CAAkB,EAAlB,CARW;;AAAA;AAIW,uBAJX;AAAA;AAAA;;AAAA;AAWtB;;AAXsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,WAAxB;AAaD,SAdM,CAAP;AAeD;;;;;;;;;;;AAjKoC;AAAA;AAAA,oEA8KZ,EA9KY,EA8KR,IA9KQ;AAAA,YAmL7B,EAnL6B;AAAA;AAAA;AAAA;AAAA;AAAA,sBAgLjC,GAAG,EAAH,IAAS,IAAT,IACA,GAAG,OAAH,KAAe,IAjLkB;AAAA;AAAA;AAAA;;AAmL7B,kBAnL6B,GAmLxB,KAnLwB;;AAAA,sBAoL7B,QAAQ,IAAR,IAAgB,KAAK,OAAL,KAAiB,IApLJ;AAAA;AAAA;AAAA;;AAqL/B,qBAAK,IAAL;AArL+B;AAAA;;AAAA;AAAA,sBAsLtB,GAAG,OAAH,IAAc,IAAd,IAAsB,GAAG,OAAH,CAAW,MAAX,GAAoB,CAtLpB;AAAA;AAAA;AAAA;;AAAA,+CAuLnB,KAAK,sBAAL,CAA4B,CAAC,GAAG,EAAH,CAAM,CAAN,CAAD,EAAW,GAAG,EAAH,CAAM,CAAN,IAAW,CAAtB,CAA5B,CAvLmB;;AAAA;AAuL/B,kBAvL+B;;AAwL/B,qBAAK,IAAL;;AAxL+B;AAAA,qBA0L7B,EA1L6B;AAAA;AAAA;AAAA;;AA2L/B,mBAAG,EAAH,GAAQ,IAAR;AA3L+B,+CA4LxB,KAAK,YAAL,CAAkB,EAAlB,CA5LwB;;AAAA;AA6L/B,qBAAK,KAAL,CAAW,qBAAX,CAAiC,GAAG,EAApC;AA7L+B,kDA8LxB,IA9LwB;;AAAA;AAAA,kDAiM5B,KAjM4B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iDAmMT,EAnMS,EAmML;AAC9B,iBAAS,MAAT,CAAiB,CAAjB,EAAoB;AAClB,iBAAO,CAAC,EAAE,KAAF,CAAQ,UAAR,CAAmB,CAAnB,EAAsB,GAAG,EAAzB,CAAR;AACD;AACD,aAAK,GAAL,GAAW,KAAK,GAAL,CAAS,MAAT,CAAgB,MAAhB,CAAX;AACA,aAAK,GAAL,GAAW,KAAK,GAAL,CAAS,MAAT,CAAgB,MAAhB,CAAX;AACA,eAAO,GAAG,EAAV;AACD;AA1MoC;AAAA;AAAA;AAAA,YA8M1B,GA9M0B,EA+M7B,IA/M6B;AAAA;AAAA;AAAA;AAAA;AA4MnC,8BAAc,KAAK,UAAnB;AACA,qBAAK,UAAL,GAAkB,IAAlB;AACA,qBAAS,GAAT,IAAgB,KAAK,gBAArB,EAAuC;AACjC,sBADiC,GAC1B,KAAK,gBAAL,CAAsB,GAAtB,CAD0B;;AAErC,sBAAI,KAAK,QAAL,IAAiB,IAArB,EAA2B;AACzB,yBAAK,QAAL;AACD,mBAFD,MAEO;AACL,4BAAQ,KAAR,CAAc,4HAAd;AACD;AACF;;AArNkC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gCAuN1B,MAvN0B,EAuNlB;AACjB,YAAI,CAAC,KAAK,aAAL,CAAmB,UAAxB,EAAoC;AAClC,eAAK,aAAL,CAAmB,UAAnB,GAAgC,IAAhC;AACA,cAAI,OAAO,IAAX;AACA,eAAK,kBAAL,yBAAwB;AAAA,gBAElB,KAFkB;AAAA;AAAA;AAAA;AAAA;AACtB,yBAAK,MAAL,GAAc,MAAd;AADsB,mDAEH,KAAK,QAAL,CAAc,MAAd,CAFG;;AAAA;AAElB,yBAFkB;;AAGtB,yBAAK,OAAL,GAAe,MAAM,KAArB;AACA,yBAAK,aAAL,CAAmB,OAAnB,CAA2B,MAA3B;;AAJsB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,WAAxB;AAMD;AACD,eAAO,KAAK,aAAZ;AACD;AAnOoC;AAAA;AAAA,oCAoOtB,CApOsB,EAoOnB;AAChB,aAAK,aAAL,CAAmB,IAAnB,CAAwB,CAAxB;AACD;AAtOoC;AAAA;AAAA,kCAuOxB,WAvOwB,EAuOX;AACxB,YAAI,eAAe,IAAnB,EAAyB;AACvB,gBAAM,IAAI,KAAJ,CAAU,0DAAV,CAAN;AACD,SAFD,MAEO,IAAI,KAAK,MAAL,IAAe,IAAnB,EAAyB;AAC9B,gBAAM,IAAI,KAAJ,CAAU,qCAAV,CAAN;AACD,SAFM,MAEA;AACL,cAAI,KAAK,CAAC,KAAK,MAAN,EAAc,KAAK,OAAnB,CAAT;AACA,eAAK,OAAL,IAAgB,WAAhB;AACA,iBAAO,EAAP;AACD;AACF;;;;;;;;;AAjPoC;AAAA;AAAA,4BA0P9B,GA1P8B,EA0PzB;AACV,aAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,IAAI,MAAxB,EAAgC,GAAhC,EAAqC;AACnC,cAAI,IAAI,IAAI,CAAJ,CAAR;AACA,cAAI,EAAE,EAAF,IAAQ,IAAR,IAAgB,EAAE,EAAF,CAAK,CAAL,MAAY,KAAK,CAAL,CAAO,SAAP,CAAiB,MAAjD,EAAyD;AACvD,gBAAI,WAAW,EAAE,MAAF,CAAS,EAAE,MAAX,EAAmB,WAAnB,CAA+B,CAA/B,CAAf;AACA,gBAAI,EAAE,QAAF,IAAc,IAAlB,EAAwB;AACtB,yBAAW,SAAS,MAAT,CAAgB,EAAE,QAAlB,CAAX;AACD;AACD,iBAAK,mBAAL,CAAyB,QAAzB,EAAmC,CAAnC;AACD;AACF;AACF;;;;;;AArQoC;AAAA;AAAA,0CA0QhB,GA1QgB,EA0QX,EA1QW,EA0QP;AAC5B,YAAI,IAAI,MAAJ,GAAa,CAAjB,EAAoB;AAClB,cAAI,WAAW;AACb,gBAAI,EADS;AAEb,qBAAS,IAAI;AAFA,WAAf;;AAKA,eAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,IAAI,MAAxB,EAAgC,GAAhC,EAAqC;AACnC,gBAAI,KAAK,IAAI,CAAJ,CAAT;AACA,gBAAI,MAAM,KAAK,SAAL,CAAe,EAAf,CAAV;AACA,gBAAI,IAAI,KAAK,aAAL,CAAmB,GAAnB,CAAR;AACA,gBAAI,KAAK,IAAT,EAAe;AACb,kBAAI,EAAJ;AACA,mBAAK,aAAL,CAAmB,GAAnB,IAA0B,CAA1B;AACD;AACD,cAAE,IAAF,CAAO,QAAP;AACD;AACF,SAhBD,MAgBO;AACL,eAAK,uBAAL,CAA6B,IAA7B,CAAkC;AAChC,gBAAI;AAD4B,WAAlC;AAGD;;AAED,YAAI,KAAK,2BAAT,EAAsC;AACpC;AACD;;AAED,aAAK,2BAAL,GAAmC,IAAnC;AACA,YAAI,QAAQ,IAAZ;;AAEA,aAAK,kBAAL,yBAAwB;AAAA,cAClB,MADkB,EAIlB,EAJkB,EASb,GATa,EAUhB,CAVgB,EAcb,GAda,EAehB,CAfgB,EAgBhB,EAhBgB,EAiBhB,EAjBgB,EA0BT,EA1BS,EA2BZ,SA3BY,EA4BZ,EA5BY;;AAAA;AAAA;AAAA;AAAA;AAClB,wBADkB,GACT,MAAM,uBADG;;AAEtB,wBAAM,uBAAN,GAAgC,EAAhC;;AAEI,oBAJkB,GAIb,MAAM,aAJO;;AAKtB,wBAAM,aAAN,GAAsB,EAAtB;;AAEA,wBAAM,2BAAN,GAAoC,KAApC;;AAES,qBATa,GASP,CATO;;AAAA;AAAA,wBASJ,MAAM,OAAO,MATT;AAAA;AAAA;AAAA;;AAUhB,mBAVgB,GAUZ,OAAO,GAAP,EAAY,EAVA;AAAA,iDAWb,MAAM,UAAN,CAAiB,IAAjB,CAAsB,IAAtB,EAA4B,CAA5B,CAXa;;AAAA;AASiB,uBATjB;AAAA;AAAA;;AAAA;AAAA,yDAcN,EAdM;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAcb,qBAda;AAehB,mBAfgB,GAeZ,GAAG,GAAH,CAfY;AAgBhB,oBAhBgB,GAgBX,KAAK,KAAL,CAAW,GAAX,CAhBW;;AAAA,wBAkBhB,OAAO,GAAG,CAAH,CAAP,KAAiB,QAlBD;AAAA;AAAA;AAAA;;AAAA,iDAmBN,KAAK,YAAL,CAAkB,EAAlB,CAnBM;;AAAA;AAmBlB,oBAnBkB;AAAA;AAAA;;AAAA;AAAA,iDAqBN,KAAK,YAAL,CAAkB,EAAlB,CArBM;;AAAA;AAqBlB,oBArBkB;;AAAA;AAAA,wBAuBhB,MAAM,IAvBU;AAAA;AAAA;AAAA;;AAwBlB,wBAAM,aAAN,CAAoB,GAApB,IAA2B,CAA3B;AAxBkB;AAAA;;AAAA;AA0BT,oBA1BS,GA0BL,CA1BK;;AAAA;AAAA,wBA0BF,KAAI,EAAE,MA1BJ;AAAA;AAAA;AAAA;;AA2BZ,2BA3BY,GA2BD,EAAE,EAAF,CA3BC;AA4BZ,oBA5BY,GA4BR,UAAS,EA5BD;;AAAA,wBA6BZ,EAAE,UAAS,OAAX,KAAuB,CA7BX;AAAA;AAAA;AAAA;;AAAA,iDA8BP,MAAM,UAAN,CAAiB,IAAjB,CAAsB,IAAtB,EAA4B,EAA5B,CA9BO;;AAAA;AA0BY,sBA1BZ;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,SAAxB;AAoCD;;;;;;;;;;;;AA5UoC;AAAA;AAAA,yDAuVvB,EAvVuB;AAAA,YA+V7B,OA/V6B,EAmWzB,WAnWyB,EA8W3B,IA9W2B,EA+W3B,kBA/W2B;AAAA;AAAA;AAAA;AAAA;AAwVnC,qBAAK,KAAL,CAAW,UAAX,CAAsB,0CAAtB,EAAkE,KAAK,SAAL,CAAe,EAAf,CAAlE,EAAsF,GAAtF;;AAxVmC,sBAyV/B,GAAG,MAAH,KAAc,QAzViB;AAAA;AAAA;AAAA;;AAAA,+CA0V1B,EAAE,MAAF,CAAS,MAAT,CAAgB,OAAhB,CAAwB,IAAxB,CAA6B,IAA7B,EAAmC,EAAnC,CA1V0B;;AAAA;AAAA;AAAA;;AAAA;AAAA,+CA+VZ,KAAK,YAAL,CAAkB,GAAG,EAArB,CA/VY;;AAAA;AA+V7B,uBA/V6B;;AAAA;AAAA,sBAgW1B,WAAW,IAAX,IAAmB,QAAQ,OAAR,IAAmB,IAhWZ;AAAA;AAAA;AAAA;;AAAA,sBAkW3B,QAAQ,EAAR,CAAW,CAAX,IAAgB,QAAQ,OAAR,CAAgB,MAAhC,GAAyC,GAAG,EAAH,CAAM,CAAN,IAAW,GAAG,OAAH,CAAW,MAlWpC;AAAA;AAAA;AAAA;;AAmWzB,2BAnWyB,GAmWX,QAAQ,OAAR,CAAgB,MAAhB,IAA0B,GAAG,EAAH,CAAM,CAAN,IAAW,QAAQ,EAAR,CAAW,CAAX,CAArC,CAnWW;;AAoW7B,mBAAG,OAAH,CAAW,MAAX,CAAkB,CAAlB,EAAqB,WAArB;AACA,mBAAG,EAAH,GAAQ,CAAC,GAAG,EAAH,CAAM,CAAN,CAAD,EAAW,GAAG,EAAH,CAAM,CAAN,IAAW,WAAtB,CAAR;AACA,mBAAG,IAAH,GAAU,EAAE,KAAF,CAAQ,SAAR,CAAkB,OAAlB,CAAV;AACA,mBAAG,MAAH,GAAY,GAAG,IAAf;AAvW6B,+CAwWZ,KAAK,YAAL,CAAkB,GAAG,EAArB,CAxWY;;AAAA;AAwW7B,uBAxW6B;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA,sBA6W7B,WAAW,IA7WkB;AAAA;AAAA;AAAA;;AA8W3B,oBA9W2B,GA8WpB,GAAG,EA9WiB;AAAA,+CA+WC,KAAK,kBAAL,CAAwB,IAAxB,CA/WD;;AAAA;AA+W3B,kCA/W2B;;AAAA,oBAgX1B,kBAhX0B;AAAA;AAAA;AAAA;;AAAA,+CAiXtB,EAAE,MAAF,CAAS,GAAG,MAAZ,EAAoB,OAApB,CAA4B,IAA5B,CAAiC,IAAjC,EAAuC,EAAvC,CAjXsB;;AAAA;AAAA,+CAkXtB,KAAK,YAAL,CAAkB,EAAlB,CAlXsB;;AAAA;AAAA,+CAmXtB,KAAK,KAAL,CAAW,cAAX,CAA0B,IAA1B,EAAgC,EAAhC,CAnXsB;;AAAA;AAAA,oBAoXxB,EAAE,KAAF,CAAQ,UAAR,CAAmB,IAAnB,EAAyB,GAAG,EAA5B,CApXwB;AAAA;AAAA;AAAA;;AAAA,+CAsXf,KAAK,YAAL,CAAkB,IAAlB,CAtXe;;AAAA;AAsX3B,kBAtX2B;;AAAA;AAAA,+CAyXtB,KAAK,kBAAL,CAAwB,EAAxB,CAzXsB;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;;;;;;;;AAAA;AAAA;AAAA,6DA0YnB,WA1YmB,EA0YN,EA1YM;AAAA,YA4Y7B,MA5Y6B,EA6Y7B,IA7Y6B,EAoZ7B,KApZ6B,EAqZxB,CArZwB,EAuZ3B,GAvZ2B,EAwZ3B,CAxZ2B,EA2ZpB,GA3ZoB,EA4ZvB,QA5ZuB,EAma7B,CAna6B,EAua3B,eAva2B,EAgb3B,CAhb2B,EAqb3B,GArb2B,EAsb3B,OAtb2B,EAubtB,GAvbsB,EAwbzB,EAxbyB,EAybzB,WAzbyB,EA2bvB,KA3buB;;AAAA;AAAA;AAAA;AAAA;AAAA,sBA2Y/B,GAAG,MAAH,KAAc,QA3YiB;AAAA;AAAA;AAAA;;AAAA,+CA4Yb,YAAY,YAAZ,CAAyB,GAAG,MAA5B,CA5Ya;;AAAA;AA4Y7B,sBA5Y6B;AA6Y7B,oBA7Y6B,GA6YtB,KAAK,gBAAL,CAAsB,KAAK,SAAL,CAAe,OAAO,MAAtB,CAAtB,CA7YsB;;AAAA,sBA8Y7B,QAAQ,IA9YqB;AAAA;AAAA;AAAA;;AAAA,+CA+YxB,KAAK,QAAL,CAAc,WAAd,EAA2B,EAA3B,CA/YwB;;AAAA;AAAA;AAAA;;AAAA;AAAA,+CAmZ1B,YAAY,WAAZ,CAAwB,GAAG,EAAH,CAAM,CAAN,CAAxB,CAnZ0B;;AAAA;AAoZ7B,qBApZ6B,GAoZrB,GAAG,OAAH,IAAc,IAAd,GAAqB,GAAG,OAAH,CAAW,MAAhC,GAAyC,CApZpB;;AAqZjC,qBAAS,CAAT,GAAa,CAAb,EAAgB,IAAI,KAApB,EAA2B,GAA3B,EAAgC;;AAE1B,qBAF0B,GAEpB,KAAK,SAAL,CAAe,CAAC,GAAG,EAAH,CAAM,CAAN,CAAD,EAAW,GAAG,EAAH,CAAM,CAAN,IAAW,CAAtB,CAAf,CAFoB;AAG1B,mBAH0B,GAGtB,KAAK,aAAL,CAAmB,GAAnB,CAHsB;;AAI9B,yBAAO,KAAK,aAAL,CAAmB,GAAnB,CAAP;AACA,sBAAI,KAAK,IAAT,EAAe;AACb,yBAAS,GAAT,IAAgB,CAAhB,EAAmB;AACb,8BADa,GACF,EAAE,GAAF,CADE;;AAEjB,0BAAI,EAAE,SAAS,OAAX,KAAuB,CAA3B,EAA8B;AAC5B,6BAAK,mBAAL,CAAyB,EAAzB,EAA6B,SAAS,EAAtC;AACD;AACF;AACF;AACF;AACG,iBAna6B,GAmazB,KAAK,gBAAL,CAAsB,KAAK,SAAL,CAAe,GAAG,MAAlB,CAAtB,CAnayB;;;;AAAA,sBAsa7B,GAAG,MAAH,IAAa,IAtagB;AAAA;AAAA;AAAA;;AAAA,+CAuaF,YAAY,SAAZ,CAAsB,GAAG,MAAzB,CAvaE;;AAAA;AAua3B,+BAva2B;;AAAA,qBAwa3B,eAxa2B;AAAA;AAAA;AAAA;;AAAA,+CAyatB,YAAY,UAAZ,CAAuB,GAAG,EAA1B,CAzasB;;AAAA;AAAA;;AAAA;AAAA,sBA+a7B,KAAK,IA/awB;AAAA;AAAA;AAAA;;AAgb3B,iBAhb2B,GAgbvB,EAAE,KAAF,CAAQ,aAAR,CAAsB,EAAtB,CAhbuB;AAAA,+CAibxB,EAAE,QAAF,CAAW,WAAX,EAAwB,CAAxB,CAjbwB;;AAAA;AAAA,oBAmb5B,GAAG,OAnbyB;AAAA;AAAA;AAAA;;;AAqb3B,mBArb2B,GAqbrB,GAAG,OAAH,IAAc,IAAd,GAAqB,GAAG,OAAH,CAAW,MAAhC,GAAyC,CArbpB;AAsb3B,uBAtb2B,GAsbjB,GAAG,EAtbc,C;;AAubtB,mBAvbsB,GAublB,CAvbkB;;AAAA;AAAA,sBAubf,MAAI,GAvbW;AAAA;AAAA;AAAA;;AAwbzB,kBAxbyB,GAwbpB,CAAC,QAAQ,CAAR,CAAD,EAAa,QAAQ,CAAR,IAAa,GAA1B,CAxboB;AAAA,+CAybJ,YAAY,SAAZ,CAAsB,EAAtB,CAzbI;;AAAA;AAybzB,2BAzbyB;;AAAA,qBA0bzB,WA1byB;AAAA;AAAA;AAAA;;AA2bvB,qBA3buB,GA2bf;AACV,0BAAQ,QADE;AAEV,0BAAQ;AAFE,iBA3be;AAAA,+CA+bpB,KAAK,UAAL,CAAgB,IAAhB,CAAqB,WAArB,EAAkC,KAAlC,CA/boB;;AAAA;AAubN,qBAvbM;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iDAqcT;AAC1B,YAAI,KAAK,qBAAT,EAAgC;AAC9B,cAAI,KAAK,oBAAL,IAA6B,IAAjC,EAAuC;AACrC,gBAAI,OAAJ;AACA,gBAAI,UAAU,IAAI,OAAJ,CAAY,UAAU,CAAV,EAAa;AACrC,wBAAU,CAAV;AACD,aAFa,CAAd;AAGA,iBAAK,oBAAL,GAA4B;AAC1B,uBAAS,OADiB;AAE1B,uBAAS;AAFiB,aAA5B;AAIA,mBAAO,OAAP;AACD,WAVD,MAUO;AACL,mBAAO,KAAK,oBAAL,CAA0B,OAAjC;AACD;AACF,SAdD,MAcO;AACL,iBAAO,QAAQ,OAAR,EAAP;AACD;AACF;;;;AAvdoC;AAAA;AAAA,uCA0dnB;AAChB,YAAI,KAAK,mBAAL,CAAyB,MAAzB,KAAoC,CAAxC,EAA2C;AACzC,cAAI,KAAK,oBAAT,EAA+B;AAC7B,iBAAK,qBAAL,GAA6B,KAA7B;AACA,iBAAK,oBAAL,GAA4B,KAA5B;AACA,gBAAI,KAAK,oBAAL,IAA6B,IAAjC,EAAuC;AACrC,mBAAK,oBAAL,CAA0B,OAA1B;AACA,mBAAK,oBAAL,GAA4B,IAA5B;AACD;AACD,mBAAO,IAAP;AACD,WARD,MAQO;AACL,iBAAK,oBAAL,GAA4B,IAA5B;AACA,2CAAO;AAAA;AAAA;AAAA;AAAA;AAAA,qDACE,KAAK,KAAL,EADF;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,aAAP;AAGD;AACF,SAfD,MAeO;AACL,eAAK,oBAAL,GAA4B,KAA5B;AACA,iBAAO,KAAK,mBAAL,CAAyB,KAAzB,EAAP;AACD;AACF;AA9eoC;AAAA;AAAA,yCA+ejB,O,WA/eiB,EA+eE,eA/eF,EA+emB;AAAA;;AACtD,aAAK,mBAAL,CAAyB,IAAzB,CAA8B,OAA9B;AACA,YAAI,CAAC,KAAK,qBAAV,EAAiC;AAC/B,eAAK,qBAAL,GAA6B,IAA7B;AACA,qBAAW,YAAM;AACf,mBAAK,QAAL,CAAc,OAAK,cAAL,EAAd;AACD,WAFD,EAEG,CAFH;AAGD;AACF;AAvfoC;;AAAA;AAAA;;AAyfvC,IAAE,gBAAF,GAAqB,gBAArB;AACD,CA1fD;;;;ACFA;;;;;;;;;;;;;;;;;;;;;AAoBA,OAAO,OAAP,GAAiB,UAAU,C,WAAV,EAAuB;AACtC,MAAI,SAAS;;;;;;;AAQX,YAAQ;AACN,cAAQ,gBAAU,EAAV,EAAc;AACpB,eAAO,EAAP;AACD,OAHK;AAIN,mBAAa,qBAAU,EAAV,EAAc;AACzB,eAAO,EAAP,C;AACD,OANK;AAON,uCAAS,iBAAY,EAAZ;AAAA;AAAA;AAAA;AAAA;AAAA,8CACO,KAAK,eAAL,CAAqB,GAAG,MAAxB,EAAgC,GAAG,MAAH,IAAa,CAA7C,CADP;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAT;AAPM,KARG;AAmBX,YAAQ;;;;;;;;;;;;AAYN,cAAQ,gBAAU,E,iBAAV,E,gBAA+C;;;AAGrD,YAAI,C,WAAA,GAAc;AAChB,cAAI,GAAG,EADS;AAEhB,gBAAM,GAAG,IAFO;AAGhB,iBAAO,GAAG,KAHM;AAIhB,kBAAQ,GAAG,MAJK;AAKhB,kBAAQ,GAAG,MALK;AAMhB,kBAAQ,GAAG;AANK,SAAlB;AAQA,YAAI,GAAG,SAAH,IAAgB,IAApB,EAA0B;AACxB,YAAE,SAAF,GAAc,GAAG,SAAjB;AACD;AACD,YAAI,GAAG,cAAH,CAAkB,WAAlB,CAAJ,EAAoC;AAClC,YAAE,SAAF,GAAc,GAAG,SAAjB;AACD,SAFD,MAEO;AACL,YAAE,OAAF,GAAY,GAAG,OAAH,CAAW,KAAX,EAAZ;AACD;;AAED,eAAO,CAAP;AACD,OAjCK;AAkCN,mBAAa,qBAAU,EAAV,EAAc;AACzB,YAAI,MAAM,EAAV;AACA,YAAI,GAAG,IAAH,IAAW,IAAf,EAAqB;AACnB,cAAI,IAAJ,CAAS,GAAG,IAAZ;AACD;AACD,YAAI,GAAG,KAAH,IAAY,IAAhB,EAAsB;AACpB,cAAI,IAAJ,CAAS,GAAG,KAAZ;AACD;AACD,YAAI,GAAG,MAAH,IAAa,IAAb,IAAqB,CAAC,EAAE,KAAF,CAAQ,UAAR,CAAmB,GAAG,IAAtB,EAA4B,GAAG,MAA/B,CAA1B,EAAkE;AAChE,cAAI,IAAJ,CAAS,GAAG,MAAZ;AACD;;AAED,YAAI,IAAJ,CAAS,GAAG,MAAZ;;AAEA,YAAI,GAAG,SAAH,IAAgB,IAApB,EAA0B;AACxB,cAAI,IAAJ,CAAS,GAAG,SAAZ;AACD;AACD,eAAO,GAAP;AACD,OApDK;AAqDN,mDAAqB,6BAAY,EAAZ;AAAA,YAIb,CAJa,EAKb,CALa;AAAA;AAAA;AAAA;AAAA;AAAA,sBACf,GAAG,IAAH,IAAW,IADI;AAAA;AAAA;AAAA;;AAAA,kDAEV,CAFU;;AAAA;AAIb,iBAJa,GAIT,CAJS;AAAA,+CAKF,KAAK,YAAL,CAAkB,GAAG,IAArB,CALE;;AAAA;AAKb,iBALa;;AAAA;AAAA,oBAMT,EAAE,KAAF,CAAQ,SAAR,CAAkB,CAAlB,EAAqB,GAAG,MAAxB,CANS;AAAA;AAAA;AAAA;;AAOf;;AAPe,sBAQX,EAAE,IAAF,IAAU,IARC;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAAA,+CAWF,KAAK,YAAL,CAAkB,EAAE,IAApB,CAXE;;AAAA;AAWb,iBAXa;;AAAA;AAAA;AAAA;;AAAA;AAAA,kDAcV,CAdU;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAArB,CArDM;;;;;;;;;;;;;;;;AAqFN,uCAAS,iBAAY,EAAZ;AAAA,YACH,CADG,EAKH,iBALG,EAUD,MAVC,EAoBH,gBApBG,EAuBH,CAvBG,EAwBH,MAxBG,EAyBH,KAzBG,EAqCD,OArCC,EAmDC,eAnDD,EA+EH,IA/EG,EAgFH,KAhFG,EA6IE,EA7IF,EA8ID,CA9IC;;AAAA;AAAA;AAAA;AAAA;;;;;AAKH,iCALG,GAKiB,EALjB;;AAAA,sBAOH,GAAG,MAAH,IAAa,IAPV;AAAA;AAAA;AAAA;;AAAA,+CAUe,KAAK,oBAAL,CAA0B,GAAG,MAA7B,CAVf;;AAAA;AAUD,sBAVC;;AAWL,oBAAI,OAAO,QAAP,IAAmB,IAAvB,EAA6B;AAC3B,yBAAO,QAAP,GAAkB,EAAlB;AACD;AACD,uBAAO,QAAP,CAAgB,IAAhB,CAAqB,GAAG,EAAxB;AAdK,+CAeE,KAAK,YAAL,CAAkB,MAAlB,CAfF;;AAAA;AAgBL,oBAAI,OAAO,KAAP,IAAgB,IAApB,EAA0B;AACxB,oCAAkB,IAAlB,CAAuB,OAAO,KAA9B;AACD;;AAlBI;AAAA,+CAoB2B,OAAO,MAAP,CAAc,mBAAd,CAAkC,IAAlC,CAAuC,IAAvC,EAA6C,EAA7C,CApB3B;;AAAA;AAoBH,gCApBG,GAoBgB,CApBhB;;AAAA,sBA4BH,GAAG,IAAH,IAAW,IA5BR;AAAA;AAAA;AAAA;;AAAA,+CA6BM,KAAK,oBAAL,CAA0B,GAAG,IAA7B,CA7BN;;AAAA;AA6BL,iBA7BK;;AA8BL,oBAAI,CAAC,EAAE,KAAF,CAAQ,UAAR,CAAmB,GAAG,IAAtB,EAA4B,GAAG,MAA/B,CAAD,IAA2C,EAAE,KAAF,IAAW,IAA1D,EAAgE;;AAE9D,oCAAkB,IAAlB,CAAuB,EAAE,KAAzB;AACD;;AAjCI,sBAkCA,EAAE,KAAF,IAAW,IAlCX;AAAA;AAAA;AAAA;;AAAA,+BAkCmB,IAlCnB;AAAA;AAAA;;AAAA;AAAA,+CAkCiC,KAAK,YAAL,CAAkB,EAAE,KAApB,CAlCjC;;AAAA;AAAA;;AAAA;AAkCL,iBAlCK;AAAA;AAAA;;AAAA;AAAA,+CAoCW,KAAK,YAAL,CAAkB,GAAG,MAArB,CApCX;;AAAA;AAoCL,sBApCK;AAqCD,uBArCC,GAqCS,GAAG,SAAH,GAAe,OAAO,GAAP,CAAW,GAAG,SAAd,CAAf,GAA0C,OAAO,KArC1D;;AAAA,sBAsCG,WAAW,IAtCd;AAAA;AAAA;AAAA;;AAAA,+BAsCqB,IAtCrB;AAAA;AAAA;;AAAA;AAAA,+CAsCmC,KAAK,YAAL,CAAkB,OAAlB,CAtCnC;;AAAA;AAAA;;AAAA;AAsCL,qBAtCK;;AAuCL,oBAAI,KAAJ;;AAvCK;AAAA,sBA2CH,GAAG,KAAH,IAAY,IA3CT;AAAA;AAAA;AAAA;;AA4CL,kCAAkB,IAAlB,CAAuB,GAAG,KAA1B;AA5CK,+CA6CE,KAAK,sBAAL,CAA4B,GAAG,KAA/B,CA7CF;;AAAA;AAAA,qBAiDA,IAjDA;AAAA;AAAA;AAAA;;AAAA,sBAkDD,KAAK,IAAL,IAAa,CAAC,EAAE,KAAF,CAAQ,UAAR,CAAmB,EAAE,EAArB,EAAyB,GAAG,KAA5B,CAlDb;AAAA;AAAA;AAAA;;AAAA,+CAmD0B,OAAO,MAAP,CAAc,mBAAd,CAAkC,IAAlC,CAAuC,IAAvC,EAA6C,CAA7C,CAnD1B;;AAAA;AAmDC,+BAnDD;;AAAA,sBAoDC,oBAAoB,CApDrB;AAAA;AAAA;AAAA;;;AAsDD,oBAAI,EAAE,EAAF,CAAK,CAAL,IAAU,GAAG,EAAH,CAAM,CAAN,CAAd,EAAwB;AACtB,qBAAG,IAAH,GAAU,EAAE,KAAF,CAAQ,SAAR,CAAkB,CAAlB,CAAV;AACA,qCAAmB,IAAI,CAAvB,C;AACD;AAzDA;AAAA;;AAAA;AAAA,sBA0DQ,kBAAkB,CA1D1B;AAAA;AAAA;AAAA;;;AA4DD,oBAAI,IAAI,gBAAJ,IAAwB,eAA5B,EAA6C;AAC3C,qBAAG,IAAH,GAAU,EAAE,KAAF,CAAQ,SAAR,CAAkB,CAAlB,CAAV;AACA,qCAAmB,IAAI,CAAvB,C;AACD;AA/DA;AAAA;;AAAA;AAAA;;AAAA;AAmEH;;AAnEG,sBAoEC,EAAE,KAAF,IAAW,IApEZ;AAAA;AAAA;AAAA;;AAAA,+CAqEU,KAAK,YAAL,CAAkB,EAAE,KAApB,CArEV;;AAAA;AAqED,iBArEC;AAAA;AAAA;;AAAA;AAuED,oBAAI,IAAJ;;AAvEC;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;;;AA+EH,oBA/EG,GA+EI,IA/EJ;AAgFH,qBAhFG,GAgFK,IAhFL;;AAAA,sBAiFH,UAAU,IAjFP;AAAA;AAAA;AAAA;;AAAA,+CAkFW,KAAK,YAAL,CAAkB,GAAG,MAArB,CAlFX;;AAAA;AAkFL,sBAlFK;;AAAA;AAAA,sBAsFH,GAAG,IAAH,IAAW,IAtFR;AAAA;AAAA;AAAA;;AAAA,+CAuFS,KAAK,YAAL,CAAkB,GAAG,IAArB,CAvFT;;AAAA;AAuFL,oBAvFK;;;AAyFL,mBAAG,KAAH,GAAW,KAAK,KAAhB;AACA,qBAAK,KAAL,GAAa,GAAG,EAAhB;;AA1FK,+CA4FE,KAAK,YAAL,CAAkB,IAAlB,CA5FF;;AAAA;AAAA;AAAA;;AAAA;;AA+FL,mBAAG,KAAH,GAAW,GAAG,SAAH,GAAe,OAAO,GAAP,CAAW,GAAG,SAAd,KAA4B,IAA3C,GAAkD,OAAO,KAApE;;AA/FK;AAAA,sBAkGH,GAAG,KAAH,IAAY,IAlGT;AAAA;AAAA;AAAA;;AAAA,+CAoGU,KAAK,YAAL,CAAkB,GAAG,KAArB,CApGV;;AAAA;AAoGL,qBApGK;;AAqGL,sBAAM,IAAN,GAAa,EAAE,KAAF,CAAQ,SAAR,CAAkB,EAAlB,CAAb;;;;AArGK,sBAwGD,MAAM,EAAN,IAAY,IAxGX;AAAA;AAAA;AAAA;;AAAA,sBAyGC,MAAM,OAAN,IAAiB,IAAjB,IAAyB,MAAM,OAAN,CAAc,MAAd,GAAuB,CAzGjD;AAAA;AAAA;AAAA;;AAAA,+CA0Gc,KAAK,oBAAL,CAA0B,MAAM,EAAhC,CA1Gd;;AAAA;AA0GD,qBA1GC;;AAAA;AA4GH,qBAAK,KAAL,CAAW,0BAAX,CAAsC,KAAtC;;AA5GG;AAAA,+CA8GE,KAAK,YAAL,CAAkB,KAAlB,CA9GF;;AAAA;AAAA,sBAkHH,GAAG,SAAH,IAAgB,IAlHb;AAAA;AAAA;AAAA;;AAAA,sBAmHD,QAAQ,IAnHP;AAAA;AAAA;AAAA;;AAoHH,uBAAO,GAAP,CAAW,GAAG,SAAd,IAA2B,GAAG,EAA9B;AApHG,+CAqHI,KAAK,YAAL,CAAkB,MAAlB,CArHJ;;AAAA;AAAA,sBA0HD,GAAG,KAAH,IAAY,IA1HX;AAAA;AAAA;AAAA;;AAAA,+CA2HI,KAAK,eAAL,CAAqB,GAAG,KAAxB,EAA+B,CAA/B,EAAkC,IAAlC,CA3HJ;;AAAA;AAAA,sBA6HD,GAAG,IAAH,IAAW,IA7HV;AAAA;AAAA;AAAA;;AAAA,+CA8HI,KAAK,eAAL,CAAqB,GAAG,EAAxB,EAA4B,CAA5B,EAA+B,IAA/B,CA9HJ;;AAAA;AAAA;AAAA;;AAAA;AAAA,sBAiID,SAAS,IAAT,IAAiB,QAAQ,IAjIxB;AAAA;AAAA;AAAA;;AAkIH,oBAAI,SAAS,IAAb,EAAmB;AACjB,yBAAO,GAAP,GAAa,EAAE,KAAF,CAAQ,SAAR,CAAkB,EAAlB,CAAb;AACD;AACD,oBAAI,QAAQ,IAAZ,EAAkB;AAChB,yBAAO,KAAP,GAAe,GAAG,EAAlB;AACD;AAvIE,+CAwII,KAAK,YAAL,CAAkB,MAAlB,CAxIJ;;AAAA;AA6IE,kBA7IF,GA6IM,CA7IN;;AAAA;AAAA,sBA6IS,KAAI,kBAAkB,MA7I/B;AAAA;AAAA;AAAA;;AAAA,+CA8IU,KAAK,YAAL,CAAkB,kBAAkB,EAAlB,CAAlB,CA9IV;;AAAA;AA8ID,iBA9IC;AAAA,+CA+IE,KAAK,kBAAL,CAAwB,CAAxB,CA/IF;;AAAA;AA6IuC,oBA7IvC;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAT;AArFM,KAnBG;AA2PX,UAAM;;;;;;;;;;AAUJ,cAAQ,gBAAU,EAAV,EAAc;AACpB,eAAO;AACL,iBAAO,IADF;AAEL,eAAK,IAFA;AAGL,kBAAQ,MAHH;AAIL,cAAI;AAJC,SAAP;AAMD,OAjBG;AAkBJ,cAAQ,gBAAU,EAAV,EAAc;AACpB,YAAI,IAAI;AACN,kBAAQ,MADF;AAEN,cAAI,GAAG,EAFD;AAGN,gBAAM,GAAG;AAHH,SAAR;AAKA,YAAI,GAAG,QAAH,IAAe,IAAnB,EAAyB;AACvB,YAAE,QAAF,GAAa,GAAG,QAAhB;AACD;AACD,YAAI,GAAG,IAAH,IAAW,IAAf,EAAqB;AACnB,YAAE,IAAF,GAAS,GAAG,IAAZ;AACD;AACD,eAAO,CAAP;AACD,OA/BG;AAgCJ,mBAAa,uBAAY;;;;;;;;;;;AAWvB,eAAO,EAAP;AACD,OA5CG;AA6CJ,uCAAS,iBAAY,EAAZ;AAAA;AAAA;AAAA;AAAA;AACP,mBAAG,KAAH,GAAW,IAAX;AACA,mBAAG,GAAH,GAAS,IAAT;;AAFO;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAT,CA7CI;AAiDJ,mCAAK,aAAY,EAAZ,EAAgB,GAAhB;AAAA,YAIC,GAJD,EAKC,CALD;AAAA;AAAA;AAAA;AAAA;AAAA,sBACC,GAAG,KAAH,IAAY,IADb;AAAA;AAAA;AAAA;;AAAA,kDAEM,IAFN;;AAAA;AAIC,mBAJD,GAIO,IAJP;AAAA,+CAKY,KAAK,YAAL,CAAkB,GAAG,KAArB,CALZ;;AAAA;AAKC,iBALD;;AAAA;AAAA,qBAOI,IAPJ;AAAA;AAAA;AAAA;;AAQD,oBAAI,CAAC,EAAE,OAAP,EAAgB;AACd,wBAAM,CAAN;AACA;AACD;;AAXA,sBAYG,OAAO,CAAP,IAAY,EAAE,KAAF,IAAW,IAZ1B;AAAA;AAAA;AAAA;;AAAA,+CAaY,KAAK,YAAL,CAAkB,EAAE,KAApB,CAbZ;;AAAA;AAaC,iBAbD;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA,kDAkBI,GAlBJ;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAL,CAjDI;AAqEJ,mCAAK,aAAY,CAAZ,EAAe,CAAf;AAAA,YAEC,GAFD,EAIG,SAJH;AAAA;AAAA;AAAA;AAAA;AACH,oBAAI,EAAE,KAAN;AACI,mBAFD,GAEO,EAFP;;AAAA;AAAA,sBAGI,KAAK,IAHT;AAAA;AAAA;AAAA;;AAAA,+CAIsB,KAAK,YAAL,CAAkB,CAAlB,CAJtB;;AAAA;AAIG,yBAJH;;AAKD,oBAAI,CAAC,UAAU,OAAf,EAAwB;AACtB,sBAAI,IAAJ,CAAS,EAAE,SAAF,CAAT;AACD;AACD,oBAAI,UAAU,KAAd;AARC;AAAA;;AAAA;AAAA,kDAUI,GAVJ;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAL;AArEI,KA3PK;AA6UX,SAAK;;;;;;;;;AASH,cAAQ,gBAAU,EAAV,EAAc;AACpB,eAAO;AACL,cAAI,EADC;AAEL,eAAK,EAFA;AAGL,kBAAQ;AAHH,SAAP;AAKD,OAfE;AAgBH,cAAQ,gBAAU,EAAV,EAAc;AACpB,YAAI,IAAI;AACN,kBAAQ,KADF;AAEN,gBAAM,GAAG,IAFH;AAGN,cAAI,GAAG,EAHD;AAIN,eAAK,E;AAJC,SAAR;AAMA,YAAI,GAAG,QAAH,IAAe,IAAnB,EAAyB;AACvB,YAAE,QAAF,GAAa,GAAG,QAAhB;AACD;AACD,YAAI,GAAG,IAAH,IAAW,IAAf,EAAqB;AACnB,YAAE,IAAF,GAAS,GAAG,IAAZ;AACD;AACD,eAAO,CAAP;AACD,OA9BE;AA+BH,mBAAa,uBAAY;AACvB,eAAO,EAAP;AACD,OAjCE;AAkCH,uCAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAT,CAlCG;;;;AAsCH,mCAAK,aAAY,EAAZ,EAAgB,IAAhB;AAAA,YACC,GADD,EAGG,GAHH;AAAA;AAAA;AAAA;AAAA;AACC,mBADD,GACO,GAAG,GAAH,CAAO,IAAP,CADP;;AAAA,sBAEC,OAAO,IAFR;AAAA;AAAA;AAAA;;AAAA,+CAGgB,KAAK,YAAL,CAAkB,GAAlB,CAHhB;;AAAA;AAGG,mBAHH;;AAAA,sBAIG,OAAO,IAAP,IAAe,IAAI,OAJtB;AAAA;AAAA;AAAA;;AAAA,kDAKQ,KAAK,CALb;;AAAA;AAAA,sBAMU,IAAI,SAAJ,IAAiB,IAN3B;AAAA;AAAA;AAAA;;AAAA,kDAOQ,IAAI,OAAJ,CAAY,CAAZ,CAPR;;AAAA;AAAA,+CASe,KAAK,OAAL,CAAa,IAAI,SAAjB,CATf;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAAL;AAtCG;AA7UM,GAAb;AAkYA,IAAE,MAAF,GAAW,MAAX;AACD,CApYD;;;;ACpBA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2EA,OAAO,OAAP,GAAiB,UAAU,C,WAAV,EAAuB;AAAA,MAChC,oBADgC;AAAA;AAAA;AAAA;;AAAA;AAAA;;;;;;;;;;;;;AAAA,sDAazB,EAbyB,EAarB,IAbqB;AAAA,YAc9B,GAd8B,EAe9B,CAf8B,EAiB5B,E,8BAjB4B;AAAA;AAAA;AAAA;AAAA;AAc9B,mBAd8B,GAcxB,KAAK,SAAL,CAAe,EAAf,CAdwB;AAe9B,iBAf8B,GAe1B,KAAK,KAAL,CAAW,gBAAX,CAA4B,GAA5B,CAf0B;;AAAA,sBAgB9B,KAAK,IAhByB;AAAA;AAAA;AAAA;;AAAA,8CAiBa,KAAK,YAAL,CAAkB,EAAlB,CAjBb;;AAAA;AAiB5B,kBAjB4B;;AAAA,sBAkB5B,MAAM,IAlBsB;AAAA;AAAA;AAAA;;AAAA,8CAmBnB,EAAE,GAAG,IAAL,EAAW,cAAX,CAA0B,QAA1B,CAAmC,IAAnC,CAAwC,IAAxC,EAA8C,KAAK,KAAnD,EAA0D,EAA1D,EAA8D,IAA9D,CAnBmB;;AAAA;AAmB9B,iBAnB8B;;AAoB9B,qBAAK,KAAL,CAAW,gBAAX,CAA4B,GAA5B,IAAmC,CAAnC;;AApB8B;AAAA,iDAuB3B,CAvB2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,yDAyBtB,cAzBsB,EAyBN,EAzBM;AAAA,YA0B9B,UA1B8B,EA4B9B,EA5B8B;AAAA;AAAA;AAAA;AAAA;AA0B9B,0BA1B8B,GA0BjB,eAAe,CAAf,EAAkB,MA1BD;;AA2BlC,qBAAK,MAAM,KAAK,KAAL,CAAW,WAAX,CAAuB,CAAvB,CAAX;;AA3BkC,sBA6B9B,GAAG,CAAH,MAAU,GA7BoB;AAAA;AAAA;AAAA;;AAAA,+CA8BpB,KAAK,YAAL,CAAkB,EAAlB,CA9BoB;;AAAA;AA8BhC,kBA9BgC;AAAA;AAAA;;AAAA;AAgChC,qBAAK,EAAE,MAAF,CAAS,UAAT,EAAqB,MAArB,CAA4B,EAA5B,CAAL;AACA,mBAAG,IAAH,GAAU,eAAe,CAAf,EAAkB,IAA5B;;AAjCgC;AAAA,sBAmC9B,eAAe,CAAf,EAAkB,oBAAlB,IAA0C,IAnCZ;AAAA;AAAA;AAAA;;AAAA,+CAoCzB,eAAe,CAAf,EAAkB,oBAAlB,CAAuC,IAAvC,CAA4C,IAA5C,EAAkD,EAAlD,EAAsD,eAAe,CAAf,CAAtD,CApCyB;;AAAA;AAAA,sBAsC9B,GAAG,CAAH,MAAU,GAtCoB;AAAA;AAAA;AAAA;;AAAA,+CAuCzB,KAAK,YAAL,CAAkB,EAAlB,CAvCyB;;AAAA;AAAA;AAAA;;AAAA;AAAA,+CAyCzB,KAAK,sBAAL,CAA4B,CAAC,EAAD,CAA5B,CAzCyB;;AAAA;AAAA,+CA2CpB,KAAK,OAAL,CAAa,EAAb,EAAiB,eAAe,CAAf,CAAjB,CA3CoB;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA,qEAgEV,GAhEU;AAAA,YAiE9B,IAjE8B,EAkEzB,CAlEyB,EAmE5B,EAnE4B;AAAA;AAAA;AAAA;AAAA;AAiE9B,oBAjE8B,GAiEvB,EAjEuB;AAkEzB,iBAlEyB,GAkErB,CAlEqB;;AAAA;AAAA,sBAkElB,IAAI,IAAI,MAlEU;AAAA;AAAA;AAAA;;AAmE5B,kBAnE4B,GAmEvB,IAAI,CAAJ,CAnEuB;AAAA,+CAoEzB,KAAK,KAAL,CAAW,UAAX,CAAsB,IAAtB,CAA2B,IAA3B,EAAiC,EAAjC,CApEyB;;AAAA;AAqEhC,oBAAI,GAAG,EAAH,IAAS,IAAT,IAAiB,OAAO,GAAG,EAAH,CAAM,CAAN,CAAP,KAAoB,QAAzC,EAAmD;AACjD,uBAAK,IAAL,CAAU,EAAE,MAAF,CAAS,GAAG,MAAZ,EAAoB,MAApB,CAA2B,EAA3B,CAAV;AACD;;AAvE+B;AAkEF,mBAlEE;AAAA;AAAA;;AAAA;AAyElC,oBAAI,CAAC,KAAK,KAAL,CAAW,CAAX,CAAa,SAAb,CAAuB,cAAvB,EAAD,IAA4C,KAAK,MAAL,GAAc,CAA9D,EAAiE;;;AAE/D,uBAAK,KAAL,CAAW,CAAX,CAAa,SAAb,CAAuB,YAAvB,CAAoC,IAApC;AACD;;AA5EiC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,yDA+EtB,KA/EsB;AAAA,YAsF1B,SAtF0B;AAAA;AAAA;AAAA;AAAA;AAAA,sBAgF3B,SAAS,IAhFkB;AAAA;AAAA;AAAA;;AAAA,+CAiFjB,KAAK,YAAL,CAAkB,KAAlB,CAjFiB;;AAAA;AAiFhC,qBAjFgC;;AAAA,oBAkF3B,MAAM,EAlFqB;AAAA;AAAA;AAAA;;AAmF9B,sBAAM,EAAN,GAAW,IAAX;AACA,sBAAM,OAAN,GAAgB,IAAhB;AApF8B,+CAqFvB,KAAK,YAAL,CAAkB,KAAlB,CArFuB;;AAAA;AAsF1B,yBAtF0B,GAsFd,MAAM,OAAN,IAAiB,IAAjB,GAAwB,MAAM,OAAN,CAAc,MAAtC,GAA+C,CAtFjC;AAAA,+CAuFvB,KAAK,WAAL,CAAiB,MAAM,EAAvB,EAA2B,SAA3B,CAvFuB;;AAAA;AAAA,sBAwF1B,MAAM,SAAN,IAAmB,IAxFO;AAAA;AAAA;AAAA;;AAAA,+CAyFrB,KAAK,eAAL,CAAqB,MAAM,SAA3B,CAzFqB;;AAAA;AA2F9B,qBAAK,KAAL,CAAW,qBAAX,CAAiC,MAAM,EAAvC;;AA3F8B;AA6FhC,wBAAQ,MAAM,KAAd;AA7FgC;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;AAAA;AAAA;AAAA,8DAoGjB,QApGiB,EAoGP,MApGO,EAoGC,eApGD;AAAA,YA0G5B,QA1G4B,EA2G5B,MA3G4B,EA4G5B,YA5G4B,EA8IjB,IA9IiB,EAyJjB,CAzJiB,EA8J1B,IA9J0B,EA6K1B,KA7K0B;AAAA;AAAA;AAAA;AAAA;AAqGlC,oBAAI,UAAU,IAAd,EAAoB;AAClB,2BAAS,CAAT;AACD;AAvGiC,+CAwG3B,KAAK,WAAL,CAAiB,QAAjB,EAA2B,MAA3B,CAxG2B;;AAAA;AAAA,sBAyG3B,SAAS,CAzGkB;AAAA;AAAA;AAAA;;AA0G5B,wBA1G4B,GA0GjB,KA1GiB;AAAA,+CA2GZ,KAAK,EAAL,CAAQ,kBAAR,CAA2B,CAAC,SAAS,CAAT,CAAD,EAAc,SAAS,CAAT,IAAc,MAAd,GAAuB,CAArC,CAA3B,CA3GY;;AAAA;AA2G5B,sBA3G4B;AA4G5B,4BA5G4B,GA4Gb,UAAU,IAAV,IAAkB,OAAO,OAAP,IAAkB,IAApC,GAA2C,OAAO,OAAP,CAAe,MAA1D,GAAmE,CA5GtD;;AAAA,sBA6G5B,UAAU,IAAV,IAAkB,OAAO,EAAP,CAAU,CAAV,MAAiB,SAAS,CAAT,CAAnC,IAAkD,OAAO,EAAP,CAAU,CAAV,IAAe,YAAf,IAA+B,SAAS,CAAT,CA7GrD;AAAA;AAAA;AAAA;;;AA+G9B,yBAAS,IAAT;AACA,yBAAS,CAAT;AAhH8B;AAAA;;AAAA;AAAA,oBAmHzB,OAAO,OAnHkB;AAAA;AAAA;AAAA;;AAAA,sBAoHxB,OAAO,EAAP,CAAU,CAAV,IAAe,SAAS,CAAT,CApHS;AAAA;AAAA;AAAA;;AAAA,+CAsHV,KAAK,sBAAL,CAA4B,QAA5B,CAtHU;;AAAA;AAsH1B,sBAtH0B;;AAuH1B,+BAAe,OAAO,OAAP,CAAe,MAA9B,C;;AAvH0B;AAAA,sBAyHxB,OAAO,EAAP,CAAU,CAAV,IAAe,YAAf,GAA8B,SAAS,CAAT,IAAc,MAzHpB;AAAA;AAAA;AAAA;;AAAA,+CA2HV,KAAK,oBAAL,CAA0B,CAAC,SAAS,CAAT,CAAD,EAAc,SAAS,CAAT,IAAc,MAAd,GAAuB,CAArC,CAA1B,CA3HU;;AAAA;AA2H1B,sBA3H0B;;AA4H1B,+BAAe,OAAO,OAAP,CAAe,MAA9B;;AA5H0B;AA+H9B,yBAAS,OAAO,EAAP,CAAU,CAAV,IAAe,SAAS,CAAT,CAAxB;;AA/H8B;AAAA,sBAkI5B,UAAU,IAlIkB;AAAA;AAAA;AAAA;;AAAA,oBAmIzB,OAAO,OAnIkB;AAAA;AAAA;AAAA;;AAoI5B,2BAAW,IAAX;;AAEA,uBAAO,OAAP,GAAiB,IAAjB;;;AAtI4B,sBAwIxB,OAAO,KAAP,IAAgB,IAxIQ;AAAA;AAAA;AAAA;;AAAA,+CA0InB,KAAK,UAAL,CAAgB,OAAO,KAAvB,CA1ImB;;AAAA;AAAA,sBA6IxB,OAAO,GAAP,IAAc,IA7IU;AAAA;AAAA;AAAA;;AAAA,uDA8IT,OAAO,GA9IE;;AAAA;AAAA;AAAA;AAAA;AAAA;;AA8IjB,oBA9IiB;AAAA,+CA+IjB,KAAK,UAAL,CAAgB,OAAO,GAAP,CAAW,IAAX,CAAhB,CA/IiB;;AAAA;AAAA;AAAA;;AAAA;AAAA,sBAoJxB,OAAO,SAAP,IAAoB,IApJI;AAAA;AAAA;AAAA;;AAAA,+CAqJnB,KAAK,eAAL,CAAqB,OAAO,SAA5B,CArJmB;;AAAA;AAAA,sBAwJxB,OAAO,QAAP,IAAmB,IAxJK;AAAA;AAAA;AAAA;;AAyJjB,iBAzJiB,GAyJb,CAzJa;;AAAA;AAAA,sBAyJV,IAAI,OAAO,QAAP,CAAgB,MAzJV;AAAA;AAAA;AAAA;;AAAA,+CA0JjB,KAAK,eAAL,CAAqB,OAAO,QAAP,CAAgB,CAAhB,CAArB,CA1JiB;;AAAA;AAyJkB,mBAzJlB;AAAA;AAAA;;AAAA;AAAA,sBA+J1B,OAAO,IAAP,IAAe,IA/JW;AAAA;AAAA;AAAA;;AAAA,+CAgKd,KAAK,YAAL,CAAkB,OAAO,IAAzB,CAhKc;;AAAA;AAgK5B,oBAhK4B;AAAA;AAAA;;AAAA;AAkK5B,uBAAO,IAAP;;AAlK4B;AAAA,+CAsKvB,KAAK,YAAL,CAAkB,MAAlB,CAtKuB;;AAAA;AAAA,sBA8K1B,OAAO,KAAP,IAAgB,IA9KU;AAAA;AAAA;AAAA;;AAAA,+CA+Kb,KAAK,YAAL,CAAkB,OAAO,KAAzB,CA/Ka;;AAAA;AA+K5B,qBA/K4B;AAAA;AAAA;;AAAA;AAiL5B,wBAAQ,IAAR;;AAjL4B;AAAA,sBAmL1B,YAAY,CAAC,eAnLa;AAAA;AAAA;AAAA;;AAAA,+CAoLrB,KAAK,KAAL,CAAW,cAAX,CAA0B,IAA1B,EAAgC;AACrC,0BAAQ,QAD6B;AAErC,0BAAQ,OAAO,EAFsB;AAGrC,0BAAQ;AAH6B,iBAAhC,CApLqB;;AAAA;AAAA,+CA2LvB,KAAK,KAAL,CAAW,qBAAX,CAAiC,IAAjC,CAAsC,IAAtC,EAA4C,MAA5C,EAAoD,IAApD,CA3LuB;;AAAA;AAAA,sBA4L1B,SAAS,IA5LiB;AAAA;AAAA;AAAA;;AAAA,+CA6LrB,KAAK,KAAL,CAAW,qBAAX,CAAiC,IAAjC,CAAsC,IAAtC,EAA4C,KAA5C,EAAmD,MAAnD,CA7LqB;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;AAAA;AAAA;AAAA,mEAqMZ,EArMY,EAqMR,GArMQ;AAAA,YAwM9B,CAxM8B,EA2M5B,MA3M4B,EAkN9B,IAlN8B,EAmN9B,IAnN8B;AAAA;AAAA;AAAA;AAAA;;AAuMlC,qBAAK,KAAL,CAAW,UAAX,CAAsB,mCAAtB,EAA2D,EAA3D,EAA+D,IAA/D,EAAqE,GAArE,EAA0E,GAA1E;AAvMkC,+CAwMnB,KAAK,WAAL,CAAiB,EAAjB,EAAqB,GAArB,CAxMmB;;AAAA;AAwM9B,iBAxM8B;;AAAA,sBAyM9B,EAAE,EAAF,CAAK,CAAL,IAAU,GAAG,CAAH,CAAV,IAAmB,CAAC,EAAE,EAzMQ;AAAA;AAAA;AAAA;;;AA2M5B,sBA3M4B,GA2MnB,EAAE,GAAF,IAAS,GAAG,CAAH,IAAQ,EAAE,EAAF,CAAK,CAAL,CAAjB,CA3MmB;;AA4MhC,kBAAE,GAAF,IAAS,MAAT;AA5MgC,+CA6MzB,KAAK,EAAL,CAAQ,GAAR,CAAY,CAAZ,CA7MyB;;AAAA;AA8MhC,oBAAI,EAAC,IAAI,EAAL,EAAS,KAAK,MAAd,EAAsB,IAAI,KAA1B,EAAJ;AA9MgC,+CA+MzB,KAAK,EAAL,CAAQ,GAAR,CAAY,CAAZ,CA/MyB;;AAAA;AAAA,+CAkNhB,KAAK,EAAL,CAAQ,QAAR,CAAiB,EAAjB,CAlNgB;;AAAA;AAkN9B,oBAlN8B;AAAA,+CAmNhB,KAAK,EAAL,CAAQ,QAAR,CAAiB,EAAjB,CAnNgB;;AAAA;AAmN9B,oBAnN8B;;AAAA,sBAqN9B,GAAG,CAAH,IAAQ,GAAR,GAAc,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAA1B,IAAiC,CAAC,EAAE,EArNN;AAAA;AAAA;AAAA;;AAAA,+CAuNzB,KAAK,EAAL,CAAQ,GAAR,CAAY,EAAC,IAAI,CAAC,GAAG,CAAH,CAAD,EAAQ,GAAG,CAAH,IAAQ,GAAhB,CAAL,EAA2B,KAAK,EAAE,GAAF,GAAQ,GAAxC,EAA6C,IAAI,KAAjD,EAAZ,CAvNyB;;AAAA;AAwNhC,kBAAE,GAAF,GAAQ,GAAR;;AAxNgC;;AA2NlC,kBAAE,EAAF,GAAO,IAAP;;;AA3NkC,sBA8NhC,QAAQ,IAAR,IACA,KAAK,EADL,IAEA,EAAE,KAAF,CAAQ,UAAR,CAAmB,CAAC,KAAK,EAAL,CAAQ,CAAR,CAAD,EAAa,KAAK,EAAL,CAAQ,CAAR,IAAa,KAAK,GAA/B,CAAnB,EAAwD,EAAE,EAA1D,CAhOgC;AAAA;AAAA;AAAA;;AAkOhC,qBAAK,GAAL,IAAY,EAAE,GAAd;AAlOgC,+CAmOzB,KAAK,EAAL,CAAQ,MAAR,CAAe,EAAE,EAAjB,CAnOyB;;AAAA;AAoOhC,oBAAI,IAAJ;;;AApOgC;AAAA,sBAyOhC,QAAQ,IAAR,IACA,KAAK,EADL,IAEA,EAAE,KAAF,CAAQ,UAAR,CAAmB,CAAC,EAAE,EAAF,CAAK,CAAL,CAAD,EAAU,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAAtB,CAAnB,EAA+C,KAAK,EAApD,CA3OgC;AAAA;AAAA;AAAA;;AA6OhC,kBAAE,GAAF,IAAS,KAAK,GAAd;AA7OgC,+CA8OzB,KAAK,EAAL,CAAQ,MAAR,CAAe,KAAK,EAApB,CA9OyB;;AAAA;AAAA,+CAgP3B,KAAK,EAAL,CAAQ,GAAR,CAAY,CAAZ,CAhP2B;;AAAA;AAAA,+CAiP3B,KAAK,WAAL,CAAiB,EAAE,EAAF,CAAK,CAAL,CAAjB,CAjP2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;AAAA;AAAA;AAAA,0DAwPrB,EAxPqB,EAwPjB,MAxPiB;AAAA,YA6P9B,CA7P8B,EAiQ1B,IAjQ0B,EAiS9B,IAjS8B,EA2TtB,KA3TsB;;AAAA;AAAA;AAAA;AAAA;AAyPlC,oBAAI,UAAU,IAAd,EAAoB;AAClB,2BAAS,CAAT;AACD;;AA3PiC,+CA6PnB,KAAK,EAAL,CAAQ,kBAAR,CAA2B,EAA3B,CA7PmB;;AAAA;AA6P9B,iBA7P8B;;AAAA,sBA8P9B,KAAK,IAAL,IAAa,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CA9PK;AAAA;AAAA;AAAA;;AAAA,sBA+P5B,EAAE,EAAF,CAAK,CAAL,KAAW,GAAG,CAAH,CAAX,IAAoB,GAAG,CAAH,KAAS,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GA/Pb;AAAA;AAAA;AAAA;;;AAiQ1B,oBAjQ0B,GAiQnB,GAAG,CAAH,IAAQ,MAAR,IAAkB,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAA9B,CAjQmB,C;;AAAA,sBAkQ1B,OAAO,CAlQmB;AAAA;AAAA;AAAA;;AAAA,oBAoQvB,EAAE,EApQqB;AAAA;AAAA;AAAA;;AAqQ1B,kBAAE,GAAF,IAAS,IAAT;AArQ0B;AAAA;;AAAA;AAuQ1B,uBAAO,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAAZ,GAAkB,GAAG,CAAH,CAAzB,C;;AAvQ0B,sBAwQtB,OAAO,MAxQe;AAAA;AAAA;AAAA;;;AA0QxB,oBAAI,EAAC,IAAI,CAAC,GAAG,CAAH,CAAD,EAAQ,GAAG,CAAH,IAAQ,IAAhB,CAAL,EAA4B,KAAK,SAAS,IAA1C,EAAgD,IAAI,KAApD,EAAJ;AA1QwB,+CA2QjB,KAAK,EAAL,CAAQ,GAAR,CAAY,CAAZ,CA3QiB;;AAAA;AAAA;AAAA;;AAAA;AAAA,sBA8QlB,IAAI,KAAJ,CAAU,qCAAV,CA9QkB;;AAAA;AAAA;AAAA;;AAAA;AAAA,kDAoRrB,CApRqB;;AAAA;AAAA;AAAA;;AAAA;;AAwR9B,oBAAI,EAAC,IAAI,EAAL,EAAS,KAAK,MAAd,EAAsB,IAAI,KAA1B,EAAJ;AAxR8B,+CAyRvB,KAAK,EAAL,CAAQ,GAAR,CAAY,CAAZ,CAzRuB;;AAAA;AAAA;AAAA;;AAAA;;AA6RhC,oBAAI,EAAC,IAAI,EAAL,EAAS,KAAK,MAAd,EAAsB,IAAI,KAA1B,EAAJ;AA7RgC,+CA8RzB,KAAK,EAAL,CAAQ,GAAR,CAAY,CAAZ,CA9RyB;;AAAA;AAAA,+CAiShB,KAAK,EAAL,CAAQ,QAAR,CAAiB,EAAE,EAAnB,CAjSgB;;AAAA;AAiS9B,oBAjS8B;;AAAA,sBAmShC,QAAQ,IAAR,IACA,EAAE,EAAF,CAAK,CAAL,MAAY,KAAK,EAAL,CAAQ,CAAR,CADZ,IAEA,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAAZ,IAAmB,KAAK,EAAL,CAAQ,CAAR,CArSa;AAAA;AAAA;AAAA;;AAuShC,uBAAO,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAAZ,GAAkB,KAAK,EAAL,CAAQ,CAAR,CAAzB,C;;AAvSgC;AAAA,sBAwSzB,QAAQ,CAxSiB;AAAA;AAAA;AAAA;;AAAA,qBA0S1B,KAAK,EA1SqB;AAAA;AAAA;AAAA;;;AA4S5B,kBAAE,GAAF,IAAS,IAAT;;AA5S4B,sBA6SxB,QAAQ,KAAK,GA7SW;AAAA;AAAA;AAAA;;;AA+S1B,uBAAO,OAAO,KAAK,GAAnB,C;;AA/S0B,sBAgTtB,OAAO,CAhTe;AAAA;AAAA;AAAA;;AAAA,+CAiTjB,KAAK,EAAL,CAAQ,GAAR,CAAY,CAAZ,CAjTiB;;AAAA;AAAA,+CAkTjB,KAAK,WAAL,CAAiB,CAAC,KAAK,EAAL,CAAQ,CAAR,CAAD,EAAa,KAAK,EAAL,CAAQ,CAAR,IAAa,KAAK,GAA/B,CAAjB,EAAsD,IAAtD,CAlTiB;;AAAA;AAAA;;AAAA;AAAA,sBAwTxB,OAAO,KAAK,GAxTY;AAAA;AAAA;AAAA;;AAAA,+CA2TP,KAAK,EAAL,CAAQ,QAAR,CAAiB,KAAK,EAAtB,CA3TO;;AAAA;AA2TtB,qBA3TsB;AAAA,+CA4TnB,KAAK,EAAL,CAAQ,MAAR,CAAe,KAAK,EAApB,CA5TmB;;AAAA;AAAA,sBA6TtB,SAAS,IAAT,IAAiB,EAAE,EAAF,CAAK,CAAL,MAAY,MAAM,EAAN,CAAS,CAAT,CA7TP;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAgUxB,uBAAO,KAAP;AACA,uBAAO,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAAZ,GAAkB,KAAK,EAAL,CAAQ,CAAR,CAAzB,C;;;AAjUwB;AAAA;AAAA;;AAAA;;AAsU1B,kBAAE,GAAF,IAAS,KAAK,GAAL,GAAW,IAApB;AAtU0B,+CAuUnB,KAAK,EAAL,CAAQ,MAAR,CAAe,KAAK,EAApB,CAvUmB;;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA,+CA6U3B,KAAK,EAAL,CAAQ,GAAR,CAAY,CAAZ,CA7U2B;;AAAA;AAAA,kDA8U3B,CA9U2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAsVlC,oBAAI,KAAK,KAAL,CAAW,GAAX,CAAe,MAAf,GAAwB,CAAxB,IAA6B,KAAK,KAAL,CAAW,GAAX,CAAe,MAAf,GAAwB,CAAzD,EAA4D;AAC1D,0BAAQ,IAAR,CAAa,+BAAb;AACD;AAxViC,+CAyV3B,KAAK,EAAL,CAAQ,OAAR,CAAgB,IAAhB,EAAsB,IAAtB,EAA4B,IAA5B,0BAAkC,iBAAY,EAAZ;AAAA,sBAMjC,aANiC,EAgBtB,CAhBsB,EA2BjC,IA3BiC;AAAA;AAAA;AAAA;AAAA;AAAA,+BACnC,GAAG,EADgC;AAAA;AAAA;AAAA;;AAErC,iCAAO,GAAG,EAAV;AAFqC,yDAG9B,KAAK,YAAL,CAAkB,EAAlB,CAH8B;;AAAA;AAAA,gCAKnC,GAAG,MAAH,IAAa,IALsB;AAAA;AAAA;AAAA;;AAAA,yDAMV,KAAK,SAAL,CAAe,GAAG,MAAlB,CANU;;AAAA;AAMjC,uCANiC;;AAAA,+BAOjC,aAPiC;AAAA;AAAA;AAAA;;AAQnC,6BAAG,EAAH,GAAQ,IAAR;;AARmC,8BAS9B,GAAG,OAT2B;AAAA;AAAA;AAAA;;AAAA,yDAU1B,KAAK,WAAL,CAAiB,GAAG,EAApB,EAAwB,GAAG,OAAH,IAAc,IAAd,GAAqB,GAAG,OAAH,CAAW,MAAhC,GAAyC,CAAjE,CAV0B;;AAAA;AAWjC,6BAAG,OAAH,GAAa,IAAb;;AAXiC,gCAY7B,GAAG,SAAH,IAAgB,IAZa;AAAA;AAAA;AAAA;;AAAA,yDAaxB,KAAK,eAAL,CAAqB,GAAG,SAAxB,CAbwB;;AAAA;AAAA,gCAe7B,GAAG,QAAH,IAAe,IAfc;AAAA;AAAA;AAAA;;AAgBtB,2BAhBsB,GAgBlB,CAhBkB;;AAAA;AAAA,gCAgBf,IAAI,GAAG,QAAH,CAAY,MAhBD;AAAA;AAAA;AAAA;;AAAA,yDAiBtB,KAAK,eAAL,CAAqB,GAAG,QAAH,CAAY,CAAZ,CAArB,CAjBsB;;AAAA;AAgBS,6BAhBT;AAAA;AAAA;;AAAA;AAAA,yDAqB5B,KAAK,YAAL,CAAkB,EAAlB,CArB4B;;AAAA;AAsBnC,+BAAK,KAAL,CAAW,GAAX,CAAe,IAAf,CAAoB,GAAG,EAAvB,E;AAtBmC;;AAAA;AAAA,+BA0BnC,GAAG,OA1BgC;AAAA;AAAA;AAAA;;AA2BjC,8BA3BiC,GA2B1B,IA3B0B;;AAAA,gCA4BjC,GAAG,IAAH,IAAW,IA5BsB;AAAA;AAAA;AAAA;;AAAA,yDA6BrB,KAAK,YAAL,CAAkB,GAAG,IAArB,CA7BqB;;AAAA;AA6BnC,8BA7BmC;;AAAA;AAAA,yDA+B9B,KAAK,KAAL,CAAW,qBAAX,CAAiC,IAAjC,CAAsC,IAAtC,EAA4C,EAA5C,EAAgD,IAAhD,CA/B8B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAAlC,EAzV2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;;;;;AAAA;AAAA;AAAA,sEAqYT,EArYS;AAAA,YAuY9B,CAvY8B,EA2Y5B,IA3Y4B,EAkZvB,CAlZuB,EAmZ1B,GAnZ0B,EAma1B,IAna0B,EA0a1B,KA1a0B,EAgbxB,SAhbwB,EAibxB,UAjbwB,EA6dnB,EA7dmB,EA8dtB,SA9dsB,EAuf1B,MAvf0B,EA6f5B,MA7f4B,EAmgB1B,SAngB0B;;AAAA;AAAA;AAAA;AAAA;AAsYlC,qBAAK,KAAL,CAAW,UAAX,CAAsB,sCAAtB,EAA8D,EAA9D,EAAkE,GAAlE;AAtYkC,gDAuYnB,KAAK,YAAL,CAAkB,EAAlB,CAvYmB;;AAAA;AAuY9B,iBAvY8B;AAAA,gDAwY3B,KAAK,oBAAL,CAA0B,EAA1B,EAA+B,KAAK,IAAL,IAAa,EAAE,OAAF,IAAa,IAA3B,GAAmC,EAAE,OAAF,CAAU,MAA7C,GAAsD,CAApF,CAxY2B;;AAAA;AAAA,sBA0Y9B,KAAK,IA1YyB;AAAA;AAAA;AAAA;;AA2Y5B,oBA3Y4B,GA2YrB,EA3YqB;;AA4YhC,oBAAI,EAAE,SAAF,IAAe,IAAnB,EAAyB;AACvB,uBAAK,IAAL,CAAU,EAAE,SAAZ;AACD;AACD,oBAAI,EAAE,QAAF,IAAc,IAAlB,EAAwB;AACtB,yBAAO,KAAK,MAAL,CAAY,EAAE,QAAd,CAAP;AACD;AACQ,iBAlZuB,GAkZnB,CAlZmB;;AAAA;AAAA,sBAkZhB,IAAI,KAAK,MAlZO;AAAA;AAAA;AAAA;;AAAA,gDAmZb,KAAK,YAAL,CAAkB,KAAK,CAAL,CAAlB,CAnZa;;AAAA;AAmZ1B,mBAnZ0B;;AAAA,sBAoZ1B,OAAO,IApZmB;AAAA;AAAA;AAAA;;AAAA,oBAqZvB,IAAI,OArZmB;AAAA;AAAA;AAAA;;AAAA,gDAsZnB,KAAK,eAAL,CAAqB,IAAI,EAAzB,CAtZmB;;AAAA;AAAA,gDAuZb,KAAK,YAAL,CAAkB,IAAI,EAAtB,CAvZa;;AAAA;AAuZ1B,mBAvZ0B;;AAAA;AAyZ5B,oBAAI,EAAJ,GAAS,IAAT;AAzZ4B,gDA0ZrB,KAAK,YAAL,CAAkB,GAAlB,CA1ZqB;;AAAA;AA2Z5B,qBAAK,KAAL,CAAW,qBAAX,CAAiC,IAAI,EAArC;AA3Z4B;AAAA;;AAAA;AAAA,gDA6ZrB,KAAK,oBAAL,CAA0B,KAAK,CAAL,CAA1B,EAAmC,CAAnC,CA7ZqB;;AAAA;AAkZC,mBAlZD;AAAA;AAAA;;AAAA;AAAA,sBAka5B,EAAE,IAAF,IAAU,IAlakB;AAAA;AAAA;AAAA;;AAAA,gDAmaZ,KAAK,YAAL,CAAkB,EAAE,IAApB,CAnaY;;AAAA;AAma1B,oBAna0B;;AAoa9B,qBAAK,KAAL,GAAa,EAAE,KAAf;AApa8B,gDAqavB,KAAK,YAAL,CAAkB,IAAlB,CArauB;;AAAA;AAAA,sBAya5B,EAAE,KAAF,IAAW,IAzaiB;AAAA;AAAA;AAAA;;AAAA,gDA0aX,KAAK,YAAL,CAAkB,EAAE,KAApB,CA1aW;;AAAA;AA0a1B,qBA1a0B;;AA2a9B,sBAAM,IAAN,GAAa,EAAE,IAAf;;AA3a8B,sBA6a1B,EAAE,QAAF,IAAc,IAAd,IAAsB,EAAE,QAAF,CAAW,MAAX,GAAoB,CA7ahB;AAAA;AAAA;AAAA;;;;AAgbxB,yBAhbwB,GAgbZ,EAAE,IAhbU;AAibxB,0BAjbwB,GAibX,IAjbW;;AAAA;AAAA,sBAkbrB,aAAa,IAlbQ;AAAA;AAAA;AAAA;;AAAA,gDAmbN,KAAK,YAAL,CAAkB,SAAlB,CAnbM;;AAAA;AAmb1B,0BAnb0B;;AAAA,qBAobtB,WAAW,OApbW;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAub1B,4BAAY,WAAW,IAAvB;AAvb0B;AAAA;;AAAA;AAAA,yDA6db,EAAE,QA7dW;;AAAA;AAAA;AAAA;AAAA;AAAA;;AA6dnB,kBA7dmB;AAAA,gDA8dH,KAAK,YAAL,CAAkB,EAAE,QAAF,CAAW,EAAX,CAAlB,CA9dG;;AAAA;AA8dtB,yBA9dsB;;AAAA,sBA+dtB,aAAa,IA/dS;AAAA;AAAA;AAAA;;AAgexB,0BAAU,MAAV,GAAmB,SAAnB;AAhewB,gDAiejB,KAAK,YAAL,CAAkB,SAAlB,CAjeiB;;AAAA;AAAA;AAAA;;AAAA;AAAA,sBAoexB,aAAa,IApeW;AAAA;AAAA;AAAA;;AAqe1B,oBAAI,WAAW,QAAX,IAAuB,IAA3B,EAAiC;AAC/B,6BAAW,QAAX,GAAsB,EAAE,QAAxB;AACD,iBAFD,MAEO;AACL,6BAAW,QAAX,GAAsB,EAAE,QAAF,CAAW,MAAX,CAAkB,WAAW,QAA7B,CAAtB;AACD;AAzeyB,gDA0enB,KAAK,YAAL,CAAkB,UAAlB,CA1emB;;AAAA;AAAA;AAAA;;AAAA;AAAA,gDAifrB,KAAK,YAAL,CAAkB,KAAlB,CAjfqB;;AAAA;AAAA,sBAsf5B,EAAE,MAAF,IAAY,IAtfgB;AAAA;AAAA;AAAA;;AAAA,gDAufV,KAAK,YAAL,CAAkB,EAAE,MAApB,CAvfU;;AAAA;AAuf1B,sBAvf0B;;AAwf9B,uBAAO,QAAP,GAAkB,OAAO,QAAP,CAAgB,MAAhB,CAAuB,UAAU,GAAV,EAAe;AACtD,yBAAO,CAAC,EAAE,KAAF,CAAQ,UAAR,CAAmB,EAAnB,EAAuB,GAAvB,CAAR;AACD,iBAFiB,CAAlB;AAxf8B,gDA2fvB,KAAK,YAAL,CAAkB,MAAlB,CA3fuB;;AAAA;AAAA,sBA8f5B,EAAE,MAAF,IAAY,IA9fgB;AAAA;AAAA;AAAA;;AAAA,gDA+fd,KAAK,YAAL,CAAkB,EAAE,MAApB,CA/fc;;AAAA;AA+f9B,sBA/f8B;;AAAA;AAAA,sBAkgB5B,UAAU,IAlgBkB;AAAA;AAAA;AAAA;;AAmgB1B,yBAngB0B,GAmgBd,KAngBc,C;;AAogB9B,oBAAI,EAAE,SAAF,IAAe,IAAnB,EAAyB;AACvB,sBAAI,EAAE,KAAF,CAAQ,UAAR,CAAmB,OAAO,GAAP,CAAW,EAAE,SAAb,CAAnB,EAA4C,EAAE,EAA9C,CAAJ,EAAuD;AACrD,gCAAY,IAAZ;AACA,wBAAI,EAAE,KAAF,IAAW,IAAf,EAAqB;AACnB,6BAAO,GAAP,CAAW,EAAE,SAAb,IAA0B,EAAE,KAA5B;AACD,qBAFD,MAEO;AACL,6BAAO,OAAO,GAAP,CAAW,EAAE,SAAb,CAAP;AACD;AACF;AACF,iBATD,MASO;AACL,sBAAI,EAAE,KAAF,CAAQ,UAAR,CAAmB,OAAO,KAA1B,EAAiC,EAAE,EAAnC,CAAJ,EAA4C;;AAE1C,gCAAY,IAAZ;AACA,2BAAO,KAAP,GAAe,EAAE,KAAjB;AACD;AACD,sBAAI,EAAE,KAAF,CAAQ,SAAR,CAAkB,CAAlB,EAAqB,OAAO,GAA5B,CAAJ,EAAsC;;AAEpC,gCAAY,IAAZ;AACA,2BAAO,GAAP,GAAa,EAAE,IAAf;AACD;AACF;;AAxhB6B,qBAyhB1B,SAzhB0B;AAAA;AAAA;AAAA;;AAAA,gDA0hBrB,KAAK,YAAL,CAAkB,MAAlB,CA1hBqB;;AAAA;AAAA,gDA8hBzB,KAAK,eAAL,CAAqB,EAAE,EAAvB,CA9hByB;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uEAiiBR,KAjiBQ;AAAA,YAkiB9B,CAliB8B;AAAA;AAAA;AAAA;AAAA;AAAA,gDAkiBnB,KAAK,EAAL,CAAQ,kBAAR,CAA2B,CAAC,MAAM,IAAP,EAAa,MAAM,KAAnB,CAA3B,CAliBmB;;AAAA;AAkiB9B,iBAliB8B;;AAmiBlC,oBAAI,KAAK,IAAL,IAAa,EAAE,EAAF,CAAK,CAAL,MAAY,MAAM,IAA/B,IAAuC,EAAE,EAA7C,EAAiD;AAC/C,wBAAM,KAAN,GAAc,KAAK,GAAL,CAAS,MAAM,KAAf,EAAsB,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAAlC,CAAd;AACD;;AAriBiC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,0DAuiBrB,IAviBqB;AAAA,YAwiB9B,KAxiB8B,EA0iB9B,CA1iB8B,EA2iB9B,OA3iB8B;AAAA;AAAA;AAAA;AAAA;AAAA,gDAwiBf,KAAK,QAAL,CAAc,IAAd,CAxiBe;;AAAA;AAwiB9B,qBAxiB8B;AAAA,gDAyiB3B,KAAK,wBAAL,CAA8B,KAA9B,CAziB2B;;AAAA;AAAA,gDA0iBnB,KAAK,YAAL,CAAkB,CAAC,IAAD,EAAO,MAAM,KAAb,CAAlB,CA1iBmB;;AAAA;AA0iB9B,iBA1iB8B;AA2iB9B,uBA3iB8B,GA2iBnB,KAAK,IAAL,IAAa,EAAE,OAAF,IAAa,IAA3B,GAAmC,EAAE,OAAF,CAAU,MAA7C,GAAsD,CA3iBlC;;AAAA;AAAA,sBA4iB3B,KAAK,IAAL,IAAa,SAAS,EAAE,EAAF,CAAK,CAAL,CAAtB,IAAiC,EAAE,EAAF,CAAK,CAAL,KAAW,MAAM,KAAlD,IAA2D,EAAE,EAAF,CAAK,CAAL,IAAU,OAAV,GAAoB,MAAM,KA5iB1D;AAAA;AAAA;AAAA;;;AA8iBhC,sBAAM,KAAN,IAAe,OAAf;AA9iBgC,gDA+iBzB,KAAK,wBAAL,CAA8B,KAA9B,CA/iByB;;AAAA;AAAA,gDAgjBrB,KAAK,EAAL,CAAQ,QAAR,CAAiB,EAAE,EAAnB,CAhjBqB;;AAAA;AAgjBhC,iBAhjBgC;;AAijBhC,0BAAW,KAAK,IAAL,IAAa,EAAE,OAAF,IAAa,IAA3B,GAAmC,EAAE,OAAF,CAAU,MAA7C,GAAsD,CAAhE;AAjjBgC;AAAA;;AAAA;AAAA,gDAmjB3B,KAAK,QAAL,CAAc,KAAd,CAnjB2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;AAAA;AAAA;AAAA,6DAyjBlB,EAzjBkB;AAAA,YA0jB9B,SA1jB8B,EA4jBzB,IA5jByB,EA6jB5B,EA7jB4B,EA8jB5B,GA9jB4B,EA+jB5B,CA/jB4B,EA8mBzB,CA9mByB,EA+mB5B,GA/mB4B,EAsnB1B,OAtnB0B,EAwnBxB,CAxnBwB,EA4nBxB,IA5nBwB,EA8oB1B,GA9oB0B;AAAA;AAAA;AAAA;AAAA;AA0jB9B,yBA1jB8B,GA0jBlB,EA1jBkB;AAAA,wDA4jBjB,EA5jBiB;;AAAA;AAAA;AAAA;AAAA;AAAA;;AA4jBzB,oBA5jByB;AA6jB5B,kBA7jB4B,GA6jBvB,GAAG,IAAH,CA7jBuB;AA8jB5B,mBA9jB4B,GA8jBtB,CA9jBsB;AA+jB5B,iBA/jB4B,GA+jBxB,GAAG,GAAH,CA/jBwB;AAAA,gDAgkBzB,KAAK,EAAL,CAAQ,OAAR,CAAgB,IAAhB,EAAsB,CAAC,IAAD,EAAO,CAAP,CAAtB,EAAiC,CAAC,IAAD,EAAO,OAAO,SAAd,CAAjC,0BAA2D,kBAAY,CAAZ;AAAA,sBAY1D,IAZ0D;AAAA;AAAA;AAAA;AAAA;AAAA,gCAWzD,KAAK,IAXoD;AAAA;AAAA;AAAA;;AAY1D,8BAZ0D,GAYnD,CAZmD,C;;AAAA,gCAa1D,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAAZ,IAAmB,EAAE,CAAF,CAbuC;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAgBvD,8BAAI,EAAE,CAAF,IAAO,EAAE,EAAF,CAAK,CAAL,CAAX,EAAoB;;;;AAIzB,mCAAO,KAAK,GAAL,CAAS,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,CAAF,CAAnB,EAAyB,EAAE,CAAF,CAAzB,CAAP;AACA,sCAAU,IAAV,CAAe,CAAC,IAAD,EAAO,EAAE,CAAF,CAAP,EAAa,IAAb,EAAmB,EAAE,CAAF,CAAnB,CAAf;AACD,2BANM,MAMA;;AAEL,mCAAO,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAAZ,GAAkB,EAAE,CAAF,CAAzB,C;AACA,gCAAI,EAAE,CAAF,KAAQ,CAAC,EAAE,EAAf,EAAmB;;;AAGjB,wCAAU,IAAV,CAAe,CAAC,IAAD,EAAO,EAAE,CAAF,CAAP,EAAa,KAAK,GAAL,CAAS,IAAT,EAAe,EAAE,CAAF,CAAf,CAAb,EAAmC,EAAE,CAAF,CAAnC,CAAf;AACD;AACF;;AA9B6D;AA+B9D,8BAAI,EAAE,CAAF,KAAQ,IAAZ,EAAkB;;AAEhB,gCAAI,GAAG,EAAE,GAAL,CAAJ;AACD,2BAHD,MAGO;AACL,8BAAE,CAAF,IAAO,EAAE,CAAF,IAAO,IAAd,C;AACA,8BAAE,CAAF,IAAO,EAAE,CAAF,IAAO,IAAd,C;AACD;AArC6D;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAA3D,EAhkByB;;AAAA;;AAymBhC,uBAAO,MAAM,GAAG,MAAhB,EAAwB,KAAxB,EAA+B;AAC7B,sBAAI,GAAG,GAAH,CAAJ;AACA,4BAAU,IAAV,CAAe,CAAC,IAAD,EAAO,EAAE,CAAF,CAAP,EAAa,EAAE,CAAF,CAAb,EAAmB,EAAE,CAAF,CAAnB,CAAf;AACD;AA5mB+B;AAAA;;AAAA;AA8mBzB,iBA9mByB,GA8mBrB,CA9mBqB;;AAAA;AAAA,sBA8mBlB,IAAI,UAAU,MA9mBI;AAAA;AAAA;AAAA;;AA+mB5B,mBA/mB4B,GA+mBtB,UAAU,CAAV,CA/mBsB;;;AAAA,gDAinBzB,KAAK,eAAL,CAAqB,CAAC,IAAI,CAAJ,CAAD,EAAS,IAAI,CAAJ,CAAT,CAArB,EAAuC,IAAI,CAAJ,CAAvC,CAjnByB;;AAAA;AAAA,qBAknB5B,IAAI,CAAJ,CAlnB4B;AAAA;AAAA;AAAA;;AAAA,gDAonBvB,KAAK,oBAAL,CAA0B,CAAC,IAAI,CAAJ,CAAD,EAAS,IAAI,CAAJ,CAAT,CAA1B,EAA4C,IAAI,CAAJ,CAA5C,CApnBuB;;AAAA;;;AAsnB1B,uBAtnB0B,GAsnBhB,IAAI,CAAJ,IAAS,IAAI,CAAJ,CAtnBO;;AAAA;AAAA,sBAunBvB,WAAW,IAAI,CAAJ,CAvnBY;AAAA;AAAA;AAAA;;AAAA,gDAwnBb,KAAK,EAAL,CAAQ,kBAAR,CAA2B,CAAC,IAAI,CAAJ,CAAD,EAAS,UAAU,CAAnB,CAA3B,CAxnBa;;AAAA;AAwnBxB,iBAxnBwB;;AAAA,sBAynBxB,KAAK,IAznBmB;AAAA;AAAA;AAAA;;AAAA;;AAAA;AA4nBxB,oBA5nBwB,GA4nBjB,EAAE,OAAF,IAAa,IAAb,GAAoB,EAAE,OAAF,CAAU,MAA9B,GAAuC,CA5nBtB;;AAAA,sBA6nBxB,EAAE,EAAF,CAAK,CAAL,MAAY,IAAI,CAAJ,CAAZ,IAAsB,EAAE,EAAF,CAAK,CAAL,IAAU,IAAV,IAAkB,IAAI,CAAJ,CA7nBhB;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAAA,sBAioBxB,EAAE,EAAF,CAAK,CAAL,IAAU,IAAV,GAAiB,IAAI,CAAJ,IAAS,IAAI,CAAJ,CAjoBF;AAAA;AAAA;AAAA;;AAAA,gDAmoBf,KAAK,oBAAL,CAA0B,CAAC,IAAI,CAAJ,CAAD,EAAS,IAAI,CAAJ,IAAS,IAAI,CAAJ,CAAT,GAAkB,CAA3B,CAA1B,CAnoBe;;AAAA;AAmoB1B,iBAnoB0B;;AAAA;AAAA,sBAqoBxB,EAAE,EAAF,CAAK,CAAL,IAAU,IAAI,CAAJ,CAroBc;AAAA;AAAA;AAAA;;AAAA,gDAuoBf,KAAK,sBAAL,CAA4B,CAAC,IAAI,CAAJ,CAAD,EAAS,IAAI,CAAJ,CAAT,CAA5B,CAvoBe;;AAAA;AAuoB1B,iBAvoB0B;;AAAA;AAyoB5B,0BAAU,EAAE,EAAF,CAAK,CAAL,CAAV;AAzoB4B,gDA0oBrB,KAAK,uBAAL,CAA6B,EAAE,EAA/B,CA1oBqB;;AAAA;AAAA;AAAA;;AAAA;AA6oBhC,oBAAI,KAAK,KAAL,CAAW,wBAAf,EAAyC;AACnC,qBADmC,GAC7B,EAD6B;;AAEvC,sBAAI,IAAJ,CAAS,EAAC,QAAQ,QAAT,EAAmB,QAAQ,CAAC,EAAE,CAAF,CAAD,EAAO,EAAE,CAAF,CAAP,CAA3B,EAAyC,QAAQ,IAAI,CAAJ,CAAjD,EAAT;AACA,uBAAK,KAAL,CAAW,CAAX,CAAa,SAAb,CAAuB,YAAvB,CAAoC,GAApC;AACD;;AAjpB+B;AA8mBI,mBA9mBJ;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iEAopBd,EAppBc;AAAA,YAqpB9B,CArpB8B;AAAA;AAAA;AAAA;AAAA;AAAA,gDAqpBnB,KAAK,EAAL,CAAQ,kBAAR,CAA2B,EAA3B,CArpBmB;;AAAA;AAqpB9B,iBArpB8B;AAAA,mDAspB3B,KAAK,IAAL,IAAa,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CAAzB,IAAkC,GAAG,CAAH,IAAQ,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GAAtD,IAA6D,EAAE,EAtpBpC;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;AAAA;AAAA;AAAA;AAAA,YA4pB9B,EA5pB8B;AAAA;AAAA;AAAA;AAAA;AA4pB9B,kBA5pB8B,GA4pBzB,EA5pByB;AAAA,gDA6pB3B,KAAK,EAAL,CAAQ,OAAR,CAAgB,IAAhB,EAAsB,IAAtB,EAA4B,IAA5B,0BAAkC,kBAAY,CAAZ;AAAA,sBACnC,IADmC,EAEnC,OAFmC,EAGnC,GAHmC,EAInC,EAJmC,EAKnC,EALmC;AAAA;AAAA;AAAA;AAAA;AACnC,8BADmC,GAC5B,EAAE,EAAF,CAAK,CAAL,CAD4B;AAEnC,iCAFmC,GAEzB,EAAE,EAAF,CAAK,CAAL,CAFyB;AAGnC,6BAHmC,GAG7B,EAAE,GAH2B;AAInC,4BAJmC,GAI9B,EAAE,EAJ4B;AAKnC,4BALmC,GAK9B,GAAG,IAAH,CAL8B;;AAMvC,8BAAI,OAAO,KAAK,CAAhB,EAAmB;AACjB,iCAAK,EAAL;AACA,+BAAG,IAAH,IAAW,EAAX;AACD;AACD,6BAAG,IAAH,CAAQ,CAAC,OAAD,EAAU,GAAV,EAAe,EAAf,CAAR;;AAVuC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAAlC,EA7pB2B;;AAAA;AAAA,mDAyqB3B,EAzqB2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,wDA2qBvB,EA3qBuB;AAAA,YA4qB9B,CA5qB8B;AAAA;AAAA;AAAA;AAAA;AAAA,gDA4qBnB,KAAK,EAAL,CAAQ,kBAAR,CAA2B,EAA3B,CA5qBmB;;AAAA;AA4qB9B,iBA5qB8B;AAAA,mDA6qB3B,KAAK,IAAL,IAAa,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CAAzB,IAAkC,GAAG,CAAH,IAAQ,EAAE,EAAF,CAAK,CAAL,IAAU,EAAE,GA7qB3B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2DA+qBpB,EA/qBoB;AAAA;AAAA;AAAA;AAAA;AAAA,gDAgrB3B,KAAK,EAAL,CAAQ,GAAR,CAAY,EAAZ,CAhrB2B;;AAAA;AAAA,mDAirB3B,EAjrB2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2DAmrBpB,EAnrBoB;AAAA;AAAA;AAAA;AAAA;AAAA,gDAorB3B,KAAK,EAAL,CAAQ,GAAR,CAAY,EAAZ,CAprB2B;;AAAA;AAqrBlC,oBAAI,CAAC,KAAK,KAAL,CAAW,CAAX,CAAa,SAAb,CAAuB,cAAvB,EAAD,IAA4C,KAAK,KAAL,CAAW,wBAAvD,IAAmF,OAAO,GAAG,EAAH,CAAM,CAAN,CAAP,KAAoB,QAA3G,EAAqH;;AAEnH,uBAAK,KAAL,CAAW,CAAX,CAAa,SAAb,CAAuB,YAAvB,CAAoC,CAAC,EAAD,CAApC;AACD;;AAxrBiC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;AAAA;AAAA;AAAA,iEA2rBd,EA3rBc;AAAA,YAmsB5B,IAnsB4B;AAAA;AAAA;AAAA;AAAA;AAAA,sBA6rBhC,MAAM,IAAN,IACA,GAAG,IAAH,IAAW,IADX,IAEA,GAAG,OAAH,IAAc,IAFd,IAGA,GAAG,IAAH,CAAQ,CAAR,MAAe,GAAG,EAAH,CAAM,CAAN,CAHf,IAIA,EAAE,KAAF,CAAQ,UAAR,CAAmB,GAAG,IAAtB,EAA4B,GAAG,MAA/B,CAjsBgC;AAAA;AAAA;AAAA;;AAAA,gDAmsBd,KAAK,YAAL,CAAkB,GAAG,IAArB,CAnsBc;;AAAA;AAmsB5B,oBAnsB4B;;AAAA,sBAosB5B,KAAK,OAAL,IAAgB,IAAhB,IACA,KAAK,EAAL,CAAQ,CAAR,IAAa,KAAK,OAAL,CAAa,MAA1B,KAAqC,GAAG,EAAH,CAAM,CAAN,CADrC,IAEA,KAAK,QAAL,CAAc,MAAd,KAAyB,CAFzB,IAGA,CAAC,KAAK,EAHN,IAGY,CAAC,KAAK,OAHlB,IAIA,CAAC,GAAG,EAJJ,IAIU,CAAC,GAAG,OAxsBc;AAAA;AAAA;AAAA;;;AA2sB9B,oBAAI,GAAG,QAAH,IAAe,IAAnB,EAAyB;AACvB,uBAAK,QAAL,GAAgB,GAAG,QAAnB;AACD,iBAFD,MAEO;AACL,yBAAO,KAAK,QAAZ;AACD;AACD,qBAAK,OAAL,GAAe,KAAK,OAAL,CAAa,MAAb,CAAoB,GAAG,OAAvB,CAAf;AACA,qBAAK,KAAL,GAAa,GAAG,KAAhB;AAjtB8B,gDAktBvB,KAAK,EAAL,CAAQ,MAAR,CAAe,GAAG,EAAlB,CAltBuB;;AAAA;AAAA,gDAmtBvB,KAAK,YAAL,CAAkB,IAAlB,CAntBuB;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2DAutBpB,EAvtBoB;AAAA,YAwtB9B,GAxtB8B,EA4tB5B,GA5tB4B;AAAA;AAAA;AAAA;AAAA;AAAA,gDAwtBjB,KAAK,EAAL,CAAQ,kBAAR,CAA2B,EAA3B,CAxtBiB;;AAAA;AAwtB9B,mBAxtB8B;;AAAA,sBAytB9B,OAAO,IAztBuB;AAAA;AAAA;AAAA;;AAAA,mDA0tBzB,IA1tByB;;AAAA;AA4tB5B,mBA5tB4B,GA4tBtB,IAAI,OAAJ,IAAe,IAAf,GAAsB,IAAI,OAAJ,CAAY,MAAlC,GAA2C,CA5tBrB,C;;AAAA,sBA6tB5B,GAAG,CAAH,MAAU,IAAI,EAAJ,CAAO,CAAP,CAAV,IAAuB,GAAG,CAAH,IAAQ,IAAI,EAAJ,CAAO,CAAP,IAAY,GA7tBf;AAAA;AAAA;AAAA;;AAAA,mDA8tBvB,GA9tBuB;;AAAA;AAAA,mDAguBvB,IAhuBuB;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,wEAouBP,EApuBO;AAAA;AAAA;AAAA;AAAA;AAAA,gDAquB3B,KAAK,sBAAL,CAA4B,EAA5B,CAruB2B;;AAAA;AAAA,gDAsuBpB,KAAK,oBAAL,CAA0B,EAA1B,CAtuBoB;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;AAAA;AAAA;AAAA,qEA0uBV,EA1uBU;AAAA,YA2uB9B,GA3uB8B,EAgvB1B,IAhvB0B,EAmvB1B,OAnvB0B;AAAA;AAAA;AAAA;AAAA;AAAA,gDA2uBjB,KAAK,YAAL,CAAkB,EAAlB,CA3uBiB;;AAAA;AA2uB9B,mBA3uB8B;;AAAA,sBA4uB9B,OAAO,IA5uBuB;AAAA;AAAA;AAAA;;AAAA,sBA6uB5B,IAAI,EAAJ,CAAO,CAAP,MAAc,GAAG,CAAH,CA7uBc;AAAA;AAAA;AAAA;;AAAA,mDA8uBvB,GA9uBuB;;AAAA;AAgvB1B,oBAhvB0B,GAgvBnB,EAAE,KAAF,CAAQ,UAAR,CAAmB,GAAnB,CAhvBmB;;AAivB9B,oBAAI,OAAJ,GAAc,KAAK,OAAL,CAAa,MAAb,CAAoB,GAAG,CAAH,IAAQ,IAAI,EAAJ,CAAO,CAAP,CAA5B,CAAd;AACA,oBAAI,EAAJ,GAAS,EAAT;AACI,uBAnvB0B,GAmvBhB,EAAE,KAAF,CAAQ,SAAR,CAAkB,IAAlB,CAnvBgB;;AAovB9B,oBAAI,MAAJ,GAAa,OAAb;AACA,qBAAK,QAAL,GAAgB,CAAC,IAAI,EAAL,CAAhB;AACA,qBAAK,KAAL,GAAa,IAAI,EAAjB;AACA,oBAAI,IAAJ,GAAW,OAAX;;AAvvB8B,gDAyvBvB,KAAK,YAAL,CAAkB,IAAlB,CAzvBuB;;AAAA;AAAA,gDA0vBvB,KAAK,YAAL,CAAkB,GAAlB,CA1vBuB;;AAAA;AA2vB9B,oBAAI,KAAK,EAAT,EAAa;AACX,uBAAK,KAAL,CAAW,qBAAX,CAAiC,IAAI,EAArC;AACD;AA7vB6B,mDA8vBvB,GA9vBuB;;AAAA;AAAA;AAAA;;AAAA;AAAA,mDAiwBzB,IAjwByB;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;AAAA;AAAA;AAAA,mEAswBZ,EAtwBY;AAAA,YAuwB9B,GAvwB8B,EA4wB1B,KA5wB0B,EA+wB1B,MA/wB0B;AAAA;AAAA;AAAA;AAAA;AAAA,gDAuwBjB,KAAK,YAAL,CAAkB,EAAlB,CAvwBiB;;AAAA;AAuwB9B,mBAvwB8B;;AAAA,sBAwwB9B,OAAO,IAxwBuB;AAAA;AAAA;AAAA;;AAAA,sBAywB5B,IAAI,OAAJ,IAAe,IAAf,IAAwB,IAAI,EAAJ,CAAO,CAAP,IAAY,IAAI,OAAJ,CAAY,MAAxB,GAAiC,CAAjC,KAAuC,GAAG,CAAH,CAzwBnC;AAAA;AAAA;AAAA;;AAAA,mDA0wBvB,GA1wBuB;;AAAA;AA4wB1B,qBA5wB0B,GA4wBlB,EAAE,KAAF,CAAQ,UAAR,CAAmB,GAAnB,CA5wBkB;;AA6wB9B,sBAAM,OAAN,GAAgB,IAAI,OAAJ,CAAY,MAAZ,CAAmB,GAAG,CAAH,IAAQ,IAAI,EAAJ,CAAO,CAAP,CAAR,GAAoB,CAAvC,CAAhB,C;AACA,sBAAM,EAAN,GAAW,CAAC,GAAG,CAAH,CAAD,EAAQ,GAAG,CAAH,IAAQ,CAAhB,CAAX;AACI,sBA/wB0B,GA+wBjB,EAAE,KAAF,CAAQ,SAAR,CAAkB,GAAlB,CA/wBiB;;AAgxB9B,sBAAM,MAAN,GAAe,MAAf;AACA,oBAAI,QAAJ,GAAe,CAAC,MAAM,EAAP,CAAf;AACA,oBAAI,KAAJ,GAAY,MAAM,EAAlB;AACA,sBAAM,IAAN,GAAa,MAAb;;AAnxB8B,gDAqxBvB,KAAK,YAAL,CAAkB,KAAlB,CArxBuB;;AAAA;AAAA,gDAsxBvB,KAAK,YAAL,CAAkB,GAAlB,CAtxBuB;;AAAA;AAuxB9B,oBAAI,IAAI,EAAR,EAAY;AACV,uBAAK,KAAL,CAAW,qBAAX,CAAiC,MAAM,EAAvC;AACD;AAzxB6B,mDA0xBvB,GA1xBuB;;AAAA;AAAA;AAAA;;AAAA;AAAA,mDA6xBzB,IA7xByB;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,2DAgyBpB,E,WAhyBoB;AAAA,YAiyB9B,CAjyB8B,EAsyB5B,IAtyB4B,EAwyB1B,MAxyB0B,EAyyB1B,EAzyB0B;AAAA;AAAA;AAAA;AAAA;AAAA,gDAiyBnB,KAAK,EAAL,CAAQ,IAAR,CAAa,EAAb,CAjyBmB;;AAAA;AAiyB9B,iBAjyB8B;;AAAA,sBAkyB9B,GAAG,CAAH,MAAU,GAAV,IAAiB,KAAK,IAlyBQ;AAAA;AAAA;AAAA;;AAAA,mDAmyBzB,CAnyByB;;AAAA;;;AAsyB5B,oBAtyB4B,GAsyBrB,GAAG,CAAH,EAAM,KAAN,CAAY,GAAZ,CAtyBqB;;AAAA,sBAuyB5B,KAAK,MAAL,GAAc,CAvyBc;AAAA;AAAA;AAAA;;AAwyB1B,sBAxyB0B,GAwyBjB,KAAK,CAAL,CAxyBiB;AAyyB1B,kBAzyB0B,GAyyBrB,EAAE,MAAF,CAAS,MAAT,EAAiB,MAAjB,CAAwB,EAAxB,CAzyBqB;;AA0yB9B,mBAAG,IAAH,GAAU,KAAK,CAAL,CAAV;AA1yB8B,gDA2yBvB,KAAK,YAAL,CAAkB,EAAlB,CA3yBuB;;AAAA;AAAA,mDA4yBvB,EA5yBuB;;AAAA;;AA+yB9B,wBAAQ,KAAR,CAAc,uCAAd;AACA,yB;AAhzB8B,mDAizBvB,IAjzBuB;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,8DAqzBjB,EArzBiB;AAAA;AAAA;AAAA;AAAA;AAAA,gDAszB3B,KAAK,EAAL,CAAQ,MAAR,CAAe,EAAf,CAtzB2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uDAwzBxB,KAxzBwB;AAAA,YAyzB9B,GAzzB8B;AAAA;AAAA;AAAA;AAAA;AAyzB9B,mBAzzB8B,GAyzBxB;AACR,sBAAI,CAAC,MAAM,IAAP,CADI;AAER,yBAAO,MAAM;AAFL,iBAzzBwB;AAAA,gDA6zB3B,KAAK,EAAL,CAAQ,GAAR,CAAY,GAAZ,CA7zB2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,uDA+zBxB,IA/zBwB;AAAA,YAg0B9B,CAh0B8B,EAi0B9B,KAj0B8B;AAAA;AAAA;AAAA;AAAA;AAAA,gDAg0BnB,KAAK,EAAL,CAAQ,IAAR,CAAa,CAAC,IAAD,CAAb,CAh0BmB;;AAAA;AAg0B9B,iBAh0B8B;AAi0B9B,qBAj0B8B,GAi0BtB,KAAK,IAAL,GAAY,IAAZ,GAAmB,EAAE,KAj0BC;;AAk0BlC,oBAAI,SAAS,IAAb,EAAmB;AACjB,0BAAQ,CAAR;AACD;AAp0BiC,mDAq0B3B;AACL,wBAAM,IADD;AAEL,yBAAO;AAFF,iBAr0B2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YA20B9B,WA30B8B;AAAA;AAAA;AAAA;AAAA;AA20B9B,2BA30B8B,GA20BhB,EA30BgB;AAAA,gDA40B3B,KAAK,EAAL,CAAQ,OAAR,CAAgB,IAAhB,EAAsB,IAAtB,EAA4B,IAA5B,0BAAkC,kBAAY,CAAZ;AAAA;AAAA;AAAA;AAAA;AACvC,sCAAY,IAAZ,CAAiB;AACf,kCAAM,EAAE,EAAF,CAAK,CAAL,CADS;AAEf,mCAAO,EAAE;AAFM,2BAAjB;;AADuC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAAlC,EA50B2B;;AAAA;AAAA,mDAk1B3B,WAl1B2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,YAq1B9B,EAr1B8B;AAAA;AAAA;AAAA;AAAA;AAq1B9B,kBAr1B8B,GAq1BzB,EAr1ByB;AAAA,gDAs1B3B,KAAK,EAAL,CAAQ,OAAR,CAAgB,IAAhB,EAAsB,IAAtB,EAA4B,IAA5B,0BAAkC,kBAAY,CAAZ;AAAA;AAAA;AAAA;AAAA;AACvC,6BAAG,EAAE,EAAF,CAAK,CAAL,CAAH,IAAc,EAAE,KAAhB;;AADuC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAAlC,EAt1B2B;;AAAA;AAAA,mDAy1B3B,EAz1B2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA,4DAy4BnB,OAz4BmB;AAAA,YA84B9B,IA94B8B,EAg5B9B,KAh5B8B,kFAi5BzB,QAj5ByB,EAk5B5B,IAl5B4B,EAs5B5B,QAt5B4B,EA05B1B,YA15B0B;;AAAA;AAAA;AAAA;AAAA;;AA24BlC,oBAAI,WAAW,IAAf,EAAqB;AACnB,4BAAU,EAAV;AACD;AACG,oBA94B8B,GA84BvB,EA94BuB;AAAA,gDAg5Bf,KAAK,cAAL,EAh5Be;;AAAA;AAg5B9B,qBAh5B8B;AAAA;AAAA;AAAA;AAAA;AAAA,4BAi5Bb,KAj5Ba;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAi5BzB,wBAj5ByB;AAk5B5B,oBAl5B4B,GAk5BrB,SAAS,IAl5BY;;AAAA,sBAm5B5B,SAAS,GAn5BmB;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAs5B5B,wBAt5B4B,GAs5BjB,QAAQ,IAAR,KAAiB,CAt5BA;;AAAA,sBAu5B5B,WAAW,CAv5BiB;AAAA;AAAA;AAAA;;AAAA,gDA05BJ,KAAK,YAAL,CAAkB,CAAC,IAAD,EAAO,QAAP,CAAlB,CA15BI;;AAAA;AA05B1B,4BA15B0B;;AA25B9B,oBAAI,gBAAgB,IAApB,EAA0B;;AAExB,6BAAW,aAAa,EAAb,CAAgB,CAAhB,CAAX;AACD;;AA95B6B;AAAA,gDAg6BzB,KAAK,EAAL,CAAQ,OAAR,CAAgB,IAAhB,EAAsB,CAAC,IAAD,EAAO,QAAP,CAAtB,EAAwC,CAAC,IAAD,EAAO,OAAO,SAAd,CAAxC,0BAAkE,kBAAY,EAAZ;AAAA,sBAMjE,CANiE,EAajE,eAbiE,EAcjE,QAdiE,EAgD7D,CAhD6D;AAAA;AAAA;AAAA;AAAA;AACvE,+BAAK,EAAE,MAAF,CAAS,GAAG,MAAZ,EAAoB,MAApB,CAA2B,EAA3B,CAAL;;AADuE,gCAEnE,GAAG,MAAH,KAAc,QAFqD;AAAA;AAAA;AAAA;;AAGrE,+BAAK,IAAL,CAAU,EAAV;AAHqE;AAAA;;AAAA;AAAA,gCAI5D,GAAG,KAAH,IAAY,IAAZ,IAAoB,GAAG,KAAH,CAAS,CAAT,KAAe,QAAQ,GAAG,KAAH,CAAS,CAAT,CAAR,KAAwB,CAAvC,CAJwC;AAAA;AAAA;AAAA;;;AAMjE,2BANiE,GAM7D,EAN6D;;;;;;;;AAajE,yCAbiE,GAa/C,CAAC,EAAD,CAb+C;AAcjE,kCAdiE,GActD,GAAG,KAdmD;;AAAA;AAAA,+BAe9D,IAf8D;AAAA;AAAA;AAAA;;AAAA,gCAgB/D,EAAE,IAAF,IAAU,IAhBqD;AAAA;AAAA;AAAA;;AAiBjE,6BAAG,IAAH,GAAU,IAAV;AACA,+BAAK,IAAL,CAAU,EAAV;AACA,8BAAI,CAAC,EAAE,KAAF,CAAQ,UAAR,CAAmB,EAAE,EAArB,EAAyB,GAAG,EAA5B,CAAL,EAAsC;AACpC,gCAAI,EAAE,MAAF,CAAS,GAAG,MAAZ,EAAoB,MAApB,CAA2B,CAA3B,CAAJ;AACA,8BAAE,KAAF,GAAU,gBAAgB,gBAAgB,MAAhB,GAAyB,CAAzC,EAA4C,EAAtD;AACA,iCAAK,IAAL,CAAU,CAAV;AACD;AAvBgE;;AAAA;AAAA,0DA0BxD,KAAK,YAAL,CAAkB,EAAE,IAApB,CA1BwD;;AAAA;AA0BnE,2BA1BmE;;;AA4BnE,iCAAO,gBAAgB,MAAhB,GAAyB,CAAzB,IAA8B,EAAE,KAAF,CAAQ,SAAR,CAAkB,CAAlB,EAAqB,gBAAgB,gBAAgB,MAAhB,GAAyB,CAAzC,EAA4C,MAAjE,CAArC,EAA+G;AAC7G,4CAAgB,GAAhB;AACD;;AA9BkE,gCA+B/D,EAAE,EAAF,CAAK,CAAL,KAAW,QAAQ,EAAE,EAAF,CAAK,CAAL,CAAR,KAAoB,CAA/B,CA/B+D;AAAA;AAAA;AAAA;;;AAiCjE,6BAAG,IAAH,GAAU,EAAE,KAAF,CAAQ,SAAR,CAAkB,CAAlB,CAAV;AACA,+BAAK,IAAL,CAAU,EAAV;AAlCiE;;AAAA;AAoC5D,8BAAI,EAAE,KAAF,CAAQ,SAAR,CAAkB,CAAlB,EAAqB,GAAG,MAAxB,CAAJ,EAAqC;;AAE1C,+BAAG,IAAH,GAAU,GAAG,MAAb;AACA,iCAAK,IAAL,CAAU,EAAV;AACA,iCAAK,EAAE,MAAF,CAAS,GAAG,MAAZ,EAAoB,MAApB,CAA2B,CAA3B,CAAL;AACA,+BAAG,KAAH,GAAW,QAAX;AACA,gCAAI,gBAAgB,MAAhB,GAAyB,CAA7B,EAAgC;AAC9B,sCAAQ,GAAR,CAAY,iDAAZ;AACD;AACD,8CAAkB,CAAC,EAAD,CAAlB;AACD,2BAVM,MAUA;;AAED,6BAFC,GAEG,EAAE,MAAF,CAAS,GAAG,MAAZ,EAAoB,MAApB,CAA2B,CAA3B,CAFH;;AAGL,8BAAE,KAAF,GAAU,gBAAgB,gBAAgB,MAAhB,GAAyB,CAAzC,EAA4C,EAAtD;AACA,8BAAE,IAAF,GAAS,EAAE,MAAX;AACA,iCAAK,IAAL,CAAU,CAAV;AACA,4CAAgB,IAAhB,CAAqB,CAArB;AACD;;AArDkE;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iBAAlE,EAh6ByB;;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;;AAAA;;AAAA;AAAA;;AAAA;AAAA;;AAAA;AAAA,mDA09B3B,KAAK,OAAL,EA19B2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,gDAs/B3B,KAAK,EAAL,CAAQ,KAAR,EAt/B2B;;AAAA;AAAA,gDAu/B3B,KAAK,EAAL,CAAQ,KAAR,EAv/B2B;;AAAA;AAAA,gDAw/B3B,KAAK,EAAL,CAAQ,KAAR,EAx/B2B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA;;AA2/BtC,IAAE,WAAF,GAAgB,oBAAhB;AACD,CA5/BD;;;;AC3EA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,OAAO,OAAP,GAAiB,UAAU,C,WAAV,EAAwB;AACvC,IAAE,KAAF,GAAU,EAAV;;AADuC,MAGjC,oBAHiC;AAIrC,oCAAe;AAAA;;AACb,WAAK,cAAL,GAAsB,EAAtB;AACD;;AANoC;AAAA;AAAA,gCAO1B;AACT,aAAK,cAAL,GAAsB,IAAtB;AACD;;;;;AAToC;AAAA;AAAA,uCAanB,CAbmB,EAahB;AACnB,aAAK,cAAL,CAAoB,IAApB,CAAyB,CAAzB;AACD;AAfoC;AAAA;AAAA,0CAgBhB,CAhBgB,EAgBb;AACtB,aAAK,cAAL,GAAsB,KAAK,cAAL,CAAoB,MAApB,CAA2B,UAAU,CAAV,EAAa;AAC5D,iBAAO,MAAM,CAAb;AACD,SAFqB,CAAtB;AAGD;AApBoC;AAAA;AAAA,gDAqBV;AACzB,aAAK,cAAL,GAAsB,EAAtB;AACD;AAvBoC;AAAA;AAAA,yCAwBjB,KAxBiB,EAwBV;AACzB,aAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,KAAK,cAAL,CAAoB,MAAxC,EAAgD,GAAhD,EAAqD;AACnD,cAAI;AACF,iBAAK,cAAL,CAAoB,CAApB,EAAuB,KAAvB;AACD,WAFD,CAEE,OAAO,CAAP,EAAU;AACV,oBAAQ,KAAR,CAAc,oCAAd;AACD;AACF;AACF;AAhCoC;;AAAA;AAAA;;AAkCvC,IAAE,KAAF,CAAQ,oBAAR,GAA+B,oBAA/B;;AAlCuC,MAoCjC,YApCiC;AAAA;;;;;;;;;;;;;;;AAkDrC,0BAAa,O,iBAAb,EAAuC;AAAA;;AAAA;;AAErC,YAAK,OAAL,GAAe,EAAf;AACA,YAAK,QAAL,GAAgB,CAAhB;AACA,YAAK,OAAL,GAAe,OAAf;AAJqC;AAKtC;;AAvDoC;AAAA;AAAA,gCAwD1B;AACT;AACA,aAAK,OAAL,GAAe,IAAf;AACA,aAAK,QAAL,GAAgB,IAAhB;AACA,aAAK,OAAL,GAAe,IAAf;AACD;;;;;;AA7DoC;AAAA;AAAA,iCAkEzB,EAlEyB,EAkErB;AAAA;;AACd,YAAI,KAAK,QAAL,IAAiB,CAArB,EAAwB;AACtB,eAAK,OAAL,CAAa,EAAb;AACD,SAFD,MAEO,IAAI,GAAG,MAAH,KAAc,QAAlB,EAA4B;AAAA,cAC7B,IAD6B;;AAAA;AAAA,gBAExB,WAFwB,GAEjC,SAAS,WAAT,CAAsB,CAAtB,EAAyB;AACvB,kBAAI,EAAE,MAAF,IAAY,IAAhB,EAAsB;AACpB,sBAAM,IAAI,KAAJ,CAAU,mDAAV,CAAN;AACD;;;AAGD,mBAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,KAAK,OAAL,CAAa,MAAjC,EAAyC,GAAzC,EAA8C;AAC5C,oBAAI,IAAI,KAAK,OAAL,CAAa,CAAb,CAAR;AACA,oBAAI,EAAE,MAAF,KAAa,QAAb,IAAyB,EAAE,EAAF,CAAK,CAAL,MAAY,EAAE,MAAF,CAAS,CAAT,CAAzC,EAAsD;AACpD,sBAAI,UAAU,EAAE,cAAF,CAAiB,SAAjB,IAA8B,EAAE,OAAF,CAAU,MAAxC,GAAiD,CAA/D;AACA,sBAAI,SAAS,EAAE,MAAF,CAAS,CAAT,CAAb;AACA,sBAAI,OAAO,EAAE,MAAF,CAAS,CAAT,KAAe,EAAE,MAAF,IAAY,CAA3B,CAAX;AACA,sBAAI,SAAS,EAAE,EAAF,CAAK,CAAL,CAAb;AACA,sBAAI,OAAO,EAAE,EAAF,CAAK,CAAL,IAAU,OAArB;;AAEA,sBAAI,QAAQ,MAAR,IAAkB,QAAQ,MAA9B,EAAsC;;AAEpC;AACD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAiCD,sBAAI,SAAS,MAAb,EAAqB;AACnB,wBAAI,SAAS,IAAb,EAAmB;AACjB,0BAAI,OAAO,IAAX,EAAiB;;;AAGf,0BAAE,OAAF,CAAU,MAAV,CAAiB,SAAS,MAA1B;;AAEA,0BAAE,MAAF,GAAW,OAAO,IAAlB;AACA,0BAAE,MAAF,GAAW,CAAC,EAAE,MAAF,CAAS,CAAT,CAAD,EAAc,IAAd,CAAX;AACA;AACD,uBARD,MAQO,IAAI,SAAS,IAAb,EAAmB;;AAExB,0BAAE,OAAF,CAAU,MAAV,CAAiB,SAAS,MAA1B;;AAEA;AACD,uBALM,MAKA;;;AAEL,4BAAI,OAAO;AACT,8BAAI,CAAC,EAAE,EAAF,CAAK,CAAL,CAAD,EAAU,IAAV,CADK;AAET,mCAAS,EAAE,OAAF,CAAU,KAAV,CAAgB,OAAO,MAAvB,CAFA;AAGT,kCAAQ;AAHC,yBAAX;AAKA,6BAAK,OAAL,CAAa,IAAb,CAAkB,IAAlB;AACA,0BAAE,OAAF,CAAU,MAAV,CAAiB,SAAS,MAA1B;AACA;AACD;AACF;AACF,mBA3BD,MA2BO,IAAI,WAAW,MAAf,EAAuB;AAC5B,wBAAI,OAAO,IAAX,EAAiB;;AAEf,wBAAE,MAAF,GAAW,OAAO,IAAlB;AACA,wBAAE,MAAF,GAAW,CAAC,EAAE,MAAF,CAAS,CAAT,CAAD,EAAc,IAAd,CAAX;AACA,wBAAE,OAAF,GAAY,EAAZ;AACA;AACD,qBAND,MAMO,IAAI,SAAS,IAAb,EAAmB;;AAExB,2BAAK,OAAL,CAAa,MAAb,CAAoB,CAApB,EAAuB,CAAvB;AACA;AACD,qBAJM,MAIA;;;AAEL,wBAAE,OAAF,GAAY,EAAE,OAAF,CAAU,KAAV,CAAgB,OAAO,MAAvB,CAAZ;AACA,wBAAE,EAAF,GAAO,CAAC,EAAE,EAAF,CAAK,CAAL,CAAD,EAAU,IAAV,CAAP;AACA;AACD;AACF,mBAjBM,MAiBA;;AACL,wBAAI,SAAS,IAAb,EAAmB;;;;;;;;;;;;;AAajB,0BAAI,OAAO,IAAX,EAAiB;;AAEf;AACA,6BAAK,OAAL,CAAa,MAAb,CAAoB,CAApB,EAAuB,CAAvB;AACA,oCAAY;AACV,kCAAQ,CAAC,EAAE,MAAF,CAAS,CAAT,CAAD,EAAc,MAAd,CADE;AAEV,kCAAQ,SAAS,MAFP;AAGV,kCAAQ;AAHE,yBAAZ;AAKA,oCAAY;AACV,kCAAQ,CAAC,EAAE,MAAF,CAAS,CAAT,CAAD,EAAc,IAAd,CADE;AAEV,kCAAQ,OAAO,IAFL;AAGV,kCAAQ;AAHE,yBAAZ;AAKA;AACD,uBAfD,MAeO,IAAI,SAAS,IAAb,EAAmB;;AAExB,6BAAK,OAAL,CAAa,MAAb,CAAoB,CAApB,EAAuB,CAAvB;AACA;AACA,0BAAE,MAAF,IAAY,OAAZ;AACA;AACD,uBANM,MAMA;;;AAEL,0BAAE,MAAF,GAAW,SAAS,MAApB;AACA,0BAAE,OAAF,CAAU,MAAV,CAAiB,CAAjB,EAAoB,OAAO,MAA3B;AACA,0BAAE,EAAF,GAAO,CAAC,EAAE,EAAF,CAAK,CAAL,CAAD,EAAU,IAAV,CAAP;AACA;AACD;AACF;AACF;AACF;AACF;;AAED,mBAAK,OAAL,CAAa,IAAb,CAAkB,CAAlB;AACD,aAjJgC;;AAC7B,yBAD6B;;AAkJjC,wBAAY,EAAZ;AAlJiC;AAmJlC,SAnJM,MAmJA;AACL,eAAK,OAAL,CAAa,IAAb,CAAkB,EAAlB;AACD;AACF;;;;;;;AA3NoC;AAAA;AAAA,8CAiOZ,GAjOY,EAiOP;AAC5B,aAAK,QAAL;AACA,YAAI,GAAJ,CAAQ,EAAE,KAAF,CAAQ,aAAhB,EAA+B,OAA/B,CAAuC,KAAK,OAA5C;AACD;AApOoC;AAAA;AAAA,uDAqOzB,WArOyB,EAqOZ,CArOY,EAqOT,IArOS;AAAA,YAsO1B,cAtO0B,EA2P/B,MA3P+B,EAoQxB,EApQwB,EAqQ3B,CArQ2B,EAuQzB,EAvQyB,EA+QvB,IA/QuB,EAmS3B,GAnS2B,EAoS3B,IApS2B,EAyTtB,CAzTsB;;AAAA;AAAA;AAAA;AAAA;AAsO1B,8BAtO0B,YAsO1B,cAtO0B,CAsOV,KAtOU,EAsOH;;AAE9B,sBAAI,SAAS,EAAb;AACA,yBAAO,MAAM,MAAN,GAAe,CAAtB,EAAyB;AACvB,yBAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,MAAM,MAA1B,EAAkC,GAAlC,EAAuC;AACrC,0BAAI,cAAc,IAAlB;AACA,2BAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,MAAM,MAA1B,EAAkC,GAAlC,EAAuC;AACrC,4BAAI,EAAE,KAAF,CAAQ,SAAR,CAAkB,MAAM,CAAN,CAAlB,EAA4B,MAAM,CAAN,EAAS,IAArC,CAAJ,EAAgD;;AAE9C,wCAAc,KAAd;AACA;AACD;AACF;AACD,0BAAI,WAAJ,EAAiB;AACf,+BAAO,IAAP,CAAY,MAAM,MAAN,CAAa,CAAb,EAAgB,CAAhB,EAAmB,CAAnB,CAAZ;AACA;AACD;AACF;AACF;AACD,yBAAO,MAAP;AACD,iBA1PkC;;AA2P/B,sBA3P+B,GA2PtB,KAAK,OAAL,CAAa,MA3PS;;;AAAA,8CA6P5B,EAAE,KAAF,CAAQ,WAAR,EAAqB,IAArB,CA7P4B;;AAAA;;AA+PnC,qBAAK,OAAL,CAAa,MAAb,CAAoB,MAApB;AACA,oBAAI,KAAK,QAAL,GAAgB,CAApB,EAAuB,KAAK,QAAL;;;AAhQY,sBAkQ/B,KAAK,QAAL,KAAkB,CAAlB,IAAuB,KAAK,OAAL,CAAa,MAAb,GAAsB,CAlQd;AAAA;AAAA;AAAA;;AAoQxB,kBApQwB,GAoQpB,CApQoB;;AAAA;AAAA,sBAoQjB,KAAI,KAAK,OAAL,CAAa,MApQA;AAAA;AAAA;AAAA;;AAqQ3B,iBArQ2B,GAqQvB,KAAK,OAAL,CAAa,EAAb,CArQuB;;AAAA,sBAsQ3B,EAAE,MAAF,KAAa,QAtQc;AAAA;AAAA;AAAA;;AAAA,8CAuQb,YAAY,YAAZ,CAAyB,EAAE,EAA3B,CAvQa;;AAAA;AAuQzB,kBAvQyB;;AAAA,oBAwQxB,EAAE,KAAF,CAAQ,UAAR,CAAmB,GAAG,EAAtB,EAA0B,EAAE,EAA5B,CAxQwB;AAAA;AAAA;AAAA;;;AA0Q3B,kBAAE,IAAF,GAAS,CAAC,EAAE,EAAF,CAAK,CAAL,CAAD,EAAU,EAAE,EAAF,CAAK,CAAL,IAAU,CAApB,CAAT;AA1Q2B;AAAA;;AAAA;AAAA,sBA2QlB,GAAG,IAAH,IAAW,IA3QO;AAAA;AAAA;AAAA;;AA4Q3B,kBAAE,IAAF,GAAS,IAAT;AA5Q2B;AAAA;;AAAA;AAAA,8CA+QT,YAAY,YAAZ,CAAyB,GAAG,IAA5B,CA/QS;;AAAA;AA+QvB,oBA/QuB;;AAAA;AAAA,sBAgRpB,KAAK,OAAL,IAAgB,IAhRI;AAAA;AAAA;AAAA;;AAAA,sBAiRrB,KAAK,IAAL,IAAa,IAjRQ;AAAA;AAAA;AAAA;;AAAA,8CAkRT,YAAY,YAAZ,CAAyB,KAAK,IAA9B,CAlRS;;AAAA;AAkRvB,oBAlRuB;AAAA;AAAA;;AAAA;AAoRvB,uBAAO,IAAP;AApRuB;;AAAA;AAAA;AAAA;;AAAA;AAwR3B,kBAAE,IAAF,GAAS,QAAQ,IAAR,GAAe,EAAE,KAAF,CAAQ,SAAR,CAAkB,IAAlB,CAAf,GAAyC,IAAlD;;AAxR2B;AAoQQ,oBApQR;AAAA;AAAA;;AAAA;;;AA8RjC,oBAAI,KAAK,YAAL,IAAqB,IAAzB,EAA+B;AAC7B,uBAAK,YAAL;AACD;;AAhSgC,sBAiS7B,KAAK,QAAL,KAAkB,CAjSW;AAAA;AAAA;AAAA;;;AAmS3B,mBAnS2B,GAmSrB,EAnSqB;AAoS3B,oBApS2B,GAoSpB,EApSoB;;AAqS/B,qBAAK,OAAL,CAAa,OAAb,CAAqB,UAAU,CAAV,EAAa;AAChC,sBAAI,EAAE,MAAF,KAAa,QAAjB,EAA2B;AACzB,yBAAK,IAAL,CAAU,CAAV;AACD,mBAFD,MAEO;AACL,wBAAI,IAAJ,CAAS,CAAT;AACD;AACF,iBAND;AAOA,qBAAK,OAAL,GAAe,EAAf;;AAEA,sBAAM,eAAe,GAAf,CAAN;;;AAGS,iBAjTsB,GAiTlB,CAjTkB;;AAAA;AAAA,sBAiTf,IAAI,IAAI,MAjTO;AAAA;AAAA;AAAA;;AAAA,sBAkTzB,KAAK,QAAL,KAAkB,CAlTO;AAAA;AAAA;AAAA;;AAmT3B,qBAAK,OAAL,CAAa,IAAI,CAAJ,CAAb;AAnT2B;AAAA;;AAAA;AAqT3B,qBAAK,OAAL,GAAe,KAAK,OAAL,CAAa,MAAb,CAAoB,IAAI,KAAJ,CAAU,CAAV,CAApB,CAAf;AArT2B;;AAAA;AAiTC,mBAjTD;AAAA;AAAA;;AAAA;AAyTtB,iBAzTsB,GAyTlB,CAzTkB;;AAAA;AAAA,sBAyTf,IAAI,KAAK,MAzTM;AAAA;AAAA;AAAA;;AAAA,sBA0TzB,KAAK,QAAL,KAAkB,CA1TO;AAAA;AAAA;AAAA;;AA2T3B,qBAAK,OAAL,CAAa,KAAK,CAAL,CAAb;AA3T2B;AAAA;;AAAA;AA6T3B,qBAAK,OAAL,GAAe,KAAK,OAAL,CAAa,MAAb,CAAoB,KAAK,KAAL,CAAW,CAAX,CAApB,CAAf;AA7T2B;;AAAA;AAyTE,mBAzTF;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;;;;;;AAAA;AAAA;AAAA,qCAyUrB,CAzUqB,EAyUlB;AACjB,YAAI,MAAM,KAAK,OAAL,CAAa,MAAb,CAAoB,KAAK,OAAL,CAAa,MAAb,GAAsB,CAA1C,CAAV;AACA,aAAK,IAAI,MAAM,CAAf,EAAkB,MAAM,IAAI,MAA5B,EAAoC,KAApC,EAA2C;AACzC,cAAI,KAAK,IAAI,GAAJ,CAAT;AACA,cAAI,GAAG,MAAH,KAAc,QAAlB,EAA4B;AAC1B,iBAAK,IAAI,IAAI,KAAK,OAAL,CAAa,MAAb,GAAsB,CAAnC,EAAsC,KAAK,CAA3C,EAA8C,GAA9C,EAAmD;AACjD,kBAAI,IAAI,KAAK,OAAL,CAAa,CAAb,CAAR;;;AAGA,kBAAI,EAAE,MAAF,KAAa,QAAjB,EAA2B;AACzB,oBAAI,EAAE,KAAF,CAAQ,SAAR,CAAkB,CAAlB,EAAqB,GAAG,IAAxB,CAAJ,EAAmC;;AAEjC,oBAAE,KAAF,GAAU,GAAG,EAAb;;AAEA,qBAAG,IAAH,GAAU,EAAE,IAAZ;AACD,iBALD,MAKO,IAAI,EAAE,KAAF,CAAQ,UAAR,CAAmB,EAAE,EAArB,EAAyB,GAAG,KAA5B,CAAJ,EAAwC;;AAE7C,oBAAE,IAAF,GAAS,EAAE,KAAF,CAAQ,SAAR,CAAkB,EAAlB,CAAT;AACA,qBAAG,KAAH,GAAW,EAAE,KAAb;AACD;AACF;AACF;AACF,WAlBD,MAkBO;AACL,kBAAM,IAAI,KAAJ,CAAU,4BAAV,CAAN;AACD;AACF;AACD,aAAK,cAAL,CAAoB,CAApB;AACD;;;;;AApWoC;AAAA;AAAA,qCAwWrB,CAxWqB,EAwWlB,OAxWkB,EAwWT;AAC1B,YAAI,MAAM,KAAK,OAAL,CAAa,MAAb,CAAoB,KAAK,OAAL,CAAa,MAAb,GAAsB,CAA1C,CAAV;AACA,aAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,IAAI,MAAxB,EAAgC,GAAhC,EAAqC;AACnC,cAAI,MAAM,IAAI,CAAJ,CAAV;AACA,cAAI,IAAI,MAAJ,KAAe,QAAnB,EAA6B;AAC3B,gBAAI,WAAW,IAAf,EAAqB;AACnB,mBAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,KAAK,OAAL,CAAa,MAAjC,EAAyC,GAAzC,EAA8C;AAC5C,oBAAI,IAAI,KAAK,OAAL,CAAa,CAAb,CAAR;;AAEA,oBAAI,EAAE,MAAF,KAAa,QAAb,IAAyB,EAAE,KAAF,CAAQ,UAAR,CAAmB,IAAI,MAAvB,EAA+B,EAAE,IAAjC,CAA7B,EAAqE;AACnE,oBAAE,IAAF,GAAS,OAAT;AACD;AACF;AACF;AACF,WAVD,MAUO;AACL,kBAAM,IAAI,KAAJ,CAAU,4BAAV,CAAN;AACD;AACF;AACD,aAAK,cAAL,CAAoB,CAApB;AACD;;;;;AA3XoC;AAAA;AAAA,uCA+XnB;AAChB,iBAAS,cAAT,CAAyB,KAAzB,EAAgC;AAC9B,cAAI,SAAS,EAAb;AACA,iBAAO,MAAM,MAAN,GAAe,CAAtB,EAAyB;AACvB,iBAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,MAAM,MAA1B,EAAkC,GAAlC,EAAuC;AACrC,kBAAI,cAAc,IAAlB;AACA,mBAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,MAAM,MAA1B,EAAkC,GAAlC,EAAuC;AACrC,oBAAI,EAAE,KAAF,CAAQ,SAAR,CAAkB,MAAM,CAAN,CAAlB,EAA4B,MAAM,CAAN,EAAS,IAArC,CAAJ,EAAgD;;AAE9C,gCAAc,KAAd;AACA;AACD;AACF;AACD,kBAAI,WAAJ,EAAiB;AACf,uBAAO,IAAP,CAAY,MAAM,MAAN,CAAa,CAAb,EAAgB,CAAhB,EAAmB,CAAnB,CAAZ;AACA;AACD;AACF;AACF;AACD,iBAAO,MAAP;AACD;AACD,YAAI,KAAK,QAAL,GAAgB,CAApB,EAAuB,KAAK,QAAL;AACvB,YAAI,KAAK,QAAL,KAAkB,CAAlB,IAAuB,KAAK,OAAL,CAAa,MAAb,GAAsB,CAAjD,EAAoD;AAClD,cAAI,MAAM,EAAV;AACA,cAAI,OAAO,EAAX;AACA,eAAK,OAAL,CAAa,OAAb,CAAqB,UAAU,CAAV,EAAa;AAChC,gBAAI,EAAE,MAAF,KAAa,QAAjB,EAA2B;AACzB,mBAAK,IAAL,CAAU,CAAV;AACD,aAFD,MAEO;AACL,kBAAI,IAAJ,CAAS,CAAT;AACD;AACF,WAND;AAOA,gBAAM,eAAe,GAAf,CAAN;AACA,cAAI,OAAJ,CAAY,KAAK,OAAjB;AACA,eAAK,OAAL,CAAa,KAAK,OAAlB;AACA,eAAK,OAAL,GAAe,EAAf;AACD;AACF;AApaoC;;AAAA;AAAA,IAoCZ,oBApCY;;AAsavC,IAAE,KAAF,CAAQ,YAAR,GAAuB,YAAvB;;;;;;;;;;;;;AAtauC,MAmbjC,UAnbiC,G;;;;;;;AA0brC,sBAAa,GAAb,EAAkB;AAAA;;AAChB,QAAI,IAAI,MAAJ,IAAc,IAAd,IACF,IAAI,QAAJ,IAAgB,IADd,IAEF,IAAI,KAAJ,IAAa,IAFX,IAGF,IAAI,IAAJ,IAAY,IAHd,EAIE;AACA,YAAM,IAAI,KAAJ,CAAU,4CAAV,CAAN;AACD;AACD,SAAK,MAAL,GAAc,IAAI,MAAlB;AACA,SAAK,QAAL,GAAgB,IAAI,QAApB;AACA,SAAK,KAAL,GAAa,IAAI,KAAjB;AACA,SAAK,IAAL,GAAY,IAAI,IAAhB;AACA,QAAI,IAAI,oBAAJ,IAA4B,IAAhC,EAAsC;AACpC,WAAK,oBAAL,GAA4B,IAAI,oBAAhC;AACD;AACD,SAAK,cAAL,GAAsB,CAAC,IAAI,cAAJ,IAAsB,YAAY;AACvD,aAAO,CAAC,IAAD,CAAP;AACD,KAFqB,EAEnB,IAFmB,CAEd,IAFc,CAAtB;AAGA,SAAK,cAAL,CAAoB,cAApB,GAAqC,IAArC;AACD,GA7coC;;AA+cvC,IAAE,KAAF,CAAQ,UAAR,GAAqB,UAArB;;AAEA,IAAE,KAAF,CAAQ,gBAAR,GAA2B,SAAS,gBAAT,CAA2B,CAA3B,EAA8B;AACvD,QAAI,KAAK,IAAT,EAAe;AACb,UAAI,aAAa,EAAE,KAAF,CAAQ,UAAzB,EAAqC,OAAO,CAAC,CAAD,CAAP,CAArC,KACK,IAAI,EAAE,WAAF,KAAkB,KAAlB,IAA2B,EAAE,CAAF,aAAgB,EAAE,KAAF,CAAQ,UAAvD,EAAmE,OAAO,CAAP,CAAnE,KACA,IAAI,aAAa,QAAb,IAAyB,EAAE,cAAF,YAA4B,EAAE,KAAF,CAAQ,UAAjE,EAA6E,OAAO,CAAC,EAAE,cAAH,CAAP;AACnF;AACD,WAAO,KAAP;AACD,GAPD;;;;;;AAaA,WAAS,UAAT,CAAqB,CAArB,EAAwB;AACtB,QAAI,IAAI,EAAR;AACA,SAAK,IAAI,GAAT,IAAgB,CAAhB,EAAmB;AACjB,QAAE,GAAF,IAAS,EAAE,GAAF,CAAT;AACD;AACD,WAAO,CAAP;AACD;AACD,IAAE,KAAF,CAAQ,UAAR,GAAqB,UAArB;;;;;;AAMA,WAAS,aAAT,CAAwB,CAAxB,EAA2B;AACzB,QAAI,WAAW,CAAX,CAAJ;AACA,QAAI,EAAE,OAAF,IAAa,IAAjB,EAAuB;AACrB,QAAE,OAAF,GAAY,EAAE,OAAF,CAAU,GAAV,CAAc,UAAU,CAAV,EAAa;AAAE,eAAO,CAAP;AAAU,OAAvC,CAAZ;AACD;AACD,WAAO,CAAP;AACD;;AAED,IAAE,KAAF,CAAQ,aAAR,GAAwB,aAAxB;;;;;AAKA,WAAS,OAAT,CAAkB,CAAlB,EAAqB,CAArB,EAAwB;AACtB,WAAO,EAAE,CAAF,IAAO,EAAE,CAAF,CAAP,IAAgB,EAAE,CAAF,MAAS,EAAE,CAAF,CAAT,KAAkB,EAAE,CAAF,IAAO,EAAE,CAAF,CAAP,IAAe,QAAO,EAAE,CAAF,CAAP,YAAqB,EAAE,CAAF,CAArB,CAAjC,CAAvB;AACD;AACD,IAAE,KAAF,CAAQ,OAAR,GAAkB,OAAlB;;AAEA,WAAS,eAAT,CAA0B,GAA1B,EAA+B,GAA/B,EAAoC;AAClC,WAAO,IAAI,MAAJ,CAAW,CAAX,MAAkB,IAAI,CAAJ,CAAlB,IAA4B,IAAI,MAAJ,CAAW,CAAX,KAAiB,IAAI,CAAJ,CAA7C,IAAuD,IAAI,CAAJ,IAAS,IAAI,MAAJ,CAAW,CAAX,KAAiB,IAAI,MAAJ,IAAc,CAA/B,CAAvE;AACD;AACD,IAAE,KAAF,CAAQ,eAAR,GAA0B,eAA1B;;AAEA,WAAS,UAAT,CAAqB,GAArB,EAA0B,GAA1B,EAA+B;AAC7B,QAAI,OAAO,IAAP,IAAe,OAAO,IAA1B,EAAgC;AAC9B,aAAO,QAAQ,GAAf;AACD,KAFD,MAEO;AACL,aAAO,IAAI,CAAJ,MAAW,IAAI,CAAJ,CAAX,IAAqB,IAAI,CAAJ,MAAW,IAAI,CAAJ,CAAvC;AACD;AACF;AACD,IAAE,KAAF,CAAQ,UAAR,GAAqB,UAArB;;AAEA,WAAS,SAAT,CAAoB,EAApB,EAAwB,EAAxB,EAA4B;AAC1B,QAAI,MAAM,IAAN,IAAc,MAAM,IAAxB,EAA8B;AAC5B,aAAO,OAAO,EAAd;AACD,KAFD,MAEO;AACL,UAAI,GAAG,CAAH,MAAU,GAAG,EAAH,CAAM,CAAN,CAAd,EAAwB;AACtB,YAAI,GAAG,OAAH,IAAc,IAAlB,EAAwB;AACtB,iBAAO,GAAG,CAAH,MAAU,GAAG,EAAH,CAAM,CAAN,CAAjB;AACD,SAFD,MAEO;AACL,iBAAO,GAAG,CAAH,KAAS,GAAG,EAAH,CAAM,CAAN,CAAT,IAAqB,GAAG,CAAH,IAAQ,GAAG,EAAH,CAAM,CAAN,IAAW,GAAG,OAAH,CAAW,MAA1D;AACD;AACF;AACF;AACF;AACD,IAAE,KAAF,CAAQ,SAAR,GAAoB,SAApB;;AAEA,WAAS,SAAT,CAAoB,EAApB,EAAwB;AACtB,QAAI,GAAG,OAAH,IAAc,IAAd,IAAsB,GAAG,OAAH,CAAW,MAAX,KAAsB,CAAhD,EAAmD;AACjD,aAAO,GAAG,EAAV;AACD,KAFD,MAEO;AACL,aAAO,CAAC,GAAG,EAAH,CAAM,CAAN,CAAD,EAAW,GAAG,EAAH,CAAM,CAAN,IAAW,GAAG,OAAH,CAAW,MAAtB,GAA+B,CAA1C,CAAP;AACD;AACF;AACD,IAAE,KAAF,CAAQ,SAAR,GAAoB,SAApB;;AAEA,WAAS,mBAAT,CAA8B,CAA9B,EAAiC;AAC/B,QAAI,IAAI,IAAI,KAAJ,CAAU,CAAV,CAAR;AACA,SAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,EAAE,MAAtB,EAA8B,GAA9B,EAAmC;AACjC,QAAE,CAAF,IAAO;AACL,YAAI,CAAC,IAAD,EAAO,IAAP;AADC,OAAP;AAGD;AACD,WAAO,CAAP;AACD;;AAED,WAAS,uBAAT,CAAkC,KAAlC,EAAyC;;;;;;;;;;AAAA,QAYjC,iBAZiC;AAAA;;AAarC,iCAAa,IAAb,EAAmB,IAAnB,EAAyB;AAAA;;AAAA,0GAEjB,IAFiB,EAEX,IAFW;;;;AAGvB,eAAK,WAAL,GAAmB,oBAAoB,CAApB,CAAnB;AACA,eAAK,UAAL,GAAkB,oBAAoB,EAApB,CAAlB;AAJuB;AAKxB;;AAlBoC;AAAA;AAAA,qDAmB7B,EAnB6B,EAmBzB,WAnByB;AAAA,cAoB/B,CApB+B,EAoB5B,CApB4B,EAkC/B,CAlC+B;AAAA;AAAA;AAAA;AAAA;AAqB9B,sBAAI,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CArBC;;AAAA;AAAA,wBAqBE,KAAK,CArBP;AAAA;AAAA;AAAA;;AAsBjC,sBAAI,KAAK,UAAL,CAAgB,CAAhB,CAAJ;;;AAtBiC,wBAwB7B,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CAAZ,IAAqB,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CAxBJ;AAAA;AAAA;AAAA;;;;AA2B/B,yBAAO,IAAI,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CAApC,EAAuC,GAAvC,EAA4C;AAC1C,yBAAK,UAAL,CAAgB,CAAhB,IAAqB,KAAK,UAAL,CAAgB,IAAI,CAApB,CAArB;AACD;AACD,uBAAK,UAAL,CAAgB,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CAAzC,IAA8C,CAA9C;AA9B+B,oDA+BxB,CA/BwB;;AAAA;AAqBU,qBArBV;AAAA;AAAA;;AAAA;AAmC9B,sBAAI,KAAK,WAAL,CAAiB,MAAjB,GAA0B,CAnCA;;AAAA;AAAA,wBAmCG,KAAK,CAnCR;AAAA;AAAA;AAAA;;AAoCjC,sBAAI,KAAK,WAAL,CAAiB,CAAjB,CAAJ;;AApCiC,wBAqC7B,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CAAZ,IAAqB,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CArCJ;AAAA;AAAA;AAAA;;AAsC/B,sBAAI,CAAJ;AAtC+B;;AAAA;AAmCW,qBAnCX;AAAA;AAAA;;AAAA;AAAA,wBA0C/B,IAAI,CAAJ,IAAS,gBAAgB,SA1CM;AAAA;AAAA;AAAA;;AAAA,mIA6CX,EA7CW;;AAAA;AA6CjC,mBA7CiC;;AAAA;AA+CnC,sBAAI,KAAK,IAAT,EAAe;AACb,yBAAK,IAAI,CAAT,EAAY,IAAI,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CAAzC,EAA4C,GAA5C,EAAiD;AAC/C,2BAAK,UAAL,CAAgB,CAAhB,IAAqB,KAAK,UAAL,CAAgB,IAAI,CAApB,CAArB;AACD;AACD,yBAAK,UAAL,CAAgB,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CAAzC,IAA8C,CAA9C;AACD;AApDkC,oDAqD5B,CArD4B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,oDAuD9B,CAvD8B;AAAA,cAwD/B,EAxD+B,EAyD/B,CAzD+B,EAyD5B,CAzD4B,EAyE7B,KAzE6B;AAAA;AAAA;AAAA;AAAA;AAwD/B,oBAxD+B,GAwD1B,EAAE,EAxDwB;AA0D9B,sBAAI,KAAK,WAAL,CAAiB,MAAjB,GAA0B,CA1DA;;AAAA;AAAA,wBA0DG,KAAK,CA1DR;AAAA;AAAA;AAAA;;AA2DjC,sBAAI,KAAK,WAAL,CAAiB,CAAjB,CAAJ;;AA3DiC,wBA4D7B,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CAAZ,IAAqB,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CA5DJ;AAAA;AAAA;AAAA;;;;AA+D/B,yBAAO,IAAI,KAAK,WAAL,CAAiB,MAAjB,GAA0B,CAArC,EAAwC,GAAxC,EAA6C;AAC3C,yBAAK,WAAL,CAAiB,CAAjB,IAAsB,KAAK,WAAL,CAAiB,IAAI,CAArB,CAAtB;AACD;AACD,uBAAK,WAAL,CAAiB,KAAK,WAAL,CAAiB,MAAjB,GAA0B,CAA3C,IAAgD,CAAhD;AAlE+B;;AAAA;AA0DW,qBA1DX;AAAA;AAAA;;AAAA;AAAA,wBAsE/B,IAAI,CAtE2B;AAAA;AAAA;AAAA;;;;AAyE7B,uBAzE6B,GAyErB,KAAK,WAAL,CAAiB,CAAjB,CAzEqB;;AAAA,wBA0E7B,MAAM,EAAN,CAAS,CAAT,MAAgB,IA1Ea;AAAA;AAAA;AAAA;;AAAA,kIA2Ed,KA3Ec;;AAAA;;AA8EjC,uBAAK,IAAI,CAAT,EAAY,IAAI,KAAK,WAAL,CAAiB,MAAjB,GAA0B,CAA1C,EAA6C,GAA7C,EAAkD;AAChD,yBAAK,WAAL,CAAiB,CAAjB,IAAsB,KAAK,WAAL,CAAiB,IAAI,CAArB,CAAtB;AACD;AACD,uBAAK,WAAL,CAAiB,KAAK,WAAL,CAAiB,MAAjB,GAA0B,CAA3C,IAAgD,CAAhD;;AAjFiC;;;AAqFnC,uBAAK,IAAI,CAAT,EAAY,IAAI,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CAAzC,EAA4C,GAA5C,EAAiD;AAC/C,wBAAI,KAAK,UAAL,CAAgB,IAAI,CAApB,CAAJ;AACA,wBAAI,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CAAZ,IAAqB,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CAArC,EAA4C;AAC1C,2BAAK,UAAL,CAAgB,CAAhB,IAAqB,CAArB;AACD,qBAFD,MAEO;AACL,2BAAK,UAAL,CAAgB,CAAhB,IAAqB,CAArB;AACD;AACF;AACD,uBAAK,UAAL,CAAgB,KAAK,UAAL,CAAgB,MAAhB,GAAyB,CAAzC,IAA8C,CAA9C;;AA7FmC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,wDA+F3B,EA/F2B;AAAA,cAgG/B,CAhG+B,EAgG5B,CAhG4B;AAAA;AAAA;AAAA;AAAA;AAiGnC,uBAAK,IAAI,CAAT,EAAY,IAAI,KAAK,UAAL,CAAgB,MAAhC,EAAwC,GAAxC,EAA6C;AAC3C,wBAAI,KAAK,UAAL,CAAgB,CAAhB,CAAJ;AACA,wBAAI,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CAAZ,IAAqB,EAAE,EAAF,CAAK,CAAL,MAAY,GAAG,CAAH,CAArC,EAA4C;AAC1C,2BAAK,UAAL,CAAgB,CAAhB,IAAqB;AACnB,4BAAI,CAAC,IAAD,EAAO,IAAP;AADe,uBAArB;AAGD;AACF;AAxGkC,iDAyG5B,KAAK,KAAL,EAzG4B;;AAAA;AAAA,qIA0Gf,EA1Ge;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mEA4Gf,EA5Ge;AAAA,cA6G/B,CA7G+B;cAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iDA6GpB,KAAK,IAAL,CAAU,EAAV,EAAc,IAAd,CA7GoB;;AAAA;AA6G/B,mBA7G+B;;AAAA,wBA8G/B,KAAK,IA9G0B;AAAA;AAAA;AAAA;;AAAA,oDA+G1B,CA/G0B;;AAAA;AAAA,iDAiH1B,KAAK,KAAL,EAjH0B;;AAAA;AAAA,iDAkHnB,qFAAyB,KAAzB,CAA+B,IAA/B,SAlHmB;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,mEAqHf,EArHe;AAAA,cAsH/B,CAtH+B;cAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iDAsHpB,KAAK,IAAL,CAAU,EAAV,EAAc,IAAd,CAtHoB;;AAAA;AAsH/B,mBAtH+B;;AAAA,wBAuH/B,KAAK,IAvH0B;AAAA;AAAA;AAAA;;AAAA,oDAwH1B,CAxH0B;;AAAA;AAAA,iDA0H1B,KAAK,KAAL,EA1H0B;;AAAA;AAAA,iDA2HnB,qFAAyB,KAAzB,CAA+B,IAA/B,SA3HmB;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iDA+H5B,KAAK,KAAL,EA/H4B;;AAAA;AAAA,iDAgIrB,2EAAe,KAAf,CAAqB,IAArB,SAhIqB;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iDAmI5B,KAAK,KAAL,EAnI4B;;AAAA;AAAA,iDAoIrB,2EAAe,KAAf,CAAqB,IAArB,SApIqB;;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,iDAuI5B,KAAK,KAAL,EAvI4B;;AAAA;AAAA,iDAwI5B,0EAAc,KAAd,CAAoB,IAApB,SAxI4B;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,cA2I1B,CA3I0B,EA4I7B,KA5I6B;AAAA;AAAA;AAAA;AAAA;AA2I1B,mBA3I0B,GA2ItB,CA3IsB;;AAAA;AAAA,wBA2InB,IAAI,KAAK,WAAL,CAAiB,MA3IF;AAAA;AAAA;AAAA;;AA4I7B,uBA5I6B,GA4IrB,KAAK,WAAL,CAAiB,CAAjB,CA5IqB;;AAAA,wBA6I7B,MAAM,EAAN,CAAS,CAAT,MAAgB,IA7Ia;AAAA;AAAA;AAAA;;AAAA,mIA8Id,KA9Ic;;AAAA;AA+I/B,uBAAK,WAAL,CAAiB,CAAjB,IAAsB;AACpB,wBAAI,CAAC,IAAD,EAAO,IAAP;AADgB,mBAAtB;;AA/I+B;AA2IU,qBA3IV;AAAA;AAAA;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;;AAAA;AAAA,MAYP,KAZO;;AAsJvC,WAAO,iBAAP;AACD;AACD,IAAE,KAAF,CAAQ,uBAAR,GAAkC,uBAAlC;AACD,CAtsBD;;;;ACxBA;;;;;;AAEA,QAAQ,gBAAR,EAA0B,CAA1B;AACA,QAAQ,eAAR,EAAyB,CAAzB;AACA,QAAQ,kBAAR,EAA4B,CAA5B;AACA,QAAQ,aAAR,EAAuB,CAAvB;AACA,QAAQ,YAAR,EAAsB,CAAtB;AACA,QAAQ,sBAAR,EAAgC,CAAhC;;AAEA,IAAI,mBAAmB,EAAvB;;AAEA,OAAO,OAAP,GAAiB,CAAjB;AACA,EAAE,gBAAF,GAAqB,gBAArB;;AAEA,EAAE,MAAF,GAAW,UAAU,IAAV,EAAgB,KAAhB,EAAuB;AAChC,MAAI,iBAAiB,EAAE,KAAF,CAAQ,UAA7B,EAAyC;AACvC,MAAE,IAAF,IAAU,MAAM,cAAhB;AACD,GAFD,MAEO;AACL,MAAE,IAAF,IAAU,KAAV;AACD;AACD,MAAI,iBAAiB,IAAjB,KAA0B,IAA9B,EAAoC;AAClC,qBAAiB,IAAjB,EAAuB,OAAvB;AACA,WAAO,iBAAiB,IAAjB,CAAP;AACD;AACF,CAVD;;AAYA,EAAE,cAAF,GAAmB,cAAnB;AACA,SAAS,cAAT,CAAyB,OAAzB,EAAkC;;;;AAIhC,MAAI,YAAY,OAAO,kBAAP,KAA8B,WAA9B,GAA4C,KAA5C,GAAoD,MAApE;AACA,MAAI,WAAW,EAAf;AACA,OAAK,IAAI,IAAI,CAAb,EAAgB,IAAI,QAAQ,MAA5B,EAAoC,GAApC,EAAyC;AACvC,QAAI,SAAS,QAAQ,CAAR,EAAW,KAAX,CAAiB,GAAjB,EAAsB,CAAtB,CAAb;AACA,QAAI,aAAa,OAAO,OAAO,WAAP,EAAxB;AACA,QAAI,EAAE,MAAF,KAAa,IAAjB,EAAuB;AACrB,UAAI,iBAAiB,MAAjB,KAA4B,IAAhC,EAAsC;;AAEpC,YAAI,OAAO,MAAP,KAAkB,WAAlB,IAAiC,OAAO,CAAP,KAAa,WAAlD,EAA+D;AAAA,cACzD,QADyD;;AAAA;AACzD,uBAAW,SAAS,aAAT,CAAuB,QAAvB,CAD8C;;AAE7D,qBAAS,GAAT,GAAe,EAAE,SAAF,GAAc,GAAd,GAAoB,UAApB,GAAiC,GAAjC,GAAuC,UAAvC,GAAoD,SAAnE;AACA,qBAAS,IAAT,CAAc,WAAd,CAA0B,QAA1B;;AAEA,gBAAI,gBAAgB,EAApB;AACA,6BAAiB,MAAjB,IAA2B,aAA3B;AACA,0BAAc,OAAd,GAAwB,IAAI,OAAJ,CAAY,UAAU,OAAV,EAAmB;AACrD,4BAAc,OAAd,GAAwB,OAAxB;AACD,aAFuB,CAAxB;AAGA,qBAAS,IAAT,CAAc,cAAc,OAA5B;AAV6D;AAW9D,SAXD,MAWO;AACL,kBAAQ,IAAR,CAAa,+HAAb;AACA,kBAAQ,UAAR,EAAoB,CAApB;AACD;AACF,OAjBD,MAiBO;AACL,iBAAS,IAAT,CAAc,iBAAiB,QAAQ,CAAR,CAAjB,EAA6B,OAA3C;AACD;AACF;AACF;AACD,SAAO,QAAQ,GAAR,CAAY,QAAZ,CAAP;AACD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BD,SAAS,CAAT,CAAY,I,gBAAZ,E,uBAAyD;AACvD,OAAK,KAAL,GAAa,KAAK,KAAL,IAAc,IAAd,GAAqB,KAAK,KAA1B,GAAkC,EAA/C;AACA,MAAI,UAAU,CAAC,KAAK,EAAL,CAAQ,IAAT,EAAe,KAAK,SAAL,CAAe,IAA9B,EAAoC,MAApC,CAA2C,KAAK,KAAhD,CAAd;AACA,OAAK,IAAI,IAAT,IAAiB,KAAK,KAAtB,EAA6B;AAC3B,YAAQ,IAAR,CAAa,KAAK,KAAL,CAAW,IAAX,CAAb;AACD;AACD,IAAE,SAAF,GAAc,KAAK,SAAnB;AACA,SAAO,IAAI,OAAJ,CAAY,UAAU,OAAV,EAAmB,MAAnB,EAA2B;AAC5C,eAAW,YAAY;AACrB,QAAE,cAAF,CAAiB,OAAjB,EAA0B,IAA1B,CAA+B,YAAY;AACzC,YAAI,QAAQ,IAAZ,EAAkB,OAAO,iCAAP,EAAlB,KACK,IAAI,KAAK,SAAL,IAAkB,IAAtB,EAA4B,OAAO,4DAAP,EAA5B,KACA,IAAI,KAAK,SAAL,CAAe,IAAf,IAAuB,IAA3B,EAAiC,OAAO,oEAAP,EAAjC,KACA,IAAI,KAAK,EAAL,IAAW,IAAf,EAAqB,OAAO,oDAAP,EAArB,KACA,IAAI,KAAK,SAAL,CAAe,IAAf,IAAuB,IAA3B,EAAiC,OAAO,sDAAP,EAAjC,KACA,IAAI,KAAK,KAAL,IAAc,IAAlB,EAAwB,OAAO,yCAAP,EAAxB,KACA;AACH,cAAI,UAAU,IAAI,OAAJ,CAAY,IAAZ,CAAd;AACA,kBAAQ,EAAR,CAAW,aAAX,CAAyB,YAAY;AACnC,oBAAQ,IAAR,CAAa,YAAY;AACvB,sBAAQ,OAAR;AACD,aAFD;AAGD,WAJD;AAKD;AACF,OAfD,EAeG,KAfH,CAeS,MAfT;AAgBD,KAjBD,EAiBG,CAjBH;AAkBD,GAnBM,CAAP;AAoBD;;IAEK,O;;;;;;;;AAOJ,mBAAa,IAAb,EAAmB,QAAnB,EAA6B;AAAA;;AAC3B,SAAK,OAAL,GAAe,IAAf;AACA,SAAK,EAAL,GAAU,IAAI,EAAE,KAAK,EAAL,CAAQ,IAAV,CAAJ,CAAoB,IAApB,EAA0B,KAAK,EAA/B,CAAV;AACA,SAAK,SAAL,GAAiB,IAAI,EAAE,KAAK,SAAL,CAAe,IAAjB,CAAJ,CAA2B,IAA3B,EAAiC,KAAK,SAAtC,CAAjB;AACD;;;;yBACK,Q,EAAU;AACd,UAAI,OAAO,KAAK,OAAhB;AACA,UAAI,QAAQ,EAAZ;AACA,WAAK,KAAL,GAAa,KAAb;AACA,WAAK,EAAL,CAAQ,kBAAR,yBAA2B,SAAW,kBAAX;AAAA,YAEhB,YAFgB,EAGnB,eAHmB,EAInB,QAJmB,EAKnB,IALmB,EAanB,IAbmB,EAcnB,OAdmB,EAenB,EAfmB;AAAA;AAAA;AAAA;AAAA;AAAA,sDAEA,KAAK,KAFL;;AAAA;AAAA;AAAA;AAAA;AAAA;;AAEhB,4BAFgB;AAGnB,+BAHmB,GAGD,KAAK,KAAL,CAAW,YAAX,EAAyB,KAAzB,CAA+B,GAA/B,CAHC;AAInB,wBAJmB,GAIR,gBAAgB,MAAhB,CAAuB,CAAvB,EAA0B,CAA1B,CAJQ;AAKnB,oBALmB,GAKZ,EALY;;AAAA,sBAMnB,gBAAgB,MAAhB,KAA2B,CANR;AAAA;AAAA;AAAA;;AAAA;;AAQnB,uBAAO,KAAK,KAAL,CAAW,MAAM,gBAAgB,CAAhB,EAAmB,KAAnB,CAAyB,GAAzB,EAA8B,CAA9B,CAAN,GAAyC,GAApD,CAAP;AARmB;AAAA;;AAAA;AAAA;AAAA;AAAA,sBAUb,IAAI,KAAJ,CAAU,mDAAmD,YAAnD,GAAkE,GAA5E,CAVa;;AAAA;AAanB,oBAbmB,GAaZ,EAAE,QAAF,CAbY;AAcnB,uBAdmB,GAcT,KAAK,cAdI;AAenB,kBAfmB,GAed,CAAC,GAAD,EAAM,QAAQ,MAAR,GAAiB,GAAjB,GAAuB,QAAvB,GAAkC,GAAlC,GAAwC,YAAxC,GAAuD,GAAvD,GAA6D,eAAnE,CAfc;AAAA,8CAgBM,KAAK,UAAL,CAAgB,KAAK,KAAL,CAAW,OAAX,EAAoB,IAApB,CAAhB,EAA2C,EAA3C,CAhBN;;AAAA;AAgBvB,sBAAM,YAAN,CAhBuB;AAAA;AAAA;;AAAA;AAkBzB,qBAAK,KAAL,CAAW,wBAAX,GACG,IADH,CACQ,QADR;;AAlByB;AAAA;AAAA;AAAA;AAAA;AAAA,WAAW,kBAAX;AAAA,OAA3B;AAqBD;;;kCACc;AACb,aAAO,KAAK,SAAL,CAAe,QAAtB;AACD;;;iCACa;AACZ,aAAO,KAAK,SAAL,CAAe,UAAf,EAAP;AACD;;;gCACY;AACX,aAAO,KAAK,SAAL,CAAe,SAAf,EAAP;AACD;;;8BACU;AACT,UAAI,KAAK,SAAL,CAAe,OAAf,IAA0B,IAA9B,EAAoC;AAClC,aAAK,SAAL,CAAe,OAAf;AACD,OAFD,MAEO;AACL,aAAK,SAAL,CAAe,UAAf;AACD;AACD,UAAI,OAAO,IAAX;AACA,WAAK,EAAL,CAAQ,kBAAR,yBAA2B;AAAA;AAAA;AAAA;AAAA;AAAA,+CAClB,KAAK,EAAL,CAAQ,OAAR,EADkB;;AAAA;AAEzB,qBAAK,SAAL,GAAiB,IAAjB;AACA,qBAAK,EAAL,GAAU,IAAV;;AAHyB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,OAA3B;AAKD;;;;;;AAGH,IAAI,OAAO,MAAP,KAAkB,WAAtB,EAAmC;AACjC,SAAO,CAAP,GAAW,CAAX;AACD","file":"y.js","sourceRoot":"/source/","sourcesContent":["(function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require==\"function\"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error(\"Cannot find module '\"+o+\"'\");throw f.code=\"MODULE_NOT_FOUND\",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require==\"function\"&&require;for(var o=0;o 1) {\n for (var i = 1; i < arguments.length; i++) {\n args[i - 1] = arguments[i];\n }\n }\n queue.push(new Item(fun, args));\n if (queue.length === 1 && !draining) {\n setTimeout(drainQueue, 0);\n }\n};\n\n// v8 likes predictible objects\nfunction Item(fun, array) {\n this.fun = fun;\n this.array = array;\n}\nItem.prototype.run = function () {\n this.fun.apply(null, this.array);\n};\nprocess.title = 'browser';\nprocess.browser = true;\nprocess.env = {};\nprocess.argv = [];\nprocess.version = ''; // empty string to avoid regexp issues\nprocess.versions = {};\n\nfunction noop() {}\n\nprocess.on = noop;\nprocess.addListener = noop;\nprocess.once = noop;\nprocess.off = noop;\nprocess.removeListener = noop;\nprocess.removeAllListeners = noop;\nprocess.emit = noop;\n\nprocess.binding = function (name) {\n throw new Error('process.binding is not supported');\n};\n\nprocess.cwd = function () { return '/' };\nprocess.chdir = function (dir) {\n throw new Error('process.chdir is not supported');\n};\nprocess.umask = function() { return 0; };\n","/**\n * Copyright (c) 2014, Facebook, Inc.\n * All rights reserved.\n *\n * This source code is licensed under the BSD-style license found in the\n * https://raw.github.com/facebook/regenerator/master/LICENSE file. An\n * additional grant of patent rights can be found in the PATENTS file in\n * the same directory.\n */\n\n!(function(global) {\n \"use strict\";\n\n var hasOwn = Object.prototype.hasOwnProperty;\n var undefined; // More compressible than void 0.\n var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n var inModule = typeof module === \"object\";\n var runtime = global.regeneratorRuntime;\n if (runtime) {\n if (inModule) {\n // If regeneratorRuntime is defined globally and we're in a module,\n // make the exports object identical to regeneratorRuntime.\n module.exports = runtime;\n }\n // Don't bother evaluating the rest of this file if the runtime was\n // already defined globally.\n return;\n }\n\n // Define the runtime globally (as expected by generated code) as either\n // module.exports (if we're in a module) or a new, empty object.\n runtime = global.regeneratorRuntime = inModule ? module.exports : {};\n\n function wrap(innerFn, outerFn, self, tryLocsList) {\n // If outerFn provided, then outerFn.prototype instanceof Generator.\n var generator = Object.create((outerFn || Generator).prototype);\n var context = new Context(tryLocsList || []);\n\n // The ._invoke method unifies the implementations of the .next,\n // .throw, and .return methods.\n generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n return generator;\n }\n runtime.wrap = wrap;\n\n // Try/catch helper to minimize deoptimizations. Returns a completion\n // record like context.tryEntries[i].completion. This interface could\n // have been (and was previously) designed to take a closure to be\n // invoked without arguments, but in all the cases we care about we\n // already have an existing method we want to call, so there's no need\n // to create a new function object. We can even get away with assuming\n // the method takes exactly one argument, since that happens to be true\n // in every case, so we don't have to touch the arguments object. The\n // only additional allocation required is the completion record, which\n // has a stable shape and so hopefully should be cheap to allocate.\n function tryCatch(fn, obj, arg) {\n try {\n return { type: \"normal\", arg: fn.call(obj, arg) };\n } catch (err) {\n return { type: \"throw\", arg: err };\n }\n }\n\n var GenStateSuspendedStart = \"suspendedStart\";\n var GenStateSuspendedYield = \"suspendedYield\";\n var GenStateExecuting = \"executing\";\n var GenStateCompleted = \"completed\";\n\n // Returning this object from the innerFn has the same effect as\n // breaking out of the dispatch switch statement.\n var ContinueSentinel = {};\n\n // Dummy constructor functions that we use as the .constructor and\n // .constructor.prototype properties for functions that return Generator\n // objects. For full spec compliance, you may wish to configure your\n // minifier not to mangle the names of these two functions.\n function Generator() {}\n function GeneratorFunction() {}\n function GeneratorFunctionPrototype() {}\n\n var Gp = GeneratorFunctionPrototype.prototype = Generator.prototype;\n GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n GeneratorFunctionPrototype.constructor = GeneratorFunction;\n GeneratorFunctionPrototype[toStringTagSymbol] = GeneratorFunction.displayName = \"GeneratorFunction\";\n\n // Helper for defining the .next, .throw, and .return methods of the\n // Iterator interface in terms of a single ._invoke method.\n function defineIteratorMethods(prototype) {\n [\"next\", \"throw\", \"return\"].forEach(function(method) {\n prototype[method] = function(arg) {\n return this._invoke(method, arg);\n };\n });\n }\n\n runtime.isGeneratorFunction = function(genFun) {\n var ctor = typeof genFun === \"function\" && genFun.constructor;\n return ctor\n ? ctor === GeneratorFunction ||\n // For the native GeneratorFunction constructor, the best we can\n // do is to check its .name property.\n (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n : false;\n };\n\n runtime.mark = function(genFun) {\n if (Object.setPrototypeOf) {\n Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n } else {\n genFun.__proto__ = GeneratorFunctionPrototype;\n if (!(toStringTagSymbol in genFun)) {\n genFun[toStringTagSymbol] = \"GeneratorFunction\";\n }\n }\n genFun.prototype = Object.create(Gp);\n return genFun;\n };\n\n // Within the body of any async function, `await x` is transformed to\n // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n // `value instanceof AwaitArgument` to determine if the yielded value is\n // meant to be awaited. Some may consider the name of this method too\n // cutesy, but they are curmudgeons.\n runtime.awrap = function(arg) {\n return new AwaitArgument(arg);\n };\n\n function AwaitArgument(arg) {\n this.arg = arg;\n }\n\n function AsyncIterator(generator) {\n function invoke(method, arg, resolve, reject) {\n var record = tryCatch(generator[method], generator, arg);\n if (record.type === \"throw\") {\n reject(record.arg);\n } else {\n var result = record.arg;\n var value = result.value;\n if (value instanceof AwaitArgument) {\n return Promise.resolve(value.arg).then(function(value) {\n invoke(\"next\", value, resolve, reject);\n }, function(err) {\n invoke(\"throw\", err, resolve, reject);\n });\n }\n\n return Promise.resolve(value).then(function(unwrapped) {\n // When a yielded Promise is resolved, its final value becomes\n // the .value of the Promise<{value,done}> result for the\n // current iteration. If the Promise is rejected, however, the\n // result for this iteration will be rejected with the same\n // reason. Note that rejections of yielded Promises are not\n // thrown back into the generator function, as is the case\n // when an awaited Promise is rejected. This difference in\n // behavior between yield and await is important, because it\n // allows the consumer to decide what to do with the yielded\n // rejection (swallow it and continue, manually .throw it back\n // into the generator, abandon iteration, whatever). With\n // await, by contrast, there is no opportunity to examine the\n // rejection reason outside the generator function, so the\n // only option is to throw it from the await expression, and\n // let the generator function handle the exception.\n result.value = unwrapped;\n resolve(result);\n }, reject);\n }\n }\n\n if (typeof process === \"object\" && process.domain) {\n invoke = process.domain.bind(invoke);\n }\n\n var previousPromise;\n\n function enqueue(method, arg) {\n function callInvokeWithMethodAndArg() {\n return new Promise(function(resolve, reject) {\n invoke(method, arg, resolve, reject);\n });\n }\n\n return previousPromise =\n // If enqueue has been called before, then we want to wait until\n // all previous Promises have been resolved before calling invoke,\n // so that results are always delivered in the correct order. If\n // enqueue has not been called before, then it is important to\n // call invoke immediately, without waiting on a callback to fire,\n // so that the async generator function has the opportunity to do\n // any necessary setup in a predictable way. This predictability\n // is why the Promise constructor synchronously invokes its\n // executor callback, and why async functions synchronously\n // execute code before the first await. Since we implement simple\n // async functions in terms of async generators, it is especially\n // important to get this right, even though it requires care.\n previousPromise ? previousPromise.then(\n callInvokeWithMethodAndArg,\n // Avoid propagating failures to Promises returned by later\n // invocations of the iterator.\n callInvokeWithMethodAndArg\n ) : callInvokeWithMethodAndArg();\n }\n\n // Define the unified helper method that is used to implement .next,\n // .throw, and .return (see defineIteratorMethods).\n this._invoke = enqueue;\n }\n\n defineIteratorMethods(AsyncIterator.prototype);\n\n // Note that simple async functions are implemented on top of\n // AsyncIterator objects; they just return a Promise for the value of\n // the final result produced by the iterator.\n runtime.async = function(innerFn, outerFn, self, tryLocsList) {\n var iter = new AsyncIterator(\n wrap(innerFn, outerFn, self, tryLocsList)\n );\n\n return runtime.isGeneratorFunction(outerFn)\n ? iter // If outerFn is a generator, return the full iterator.\n : iter.next().then(function(result) {\n return result.done ? result.value : iter.next();\n });\n };\n\n function makeInvokeMethod(innerFn, self, context) {\n var state = GenStateSuspendedStart;\n\n return function invoke(method, arg) {\n if (state === GenStateExecuting) {\n throw new Error(\"Generator is already running\");\n }\n\n if (state === GenStateCompleted) {\n if (method === \"throw\") {\n throw arg;\n }\n\n // Be forgiving, per 25.3.3.3.3 of the spec:\n // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n return doneResult();\n }\n\n while (true) {\n var delegate = context.delegate;\n if (delegate) {\n if (method === \"return\" ||\n (method === \"throw\" && delegate.iterator[method] === undefined)) {\n // A return or throw (when the delegate iterator has no throw\n // method) always terminates the yield* loop.\n context.delegate = null;\n\n // If the delegate iterator has a return method, give it a\n // chance to clean up.\n var returnMethod = delegate.iterator[\"return\"];\n if (returnMethod) {\n var record = tryCatch(returnMethod, delegate.iterator, arg);\n if (record.type === \"throw\") {\n // If the return method threw an exception, let that\n // exception prevail over the original return or throw.\n method = \"throw\";\n arg = record.arg;\n continue;\n }\n }\n\n if (method === \"return\") {\n // Continue with the outer return, now that the delegate\n // iterator has been terminated.\n continue;\n }\n }\n\n var record = tryCatch(\n delegate.iterator[method],\n delegate.iterator,\n arg\n );\n\n if (record.type === \"throw\") {\n context.delegate = null;\n\n // Like returning generator.throw(uncaught), but without the\n // overhead of an extra function call.\n method = \"throw\";\n arg = record.arg;\n continue;\n }\n\n // Delegate generator ran and handled its own exceptions so\n // regardless of what the method was, we continue as if it is\n // \"next\" with an undefined arg.\n method = \"next\";\n arg = undefined;\n\n var info = record.arg;\n if (info.done) {\n context[delegate.resultName] = info.value;\n context.next = delegate.nextLoc;\n } else {\n state = GenStateSuspendedYield;\n return info;\n }\n\n context.delegate = null;\n }\n\n if (method === \"next\") {\n // Setting context._sent for legacy support of Babel's\n // function.sent implementation.\n context.sent = context._sent = arg;\n\n } else if (method === \"throw\") {\n if (state === GenStateSuspendedStart) {\n state = GenStateCompleted;\n throw arg;\n }\n\n if (context.dispatchException(arg)) {\n // If the dispatched exception was caught by a catch block,\n // then let that catch block handle the exception normally.\n method = \"next\";\n arg = undefined;\n }\n\n } else if (method === \"return\") {\n context.abrupt(\"return\", arg);\n }\n\n state = GenStateExecuting;\n\n var record = tryCatch(innerFn, self, context);\n if (record.type === \"normal\") {\n // If an exception is thrown from innerFn, we leave state ===\n // GenStateExecuting and loop back for another invocation.\n state = context.done\n ? GenStateCompleted\n : GenStateSuspendedYield;\n\n var info = {\n value: record.arg,\n done: context.done\n };\n\n if (record.arg === ContinueSentinel) {\n if (context.delegate && method === \"next\") {\n // Deliberately forget the last sent value so that we don't\n // accidentally pass it on to the delegate.\n arg = undefined;\n }\n } else {\n return info;\n }\n\n } else if (record.type === \"throw\") {\n state = GenStateCompleted;\n // Dispatch the exception by looping back around to the\n // context.dispatchException(arg) call above.\n method = \"throw\";\n arg = record.arg;\n }\n }\n };\n }\n\n // Define Generator.prototype.{next,throw,return} in terms of the\n // unified ._invoke helper method.\n defineIteratorMethods(Gp);\n\n Gp[iteratorSymbol] = function() {\n return this;\n };\n\n Gp[toStringTagSymbol] = \"Generator\";\n\n Gp.toString = function() {\n return \"[object Generator]\";\n };\n\n function pushTryEntry(locs) {\n var entry = { tryLoc: locs[0] };\n\n if (1 in locs) {\n entry.catchLoc = locs[1];\n }\n\n if (2 in locs) {\n entry.finallyLoc = locs[2];\n entry.afterLoc = locs[3];\n }\n\n this.tryEntries.push(entry);\n }\n\n function resetTryEntry(entry) {\n var record = entry.completion || {};\n record.type = \"normal\";\n delete record.arg;\n entry.completion = record;\n }\n\n function Context(tryLocsList) {\n // The root entry object (effectively a try statement without a catch\n // or a finally block) gives us a place to store values thrown from\n // locations where there is no enclosing try statement.\n this.tryEntries = [{ tryLoc: \"root\" }];\n tryLocsList.forEach(pushTryEntry, this);\n this.reset(true);\n }\n\n runtime.keys = function(object) {\n var keys = [];\n for (var key in object) {\n keys.push(key);\n }\n keys.reverse();\n\n // Rather than returning an object with a next method, we keep\n // things simple and return the next function itself.\n return function next() {\n while (keys.length) {\n var key = keys.pop();\n if (key in object) {\n next.value = key;\n next.done = false;\n return next;\n }\n }\n\n // To avoid creating an additional object, we just hang the .value\n // and .done properties off the next function object itself. This\n // also ensures that the minifier will not anonymize the function.\n next.done = true;\n return next;\n };\n };\n\n function values(iterable) {\n if (iterable) {\n var iteratorMethod = iterable[iteratorSymbol];\n if (iteratorMethod) {\n return iteratorMethod.call(iterable);\n }\n\n if (typeof iterable.next === \"function\") {\n return iterable;\n }\n\n if (!isNaN(iterable.length)) {\n var i = -1, next = function next() {\n while (++i < iterable.length) {\n if (hasOwn.call(iterable, i)) {\n next.value = iterable[i];\n next.done = false;\n return next;\n }\n }\n\n next.value = undefined;\n next.done = true;\n\n return next;\n };\n\n return next.next = next;\n }\n }\n\n // Return an iterator with no values.\n return { next: doneResult };\n }\n runtime.values = values;\n\n function doneResult() {\n return { value: undefined, done: true };\n }\n\n Context.prototype = {\n constructor: Context,\n\n reset: function(skipTempReset) {\n this.prev = 0;\n this.next = 0;\n // Resetting context._sent for legacy support of Babel's\n // function.sent implementation.\n this.sent = this._sent = undefined;\n this.done = false;\n this.delegate = null;\n\n this.tryEntries.forEach(resetTryEntry);\n\n if (!skipTempReset) {\n for (var name in this) {\n // Not sure about the optimal order of these conditions:\n if (name.charAt(0) === \"t\" &&\n hasOwn.call(this, name) &&\n !isNaN(+name.slice(1))) {\n this[name] = undefined;\n }\n }\n }\n },\n\n stop: function() {\n this.done = true;\n\n var rootEntry = this.tryEntries[0];\n var rootRecord = rootEntry.completion;\n if (rootRecord.type === \"throw\") {\n throw rootRecord.arg;\n }\n\n return this.rval;\n },\n\n dispatchException: function(exception) {\n if (this.done) {\n throw exception;\n }\n\n var context = this;\n function handle(loc, caught) {\n record.type = \"throw\";\n record.arg = exception;\n context.next = loc;\n return !!caught;\n }\n\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n var record = entry.completion;\n\n if (entry.tryLoc === \"root\") {\n // Exception thrown outside of any try block that could handle\n // it, so set the completion value of the entire function to\n // throw the exception.\n return handle(\"end\");\n }\n\n if (entry.tryLoc <= this.prev) {\n var hasCatch = hasOwn.call(entry, \"catchLoc\");\n var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n if (hasCatch && hasFinally) {\n if (this.prev < entry.catchLoc) {\n return handle(entry.catchLoc, true);\n } else if (this.prev < entry.finallyLoc) {\n return handle(entry.finallyLoc);\n }\n\n } else if (hasCatch) {\n if (this.prev < entry.catchLoc) {\n return handle(entry.catchLoc, true);\n }\n\n } else if (hasFinally) {\n if (this.prev < entry.finallyLoc) {\n return handle(entry.finallyLoc);\n }\n\n } else {\n throw new Error(\"try statement without catch or finally\");\n }\n }\n }\n },\n\n abrupt: function(type, arg) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.tryLoc <= this.prev &&\n hasOwn.call(entry, \"finallyLoc\") &&\n this.prev < entry.finallyLoc) {\n var finallyEntry = entry;\n break;\n }\n }\n\n if (finallyEntry &&\n (type === \"break\" ||\n type === \"continue\") &&\n finallyEntry.tryLoc <= arg &&\n arg <= finallyEntry.finallyLoc) {\n // Ignore the finally entry if control is not jumping to a\n // location outside the try/catch block.\n finallyEntry = null;\n }\n\n var record = finallyEntry ? finallyEntry.completion : {};\n record.type = type;\n record.arg = arg;\n\n if (finallyEntry) {\n this.next = finallyEntry.finallyLoc;\n } else {\n this.complete(record);\n }\n\n return ContinueSentinel;\n },\n\n complete: function(record, afterLoc) {\n if (record.type === \"throw\") {\n throw record.arg;\n }\n\n if (record.type === \"break\" ||\n record.type === \"continue\") {\n this.next = record.arg;\n } else if (record.type === \"return\") {\n this.rval = record.arg;\n this.next = \"end\";\n } else if (record.type === \"normal\" && afterLoc) {\n this.next = afterLoc;\n }\n },\n\n finish: function(finallyLoc) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.finallyLoc === finallyLoc) {\n this.complete(entry.completion, entry.afterLoc);\n resetTryEntry(entry);\n return ContinueSentinel;\n }\n }\n },\n\n \"catch\": function(tryLoc) {\n for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n var entry = this.tryEntries[i];\n if (entry.tryLoc === tryLoc) {\n var record = entry.completion;\n if (record.type === \"throw\") {\n var thrown = record.arg;\n resetTryEntry(entry);\n }\n return thrown;\n }\n }\n\n // The context.catch method must only be called with a location\n // argument that corresponds to a known catch block.\n throw new Error(\"illegal catch attempt\");\n },\n\n delegateYield: function(iterable, resultName, nextLoc) {\n this.delegate = {\n iterator: values(iterable),\n resultName: resultName,\n nextLoc: nextLoc\n };\n\n return ContinueSentinel;\n }\n };\n})(\n // Among the various tricks for obtaining a reference to the global\n // object, this seems to be the most reliable technique that does not\n // use indirect eval (which violates Content Security Policy).\n typeof global === \"object\" ? global :\n typeof window === \"object\" ? window :\n typeof self === \"object\" ? self : this\n);\n","console.warn(\n \"The regenerator/runtime module is deprecated; \" +\n \"please import regenerator-runtime/runtime instead.\"\n);\n\nmodule.exports = require(\"regenerator-runtime/runtime\");\n","/* @flow */\n'use strict'\n\nmodule.exports = function (Y/* :any */) {\n class AbstractConnector {\n /* ::\n y: YConfig;\n role: SyncRole;\n connections: Object;\n isSynced: boolean;\n userEventListeners: Array;\n whenSyncedListeners: Array;\n currentSyncTarget: ?UserId;\n syncingClients: Array;\n forwardToSyncingClients: boolean;\n debug: boolean;\n broadcastedHB: boolean;\n syncStep2: Promise;\n userId: UserId;\n send: Function;\n broadcast: Function;\n broadcastOpBuffer: Array;\n protocolVersion: number;\n */\n /*\n opts contains the following information:\n role : String Role of this client (\"master\" or \"slave\")\n userId : String Uniquely defines the user.\n debug: Boolean Whether to print debug messages (optional)\n */\n constructor (y, opts) {\n this.y = y\n if (opts == null) {\n opts = {}\n }\n if (opts.role == null || opts.role === 'master') {\n this.role = 'master'\n } else if (opts.role === 'slave') {\n this.role = 'slave'\n } else {\n throw new Error(\"Role must be either 'master' or 'slave'!\")\n }\n this.y.db.forwardAppliedOperations = opts.forwardAppliedOperations || false\n this.role = opts.role\n this.connections = {}\n this.isSynced = false\n this.userEventListeners = []\n this.whenSyncedListeners = []\n this.currentSyncTarget = null\n this.syncingClients = []\n this.forwardToSyncingClients = opts.forwardToSyncingClients !== false\n this.debug = opts.debug === true\n this.broadcastedHB = false\n this.syncStep2 = Promise.resolve()\n this.broadcastOpBuffer = []\n this.protocolVersion = 11\n }\n reconnect () {\n }\n disconnect () {\n this.connections = {}\n this.isSynced = false\n this.currentSyncTarget = null\n this.broadcastedHB = false\n this.syncingClients = []\n this.whenSyncedListeners = []\n return this.y.db.stopGarbageCollector()\n }\n setUserId (userId) {\n if (this.userId == null) {\n this.userId = userId\n return this.y.db.setUserId(userId)\n } else {\n return null\n }\n }\n onUserEvent (f) {\n this.userEventListeners.push(f)\n }\n userLeft (user) {\n if (this.connections[user] != null) {\n delete this.connections[user]\n if (user === this.currentSyncTarget) {\n this.currentSyncTarget = null\n this.findNextSyncTarget()\n }\n this.syncingClients = this.syncingClients.filter(function (cli) {\n return cli !== user\n })\n for (var f of this.userEventListeners) {\n f({\n action: 'userLeft',\n user: user\n })\n }\n }\n }\n userJoined (user, role) {\n if (role == null) {\n throw new Error('You must specify the role of the joined user!')\n }\n if (this.connections[user] != null) {\n throw new Error('This user already joined!')\n }\n this.connections[user] = {\n isSynced: false,\n role: role\n }\n for (var f of this.userEventListeners) {\n f({\n action: 'userJoined',\n user: user,\n role: role\n })\n }\n if (this.currentSyncTarget == null) {\n this.findNextSyncTarget()\n }\n }\n // Execute a function _when_ we are connected.\n // If not connected, wait until connected\n whenSynced (f) {\n if (this.isSynced) {\n f()\n } else {\n this.whenSyncedListeners.push(f)\n }\n }\n /*\n\n returns false, if there is no sync target\n true otherwise\n */\n findNextSyncTarget () {\n if (this.currentSyncTarget != null || this.isSynced) {\n return // \"The current sync has not finished!\"\n }\n\n var syncUser = null\n for (var uid in this.connections) {\n if (!this.connections[uid].isSynced) {\n syncUser = uid\n break\n }\n }\n var conn = this\n if (syncUser != null) {\n this.currentSyncTarget = syncUser\n this.y.db.requestTransaction(function *() {\n var stateSet = yield* this.getStateSet()\n var deleteSet = yield* this.getDeleteSet()\n conn.send(syncUser, {\n type: 'sync step 1',\n stateSet: stateSet,\n deleteSet: deleteSet,\n protocolVersion: conn.protocolVersion\n })\n })\n } else {\n this.y.db.requestTransaction(function *() {\n // it is crucial that isSynced is set at the time garbageCollectAfterSync is called\n conn.isSynced = true\n yield* this.garbageCollectAfterSync()\n // call whensynced listeners\n for (var f of conn.whenSyncedListeners) {\n f()\n }\n conn.whenSyncedListeners = []\n })\n }\n }\n send (uid, message) {\n if (this.debug) {\n console.log(`send ${this.userId} -> ${uid}: ${message.type}`, message) // eslint-disable-line\n }\n }\n /*\n Buffer operations, and broadcast them when ready.\n */\n broadcastOps (ops) {\n ops = ops.map(function (op) {\n return Y.Struct[op.struct].encode(op)\n })\n var self = this\n function broadcastOperations () {\n if (self.broadcastOpBuffer.length > 0) {\n self.broadcast({\n type: 'update',\n ops: self.broadcastOpBuffer\n })\n self.broadcastOpBuffer = []\n }\n }\n if (this.broadcastOpBuffer.length === 0) {\n this.broadcastOpBuffer = ops\n if (this.y.db.transactionInProgress) {\n this.y.db.whenTransactionsFinished().then(broadcastOperations)\n } else {\n setTimeout(broadcastOperations, 0)\n }\n } else {\n this.broadcastOpBuffer = this.broadcastOpBuffer.concat(ops)\n }\n }\n /*\n You received a raw message, and you know that it is intended for Yjs. Then call this function.\n */\n receiveMessage (sender/* :UserId */, message/* :Message */) {\n if (sender === this.userId) {\n return\n }\n if (this.debug) {\n console.log(`receive ${sender} -> ${this.userId}: ${message.type}`, JSON.parse(JSON.stringify(message))) // eslint-disable-line\n }\n if (message.protocolVersion != null && message.protocolVersion !== this.protocolVersion) {\n console.error(\n `You tried to sync with a yjs instance that has a different protocol version\n (You: ${this.protocolVersion}, Client: ${message.protocolVersion}).\n The sync was stopped. You need to upgrade your dependencies (especially Yjs & the Connector)!\n `)\n this.send(sender, {\n type: 'sync stop',\n protocolVersion: this.protocolVersion\n })\n return\n }\n if (message.type === 'sync step 1') {\n let conn = this\n let m = message\n this.y.db.requestTransaction(function *() {\n var currentStateSet = yield* this.getStateSet()\n yield* this.applyDeleteSet(m.deleteSet)\n\n var ds = yield* this.getDeleteSet()\n var ops = yield* this.getOperations(m.stateSet)\n conn.send(sender, {\n type: 'sync step 2',\n os: ops,\n stateSet: currentStateSet,\n deleteSet: ds,\n protocolVersion: this.protocolVersion\n })\n if (this.forwardToSyncingClients) {\n conn.syncingClients.push(sender)\n setTimeout(function () {\n conn.syncingClients = conn.syncingClients.filter(function (cli) {\n return cli !== sender\n })\n conn.send(sender, {\n type: 'sync done'\n })\n }, 5000) // TODO: conn.syncingClientDuration)\n } else {\n conn.send(sender, {\n type: 'sync done'\n })\n }\n conn._setSyncedWith(sender)\n })\n } else if (message.type === 'sync step 2') {\n let conn = this\n var broadcastHB = !this.broadcastedHB\n this.broadcastedHB = true\n var db = this.y.db\n var defer = {}\n defer.promise = new Promise(function (resolve) {\n defer.resolve = resolve\n })\n this.syncStep2 = defer.promise\n let m /* :MessageSyncStep2 */ = message\n db.requestTransaction(function * () {\n yield* this.applyDeleteSet(m.deleteSet)\n this.store.apply(m.os)\n db.requestTransaction(function * () {\n var ops = yield* this.getOperations(m.stateSet)\n if (ops.length > 0) {\n if (!broadcastHB) { // TODO: consider to broadcast here..\n conn.send(sender, {\n type: 'update',\n ops: ops\n })\n } else {\n // broadcast only once!\n conn.broadcastOps(ops)\n }\n }\n defer.resolve()\n })\n })\n } else if (message.type === 'sync done') {\n var self = this\n this.syncStep2.then(function () {\n self._setSyncedWith(sender)\n })\n } else if (message.type === 'update') {\n if (this.forwardToSyncingClients) {\n for (var client of this.syncingClients) {\n this.send(client, message)\n }\n }\n if (this.y.db.forwardAppliedOperations) {\n var delops = message.ops.filter(function (o) {\n return o.struct === 'Delete'\n })\n if (delops.length > 0) {\n this.broadcastOps(delops)\n }\n }\n this.y.db.apply(message.ops)\n }\n }\n _setSyncedWith (user) {\n var conn = this.connections[user]\n if (conn != null) {\n conn.isSynced = true\n }\n if (user === this.currentSyncTarget) {\n this.currentSyncTarget = null\n this.findNextSyncTarget()\n }\n }\n /*\n Currently, the HB encodes operations as JSON. For the moment I want to keep it\n that way. Maybe we support encoding in the HB as XML in the future, but for now I don't want\n too much overhead. Y is very likely to get changed a lot in the future\n\n Because we don't want to encode JSON as string (with character escaping, wich makes it pretty much unreadable)\n we encode the JSON as XML.\n\n When the HB support encoding as XML, the format should look pretty much like this.\n\n does not support primitive values as array elements\n expects an ltx (less than xml) object\n */\n parseMessageFromXml (m/* :any */) {\n function parseArray (node) {\n for (var n of node.children) {\n if (n.getAttribute('isArray') === 'true') {\n return parseArray(n)\n } else {\n return parseObject(n)\n }\n }\n }\n function parseObject (node/* :any */) {\n var json = {}\n for (var attrName in node.attrs) {\n var value = node.attrs[attrName]\n var int = parseInt(value, 10)\n if (isNaN(int) || ('' + int) !== value) {\n json[attrName] = value\n } else {\n json[attrName] = int\n }\n }\n for (var n/* :any */ in node.children) {\n var name = n.name\n if (n.getAttribute('isArray') === 'true') {\n json[name] = parseArray(n)\n } else {\n json[name] = parseObject(n)\n }\n }\n return json\n }\n parseObject(m)\n }\n /*\n encode message in xml\n we use string because Strophe only accepts an \"xml-string\"..\n So {a:4,b:{c:5}} will look like\n \n \n \n m - ltx element\n json - Object\n */\n encodeMessageToXml (msg, obj) {\n // attributes is optional\n function encodeObject (m, json) {\n for (var name in json) {\n var value = json[name]\n if (name == null) {\n // nop\n } else if (value.constructor === Object) {\n encodeObject(m.c(name), value)\n } else if (value.constructor === Array) {\n encodeArray(m.c(name), value)\n } else {\n m.setAttribute(name, value)\n }\n }\n }\n function encodeArray (m, array) {\n m.setAttribute('isArray', 'true')\n for (var e of array) {\n if (e.constructor === Object) {\n encodeObject(m.c('array-element'), e)\n } else {\n encodeArray(m.c('array-element'), e)\n }\n }\n }\n if (obj.constructor === Object) {\n encodeObject(msg.c('y', { xmlns: 'http://y.ninja/connector-stanza' }), obj)\n } else if (obj.constructor === Array) {\n encodeArray(msg.c('y', { xmlns: 'http://y.ninja/connector-stanza' }), obj)\n } else {\n throw new Error(\"I can't encode this json!\")\n }\n }\n }\n Y.AbstractConnector = AbstractConnector\n}\n","/* global getRandom, async */\n'use strict'\n\nmodule.exports = function (Y) {\n var globalRoom = {\n users: {},\n buffers: {}, // TODO: reimplement this idea. This does not cover all cases!! Here, you have a queue which is unrealistic (i.e. think about multiple incoming connections)\n removeUser: function (user) {\n for (var i in this.users) {\n this.users[i].userLeft(user)\n }\n delete this.users[user]\n delete this.buffers[user]\n },\n addUser: function (connector) {\n this.users[connector.userId] = connector\n this.buffers[connector.userId] = {}\n for (var uname in this.users) {\n if (uname !== connector.userId) {\n var u = this.users[uname]\n u.userJoined(connector.userId, 'master')\n connector.userJoined(u.userId, 'master')\n }\n }\n },\n whenTransactionsFinished: function () {\n var ps = []\n for (var name in this.users) {\n ps.push(this.users[name].y.db.whenTransactionsFinished())\n }\n return Promise.all(ps)\n },\n flushOne: function flushOne () {\n var bufs = []\n for (var receiver in globalRoom.buffers) {\n let buff = globalRoom.buffers[receiver]\n var push = false\n for (let sender in buff) {\n if (buff[sender].length > 0) {\n push = true\n break\n }\n }\n if (push) {\n bufs.push(receiver)\n }\n }\n if (bufs.length > 0) {\n var userId = getRandom(bufs)\n let buff = globalRoom.buffers[userId]\n let sender = getRandom(Object.keys(buff))\n var m = buff[sender].shift()\n if (buff[sender].length === 0) {\n delete buff[sender]\n }\n var user = globalRoom.users[userId]\n user.receiveMessage(m[0], m[1])\n return user.y.db.whenTransactionsFinished()\n } else {\n return false\n }\n },\n flushAll: function () {\n return new Promise(function (resolve) {\n // flushes may result in more created operations,\n // flush until there is nothing more to flush\n function nextFlush () {\n var c = globalRoom.flushOne()\n if (c) {\n while (c) {\n c = globalRoom.flushOne()\n }\n globalRoom.whenTransactionsFinished().then(nextFlush)\n } else {\n setTimeout(function () {\n var c = globalRoom.flushOne()\n if (c) {\n c.then(function () {\n globalRoom.whenTransactionsFinished().then(nextFlush)\n })\n } else {\n resolve()\n }\n }, 0)\n }\n }\n globalRoom.whenTransactionsFinished().then(nextFlush)\n })\n }\n }\n Y.utils.globalRoom = globalRoom\n\n var userIdCounter = 0\n\n class Test extends Y.AbstractConnector {\n constructor (y, options) {\n if (options === undefined) {\n throw new Error('Options must not be undefined!')\n }\n options.role = 'master'\n options.forwardToSyncingClients = false\n super(y, options)\n this.setUserId((userIdCounter++) + '').then(() => {\n globalRoom.addUser(this)\n })\n this.globalRoom = globalRoom\n this.syncingClientDuration = 0\n }\n receiveMessage (sender, m) {\n super.receiveMessage(sender, JSON.parse(JSON.stringify(m)))\n }\n send (userId, message) {\n var buffer = globalRoom.buffers[userId]\n if (buffer != null) {\n if (buffer[this.userId] == null) {\n buffer[this.userId] = []\n }\n buffer[this.userId].push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n broadcast (message) {\n for (var key in globalRoom.buffers) {\n var buff = globalRoom.buffers[key]\n if (buff[this.userId] == null) {\n buff[this.userId] = []\n }\n buff[this.userId].push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n isDisconnected () {\n return globalRoom.users[this.userId] == null\n }\n reconnect () {\n if (this.isDisconnected()) {\n globalRoom.addUser(this)\n super.reconnect()\n }\n return Y.utils.globalRoom.flushAll()\n }\n disconnect () {\n if (!this.isDisconnected()) {\n globalRoom.removeUser(this.userId)\n super.disconnect()\n }\n return this.y.db.whenTransactionsFinished()\n }\n flush () {\n var self = this\n return async(function * () {\n var buff = globalRoom.buffers[self.userId]\n while (Object.keys(buff).length > 0) {\n var sender = getRandom(Object.keys(buff))\n var m = buff[sender].shift()\n if (buff[sender].length === 0) {\n delete buff[sender]\n }\n this.receiveMessage(m[0], m[1])\n }\n yield self.whenTransactionsFinished()\n })\n }\n }\n\n Y.Test = Test\n}\n","/* @flow */\n'use strict'\n\nmodule.exports = function (Y /* :any */) {\n /*\n Partial definition of an OperationStore.\n TODO: name it Database, operation store only holds operations.\n\n A database definition must alse define the following methods:\n * logTable() (optional)\n - show relevant information information in a table\n * requestTransaction(makeGen)\n - request a transaction\n * destroy()\n - destroy the database\n */\n class AbstractDatabase {\n /* ::\n y: YConfig;\n forwardAppliedOperations: boolean;\n listenersById: Object;\n listenersByIdExecuteNow: Array;\n listenersByIdRequestPending: boolean;\n initializedTypes: Object;\n whenUserIdSetListener: ?Function;\n waitingTransactions: Array;\n transactionInProgress: boolean;\n executeOrder: Array;\n gc1: Array;\n gc2: Array;\n gcTimeout: number;\n gcInterval: any;\n garbageCollect: Function;\n executeOrder: Array; // for debugging only\n userId: UserId;\n opClock: number;\n transactionsFinished: ?{promise: Promise, resolve: any};\n transact: (x: ?Generator) => any;\n */\n constructor (y, opts) {\n this.y = y\n var os = this\n this.userId = null\n var resolve\n this.userIdPromise = new Promise(function (r) {\n resolve = r\n })\n this.userIdPromise.resolve = resolve\n // whether to broadcast all applied operations (insert & delete hook)\n this.forwardAppliedOperations = false\n // E.g. this.listenersById[id] : Array\n this.listenersById = {}\n // Execute the next time a transaction is requested\n this.listenersByIdExecuteNow = []\n // A transaction is requested\n this.listenersByIdRequestPending = false\n /* To make things more clear, the following naming conventions:\n * ls : we put this.listenersById on ls\n * l : Array\n * id : Id (can't use as property name)\n * sid : String (converted from id via JSON.stringify\n so we can use it as a property name)\n\n Always remember to first overwrite\n a property before you iterate over it!\n */\n // TODO: Use ES7 Weak Maps. This way types that are no longer user,\n // wont be kept in memory.\n this.initializedTypes = {}\n this.waitingTransactions = []\n this.transactionInProgress = false\n this.transactionIsFlushed = false\n if (typeof YConcurrency_TestingMode !== 'undefined') {\n this.executeOrder = []\n }\n this.gc1 = [] // first stage\n this.gc2 = [] // second stage -> after that, remove the op\n this.gcTimeout = !opts.gcTimeout ? 50000 : opts.gcTimeouts\n function garbageCollect () {\n return os.whenTransactionsFinished().then(function () {\n if (os.gc1.length > 0 || os.gc2.length > 0) {\n if (!os.y.isConnected()) {\n console.warn('gc should be empty when disconnected!')\n }\n return new Promise((resolve) => {\n os.requestTransaction(function * () {\n if (os.y.connector != null && os.y.connector.isSynced) {\n for (var i = 0; i < os.gc2.length; i++) {\n var oid = os.gc2[i]\n yield* this.garbageCollectOperation(oid)\n }\n os.gc2 = os.gc1\n os.gc1 = []\n }\n // TODO: Use setInterval here instead (when garbageCollect is called several times there will be several timeouts..)\n if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n resolve()\n })\n })\n } else {\n // TODO: see above\n if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n return Promise.resolve()\n }\n })\n }\n this.garbageCollect = garbageCollect\n if (this.gcTimeout > 0) {\n garbageCollect()\n }\n }\n queueGarbageCollector (id) {\n if (this.y.isConnected()) {\n this.gc1.push(id)\n }\n }\n emptyGarbageCollector () {\n return new Promise(resolve => {\n var check = () => {\n if (this.gc1.length > 0 || this.gc2.length > 0) {\n this.garbageCollect().then(check)\n } else {\n resolve()\n }\n }\n setTimeout(check, 0)\n })\n }\n addToDebug () {\n if (typeof YConcurrency_TestingMode !== 'undefined') {\n var command /* :string */ = Array.prototype.map.call(arguments, function (s) {\n if (typeof s === 'string') {\n return s\n } else {\n return JSON.stringify(s)\n }\n }).join('').replace(/\"/g, \"'\").replace(/,/g, ', ').replace(/:/g, ': ')\n this.executeOrder.push(command)\n }\n }\n getDebugData () {\n console.log(this.executeOrder.join('\\n'))\n }\n stopGarbageCollector () {\n var self = this\n return new Promise(function (resolve) {\n self.requestTransaction(function * () {\n var ungc /* :Array */ = self.gc1.concat(self.gc2)\n self.gc1 = []\n self.gc2 = []\n for (var i = 0; i < ungc.length; i++) {\n var op = yield* this.getOperation(ungc[i])\n if (op != null) {\n delete op.gc\n yield* this.setOperation(op)\n }\n }\n resolve()\n })\n })\n }\n /*\n Try to add to GC.\n\n TODO: rename this function\n\n Rulez:\n * Only gc if this user is online\n * The most left element in a list must not be gc'd.\n => There is at least one element in the list\n\n returns true iff op was added to GC\n */\n * addToGarbageCollector (op, left) {\n if (\n op.gc == null &&\n op.deleted === true\n ) {\n var gc = false\n if (left != null && left.deleted === true) {\n gc = true\n } else if (op.content != null && op.content.length > 1) {\n op = yield* this.getInsertionCleanStart([op.id[0], op.id[1] + 1])\n gc = true\n }\n if (gc) {\n op.gc = true\n yield* this.setOperation(op)\n this.store.queueGarbageCollector(op.id)\n return true\n }\n }\n return false\n }\n removeFromGarbageCollector (op) {\n function filter (o) {\n return !Y.utils.compareIds(o, op.id)\n }\n this.gc1 = this.gc1.filter(filter)\n this.gc2 = this.gc2.filter(filter)\n delete op.gc\n }\n * destroy () {\n clearInterval(this.gcInterval)\n this.gcInterval = null\n for (var key in this.initializedTypes) {\n var type = this.initializedTypes[key]\n if (type._destroy != null) {\n type._destroy()\n } else {\n console.error('The type you included does not provide destroy functionality, it will remain in memory (updating your packages will help).')\n }\n }\n }\n setUserId (userId) {\n if (!this.userIdPromise.inProgress) {\n this.userIdPromise.inProgress = true\n var self = this\n self.requestTransaction(function * () {\n self.userId = userId\n var state = yield* this.getState(userId)\n self.opClock = state.clock\n self.userIdPromise.resolve(userId)\n })\n }\n return this.userIdPromise\n }\n whenUserIdSet (f) {\n this.userIdPromise.then(f)\n }\n getNextOpId (numberOfIds) {\n if (numberOfIds == null) {\n throw new Error('getNextOpId expects the number of created ids to create!')\n } else if (this.userId == null) {\n throw new Error('OperationStore not yet initialized!')\n } else {\n var id = [this.userId, this.opClock]\n this.opClock += numberOfIds\n return id\n }\n }\n /*\n Apply a list of operations.\n\n * get a transaction\n * check whether all Struct.*.requiredOps are in the OS\n * check if it is an expected op (otherwise wait for it)\n * check if was deleted, apply a delete operation after op was applied\n */\n apply (ops) {\n for (var i = 0; i < ops.length; i++) {\n var o = ops[i]\n if (o.id == null || o.id[0] !== this.y.connector.userId) {\n var required = Y.Struct[o.struct].requiredOps(o)\n if (o.requires != null) {\n required = required.concat(o.requires)\n }\n this.whenOperationsExist(required, o)\n }\n }\n }\n /*\n op is executed as soon as every operation requested is available.\n Note that Transaction can (and should) buffer requests.\n */\n whenOperationsExist (ids, op) {\n if (ids.length > 0) {\n let listener = {\n op: op,\n missing: ids.length\n }\n\n for (let i = 0; i < ids.length; i++) {\n let id = ids[i]\n let sid = JSON.stringify(id)\n let l = this.listenersById[sid]\n if (l == null) {\n l = []\n this.listenersById[sid] = l\n }\n l.push(listener)\n }\n } else {\n this.listenersByIdExecuteNow.push({\n op: op\n })\n }\n\n if (this.listenersByIdRequestPending) {\n return\n }\n\n this.listenersByIdRequestPending = true\n var store = this\n\n this.requestTransaction(function * () {\n var exeNow = store.listenersByIdExecuteNow\n store.listenersByIdExecuteNow = []\n\n var ls = store.listenersById\n store.listenersById = {}\n\n store.listenersByIdRequestPending = false\n\n for (let key = 0; key < exeNow.length; key++) {\n let o = exeNow[key].op\n yield* store.tryExecute.call(this, o)\n }\n\n for (var sid in ls) {\n var l = ls[sid]\n var id = JSON.parse(sid)\n var op\n if (typeof id[1] === 'string') {\n op = yield* this.getOperation(id)\n } else {\n op = yield* this.getInsertion(id)\n }\n if (op == null) {\n store.listenersById[sid] = l\n } else {\n for (let i = 0; i < l.length; i++) {\n let listener = l[i]\n let o = listener.op\n if (--listener.missing === 0) {\n yield* store.tryExecute.call(this, o)\n }\n }\n }\n }\n })\n }\n /*\n Actually execute an operation, when all expected operations are available.\n */\n /* :: // TODO: this belongs somehow to transaction\n store: Object;\n getOperation: any;\n isGarbageCollected: any;\n addOperation: any;\n whenOperationsExist: any;\n */\n * tryExecute (op) {\n this.store.addToDebug('yield* this.store.tryExecute.call(this, ', JSON.stringify(op), ')')\n if (op.struct === 'Delete') {\n yield* Y.Struct.Delete.execute.call(this, op)\n // this is now called in Transaction.deleteOperation!\n // yield* this.store.operationAdded(this, op)\n } else {\n // check if this op was defined\n var defined = yield* this.getInsertion(op.id)\n while (defined != null && defined.content != null) {\n // check if this op has a longer content in the case it is defined\n if (defined.id[1] + defined.content.length < op.id[1] + op.content.length) {\n var overlapSize = defined.content.length - (op.id[1] - defined.id[1])\n op.content.splice(0, overlapSize)\n op.id = [op.id[0], op.id[1] + overlapSize]\n op.left = Y.utils.getLastId(defined)\n op.origin = op.left\n defined = yield* this.getOperation(op.id) // getOperation suffices here\n } else {\n break\n }\n }\n if (defined == null) {\n var opid = op.id\n var isGarbageCollected = yield* this.isGarbageCollected(opid)\n if (!isGarbageCollected) {\n yield* Y.Struct[op.struct].execute.call(this, op)\n yield* this.addOperation(op)\n yield* this.store.operationAdded(this, op)\n if (!Y.utils.compareIds(opid, op.id)) {\n // operationAdded changed op\n op = yield* this.getOperation(opid)\n }\n // if insertion, try to combine with left\n yield* this.tryCombineWithLeft(op)\n }\n }\n }\n }\n /*\n * Called by a transaction when an operation is added.\n * This function is especially important for y-indexeddb, where several instances may share a single database.\n * Every time an operation is created by one instance, it is send to all other instances and operationAdded is called\n *\n * If it's not a Delete operation:\n * * Checks if another operation is executable (listenersById)\n * * Update state, if possible\n *\n * Always:\n * * Call type\n */\n * operationAdded (transaction, op) {\n if (op.struct === 'Delete') {\n var target = yield* transaction.getInsertion(op.target)\n var type = this.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(transaction, op)\n }\n } else {\n // increase SS\n yield* transaction.updateState(op.id[0])\n var opLen = op.content != null ? op.content.length : 1\n for (let i = 0; i < opLen; i++) {\n // notify whenOperation listeners (by id)\n var sid = JSON.stringify([op.id[0], op.id[1] + i])\n var l = this.listenersById[sid]\n delete this.listenersById[sid]\n if (l != null) {\n for (var key in l) {\n var listener = l[key]\n if (--listener.missing === 0) {\n this.whenOperationsExist([], listener.op)\n }\n }\n }\n }\n var t = this.initializedTypes[JSON.stringify(op.parent)]\n\n // if parent is deleted, mark as gc'd and return\n if (op.parent != null) {\n var parentIsDeleted = yield* transaction.isDeleted(op.parent)\n if (parentIsDeleted) {\n yield* transaction.deleteList(op.id)\n return\n }\n }\n\n // notify parent, if it was instanciated as a custom type\n if (t != null) {\n let o = Y.utils.copyOperation(op)\n yield* t._changed(transaction, o)\n }\n if (!op.deleted) {\n // Delete if DS says this is actually deleted\n var len = op.content != null ? op.content.length : 1\n var startId = op.id // You must not use op.id in the following loop, because op will change when deleted\n for (let i = 0; i < len; i++) {\n var id = [startId[0], startId[1] + i]\n var opIsDeleted = yield* transaction.isDeleted(id)\n if (opIsDeleted) {\n var delop = {\n struct: 'Delete',\n target: id\n }\n yield* this.tryExecute.call(transaction, delop)\n }\n }\n }\n }\n }\n whenTransactionsFinished () {\n if (this.transactionInProgress) {\n if (this.transactionsFinished == null) {\n var resolve\n var promise = new Promise(function (r) {\n resolve = r\n })\n this.transactionsFinished = {\n resolve: resolve,\n promise: promise\n }\n return promise\n } else {\n return this.transactionsFinished.promise\n }\n } else {\n return Promise.resolve()\n }\n }\n // Check if there is another transaction request.\n // * the last transaction is always a flush :)\n getNextRequest () {\n if (this.waitingTransactions.length === 0) {\n if (this.transactionIsFlushed) {\n this.transactionInProgress = false\n this.transactionIsFlushed = false\n if (this.transactionsFinished != null) {\n this.transactionsFinished.resolve()\n this.transactionsFinished = null\n }\n return null\n } else {\n this.transactionIsFlushed = true\n return function * () {\n yield* this.flush()\n }\n }\n } else {\n this.transactionIsFlushed = false\n return this.waitingTransactions.shift()\n }\n }\n requestTransaction (makeGen/* :any */, callImmediately) {\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n setTimeout(() => {\n this.transact(this.getNextRequest())\n }, 0)\n }\n }\n }\n Y.AbstractDatabase = AbstractDatabase\n}\n","/* @flow */\n'use strict'\n\n/*\n An operation also defines the structure of a type. This is why operation and\n structure are used interchangeably here.\n\n It must be of the type Object. I hope to achieve some performance\n improvements when working on databases that support the json format.\n\n An operation must have the following properties:\n\n * encode\n - Encode the structure in a readable format (preferably string- todo)\n * decode (todo)\n - decode structure to json\n * execute\n - Execute the semantics of an operation.\n * requiredOps\n - Operations that are required to execute this operation.\n*/\nmodule.exports = function (Y/* :any */) {\n var Struct = {\n /* This is the only operation that is actually not a structure, because\n it is not stored in the OS. This is why it _does not_ have an id\n\n op = {\n target: Id\n }\n */\n Delete: {\n encode: function (op) {\n return op\n },\n requiredOps: function (op) {\n return [] // [op.target]\n },\n execute: function * (op) {\n return yield* this.deleteOperation(op.target, op.length || 1)\n }\n },\n Insert: {\n /* {\n content: [any],\n opContent: Id,\n id: Id,\n left: Id,\n origin: Id,\n right: Id,\n parent: Id,\n parentSub: string (optional), // child of Map type\n }\n */\n encode: function (op/* :Insertion */) /* :Insertion */ {\n // TODO: you could not send the \"left\" property, then you also have to\n // \"op.left = null\" in $execute or $decode\n var e/* :any */ = {\n id: op.id,\n left: op.left,\n right: op.right,\n origin: op.origin,\n parent: op.parent,\n struct: op.struct\n }\n if (op.parentSub != null) {\n e.parentSub = op.parentSub\n }\n if (op.hasOwnProperty('opContent')) {\n e.opContent = op.opContent\n } else {\n e.content = op.content.slice()\n }\n\n return e\n },\n requiredOps: function (op) {\n var ids = []\n if (op.left != null) {\n ids.push(op.left)\n }\n if (op.right != null) {\n ids.push(op.right)\n }\n if (op.origin != null && !Y.utils.compareIds(op.left, op.origin)) {\n ids.push(op.origin)\n }\n // if (op.right == null && op.left == null) {\n ids.push(op.parent)\n\n if (op.opContent != null) {\n ids.push(op.opContent)\n }\n return ids\n },\n getDistanceToOrigin: function * (op) {\n if (op.left == null) {\n return 0\n } else {\n var d = 0\n var o = yield* this.getInsertion(op.left)\n while (!Y.utils.matchesId(o, op.origin)) {\n d++\n if (o.left == null) {\n break\n } else {\n o = yield* this.getInsertion(o.left)\n }\n }\n return d\n }\n },\n /*\n # $this has to find a unique position between origin and the next known character\n # case 1: $origin equals $o.origin: the $creator parameter decides if left or right\n # let $OL= [o1,o2,o3,o4], whereby $this is to be inserted between o1 and o4\n # o2,o3 and o4 origin is 1 (the position of o2)\n # there is the case that $this.creator < o2.creator, but o3.creator < $this.creator\n # then o2 knows o3. Since on another client $OL could be [o1,o3,o4] the problem is complex\n # therefore $this would be always to the right of o3\n # case 2: $origin < $o.origin\n # if current $this insert_position > $o origin: $this ins\n # else $insert_position will not change\n # (maybe we encounter case 1 later, then this will be to the right of $o)\n # case 3: $origin > $o.origin\n # $this insert_position is to the left of $o (forever!)\n */\n execute: function * (op) {\n var i // loop counter\n\n // during this function some ops may get split into two pieces (e.g. with getInsertionCleanEnd)\n // We try to merge them later, if possible\n var tryToRemergeLater = []\n\n if (op.origin != null) { // TODO: !== instead of !=\n // we save in origin that op originates in it\n // we need that later when we eventually garbage collect origin (see transaction)\n var origin = yield* this.getInsertionCleanEnd(op.origin)\n if (origin.originOf == null) {\n origin.originOf = []\n }\n origin.originOf.push(op.id)\n yield* this.setOperation(origin)\n if (origin.right != null) {\n tryToRemergeLater.push(origin.right)\n }\n }\n var distanceToOrigin = i = yield* Struct.Insert.getDistanceToOrigin.call(this, op) // most cases: 0 (starts from 0)\n\n // now we begin to insert op in the list of insertions..\n var o\n var parent\n var start\n\n // find o. o is the first conflicting operation\n if (op.left != null) {\n o = yield* this.getInsertionCleanEnd(op.left)\n if (!Y.utils.compareIds(op.left, op.origin) && o.right != null) {\n // only if not added previously\n tryToRemergeLater.push(o.right)\n }\n o = (o.right == null) ? null : yield* this.getOperation(o.right)\n } else { // left == null\n parent = yield* this.getOperation(op.parent)\n let startId = op.parentSub ? parent.map[op.parentSub] : parent.start\n start = startId == null ? null : yield* this.getOperation(startId)\n o = start\n }\n\n // make sure to split op.right if necessary (also add to tryCombineWithLeft)\n if (op.right != null) {\n tryToRemergeLater.push(op.right)\n yield* this.getInsertionCleanStart(op.right)\n }\n\n // handle conflicts\n while (true) {\n if (o != null && !Y.utils.compareIds(o.id, op.right)) {\n var oOriginDistance = yield* Struct.Insert.getDistanceToOrigin.call(this, o)\n if (oOriginDistance === i) {\n // case 1\n if (o.id[0] < op.id[0]) {\n op.left = Y.utils.getLastId(o)\n distanceToOrigin = i + 1 // just ignore o.content.length, doesn't make a difference\n }\n } else if (oOriginDistance < i) {\n // case 2\n if (i - distanceToOrigin <= oOriginDistance) {\n op.left = Y.utils.getLastId(o)\n distanceToOrigin = i + 1 // just ignore o.content.length, doesn't make a difference\n }\n } else {\n break\n }\n i++\n if (o.right != null) {\n o = yield* this.getInsertion(o.right)\n } else {\n o = null\n }\n } else {\n break\n }\n }\n\n // reconnect..\n var left = null\n var right = null\n if (parent == null) {\n parent = yield* this.getOperation(op.parent)\n }\n\n // reconnect left and set right of op\n if (op.left != null) {\n left = yield* this.getInsertion(op.left)\n // link left\n op.right = left.right\n left.right = op.id\n\n yield* this.setOperation(left)\n } else {\n // set op.right from parent, if necessary\n op.right = op.parentSub ? parent.map[op.parentSub] || null : parent.start\n }\n // reconnect right\n if (op.right != null) {\n // TODO: wanna connect right too?\n right = yield* this.getOperation(op.right)\n right.left = Y.utils.getLastId(op)\n\n // if right exists, and it is supposed to be gc'd. Remove it from the gc\n if (right.gc != null) {\n if (right.content != null && right.content.length > 1) {\n right = yield* this.getInsertionCleanEnd(right.id)\n }\n this.store.removeFromGarbageCollector(right)\n }\n yield* this.setOperation(right)\n }\n\n // update parents .map/start/end properties\n if (op.parentSub != null) {\n if (left == null) {\n parent.map[op.parentSub] = op.id\n yield* this.setOperation(parent)\n }\n // is a child of a map struct.\n // Then also make sure that only the most left element is not deleted\n // We do not call the type in this case (this is what the third parameter is for)\n if (op.right != null) {\n yield* this.deleteOperation(op.right, 1, true)\n }\n if (op.left != null) {\n yield* this.deleteOperation(op.id, 1, true)\n }\n } else {\n if (right == null || left == null) {\n if (right == null) {\n parent.end = Y.utils.getLastId(op)\n }\n if (left == null) {\n parent.start = op.id\n }\n yield* this.setOperation(parent)\n }\n }\n\n // try to merge original op.left and op.origin\n for (let i = 0; i < tryToRemergeLater.length; i++) {\n var m = yield* this.getOperation(tryToRemergeLater[i])\n yield* this.tryCombineWithLeft(m)\n }\n }\n },\n List: {\n /*\n {\n start: null,\n end: null,\n struct: \"List\",\n type: \"\",\n id: this.os.getNextOpId(1)\n }\n */\n create: function (id) {\n return {\n start: null,\n end: null,\n struct: 'List',\n id: id\n }\n },\n encode: function (op) {\n var e = {\n struct: 'List',\n id: op.id,\n type: op.type\n }\n if (op.requires != null) {\n e.requires = op.requires\n }\n if (op.info != null) {\n e.info = op.info\n }\n return e\n },\n requiredOps: function () {\n /*\n var ids = []\n if (op.start != null) {\n ids.push(op.start)\n }\n if (op.end != null){\n ids.push(op.end)\n }\n return ids\n */\n return []\n },\n execute: function * (op) {\n op.start = null\n op.end = null\n },\n ref: function * (op, pos) {\n if (op.start == null) {\n return null\n }\n var res = null\n var o = yield* this.getOperation(op.start)\n\n while (true) {\n if (!o.deleted) {\n res = o\n pos--\n }\n if (pos >= 0 && o.right != null) {\n o = yield* this.getOperation(o.right)\n } else {\n break\n }\n }\n return res\n },\n map: function * (o, f) {\n o = o.start\n var res = []\n while (o != null) { // TODO: change to != (at least some convention)\n var operation = yield* this.getOperation(o)\n if (!operation.deleted) {\n res.push(f(operation))\n }\n o = operation.right\n }\n return res\n }\n },\n Map: {\n /*\n {\n map: {},\n struct: \"Map\",\n type: \"\",\n id: this.os.getNextOpId(1)\n }\n */\n create: function (id) {\n return {\n id: id,\n map: {},\n struct: 'Map'\n }\n },\n encode: function (op) {\n var e = {\n struct: 'Map',\n type: op.type,\n id: op.id,\n map: {} // overwrite map!!\n }\n if (op.requires != null) {\n e.requires = op.requires\n }\n if (op.info != null) {\n e.info = op.info\n }\n return e\n },\n requiredOps: function () {\n return []\n },\n execute: function * () {},\n /*\n Get a property by name\n */\n get: function * (op, name) {\n var oid = op.map[name]\n if (oid != null) {\n var res = yield* this.getOperation(oid)\n if (res == null || res.deleted) {\n return void 0\n } else if (res.opContent == null) {\n return res.content[0]\n } else {\n return yield* this.getType(res.opContent)\n }\n }\n }\n }\n }\n Y.Struct = Struct\n}\n","/* @flow */\n'use strict'\n\n/*\n Partial definition of a transaction\n\n A transaction provides all the the async functionality on a database.\n\n By convention, a transaction has the following properties:\n * ss for StateSet\n * os for OperationStore\n * ds for DeleteStore\n\n A transaction must also define the following methods:\n * checkDeleteStoreForState(state)\n - When increasing the state of a user, an operation with an higher id\n may already be garbage collected, and therefore it will never be received.\n update the state to reflect this knowledge. This won't call a method to save the state!\n * getDeleteSet(id)\n - Get the delete set in a readable format:\n {\n \"userX\": [\n [5,1], // starting from position 5, one operations is deleted\n [9,4] // starting from position 9, four operations are deleted\n ],\n \"userY\": ...\n }\n * getOpsFromDeleteSet(ds) -- TODO: just call this.deleteOperation(id) here\n - get a set of deletions that need to be applied in order to get to\n achieve the state of the supplied ds\n * setOperation(op)\n - write `op` to the database.\n Note: this is allowed to return an in-memory object.\n E.g. the Memory adapter returns the object that it has in-memory.\n Changing values on this object will be stored directly in the database\n without calling this function. Therefore,\n setOperation may have no functionality in some adapters. This also has\n implications on the way we use operations that were served from the database.\n We try not to call copyObject, if not necessary.\n * addOperation(op)\n - add an operation to the database.\n This may only be called once for every op.id\n Must return a function that returns the next operation in the database (ordered by id)\n * getOperation(id)\n * removeOperation(id)\n - remove an operation from the database. This is called when an operation\n is garbage collected.\n * setState(state)\n - `state` is of the form\n {\n user: \"1\",\n clock: 4\n } <- meaning that we have four operations from user \"1\"\n (with these id's respectively: 0, 1, 2, and 3)\n * getState(user)\n * getStateVector()\n - Get the state of the OS in the form\n [{\n user: \"userX\",\n clock: 11\n },\n ..\n ]\n * getStateSet()\n - Get the state of the OS in the form\n {\n \"userX\": 11,\n \"userY\": 22\n }\n * getOperations(startSS)\n - Get the all the operations that are necessary in order to achive the\n stateSet of this user, starting from a stateSet supplied by another user\n * makeOperationReady(ss, op)\n - this is called only by `getOperations(startSS)`. It makes an operation\n applyable on a given SS.\n*/\nmodule.exports = function (Y/* :any */) {\n class TransactionInterface {\n /* ::\n store: Y.AbstractDatabase;\n ds: Store;\n os: Store;\n ss: Store;\n */\n /*\n Get a type based on the id of its model.\n If it does not exist yes, create it.\n TODO: delete type from store.initializedTypes[id] when corresponding id was deleted!\n */\n * getType (id, args) {\n var sid = JSON.stringify(id)\n var t = this.store.initializedTypes[sid]\n if (t == null) {\n var op/* :MapStruct | ListStruct */ = yield* this.getOperation(id)\n if (op != null) {\n t = yield* Y[op.type].typeDefinition.initType.call(this, this.store, op, args)\n this.store.initializedTypes[sid] = t\n }\n }\n return t\n }\n * createType (typedefinition, id) {\n var structname = typedefinition[0].struct\n id = id || this.store.getNextOpId(1)\n var op\n if (id[0] === '_') {\n op = yield* this.getOperation(id)\n } else {\n op = Y.Struct[structname].create(id)\n op.type = typedefinition[0].name\n }\n if (typedefinition[0].appendAdditionalInfo != null) {\n yield* typedefinition[0].appendAdditionalInfo.call(this, op, typedefinition[1])\n }\n if (op[0] === '_') {\n yield* this.setOperation(op)\n } else {\n yield* this.applyCreatedOperations([op])\n }\n return yield* this.getType(id, typedefinition[1])\n }\n /* createType (typedefinition, id) {\n var structname = typedefinition[0].struct\n id = id || this.store.getNextOpId(1)\n var op = Y.Struct[structname].create(id)\n op.type = typedefinition[0].name\n if (typedefinition[0].appendAdditionalInfo != null) {\n yield* typedefinition[0].appendAdditionalInfo.call(this, op, typedefinition[1])\n }\n // yield* this.applyCreatedOperations([op])\n yield* Y.Struct[op.struct].execute.call(this, op)\n yield* this.addOperation(op)\n yield* this.store.operationAdded(this, op)\n return yield* this.getType(id, typedefinition[1])\n }*/\n /*\n Apply operations that this user created (no remote ones!)\n * does not check for Struct.*.requiredOps()\n * also broadcasts it through the connector\n */\n * applyCreatedOperations (ops) {\n var send = []\n for (var i = 0; i < ops.length; i++) {\n var op = ops[i]\n yield* this.store.tryExecute.call(this, op)\n if (op.id == null || typeof op.id[1] !== 'string') {\n send.push(Y.Struct[op.struct].encode(op))\n }\n }\n if (!this.store.y.connector.isDisconnected() && send.length > 0) { // TODO: && !this.store.forwardAppliedOperations (but then i don't send delete ops)\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcastOps(send)\n }\n }\n\n * deleteList (start) {\n while (start != null) {\n start = yield* this.getOperation(start)\n if (!start.gc) {\n start.gc = true\n start.deleted = true\n yield* this.setOperation(start)\n var delLength = start.content != null ? start.content.length : 1\n yield* this.markDeleted(start.id, delLength)\n if (start.opContent != null) {\n yield* this.deleteOperation(start.opContent)\n }\n this.store.queueGarbageCollector(start.id)\n }\n start = start.right\n }\n }\n\n /*\n Mark an operation as deleted, and add it to the GC, if possible.\n */\n * deleteOperation (targetId, length, preventCallType) /* :Generator */ {\n if (length == null) {\n length = 1\n }\n yield* this.markDeleted(targetId, length)\n while (length > 0) {\n var callType = false\n var target = yield* this.os.findWithUpperBound([targetId[0], targetId[1] + length - 1])\n var targetLength = target != null && target.content != null ? target.content.length : 1\n if (target == null || target.id[0] !== targetId[0] || target.id[1] + targetLength <= targetId[1]) {\n // does not exist or is not in the range of the deletion\n target = null\n length = 0\n } else {\n // does exist, check if it is too long\n if (!target.deleted) {\n if (target.id[1] < targetId[1]) {\n // starts to the left of the deletion range\n target = yield* this.getInsertionCleanStart(targetId)\n targetLength = target.content.length // must have content property!\n }\n if (target.id[1] + targetLength > targetId[1] + length) {\n // ends to the right of the deletion range\n target = yield* this.getInsertionCleanEnd([targetId[0], targetId[1] + length - 1])\n targetLength = target.content.length\n }\n }\n length = target.id[1] - targetId[1]\n }\n\n if (target != null) {\n if (!target.deleted) {\n callType = true\n // set deleted & notify type\n target.deleted = true\n // delete containing lists\n if (target.start != null) {\n // TODO: don't do it like this .. -.-\n yield* this.deleteList(target.start)\n // yield* this.deleteList(target.id) -- do not gc itself because this may still get referenced\n }\n if (target.map != null) {\n for (var name in target.map) {\n yield* this.deleteList(target.map[name])\n }\n // TODO: here to.. (see above)\n // yield* this.deleteList(target.id) -- see above\n }\n if (target.opContent != null) {\n yield* this.deleteOperation(target.opContent)\n // target.opContent = null\n }\n if (target.requires != null) {\n for (var i = 0; i < target.requires.length; i++) {\n yield* this.deleteOperation(target.requires[i])\n }\n }\n }\n var left\n if (target.left != null) {\n left = yield* this.getInsertion(target.left)\n } else {\n left = null\n }\n\n // set here because it was deleted and/or gc'd\n yield* this.setOperation(target)\n\n /*\n Check if it is possible to add right to the gc.\n Because this delete can't be responsible for left being gc'd,\n we don't have to add left to the gc..\n */\n var right\n if (target.right != null) {\n right = yield* this.getOperation(target.right)\n } else {\n right = null\n }\n if (callType && !preventCallType) {\n yield* this.store.operationAdded(this, {\n struct: 'Delete',\n target: target.id,\n length: targetLength\n })\n }\n // need to gc in the end!\n yield* this.store.addToGarbageCollector.call(this, target, left)\n if (right != null) {\n yield* this.store.addToGarbageCollector.call(this, right, target)\n }\n }\n }\n }\n /*\n Mark an operation as deleted&gc'd\n */\n * markGarbageCollected (id, len) {\n // this.mem.push([\"gc\", id]);\n this.store.addToDebug('yield* this.markGarbageCollected(', id, ', ', len, ')')\n var n = yield* this.markDeleted(id, len)\n if (n.id[1] < id[1] && !n.gc) {\n // un-extend left\n var newlen = n.len - (id[1] - n.id[1])\n n.len -= newlen\n yield* this.ds.put(n)\n n = {id: id, len: newlen, gc: false}\n yield* this.ds.put(n)\n }\n // get prev&next before adding a new operation\n var prev = yield* this.ds.findPrev(id)\n var next = yield* this.ds.findNext(id)\n\n if (id[1] + len < n.id[1] + n.len && !n.gc) {\n // un-extend right\n yield* this.ds.put({id: [id[0], id[1] + len], len: n.len - len, gc: false})\n n.len = len\n }\n // set gc'd\n n.gc = true\n // can extend left?\n if (\n prev != null &&\n prev.gc &&\n Y.utils.compareIds([prev.id[0], prev.id[1] + prev.len], n.id)\n ) {\n prev.len += n.len\n yield* this.ds.delete(n.id)\n n = prev\n // ds.put n here?\n }\n // can extend right?\n if (\n next != null &&\n next.gc &&\n Y.utils.compareIds([n.id[0], n.id[1] + n.len], next.id)\n ) {\n n.len += next.len\n yield* this.ds.delete(next.id)\n }\n yield* this.ds.put(n)\n yield* this.updateState(n.id[0])\n }\n /*\n Mark an operation as deleted.\n\n returns the delete node\n */\n * markDeleted (id, length) {\n if (length == null) {\n length = 1\n }\n // this.mem.push([\"del\", id]);\n var n = yield* this.ds.findWithUpperBound(id)\n if (n != null && n.id[0] === id[0]) {\n if (n.id[1] <= id[1] && id[1] <= n.id[1] + n.len) {\n // id is in n's range\n var diff = id[1] + length - (n.id[1] + n.len) // overlapping right\n if (diff > 0) {\n // id+length overlaps n\n if (!n.gc) {\n n.len += diff\n } else {\n diff = n.id[1] + n.len - id[1] // overlapping left (id till n.end)\n if (diff < length) {\n // a partial deletion\n n = {id: [id[0], id[1] + diff], len: length - diff, gc: false}\n yield* this.ds.put(n)\n } else {\n // already gc'd\n throw new Error('Cannot happen! (it dit though.. :()')\n // return n\n }\n }\n } else {\n // no overlapping, already deleted\n return n\n }\n } else {\n // cannot extend left (there is no left!)\n n = {id: id, len: length, gc: false}\n yield* this.ds.put(n) // TODO: you double-put !!\n }\n } else {\n // cannot extend left\n n = {id: id, len: length, gc: false}\n yield* this.ds.put(n)\n }\n // can extend right?\n var next = yield* this.ds.findNext(n.id)\n if (\n next != null &&\n n.id[0] === next.id[0] &&\n n.id[1] + n.len >= next.id[1]\n ) {\n diff = n.id[1] + n.len - next.id[1] // from next.start to n.end\n while (diff >= 0) {\n // n overlaps with next\n if (next.gc) {\n // gc is stronger, so reduce length of n\n n.len -= diff\n if (diff >= next.len) {\n // delete the missing range after next\n diff = diff - next.len // missing range after next\n if (diff > 0) {\n yield* this.ds.put(n) // unneccessary? TODO!\n yield* this.markDeleted([next.id[0], next.id[1] + next.len], diff)\n }\n }\n break\n } else {\n // we can extend n with next\n if (diff > next.len) {\n // n is even longer than next\n // get next.next, and try to extend it\n var _next = yield* this.ds.findNext(next.id)\n yield* this.ds.delete(next.id)\n if (_next == null || n.id[0] !== _next.id[0]) {\n break\n } else {\n next = _next\n diff = n.id[1] + n.len - next.id[1] // from next.start to n.end\n // continue!\n }\n } else {\n // n just partially overlaps with next. extend n, delete next, and break this loop\n n.len += next.len - diff\n yield* this.ds.delete(next.id)\n break\n }\n }\n }\n }\n yield* this.ds.put(n)\n return n\n }\n /*\n Call this method when the client is connected&synced with the\n other clients (e.g. master). This will query the database for\n operations that can be gc'd and add them to the garbage collector.\n */\n * garbageCollectAfterSync () {\n if (this.store.gc1.length > 0 || this.store.gc2.length > 0) {\n console.warn('gc should be empty after sync')\n }\n yield* this.os.iterate(this, null, null, function * (op) {\n if (op.gc) {\n delete op.gc\n yield* this.setOperation(op)\n }\n if (op.parent != null) {\n var parentDeleted = yield* this.isDeleted(op.parent)\n if (parentDeleted) {\n op.gc = true\n if (!op.deleted) {\n yield* this.markDeleted(op.id, op.content != null ? op.content.length : 1)\n op.deleted = true\n if (op.opContent != null) {\n yield* this.deleteOperation(op.opContent)\n }\n if (op.requires != null) {\n for (var i = 0; i < op.requires.length; i++) {\n yield* this.deleteOperation(op.requires[i])\n }\n }\n }\n yield* this.setOperation(op)\n this.store.gc1.push(op.id) // this is ok becaues its shortly before sync (otherwise use queueGarbageCollector!)\n return\n }\n }\n if (op.deleted) {\n var left = null\n if (op.left != null) {\n left = yield* this.getInsertion(op.left)\n }\n yield* this.store.addToGarbageCollector.call(this, op, left)\n }\n })\n }\n /*\n Really remove an op and all its effects.\n The complicated case here is the Insert operation:\n * reset left\n * reset right\n * reset parent.start\n * reset parent.end\n * reset origins of all right ops\n */\n * garbageCollectOperation (id) {\n this.store.addToDebug('yield* this.garbageCollectOperation(', id, ')')\n var o = yield* this.getOperation(id)\n yield* this.markGarbageCollected(id, (o != null && o.content != null) ? o.content.length : 1) // always mark gc'd\n // if op exists, then clean that mess up..\n if (o != null) {\n var deps = []\n if (o.opContent != null) {\n deps.push(o.opContent)\n }\n if (o.requires != null) {\n deps = deps.concat(o.requires)\n }\n for (var i = 0; i < deps.length; i++) {\n var dep = yield* this.getOperation(deps[i])\n if (dep != null) {\n if (!dep.deleted) {\n yield* this.deleteOperation(dep.id)\n dep = yield* this.getOperation(dep.id)\n }\n dep.gc = true\n yield* this.setOperation(dep)\n this.store.queueGarbageCollector(dep.id)\n } else {\n yield* this.markGarbageCollected(deps[i], 1)\n }\n }\n\n // remove gc'd op from the left op, if it exists\n if (o.left != null) {\n var left = yield* this.getInsertion(o.left)\n left.right = o.right\n yield* this.setOperation(left)\n }\n // remove gc'd op from the right op, if it exists\n // also reset origins of right ops\n if (o.right != null) {\n var right = yield* this.getOperation(o.right)\n right.left = o.left\n\n if (o.originOf != null && o.originOf.length > 0) {\n // find new origin of right ops\n // origin is the first left deleted operation\n var neworigin = o.left\n var neworigin_ = null\n while (neworigin != null) {\n neworigin_ = yield* this.getInsertion(neworigin)\n if (neworigin_.deleted) {\n break\n }\n neworigin = neworigin_.left\n }\n\n // reset origin of all right ops (except first right - duh!),\n\n /* ** The following code does not rely on the the originOf property **\n I recently added originOf to all Insert Operations (see Struct.Insert.execute),\n which saves which operations originate in a Insert operation.\n Garbage collecting without originOf is more memory efficient, but is nearly impossible for large texts, or lists!\n But I keep this code for now\n ```\n // reset origin of right\n right.origin = neworigin\n // search until you find origin pointer to the left of o\n if (right.right != null) {\n var i = yield* this.getOperation(right.right)\n var ids = [o.id, o.right]\n while (ids.some(function (id) {\n return Y.utils.compareIds(id, i.origin)\n })) {\n if (Y.utils.compareIds(i.origin, o.id)) {\n // reset origin of i\n i.origin = neworigin\n yield* this.setOperation(i)\n }\n // get next i\n if (i.right == null) {\n break\n } else {\n ids.push(i.id)\n i = yield* this.getOperation(i.right)\n }\n }\n }\n ```\n */\n // ** Now the new implementation starts **\n // reset neworigin of all originOf[*]\n for (var _i in o.originOf) {\n var originsIn = yield* this.getOperation(o.originOf[_i])\n if (originsIn != null) {\n originsIn.origin = neworigin\n yield* this.setOperation(originsIn)\n }\n }\n if (neworigin != null) {\n if (neworigin_.originOf == null) {\n neworigin_.originOf = o.originOf\n } else {\n neworigin_.originOf = o.originOf.concat(neworigin_.originOf)\n }\n yield* this.setOperation(neworigin_)\n }\n // we don't need to set right here, because\n // right should be in o.originOf => it is set it the previous for loop\n } else {\n // we didn't need to reset the origin of right\n // so we have to set right here\n yield* this.setOperation(right)\n }\n }\n // o may originate in another operation.\n // Since o is deleted, we have to reset o.origin's `originOf` property\n if (o.origin != null) {\n var origin = yield* this.getInsertion(o.origin)\n origin.originOf = origin.originOf.filter(function (_id) {\n return !Y.utils.compareIds(id, _id)\n })\n yield* this.setOperation(origin)\n }\n var parent\n if (o.parent != null) {\n parent = yield* this.getOperation(o.parent)\n }\n // remove gc'd op from parent, if it exists\n if (parent != null) {\n var setParent = false // whether to save parent to the os\n if (o.parentSub != null) {\n if (Y.utils.compareIds(parent.map[o.parentSub], o.id)) {\n setParent = true\n if (o.right != null) {\n parent.map[o.parentSub] = o.right\n } else {\n delete parent.map[o.parentSub]\n }\n }\n } else {\n if (Y.utils.compareIds(parent.start, o.id)) {\n // gc'd op is the start\n setParent = true\n parent.start = o.right\n }\n if (Y.utils.matchesId(o, parent.end)) {\n // gc'd op is the end\n setParent = true\n parent.end = o.left\n }\n }\n if (setParent) {\n yield* this.setOperation(parent)\n }\n }\n // finally remove it from the os\n yield* this.removeOperation(o.id)\n }\n }\n * checkDeleteStoreForState (state) {\n var n = yield* this.ds.findWithUpperBound([state.user, state.clock])\n if (n != null && n.id[0] === state.user && n.gc) {\n state.clock = Math.max(state.clock, n.id[1] + n.len)\n }\n }\n * updateState (user) {\n var state = yield* this.getState(user)\n yield* this.checkDeleteStoreForState(state)\n var o = yield* this.getInsertion([user, state.clock])\n var oLength = (o != null && o.content != null) ? o.content.length : 1\n while (o != null && user === o.id[0] && o.id[1] <= state.clock && o.id[1] + oLength > state.clock) {\n // either its a new operation (1. case), or it is an operation that was deleted, but is not yet in the OS\n state.clock += oLength\n yield* this.checkDeleteStoreForState(state)\n o = yield* this.os.findNext(o.id)\n oLength = (o != null && o.content != null) ? o.content.length : 1\n }\n yield* this.setState(state)\n }\n /*\n apply a delete set in order to get\n the state of the supplied ds\n */\n * applyDeleteSet (ds) {\n var deletions = []\n\n for (var user in ds) {\n var dv = ds[user]\n var pos = 0\n var d = dv[pos]\n yield* this.ds.iterate(this, [user, 0], [user, Number.MAX_VALUE], function * (n) {\n // cases:\n // 1. d deletes something to the right of n\n // => go to next n (break)\n // 2. d deletes something to the left of n\n // => create deletions\n // => reset d accordingly\n // *)=> if d doesn't delete anything anymore, go to next d (continue)\n // 3. not 2) and d deletes something that also n deletes\n // => reset d so that it doesn't contain n's deletion\n // *)=> if d does not delete anything anymore, go to next d (continue)\n while (d != null) {\n var diff = 0 // describe the diff of length in 1) and 2)\n if (n.id[1] + n.len <= d[0]) {\n // 1)\n break\n } else if (d[0] < n.id[1]) {\n // 2)\n // delete maximum the len of d\n // else delete as much as possible\n diff = Math.min(n.id[1] - d[0], d[1])\n deletions.push([user, d[0], diff, d[2]])\n } else {\n // 3)\n diff = n.id[1] + n.len - d[0] // never null (see 1)\n if (d[2] && !n.gc) {\n // d marks as gc'd but n does not\n // then delete either way\n deletions.push([user, d[0], Math.min(diff, d[1]), d[2]])\n }\n }\n if (d[1] <= diff) {\n // d doesn't delete anything anymore\n d = dv[++pos]\n } else {\n d[0] = d[0] + diff // reset pos\n d[1] = d[1] - diff // reset length\n }\n }\n })\n // for the rest.. just apply it\n for (; pos < dv.length; pos++) {\n d = dv[pos]\n deletions.push([user, d[0], d[1], d[2]])\n }\n }\n for (var i = 0; i < deletions.length; i++) {\n var del = deletions[i]\n // always try to delete..\n yield* this.deleteOperation([del[0], del[1]], del[2])\n if (del[3]) {\n // gc..\n yield* this.markGarbageCollected([del[0], del[1]], del[2]) // always mark gc'd\n // remove operation..\n var counter = del[1] + del[2]\n while (counter >= del[1]) {\n var o = yield* this.os.findWithUpperBound([del[0], counter - 1])\n if (o == null) {\n break\n }\n var oLen = o.content != null ? o.content.length : 1\n if (o.id[0] !== del[0] || o.id[1] + oLen <= del[1]) {\n // not in range\n break\n }\n if (o.id[1] + oLen > del[1] + del[2]) {\n // overlaps right\n o = yield* this.getInsertionCleanEnd([del[0], del[1] + del[2] - 1])\n }\n if (o.id[1] < del[1]) {\n // overlaps left\n o = yield* this.getInsertionCleanStart([del[0], del[1]])\n }\n counter = o.id[1]\n yield* this.garbageCollectOperation(o.id)\n }\n }\n if (this.store.forwardAppliedOperations) {\n var ops = []\n ops.push({struct: 'Delete', target: [d[0], d[1]], length: del[2]})\n this.store.y.connector.broadcastOps(ops)\n }\n }\n }\n * isGarbageCollected (id) {\n var n = yield* this.ds.findWithUpperBound(id)\n return n != null && n.id[0] === id[0] && id[1] < n.id[1] + n.len && n.gc\n }\n /*\n A DeleteSet (ds) describes all the deleted ops in the OS\n */\n * getDeleteSet () {\n var ds = {}\n yield* this.ds.iterate(this, null, null, function * (n) {\n var user = n.id[0]\n var counter = n.id[1]\n var len = n.len\n var gc = n.gc\n var dv = ds[user]\n if (dv === void 0) {\n dv = []\n ds[user] = dv\n }\n dv.push([counter, len, gc])\n })\n return ds\n }\n * isDeleted (id) {\n var n = yield* this.ds.findWithUpperBound(id)\n return n != null && n.id[0] === id[0] && id[1] < n.id[1] + n.len\n }\n * setOperation (op) {\n yield* this.os.put(op)\n return op\n }\n * addOperation (op) {\n yield* this.os.put(op)\n if (!this.store.y.connector.isDisconnected() && this.store.forwardAppliedOperations && typeof op.id[1] !== 'string') {\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcastOps([op])\n }\n }\n // if insertion, try to combine with left insertion (if both have content property)\n * tryCombineWithLeft (op) {\n if (\n op != null &&\n op.left != null &&\n op.content != null &&\n op.left[0] === op.id[0] &&\n Y.utils.compareIds(op.left, op.origin)\n ) {\n var left = yield* this.getInsertion(op.left)\n if (left.content != null &&\n left.id[1] + left.content.length === op.id[1] &&\n left.originOf.length === 1 &&\n !left.gc && !left.deleted &&\n !op.gc && !op.deleted\n ) {\n // combine!\n if (op.originOf != null) {\n left.originOf = op.originOf\n } else {\n delete left.originOf\n }\n left.content = left.content.concat(op.content)\n left.right = op.right\n yield* this.os.delete(op.id)\n yield* this.setOperation(left)\n }\n }\n }\n * getInsertion (id) {\n var ins = yield* this.os.findWithUpperBound(id)\n if (ins == null) {\n return null\n } else {\n var len = ins.content != null ? ins.content.length : 1 // in case of opContent\n if (id[0] === ins.id[0] && id[1] < ins.id[1] + len) {\n return ins\n } else {\n return null\n }\n }\n }\n * getInsertionCleanStartEnd (id) {\n yield* this.getInsertionCleanStart(id)\n return yield* this.getInsertionCleanEnd(id)\n }\n // Return an insertion such that id is the first element of content\n // This function manipulates an operation, if necessary\n * getInsertionCleanStart (id) {\n var ins = yield* this.getInsertion(id)\n if (ins != null) {\n if (ins.id[1] === id[1]) {\n return ins\n } else {\n var left = Y.utils.copyObject(ins)\n ins.content = left.content.splice(id[1] - ins.id[1])\n ins.id = id\n var leftLid = Y.utils.getLastId(left)\n ins.origin = leftLid\n left.originOf = [ins.id]\n left.right = ins.id\n ins.left = leftLid\n // debugger // check\n yield* this.setOperation(left)\n yield* this.setOperation(ins)\n if (left.gc) {\n this.store.queueGarbageCollector(ins.id)\n }\n return ins\n }\n } else {\n return null\n }\n }\n // Return an insertion such that id is the last element of content\n // This function manipulates an operation, if necessary\n * getInsertionCleanEnd (id) {\n var ins = yield* this.getInsertion(id)\n if (ins != null) {\n if (ins.content == null || (ins.id[1] + ins.content.length - 1 === id[1])) {\n return ins\n } else {\n var right = Y.utils.copyObject(ins)\n right.content = ins.content.splice(id[1] - ins.id[1] + 1) // cut off remainder\n right.id = [id[0], id[1] + 1]\n var insLid = Y.utils.getLastId(ins)\n right.origin = insLid\n ins.originOf = [right.id]\n ins.right = right.id\n right.left = insLid\n // debugger // check\n yield* this.setOperation(right)\n yield* this.setOperation(ins)\n if (ins.gc) {\n this.store.queueGarbageCollector(right.id)\n }\n return ins\n }\n } else {\n return null\n }\n }\n * getOperation (id/* :any */)/* :Transaction */ {\n var o = yield* this.os.find(id)\n if (id[0] !== '_' || o != null) {\n return o\n } else { // type is string\n // generate this operation?\n var comp = id[1].split('_')\n if (comp.length > 1) {\n var struct = comp[0]\n var op = Y.Struct[struct].create(id)\n op.type = comp[1]\n yield* this.setOperation(op)\n return op\n } else {\n // won't be called. but just in case..\n console.error('Unexpected case. How can this happen?')\n debugger // eslint-disable-line\n return null\n }\n }\n }\n * removeOperation (id) {\n yield* this.os.delete(id)\n }\n * setState (state) {\n var val = {\n id: [state.user],\n clock: state.clock\n }\n yield* this.ss.put(val)\n }\n * getState (user) {\n var n = yield* this.ss.find([user])\n var clock = n == null ? null : n.clock\n if (clock == null) {\n clock = 0\n }\n return {\n user: user,\n clock: clock\n }\n }\n * getStateVector () {\n var stateVector = []\n yield* this.ss.iterate(this, null, null, function * (n) {\n stateVector.push({\n user: n.id[0],\n clock: n.clock\n })\n })\n return stateVector\n }\n * getStateSet () {\n var ss = {}\n yield* this.ss.iterate(this, null, null, function * (n) {\n ss[n.id[0]] = n.clock\n })\n return ss\n }\n /*\n Here, we make all missing operations executable for the receiving user.\n\n Notes:\n startSS: denotes to the SV that the remote user sent\n currSS: denotes to the state vector that the user should have if he\n applies all already sent operations (increases is each step)\n\n We face several problems:\n * Execute op as is won't work because ops depend on each other\n -> find a way so that they do not anymore\n * When changing left, must not go more to the left than the origin\n * When changing right, you have to consider that other ops may have op\n as their origin, this means that you must not set one of these ops\n as the new right (interdependencies of ops)\n * can't just go to the right until you find the first known operation,\n With currSS\n -> interdependency of ops is a problem\n With startSS\n -> leads to inconsistencies when two users join at the same time.\n Then the position depends on the order of execution -> error!\n\n Solution:\n -> re-create originial situation\n -> set op.left = op.origin (which never changes)\n -> set op.right\n to the first operation that is known (according to startSS)\n or to the first operation that has an origin that is not to the\n right of op.\n -> Enforces unique execution order -> happy user\n\n Improvements: TODO\n * Could set left to origin, or the first known operation\n (startSS or currSS.. ?)\n -> Could be necessary when I turn GC again.\n -> Is a bad(ish) idea because it requires more computation\n\n What we do:\n * Iterate over all missing operations.\n * When there is an operation, where the right op is known, send this op all missing ops to the left to the user\n * I explained above what we have to do with each operation. Here is how we do it efficiently:\n 1. Go to the left until you find either op.origin, or a known operation (let o denote current operation in the iteration)\n 2. Found a known operation -> set op.left = o, and send it to the user. stop\n 3. Found o = op.origin -> set op.left = op.origin, and send it to the user. start again from 1. (set op = o)\n 4. Found some o -> set o.right = op, o.left = o.origin, send it to the user, continue\n */\n * getOperations (startSS) {\n // TODO: use bounds here!\n if (startSS == null) {\n startSS = {}\n }\n var send = []\n\n var endSV = yield* this.getStateVector()\n for (var endState of endSV) {\n var user = endState.user\n if (user === '_') {\n continue\n }\n var startPos = startSS[user] || 0\n if (startPos > 0) {\n // There is a change that [user, startPos] is in a composed Insertion (with a smaller counter)\n // find out if that is the case\n var firstMissing = yield* this.getInsertion([user, startPos])\n if (firstMissing != null) {\n // update startPos\n startPos = firstMissing.id[1]\n }\n }\n yield* this.os.iterate(this, [user, startPos], [user, Number.MAX_VALUE], function * (op) {\n op = Y.Struct[op.struct].encode(op)\n if (op.struct !== 'Insert') {\n send.push(op)\n } else if (op.right == null || op.right[1] < (startSS[op.right[0]] || 0)) {\n // case 1. op.right is known\n var o = op\n // Remember: ?\n // -> set op.right\n // 1. to the first operation that is known (according to startSS)\n // 2. or to the first operation that has an origin that is not to the\n // right of op.\n // For this we maintain a list of ops which origins are not found yet.\n var missing_origins = [op]\n var newright = op.right\n while (true) {\n if (o.left == null) {\n op.left = null\n send.push(op)\n if (!Y.utils.compareIds(o.id, op.id)) {\n o = Y.Struct[op.struct].encode(o)\n o.right = missing_origins[missing_origins.length - 1].id\n send.push(o)\n }\n break\n }\n o = yield* this.getInsertion(o.left)\n // we set another o, check if we can reduce $missing_origins\n while (missing_origins.length > 0 && Y.utils.matchesId(o, missing_origins[missing_origins.length - 1].origin)) {\n missing_origins.pop()\n }\n if (o.id[1] < (startSS[o.id[0]] || 0)) {\n // case 2. o is known\n op.left = Y.utils.getLastId(o)\n send.push(op)\n break\n } else if (Y.utils.matchesId(o, op.origin)) {\n // case 3. o is op.origin\n op.left = op.origin\n send.push(op)\n op = Y.Struct[op.struct].encode(o)\n op.right = newright\n if (missing_origins.length > 0) {\n console.log('This should not happen .. :( please report this')\n }\n missing_origins = [op]\n } else {\n // case 4. send o, continue to find op.origin\n var s = Y.Struct[op.struct].encode(o)\n s.right = missing_origins[missing_origins.length - 1].id\n s.left = s.origin\n send.push(s)\n missing_origins.push(o)\n }\n }\n }\n })\n }\n return send.reverse()\n }\n /* this is what we used before.. use this as a reference..\n * makeOperationReady (startSS, op) {\n op = Y.Struct[op.struct].encode(op)\n op = Y.utils.copyObject(op) -- use copyoperation instead now!\n var o = op\n var ids = [op.id]\n // search for the new op.right\n // it is either the first known op (according to startSS)\n // or the o that has no origin to the right of op\n // (this is why we use the ids array)\n while (o.right != null) {\n var right = yield* this.getOperation(o.right)\n if (o.right[1] < (startSS[o.right[0]] || 0) || !ids.some(function (id) {\n return Y.utils.compareIds(id, right.origin)\n })) {\n break\n }\n ids.push(o.right)\n o = right\n }\n op.right = o.right\n op.left = op.origin\n return op\n }\n */\n * flush () {\n yield* this.os.flush()\n yield* this.ss.flush()\n yield* this.ds.flush()\n }\n }\n Y.Transaction = TransactionInterface\n}\n","/* @flow */\n'use strict'\n\n/*\n EventHandler is an helper class for constructing custom types.\n\n Why: When constructing custom types, you sometimes want your types to work\n synchronous: E.g.\n ``` Synchronous\n mytype.setSomething(\"yay\")\n mytype.getSomething() === \"yay\"\n ```\n versus\n ``` Asynchronous\n mytype.setSomething(\"yay\")\n mytype.getSomething() === undefined\n mytype.waitForSomething().then(function(){\n mytype.getSomething() === \"yay\"\n })\n ```\n\n The structures usually work asynchronously (you have to wait for the\n database request to finish). EventHandler helps you to make your type\n synchronous.\n*/\nmodule.exports = function (Y /* : any*/) {\n Y.utils = {}\n\n class EventListenerHandler {\n constructor () {\n this.eventListeners = []\n }\n destroy () {\n this.eventListeners = null\n }\n /*\n Basic event listener boilerplate...\n */\n addEventListener (f) {\n this.eventListeners.push(f)\n }\n removeEventListener (f) {\n this.eventListeners = this.eventListeners.filter(function (g) {\n return f !== g\n })\n }\n removeAllEventListeners () {\n this.eventListeners = []\n }\n callEventListeners (event) {\n for (var i = 0; i < this.eventListeners.length; i++) {\n try {\n this.eventListeners[i](event)\n } catch (e) {\n console.error('User events must not throw Errors!')\n }\n }\n }\n }\n Y.utils.EventListenerHandler = EventListenerHandler\n\n class EventHandler extends EventListenerHandler {\n /* ::\n waiting: Array;\n awaiting: number;\n onevent: Function;\n eventListeners: Array;\n */\n /*\n onevent: is called when the structure changes.\n\n Note: \"awaiting opertations\" is used to denote operations that were\n prematurely called. Events for received operations can not be executed until\n all prematurely called operations were executed (\"waiting operations\")\n */\n constructor (onevent /* : Function */) {\n super()\n this.waiting = []\n this.awaiting = 0\n this.onevent = onevent\n }\n destroy () {\n super.destroy()\n this.waiting = null\n this.awaiting = null\n this.onevent = null\n }\n /*\n Call this when a new operation arrives. It will be executed right away if\n there are no waiting operations, that you prematurely executed\n */\n receivedOp (op) {\n if (this.awaiting <= 0) {\n this.onevent(op)\n } else if (op.struct === 'Delete') {\n var self = this\n function checkDelete (d) {\n if (d.length == null) {\n throw new Error('This shouldn\\'t happen! d.length must be defined!')\n }\n // we check if o deletes something in self.waiting\n // if so, we remove the deleted operation\n for (var w = 0; w < self.waiting.length; w++) {\n var i = self.waiting[w]\n if (i.struct === 'Insert' && i.id[0] === d.target[0]) {\n var iLength = i.hasOwnProperty('content') ? i.content.length : 1\n var dStart = d.target[1]\n var dEnd = d.target[1] + (d.length || 1)\n var iStart = i.id[1]\n var iEnd = i.id[1] + iLength\n // Check if they don't overlap\n if (iEnd <= dStart || dEnd <= iStart) {\n // no overlapping\n continue\n }\n // we check all overlapping cases. All cases:\n /*\n 1) iiiii\n ddddd\n --> modify i and d\n 2) iiiiiii\n ddddd\n --> modify i, remove d\n 3) iiiiiii\n ddd\n --> remove d, modify i, and create another i (for the right hand side)\n 4) iiiii\n ddddddd\n --> remove i, modify d\n 5) iiiiiii\n ddddddd\n --> remove both i and d (**)\n 6) iiiiiii\n ddddd\n --> modify i, remove d\n 7) iii\n ddddddd\n --> remove i, create and apply two d with checkDelete(d) (**)\n 8) iiiii\n ddddddd\n --> remove i, modify d (**)\n 9) iiiii\n ddddd\n --> modify i and d\n (**) (also check if i contains content or type)\n */\n // TODO: I left some debugger statements, because I want to debug all cases once in production. REMEMBER END TODO\n if (iStart < dStart) {\n if (dStart < iEnd) {\n if (iEnd < dEnd) {\n // Case 1\n // remove the right part of i's content\n i.content.splice(dStart - iStart)\n // remove the start of d's deletion\n d.length = dEnd - iEnd\n d.target = [d.target[0], iEnd]\n continue\n } else if (iEnd === dEnd) {\n // Case 2\n i.content.splice(dStart - iStart)\n // remove d, we do that by simply ending this function\n return\n } else { // (dEnd < iEnd)\n // Case 3\n var newI = {\n id: [i.id[0], dEnd],\n content: i.content.slice(dEnd - iStart),\n struct: 'Insert'\n }\n self.waiting.push(newI)\n i.content.splice(dStart - iStart)\n return\n }\n }\n } else if (dStart === iStart) {\n if (iEnd < dEnd) {\n // Case 4\n d.length = dEnd - iEnd\n d.target = [d.target[0], iEnd]\n i.content = []\n continue\n } else if (iEnd === dEnd) {\n // Case 5\n self.waiting.splice(w, 1)\n return\n } else { // (dEnd < iEnd)\n // Case 6\n i.content = i.content.slice(dEnd - iStart)\n i.id = [i.id[0], dEnd]\n return\n }\n } else { // (dStart < iStart)\n if (iStart < dEnd) {\n // they overlap\n /*\n 7) iii\n ddddddd\n --> remove i, create and apply two d with checkDelete(d) (**)\n 8) iiiii\n ddddddd\n --> remove i, modify d (**)\n 9) iiiii\n ddddd\n --> modify i and d\n */\n if (iEnd < dEnd) {\n // Case 7\n debugger\n self.waiting.splice(w, 1)\n checkDelete({\n target: [d.target[0], dStart],\n length: iStart - dStart,\n struct: 'Delete'\n })\n checkDelete({\n target: [d.target[0], iEnd],\n length: iEnd - dEnd,\n struct: 'Delete'\n })\n return\n } else if (iEnd === dEnd) {\n // Case 8\n self.waiting.splice(w, 1)\n w--\n d.length -= iLength\n continue\n } else { // dEnd < iEnd\n // Case 9\n d.length = iStart - dStart\n i.content.splice(0, dEnd - iStart)\n i.id = [i.id[0], dEnd]\n continue\n }\n }\n }\n }\n }\n // finished with remaining operations\n self.waiting.push(d)\n }\n checkDelete(op)\n } else {\n this.waiting.push(op)\n }\n }\n /*\n You created some operations, and you want the `onevent` function to be\n called right away. Received operations will not be executed untill all\n prematurely called operations are executed\n */\n awaitAndPrematurelyCall (ops) {\n this.awaiting++\n ops.map(Y.utils.copyOperation).forEach(this.onevent)\n }\n * awaitOps (transaction, f, args) {\n function notSoSmartSort (array) {\n // this function sorts insertions in a executable order\n var result = []\n while (array.length > 0) {\n for (var i = 0; i < array.length; i++) {\n var independent = true\n for (var j = 0; j < array.length; j++) {\n if (Y.utils.matchesId(array[j], array[i].left)) {\n // array[i] depends on array[j]\n independent = false\n break\n }\n }\n if (independent) {\n result.push(array.splice(i, 1)[0])\n i--\n }\n }\n }\n return result\n }\n var before = this.waiting.length\n // somehow create new operations\n yield* f.apply(transaction, args)\n // remove all appended ops / awaited ops\n this.waiting.splice(before)\n if (this.awaiting > 0) this.awaiting--\n // if there are no awaited ops anymore, we can update all waiting ops, and send execute them (if there are still no awaited ops)\n if (this.awaiting === 0 && this.waiting.length > 0) {\n // update all waiting ops\n for (let i = 0; i < this.waiting.length; i++) {\n var o = this.waiting[i]\n if (o.struct === 'Insert') {\n var _o = yield* transaction.getInsertion(o.id)\n if (!Y.utils.compareIds(_o.id, o.id)) {\n // o got extended\n o.left = [o.id[0], o.id[1] - 1]\n } else if (_o.left == null) {\n o.left = null\n } else {\n // find next undeleted op\n var left = yield* transaction.getInsertion(_o.left)\n while (left.deleted != null) {\n if (left.left != null) {\n left = yield* transaction.getInsertion(left.left)\n } else {\n left = null\n break\n }\n }\n o.left = left != null ? Y.utils.getLastId(left) : null\n }\n }\n }\n // the previous stuff was async, so we have to check again!\n // We also pull changes from the bindings, if there exists such a method, this could increase awaiting too\n if (this._pullChanges != null) {\n this._pullChanges()\n }\n if (this.awaiting === 0) {\n // sort by type, execute inserts first\n var ins = []\n var dels = []\n this.waiting.forEach(function (o) {\n if (o.struct === 'Delete') {\n dels.push(o)\n } else {\n ins.push(o)\n }\n })\n this.waiting = []\n // put in executable order\n ins = notSoSmartSort(ins)\n // this.onevent can trigger the creation of another operation\n // -> check if this.awaiting increased & stop computation if it does\n for (var i = 0; i < ins.length; i++) {\n if (this.awaiting === 0) {\n this.onevent(ins[i])\n } else {\n this.waiting = this.waiting.concat(ins.slice(i))\n break\n }\n }\n for (var i = 0; i < dels.length; i++) {\n if (this.awaiting === 0) {\n this.onevent(dels[i])\n } else {\n this.waiting = this.waiting.concat(dels.slice(i))\n break\n }\n }\n }\n }\n }\n // TODO: Remove awaitedInserts and awaitedDeletes in favor of awaitedOps, as they are deprecated and do not always work\n // Do this in one of the coming releases that are breaking anyway\n /*\n Call this when you successfully awaited the execution of n Insert operations\n */\n awaitedInserts (n) {\n var ops = this.waiting.splice(this.waiting.length - n)\n for (var oid = 0; oid < ops.length; oid++) {\n var op = ops[oid]\n if (op.struct === 'Insert') {\n for (var i = this.waiting.length - 1; i >= 0; i--) {\n let w = this.waiting[i]\n // TODO: do I handle split operations correctly here? Super unlikely, but yeah..\n // Also: can this case happen? Can op be inserted in the middle of a larger op that is in $waiting?\n if (w.struct === 'Insert') {\n if (Y.utils.matchesId(w, op.left)) {\n // include the effect of op in w\n w.right = op.id\n // exclude the effect of w in op\n op.left = w.left\n } else if (Y.utils.compareIds(w.id, op.right)) {\n // similar..\n w.left = Y.utils.getLastId(op)\n op.right = w.right\n }\n }\n }\n } else {\n throw new Error('Expected Insert Operation!')\n }\n }\n this._tryCallEvents(n)\n }\n /*\n Call this when you successfully awaited the execution of n Delete operations\n */\n awaitedDeletes (n, newLeft) {\n var ops = this.waiting.splice(this.waiting.length - n)\n for (var j = 0; j < ops.length; j++) {\n var del = ops[j]\n if (del.struct === 'Delete') {\n if (newLeft != null) {\n for (var i = 0; i < this.waiting.length; i++) {\n let w = this.waiting[i]\n // We will just care about w.left\n if (w.struct === 'Insert' && Y.utils.compareIds(del.target, w.left)) {\n w.left = newLeft\n }\n }\n }\n } else {\n throw new Error('Expected Delete Operation!')\n }\n }\n this._tryCallEvents(n)\n }\n /* (private)\n Try to execute the events for the waiting operations\n */\n _tryCallEvents () {\n function notSoSmartSort (array) {\n var result = []\n while (array.length > 0) {\n for (var i = 0; i < array.length; i++) {\n var independent = true\n for (var j = 0; j < array.length; j++) {\n if (Y.utils.matchesId(array[j], array[i].left)) {\n // array[i] depends on array[j]\n independent = false\n break\n }\n }\n if (independent) {\n result.push(array.splice(i, 1)[0])\n i--\n }\n }\n }\n return result\n }\n if (this.awaiting > 0) this.awaiting--\n if (this.awaiting === 0 && this.waiting.length > 0) {\n var ins = []\n var dels = []\n this.waiting.forEach(function (o) {\n if (o.struct === 'Delete') {\n dels.push(o)\n } else {\n ins.push(o)\n }\n })\n ins = notSoSmartSort(ins)\n ins.forEach(this.onevent)\n dels.forEach(this.onevent)\n this.waiting = []\n }\n }\n }\n Y.utils.EventHandler = EventHandler\n\n /*\n A wrapper for the definition of a custom type.\n Every custom type must have three properties:\n\n * struct\n - Structname of this type\n * initType\n - Given a model, creates a custom type\n * class\n - the constructor of the custom type (e.g. in order to inherit from a type)\n */\n class CustomType { // eslint-disable-line\n /* ::\n struct: any;\n initType: any;\n class: Function;\n name: String;\n */\n constructor (def) {\n if (def.struct == null ||\n def.initType == null ||\n def.class == null ||\n def.name == null\n ) {\n throw new Error('Custom type was not initialized correctly!')\n }\n this.struct = def.struct\n this.initType = def.initType\n this.class = def.class\n this.name = def.name\n if (def.appendAdditionalInfo != null) {\n this.appendAdditionalInfo = def.appendAdditionalInfo\n }\n this.parseArguments = (def.parseArguments || function () {\n return [this]\n }).bind(this)\n this.parseArguments.typeDefinition = this\n }\n }\n Y.utils.CustomType = CustomType\n\n Y.utils.isTypeDefinition = function isTypeDefinition (v) {\n if (v != null) {\n if (v instanceof Y.utils.CustomType) return [v]\n else if (v.constructor === Array && v[0] instanceof Y.utils.CustomType) return v\n else if (v instanceof Function && v.typeDefinition instanceof Y.utils.CustomType) return [v.typeDefinition]\n }\n return false\n }\n\n /*\n Make a flat copy of an object\n (just copy properties)\n */\n function copyObject (o) {\n var c = {}\n for (var key in o) {\n c[key] = o[key]\n }\n return c\n }\n Y.utils.copyObject = copyObject\n\n /*\n Copy an operation, so that it can be manipulated.\n Note: You must not change subproperties (except o.content)!\n */\n function copyOperation (o) {\n o = copyObject(o)\n if (o.content != null) {\n o.content = o.content.map(function (c) { return c })\n }\n return o\n }\n\n Y.utils.copyOperation = copyOperation\n\n /*\n Defines a smaller relation on Id's\n */\n function smaller (a, b) {\n return a[0] < b[0] || (a[0] === b[0] && (a[1] < b[1] || typeof a[1] < typeof b[1]))\n }\n Y.utils.smaller = smaller\n\n function inDeletionRange (del, ins) {\n return del.target[0] === ins[0] && del.target[1] <= ins[1] && ins[1] < del.target[1] + (del.length || 1)\n }\n Y.utils.inDeletionRange = inDeletionRange\n\n function compareIds (id1, id2) {\n if (id1 == null || id2 == null) {\n return id1 === id2\n } else {\n return id1[0] === id2[0] && id1[1] === id2[1]\n }\n }\n Y.utils.compareIds = compareIds\n\n function matchesId (op, id) {\n if (id == null || op == null) {\n return id === op\n } else {\n if (id[0] === op.id[0]) {\n if (op.content == null) {\n return id[1] === op.id[1]\n } else {\n return id[1] >= op.id[1] && id[1] < op.id[1] + op.content.length\n }\n }\n }\n }\n Y.utils.matchesId = matchesId\n\n function getLastId (op) {\n if (op.content == null || op.content.length === 1) {\n return op.id\n } else {\n return [op.id[0], op.id[1] + op.content.length - 1]\n }\n }\n Y.utils.getLastId = getLastId\n\n function createEmptyOpsArray (n) {\n var a = new Array(n)\n for (var i = 0; i < a.length; i++) {\n a[i] = {\n id: [null, null]\n }\n }\n return a\n }\n\n function createSmallLookupBuffer (Store) {\n /*\n This buffer implements a very small buffer that temporarily stores operations\n after they are read / before they are written.\n The buffer basically implements FIFO. Often requested lookups will be re-queued every time they are looked up / written.\n\n It can speed up lookups on Operation Stores and State Stores. But it does not require notable use of memory or processing power.\n\n Good for os and ss, bot not for ds (because it often uses methods that require a flush)\n\n I tried to optimize this for performance, therefore no highlevel operations.\n */\n class SmallLookupBuffer extends Store {\n constructor (arg1, arg2) {\n // super(...arguments) -- do this when this is supported by stable nodejs\n super(arg1, arg2)\n this.writeBuffer = createEmptyOpsArray(5)\n this.readBuffer = createEmptyOpsArray(10)\n }\n * find (id, noSuperCall) {\n var i, r\n for (i = this.readBuffer.length - 1; i >= 0; i--) {\n r = this.readBuffer[i]\n // we don't have to use compareids, because id is always defined!\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n // found r\n // move r to the end of readBuffer\n for (; i < this.readBuffer.length - 1; i++) {\n this.readBuffer[i] = this.readBuffer[i + 1]\n }\n this.readBuffer[this.readBuffer.length - 1] = r\n return r\n }\n }\n var o\n for (i = this.writeBuffer.length - 1; i >= 0; i--) {\n r = this.writeBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n o = r\n break\n }\n }\n if (i < 0 && noSuperCall === undefined) {\n // did not reach break in last loop\n // read id and put it to the end of readBuffer\n o = yield* super.find(id)\n }\n if (o != null) {\n for (i = 0; i < this.readBuffer.length - 1; i++) {\n this.readBuffer[i] = this.readBuffer[i + 1]\n }\n this.readBuffer[this.readBuffer.length - 1] = o\n }\n return o\n }\n * put (o) {\n var id = o.id\n var i, r // helper variables\n for (i = this.writeBuffer.length - 1; i >= 0; i--) {\n r = this.writeBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n // is already in buffer\n // forget r, and move o to the end of writeBuffer\n for (; i < this.writeBuffer.length - 1; i++) {\n this.writeBuffer[i] = this.writeBuffer[i + 1]\n }\n this.writeBuffer[this.writeBuffer.length - 1] = o\n break\n }\n }\n if (i < 0) {\n // did not reach break in last loop\n // write writeBuffer[0]\n var write = this.writeBuffer[0]\n if (write.id[0] !== null) {\n yield* super.put(write)\n }\n // put o to the end of writeBuffer\n for (i = 0; i < this.writeBuffer.length - 1; i++) {\n this.writeBuffer[i] = this.writeBuffer[i + 1]\n }\n this.writeBuffer[this.writeBuffer.length - 1] = o\n }\n // check readBuffer for every occurence of o.id, overwrite if found\n // whether found or not, we'll append o to the readbuffer\n for (i = 0; i < this.readBuffer.length - 1; i++) {\n r = this.readBuffer[i + 1]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n this.readBuffer[i] = o\n } else {\n this.readBuffer[i] = r\n }\n }\n this.readBuffer[this.readBuffer.length - 1] = o\n }\n * delete (id) {\n var i, r\n for (i = 0; i < this.readBuffer.length; i++) {\n r = this.readBuffer[i]\n if (r.id[1] === id[1] && r.id[0] === id[0]) {\n this.readBuffer[i] = {\n id: [null, null]\n }\n }\n }\n yield* this.flush()\n yield* super.delete(id)\n }\n * findWithLowerBound (id) {\n var o = yield* this.find(id, true)\n if (o != null) {\n return o\n } else {\n yield* this.flush()\n return yield* super.findWithLowerBound.apply(this, arguments)\n }\n }\n * findWithUpperBound (id) {\n var o = yield* this.find(id, true)\n if (o != null) {\n return o\n } else {\n yield* this.flush()\n return yield* super.findWithUpperBound.apply(this, arguments)\n }\n }\n * findNext () {\n yield* this.flush()\n return yield* super.findNext.apply(this, arguments)\n }\n * findPrev () {\n yield* this.flush()\n return yield* super.findPrev.apply(this, arguments)\n }\n * iterate () {\n yield* this.flush()\n yield* super.iterate.apply(this, arguments)\n }\n * flush () {\n for (var i = 0; i < this.writeBuffer.length; i++) {\n var write = this.writeBuffer[i]\n if (write.id[0] !== null) {\n yield* super.put(write)\n this.writeBuffer[i] = {\n id: [null, null]\n }\n }\n }\n }\n }\n return SmallLookupBuffer\n }\n Y.utils.createSmallLookupBuffer = createSmallLookupBuffer\n}\n","/* @flow */\n'use strict'\n\nrequire('./Connector.js')(Y)\nrequire('./Database.js')(Y)\nrequire('./Transaction.js')(Y)\nrequire('./Struct.js')(Y)\nrequire('./Utils.js')(Y)\nrequire('./Connectors/Test.js')(Y)\n\nvar requiringModules = {}\n\nmodule.exports = Y\nY.requiringModules = requiringModules\n\nY.extend = function (name, value) {\n if (value instanceof Y.utils.CustomType) {\n Y[name] = value.parseArguments\n } else {\n Y[name] = value\n }\n if (requiringModules[name] != null) {\n requiringModules[name].resolve()\n delete requiringModules[name]\n }\n}\n\nY.requestModules = requestModules\nfunction requestModules (modules) {\n // determine if this module was compiled for es5 or es6 (y.js vs. y.es6)\n // if Insert.execute is a Function, then it isnt a generator..\n // then load the es5(.js) files..\n var extention = typeof regeneratorRuntime !== 'undefined' ? '.js' : '.es6'\n var promises = []\n for (var i = 0; i < modules.length; i++) {\n var module = modules[i].split('(')[0]\n var modulename = 'y-' + module.toLowerCase()\n if (Y[module] == null) {\n if (requiringModules[module] == null) {\n // module does not exist\n if (typeof window !== 'undefined' && window.Y !== 'undefined') {\n var imported = document.createElement('script')\n imported.src = Y.sourceDir + '/' + modulename + '/' + modulename + extention\n document.head.appendChild(imported)\n\n let requireModule = {}\n requiringModules[module] = requireModule\n requireModule.promise = new Promise(function (resolve) {\n requireModule.resolve = resolve\n })\n promises.push(requireModule.promise)\n } else {\n console.info('YJS: Please do not depend on automatic requiring of modules anymore! Extend modules as follows `require(\\'y-modulename\\')(Y)`')\n require(modulename)(Y)\n }\n } else {\n promises.push(requiringModules[modules[i]].promise)\n }\n }\n }\n return Promise.all(promises)\n}\n\n/* ::\ntype MemoryOptions = {\n name: 'memory'\n}\ntype IndexedDBOptions = {\n name: 'indexeddb',\n namespace: string\n}\ntype DbOptions = MemoryOptions | IndexedDBOptions\n\ntype WebRTCOptions = {\n name: 'webrtc',\n room: string\n}\ntype WebsocketsClientOptions = {\n name: 'websockets-client',\n room: string\n}\ntype ConnectionOptions = WebRTCOptions | WebsocketsClientOptions\n\ntype YOptions = {\n connector: ConnectionOptions,\n db: DbOptions,\n types: Array,\n sourceDir: string,\n share: {[key: string]: TypeName}\n}\n*/\n\nfunction Y (opts/* :YOptions */) /* :Promise */ {\n opts.types = opts.types != null ? opts.types : []\n var modules = [opts.db.name, opts.connector.name].concat(opts.types)\n for (var name in opts.share) {\n modules.push(opts.share[name])\n }\n Y.sourceDir = opts.sourceDir\n return new Promise(function (resolve, reject) {\n setTimeout(function () {\n Y.requestModules(modules).then(function () {\n if (opts == null) reject('An options object is expected! ')\n else if (opts.connector == null) reject('You must specify a connector! (missing connector property)')\n else if (opts.connector.name == null) reject('You must specify connector name! (missing connector.name property)')\n else if (opts.db == null) reject('You must specify a database! (missing db property)')\n else if (opts.connector.name == null) reject('You must specify db name! (missing db.name property)')\n else if (opts.share == null) reject('You must specify a set of shared types!')\n else {\n var yconfig = new YConfig(opts)\n yconfig.db.whenUserIdSet(function () {\n yconfig.init(function () {\n resolve(yconfig)\n })\n })\n }\n }).catch(reject)\n }, 0)\n })\n}\n\nclass YConfig {\n /* ::\n db: Y.AbstractDatabase;\n connector: Y.AbstractConnector;\n share: {[key: string]: any};\n options: Object;\n */\n constructor (opts, callback) {\n this.options = opts\n this.db = new Y[opts.db.name](this, opts.db)\n this.connector = new Y[opts.connector.name](this, opts.connector)\n }\n init (callback) {\n var opts = this.options\n var share = {}\n this.share = share\n this.db.requestTransaction(function * requestTransaction () {\n // create shared object\n for (var propertyname in opts.share) {\n var typeConstructor = opts.share[propertyname].split('(')\n var typeName = typeConstructor.splice(0, 1)\n var args = []\n if (typeConstructor.length === 1) {\n try {\n args = JSON.parse('[' + typeConstructor[0].split(')')[0] + ']')\n } catch (e) {\n throw new Error('Was not able to parse type definition! (share.' + propertyname + ')')\n }\n }\n var type = Y[typeName]\n var typedef = type.typeDefinition\n var id = ['_', typedef.struct + '_' + typeName + '_' + propertyname + '_' + typeConstructor]\n share[propertyname] = yield* this.createType(type.apply(typedef, args), id)\n }\n this.store.whenTransactionsFinished()\n .then(callback)\n })\n }\n isConnected () {\n return this.connector.isSynced\n }\n disconnect () {\n return this.connector.disconnect()\n }\n reconnect () {\n return this.connector.reconnect()\n }\n destroy () {\n if (this.connector.destroy != null) {\n this.connector.destroy()\n } else {\n this.connector.disconnect()\n }\n var self = this\n this.db.requestTransaction(function * () {\n yield* self.db.destroy()\n self.connector = null\n self.db = null\n })\n }\n}\n\nif (typeof window !== 'undefined') {\n window.Y = Y\n}\n"]} \ No newline at end of file