From 08f0702fcde82f22663752d3b8e31803f819c094 Mon Sep 17 00:00:00 2001 From: Kevin Jahns Date: Wed, 2 Dec 2015 20:04:11 +0100 Subject: [PATCH] update port --- Examples/Jigsaw/index.html | 2 +- Examples/Jigsaw/index.js | 2 +- Examples/Textarea/index.html | 2 +- Examples/Textarea/index.js | 4 +++- y.es6 | 34 ++++++++++++---------------- y.es6.map | 2 +- y.js | 44 ++++++++++++++++-------------------- y.js.map | 2 +- 8 files changed, 43 insertions(+), 49 deletions(-) diff --git a/Examples/Jigsaw/index.html b/Examples/Jigsaw/index.html index 520d7cd4..f1ce439e 100644 --- a/Examples/Jigsaw/index.html +++ b/Examples/Jigsaw/index.html @@ -17,7 +17,7 @@ - + diff --git a/Examples/Jigsaw/index.js b/Examples/Jigsaw/index.js index 148f01c3..32bd3c94 100644 --- a/Examples/Jigsaw/index.js +++ b/Examples/Jigsaw/index.js @@ -7,9 +7,9 @@ Y({ name: 'memory' }, connector: { - url: 'http://127.0.0.1:1234', name: 'websockets-client', room: 'Puzzle-example2', + url: 'http://127.0.0.1:2345', debug: true }, sourceDir: '/bower_components', diff --git a/Examples/Textarea/index.html b/Examples/Textarea/index.html index cf2d2961..2b2123a8 100644 --- a/Examples/Textarea/index.html +++ b/Examples/Textarea/index.html @@ -3,7 +3,7 @@ - + diff --git a/Examples/Textarea/index.js b/Examples/Textarea/index.js index 2f1e7ae2..8059e6da 100644 --- a/Examples/Textarea/index.js +++ b/Examples/Textarea/index.js @@ -7,7 +7,9 @@ Y({ }, connector: { name: 'websockets-client', - room: 'Textarea-example' + room: 'Textarea-example', + url: 'http://127.0.0.1:2345', + debug: true }, sourceDir: '/bower_components', share: { diff --git a/y.es6 b/y.es6 index 8c8e0680..b672f78f 100644 --- a/y.es6 +++ b/y.es6 @@ -1814,7 +1814,7 @@ module.exports = function (Y/* :any */) { } * addOperation (op) { yield* this.os.put(op) - if (!this.store.y.connector.isDisconnected() && this.store.forwardAppliedOperations) { + if (!this.store.y.connector.isDisconnected() && this.store.forwardAppliedOperations && op.id[0] !== '_') { // is connected, and this is not going to be send in addOperation this.store.y.connector.broadcast({ type: 'update', @@ -2223,30 +2223,26 @@ 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 = Y.Struct.Insert.execute.constructor === Function ? '.js' : '.es6' + var extention = typeof regeneratorRuntime !== 'undefined' ? '.js' : '.es6' var promises = [] for (var i = 0; i < modules.length; i++) { var modulename = 'y-' + modules[i].toLowerCase() if (Y[modules[i]] == null) { if (requiringModules[modules[i]] == null) { - try { - require(modulename)(Y) - } catch (e) { - // module does not exist - if (typeof window !== 'undefined') { - var imported = document.createElement('script') - imported.src = Y.sourceDir + '/' + modulename + '/' + modulename + extention - document.head.appendChild(imported) + // module does not exist + if (typeof window !== 'undefined' && window.Y !== 'undefined') { + var imported = document.createElement('script') + imported.src = Y.sourceDir + '/' + modulename + '/' + modulename + extention + document.head.appendChild(imported) - let requireModule = {} - requiringModules[modules[i]] = requireModule - requireModule.promise = new Promise(function (resolve) { - requireModule.resolve = resolve - }) - promises.push(requireModule.promise) - } else { - throw e - } + let requireModule = {} + requiringModules[modules[i]] = requireModule + requireModule.promise = new Promise(function (resolve) { + requireModule.resolve = resolve + }) + promises.push(requireModule.promise) + } else { + require(modulename)(Y) } } else { promises.push(requiringModules[modules[i]].promise) diff --git a/y.es6.map b/y.es6.map index c184944d..fdaa294a 100644 --- a/y.es6.map +++ b/y.es6.map @@ -1 +1 @@ -{"version":3,"sources":["node_modules/browserify/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;;AC9WA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5IA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5ZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjVA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjsBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;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 */\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 }\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 this.userId = userId\n return this.y.db.setUserId(userId)\n }\n onUserEvent (f) {\n this.userEventListeners.push(f)\n }\n userLeft (user) {\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 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 if (syncUser != null) {\n var conn = this\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 })\n })\n } else {\n this.isSynced = true\n // call when synced listeners\n for (var f of this.whenSyncedListeners) {\n f()\n }\n this.whenSyncedListeners = []\n this.y.db.requestTransaction(function *() {\n yield* this.garbageCollectAfterSync()\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 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.type === 'sync step 1') {\n // TODO: make transaction, stream the ops\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 })\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 var update /* :MessageUpdate */ = {\n type: 'update',\n ops: ops\n }\n if (!broadcastHB) { // TODO: consider to broadcast here..\n conn.send(sender, update)\n } else {\n // broadcast only once!\n conn.broadcast(update)\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.broadcast({\n type: 'update',\n ops: delops\n })\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: {},\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 i in globalRoom.buffers) {\n if (globalRoom.buffers[i].length > 0) {\n bufs.push(i)\n }\n }\n if (bufs.length > 0) {\n var userId = getRandom(bufs)\n var m = globalRoom.buffers[userId].shift()\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 }, 10)\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 buffer.push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n broadcast (message) {\n for (var key in globalRoom.buffers) {\n globalRoom.buffers[key].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 while (globalRoom.buffers[self.userId].length > 0) {\n var m = globalRoom.buffers[self.userId].shift()\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 // 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.whenUserIdSetListener = null\n this.waitingTransactions = []\n this.transactionInProgress = 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 || 5000\n var os = this\n function garbageCollect () {\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 if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n resolve()\n })\n })\n }\n this.garbageCollect = garbageCollect\n if (this.gcTimeout > 0) {\n garbageCollect()\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 delete op.gc\n yield* this.setOperation(op)\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 this.y.connector.isSynced &&\n left != null &&\n left.deleted === true\n ) {\n op.gc = true\n this.gc1.push(op.id)\n return true\n } else {\n return false\n }\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 }\n setUserId (userId) {\n var self = this\n return new Promise(function (resolve) {\n self.requestTransaction(function * () {\n self.userId = userId\n var state = yield* this.getState(userId)\n self.opClock = state.clock\n if (self.whenUserIdSetListener != null) {\n self.whenUserIdSetListener()\n self.whenUserIdSetListener = null\n }\n resolve()\n })\n })\n }\n whenUserIdSet (f) {\n if (this.userId != null) {\n f()\n } else {\n this.whenUserIdSetListener = f\n }\n }\n getNextOpId () {\n if (this._nextUserId != null) {\n return this._nextUserId\n } else if (this.userId == null) {\n throw new Error('OperationStore not yet initialized!')\n } else {\n return [this.userId, this.opClock++]\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 key in ops) {\n var o = ops[key]\n var required = Y.Struct[o.struct].requiredOps(o)\n this.whenOperationsExist(required, o)\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 key in ids) {\n let id = ids[key]\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 = yield* this.getOperation(id)\n if (op == null) {\n store.listenersById[sid] = l\n } else {\n for (let key in l) {\n let listener = l[key]\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 yield* this.store.operationAdded(this, op)\n } else {\n var defined = yield* this.getOperation(op.id)\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 }\n }\n }\n // called by a transaction when an operation is added\n * operationAdded (transaction, op) {\n if (op.struct === 'Delete') {\n var target = yield* transaction.getOperation(op.target)\n if (target != null) {\n var type = transaction.store.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(transaction, {\n struct: 'Delete',\n target: op.target\n })\n }\n }\n } else {\n // increase SS\n var o = op\n var state = yield* transaction.getState(op.id[0])\n while (o != null && o.id[1] === state.clock && op.id[0] === o.id[0]) {\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++\n yield* transaction.checkDeleteStoreForState(state)\n o = yield* transaction.os.findNext(o.id)\n }\n yield* transaction.setState(state)\n\n // notify whenOperation listeners (by id)\n var sid = JSON.stringify(op.id)\n var l = this.listenersById[sid]\n delete this.listenersById[sid]\n\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 var t = this.initializedTypes[JSON.stringify(op.parent)]\n\n // Delete if DS says this is actually deleted\n var opIsDeleted = yield* transaction.isDeleted(op.id)\n if (!op.deleted && opIsDeleted) {\n var delop = {\n struct: 'Delete',\n target: op.id\n }\n yield* Y.Struct['Delete'].execute.call(transaction, delop)\n }\n\n // notify parent, if it has been initialized as a custom type\n if (t != null) {\n yield* t._changed(transaction, Y.utils.copyObject(op))\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 getNextRequest () {\n if (this.waitingTransactions.length === 0) {\n this.transactionInProgress = false\n if (this.transactionsFinished != null) {\n this.transactionsFinished.resolve()\n this.transactionsFinished = null\n }\n return null\n } else {\n return this.waitingTransactions.shift()\n }\n }\n requestTransaction (makeGen/* :any */, callImmediately) {\n if (true || callImmediately) { // TODO: decide whether this is ok or not..\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n this.transact(this.getNextRequest())\n }\n } else {\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n var self = this\n setTimeout(function () {\n self.transact(self.getNextRequest())\n }, 0)\n }\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)\n }\n },\n Insert: {\n /* {\n content: any,\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.opContent != null) {\n e.opContent = op.opContent\n } else {\n e.content = op.content\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.getOperation(op.left)\n while (!Y.utils.compareIds(op.origin, (o ? o.id : null))) {\n d++\n if (o.left == null) {\n break\n } else {\n o = yield* this.getOperation(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 var distanceToOrigin = i = yield* Struct.Insert.getDistanceToOrigin.call(this, op) // most cases: 0 (starts from 0)\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.getOperation(op.left)\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 // 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 = o.id\n distanceToOrigin = i + 1\n }\n } else if (oOriginDistance < i) {\n // case 2\n if (i - distanceToOrigin <= oOriginDistance) {\n op.left = o.id\n distanceToOrigin = i + 1\n }\n } else {\n break\n }\n i++\n if (o.right != null) {\n o = yield* this.getOperation(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.getOperation(op.left)\n op.right = left.right\n left.right = op.id\n\n yield* this.setOperation(left)\n } else {\n op.right = op.parentSub ? parent.map[op.parentSub] || null : parent.start\n }\n // reconnect right\n if (op.right != null) {\n right = yield* this.getOperation(op.right)\n right.left = op.id\n\n // if right exists, and it is supposed to be gc'd. Remove it from the gc\n if (right.gc != null) {\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 if (op.right != null) {\n yield* this.deleteOperation(op.right, true)\n }\n if (op.left != null) {\n yield* this.deleteOperation(op.id, true)\n }\n } else {\n if (right == null || left == null) {\n if (right == null) {\n parent.end = op.id\n }\n if (left == null) {\n parent.start = op.id\n }\n yield* this.setOperation(parent)\n }\n }\n }\n },\n List: {\n /*\n {\n start: null,\n end: null,\n struct: \"List\",\n type: \"\",\n id: this.os.getNextOpId()\n }\n */\n encode: function (op) {\n return {\n struct: 'List',\n id: op.id,\n type: op.type\n }\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()\n }\n */\n encode: function (op) {\n return {\n struct: 'Map',\n type: op.type,\n id: op.id,\n map: {} // overwrite map!!\n }\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\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) {\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].initType.call(this, this.store, op)\n this.store.initializedTypes[sid] = t\n }\n }\n return t\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 send.push(Y.Struct[op.struct].encode(op))\n }\n if (!this.store.y.connector.isDisconnected()) { // 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.broadcast({\n type: 'update',\n ops: send\n })\n }\n }\n\n * deleteList (start) {\n if (this.store.y.connector.isSynced) {\n while (start != null && this.store.y.connector.isSynced) {\n start = yield* this.getOperation(start)\n start.gc = true\n yield* this.setOperation(start)\n // TODO: will always reset the parent..\n this.store.gc1.push(start.id)\n start = start.right\n }\n } else {\n // TODO: when not possible??? do later in (gcWhenSynced)\n }\n }\n\n /*\n Mark an operation as deleted, and add it to the GC, if possible.\n */\n * deleteOperation (targetId, preventCallType) /* :Generator */ {\n var target = yield* this.getOperation(targetId)\n var callType = false\n\n if (target == null || !target.deleted) {\n yield* this.markDeleted(targetId)\n }\n\n if (target != null && target.gc == null) {\n if (!target.deleted) {\n callType = true\n // set deleted & notify type\n target.deleted = true\n /*\n if (!preventCallType) {\n var type = this.store.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(this, {\n struct: 'Delete',\n target: targetId\n })\n }\n }\n */\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)\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)\n }\n if (target.opContent != null) {\n yield* this.deleteOperation(target.opContent)\n target.opContent = null\n }\n }\n var left\n if (target.left != null) {\n left = yield* this.getOperation(target.left)\n } else {\n left = null\n }\n\n this.store.addToGarbageCollector(target, left)\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 (\n right != null &&\n this.store.addToGarbageCollector(right, target)\n ) {\n yield* this.setOperation(right)\n }\n return callType\n }\n }\n /*\n Mark an operation as deleted&gc'd\n */\n * markGarbageCollected (id) {\n // this.mem.push([\"gc\", id]);\n var n = yield* this.markDeleted(id)\n if (!n.gc) {\n if (n.id[1] < id[1]) {\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] < n.id[1] + n.len - 1) {\n // un-extend right\n yield* this.ds.put({id: [id[0], id[1] + 1], len: n.len - 1, gc: false})\n n.len = 1\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 }\n }\n /*\n Mark an operation as deleted.\n\n returns the delete node\n */\n * markDeleted (id) {\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 // already deleted\n return n\n } else if (n.id[1] + n.len === id[1] && !n.gc) {\n // can extend existing deletion\n n.len++\n } else {\n // cannot extend left\n n = {id: id, len: 1, gc: false}\n yield* this.ds.put(n)\n }\n } else {\n // cannot extend left\n n = {id: id, len: 1, 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 Y.utils.compareIds([n.id[0], n.id[1] + n.len], next.id) &&\n !next.gc\n ) {\n n.len = n.len + next.len\n yield* this.ds.delete(next.id)\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 yield* this.os.iterate(this, null, null, function * (op) {\n if (op.deleted && op.left != null) {\n var left = yield* this.getOperation(op.left)\n this.store.addToGarbageCollector(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 // check to increase the state of the respective user\n var state = yield* this.getState(id[0])\n if (state.clock === id[1]) {\n state.clock++\n // also check if more expected operations were gc'd\n yield* this.checkDeleteStoreForState(state)\n // then set the state\n yield* this.setState(state)\n }\n yield* this.markGarbageCollected(id)\n\n // if op exists, then clean that mess up..\n var o = yield* this.getOperation(id)\n if (o != null) {\n /*\n if (!o.deleted) {\n yield* this.deleteOperation(id)\n o = yield* this.getOperation(id)\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.getOperation(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 if (Y.utils.compareIds(right.origin, o.id)) { // rights origin is o\n // find new origin of right ops\n // origin is the first left deleted operation\n var neworigin = o.left\n while (neworigin != null) {\n var neworigin_ = yield* this.getOperation(neworigin)\n if (neworigin_.deleted) {\n break\n }\n neworigin = neworigin_.left\n }\n\n // reset origin of right\n right.origin = neworigin\n\n // reset origin of all right ops (except first right - duh!),\n // 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 i = yield* this.getOperation(i.right)\n }\n }\n }\n } /* otherwise, rights origin is to the left of o,\n then there is no right op (from o), that origins in o */\n yield* this.setOperation(right)\n }\n\n if (o.parent != null) {\n // remove gc'd op from parent, if it exists\n var parent /* MapOperation */ = yield* this.getOperation(o.parent)\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 parent.map[o.parentSub] = o.right\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.compareIds(parent.end, o.id)) {\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 /*\n apply a delete set in order to get\n the state of the supplied ds\n */\n * applyDeleteSet (ds) {\n var deletions = []\n function createDeletions (user, start, len, gc) {\n for (var c = start; c < start + len; c++) {\n deletions.push([user, c, gc])\n }\n }\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 createDeletions(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 createDeletions(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 createDeletions(user, d[0], d[1], d[2])\n }\n }\n for (var i = 0; i < deletions.length; i++) {\n var del = deletions[i]\n var id = [del[0], del[1]]\n // always try to delete..\n var addOperation = yield* this.deleteOperation(id)\n if (addOperation) {\n // TODO:.. really .. here? You could prevent calling all these functions in operationAdded\n yield* this.store.operationAdded(this, {struct: 'Delete', target: id})\n }\n if (del[2]) {\n // gc\n yield* this.garbageCollectOperation(id)\n }\n }\n if (this.store.forwardAppliedOperations) {\n var ops = deletions.map(function (d) {\n return {struct: 'Delete', target: [d[0], d[1]]}\n })\n this.store.y.connector.broadcast({\n type: 'update',\n ops: 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) {\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcast({\n type: 'update',\n ops: [op]\n })\n }\n }\n * getOperation (id/* :any */)/* :Transaction */ {\n var o = yield* this.os.find(id)\n if (o != null || id[0] !== '_') {\n return o\n } else {\n // need to generate this operation\n if (this.store._nextUserId == null) {\n var typename = id[1].split('_')[0]\n this.store._nextUserId = id\n yield* Y[typename].createType.call(this)\n delete this.store._nextUserId\n return yield* this.os.find(id)\n } else {\n // Can only generate one operation at a time\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 * getOperations (startSS) {\n // TODO: use bounds here!\n if (startSS == null) {\n startSS = {}\n }\n var ops = []\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\n yield* this.os.iterate(this, [user, startPos], [user, Number.MAX_VALUE], function * (op) {\n ops.push(op)\n })\n }\n var res = []\n for (var op of ops) {\n var o = yield* this.makeOperationReady(startSS, op)\n res.push(o)\n }\n return res\n }\n /*\n Here, we make op 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 * makeOperationReady (startSS, op) {\n op = Y.Struct[op.struct].encode(op)\n op = Y.utils.copyObject(op)\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 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 will help you to make your type\n synchronous.\n*/\nmodule.exports = function (Y /* : any*/) {\n Y.utils = {}\n\n class EventHandler {\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 this.waiting = []\n this.awaiting = 0\n this.onevent = onevent\n this.eventListeners = []\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(Y.utils.copyObject(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 this.onevent(ops)\n }\n /*\n Basic event listener boilerplate...\n TODO: maybe put this in a different type..\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.log('User events must not throw Errors!') // eslint-disable-line\n }\n }\n }\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 if (w.struct === 'Insert') {\n if (Y.utils.compareIds(op.left, w.id)) {\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(op.right, w.id)) {\n // similar..\n w.left = op.id\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 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 /* (private)\n Try to execute the events for the waiting operations\n */\n _tryCallEvents () {\n this.awaiting--\n if (this.awaiting <= 0 && this.waiting.length > 0) {\n var events = this.waiting\n this.waiting = []\n this.onevent(events)\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 * createType\n - Defines the model of a newly created custom type and returns the 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 createType: any;\n initType: any;\n class: Function;\n */\n constructor (def) {\n if (def.createType == null ||\n def.initType == null ||\n def.class == null\n ) {\n throw new Error('Custom type was not initialized correctly!')\n }\n this.createType = def.createType\n this.initType = def.initType\n this.class = def.class\n }\n }\n Y.utils.CustomType = CustomType\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 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])\n }\n Y.utils.smaller = smaller\n\n function compareIds (id1, id2) {\n if (id1 == null || id2 == null) {\n if (id1 == null && id2 == null) {\n return true\n }\n return false\n }\n if (id1[0] === id2[0] && id1[1] === id2[1]) {\n return true\n } else {\n return false\n }\n }\n Y.utils.compareIds = compareIds\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\n\nY.extend = function (name, value) {\n Y[name] = value\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 = Y.Struct.Insert.execute.constructor === Function ? '.js' : '.es6'\n var promises = []\n for (var i = 0; i < modules.length; i++) {\n var modulename = 'y-' + modules[i].toLowerCase()\n if (Y[modules[i]] == null) {\n if (requiringModules[modules[i]] == null) {\n try {\n require(modulename)(Y)\n } catch (e) {\n // module does not exist\n if (typeof window !== '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[modules[i]] = requireModule\n requireModule.promise = new Promise(function (resolve) {\n requireModule.resolve = resolve\n })\n promises.push(requireModule.promise)\n } else {\n throw e\n }\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 Y.requestModules(modules).then(function () {\n return new Promise(function (resolve) {\n var yconfig = new YConfig(opts, function () {\n yconfig.db.whenUserIdSet(function () {\n resolve(yconfig)\n })\n })\n })\n })\n}\n\nclass YConfig {\n /* ::\n db: Y.AbstractDatabase;\n connector: Y.AbstractConnector;\n share: {[key: string]: any};\n */\n constructor (opts, callback) {\n this.db = new Y[opts.db.name](this, opts.db)\n this.connector = new Y[opts.connector.name](this, opts.connector)\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 share[propertyname] = yield* this.getType(['_', opts.share[propertyname] + '_' + propertyname])\n }\n setTimeout(callback, 0)\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 this.disconnect()\n this.db.destroy()\n this.connector = null\n this.db = null\n }\n}\n\nif (typeof window !== 'undefined') {\n window.Y = Y\n}\n"]} \ No newline at end of file +{"version":3,"sources":["node_modules/browserify/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;;AC9WA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5IA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AC5ZA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjVA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjsBA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;ACjOA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;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 */\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 }\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 this.userId = userId\n return this.y.db.setUserId(userId)\n }\n onUserEvent (f) {\n this.userEventListeners.push(f)\n }\n userLeft (user) {\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 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 if (syncUser != null) {\n var conn = this\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 })\n })\n } else {\n this.isSynced = true\n // call when synced listeners\n for (var f of this.whenSyncedListeners) {\n f()\n }\n this.whenSyncedListeners = []\n this.y.db.requestTransaction(function *() {\n yield* this.garbageCollectAfterSync()\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 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.type === 'sync step 1') {\n // TODO: make transaction, stream the ops\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 })\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 var update /* :MessageUpdate */ = {\n type: 'update',\n ops: ops\n }\n if (!broadcastHB) { // TODO: consider to broadcast here..\n conn.send(sender, update)\n } else {\n // broadcast only once!\n conn.broadcast(update)\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.broadcast({\n type: 'update',\n ops: delops\n })\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: {},\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 i in globalRoom.buffers) {\n if (globalRoom.buffers[i].length > 0) {\n bufs.push(i)\n }\n }\n if (bufs.length > 0) {\n var userId = getRandom(bufs)\n var m = globalRoom.buffers[userId].shift()\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 }, 10)\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 buffer.push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n broadcast (message) {\n for (var key in globalRoom.buffers) {\n globalRoom.buffers[key].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 while (globalRoom.buffers[self.userId].length > 0) {\n var m = globalRoom.buffers[self.userId].shift()\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 // 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.whenUserIdSetListener = null\n this.waitingTransactions = []\n this.transactionInProgress = 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 || 5000\n var os = this\n function garbageCollect () {\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 if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n resolve()\n })\n })\n }\n this.garbageCollect = garbageCollect\n if (this.gcTimeout > 0) {\n garbageCollect()\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 delete op.gc\n yield* this.setOperation(op)\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 this.y.connector.isSynced &&\n left != null &&\n left.deleted === true\n ) {\n op.gc = true\n this.gc1.push(op.id)\n return true\n } else {\n return false\n }\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 }\n setUserId (userId) {\n var self = this\n return new Promise(function (resolve) {\n self.requestTransaction(function * () {\n self.userId = userId\n var state = yield* this.getState(userId)\n self.opClock = state.clock\n if (self.whenUserIdSetListener != null) {\n self.whenUserIdSetListener()\n self.whenUserIdSetListener = null\n }\n resolve()\n })\n })\n }\n whenUserIdSet (f) {\n if (this.userId != null) {\n f()\n } else {\n this.whenUserIdSetListener = f\n }\n }\n getNextOpId () {\n if (this._nextUserId != null) {\n return this._nextUserId\n } else if (this.userId == null) {\n throw new Error('OperationStore not yet initialized!')\n } else {\n return [this.userId, this.opClock++]\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 key in ops) {\n var o = ops[key]\n var required = Y.Struct[o.struct].requiredOps(o)\n this.whenOperationsExist(required, o)\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 key in ids) {\n let id = ids[key]\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 = yield* this.getOperation(id)\n if (op == null) {\n store.listenersById[sid] = l\n } else {\n for (let key in l) {\n let listener = l[key]\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 yield* this.store.operationAdded(this, op)\n } else {\n var defined = yield* this.getOperation(op.id)\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 }\n }\n }\n // called by a transaction when an operation is added\n * operationAdded (transaction, op) {\n if (op.struct === 'Delete') {\n var target = yield* transaction.getOperation(op.target)\n if (target != null) {\n var type = transaction.store.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(transaction, {\n struct: 'Delete',\n target: op.target\n })\n }\n }\n } else {\n // increase SS\n var o = op\n var state = yield* transaction.getState(op.id[0])\n while (o != null && o.id[1] === state.clock && op.id[0] === o.id[0]) {\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++\n yield* transaction.checkDeleteStoreForState(state)\n o = yield* transaction.os.findNext(o.id)\n }\n yield* transaction.setState(state)\n\n // notify whenOperation listeners (by id)\n var sid = JSON.stringify(op.id)\n var l = this.listenersById[sid]\n delete this.listenersById[sid]\n\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 var t = this.initializedTypes[JSON.stringify(op.parent)]\n\n // Delete if DS says this is actually deleted\n var opIsDeleted = yield* transaction.isDeleted(op.id)\n if (!op.deleted && opIsDeleted) {\n var delop = {\n struct: 'Delete',\n target: op.id\n }\n yield* Y.Struct['Delete'].execute.call(transaction, delop)\n }\n\n // notify parent, if it has been initialized as a custom type\n if (t != null) {\n yield* t._changed(transaction, Y.utils.copyObject(op))\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 getNextRequest () {\n if (this.waitingTransactions.length === 0) {\n this.transactionInProgress = false\n if (this.transactionsFinished != null) {\n this.transactionsFinished.resolve()\n this.transactionsFinished = null\n }\n return null\n } else {\n return this.waitingTransactions.shift()\n }\n }\n requestTransaction (makeGen/* :any */, callImmediately) {\n if (true || callImmediately) { // TODO: decide whether this is ok or not..\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n this.transact(this.getNextRequest())\n }\n } else {\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n var self = this\n setTimeout(function () {\n self.transact(self.getNextRequest())\n }, 0)\n }\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)\n }\n },\n Insert: {\n /* {\n content: any,\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.opContent != null) {\n e.opContent = op.opContent\n } else {\n e.content = op.content\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.getOperation(op.left)\n while (!Y.utils.compareIds(op.origin, (o ? o.id : null))) {\n d++\n if (o.left == null) {\n break\n } else {\n o = yield* this.getOperation(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 var distanceToOrigin = i = yield* Struct.Insert.getDistanceToOrigin.call(this, op) // most cases: 0 (starts from 0)\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.getOperation(op.left)\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 // 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 = o.id\n distanceToOrigin = i + 1\n }\n } else if (oOriginDistance < i) {\n // case 2\n if (i - distanceToOrigin <= oOriginDistance) {\n op.left = o.id\n distanceToOrigin = i + 1\n }\n } else {\n break\n }\n i++\n if (o.right != null) {\n o = yield* this.getOperation(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.getOperation(op.left)\n op.right = left.right\n left.right = op.id\n\n yield* this.setOperation(left)\n } else {\n op.right = op.parentSub ? parent.map[op.parentSub] || null : parent.start\n }\n // reconnect right\n if (op.right != null) {\n right = yield* this.getOperation(op.right)\n right.left = op.id\n\n // if right exists, and it is supposed to be gc'd. Remove it from the gc\n if (right.gc != null) {\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 if (op.right != null) {\n yield* this.deleteOperation(op.right, true)\n }\n if (op.left != null) {\n yield* this.deleteOperation(op.id, true)\n }\n } else {\n if (right == null || left == null) {\n if (right == null) {\n parent.end = op.id\n }\n if (left == null) {\n parent.start = op.id\n }\n yield* this.setOperation(parent)\n }\n }\n }\n },\n List: {\n /*\n {\n start: null,\n end: null,\n struct: \"List\",\n type: \"\",\n id: this.os.getNextOpId()\n }\n */\n encode: function (op) {\n return {\n struct: 'List',\n id: op.id,\n type: op.type\n }\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()\n }\n */\n encode: function (op) {\n return {\n struct: 'Map',\n type: op.type,\n id: op.id,\n map: {} // overwrite map!!\n }\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\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) {\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].initType.call(this, this.store, op)\n this.store.initializedTypes[sid] = t\n }\n }\n return t\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 send.push(Y.Struct[op.struct].encode(op))\n }\n if (!this.store.y.connector.isDisconnected()) { // 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.broadcast({\n type: 'update',\n ops: send\n })\n }\n }\n\n * deleteList (start) {\n if (this.store.y.connector.isSynced) {\n while (start != null && this.store.y.connector.isSynced) {\n start = yield* this.getOperation(start)\n start.gc = true\n yield* this.setOperation(start)\n // TODO: will always reset the parent..\n this.store.gc1.push(start.id)\n start = start.right\n }\n } else {\n // TODO: when not possible??? do later in (gcWhenSynced)\n }\n }\n\n /*\n Mark an operation as deleted, and add it to the GC, if possible.\n */\n * deleteOperation (targetId, preventCallType) /* :Generator */ {\n var target = yield* this.getOperation(targetId)\n var callType = false\n\n if (target == null || !target.deleted) {\n yield* this.markDeleted(targetId)\n }\n\n if (target != null && target.gc == null) {\n if (!target.deleted) {\n callType = true\n // set deleted & notify type\n target.deleted = true\n /*\n if (!preventCallType) {\n var type = this.store.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(this, {\n struct: 'Delete',\n target: targetId\n })\n }\n }\n */\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)\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)\n }\n if (target.opContent != null) {\n yield* this.deleteOperation(target.opContent)\n target.opContent = null\n }\n }\n var left\n if (target.left != null) {\n left = yield* this.getOperation(target.left)\n } else {\n left = null\n }\n\n this.store.addToGarbageCollector(target, left)\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 (\n right != null &&\n this.store.addToGarbageCollector(right, target)\n ) {\n yield* this.setOperation(right)\n }\n return callType\n }\n }\n /*\n Mark an operation as deleted&gc'd\n */\n * markGarbageCollected (id) {\n // this.mem.push([\"gc\", id]);\n var n = yield* this.markDeleted(id)\n if (!n.gc) {\n if (n.id[1] < id[1]) {\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] < n.id[1] + n.len - 1) {\n // un-extend right\n yield* this.ds.put({id: [id[0], id[1] + 1], len: n.len - 1, gc: false})\n n.len = 1\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 }\n }\n /*\n Mark an operation as deleted.\n\n returns the delete node\n */\n * markDeleted (id) {\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 // already deleted\n return n\n } else if (n.id[1] + n.len === id[1] && !n.gc) {\n // can extend existing deletion\n n.len++\n } else {\n // cannot extend left\n n = {id: id, len: 1, gc: false}\n yield* this.ds.put(n)\n }\n } else {\n // cannot extend left\n n = {id: id, len: 1, 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 Y.utils.compareIds([n.id[0], n.id[1] + n.len], next.id) &&\n !next.gc\n ) {\n n.len = n.len + next.len\n yield* this.ds.delete(next.id)\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 yield* this.os.iterate(this, null, null, function * (op) {\n if (op.deleted && op.left != null) {\n var left = yield* this.getOperation(op.left)\n this.store.addToGarbageCollector(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 // check to increase the state of the respective user\n var state = yield* this.getState(id[0])\n if (state.clock === id[1]) {\n state.clock++\n // also check if more expected operations were gc'd\n yield* this.checkDeleteStoreForState(state)\n // then set the state\n yield* this.setState(state)\n }\n yield* this.markGarbageCollected(id)\n\n // if op exists, then clean that mess up..\n var o = yield* this.getOperation(id)\n if (o != null) {\n /*\n if (!o.deleted) {\n yield* this.deleteOperation(id)\n o = yield* this.getOperation(id)\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.getOperation(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 if (Y.utils.compareIds(right.origin, o.id)) { // rights origin is o\n // find new origin of right ops\n // origin is the first left deleted operation\n var neworigin = o.left\n while (neworigin != null) {\n var neworigin_ = yield* this.getOperation(neworigin)\n if (neworigin_.deleted) {\n break\n }\n neworigin = neworigin_.left\n }\n\n // reset origin of right\n right.origin = neworigin\n\n // reset origin of all right ops (except first right - duh!),\n // 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 i = yield* this.getOperation(i.right)\n }\n }\n }\n } /* otherwise, rights origin is to the left of o,\n then there is no right op (from o), that origins in o */\n yield* this.setOperation(right)\n }\n\n if (o.parent != null) {\n // remove gc'd op from parent, if it exists\n var parent /* MapOperation */ = yield* this.getOperation(o.parent)\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 parent.map[o.parentSub] = o.right\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.compareIds(parent.end, o.id)) {\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 /*\n apply a delete set in order to get\n the state of the supplied ds\n */\n * applyDeleteSet (ds) {\n var deletions = []\n function createDeletions (user, start, len, gc) {\n for (var c = start; c < start + len; c++) {\n deletions.push([user, c, gc])\n }\n }\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 createDeletions(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 createDeletions(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 createDeletions(user, d[0], d[1], d[2])\n }\n }\n for (var i = 0; i < deletions.length; i++) {\n var del = deletions[i]\n var id = [del[0], del[1]]\n // always try to delete..\n var addOperation = yield* this.deleteOperation(id)\n if (addOperation) {\n // TODO:.. really .. here? You could prevent calling all these functions in operationAdded\n yield* this.store.operationAdded(this, {struct: 'Delete', target: id})\n }\n if (del[2]) {\n // gc\n yield* this.garbageCollectOperation(id)\n }\n }\n if (this.store.forwardAppliedOperations) {\n var ops = deletions.map(function (d) {\n return {struct: 'Delete', target: [d[0], d[1]]}\n })\n this.store.y.connector.broadcast({\n type: 'update',\n ops: 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 && op.id[0] !== '_') {\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcast({\n type: 'update',\n ops: [op]\n })\n }\n }\n * getOperation (id/* :any */)/* :Transaction */ {\n var o = yield* this.os.find(id)\n if (o != null || id[0] !== '_') {\n return o\n } else {\n // need to generate this operation\n if (this.store._nextUserId == null) {\n var typename = id[1].split('_')[0]\n this.store._nextUserId = id\n yield* Y[typename].createType.call(this)\n delete this.store._nextUserId\n return yield* this.os.find(id)\n } else {\n // Can only generate one operation at a time\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 * getOperations (startSS) {\n // TODO: use bounds here!\n if (startSS == null) {\n startSS = {}\n }\n var ops = []\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\n yield* this.os.iterate(this, [user, startPos], [user, Number.MAX_VALUE], function * (op) {\n ops.push(op)\n })\n }\n var res = []\n for (var op of ops) {\n var o = yield* this.makeOperationReady(startSS, op)\n res.push(o)\n }\n return res\n }\n /*\n Here, we make op 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 * makeOperationReady (startSS, op) {\n op = Y.Struct[op.struct].encode(op)\n op = Y.utils.copyObject(op)\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 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 will help you to make your type\n synchronous.\n*/\nmodule.exports = function (Y /* : any*/) {\n Y.utils = {}\n\n class EventHandler {\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 this.waiting = []\n this.awaiting = 0\n this.onevent = onevent\n this.eventListeners = []\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(Y.utils.copyObject(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 this.onevent(ops)\n }\n /*\n Basic event listener boilerplate...\n TODO: maybe put this in a different type..\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.log('User events must not throw Errors!') // eslint-disable-line\n }\n }\n }\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 if (w.struct === 'Insert') {\n if (Y.utils.compareIds(op.left, w.id)) {\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(op.right, w.id)) {\n // similar..\n w.left = op.id\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 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 /* (private)\n Try to execute the events for the waiting operations\n */\n _tryCallEvents () {\n this.awaiting--\n if (this.awaiting <= 0 && this.waiting.length > 0) {\n var events = this.waiting\n this.waiting = []\n this.onevent(events)\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 * createType\n - Defines the model of a newly created custom type and returns the 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 createType: any;\n initType: any;\n class: Function;\n */\n constructor (def) {\n if (def.createType == null ||\n def.initType == null ||\n def.class == null\n ) {\n throw new Error('Custom type was not initialized correctly!')\n }\n this.createType = def.createType\n this.initType = def.initType\n this.class = def.class\n }\n }\n Y.utils.CustomType = CustomType\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 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])\n }\n Y.utils.smaller = smaller\n\n function compareIds (id1, id2) {\n if (id1 == null || id2 == null) {\n if (id1 == null && id2 == null) {\n return true\n }\n return false\n }\n if (id1[0] === id2[0] && id1[1] === id2[1]) {\n return true\n } else {\n return false\n }\n }\n Y.utils.compareIds = compareIds\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\n\nY.extend = function (name, value) {\n Y[name] = value\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 modulename = 'y-' + modules[i].toLowerCase()\n if (Y[modules[i]] == null) {\n if (requiringModules[modules[i]] == 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[modules[i]] = requireModule\n requireModule.promise = new Promise(function (resolve) {\n requireModule.resolve = resolve\n })\n promises.push(requireModule.promise)\n } else {\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 Y.requestModules(modules).then(function () {\n return new Promise(function (resolve) {\n var yconfig = new YConfig(opts, function () {\n yconfig.db.whenUserIdSet(function () {\n resolve(yconfig)\n })\n })\n })\n })\n}\n\nclass YConfig {\n /* ::\n db: Y.AbstractDatabase;\n connector: Y.AbstractConnector;\n share: {[key: string]: any};\n */\n constructor (opts, callback) {\n this.db = new Y[opts.db.name](this, opts.db)\n this.connector = new Y[opts.connector.name](this, opts.connector)\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 share[propertyname] = yield* this.getType(['_', opts.share[propertyname] + '_' + propertyname])\n }\n setTimeout(callback, 0)\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 this.disconnect()\n this.db.destroy()\n this.connector = null\n this.db = null\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 8f174f36..f34a9135 100644 --- a/y.js +++ b/y.js @@ -4044,7 +4044,7 @@ module.exports = function (Y /* :any */) { return _context18.delegateYield(this.os.put(op), 't0', 1); case 1: - if (!this.store.y.connector.isDisconnected() && this.store.forwardAppliedOperations) { + if (!this.store.y.connector.isDisconnected() && this.store.forwardAppliedOperations && op.id[0] !== '_') { // is connected, and this is not going to be send in addOperation this.store.y.connector.broadcast({ type: 'update', @@ -4801,35 +4801,31 @@ 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 = Y.Struct.Insert.execute.constructor === Function ? '.js' : '.es6'; + var extention = typeof regeneratorRuntime !== 'undefined' ? '.js' : '.es6'; var promises = []; for (var i = 0; i < modules.length; i++) { var modulename = 'y-' + modules[i].toLowerCase(); if (Y[modules[i]] == null) { if (requiringModules[modules[i]] == null) { - try { + // 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[modules[i]] = requireModule; + requireModule.promise = new Promise(function (resolve) { + requireModule.resolve = resolve; + }); + promises.push(requireModule.promise); + })(); + } else { require(modulename)(Y); - } catch (e) { - // module does not exist - if (typeof window !== 'undefined') { - var imported; - - (function () { - imported = document.createElement('script'); - - imported.src = Y.sourceDir + '/' + modulename + '/' + modulename + extention; - document.head.appendChild(imported); - - var requireModule = {}; - requiringModules[modules[i]] = requireModule; - requireModule.promise = new Promise(function (resolve) { - requireModule.resolve = resolve; - }); - promises.push(requireModule.promise); - })(); - } else { - throw e; - } } } else { promises.push(requiringModules[modules[i]].promise); diff --git a/y.js.map b/y.js.map index 0fb55f2c..b2ce3e59 100644 --- a/y.js.map +++ b/y.js.map @@ -1 +1 @@ -{"version":3,"sources":["node_modules/browserify/node_modules/browser-pack/_prelude.js","node_modules/browserify/node_modules/process/browser.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;;;;;;;;;;;;;;;;;ACjFA,CAAC,CAAC,UAAS,MAAM,EAAE;AACjB,cAAY,CAAC;;AAEb,MAAI,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC;AAC7C,MAAI,SAAS;AAAC,AACd,MAAI,OAAO,GAAG,OAAO,MAAM,KAAK,UAAU,GAAG,MAAM,GAAG,EAAE,CAAC;AACzD,MAAI,cAAc,GAAG,OAAO,CAAC,QAAQ,IAAI,YAAY,CAAC;AACtD,MAAI,iBAAiB,GAAG,OAAO,CAAC,WAAW,IAAI,eAAe,CAAC;;AAE/D,MAAI,QAAQ,GAAG,QAAO,MAAM,yCAAN,MAAM,OAAK,QAAQ,CAAC;AAC1C,MAAI,OAAO,GAAG,MAAM,CAAC,kBAAkB,CAAC;AACxC,MAAI,OAAO,EAAE;AACX,QAAI,QAAQ,EAAE;;;AAGZ,YAAM,CAAC,OAAO,GAAG,OAAO,CAAC;KAC1B;;;AAAA,AAGD,WAAO;GACR;;;;AAAA,AAID,SAAO,GAAG,MAAM,CAAC,kBAAkB,GAAG,QAAQ,GAAG,MAAM,CAAC,OAAO,GAAG,EAAE,CAAC;;AAErE,WAAS,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE;;AAEjD,QAAI,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,IAAI,SAAS,CAAA,CAAE,SAAS,CAAC,CAAC;AAChE,QAAI,OAAO,GAAG,IAAI,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC;;;;AAAC,AAI7C,aAAS,CAAC,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;;AAE7D,WAAO,SAAS,CAAC;GAClB;AACD,SAAO,CAAC,IAAI,GAAG,IAAI;;;;;;;;;;;;AAAC,AAYpB,WAAS,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AAC9B,QAAI;AACF,aAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;KACnD,CAAC,OAAO,GAAG,EAAE;AACZ,aAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;KACpC;GACF;;AAED,MAAI,sBAAsB,GAAG,gBAAgB,CAAC;AAC9C,MAAI,sBAAsB,GAAG,gBAAgB,CAAC;AAC9C,MAAI,iBAAiB,GAAG,WAAW,CAAC;AACpC,MAAI,iBAAiB,GAAG,WAAW;;;;AAAC,AAIpC,MAAI,gBAAgB,GAAG,EAAE;;;;;;AAAC,AAM1B,WAAS,SAAS,GAAG,EAAE;AACvB,WAAS,iBAAiB,GAAG,EAAE;AAC/B,WAAS,0BAA0B,GAAG,EAAE;;AAExC,MAAI,EAAE,GAAG,0BAA0B,CAAC,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC;AACpE,mBAAiB,CAAC,SAAS,GAAG,EAAE,CAAC,WAAW,GAAG,0BAA0B,CAAC;AAC1E,4BAA0B,CAAC,WAAW,GAAG,iBAAiB,CAAC;AAC3D,4BAA0B,CAAC,iBAAiB,CAAC,GAAG,iBAAiB,CAAC,WAAW,GAAG,mBAAmB;;;;AAAC,AAIpG,WAAS,qBAAqB,CAAC,SAAS,EAAE;AACxC,KAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,UAAS,MAAM,EAAE;AACnD,eAAS,CAAC,MAAM,CAAC,GAAG,UAAS,GAAG,EAAE;AAChC,eAAO,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;OAClC,CAAC;KACH,CAAC,CAAC;GACJ;;AAED,SAAO,CAAC,mBAAmB,GAAG,UAAS,MAAM,EAAE;AAC7C,QAAI,IAAI,GAAG,OAAO,MAAM,KAAK,UAAU,IAAI,MAAM,CAAC,WAAW,CAAC;AAC9D,WAAO,IAAI,GACP,IAAI,KAAK,iBAAiB;;;AAG1B,KAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAA,KAAM,mBAAmB,GACvD,KAAK,CAAC;GACX,CAAC;;AAEF,SAAO,CAAC,IAAI,GAAG,UAAS,MAAM,EAAE;AAC9B,QAAI,MAAM,CAAC,cAAc,EAAE;AACzB,YAAM,CAAC,cAAc,CAAC,MAAM,EAAE,0BAA0B,CAAC,CAAC;KAC3D,MAAM;AACL,YAAM,CAAC,SAAS,GAAG,0BAA0B,CAAC;AAC9C,UAAI,EAAE,iBAAiB,IAAI,MAAM,CAAA,AAAC,EAAE;AAClC,cAAM,CAAC,iBAAiB,CAAC,GAAG,mBAAmB,CAAC;OACjD;KACF;AACD,UAAM,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AACrC,WAAO,MAAM,CAAC;GACf;;;;;;;AAAC,AAOF,SAAO,CAAC,KAAK,GAAG,UAAS,GAAG,EAAE;AAC5B,WAAO,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC;GAC/B,CAAC;;AAEF,WAAS,aAAa,CAAC,GAAG,EAAE;AAC1B,QAAI,CAAC,GAAG,GAAG,GAAG,CAAC;GAChB;;AAED,WAAS,aAAa,CAAC,SAAS,EAAE;AAChC,aAAS,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE;AAC5C,UAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;AACzD,UAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAC3B,cAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;OACpB,MAAM;AACL,YAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC;AACxB,YAAI,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;AACzB,YAAI,KAAK,YAAY,aAAa,EAAE;AAClC,iBAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,UAAS,KAAK,EAAE;AACrD,kBAAM,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;WACxC,EAAE,UAAS,GAAG,EAAE;AACf,kBAAM,CAAC,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;WACvC,CAAC,CAAC;SACJ;;AAED,eAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,UAAS,SAAS,EAAE;;;;;;;;;;;;;;;;AAgBrD,gBAAM,CAAC,KAAK,GAAG,SAAS,CAAC;AACzB,iBAAO,CAAC,MAAM,CAAC,CAAC;SACjB,EAAE,MAAM,CAAC,CAAC;OACZ;KACF;;AAED,QAAI,QAAO,OAAO,yCAAP,OAAO,OAAK,QAAQ,IAAI,OAAO,CAAC,MAAM,EAAE;AACjD,YAAM,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KACtC;;AAED,QAAI,eAAe,CAAC;;AAEpB,aAAS,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE;AAC5B,eAAS,0BAA0B,GAAG;AACpC,eAAO,IAAI,OAAO,CAAC,UAAS,OAAO,EAAE,MAAM,EAAE;AAC3C,gBAAM,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;SACtC,CAAC,CAAC;OACJ;;AAED,aAAO,eAAe;;;;;;;;;;;;;AAapB,qBAAe,GAAG,eAAe,CAAC,IAAI,CACpC,0BAA0B;;;AAG1B,gCAA0B,CAC3B,GAAG,0BAA0B,EAAE,CAAC;KACpC;;;;AAAA,AAID,QAAI,CAAC,OAAO,GAAG,OAAO,CAAC;GACxB;;AAED,uBAAqB,CAAC,aAAa,CAAC,SAAS,CAAC;;;;;AAAC,AAK/C,SAAO,CAAC,KAAK,GAAG,UAAS,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE;AAC5D,QAAI,IAAI,GAAG,IAAI,aAAa,CAC1B,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC,CAC1C,CAAC;;AAEF,WAAO,OAAO,CAAC,mBAAmB,CAAC,OAAO,CAAC,GACvC;AAAI,MACJ,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,UAAS,MAAM,EAAE;AAChC,aAAO,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;KACjD,CAAC,CAAC;GACR,CAAC;;AAEF,WAAS,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE;AAChD,QAAI,KAAK,GAAG,sBAAsB,CAAC;;AAEnC,WAAO,SAAS,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE;AAClC,UAAI,KAAK,KAAK,iBAAiB,EAAE;AAC/B,cAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;OACjD;;AAED,UAAI,KAAK,KAAK,iBAAiB,EAAE;AAC/B,YAAI,MAAM,KAAK,OAAO,EAAE;AACtB,gBAAM,GAAG,CAAC;SACX;;;;AAAA,AAID,eAAO,UAAU,EAAE,CAAC;OACrB;;AAED,aAAO,IAAI,EAAE;AACX,YAAI,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;AAChC,YAAI,QAAQ,EAAE;AACZ,cAAI,MAAM,KAAK,QAAQ,IAClB,MAAM,KAAK,OAAO,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,SAAS,AAAC,EAAE;;;AAGnE,mBAAO,CAAC,QAAQ,GAAG,IAAI;;;;AAAC,AAIxB,gBAAI,YAAY,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAC/C,gBAAI,YAAY,EAAE;AAChB,kBAAI,MAAM,GAAG,QAAQ,CAAC,YAAY,EAAE,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;AAC5D,kBAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;;;AAG3B,sBAAM,GAAG,OAAO,CAAC;AACjB,mBAAG,GAAG,MAAM,CAAC,GAAG,CAAC;AACjB,yBAAS;eACV;aACF;;AAED,gBAAI,MAAM,KAAK,QAAQ,EAAE;;;AAGvB,uBAAS;aACV;WACF;;AAED,cAAI,MAAM,GAAG,QAAQ,CACnB,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EACzB,QAAQ,CAAC,QAAQ,EACjB,GAAG,CACJ,CAAC;;AAEF,cAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAC3B,mBAAO,CAAC,QAAQ,GAAG,IAAI;;;;AAAC,AAIxB,kBAAM,GAAG,OAAO,CAAC;AACjB,eAAG,GAAG,MAAM,CAAC,GAAG,CAAC;AACjB,qBAAS;WACV;;;;;AAAA,AAKD,gBAAM,GAAG,MAAM,CAAC;AAChB,aAAG,GAAG,SAAS,CAAC;;AAEhB,cAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;AACtB,cAAI,IAAI,CAAC,IAAI,EAAE;AACb,mBAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;AAC1C,mBAAO,CAAC,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC;WACjC,MAAM;AACL,iBAAK,GAAG,sBAAsB,CAAC;AAC/B,mBAAO,IAAI,CAAC;WACb;;AAED,iBAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;SACzB;;AAED,YAAI,MAAM,KAAK,MAAM,EAAE;AACrB,cAAI,KAAK,KAAK,sBAAsB,EAAE;AACpC,mBAAO,CAAC,IAAI,GAAG,GAAG,CAAC;WACpB,MAAM;AACL,mBAAO,CAAC,IAAI,GAAG,SAAS,CAAC;WAC1B;SAEF,MAAM,IAAI,MAAM,KAAK,OAAO,EAAE;AAC7B,cAAI,KAAK,KAAK,sBAAsB,EAAE;AACpC,iBAAK,GAAG,iBAAiB,CAAC;AAC1B,kBAAM,GAAG,CAAC;WACX;;AAED,cAAI,OAAO,CAAC,iBAAiB,CAAC,GAAG,CAAC,EAAE;;;AAGlC,kBAAM,GAAG,MAAM,CAAC;AAChB,eAAG,GAAG,SAAS,CAAC;WACjB;SAEF,MAAM,IAAI,MAAM,KAAK,QAAQ,EAAE;AAC9B,iBAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;SAC/B;;AAED,aAAK,GAAG,iBAAiB,CAAC;;AAE1B,YAAI,MAAM,GAAG,QAAQ,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AAC9C,YAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE;;;AAG5B,eAAK,GAAG,OAAO,CAAC,IAAI,GAChB,iBAAiB,GACjB,sBAAsB,CAAC;;AAE3B,cAAI,IAAI,GAAG;AACT,iBAAK,EAAE,MAAM,CAAC,GAAG;AACjB,gBAAI,EAAE,OAAO,CAAC,IAAI;WACnB,CAAC;;AAEF,cAAI,MAAM,CAAC,GAAG,KAAK,gBAAgB,EAAE;AACnC,gBAAI,OAAO,CAAC,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE;;;AAGzC,iBAAG,GAAG,SAAS,CAAC;aACjB;WACF,MAAM;AACL,mBAAO,IAAI,CAAC;WACb;SAEF,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAClC,eAAK,GAAG,iBAAiB;;;AAAC,AAG1B,gBAAM,GAAG,OAAO,CAAC;AACjB,aAAG,GAAG,MAAM,CAAC,GAAG,CAAC;SAClB;OACF;KACF,CAAC;GACH;;;;AAAA,AAID,uBAAqB,CAAC,EAAE,CAAC,CAAC;;AAE1B,IAAE,CAAC,cAAc,CAAC,GAAG,YAAW;AAC9B,WAAO,IAAI,CAAC;GACb,CAAC;;AAEF,IAAE,CAAC,iBAAiB,CAAC,GAAG,WAAW,CAAC;;AAEpC,IAAE,CAAC,QAAQ,GAAG,YAAW;AACvB,WAAO,oBAAoB,CAAC;GAC7B,CAAC;;AAEF,WAAS,YAAY,CAAC,IAAI,EAAE;AAC1B,QAAI,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;;AAEhC,QAAI,CAAC,IAAI,IAAI,EAAE;AACb,WAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;KAC1B;;AAED,QAAI,CAAC,IAAI,IAAI,EAAE;AACb,WAAK,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAC3B,WAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;KAC1B;;AAED,QAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;GAC7B;;AAED,WAAS,aAAa,CAAC,KAAK,EAAE;AAC5B,QAAI,MAAM,GAAG,KAAK,CAAC,UAAU,IAAI,EAAE,CAAC;AACpC,UAAM,CAAC,IAAI,GAAG,QAAQ,CAAC;AACvB,WAAO,MAAM,CAAC,GAAG,CAAC;AAClB,SAAK,CAAC,UAAU,GAAG,MAAM,CAAC;GAC3B;;AAED,WAAS,OAAO,CAAC,WAAW,EAAE;;;;AAI5B,QAAI,CAAC,UAAU,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;AACvC,eAAW,CAAC,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;AACxC,QAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;GAClB;;AAED,SAAO,CAAC,IAAI,GAAG,UAAS,MAAM,EAAE;AAC9B,QAAI,IAAI,GAAG,EAAE,CAAC;AACd,SAAK,IAAI,GAAG,IAAI,MAAM,EAAE;AACtB,UAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAChB;AACD,QAAI,CAAC,OAAO,EAAE;;;;AAAC,AAIf,WAAO,SAAS,IAAI,GAAG;AACrB,aAAO,IAAI,CAAC,MAAM,EAAE;AAClB,YAAI,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;AACrB,YAAI,GAAG,IAAI,MAAM,EAAE;AACjB,cAAI,CAAC,KAAK,GAAG,GAAG,CAAC;AACjB,cAAI,CAAC,IAAI,GAAG,KAAK,CAAC;AAClB,iBAAO,IAAI,CAAC;SACb;OACF;;;;;AAAA,AAKD,UAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACjB,aAAO,IAAI,CAAC;KACb,CAAC;GACH,CAAC;;AAEF,WAAS,MAAM,CAAC,QAAQ,EAAE;AACxB,QAAI,QAAQ,EAAE;AACZ,UAAI,cAAc,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;AAC9C,UAAI,cAAc,EAAE;AAClB,eAAO,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;OACtC;;AAED,UAAI,OAAO,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE;AACvC,eAAO,QAAQ,CAAC;OACjB;;AAED,UAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;AAC3B,YAAI,CAAC,GAAG,CAAC,CAAC;YAAE,IAAI,GAAG,SAAS,IAAI,GAAG;AACjC,iBAAO,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE;AAC5B,gBAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE;AAC5B,kBAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;AACzB,kBAAI,CAAC,IAAI,GAAG,KAAK,CAAC;AAClB,qBAAO,IAAI,CAAC;aACb;WACF;;AAED,cAAI,CAAC,KAAK,GAAG,SAAS,CAAC;AACvB,cAAI,CAAC,IAAI,GAAG,IAAI,CAAC;;AAEjB,iBAAO,IAAI,CAAC;SACb,CAAC;;AAEF,eAAO,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;OACzB;KACF;;;AAAA,AAGD,WAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;GAC7B;AACD,SAAO,CAAC,MAAM,GAAG,MAAM,CAAC;;AAExB,WAAS,UAAU,GAAG;AACpB,WAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;GACzC;;AAED,SAAO,CAAC,SAAS,GAAG;AAClB,eAAW,EAAE,OAAO;;AAEpB,SAAK,EAAE,eAAS,aAAa,EAAE;AAC7B,UAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AACd,UAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AACd,UAAI,CAAC,IAAI,GAAG,SAAS,CAAC;AACtB,UAAI,CAAC,IAAI,GAAG,KAAK,CAAC;AAClB,UAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;;AAErB,UAAI,CAAC,UAAU,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;;AAEvC,UAAI,CAAC,aAAa,EAAE;AAClB,aAAK,IAAI,IAAI,IAAI,IAAI,EAAE;;AAErB,cAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,IACtB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IACvB,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;AAC1B,gBAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;WACxB;SACF;OACF;KACF;;AAED,QAAI,EAAE,gBAAW;AACf,UAAI,CAAC,IAAI,GAAG,IAAI,CAAC;;AAEjB,UAAI,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACnC,UAAI,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;AACtC,UAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE;AAC/B,cAAM,UAAU,CAAC,GAAG,CAAC;OACtB;;AAED,aAAO,IAAI,CAAC,IAAI,CAAC;KAClB;;AAED,qBAAiB,EAAE,2BAAS,SAAS,EAAE;AACrC,UAAI,IAAI,CAAC,IAAI,EAAE;AACb,cAAM,SAAS,CAAC;OACjB;;AAED,UAAI,OAAO,GAAG,IAAI,CAAC;AACnB,eAAS,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE;AAC3B,cAAM,CAAC,IAAI,GAAG,OAAO,CAAC;AACtB,cAAM,CAAC,GAAG,GAAG,SAAS,CAAC;AACvB,eAAO,CAAC,IAAI,GAAG,GAAG,CAAC;AACnB,eAAO,CAAC,CAAC,MAAM,CAAC;OACjB;;AAED,WAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AACpD,YAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,YAAI,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC;;AAE9B,YAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE;;;;AAI3B,iBAAO,MAAM,CAAC,KAAK,CAAC,CAAC;SACtB;;AAED,YAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE;AAC7B,cAAI,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;AAC9C,cAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;;AAElD,cAAI,QAAQ,IAAI,UAAU,EAAE;AAC1B,gBAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;AAC9B,qBAAO,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;aACrC,MAAM,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,UAAU,EAAE;AACvC,qBAAO,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;aACjC;WAEF,MAAM,IAAI,QAAQ,EAAE;AACnB,gBAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;AAC9B,qBAAO,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;aACrC;WAEF,MAAM,IAAI,UAAU,EAAE;AACrB,gBAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,UAAU,EAAE;AAChC,qBAAO,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;aACjC;WAEF,MAAM;AACL,kBAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;WAC3D;SACF;OACF;KACF;;AAED,UAAM,EAAE,gBAAS,IAAI,EAAE,GAAG,EAAE;AAC1B,WAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AACpD,YAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,YAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,IACzB,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,YAAY,CAAC,IAChC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,UAAU,EAAE;AAChC,cAAI,YAAY,GAAG,KAAK,CAAC;AACzB,gBAAM;SACP;OACF;;AAED,UAAI,YAAY,KACX,IAAI,KAAK,OAAO,IAChB,IAAI,KAAK,UAAU,CAAA,AAAC,IACrB,YAAY,CAAC,MAAM,IAAI,GAAG,IAC1B,GAAG,IAAI,YAAY,CAAC,UAAU,EAAE;;;AAGlC,oBAAY,GAAG,IAAI,CAAC;OACrB;;AAED,UAAI,MAAM,GAAG,YAAY,GAAG,YAAY,CAAC,UAAU,GAAG,EAAE,CAAC;AACzD,YAAM,CAAC,IAAI,GAAG,IAAI,CAAC;AACnB,YAAM,CAAC,GAAG,GAAG,GAAG,CAAC;;AAEjB,UAAI,YAAY,EAAE;AAChB,YAAI,CAAC,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC;OACrC,MAAM;AACL,YAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;OACvB;;AAED,aAAO,gBAAgB,CAAC;KACzB;;AAED,YAAQ,EAAE,kBAAS,MAAM,EAAE,QAAQ,EAAE;AACnC,UAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAC3B,cAAM,MAAM,CAAC,GAAG,CAAC;OAClB;;AAED,UAAI,MAAM,CAAC,IAAI,KAAK,OAAO,IACvB,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE;AAC9B,YAAI,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;OACxB,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE;AACnC,YAAI,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;AACvB,YAAI,CAAC,IAAI,GAAG,KAAK,CAAC;OACnB,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,QAAQ,EAAE;AAC/C,YAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;OACtB;KACF;;AAED,UAAM,EAAE,gBAAS,UAAU,EAAE;AAC3B,WAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AACpD,YAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,YAAI,KAAK,CAAC,UAAU,KAAK,UAAU,EAAE;AACnC,cAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;AAChD,uBAAa,CAAC,KAAK,CAAC,CAAC;AACrB,iBAAO,gBAAgB,CAAC;SACzB;OACF;KACF;;AAED,WAAO,EAAE,gBAAS,MAAM,EAAE;AACxB,WAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AACpD,YAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,YAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE;AAC3B,cAAI,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC;AAC9B,cAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAC3B,gBAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC;AACxB,yBAAa,CAAC,KAAK,CAAC,CAAC;WACtB;AACD,iBAAO,MAAM,CAAC;SACf;OACF;;;;AAAA,AAID,YAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;KAC1C;;AAED,iBAAa,EAAE,uBAAS,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE;AACrD,UAAI,CAAC,QAAQ,GAAG;AACd,gBAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;AAC1B,kBAAU,EAAE,UAAU;AACtB,eAAO,EAAE,OAAO;OACjB,CAAC;;AAEF,aAAO,gBAAgB,CAAC;KACzB;GACF,CAAC;CACH,CAAA;;;;AAIC,QAAO,MAAM,yCAAN,MAAM,OAAK,QAAQ,GAAG,MAAM,GACnC,QAAO,MAAM,yCAAN,MAAM,OAAK,QAAQ,GAAG,MAAM,GACnC,QAAO,IAAI,yCAAJ,IAAI,OAAK,QAAQ,GAAG,IAAI,YAAO,CACvC,CAAC;;;;;;AC1pBF,YAAY,CAAA;;;;;;AAEZ,MAAM,CAAC,OAAO,GAAG,UAAU,YAAC,EAAY;MAChC,iBAAiB;;;;;;;;;;;;;;;;;;;;;;;;;AAwBrB,aAxBI,iBAAiB,CAwBR,CAAC,EAAE,IAAI,EAAE;4BAxBlB,iBAAiB;;AAyBnB,UAAI,CAAC,CAAC,GAAG,CAAC,CAAA;AACV,UAAI,IAAI,IAAI,IAAI,EAAE;AAChB,YAAI,GAAG,EAAE,CAAA;OACV;AACD,UAAI,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE;AAC/C,YAAI,CAAC,IAAI,GAAG,QAAQ,CAAA;OACrB,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE;AAChC,YAAI,CAAC,IAAI,GAAG,OAAO,CAAA;OACpB,MAAM;AACL,cAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAA;OAC5D;AACD,UAAI,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,GAAG,IAAI,CAAC,wBAAwB,IAAI,KAAK,CAAA;AAC3E,UAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;AACrB,UAAI,CAAC,WAAW,GAAG,EAAE,CAAA;AACrB,UAAI,CAAC,QAAQ,GAAG,KAAK,CAAA;AACrB,UAAI,CAAC,kBAAkB,GAAG,EAAE,CAAA;AAC5B,UAAI,CAAC,mBAAmB,GAAG,EAAE,CAAA;AAC7B,UAAI,CAAC,iBAAiB,GAAG,IAAI,CAAA;AAC7B,UAAI,CAAC,cAAc,GAAG,EAAE,CAAA;AACxB,UAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,uBAAuB,KAAK,KAAK,CAAA;AACrE,UAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,KAAK,IAAI,CAAA;AAChC,UAAI,CAAC,aAAa,GAAG,KAAK,CAAA;AAC1B,UAAI,CAAC,SAAS,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;KACnC;;iBAhDG,iBAAiB;;kCAiDR,EACZ;;;mCACa;AACZ,YAAI,CAAC,WAAW,GAAG,EAAE,CAAA;AACrB,YAAI,CAAC,QAAQ,GAAG,KAAK,CAAA;AACrB,YAAI,CAAC,iBAAiB,GAAG,IAAI,CAAA;AAC7B,YAAI,CAAC,aAAa,GAAG,KAAK,CAAA;AAC1B,YAAI,CAAC,cAAc,GAAG,EAAE,CAAA;AACxB,YAAI,CAAC,mBAAmB,GAAG,EAAE,CAAA;AAC7B,eAAO,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,oBAAoB,EAAE,CAAA;OACxC;;;gCACU,MAAM,EAAE;AACjB,YAAI,CAAC,MAAM,GAAG,MAAM,CAAA;AACpB,eAAO,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;OACnC;;;kCACY,CAAC,EAAE;AACd,YAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;OAChC;;;+BACS,IAAI,EAAE;AACd,eAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;AAC7B,YAAI,IAAI,KAAK,IAAI,CAAC,iBAAiB,EAAE;AACnC,cAAI,CAAC,iBAAiB,GAAG,IAAI,CAAA;AAC7B,cAAI,CAAC,kBAAkB,EAAE,CAAA;SAC1B;AACD,YAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,GAAG,EAAE;AAC9D,iBAAO,GAAG,KAAK,IAAI,CAAA;SACpB,CAAC,CAAA;;;;;;AACF,+BAAc,IAAI,CAAC,kBAAkB,8HAAE;gBAA9B,CAAC;;AACR,aAAC,CAAC;AACA,oBAAM,EAAE,UAAU;AAClB,kBAAI,EAAE,IAAI;aACX,CAAC,CAAA;WACH;;;;;;;;;;;;;;;OACF;;;iCACW,IAAI,EAAE,IAAI,EAAE;AACtB,YAAI,IAAI,IAAI,IAAI,EAAE;AAChB,gBAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAA;SACjE;AACD,YAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE;AAClC,gBAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;SAC7C;AACD,YAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG;AACvB,kBAAQ,EAAE,KAAK;AACf,cAAI,EAAE,IAAI;SACX,CAAA;;;;;;AACD,gCAAc,IAAI,CAAC,kBAAkB,mIAAE;gBAA9B,CAAC;;AACR,aAAC,CAAC;AACA,oBAAM,EAAE,YAAY;AACpB,kBAAI,EAAE,IAAI;AACV,kBAAI,EAAE,IAAI;aACX,CAAC,CAAA;WACH;;;;;;;;;;;;;;;;AACD,YAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,EAAE;AAClC,cAAI,CAAC,kBAAkB,EAAE,CAAA;SAC1B;OACF;;;;;;iCAGW,CAAC,EAAE;AACb,YAAI,IAAI,CAAC,QAAQ,EAAE;AACjB,WAAC,EAAE,CAAA;SACJ,MAAM;AACL,cAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;SACjC;OACF;;;;;;;;2CAMqB;AACpB,YAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE;AACnD;AAAM,SACP;;AAED,YAAI,QAAQ,GAAG,IAAI,CAAA;AACnB,aAAK,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE;AAChC,cAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;AACnC,oBAAQ,GAAG,GAAG,CAAA;AACd,kBAAK;WACN;SACF;AACD,YAAI,QAAQ,IAAI,IAAI,EAAE;AACpB,cAAI,IAAI,GAAG,IAAI,CAAA;AACf,cAAI,CAAC,iBAAiB,GAAG,QAAQ,CAAA;AACjC,cAAI,CAAC,CAAC,CAAC,EAAE,CAAC,kBAAkB,yBAAC;gBACvB,QAAQ,EACR,SAAS;;;;;kDADS,IAAI,CAAC,WAAW,EAAE;;;AAApC,4BAAQ;kDACW,IAAI,CAAC,YAAY,EAAE;;;AAAtC,6BAAS;;AACb,wBAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;AAClB,0BAAI,EAAE,aAAa;AACnB,8BAAQ,EAAE,QAAQ;AAClB,+BAAS,EAAE,SAAS;qBACrB,CAAC,CAAA;;;;;;;;WACH,EAAC,CAAA;SACH,MAAM;AACL,cAAI,CAAC,QAAQ,GAAG,IAAI;;AAAA;;;;;AAEpB,kCAAc,IAAI,CAAC,mBAAmB,mIAAE;kBAA/B,CAAC;;AACR,eAAC,EAAE,CAAA;aACJ;;;;;;;;;;;;;;;;AACD,cAAI,CAAC,mBAAmB,GAAG,EAAE,CAAA;AAC7B,cAAI,CAAC,CAAC,CAAC,EAAE,CAAC,kBAAkB,yBAAC;;;;;mDACpB,IAAI,CAAC,uBAAuB,EAAE;;;;;;;;WACtC,EAAC,CAAA;SACH;OACF;;;2BACK,GAAG,EAAE,OAAO,EAAE;AAClB,YAAI,IAAI,CAAC,KAAK,EAAE;AACd,iBAAO,CAAC,GAAG,WAAS,IAAI,CAAC,MAAM,YAAO,GAAG,UAAK,OAAO,CAAC,IAAI,EAAI,OAAO,CAAC;AAAA,SACvE;OACF;;;;;;;qCAIe,oBAAM,EAAe,sBAAO,EAAgB;;;AAC1D,YAAI,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE;AAC1B,iBAAM;SACP;AACD,YAAI,IAAI,CAAC,KAAK,EAAE;AACd,iBAAO,CAAC,GAAG,cAAY,MAAM,YAAO,IAAI,CAAC,MAAM,UAAK,OAAO,CAAC,IAAI,EAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;AAAA,SACzG;AACD,YAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE;;;AAElC,gBAAI,IAAI,QAAO,CAAA;AACf,gBAAI,CAAC,GAAG,OAAO,CAAA;AACf,kBAAK,CAAC,CAAC,EAAE,CAAC,kBAAkB,yBAAC;kBACvB,eAAe,EAGf,EAAE,EACF,GAAG;;;;;qDAJsB,IAAI,CAAC,WAAW,EAAE;;;AAA3C,qCAAe;qDACZ,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;;;qDAEvB,IAAI,CAAC,YAAY,EAAE;;;AAA/B,wBAAE;qDACW,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC;;;AAA3C,yBAAG;;AACP,0BAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,4BAAI,EAAE,aAAa;AACnB,0BAAE,EAAE,GAAG;AACP,gCAAQ,EAAE,eAAe;AACzB,iCAAS,EAAE,EAAE;uBACd,CAAC,CAAA;AACF,0BAAI,IAAI,CAAC,uBAAuB,EAAE;AAChC,4BAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;AAChC,kCAAU,CAAC,YAAY;AACrB,8BAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,GAAG,EAAE;AAC9D,mCAAO,GAAG,KAAK,MAAM,CAAA;2BACtB,CAAC,CAAA;AACF,8BAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,gCAAI,EAAE,WAAW;2BAClB,CAAC,CAAA;yBACH,EAAE,IAAI,CAAC;AAAA,uBACT,MAAM;AACL,8BAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,gCAAI,EAAE,WAAW;2BAClB,CAAC,CAAA;yBACH;AACD,0BAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;;;;;;;;aAC5B,EAAC,CAAA;;SACH,MAAM,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE;cAErC,WAAW;cAEX,EAAE;cACF,KAAK;;;AAJT,gBAAI,IAAI,QAAO,CAAA;AACX,uBAAW,GAAG,CAAC,MAAK,aAAa;;AACrC,kBAAK,aAAa,GAAG,IAAI,CAAA;AACrB,cAAE,GAAG,MAAK,CAAC,CAAC,EAAE;AACd,iBAAK,GAAG,EAAE;;AACd,iBAAK,CAAC,OAAO,GAAG,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;AAC7C,mBAAK,CAAC,OAAO,GAAG,OAAO,CAAA;aACxB,CAAC,CAAA;AACF,kBAAK,SAAS,GAAG,KAAK,CAAC,OAAO,CAAA;AAC9B,gBAAI,yBAAC,GAA2B,OAAO,CAAA;AACvC,cAAE,CAAC,kBAAkB,yBAAC;;;;;qDACb,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;;;AACvC,0BAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AACtB,wBAAE,CAAC,kBAAkB,yBAAC;4BAChB,GAAG,EAED,2BAAM;;;;;+DAFK,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC;;;AAA3C,mCAAG;;AACP,oCAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;AACd,wCAAM,GAAwB;AAChC,wCAAI,EAAE,QAAQ;AACd,uCAAG,EAAE,GAAG;mCACT;;AACD,sCAAI,CAAC,WAAW,EAAE;;AAChB,wCAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;mCAC1B,MAAM;;AAEL,wCAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;mCACvB;iCACF;AACD,qCAAK,CAAC,OAAO,EAAE,CAAA;;;;;;;;uBAChB,EAAC,CAAA;;;;;;;;aACH,EAAC,CAAA;;SACH,MAAM,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EAAE;AACvC,cAAI,IAAI,GAAG,IAAI,CAAA;AACf,cAAI,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY;AAC9B,gBAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;WAC5B,CAAC,CAAA;SACH,MAAM,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE;AACpC,cAAI,IAAI,CAAC,uBAAuB,EAAE;;;;;;AAChC,oCAAmB,IAAI,CAAC,cAAc,mIAAE;oBAA/B,MAAM;;AACb,oBAAI,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;eAC3B;;;;;;;;;;;;;;;WACF;AACD,cAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,EAAE;AACtC,gBAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE;AAC3C,qBAAO,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAA;aAC7B,CAAC,CAAA;AACF,gBAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;AACrB,kBAAI,CAAC,SAAS,CAAC;AACb,oBAAI,EAAE,QAAQ;AACd,mBAAG,EAAE,MAAM;eACZ,CAAC,CAAA;aACH;WACF;AACD,cAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;SAC7B;OACF;;;qCACe,IAAI,EAAE;AACpB,YAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;AACjC,YAAI,IAAI,IAAI,IAAI,EAAE;AAChB,cAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;SACrB;AACD,YAAI,IAAI,KAAK,IAAI,CAAC,iBAAiB,EAAE;AACnC,cAAI,CAAC,iBAAiB,GAAG,IAAI,CAAA;AAC7B,cAAI,CAAC,kBAAkB,EAAE,CAAA;SAC1B;OACF;;;;;;;;;;;;;;0CAcoB,YAAC,EAAY;AAChC,iBAAS,UAAU,CAAE,IAAI,EAAE;;;;;;AACzB,kCAAc,IAAI,CAAC,QAAQ,mIAAE;kBAApB,CAAC;;AACR,kBAAI,CAAC,CAAC,YAAY,CAAC,SAAS,CAAC,KAAK,MAAM,EAAE;AACxC,uBAAO,UAAU,CAAC,CAAC,CAAC,CAAA;eACrB,MAAM;AACL,uBAAO,WAAW,CAAC,CAAC,CAAC,CAAA;eACtB;aACF;;;;;;;;;;;;;;;SACF;AACD,iBAAS,WAAW,CAAE,eAAI,EAAY;AACpC,cAAI,IAAI,GAAG,EAAE,CAAA;AACb,eAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,EAAE;AAC/B,gBAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;AAChC,gBAAI,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;AAC7B,gBAAI,KAAK,CAAC,GAAG,CAAC,IAAI,AAAC,EAAE,GAAG,GAAG,KAAM,KAAK,EAAE;AACtC,kBAAI,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAA;aACvB,MAAM;AACL,kBAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAA;aACrB;WACF;AACD,eAAK,IAAI,CAAC,WAAA,IAAc,IAAI,CAAC,QAAQ,EAAE;AACrC,gBAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;AACjB,gBAAI,CAAC,CAAC,YAAY,CAAC,SAAS,CAAC,KAAK,MAAM,EAAE;AACxC,kBAAI,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;aAC3B,MAAM;AACL,kBAAI,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;aAC5B;WACF;AACD,iBAAO,IAAI,CAAA;SACZ;AACD,mBAAW,CAAC,CAAC,CAAC,CAAA;OACf;;;;;;;;;;;;;;yCAWmB,GAAG,EAAE,GAAG,EAAE;;AAE5B,iBAAS,YAAY,CAAE,CAAC,EAAE,IAAI,EAAE;AAC9B,eAAK,IAAI,IAAI,IAAI,IAAI,EAAE;AACrB,gBAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;AACtB,gBAAI,IAAI,IAAI,IAAI,EAAE;;aAEjB,MAAM,IAAI,KAAK,CAAC,WAAW,KAAK,MAAM,EAAE;AACvC,4BAAY,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAA;eAC/B,MAAM,IAAI,KAAK,CAAC,WAAW,KAAK,KAAK,EAAE;AACtC,2BAAW,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAA;eAC9B,MAAM;AACL,iBAAC,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;eAC5B;WACF;SACF;AACD,iBAAS,WAAW,CAAE,CAAC,EAAE,KAAK,EAAE;AAC9B,WAAC,CAAC,YAAY,CAAC,SAAS,EAAE,MAAM,CAAC,CAAA;;;;;;AACjC,kCAAc,KAAK,mIAAE;kBAAZ,CAAC;;AACR,kBAAI,CAAC,CAAC,WAAW,KAAK,MAAM,EAAE;AAC5B,4BAAY,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAA;eACtC,MAAM;AACL,2BAAW,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAA;eACrC;aACF;;;;;;;;;;;;;;;SACF;AACD,YAAI,GAAG,CAAC,WAAW,KAAK,MAAM,EAAE;AAC9B,sBAAY,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,iCAAiC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;SAC5E,MAAM,IAAI,GAAG,CAAC,WAAW,KAAK,KAAK,EAAE;AACpC,qBAAW,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,iCAAiC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;SAC3E,MAAM;AACL,gBAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;SAC7C;OACF;;;WAtWG,iBAAiB;;;AAwWvB,GAAC,CAAC,iBAAiB,GAAG,iBAAiB,CAAA;CACxC,CAAA;;;;AC5WD,YAAY,CAAA;;;;;;;;;;;;AAEZ,MAAM,CAAC,OAAO,GAAG,UAAU,CAAC,EAAE;AAC5B,MAAI,UAAU,GAAG;AACf,SAAK,EAAE,EAAE;AACT,WAAO,EAAE,EAAE;AACX,cAAU,EAAE,oBAAU,IAAI,EAAE;AAC1B,WAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE;AACxB,YAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;OAC7B;AACD,aAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;AACvB,aAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;KAC1B;AACD,WAAO,EAAE,iBAAU,SAAS,EAAE;AAC5B,UAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,SAAS,CAAA;AACxC,UAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAA;AACnC,WAAK,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE;AAC5B,YAAI,KAAK,KAAK,SAAS,CAAC,MAAM,EAAE;AAC9B,cAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;AACzB,WAAC,CAAC,UAAU,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;AACxC,mBAAS,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;SACzC;OACF;KACF;AACD,4BAAwB,EAAE,oCAAY;AACpC,UAAI,EAAE,GAAG,EAAE,CAAA;AACX,WAAK,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AAC3B,UAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,EAAE,CAAC,CAAA;OAC1D;AACD,aAAO,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;KACvB;AACD,YAAQ,EAAE,SAAS,QAAQ,GAAI;AAC7B,UAAI,IAAI,GAAG,EAAE,CAAA;AACb,WAAK,IAAI,CAAC,IAAI,UAAU,CAAC,OAAO,EAAE;AAChC,YAAI,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AACpC,cAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;SACb;OACF;AACD,UAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;AACnB,YAAI,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;AAC5B,YAAI,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAA;AAC1C,YAAI,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;AACnC,YAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAC/B,eAAO,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,EAAE,CAAA;OAC5C,MAAM;AACL,eAAO,KAAK,CAAA;OACb;KACF;AACD,YAAQ,EAAE,oBAAY;AACpB,aAAO,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;;;AAGpC,iBAAS,SAAS,GAAI;AACpB,cAAI,CAAC,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAA;AAC7B,cAAI,CAAC,EAAE;AACL,mBAAO,CAAC,EAAE;AACR,eAAC,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAA;aAC1B;AACD,sBAAU,CAAC,wBAAwB,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;WACtD,MAAM;AACL,sBAAU,CAAC,YAAY;AACrB,kBAAI,CAAC,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAA;AAC7B,kBAAI,CAAC,EAAE;AACL,iBAAC,CAAC,IAAI,CAAC,YAAY;AACjB,4BAAU,CAAC,wBAAwB,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;iBACtD,CAAC,CAAA;eACH,MAAM;AACL,uBAAO,EAAE,CAAA;eACV;aACF,EAAE,EAAE,CAAC,CAAA;WACP;SACF;AACD,kBAAU,CAAC,wBAAwB,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;OACtD,CAAC,CAAA;KACH;GACF,CAAA;AACD,GAAC,CAAC,KAAK,CAAC,UAAU,GAAG,UAAU,CAAA;;AAE/B,MAAI,aAAa,GAAG,CAAC,CAAA;;MAEf,IAAI;cAAJ,IAAI;;AACR,aADI,IAAI,CACK,CAAC,EAAE,OAAO,EAAE;4BADrB,IAAI;;AAEN,UAAI,OAAO,KAAK,SAAS,EAAE;AACzB,cAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAA;OAClD;AACD,aAAO,CAAC,IAAI,GAAG,QAAQ,CAAA;AACvB,aAAO,CAAC,uBAAuB,GAAG,KAAK,CAAA;;yEANrC,IAAI,aAOA,CAAC,EAAE,OAAO;;AAChB,YAAK,SAAS,CAAC,AAAC,aAAa,EAAE,GAAI,EAAE,CAAC,CAAC,IAAI,CAAC,YAAM;AAChD,kBAAU,CAAC,OAAO,OAAM,CAAA;OACzB,CAAC,CAAA;AACF,YAAK,UAAU,GAAG,UAAU,CAAA;AAC5B,YAAK,qBAAqB,GAAG,CAAC,CAAA;;KAC/B;;iBAbG,IAAI;;qCAcQ,MAAM,EAAE,CAAC,EAAE;AACzB,mCAfE,IAAI,gDAee,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAC;OAC5D;;;2BACK,MAAM,EAAE,OAAO,EAAE;AACrB,YAAI,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;AACvC,YAAI,MAAM,IAAI,IAAI,EAAE;AAClB,gBAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;SAChE;OACF;;;gCACU,OAAO,EAAE;AAClB,aAAK,IAAI,GAAG,IAAI,UAAU,CAAC,OAAO,EAAE;AAClC,oBAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;SACjF;OACF;;;uCACiB;AAChB,eAAO,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAA;OAC7C;;;kCACY;AACX,YAAI,IAAI,CAAC,cAAc,EAAE,EAAE;AACzB,oBAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;AACxB,qCAlCA,IAAI,2CAkCa;SAClB;AACD,eAAO,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAA;OACrC;;;mCACa;AACZ,YAAI,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE;AAC1B,oBAAU,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;AAClC,qCAzCA,IAAI,4CAyCc;SACnB;AACD,eAAO,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,EAAE,CAAA;OAC5C;;;8BACQ;AACP,YAAI,IAAI,GAAG,IAAI,CAAA;AACf,eAAO,KAAK,yBAAC;cAEL,CAAC;;;;;AADP,yBAAO,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AAC7C,qBAAC,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE;;AAC/C,wBAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;mBAChC;;yBACK,IAAI,CAAC,wBAAwB,EAAE;;;;;;;;SACtC,EAAC,CAAA;OACH;;;WAtDG,IAAI;KAAS,CAAC,CAAC,iBAAiB;;AAyDtC,GAAC,CAAC,IAAI,GAAG,IAAI,CAAA;CACd,CAAA;;;;AC1ID,YAAY,CAAA;;;;;;AAEZ,MAAM,CAAC,OAAO,GAAG,UAAU,YAAC,EAAa;;;;;;;;;;;;;MAajC,gBAAgB;;;;;;;;;;;;;;;;;;;;;;;;AAuBpB,aAvBI,gBAAgB,CAuBP,CAAC,EAAE,IAAI,EAAE;4BAvBlB,gBAAgB;;AAwBlB,UAAI,CAAC,CAAC,GAAG,CAAC;;AAAA,AAEV,UAAI,CAAC,wBAAwB,GAAG,KAAK;;AAAA,AAErC,UAAI,CAAC,aAAa,GAAG,EAAE;;AAAA,AAEvB,UAAI,CAAC,uBAAuB,GAAG,EAAE;;AAAA,AAEjC,UAAI,CAAC,2BAA2B,GAAG,KAAK;;;;;;;;;;;;AAAA,AAaxC,UAAI,CAAC,gBAAgB,GAAG,EAAE,CAAA;AAC1B,UAAI,CAAC,qBAAqB,GAAG,IAAI,CAAA;AACjC,UAAI,CAAC,mBAAmB,GAAG,EAAE,CAAA;AAC7B,UAAI,CAAC,qBAAqB,GAAG,KAAK,CAAA;AAClC,UAAI,OAAO,wBAAwB,KAAK,WAAW,EAAE;AACnD,YAAI,CAAC,YAAY,GAAG,EAAE,CAAA;OACvB;AACD,UAAI,CAAC,GAAG,GAAG,EAAE;AAAA,AACb,UAAI,CAAC,GAAG,GAAG,EAAE;AAAA,AACb,UAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAA;AACvC,UAAI,EAAE,GAAG,IAAI,CAAA;AACb,eAAS,cAAc,GAAI;AACzB,eAAO,IAAI,OAAO,CAAC,UAAC,OAAO,EAAK;AAC9B,YAAE,CAAC,kBAAkB,yBAAC;gBAET,CAAC,EACJ,GAAG;;;;;0BAFP,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAA;;;;;AAC1C,qBAAC,GAAG,CAAC;;;0BAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAA;;;;;AAC3B,uBAAG,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;kDACZ,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC;;;AAFP,qBAAC,EAAE;;;;;AAItC,sBAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAA;AACf,sBAAE,CAAC,GAAG,GAAG,EAAE,CAAA;;;AAEb,wBAAI,EAAE,CAAC,SAAS,GAAG,CAAC,EAAE;AACpB,wBAAE,CAAC,UAAU,GAAG,UAAU,CAAC,cAAc,EAAE,EAAE,CAAC,SAAS,CAAC,CAAA;qBACzD;AACD,2BAAO,EAAE,CAAA;;;;;;;;WACV,EAAC,CAAA;SACH,CAAC,CAAA;OACH;AACD,UAAI,CAAC,cAAc,GAAG,cAAc,CAAA;AACpC,UAAI,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE;AACtB,sBAAc,EAAE,CAAA;OACjB;KACF;;iBA9EG,gBAAgB;;mCA+EN;AACZ,YAAI,OAAO,wBAAwB,KAAK,WAAW,EAAE;AACnD,cAAI,qBAAO,GAAiB,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE;AAC3E,gBAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;AACzB,qBAAO,CAAC,CAAA;aACT,MAAM;AACL,qBAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;aACzB;WACF,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACtE,cAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;SAChC;OACF;;;qCACe;AACd,eAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;OAC1C;;;6CACuB;AACtB,YAAI,IAAI,GAAG,IAAI,CAAA;AACf,eAAO,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;AACpC,cAAI,CAAC,kBAAkB,yBAAC;gBAClB,yBAAI,EAGC,CAAC,EACJ,EAAE;;;;;AAJJ,wBAAI,GAAwB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;;AACzD,wBAAI,CAAC,GAAG,GAAG,EAAE,CAAA;AACb,wBAAI,CAAC,GAAG,GAAG,EAAE,CAAA;AACJ,qBAAC,GAAG,CAAC;;;0BAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;;;;;mDACb,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;;AAAtC,sBAAE;;AACN,2BAAO,EAAE,CAAC,EAAE,CAAA;mDACL,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;;;AAHG,qBAAC,EAAE;;;;;AAKpC,2BAAO,EAAE,CAAA;;;;;;;;WACV,EAAC,CAAA;SACH,CAAC,CAAA;OACH;;;;;;;;;;;;;4CAasB,EAAE,EAAE,IAAI,EAAE;AAC/B,YACE,EAAE,CAAC,EAAE,IAAI,IAAI,IACb,EAAE,CAAC,OAAO,KAAK,IAAI,IACnB,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,IACzB,IAAI,IAAI,IAAI,IACZ,IAAI,CAAC,OAAO,KAAK,IAAI,EACrB;AACA,YAAE,CAAC,EAAE,GAAG,IAAI,CAAA;AACZ,cAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;AACpB,iBAAO,IAAI,CAAA;SACZ,MAAM;AACL,iBAAO,KAAK,CAAA;SACb;OACF;;;iDAC2B,EAAE,EAAE;AAC9B,iBAAS,MAAM,CAAE,CAAC,EAAE;AAClB,iBAAO,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;SACrC;AACD,YAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;AAClC,YAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;AAClC,eAAO,EAAE,CAAC,EAAE,CAAA;OACb;;;gCACU;AACT,qBAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;AAC9B,YAAI,CAAC,UAAU,GAAG,IAAI,CAAA;OACvB;;;gCACU,MAAM,EAAE;AACjB,YAAI,IAAI,GAAG,IAAI,CAAA;AACf,eAAO,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;AACpC,cAAI,CAAC,kBAAkB,yBAAC;gBAElB,KAAK;;;;;AADT,wBAAI,CAAC,MAAM,GAAG,MAAM,CAAA;mDACD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;;;AAApC,yBAAK;;AACT,wBAAI,CAAC,OAAO,GAAG,KAAK,CAAC,KAAK,CAAA;AAC1B,wBAAI,IAAI,CAAC,qBAAqB,IAAI,IAAI,EAAE;AACtC,0BAAI,CAAC,qBAAqB,EAAE,CAAA;AAC5B,0BAAI,CAAC,qBAAqB,GAAG,IAAI,CAAA;qBAClC;AACD,2BAAO,EAAE,CAAA;;;;;;;;WACV,EAAC,CAAA;SACH,CAAC,CAAA;OACH;;;oCACc,CAAC,EAAE;AAChB,YAAI,IAAI,CAAC,MAAM,IAAI,IAAI,EAAE;AACvB,WAAC,EAAE,CAAA;SACJ,MAAM;AACL,cAAI,CAAC,qBAAqB,GAAG,CAAC,CAAA;SAC/B;OACF;;;oCACc;AACb,YAAI,IAAI,CAAC,WAAW,IAAI,IAAI,EAAE;AAC5B,iBAAO,IAAI,CAAC,WAAW,CAAA;SACxB,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,EAAE;AAC9B,gBAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAA;SACvD,MAAM;AACL,iBAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAA;SACrC;OACF;;;;;;;;;;;4BASM,GAAG,EAAE;AACV,aAAK,IAAI,GAAG,IAAI,GAAG,EAAE;AACnB,cAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;AAChB,cAAI,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;AAChD,cAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;SACtC;OACF;;;;;;;;0CAKoB,GAAG,EAAE,EAAE,EAAE;AAC5B,YAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;AAClB,cAAI,QAAQ,GAAG;AACb,cAAE,EAAE,EAAE;AACN,mBAAO,EAAE,GAAG,CAAC,MAAM;WACpB,CAAA;;AAED,eAAK,IAAI,GAAG,IAAI,GAAG,EAAE;AACnB,gBAAI,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;AACjB,gBAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAA;AAC5B,gBAAI,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;AAC/B,gBAAI,CAAC,IAAI,IAAI,EAAE;AACb,eAAC,GAAG,EAAE,CAAA;AACN,kBAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;aAC5B;AACD,aAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;WACjB;SACF,MAAM;AACL,cAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC;AAChC,cAAE,EAAE,EAAE;WACP,CAAC,CAAA;SACH;;AAED,YAAI,IAAI,CAAC,2BAA2B,EAAE;AACpC,iBAAM;SACP;;AAED,YAAI,CAAC,2BAA2B,GAAG,IAAI,CAAA;AACvC,YAAI,KAAK,GAAG,IAAI,CAAA;;AAEhB,YAAI,CAAC,kBAAkB,yBAAC;cAClB,MAAM,EAGN,EAAE,EAiBO,GAAG,EAEN,CAAC,EATF,GAAG,EACN,CAAC,EACD,EAAE,EACF,EAAE,EAKE,QAAQ;;;;;AArBd,wBAAM,GAAG,KAAK,CAAC,uBAAuB;;AAC1C,uBAAK,CAAC,uBAAuB,GAAG,EAAE,CAAA;;AAE9B,oBAAE,GAAG,KAAK,CAAC,aAAa;;AAC5B,uBAAK,CAAC,aAAa,GAAG,EAAE,CAAA;;AAExB,uBAAK,CAAC,2BAA2B,GAAG,KAAK,CAAA;;AAEhC,qBAAG,GAAG,CAAC;;;wBAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAA;;;;;AAC/B,mBAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE;iDACf,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;;;AAFA,qBAAG,EAAE;;;;;yDAK5B,EAAE;;;;;;;;AAAT,qBAAG;AACN,mBAAC,GAAG,EAAE,CAAC,GAAG,CAAC;AACX,oBAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;iDACR,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;;;AAAjC,oBAAE;;wBACF,EAAE,IAAI,IAAI,CAAA;;;;;AACZ,uBAAK,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;;;;;yDAEZ,CAAC;;;;;;;;AAAR,qBAAG;AACN,0BAAQ,GAAG,CAAC,CAAC,GAAG,CAAC;AACjB,mBAAC,GAAG,QAAQ,CAAC,EAAE;;wBACf,EAAE,QAAQ,CAAC,OAAO,KAAK,CAAC,CAAA;;;;;iDACnB,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;;;;;;;;;;;;;;;;SAK9C,EAAC,CAAA;OACH;;;;;;;;;;;;;;yDAWa,EAAE;YAMR,OAAO,EAEL,kBAAkB;;;;;AAP1B,oBAAI,CAAC,KAAK,CAAC,UAAU,CAAC,0CAA0C,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;;sBACtF,EAAE,CAAC,MAAM,KAAK,QAAQ,CAAA;;;;;+CACjB,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;;;+CACtC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC;;;;;;;+CAErB,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC;;;AAAzC,uBAAO;;sBACP,OAAO,IAAI,IAAI,CAAA;;;;;+CACe,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC;;;AAA1D,kCAAkB;;oBACjB,kBAAkB;;;;;+CACd,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;;;+CAC1C,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;;;+CACrB,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC;;;;;;;;;;;;;6DAMhC,WAAW,EAAE,EAAE;YAEzB,MAAM,EAEJ,IAAI,EAUN,CAAC,EACD,KAAK,EAUL,GAAG,EACH,CAAC,EAIM,GAAG,EACN,QAAQ,EAMZ,CAAC,EAGD,WAAW,EAET,KAAK;;;;;sBAzCT,EAAE,CAAC,MAAM,KAAK,QAAQ,CAAA;;;;;+CACJ,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC;;;AAAnD,sBAAM;;sBACN,MAAM,IAAI,IAAI,CAAA;;;;;AACZ,oBAAI,GAAG,WAAW,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;;sBACxE,IAAI,IAAI,IAAI,CAAA;;;;;+CACP,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE;AAChC,wBAAM,EAAE,QAAQ;AAChB,wBAAM,EAAE,EAAE,CAAC,MAAM;iBAClB,CAAC;;;;;;;;AAKF,iBAAC,GAAG,EAAE;+CACS,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;;;AAA7C,qBAAK;;;sBACF,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;;;;;;AAEjE,qBAAK,CAAC,KAAK,EAAE,CAAA;+CACN,WAAW,CAAC,wBAAwB,CAAC,KAAK,CAAC;;;+CACvC,WAAW,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;;;AAAxC,iBAAC;;;;;+CAEI,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC;;;;;AAG9B,mBAAG,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;AAC3B,iBAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;;AAC/B,uBAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;;AAE9B,oBAAI,CAAC,IAAI,IAAI,EAAE;AACb,uBAAS,GAAG,IAAI,CAAC,EAAE;AACb,4BAAQ,GAAG,CAAC,CAAC,GAAG,CAAC;;AACrB,wBAAI,EAAE,QAAQ,CAAC,OAAO,KAAK,CAAC,EAAE;AAC5B,0BAAI,CAAC,mBAAmB,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAA;qBAC1C;mBACF;iBACF;AACG,iBAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;;;;+CAG/B,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;;;AAAjD,2BAAW;;sBACX,CAAC,EAAE,CAAC,OAAO,IAAI,WAAW,CAAA;;;;;AACxB,qBAAK,GAAG;AACV,wBAAM,EAAE,QAAQ;AAChB,wBAAM,EAAE,EAAE,CAAC,EAAE;iBACd;+CACM,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC;;;sBAIxD,CAAC,IAAI,IAAI,CAAA;;;;;+CACJ,CAAC,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;;;;;;;;;;;iDAIhC;AAC1B,YAAI,IAAI,CAAC,qBAAqB,EAAE;AAC9B,cAAI,IAAI,CAAC,oBAAoB,IAAI,IAAI,EAAE;AACrC,gBAAI,OAAO,CAAA;AACX,gBAAI,OAAO,GAAG,IAAI,OAAO,CAAC,UAAU,CAAC,EAAE;AACrC,qBAAO,GAAG,CAAC,CAAA;aACZ,CAAC,CAAA;AACF,gBAAI,CAAC,oBAAoB,GAAG;AAC1B,qBAAO,EAAE,OAAO;AAChB,qBAAO,EAAE,OAAO;aACjB,CAAA;AACD,mBAAO,OAAO,CAAA;WACf,MAAM;AACL,mBAAO,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAA;WACzC;SACF,MAAM;AACL,iBAAO,OAAO,CAAC,OAAO,EAAE,CAAA;SACzB;OACF;;;uCACiB;AAChB,YAAI,IAAI,CAAC,mBAAmB,CAAC,MAAM,KAAK,CAAC,EAAE;AACzC,cAAI,CAAC,qBAAqB,GAAG,KAAK,CAAA;AAClC,cAAI,IAAI,CAAC,oBAAoB,IAAI,IAAI,EAAE;AACrC,gBAAI,CAAC,oBAAoB,CAAC,OAAO,EAAE,CAAA;AACnC,gBAAI,CAAC,oBAAoB,GAAG,IAAI,CAAA;WACjC;AACD,iBAAO,IAAI,CAAA;SACZ,MAAM;AACL,iBAAO,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAA;SACxC;OACF;;;yCACmB,kBAAO,EAAY,eAAe,EAAE;AACtD,YAAI,IAAI,IAAI,eAAe,EAAE;;AAC3B,cAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;AACtC,cAAI,CAAC,IAAI,CAAC,qBAAqB,EAAE;AAC/B,gBAAI,CAAC,qBAAqB,GAAG,IAAI,CAAA;AACjC,gBAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAA;WACrC;SACF,MAAM;AACL,cAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;AACtC,cAAI,CAAC,IAAI,CAAC,qBAAqB,EAAE;AAC/B,gBAAI,CAAC,qBAAqB,GAAG,IAAI,CAAA;AACjC,gBAAI,IAAI,GAAG,IAAI,CAAA;AACf,sBAAU,CAAC,YAAY;AACrB,kBAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAA;aACrC,EAAE,CAAC,CAAC,CAAA;WACN;SACF;OACF;;;WAxYG,gBAAgB;;;AA0YtB,GAAC,CAAC,gBAAgB,GAAG,gBAAgB,CAAA;CACtC,CAAA;;;;AC1ZD,YAAY;;;;;;;;;;;;;;;;;;;;AAAA;AAoBZ,MAAM,CAAC,OAAO,GAAG,UAAU,YAAC,EAAY;AACtC,MAAI,MAAM,GAAG;;;;;;;AAQX,UAAM,EAAE;AACN,YAAM,EAAE,gBAAU,EAAE,EAAE;AACpB,eAAO,EAAE,CAAA;OACV;AACD,iBAAW,EAAE,qBAAU,EAAE,EAAE;AACzB,eAAO,EAAE;AAAA,OACV;AACD,aAAO,0BAAE,iBAAY,EAAE;;;;;8CACP,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,MAAM,CAAC;;;;;;;;;;;OAC9C,CAAA;KACF;AACD,UAAM,EAAE;;;;;;;;;;;AAWN,YAAM,EAAE,gBAAU,mBAAE,kBAAmC;;;AAGrD,YAAI,YAAC,GAAa;AAChB,YAAE,EAAE,EAAE,CAAC,EAAE;AACT,cAAI,EAAE,EAAE,CAAC,IAAI;AACb,eAAK,EAAE,EAAE,CAAC,KAAK;AACf,gBAAM,EAAE,EAAE,CAAC,MAAM;AACjB,gBAAM,EAAE,EAAE,CAAC,MAAM;AACjB,gBAAM,EAAE,EAAE,CAAC,MAAM;SAClB,CAAA;AACD,YAAI,EAAE,CAAC,SAAS,IAAI,IAAI,EAAE;AACxB,WAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAA;SAC3B;AACD,YAAI,EAAE,CAAC,SAAS,IAAI,IAAI,EAAE;AACxB,WAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAA;SAC3B,MAAM;AACL,WAAC,CAAC,OAAO,GAAG,EAAE,CAAC,OAAO,CAAA;SACvB;;AAED,eAAO,CAAC,CAAA;OACT;AACD,iBAAW,EAAE,qBAAU,EAAE,EAAE;AACzB,YAAI,GAAG,GAAG,EAAE,CAAA;AACZ,YAAI,EAAE,CAAC,IAAI,IAAI,IAAI,EAAE;AACnB,aAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;SAClB;AACD,YAAI,EAAE,CAAC,KAAK,IAAI,IAAI,EAAE;AACpB,aAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;SACnB;AACD,YAAI,EAAE,CAAC,MAAM,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE;AAChE,aAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;SACpB;;AAAA,AAED,WAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;;AAEnB,YAAI,EAAE,CAAC,SAAS,IAAI,IAAI,EAAE;AACxB,aAAG,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,CAAA;SACvB;AACD,eAAO,GAAG,CAAA;OACX;AACD,yBAAmB,0BAAE,6BAAY,EAAE;YAI3B,CAAC,EACD,CAAC;;;;;sBAJH,EAAE,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;kDACV,CAAC;;;AAEJ,iBAAC,GAAG,CAAC;+CACM,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC;;;AAArC,iBAAC;;;oBACG,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,MAAM,EAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAE;;;;;AACtD,iBAAC,EAAE,CAAA;;sBACC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;;;;+CAGL,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC;;;AAApC,iBAAC;;;;;;;kDAGE,CAAC;;;;;;;;OAEX,CAAA;;;;;;;;;;;;;;;;AAgBD,aAAO,0BAAE,iBAAW,EAAE;YAChB,CAAC,EACD,gBAAgB,EAChB,CAAC,EACD,MAAM,EACN,KAAK,EAQH,OAAO,EAQL,eAAe,EA4BnB,IAAI,EACJ,KAAK;;;;;+CAhDyB,MAAM,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;;;AAA9E,gCAAgB,GAAG,CAAC;;sBAMpB,EAAE,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;+CACN,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC;;;AAArC,iBAAC;;sBACI,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+BAAI,IAAI;;;;;+CAAU,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;;;;AAAhE,iBAAC;;;;;+CAEe,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC;;;AAA5C,sBAAM;AACF,uBAAO,GAAG,EAAE,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,KAAK;;sBAC5D,OAAO,IAAI,IAAI,CAAA;;;;;+BAAG,IAAI;;;;;+CAAU,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;;;;;;AAAlE,qBAAK;;AACL,iBAAC,GAAG,KAAK,CAAA;;;qBAIJ,IAAI;;;;;sBACL,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,CAAA;;;;;+CACrB,MAAM,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;;;AAAxE,+BAAe;;sBACf,eAAe,KAAK,CAAC,CAAA;;;;;;AAEvB,oBAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;AACtB,oBAAE,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAA;AACd,kCAAgB,GAAG,CAAC,GAAG,CAAC,CAAA;iBACzB;;;;;sBACQ,eAAe,GAAG,CAAC,CAAA;;;;;;AAE5B,oBAAI,CAAC,GAAG,gBAAgB,IAAI,eAAe,EAAE;AAC3C,oBAAE,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAA;AACd,kCAAgB,GAAG,CAAC,GAAG,CAAC,CAAA;iBACzB;;;;;;;;AAIH,iBAAC,EAAE,CAAA;;sBACC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACN,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;AAArC,iBAAC;;;;;AAED,iBAAC,GAAG,IAAI,CAAA;;;;;;;;;;;;;;;;AAQV,oBAAI,GAAG,IAAI;AACX,qBAAK,GAAG,IAAI;;sBACZ,MAAM,IAAI,IAAI,CAAA;;;;;+CACA,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC;;;AAA5C,sBAAM;;;sBAIJ,EAAE,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;+CACH,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC;;;AAAxC,oBAAI;;AACJ,kBAAE,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;AACrB,oBAAI,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE,CAAA;;+CAEX,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;;;;;;;AAE9B,kBAAE,CAAC,KAAK,GAAG,EAAE,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,KAAK,CAAA;;;sBAGvE,EAAE,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACH,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,KAAK,CAAC;;;AAA1C,qBAAK;;AACL,qBAAK,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;;;AAAA,AAGlB,oBAAI,KAAK,CAAC,EAAE,IAAI,IAAI,EAAE;AACpB,sBAAI,CAAC,KAAK,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAA;iBAC7C;+CACM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;;sBAI7B,EAAE,CAAC,SAAS,IAAI,IAAI,CAAA;;;;;sBAClB,IAAI,IAAI,IAAI,CAAA;;;;;AACd,sBAAM,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,CAAA;+CACzB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;;;sBAI9B,EAAE,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACX,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC;;;sBAEzC,EAAE,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;+CACV,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC;;;;;;;sBAGtC,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAA;;;;;AAC/B,oBAAI,KAAK,IAAI,IAAI,EAAE;AACjB,wBAAM,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,CAAA;iBACnB;AACD,oBAAI,IAAI,IAAI,IAAI,EAAE;AAChB,wBAAM,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE,CAAA;iBACrB;+CACM,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;;;;;;;;OAGrC,CAAA;KACF;AACD,QAAI,EAAE;;;;;;;;;;AAUJ,YAAM,EAAE,gBAAU,EAAE,EAAE;AACpB,eAAO;AACL,gBAAM,EAAE,MAAM;AACd,YAAE,EAAE,EAAE,CAAC,EAAE;AACT,cAAI,EAAE,EAAE,CAAC,IAAI;SACd,CAAA;OACF;AACD,iBAAW,EAAE,uBAAY;;;;;;;;;;;AAWvB,eAAO,EAAE,CAAA;OACV;AACD,aAAO,0BAAE,iBAAY,EAAE;;;;;AACrB,kBAAE,CAAC,KAAK,GAAG,IAAI,CAAA;AACf,kBAAE,CAAC,GAAG,GAAG,IAAI,CAAA;;;;;;;;OACd,CAAA;AACD,SAAG,0BAAE,aAAY,EAAE,EAAE,GAAG;YAIlB,GAAG,EACH,CAAC;;;;;sBAJD,EAAE,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;kDACX,IAAI;;;AAET,mBAAG,GAAG,IAAI;+CACC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,KAAK,CAAC;;;AAAtC,iBAAC;;;qBAEE,IAAI;;;;;AACT,oBAAI,CAAC,CAAC,CAAC,OAAO,EAAE;AACd,qBAAG,GAAG,CAAC,CAAA;AACP,qBAAG,EAAE,CAAA;iBACN;;sBACG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CAClB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;AAArC,iBAAC;;;;;;;;;;;;kDAKE,GAAG;;;;;;;;OACX,CAAA;AACD,SAAG,0BAAE,aAAY,CAAC,EAAE,CAAC;YAEf,GAAG,EAED,SAAS;;;;;AAHf,iBAAC,GAAG,CAAC,CAAC,KAAK,CAAA;AACP,mBAAG,GAAG,EAAE;;;sBACL,CAAC,IAAI,IAAI,CAAA;;;;;+CACS,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;;;AAAvC,yBAAS;;AACb,oBAAI,CAAC,SAAS,CAAC,OAAO,EAAE;AACtB,qBAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAA;iBACvB;AACD,iBAAC,GAAG,SAAS,CAAC,KAAK,CAAA;;;;;kDAEd,GAAG;;;;;;;;OACX,CAAA;KACF;AACD,OAAG,EAAE;;;;;;;;;AASH,YAAM,EAAE,gBAAU,EAAE,EAAE;AACpB,eAAO;AACL,gBAAM,EAAE,KAAK;AACb,cAAI,EAAE,EAAE,CAAC,IAAI;AACb,YAAE,EAAE,EAAE,CAAC,EAAE;AACT,aAAG,EAAE,EAAE;AAAA,SACR,CAAA;OACF;AACD,iBAAW,EAAE,uBAAY;AACvB,eAAO,EAAE,CAAA;OACV;AACD,aAAO,0BAAE;;;;;;;;;;OAAgB,CAAA;;;;AAIzB,SAAG,0BAAE,aAAY,EAAE,EAAE,IAAI;YACnB,GAAG,EAED,GAAG;;;;;AAFL,mBAAG,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;;sBAClB,GAAG,IAAI,IAAI,CAAA;;;;;+CACI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC;;;AAAnC,mBAAG;;sBACH,GAAG,IAAI,IAAI,IAAI,GAAG,CAAC,OAAO,CAAA;;;;;kDACrB,KAAK,CAAC;;;sBACJ,GAAG,CAAC,SAAS,IAAI,IAAI,CAAA;;;;;kDACvB,GAAG,CAAC,OAAO;;;+CAEJ,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;;;;;;;;;;;OAG9C,CAAA;KACF;GACF,CAAA;AACD,GAAC,CAAC,MAAM,GAAG,MAAM,CAAA;CAClB,CAAA;;;;AC/UD,YAAY;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;;;;;AA2EZ,MAAM,CAAC,OAAO,GAAG,UAAU,YAAC,EAAY;MAChC,oBAAoB;aAApB,oBAAoB;4BAApB,oBAAoB;;;iBAApB,oBAAoB;;;;;;;;;;;;;;sDAYb,EAAE;YACP,GAAG,EACH,CAAC,EAEC,gCAAE;;;;;AAHJ,mBAAG,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;AACxB,iBAAC,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC;;sBACpC,CAAC,IAAI,IAAI,CAAA;;;;;8CACkC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;;;AAA9D,kBAAE;;sBACF,EAAE,IAAI,IAAI,CAAA;;;;;8CACD,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;;;AAAzD,iBAAC;;AACD,oBAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;;;iDAGjC,CAAC;;;;;;;;;;;;;;;;;qEAOgB,GAAG;YACvB,IAAI,EACC,CAAC,EACJ,EAAE;;;;;AAFJ,oBAAI,GAAG,EAAE;AACJ,iBAAC,GAAG,CAAC;;;sBAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAA;;;;;AACxB,kBAAE,GAAG,GAAG,CAAC,CAAC,CAAC;+CACR,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;;;AAC3C,oBAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAA;;;AAHX,iBAAC,EAAE;;;;;AAKnC,oBAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,cAAc,EAAE,EAAE;;;AAE5C,sBAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC;AAC/B,wBAAI,EAAE,QAAQ;AACd,uBAAG,EAAE,IAAI;mBACV,CAAC,CAAA;iBACH;;;;;;;;;;;yDAGW,KAAK;;;;;qBACb,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ;;;;;;sBAC1B,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAA;;;;;+CACtC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;;AAAvC,qBAAK;;AACL,qBAAK,CAAC,EAAE,GAAG,IAAI,CAAA;+CACR,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;;;AAE/B,oBAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;AAC7B,qBAAK,GAAG,KAAK,CAAC,KAAK,CAAA;;;;;;;;;;;;;;;;;;;;;;;;8DAUN,QAAQ,EAAE,eAAe;YACtC,MAAM,EACN,QAAQ,EA6BG,IAAI,EAWb,IAAI,EAiBJ,KAAK;;;;;+CA1DS,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;;;AAA3C,sBAAM;AACN,wBAAQ,GAAG,KAAK;;sBAEhB,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAA;;;;;+CAC5B,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;;;sBAG/B,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,EAAE,IAAI,IAAI,CAAA;;;;;oBAChC,MAAM,CAAC,OAAO;;;;;AACjB,wBAAQ,GAAG,IAAI;;AAAA,AAEf,sBAAM,CAAC,OAAO,GAAG,IAAI;;;;;;;;;;;;;AAAA;sBAajB,MAAM,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CAEf,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC;;;+CAC7B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;;;sBAE/B,MAAM,CAAC,GAAG,IAAI,IAAI,CAAA;;;;;uDACH,MAAM,CAAC,GAAG;;;;;;;;AAAlB,oBAAI;+CACJ,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;;;;;;;+CAGnC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;;;sBAE/B,MAAM,CAAC,SAAS,IAAI,IAAI,CAAA;;;;;+CACnB,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,CAAC;;;AAC7C,sBAAM,CAAC,SAAS,GAAG,IAAI,CAAA;;;sBAIvB,MAAM,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;+CACP,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC;;;AAA5C,oBAAI;;;;;AAEJ,oBAAI,GAAG,IAAI,CAAA;;;;AAGb,oBAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,MAAM,EAAE,IAAI,CAAC;;;AAAA,+CAGvC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;;;sBAQ5B,MAAM,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACP,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC;;;AAA9C,qBAAK;;;;;AAEL,qBAAK,GAAG,IAAI,CAAA;;;sBAGZ,KAAK,IAAI,IAAI,IACb,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;;;;;+CAExC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;;kDAE1B,QAAQ;;;;;;;;;;;;;;;mEAMK,EAAE;YAEpB,CAAC,EAIG,MAAM,EAOR,IAAI,EACJ,IAAI;;;;;+CAZK,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;;;AAA/B,iBAAC;;oBACA,CAAC,CAAC,EAAE;;;;;sBACH,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;;;;;;AAEb,sBAAM,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA,AAAC;;AACtC,iBAAC,CAAC,GAAG,IAAI,MAAM,CAAA;+CACR,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;AACrB,iBAAC,GAAG,EAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAC,CAAA;+CAC7B,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;+CAGL,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;;;AAAlC,oBAAI;+CACU,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;;;AAAlC,oBAAI;;sBAEJ,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;;;;;+CAEtB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,KAAK,EAAC,CAAC;;;AACvE,iBAAC,CAAC,GAAG,GAAG,CAAC,CAAA;;;;AAGX,iBAAC,CAAC,EAAE,GAAG,IAAI;;AAAA;sBAGT,IAAI,IAAI,IAAI,IACZ,IAAI,CAAC,EAAE,IACP,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAA;;;;;AAE7D,oBAAI,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAA;+CACV,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;;;AAC3B,iBAAC,GAAG,IAAI;;AAAA;;sBAKR,IAAI,IAAI,IAAI,IACZ,IAAI,CAAC,EAAE,IACP,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;;;;;AAEvD,iBAAC,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAA;+CACV,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;;;+CAEzB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;;;;;;;;;;;;;;0DAQV,EAAE;YAEX,CAAC,EAmBD,IAAI;;;;;+CAnBO,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC;;;AAAzC,iBAAC;;sBACD,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAA;;;;;sBAC5B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAA;;;;;kDAEtC,CAAC;;;sBACC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;;;;;;AAE3C,iBAAC,CAAC,GAAG,EAAE,CAAA;;;;;;AAGP,iBAAC,GAAG,EAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAC,CAAA;+CACxB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;;;;;;AAIvB,iBAAC,GAAG,EAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAC,CAAA;+CACxB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;+CAGL,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;;;AAApC,oBAAI;;sBAEN,IAAI,IAAI,IAAI,IACZ,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,IACvD,CAAC,IAAI,CAAC,EAAE,CAAA;;;;;AAER,iBAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAA;+CACjB,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;;;+CAEzB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;kDACd,CAAC;;;;;;;;;;;;;;;;;;;;;;+CAQD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,0BAAE,iBAAY,EAAE;sBAE/C,IAAI;;;;;gCADN,EAAE,CAAC,OAAO,IAAI,EAAE,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;yDACb,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC;;;AAAxC,8BAAI;;AACR,8BAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;;;;;;;;iBAE7C,EAAC;;;;;;;;;;;;;;;;;;;;;sEAWuB,EAAE;YAGvB,KAAK,EAWL,CAAC,EAWG,IAAI,EAOJ,KAAK,EAKH,SAAS,EAEP,UAAU,EAaV,CAAC,EACD,GAAG,EAwBP,yBAAM,EACN,SAAS;;;;;AA7EjB,oBAAI,CAAC,KAAK,CAAC,UAAU,CAAC,sCAAsC,EAAE,EAAE,EAAE,GAAG,CAAC;;AAAA,+CAEnD,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;;;AAAnC,qBAAK;;sBACL,KAAK,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,CAAA;;;;;AACvB,qBAAK,CAAC,KAAK,EAAE;;AAAA,+CAEN,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;;;+CAEpC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;;;+CAEtB,IAAI,CAAC,oBAAoB,CAAC,EAAE,CAAC;;;+CAGrB,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;;;AAAhC,iBAAC;;sBACD,CAAC,IAAI,IAAI,CAAA;;;;;sBASP,CAAC,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;+CACE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC;;;AAAvC,oBAAI;;AACR,oBAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;+CACb,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;;;sBAI5B,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;AAAzC,qBAAK;;AACT,qBAAK,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;;qBACf,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC;;;;;;;;AAGpC,yBAAS,GAAG,CAAC,CAAC,IAAI;;;sBACf,SAAS,IAAI,IAAI,CAAA;;;;;+CACE,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC;;;AAAhD,0BAAU;;qBACV,UAAU,CAAC,OAAO;;;;;;;;AAGtB,yBAAS,GAAG,UAAU,CAAC,IAAI,CAAA;;;;;;;AAI7B,qBAAK,CAAC,MAAM,GAAG,SAAS;;;;AAAA;sBAIpB,KAAK,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACN,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC;;;AAAzC,iBAAC;AACD,mBAAG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;;;qBAClB,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;AAC5B,yBAAO,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAA;iBACxC,CAAC;;;;;qBACI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC;;;;;;AAEpC,iBAAC,CAAC,MAAM,GAAG,SAAS,CAAA;+CACb,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;;;sBAGzB,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;;;;+CAGN,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;AAArC,iBAAC;;;;;;;+CAMF,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;;sBAG7B,CAAC,CAAC,MAAM,IAAI,IAAI,CAAA;;;;;+CAEqB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC;;;AAA9D,sBAAM;AACN,yBAAS,GAAG,KAAK;;AACrB,oBAAI,CAAC,CAAC,SAAS,IAAI,IAAI,EAAE;AACvB,sBAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;AACrD,6BAAS,GAAG,IAAI,CAAA;AAChB,0BAAM,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,KAAK,CAAA;mBAClC;iBACF,MAAM;AACL,sBAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;;AAE1C,6BAAS,GAAG,IAAI,CAAA;AAChB,0BAAM,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;mBACvB;AACD,sBAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;;AAExC,6BAAS,GAAG,IAAI,CAAA;AAChB,0BAAM,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAA;mBACpB;iBACF;;qBACG,SAAS;;;;;+CACJ,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;;;+CAI7B,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC;;;;;;;;;;;uEAGT,KAAK;YAC3B,CAAC;;;;;gDAAU,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;;;AAAhE,iBAAC;;AACL,oBAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,EAAE;AAC/C,uBAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;iBACrD;;;;;;;;;;;;;;;;6DAMe,EAAE;YACd,SAAS,EACJ,eAAe,EAMf,IAAI,EACP,EAAE,EACF,GAAG,EACH,CAAC,EA+CE,CAAC,EACJ,GAAG,EACH,EAAE,EAEF,YAAY,EAWZ,GAAG;;;;;AAvEA,+BAAe,YAAf,eAAe,CAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE;AAC9C,uBAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AACxC,6BAAS,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;mBAC9B;iBACF;;AALG,yBAAS,GAAG,EAAE;wDAOD,EAAE;;;;;;;;AAAV,oBAAI;AACP,kBAAE,GAAG,EAAE,CAAC,IAAI,CAAC;AACb,mBAAG,GAAG,CAAC;AACP,iBAAC,GAAG,EAAE,CAAC,GAAG,CAAC;gDACR,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,CAAC,0BAAE,kBAAY,CAAC;sBAYvE,IAAI;;;;;gCADH,CAAC,IAAI,IAAI,CAAA;;;;;AACV,8BAAI,GAAG,CAAC;;gCACR,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;;;;;;;;AAGpB,8BAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;;;;AAIzB,gCAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACrC,2CAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;2BACxC,MAAM;;AAEL,gCAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAAA,AAC7B,gCAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;;;AAGjB,6CAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;6BACxD;2BACF;;;AACD,8BAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;;AAEhB,6BAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;2BACd,MAAM;AACL,6BAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;AAAA,AAClB,6BAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;AAAA,2BACnB;;;;;;;;;;iBAEJ,EAAC;;;;AAEF,uBAAO,GAAG,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;AAC7B,mBAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAA;AACX,iCAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;iBACxC;;;;;AAEM,iBAAC,GAAG,CAAC;;;sBAAE,CAAC,GAAG,SAAS,CAAC,MAAM,CAAA;;;;;AAC9B,mBAAG,GAAG,SAAS,CAAC,CAAC,CAAC;AAClB,kBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;;;gDAEC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC;;;AAA9C,4BAAY;;qBACZ,YAAY;;;;;gDAEP,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,EAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAC,CAAC;;;qBAEpE,GAAG,CAAC,CAAC,CAAC;;;;;gDAED,IAAI,CAAC,uBAAuB,CAAC,EAAE,CAAC;;;AAXL,iBAAC,EAAE;;;;;AAczC,oBAAI,IAAI,CAAC,KAAK,CAAC,wBAAwB,EAAE;AACnC,qBAAG,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE;AACnC,2BAAO,EAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC,CAAA;mBAChD,CAAC;;AACF,sBAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC;AAC/B,wBAAI,EAAE,QAAQ;AACd,uBAAG,EAAE,GAAG;mBACT,CAAC,CAAA;iBACH;;;;;;;;;;;iEAEmB,EAAE;YAClB,CAAC;;;;;gDAAU,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC;;;AAAzC,iBAAC;mDACE,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE;;;;;;;;;;;;;;;;YAMpE,EAAE;;;;;AAAF,kBAAE,GAAG,EAAE;gDACJ,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,0BAAE,kBAAY,CAAC;sBAChD,IAAI,EACJ,OAAO,EACP,GAAG,EACH,EAAE,EACF,EAAE;;;;;AAJF,8BAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACd,iCAAO,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACjB,6BAAG,GAAG,CAAC,CAAC,GAAG;AACX,4BAAE,GAAG,CAAC,CAAC,EAAE;AACT,4BAAE,GAAG,EAAE,CAAC,IAAI,CAAC;;AACjB,8BAAI,EAAE,KAAK,KAAK,CAAC,EAAE;AACjB,8BAAE,GAAG,EAAE,CAAA;AACP,8BAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;2BACd;AACD,4BAAE,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAA;;;;;;;;iBAC5B,EAAC;;;mDACK,EAAE;;;;;;;;;;;wDAEE,EAAE;YACT,CAAC;;;;;gDAAU,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC;;;AAAzC,iBAAC;mDACE,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG;;;;;;;;;;;2DAElD,EAAE;;;;;gDACT,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;;;mDACf,EAAE;;;;;;;;;;;2DAEK,EAAE;;;;;gDACT,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;;;AACtB,oBAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,cAAc,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,wBAAwB,EAAE;;AAEnF,sBAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC;AAC/B,wBAAI,EAAE,QAAQ;AACd,uBAAG,EAAE,CAAC,EAAE,CAAC;mBACV,CAAC,CAAA;iBACH;;;;;;;;;;;2DAEa,aAAE;YACZ,CAAC,EAMG,QAAQ;;;;;gDAND,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;;;AAA3B,iBAAC;;sBACD,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAA;;;;;mDACrB,CAAC;;;sBAGJ,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,IAAI,CAAA;;;;;AAC5B,wBAAQ,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;;AAClC,oBAAI,CAAC,KAAK,CAAC,WAAW,GAAG,EAAE,CAAA;gDACpB,CAAC,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;;;AACxC,uBAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAA;gDACf,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;;;;;;mDAGvB,IAAI;;;;;;;;;;;8DAIE,EAAE;;;;;gDACZ,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;;;;;;;;;;;uDAEf,KAAK;YACX,GAAG;;;;;AAAH,mBAAG,GAAG;AACR,oBAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;AAChB,uBAAK,EAAE,KAAK,CAAC,KAAK;iBACnB;gDACM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC;;;;;;;;;;;uDAEb,IAAI;YACV,CAAC,EACD,KAAK;;;;;gDADM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;;;AAA/B,iBAAC;AACD,qBAAK,GAAG,CAAC,IAAI,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK;;AACtC,oBAAI,KAAK,IAAI,IAAI,EAAE;AACjB,uBAAK,GAAG,CAAC,CAAA;iBACV;mDACM;AACL,sBAAI,EAAE,IAAI;AACV,uBAAK,EAAE,KAAK;iBACb;;;;;;;;;;;;YAGG,WAAW;;;;;AAAX,2BAAW,GAAG,EAAE;gDACb,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,0BAAE,kBAAY,CAAC;;;;;AACpD,qCAAW,CAAC,IAAI,CAAC;AACf,gCAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACb,iCAAK,EAAE,CAAC,CAAC,KAAK;2BACf,CAAC,CAAA;;;;;;;;iBACH,EAAC;;;mDACK,WAAW;;;;;;;;;;;;YAGd,EAAE;;;;;AAAF,kBAAE,GAAG,EAAE;gDACJ,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,0BAAE,kBAAY,CAAC;;;;;AACpD,4BAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAA;;;;;;;;iBACtB,EAAC;;;mDACK,EAAE;;;;;;;;;;;4DAEM,OAAO;YAKlB,GAAG,EAEH,KAAK,kFACA,QAAQ,EACX,IAAI,EAIJ,QAAQ,EAMV,GAAG,uFACE,EAAE,EACL,CAAC;;;;;;;AAnBP,oBAAI,OAAO,IAAI,IAAI,EAAE;AACnB,yBAAO,GAAG,EAAE,CAAA;iBACb;AACG,mBAAG,GAAG,EAAE;gDAEO,IAAI,CAAC,cAAc,EAAE;;;AAApC,qBAAK;;;;;4BACY,KAAK;;;;;;;;AAAjB,wBAAQ;AACX,oBAAI,GAAG,QAAQ,CAAC,IAAI;;sBACpB,IAAI,KAAK,GAAG,CAAA;;;;;;;;AAGZ,wBAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;gDAE1B,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,CAAC,0BAAE,kBAAY,EAAE;;;;;AACrF,6BAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;;;;;;;;iBACb,EAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,mBAAG,GAAG,EAAE;;;;;6BACG,GAAG;;;;;;;;AAAT,kBAAE;gDACM,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,EAAE,CAAC;;;AAA/C,iBAAC;;AACL,mBAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;mDAEN,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iEAuCU,OAAO,EAAE,EAAE;YAG3B,CAAC,EACD,GAAG,EAMD,KAAK;;;;;AATX,kBAAE,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;AACnC,kBAAE,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;AACvB,iBAAC,GAAG,EAAE;AACN,mBAAG,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;;;;;;;sBAKV,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;gDACD,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;AAAzC,qBAAK;;sBACL,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA,AAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;AACrE,yBAAO,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;iBAC5C,CAAC,CAAA;;;;;;;;AAGF,mBAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;AACjB,iBAAC,GAAG,KAAK,CAAA;;;;;AAEX,kBAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;AAClB,kBAAE,CAAC,IAAI,GAAG,EAAE,CAAC,MAAM,CAAA;mDACZ,EAAE;;;;;;;;;;;WA/mBP,oBAAoB;;;AAknB1B,GAAC,CAAC,WAAW,GAAG,oBAAoB,CAAA;CACrC,CAAA;;;;AC/rBD,YAAY;;;;;;;;;;;;;;;;;;;;;;;;AAAA;;;;;AAwBZ,MAAM,CAAC,OAAO,GAAG,UAAU,YAAC,EAAa;AACvC,GAAC,CAAC,KAAK,GAAG,EAAE,CAAA;;MAEN,YAAY;;;;;;;;;;;;;;AAchB,aAdI,YAAY,CAcH,wBAAO,EAAmB;4BAdnC,YAAY;;AAed,UAAI,CAAC,OAAO,GAAG,EAAE,CAAA;AACjB,UAAI,CAAC,QAAQ,GAAG,CAAC,CAAA;AACjB,UAAI,CAAC,OAAO,GAAG,OAAO,CAAA;AACtB,UAAI,CAAC,cAAc,GAAG,EAAE,CAAA;KACzB;;;;;AAAA;iBAnBG,YAAY;;iCAwBJ,EAAE,EAAE;AACd,YAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE;AACtB,cAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;SACnB,MAAM;AACL,cAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAA;SAC1C;OACF;;;;;;;;;8CAMwB,GAAG,EAAE;AAC5B,YAAI,CAAC,QAAQ,EAAE,CAAA;AACf,YAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;OAClB;;;;;;;;uCAKiB,CAAC,EAAE;AACnB,YAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;OAC5B;;;0CACoB,CAAC,EAAE;AACtB,YAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE;AAC5D,iBAAO,CAAC,KAAK,CAAC,CAAA;SACf,CAAC,CAAA;OACH;;;gDAC0B;AACzB,YAAI,CAAC,cAAc,GAAG,EAAE,CAAA;OACzB;;;yCACmB,KAAK,EAAE;AACzB,aAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACnD,cAAI;AACF,gBAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;WAC9B,CAAC,OAAO,CAAC,EAAE;AACV,mBAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC;AAAA,WAClD;SACF;OACF;;;;;;;qCAIe,CAAC,EAAE;AACjB,YAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AACtD,aAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;AACzC,cAAI,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;AACjB,cAAI,EAAE,CAAC,MAAM,KAAK,QAAQ,EAAE;AAC1B,iBAAK,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACjD,kBAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;AACvB,kBAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,EAAE;AACzB,oBAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;;AAErC,mBAAC,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE;;AAAA,AAEf,oBAAE,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;iBACjB,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;;AAE7C,mBAAC,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,CAAA;AACd,oBAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;iBACnB;eACF;aACF;WACF,MAAM;AACL,kBAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAA;WAC9C;SACF;AACD,YAAI,CAAC,cAAc,EAAE,CAAA;OACtB;;;;;;;qCAIe,CAAC,EAAE,OAAO,EAAE;AAC1B,YAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AACtD,aAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACnC,cAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;AAChB,cAAI,GAAG,CAAC,MAAM,KAAK,QAAQ,EAAE;AAC3B,gBAAI,OAAO,IAAI,IAAI,EAAE;AACnB,mBAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC5C,oBAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;;AAAA,AAEvB,oBAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE;AACnE,mBAAC,CAAC,IAAI,GAAG,OAAO,CAAA;iBACjB;eACF;aACF;WACF,MAAM;AACL,kBAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAA;WAC9C;SACF;AACD,YAAI,CAAC,cAAc,EAAE,CAAA;OACtB;;;;;;;uCAIiB;AAChB,YAAI,CAAC,QAAQ,EAAE,CAAA;AACf,YAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;AACjD,cAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;AACzB,cAAI,CAAC,OAAO,GAAG,EAAE,CAAA;AACjB,cAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;SACrB;OACF;;;WA9HG,YAAY;;;AAgIlB,GAAC,CAAC,KAAK,CAAC,YAAY,GAAG,YAAY;;;;;;;;;;;;AAAA;MAa7B,UAAU;;;;;;AAMd,WANI,UAAU,CAMD,GAAG,EAAE;0BANd,UAAU;;AAOZ,QAAI,GAAG,CAAC,UAAU,IAAI,IAAI,IACxB,GAAG,CAAC,QAAQ,IAAI,IAAI,IACpB,GAAG,CAAC,KAAK,IAAI,IAAI,EACjB;AACA,YAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAA;KAC9D;AACD,QAAI,CAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAA;AAChC,QAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAA;AAC5B,QAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAA;GACvB;;AAEH,GAAC,CAAC,KAAK,CAAC,UAAU,GAAG,UAAU;;;;;;AAAA,AAM/B,WAAS,UAAU,CAAE,CAAC,EAAE;AACtB,QAAI,CAAC,GAAG,EAAE,CAAA;AACV,SAAK,IAAI,GAAG,IAAI,CAAC,EAAE;AACjB,OAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;KAChB;AACD,WAAO,CAAC,CAAA;GACT;AACD,GAAC,CAAC,KAAK,CAAC,UAAU,GAAG,UAAU;;;;;AAAA,AAK/B,WAAS,OAAO,CAAE,CAAC,EAAE,CAAC,EAAE;AACtB,WAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,AAAC,CAAA;GACrD;AACD,GAAC,CAAC,KAAK,CAAC,OAAO,GAAG,OAAO,CAAA;;AAEzB,WAAS,UAAU,CAAE,GAAG,EAAE,GAAG,EAAE;AAC7B,QAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;AAC9B,UAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;AAC9B,eAAO,IAAI,CAAA;OACZ;AACD,aAAO,KAAK,CAAA;KACb;AACD,QAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE;AAC1C,aAAO,IAAI,CAAA;KACZ,MAAM;AACL,aAAO,KAAK,CAAA;KACb;GACF;AACD,GAAC,CAAC,KAAK,CAAC,UAAU,GAAG,UAAU,CAAA;CAChC,CAAA;;;;AC/ND,YAAY,CAAA;;;;;;AAEZ,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAA;AAC5B,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAA;AAC3B,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAA;AAC9B,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;AACzB,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAA;AACxB,OAAO,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAA;;AAElC,IAAI,gBAAgB,GAAG,EAAE,CAAA;;AAEzB,MAAM,CAAC,OAAO,GAAG,CAAC,CAAA;;AAElB,CAAC,CAAC,MAAM,GAAG,UAAU,IAAI,EAAE,KAAK,EAAE;AAChC,GAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAA;AACf,MAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE;AAClC,oBAAgB,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAA;AAChC,WAAO,gBAAgB,CAAC,IAAI,CAAC,CAAA;GAC9B;CACF,CAAA;;AAED,CAAC,CAAC,cAAc,GAAG,cAAc,CAAA;AACjC,SAAS,cAAc,CAAE,OAAO,EAAE;;;;AAIhC,MAAI,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,WAAW,KAAK,QAAQ,GAAG,KAAK,GAAG,MAAM,CAAA;AACjF,MAAI,QAAQ,GAAG,EAAE,CAAA;AACjB,OAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,QAAI,UAAU,GAAG,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAA;AAChD,QAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;AACzB,UAAI,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;AACxC,YAAI;AACF,iBAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;SACvB,CAAC,OAAO,CAAC,EAAE;;AAEV,cAAI,OAAO,MAAM,KAAK,WAAW,EAAE;gBAC7B,QAAQ;;;AAAR,sBAAQ,GAAG,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC;;AAC/C,sBAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,GAAG,GAAG,GAAG,UAAU,GAAG,GAAG,GAAG,UAAU,GAAG,SAAS,CAAA;AAC5E,sBAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAA;;AAEnC,kBAAI,aAAa,GAAG,EAAE,CAAA;AACtB,8BAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAA;AAC5C,2BAAa,CAAC,OAAO,GAAG,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;AACrD,6BAAa,CAAC,OAAO,GAAG,OAAO,CAAA;eAChC,CAAC,CAAA;AACF,sBAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;;WACrC,MAAM;AACL,kBAAM,CAAC,CAAA;WACR;SACF;OACF,MAAM;AACL,gBAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;OACpD;KACF;GACF;AACD,SAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;CAC7B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,AA+BD,SAAS,CAAC,CAAE,oBAAI,yBAAyC;AACvD,MAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,EAAE,CAAA;AACjD,MAAI,OAAO,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AACpE,OAAK,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AAC3B,WAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;GAC/B;AACD,GAAC,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAA;AAC5B,SAAO,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,YAAY;AAChD,WAAO,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;AACpC,UAAI,OAAO,GAAG,IAAI,OAAO,CAAC,IAAI,EAAE,YAAY;AAC1C,eAAO,CAAC,EAAE,CAAC,aAAa,CAAC,YAAY;AACnC,iBAAO,CAAC,OAAO,CAAC,CAAA;SACjB,CAAC,CAAA;OACH,CAAC,CAAA;KACH,CAAC,CAAA;GACH,CAAC,CAAA;CACH;;IAEK,OAAO;;;;;;;AAMX,WANI,OAAO,CAME,IAAI,EAAE,QAAQ,EAAE;0BANzB,OAAO;;AAOT,QAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;AAC5C,QAAI,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;AACjE,QAAI,KAAK,GAAG,EAAE,CAAA;AACd,QAAI,CAAC,KAAK,GAAG,KAAK,CAAA;AAClB,QAAI,CAAC,EAAE,CAAC,kBAAkB,yBAAC,SAAW,kBAAkB;UAE7C,YAAY;;;;;oDAAI,IAAI,CAAC,KAAK;;;;;;;;AAA1B,0BAAY;4CACU,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,GAAG,GAAG,YAAY,CAAC,CAAC;;;AAA/F,mBAAK,CAAC,YAAY,CAAC;;;;;AAErB,wBAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;;;;;;;SALa,kBAAkB;KAMvD,EAAC,CAAA;GACH;;eAlBG,OAAO;;kCAmBI;AACb,aAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAA;KAC/B;;;iCACa;AACZ,aAAO,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAA;KACnC;;;gCACY;AACX,aAAO,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,CAAA;KAClC;;;8BACU;AACT,UAAI,CAAC,UAAU,EAAE,CAAA;AACjB,UAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAA;AACjB,UAAI,CAAC,SAAS,GAAG,IAAI,CAAA;AACrB,UAAI,CAAC,EAAE,GAAG,IAAI,CAAA;KACf;;;SAjCG,OAAO;;;AAoCb,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;AACjC,QAAM,CAAC,CAAC,GAAG,CAAC,CAAA;CACb","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 if (state === GenStateSuspendedYield) {\n context.sent = arg;\n } else {\n context.sent = undefined;\n }\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 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","/* @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 */\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 }\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 this.userId = userId\n return this.y.db.setUserId(userId)\n }\n onUserEvent (f) {\n this.userEventListeners.push(f)\n }\n userLeft (user) {\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 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 if (syncUser != null) {\n var conn = this\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 })\n })\n } else {\n this.isSynced = true\n // call when synced listeners\n for (var f of this.whenSyncedListeners) {\n f()\n }\n this.whenSyncedListeners = []\n this.y.db.requestTransaction(function *() {\n yield* this.garbageCollectAfterSync()\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 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.type === 'sync step 1') {\n // TODO: make transaction, stream the ops\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 })\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 var update /* :MessageUpdate */ = {\n type: 'update',\n ops: ops\n }\n if (!broadcastHB) { // TODO: consider to broadcast here..\n conn.send(sender, update)\n } else {\n // broadcast only once!\n conn.broadcast(update)\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.broadcast({\n type: 'update',\n ops: delops\n })\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: {},\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 i in globalRoom.buffers) {\n if (globalRoom.buffers[i].length > 0) {\n bufs.push(i)\n }\n }\n if (bufs.length > 0) {\n var userId = getRandom(bufs)\n var m = globalRoom.buffers[userId].shift()\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 }, 10)\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 buffer.push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n broadcast (message) {\n for (var key in globalRoom.buffers) {\n globalRoom.buffers[key].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 while (globalRoom.buffers[self.userId].length > 0) {\n var m = globalRoom.buffers[self.userId].shift()\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 // 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.whenUserIdSetListener = null\n this.waitingTransactions = []\n this.transactionInProgress = 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 || 5000\n var os = this\n function garbageCollect () {\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 if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n resolve()\n })\n })\n }\n this.garbageCollect = garbageCollect\n if (this.gcTimeout > 0) {\n garbageCollect()\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 delete op.gc\n yield* this.setOperation(op)\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 this.y.connector.isSynced &&\n left != null &&\n left.deleted === true\n ) {\n op.gc = true\n this.gc1.push(op.id)\n return true\n } else {\n return false\n }\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 }\n setUserId (userId) {\n var self = this\n return new Promise(function (resolve) {\n self.requestTransaction(function * () {\n self.userId = userId\n var state = yield* this.getState(userId)\n self.opClock = state.clock\n if (self.whenUserIdSetListener != null) {\n self.whenUserIdSetListener()\n self.whenUserIdSetListener = null\n }\n resolve()\n })\n })\n }\n whenUserIdSet (f) {\n if (this.userId != null) {\n f()\n } else {\n this.whenUserIdSetListener = f\n }\n }\n getNextOpId () {\n if (this._nextUserId != null) {\n return this._nextUserId\n } else if (this.userId == null) {\n throw new Error('OperationStore not yet initialized!')\n } else {\n return [this.userId, this.opClock++]\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 key in ops) {\n var o = ops[key]\n var required = Y.Struct[o.struct].requiredOps(o)\n this.whenOperationsExist(required, o)\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 key in ids) {\n let id = ids[key]\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 = yield* this.getOperation(id)\n if (op == null) {\n store.listenersById[sid] = l\n } else {\n for (let key in l) {\n let listener = l[key]\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 yield* this.store.operationAdded(this, op)\n } else {\n var defined = yield* this.getOperation(op.id)\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 }\n }\n }\n // called by a transaction when an operation is added\n * operationAdded (transaction, op) {\n if (op.struct === 'Delete') {\n var target = yield* transaction.getOperation(op.target)\n if (target != null) {\n var type = transaction.store.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(transaction, {\n struct: 'Delete',\n target: op.target\n })\n }\n }\n } else {\n // increase SS\n var o = op\n var state = yield* transaction.getState(op.id[0])\n while (o != null && o.id[1] === state.clock && op.id[0] === o.id[0]) {\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++\n yield* transaction.checkDeleteStoreForState(state)\n o = yield* transaction.os.findNext(o.id)\n }\n yield* transaction.setState(state)\n\n // notify whenOperation listeners (by id)\n var sid = JSON.stringify(op.id)\n var l = this.listenersById[sid]\n delete this.listenersById[sid]\n\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 var t = this.initializedTypes[JSON.stringify(op.parent)]\n\n // Delete if DS says this is actually deleted\n var opIsDeleted = yield* transaction.isDeleted(op.id)\n if (!op.deleted && opIsDeleted) {\n var delop = {\n struct: 'Delete',\n target: op.id\n }\n yield* Y.Struct['Delete'].execute.call(transaction, delop)\n }\n\n // notify parent, if it has been initialized as a custom type\n if (t != null) {\n yield* t._changed(transaction, Y.utils.copyObject(op))\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 getNextRequest () {\n if (this.waitingTransactions.length === 0) {\n this.transactionInProgress = false\n if (this.transactionsFinished != null) {\n this.transactionsFinished.resolve()\n this.transactionsFinished = null\n }\n return null\n } else {\n return this.waitingTransactions.shift()\n }\n }\n requestTransaction (makeGen/* :any */, callImmediately) {\n if (true || callImmediately) { // TODO: decide whether this is ok or not..\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n this.transact(this.getNextRequest())\n }\n } else {\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n var self = this\n setTimeout(function () {\n self.transact(self.getNextRequest())\n }, 0)\n }\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)\n }\n },\n Insert: {\n /* {\n content: any,\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.opContent != null) {\n e.opContent = op.opContent\n } else {\n e.content = op.content\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.getOperation(op.left)\n while (!Y.utils.compareIds(op.origin, (o ? o.id : null))) {\n d++\n if (o.left == null) {\n break\n } else {\n o = yield* this.getOperation(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 var distanceToOrigin = i = yield* Struct.Insert.getDistanceToOrigin.call(this, op) // most cases: 0 (starts from 0)\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.getOperation(op.left)\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 // 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 = o.id\n distanceToOrigin = i + 1\n }\n } else if (oOriginDistance < i) {\n // case 2\n if (i - distanceToOrigin <= oOriginDistance) {\n op.left = o.id\n distanceToOrigin = i + 1\n }\n } else {\n break\n }\n i++\n if (o.right != null) {\n o = yield* this.getOperation(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.getOperation(op.left)\n op.right = left.right\n left.right = op.id\n\n yield* this.setOperation(left)\n } else {\n op.right = op.parentSub ? parent.map[op.parentSub] || null : parent.start\n }\n // reconnect right\n if (op.right != null) {\n right = yield* this.getOperation(op.right)\n right.left = op.id\n\n // if right exists, and it is supposed to be gc'd. Remove it from the gc\n if (right.gc != null) {\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 if (op.right != null) {\n yield* this.deleteOperation(op.right, true)\n }\n if (op.left != null) {\n yield* this.deleteOperation(op.id, true)\n }\n } else {\n if (right == null || left == null) {\n if (right == null) {\n parent.end = op.id\n }\n if (left == null) {\n parent.start = op.id\n }\n yield* this.setOperation(parent)\n }\n }\n }\n },\n List: {\n /*\n {\n start: null,\n end: null,\n struct: \"List\",\n type: \"\",\n id: this.os.getNextOpId()\n }\n */\n encode: function (op) {\n return {\n struct: 'List',\n id: op.id,\n type: op.type\n }\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()\n }\n */\n encode: function (op) {\n return {\n struct: 'Map',\n type: op.type,\n id: op.id,\n map: {} // overwrite map!!\n }\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\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) {\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].initType.call(this, this.store, op)\n this.store.initializedTypes[sid] = t\n }\n }\n return t\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 send.push(Y.Struct[op.struct].encode(op))\n }\n if (!this.store.y.connector.isDisconnected()) { // 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.broadcast({\n type: 'update',\n ops: send\n })\n }\n }\n\n * deleteList (start) {\n if (this.store.y.connector.isSynced) {\n while (start != null && this.store.y.connector.isSynced) {\n start = yield* this.getOperation(start)\n start.gc = true\n yield* this.setOperation(start)\n // TODO: will always reset the parent..\n this.store.gc1.push(start.id)\n start = start.right\n }\n } else {\n // TODO: when not possible??? do later in (gcWhenSynced)\n }\n }\n\n /*\n Mark an operation as deleted, and add it to the GC, if possible.\n */\n * deleteOperation (targetId, preventCallType) /* :Generator */ {\n var target = yield* this.getOperation(targetId)\n var callType = false\n\n if (target == null || !target.deleted) {\n yield* this.markDeleted(targetId)\n }\n\n if (target != null && target.gc == null) {\n if (!target.deleted) {\n callType = true\n // set deleted & notify type\n target.deleted = true\n /*\n if (!preventCallType) {\n var type = this.store.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(this, {\n struct: 'Delete',\n target: targetId\n })\n }\n }\n */\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)\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)\n }\n if (target.opContent != null) {\n yield* this.deleteOperation(target.opContent)\n target.opContent = null\n }\n }\n var left\n if (target.left != null) {\n left = yield* this.getOperation(target.left)\n } else {\n left = null\n }\n\n this.store.addToGarbageCollector(target, left)\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 (\n right != null &&\n this.store.addToGarbageCollector(right, target)\n ) {\n yield* this.setOperation(right)\n }\n return callType\n }\n }\n /*\n Mark an operation as deleted&gc'd\n */\n * markGarbageCollected (id) {\n // this.mem.push([\"gc\", id]);\n var n = yield* this.markDeleted(id)\n if (!n.gc) {\n if (n.id[1] < id[1]) {\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] < n.id[1] + n.len - 1) {\n // un-extend right\n yield* this.ds.put({id: [id[0], id[1] + 1], len: n.len - 1, gc: false})\n n.len = 1\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 }\n }\n /*\n Mark an operation as deleted.\n\n returns the delete node\n */\n * markDeleted (id) {\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 // already deleted\n return n\n } else if (n.id[1] + n.len === id[1] && !n.gc) {\n // can extend existing deletion\n n.len++\n } else {\n // cannot extend left\n n = {id: id, len: 1, gc: false}\n yield* this.ds.put(n)\n }\n } else {\n // cannot extend left\n n = {id: id, len: 1, 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 Y.utils.compareIds([n.id[0], n.id[1] + n.len], next.id) &&\n !next.gc\n ) {\n n.len = n.len + next.len\n yield* this.ds.delete(next.id)\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 yield* this.os.iterate(this, null, null, function * (op) {\n if (op.deleted && op.left != null) {\n var left = yield* this.getOperation(op.left)\n this.store.addToGarbageCollector(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 // check to increase the state of the respective user\n var state = yield* this.getState(id[0])\n if (state.clock === id[1]) {\n state.clock++\n // also check if more expected operations were gc'd\n yield* this.checkDeleteStoreForState(state)\n // then set the state\n yield* this.setState(state)\n }\n yield* this.markGarbageCollected(id)\n\n // if op exists, then clean that mess up..\n var o = yield* this.getOperation(id)\n if (o != null) {\n /*\n if (!o.deleted) {\n yield* this.deleteOperation(id)\n o = yield* this.getOperation(id)\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.getOperation(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 if (Y.utils.compareIds(right.origin, o.id)) { // rights origin is o\n // find new origin of right ops\n // origin is the first left deleted operation\n var neworigin = o.left\n while (neworigin != null) {\n var neworigin_ = yield* this.getOperation(neworigin)\n if (neworigin_.deleted) {\n break\n }\n neworigin = neworigin_.left\n }\n\n // reset origin of right\n right.origin = neworigin\n\n // reset origin of all right ops (except first right - duh!),\n // 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 i = yield* this.getOperation(i.right)\n }\n }\n }\n } /* otherwise, rights origin is to the left of o,\n then there is no right op (from o), that origins in o */\n yield* this.setOperation(right)\n }\n\n if (o.parent != null) {\n // remove gc'd op from parent, if it exists\n var parent /* MapOperation */ = yield* this.getOperation(o.parent)\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 parent.map[o.parentSub] = o.right\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.compareIds(parent.end, o.id)) {\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 /*\n apply a delete set in order to get\n the state of the supplied ds\n */\n * applyDeleteSet (ds) {\n var deletions = []\n function createDeletions (user, start, len, gc) {\n for (var c = start; c < start + len; c++) {\n deletions.push([user, c, gc])\n }\n }\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 createDeletions(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 createDeletions(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 createDeletions(user, d[0], d[1], d[2])\n }\n }\n for (var i = 0; i < deletions.length; i++) {\n var del = deletions[i]\n var id = [del[0], del[1]]\n // always try to delete..\n var addOperation = yield* this.deleteOperation(id)\n if (addOperation) {\n // TODO:.. really .. here? You could prevent calling all these functions in operationAdded\n yield* this.store.operationAdded(this, {struct: 'Delete', target: id})\n }\n if (del[2]) {\n // gc\n yield* this.garbageCollectOperation(id)\n }\n }\n if (this.store.forwardAppliedOperations) {\n var ops = deletions.map(function (d) {\n return {struct: 'Delete', target: [d[0], d[1]]}\n })\n this.store.y.connector.broadcast({\n type: 'update',\n ops: 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) {\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcast({\n type: 'update',\n ops: [op]\n })\n }\n }\n * getOperation (id/* :any */)/* :Transaction */ {\n var o = yield* this.os.find(id)\n if (o != null || id[0] !== '_') {\n return o\n } else {\n // need to generate this operation\n if (this.store._nextUserId == null) {\n var typename = id[1].split('_')[0]\n this.store._nextUserId = id\n yield* Y[typename].createType.call(this)\n delete this.store._nextUserId\n return yield* this.os.find(id)\n } else {\n // Can only generate one operation at a time\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 * getOperations (startSS) {\n // TODO: use bounds here!\n if (startSS == null) {\n startSS = {}\n }\n var ops = []\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\n yield* this.os.iterate(this, [user, startPos], [user, Number.MAX_VALUE], function * (op) {\n ops.push(op)\n })\n }\n var res = []\n for (var op of ops) {\n var o = yield* this.makeOperationReady(startSS, op)\n res.push(o)\n }\n return res\n }\n /*\n Here, we make op 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 * makeOperationReady (startSS, op) {\n op = Y.Struct[op.struct].encode(op)\n op = Y.utils.copyObject(op)\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 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 will help you to make your type\n synchronous.\n*/\nmodule.exports = function (Y /* : any*/) {\n Y.utils = {}\n\n class EventHandler {\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 this.waiting = []\n this.awaiting = 0\n this.onevent = onevent\n this.eventListeners = []\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(Y.utils.copyObject(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 this.onevent(ops)\n }\n /*\n Basic event listener boilerplate...\n TODO: maybe put this in a different type..\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.log('User events must not throw Errors!') // eslint-disable-line\n }\n }\n }\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 if (w.struct === 'Insert') {\n if (Y.utils.compareIds(op.left, w.id)) {\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(op.right, w.id)) {\n // similar..\n w.left = op.id\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 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 /* (private)\n Try to execute the events for the waiting operations\n */\n _tryCallEvents () {\n this.awaiting--\n if (this.awaiting <= 0 && this.waiting.length > 0) {\n var events = this.waiting\n this.waiting = []\n this.onevent(events)\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 * createType\n - Defines the model of a newly created custom type and returns the 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 createType: any;\n initType: any;\n class: Function;\n */\n constructor (def) {\n if (def.createType == null ||\n def.initType == null ||\n def.class == null\n ) {\n throw new Error('Custom type was not initialized correctly!')\n }\n this.createType = def.createType\n this.initType = def.initType\n this.class = def.class\n }\n }\n Y.utils.CustomType = CustomType\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 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])\n }\n Y.utils.smaller = smaller\n\n function compareIds (id1, id2) {\n if (id1 == null || id2 == null) {\n if (id1 == null && id2 == null) {\n return true\n }\n return false\n }\n if (id1[0] === id2[0] && id1[1] === id2[1]) {\n return true\n } else {\n return false\n }\n }\n Y.utils.compareIds = compareIds\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\n\nY.extend = function (name, value) {\n Y[name] = value\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 = Y.Struct.Insert.execute.constructor === Function ? '.js' : '.es6'\n var promises = []\n for (var i = 0; i < modules.length; i++) {\n var modulename = 'y-' + modules[i].toLowerCase()\n if (Y[modules[i]] == null) {\n if (requiringModules[modules[i]] == null) {\n try {\n require(modulename)(Y)\n } catch (e) {\n // module does not exist\n if (typeof window !== '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[modules[i]] = requireModule\n requireModule.promise = new Promise(function (resolve) {\n requireModule.resolve = resolve\n })\n promises.push(requireModule.promise)\n } else {\n throw e\n }\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 Y.requestModules(modules).then(function () {\n return new Promise(function (resolve) {\n var yconfig = new YConfig(opts, function () {\n yconfig.db.whenUserIdSet(function () {\n resolve(yconfig)\n })\n })\n })\n })\n}\n\nclass YConfig {\n /* ::\n db: Y.AbstractDatabase;\n connector: Y.AbstractConnector;\n share: {[key: string]: any};\n */\n constructor (opts, callback) {\n this.db = new Y[opts.db.name](this, opts.db)\n this.connector = new Y[opts.connector.name](this, opts.connector)\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 share[propertyname] = yield* this.getType(['_', opts.share[propertyname] + '_' + propertyname])\n }\n setTimeout(callback, 0)\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 this.disconnect()\n this.db.destroy()\n this.connector = null\n this.db = null\n }\n}\n\nif (typeof window !== 'undefined') {\n window.Y = Y\n}\n"]} \ No newline at end of file +{"version":3,"sources":["node_modules/browserify/node_modules/browser-pack/_prelude.js","node_modules/browserify/node_modules/process/browser.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;;;;;;;;;;;;;;;;;ACjFA,CAAC,CAAC,UAAS,MAAM,EAAE;AACjB,cAAY,CAAC;;AAEb,MAAI,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC;AAC7C,MAAI,SAAS;AAAC,AACd,MAAI,OAAO,GAAG,OAAO,MAAM,KAAK,UAAU,GAAG,MAAM,GAAG,EAAE,CAAC;AACzD,MAAI,cAAc,GAAG,OAAO,CAAC,QAAQ,IAAI,YAAY,CAAC;AACtD,MAAI,iBAAiB,GAAG,OAAO,CAAC,WAAW,IAAI,eAAe,CAAC;;AAE/D,MAAI,QAAQ,GAAG,QAAO,MAAM,yCAAN,MAAM,OAAK,QAAQ,CAAC;AAC1C,MAAI,OAAO,GAAG,MAAM,CAAC,kBAAkB,CAAC;AACxC,MAAI,OAAO,EAAE;AACX,QAAI,QAAQ,EAAE;;;AAGZ,YAAM,CAAC,OAAO,GAAG,OAAO,CAAC;KAC1B;;;AAAA,AAGD,WAAO;GACR;;;;AAAA,AAID,SAAO,GAAG,MAAM,CAAC,kBAAkB,GAAG,QAAQ,GAAG,MAAM,CAAC,OAAO,GAAG,EAAE,CAAC;;AAErE,WAAS,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE;;AAEjD,QAAI,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,IAAI,SAAS,CAAA,CAAE,SAAS,CAAC,CAAC;AAChE,QAAI,OAAO,GAAG,IAAI,OAAO,CAAC,WAAW,IAAI,EAAE,CAAC;;;;AAAC,AAI7C,aAAS,CAAC,OAAO,GAAG,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;;AAE7D,WAAO,SAAS,CAAC;GAClB;AACD,SAAO,CAAC,IAAI,GAAG,IAAI;;;;;;;;;;;;AAAC,AAYpB,WAAS,QAAQ,CAAC,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE;AAC9B,QAAI;AACF,aAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;KACnD,CAAC,OAAO,GAAG,EAAE;AACZ,aAAO,EAAE,IAAI,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;KACpC;GACF;;AAED,MAAI,sBAAsB,GAAG,gBAAgB,CAAC;AAC9C,MAAI,sBAAsB,GAAG,gBAAgB,CAAC;AAC9C,MAAI,iBAAiB,GAAG,WAAW,CAAC;AACpC,MAAI,iBAAiB,GAAG,WAAW;;;;AAAC,AAIpC,MAAI,gBAAgB,GAAG,EAAE;;;;;;AAAC,AAM1B,WAAS,SAAS,GAAG,EAAE;AACvB,WAAS,iBAAiB,GAAG,EAAE;AAC/B,WAAS,0BAA0B,GAAG,EAAE;;AAExC,MAAI,EAAE,GAAG,0BAA0B,CAAC,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC;AACpE,mBAAiB,CAAC,SAAS,GAAG,EAAE,CAAC,WAAW,GAAG,0BAA0B,CAAC;AAC1E,4BAA0B,CAAC,WAAW,GAAG,iBAAiB,CAAC;AAC3D,4BAA0B,CAAC,iBAAiB,CAAC,GAAG,iBAAiB,CAAC,WAAW,GAAG,mBAAmB;;;;AAAC,AAIpG,WAAS,qBAAqB,CAAC,SAAS,EAAE;AACxC,KAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,OAAO,CAAC,UAAS,MAAM,EAAE;AACnD,eAAS,CAAC,MAAM,CAAC,GAAG,UAAS,GAAG,EAAE;AAChC,eAAO,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;OAClC,CAAC;KACH,CAAC,CAAC;GACJ;;AAED,SAAO,CAAC,mBAAmB,GAAG,UAAS,MAAM,EAAE;AAC7C,QAAI,IAAI,GAAG,OAAO,MAAM,KAAK,UAAU,IAAI,MAAM,CAAC,WAAW,CAAC;AAC9D,WAAO,IAAI,GACP,IAAI,KAAK,iBAAiB;;;AAG1B,KAAC,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,IAAI,CAAA,KAAM,mBAAmB,GACvD,KAAK,CAAC;GACX,CAAC;;AAEF,SAAO,CAAC,IAAI,GAAG,UAAS,MAAM,EAAE;AAC9B,QAAI,MAAM,CAAC,cAAc,EAAE;AACzB,YAAM,CAAC,cAAc,CAAC,MAAM,EAAE,0BAA0B,CAAC,CAAC;KAC3D,MAAM;AACL,YAAM,CAAC,SAAS,GAAG,0BAA0B,CAAC;AAC9C,UAAI,EAAE,iBAAiB,IAAI,MAAM,CAAA,AAAC,EAAE;AAClC,cAAM,CAAC,iBAAiB,CAAC,GAAG,mBAAmB,CAAC;OACjD;KACF;AACD,UAAM,CAAC,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;AACrC,WAAO,MAAM,CAAC;GACf;;;;;;;AAAC,AAOF,SAAO,CAAC,KAAK,GAAG,UAAS,GAAG,EAAE;AAC5B,WAAO,IAAI,aAAa,CAAC,GAAG,CAAC,CAAC;GAC/B,CAAC;;AAEF,WAAS,aAAa,CAAC,GAAG,EAAE;AAC1B,QAAI,CAAC,GAAG,GAAG,GAAG,CAAC;GAChB;;AAED,WAAS,aAAa,CAAC,SAAS,EAAE;AAChC,aAAS,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE;AAC5C,UAAI,MAAM,GAAG,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;AACzD,UAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAC3B,cAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;OACpB,MAAM;AACL,YAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC;AACxB,YAAI,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;AACzB,YAAI,KAAK,YAAY,aAAa,EAAE;AAClC,iBAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,UAAS,KAAK,EAAE;AACrD,kBAAM,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;WACxC,EAAE,UAAS,GAAG,EAAE;AACf,kBAAM,CAAC,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;WACvC,CAAC,CAAC;SACJ;;AAED,eAAO,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,UAAS,SAAS,EAAE;;;;;;;;;;;;;;;;AAgBrD,gBAAM,CAAC,KAAK,GAAG,SAAS,CAAC;AACzB,iBAAO,CAAC,MAAM,CAAC,CAAC;SACjB,EAAE,MAAM,CAAC,CAAC;OACZ;KACF;;AAED,QAAI,QAAO,OAAO,yCAAP,OAAO,OAAK,QAAQ,IAAI,OAAO,CAAC,MAAM,EAAE;AACjD,YAAM,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KACtC;;AAED,QAAI,eAAe,CAAC;;AAEpB,aAAS,OAAO,CAAC,MAAM,EAAE,GAAG,EAAE;AAC5B,eAAS,0BAA0B,GAAG;AACpC,eAAO,IAAI,OAAO,CAAC,UAAS,OAAO,EAAE,MAAM,EAAE;AAC3C,gBAAM,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;SACtC,CAAC,CAAC;OACJ;;AAED,aAAO,eAAe;;;;;;;;;;;;;AAapB,qBAAe,GAAG,eAAe,CAAC,IAAI,CACpC,0BAA0B;;;AAG1B,gCAA0B,CAC3B,GAAG,0BAA0B,EAAE,CAAC;KACpC;;;;AAAA,AAID,QAAI,CAAC,OAAO,GAAG,OAAO,CAAC;GACxB;;AAED,uBAAqB,CAAC,aAAa,CAAC,SAAS,CAAC;;;;;AAAC,AAK/C,SAAO,CAAC,KAAK,GAAG,UAAS,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE;AAC5D,QAAI,IAAI,GAAG,IAAI,aAAa,CAC1B,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,WAAW,CAAC,CAC1C,CAAC;;AAEF,WAAO,OAAO,CAAC,mBAAmB,CAAC,OAAO,CAAC,GACvC;AAAI,MACJ,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,UAAS,MAAM,EAAE;AAChC,aAAO,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,KAAK,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;KACjD,CAAC,CAAC;GACR,CAAC;;AAEF,WAAS,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE;AAChD,QAAI,KAAK,GAAG,sBAAsB,CAAC;;AAEnC,WAAO,SAAS,MAAM,CAAC,MAAM,EAAE,GAAG,EAAE;AAClC,UAAI,KAAK,KAAK,iBAAiB,EAAE;AAC/B,cAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;OACjD;;AAED,UAAI,KAAK,KAAK,iBAAiB,EAAE;AAC/B,YAAI,MAAM,KAAK,OAAO,EAAE;AACtB,gBAAM,GAAG,CAAC;SACX;;;;AAAA,AAID,eAAO,UAAU,EAAE,CAAC;OACrB;;AAED,aAAO,IAAI,EAAE;AACX,YAAI,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;AAChC,YAAI,QAAQ,EAAE;AACZ,cAAI,MAAM,KAAK,QAAQ,IAClB,MAAM,KAAK,OAAO,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,SAAS,AAAC,EAAE;;;AAGnE,mBAAO,CAAC,QAAQ,GAAG,IAAI;;;;AAAC,AAIxB,gBAAI,YAAY,GAAG,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;AAC/C,gBAAI,YAAY,EAAE;AAChB,kBAAI,MAAM,GAAG,QAAQ,CAAC,YAAY,EAAE,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;AAC5D,kBAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;;;AAG3B,sBAAM,GAAG,OAAO,CAAC;AACjB,mBAAG,GAAG,MAAM,CAAC,GAAG,CAAC;AACjB,yBAAS;eACV;aACF;;AAED,gBAAI,MAAM,KAAK,QAAQ,EAAE;;;AAGvB,uBAAS;aACV;WACF;;AAED,cAAI,MAAM,GAAG,QAAQ,CACnB,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EACzB,QAAQ,CAAC,QAAQ,EACjB,GAAG,CACJ,CAAC;;AAEF,cAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAC3B,mBAAO,CAAC,QAAQ,GAAG,IAAI;;;;AAAC,AAIxB,kBAAM,GAAG,OAAO,CAAC;AACjB,eAAG,GAAG,MAAM,CAAC,GAAG,CAAC;AACjB,qBAAS;WACV;;;;;AAAA,AAKD,gBAAM,GAAG,MAAM,CAAC;AAChB,aAAG,GAAG,SAAS,CAAC;;AAEhB,cAAI,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;AACtB,cAAI,IAAI,CAAC,IAAI,EAAE;AACb,mBAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;AAC1C,mBAAO,CAAC,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC;WACjC,MAAM;AACL,iBAAK,GAAG,sBAAsB,CAAC;AAC/B,mBAAO,IAAI,CAAC;WACb;;AAED,iBAAO,CAAC,QAAQ,GAAG,IAAI,CAAC;SACzB;;AAED,YAAI,MAAM,KAAK,MAAM,EAAE;AACrB,cAAI,KAAK,KAAK,sBAAsB,EAAE;AACpC,mBAAO,CAAC,IAAI,GAAG,GAAG,CAAC;WACpB,MAAM;AACL,mBAAO,CAAC,IAAI,GAAG,SAAS,CAAC;WAC1B;SAEF,MAAM,IAAI,MAAM,KAAK,OAAO,EAAE;AAC7B,cAAI,KAAK,KAAK,sBAAsB,EAAE;AACpC,iBAAK,GAAG,iBAAiB,CAAC;AAC1B,kBAAM,GAAG,CAAC;WACX;;AAED,cAAI,OAAO,CAAC,iBAAiB,CAAC,GAAG,CAAC,EAAE;;;AAGlC,kBAAM,GAAG,MAAM,CAAC;AAChB,eAAG,GAAG,SAAS,CAAC;WACjB;SAEF,MAAM,IAAI,MAAM,KAAK,QAAQ,EAAE;AAC9B,iBAAO,CAAC,MAAM,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;SAC/B;;AAED,aAAK,GAAG,iBAAiB,CAAC;;AAE1B,YAAI,MAAM,GAAG,QAAQ,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;AAC9C,YAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE;;;AAG5B,eAAK,GAAG,OAAO,CAAC,IAAI,GAChB,iBAAiB,GACjB,sBAAsB,CAAC;;AAE3B,cAAI,IAAI,GAAG;AACT,iBAAK,EAAE,MAAM,CAAC,GAAG;AACjB,gBAAI,EAAE,OAAO,CAAC,IAAI;WACnB,CAAC;;AAEF,cAAI,MAAM,CAAC,GAAG,KAAK,gBAAgB,EAAE;AACnC,gBAAI,OAAO,CAAC,QAAQ,IAAI,MAAM,KAAK,MAAM,EAAE;;;AAGzC,iBAAG,GAAG,SAAS,CAAC;aACjB;WACF,MAAM;AACL,mBAAO,IAAI,CAAC;WACb;SAEF,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAClC,eAAK,GAAG,iBAAiB;;;AAAC,AAG1B,gBAAM,GAAG,OAAO,CAAC;AACjB,aAAG,GAAG,MAAM,CAAC,GAAG,CAAC;SAClB;OACF;KACF,CAAC;GACH;;;;AAAA,AAID,uBAAqB,CAAC,EAAE,CAAC,CAAC;;AAE1B,IAAE,CAAC,cAAc,CAAC,GAAG,YAAW;AAC9B,WAAO,IAAI,CAAC;GACb,CAAC;;AAEF,IAAE,CAAC,iBAAiB,CAAC,GAAG,WAAW,CAAC;;AAEpC,IAAE,CAAC,QAAQ,GAAG,YAAW;AACvB,WAAO,oBAAoB,CAAC;GAC7B,CAAC;;AAEF,WAAS,YAAY,CAAC,IAAI,EAAE;AAC1B,QAAI,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;;AAEhC,QAAI,CAAC,IAAI,IAAI,EAAE;AACb,WAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;KAC1B;;AAED,QAAI,CAAC,IAAI,IAAI,EAAE;AACb,WAAK,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;AAC3B,WAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;KAC1B;;AAED,QAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;GAC7B;;AAED,WAAS,aAAa,CAAC,KAAK,EAAE;AAC5B,QAAI,MAAM,GAAG,KAAK,CAAC,UAAU,IAAI,EAAE,CAAC;AACpC,UAAM,CAAC,IAAI,GAAG,QAAQ,CAAC;AACvB,WAAO,MAAM,CAAC,GAAG,CAAC;AAClB,SAAK,CAAC,UAAU,GAAG,MAAM,CAAC;GAC3B;;AAED,WAAS,OAAO,CAAC,WAAW,EAAE;;;;AAI5B,QAAI,CAAC,UAAU,GAAG,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;AACvC,eAAW,CAAC,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;AACxC,QAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;GAClB;;AAED,SAAO,CAAC,IAAI,GAAG,UAAS,MAAM,EAAE;AAC9B,QAAI,IAAI,GAAG,EAAE,CAAC;AACd,SAAK,IAAI,GAAG,IAAI,MAAM,EAAE;AACtB,UAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KAChB;AACD,QAAI,CAAC,OAAO,EAAE;;;;AAAC,AAIf,WAAO,SAAS,IAAI,GAAG;AACrB,aAAO,IAAI,CAAC,MAAM,EAAE;AAClB,YAAI,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;AACrB,YAAI,GAAG,IAAI,MAAM,EAAE;AACjB,cAAI,CAAC,KAAK,GAAG,GAAG,CAAC;AACjB,cAAI,CAAC,IAAI,GAAG,KAAK,CAAC;AAClB,iBAAO,IAAI,CAAC;SACb;OACF;;;;;AAAA,AAKD,UAAI,CAAC,IAAI,GAAG,IAAI,CAAC;AACjB,aAAO,IAAI,CAAC;KACb,CAAC;GACH,CAAC;;AAEF,WAAS,MAAM,CAAC,QAAQ,EAAE;AACxB,QAAI,QAAQ,EAAE;AACZ,UAAI,cAAc,GAAG,QAAQ,CAAC,cAAc,CAAC,CAAC;AAC9C,UAAI,cAAc,EAAE;AAClB,eAAO,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;OACtC;;AAED,UAAI,OAAO,QAAQ,CAAC,IAAI,KAAK,UAAU,EAAE;AACvC,eAAO,QAAQ,CAAC;OACjB;;AAED,UAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE;AAC3B,YAAI,CAAC,GAAG,CAAC,CAAC;YAAE,IAAI,GAAG,SAAS,IAAI,GAAG;AACjC,iBAAO,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE;AAC5B,gBAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE;AAC5B,kBAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;AACzB,kBAAI,CAAC,IAAI,GAAG,KAAK,CAAC;AAClB,qBAAO,IAAI,CAAC;aACb;WACF;;AAED,cAAI,CAAC,KAAK,GAAG,SAAS,CAAC;AACvB,cAAI,CAAC,IAAI,GAAG,IAAI,CAAC;;AAEjB,iBAAO,IAAI,CAAC;SACb,CAAC;;AAEF,eAAO,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;OACzB;KACF;;;AAAA,AAGD,WAAO,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;GAC7B;AACD,SAAO,CAAC,MAAM,GAAG,MAAM,CAAC;;AAExB,WAAS,UAAU,GAAG;AACpB,WAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;GACzC;;AAED,SAAO,CAAC,SAAS,GAAG;AAClB,eAAW,EAAE,OAAO;;AAEpB,SAAK,EAAE,eAAS,aAAa,EAAE;AAC7B,UAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AACd,UAAI,CAAC,IAAI,GAAG,CAAC,CAAC;AACd,UAAI,CAAC,IAAI,GAAG,SAAS,CAAC;AACtB,UAAI,CAAC,IAAI,GAAG,KAAK,CAAC;AAClB,UAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;;AAErB,UAAI,CAAC,UAAU,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;;AAEvC,UAAI,CAAC,aAAa,EAAE;AAClB,aAAK,IAAI,IAAI,IAAI,IAAI,EAAE;;AAErB,cAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG,IACtB,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IACvB,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE;AAC1B,gBAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC;WACxB;SACF;OACF;KACF;;AAED,QAAI,EAAE,gBAAW;AACf,UAAI,CAAC,IAAI,GAAG,IAAI,CAAC;;AAEjB,UAAI,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AACnC,UAAI,UAAU,GAAG,SAAS,CAAC,UAAU,CAAC;AACtC,UAAI,UAAU,CAAC,IAAI,KAAK,OAAO,EAAE;AAC/B,cAAM,UAAU,CAAC,GAAG,CAAC;OACtB;;AAED,aAAO,IAAI,CAAC,IAAI,CAAC;KAClB;;AAED,qBAAiB,EAAE,2BAAS,SAAS,EAAE;AACrC,UAAI,IAAI,CAAC,IAAI,EAAE;AACb,cAAM,SAAS,CAAC;OACjB;;AAED,UAAI,OAAO,GAAG,IAAI,CAAC;AACnB,eAAS,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE;AAC3B,cAAM,CAAC,IAAI,GAAG,OAAO,CAAC;AACtB,cAAM,CAAC,GAAG,GAAG,SAAS,CAAC;AACvB,eAAO,CAAC,IAAI,GAAG,GAAG,CAAC;AACnB,eAAO,CAAC,CAAC,MAAM,CAAC;OACjB;;AAED,WAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AACpD,YAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,YAAI,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC;;AAE9B,YAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE;;;;AAI3B,iBAAO,MAAM,CAAC,KAAK,CAAC,CAAC;SACtB;;AAED,YAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE;AAC7B,cAAI,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;AAC9C,cAAI,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;;AAElD,cAAI,QAAQ,IAAI,UAAU,EAAE;AAC1B,gBAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;AAC9B,qBAAO,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;aACrC,MAAM,IAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,UAAU,EAAE;AACvC,qBAAO,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;aACjC;WAEF,MAAM,IAAI,QAAQ,EAAE;AACnB,gBAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,QAAQ,EAAE;AAC9B,qBAAO,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;aACrC;WAEF,MAAM,IAAI,UAAU,EAAE;AACrB,gBAAI,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,UAAU,EAAE;AAChC,qBAAO,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;aACjC;WAEF,MAAM;AACL,kBAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;WAC3D;SACF;OACF;KACF;;AAED,UAAM,EAAE,gBAAS,IAAI,EAAE,GAAG,EAAE;AAC1B,WAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AACpD,YAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,YAAI,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,IACzB,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,YAAY,CAAC,IAChC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,UAAU,EAAE;AAChC,cAAI,YAAY,GAAG,KAAK,CAAC;AACzB,gBAAM;SACP;OACF;;AAED,UAAI,YAAY,KACX,IAAI,KAAK,OAAO,IAChB,IAAI,KAAK,UAAU,CAAA,AAAC,IACrB,YAAY,CAAC,MAAM,IAAI,GAAG,IAC1B,GAAG,IAAI,YAAY,CAAC,UAAU,EAAE;;;AAGlC,oBAAY,GAAG,IAAI,CAAC;OACrB;;AAED,UAAI,MAAM,GAAG,YAAY,GAAG,YAAY,CAAC,UAAU,GAAG,EAAE,CAAC;AACzD,YAAM,CAAC,IAAI,GAAG,IAAI,CAAC;AACnB,YAAM,CAAC,GAAG,GAAG,GAAG,CAAC;;AAEjB,UAAI,YAAY,EAAE;AAChB,YAAI,CAAC,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC;OACrC,MAAM;AACL,YAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;OACvB;;AAED,aAAO,gBAAgB,CAAC;KACzB;;AAED,YAAQ,EAAE,kBAAS,MAAM,EAAE,QAAQ,EAAE;AACnC,UAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAC3B,cAAM,MAAM,CAAC,GAAG,CAAC;OAClB;;AAED,UAAI,MAAM,CAAC,IAAI,KAAK,OAAO,IACvB,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE;AAC9B,YAAI,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;OACxB,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE;AACnC,YAAI,CAAC,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC;AACvB,YAAI,CAAC,IAAI,GAAG,KAAK,CAAC;OACnB,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,QAAQ,EAAE;AAC/C,YAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;OACtB;KACF;;AAED,UAAM,EAAE,gBAAS,UAAU,EAAE;AAC3B,WAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AACpD,YAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,YAAI,KAAK,CAAC,UAAU,KAAK,UAAU,EAAE;AACnC,cAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;AAChD,uBAAa,CAAC,KAAK,CAAC,CAAC;AACrB,iBAAO,gBAAgB,CAAC;SACzB;OACF;KACF;;AAED,WAAO,EAAE,gBAAS,MAAM,EAAE;AACxB,WAAK,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;AACpD,YAAI,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;AAC/B,YAAI,KAAK,CAAC,MAAM,KAAK,MAAM,EAAE;AAC3B,cAAI,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC;AAC9B,cAAI,MAAM,CAAC,IAAI,KAAK,OAAO,EAAE;AAC3B,gBAAI,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC;AACxB,yBAAa,CAAC,KAAK,CAAC,CAAC;WACtB;AACD,iBAAO,MAAM,CAAC;SACf;OACF;;;;AAAA,AAID,YAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;KAC1C;;AAED,iBAAa,EAAE,uBAAS,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE;AACrD,UAAI,CAAC,QAAQ,GAAG;AACd,gBAAQ,EAAE,MAAM,CAAC,QAAQ,CAAC;AAC1B,kBAAU,EAAE,UAAU;AACtB,eAAO,EAAE,OAAO;OACjB,CAAC;;AAEF,aAAO,gBAAgB,CAAC;KACzB;GACF,CAAC;CACH,CAAA;;;;AAIC,QAAO,MAAM,yCAAN,MAAM,OAAK,QAAQ,GAAG,MAAM,GACnC,QAAO,MAAM,yCAAN,MAAM,OAAK,QAAQ,GAAG,MAAM,GACnC,QAAO,IAAI,yCAAJ,IAAI,OAAK,QAAQ,GAAG,IAAI,YAAO,CACvC,CAAC;;;;;;AC1pBF,YAAY,CAAA;;;;;;AAEZ,MAAM,CAAC,OAAO,GAAG,UAAU,YAAC,EAAY;MAChC,iBAAiB;;;;;;;;;;;;;;;;;;;;;;;;;AAwBrB,aAxBI,iBAAiB,CAwBR,CAAC,EAAE,IAAI,EAAE;4BAxBlB,iBAAiB;;AAyBnB,UAAI,CAAC,CAAC,GAAG,CAAC,CAAA;AACV,UAAI,IAAI,IAAI,IAAI,EAAE;AAChB,YAAI,GAAG,EAAE,CAAA;OACV;AACD,UAAI,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE;AAC/C,YAAI,CAAC,IAAI,GAAG,QAAQ,CAAA;OACrB,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE;AAChC,YAAI,CAAC,IAAI,GAAG,OAAO,CAAA;OACpB,MAAM;AACL,cAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAA;OAC5D;AACD,UAAI,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,GAAG,IAAI,CAAC,wBAAwB,IAAI,KAAK,CAAA;AAC3E,UAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;AACrB,UAAI,CAAC,WAAW,GAAG,EAAE,CAAA;AACrB,UAAI,CAAC,QAAQ,GAAG,KAAK,CAAA;AACrB,UAAI,CAAC,kBAAkB,GAAG,EAAE,CAAA;AAC5B,UAAI,CAAC,mBAAmB,GAAG,EAAE,CAAA;AAC7B,UAAI,CAAC,iBAAiB,GAAG,IAAI,CAAA;AAC7B,UAAI,CAAC,cAAc,GAAG,EAAE,CAAA;AACxB,UAAI,CAAC,uBAAuB,GAAG,IAAI,CAAC,uBAAuB,KAAK,KAAK,CAAA;AACrE,UAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,KAAK,IAAI,CAAA;AAChC,UAAI,CAAC,aAAa,GAAG,KAAK,CAAA;AAC1B,UAAI,CAAC,SAAS,GAAG,OAAO,CAAC,OAAO,EAAE,CAAA;KACnC;;iBAhDG,iBAAiB;;kCAiDR,EACZ;;;mCACa;AACZ,YAAI,CAAC,WAAW,GAAG,EAAE,CAAA;AACrB,YAAI,CAAC,QAAQ,GAAG,KAAK,CAAA;AACrB,YAAI,CAAC,iBAAiB,GAAG,IAAI,CAAA;AAC7B,YAAI,CAAC,aAAa,GAAG,KAAK,CAAA;AAC1B,YAAI,CAAC,cAAc,GAAG,EAAE,CAAA;AACxB,YAAI,CAAC,mBAAmB,GAAG,EAAE,CAAA;AAC7B,eAAO,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,oBAAoB,EAAE,CAAA;OACxC;;;gCACU,MAAM,EAAE;AACjB,YAAI,CAAC,MAAM,GAAG,MAAM,CAAA;AACpB,eAAO,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;OACnC;;;kCACY,CAAC,EAAE;AACd,YAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;OAChC;;;+BACS,IAAI,EAAE;AACd,eAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;AAC7B,YAAI,IAAI,KAAK,IAAI,CAAC,iBAAiB,EAAE;AACnC,cAAI,CAAC,iBAAiB,GAAG,IAAI,CAAA;AAC7B,cAAI,CAAC,kBAAkB,EAAE,CAAA;SAC1B;AACD,YAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,GAAG,EAAE;AAC9D,iBAAO,GAAG,KAAK,IAAI,CAAA;SACpB,CAAC,CAAA;;;;;;AACF,+BAAc,IAAI,CAAC,kBAAkB,8HAAE;gBAA9B,CAAC;;AACR,aAAC,CAAC;AACA,oBAAM,EAAE,UAAU;AAClB,kBAAI,EAAE,IAAI;aACX,CAAC,CAAA;WACH;;;;;;;;;;;;;;;OACF;;;iCACW,IAAI,EAAE,IAAI,EAAE;AACtB,YAAI,IAAI,IAAI,IAAI,EAAE;AAChB,gBAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAA;SACjE;AACD,YAAI,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE;AAClC,gBAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;SAC7C;AACD,YAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG;AACvB,kBAAQ,EAAE,KAAK;AACf,cAAI,EAAE,IAAI;SACX,CAAA;;;;;;AACD,gCAAc,IAAI,CAAC,kBAAkB,mIAAE;gBAA9B,CAAC;;AACR,aAAC,CAAC;AACA,oBAAM,EAAE,YAAY;AACpB,kBAAI,EAAE,IAAI;AACV,kBAAI,EAAE,IAAI;aACX,CAAC,CAAA;WACH;;;;;;;;;;;;;;;;AACD,YAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,EAAE;AAClC,cAAI,CAAC,kBAAkB,EAAE,CAAA;SAC1B;OACF;;;;;;iCAGW,CAAC,EAAE;AACb,YAAI,IAAI,CAAC,QAAQ,EAAE;AACjB,WAAC,EAAE,CAAA;SACJ,MAAM;AACL,cAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;SACjC;OACF;;;;;;;;2CAMqB;AACpB,YAAI,IAAI,CAAC,iBAAiB,IAAI,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE;AACnD;AAAM,SACP;;AAED,YAAI,QAAQ,GAAG,IAAI,CAAA;AACnB,aAAK,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE;AAChC,cAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE;AACnC,oBAAQ,GAAG,GAAG,CAAA;AACd,kBAAK;WACN;SACF;AACD,YAAI,QAAQ,IAAI,IAAI,EAAE;AACpB,cAAI,IAAI,GAAG,IAAI,CAAA;AACf,cAAI,CAAC,iBAAiB,GAAG,QAAQ,CAAA;AACjC,cAAI,CAAC,CAAC,CAAC,EAAE,CAAC,kBAAkB,yBAAC;gBACvB,QAAQ,EACR,SAAS;;;;;kDADS,IAAI,CAAC,WAAW,EAAE;;;AAApC,4BAAQ;kDACW,IAAI,CAAC,YAAY,EAAE;;;AAAtC,6BAAS;;AACb,wBAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;AAClB,0BAAI,EAAE,aAAa;AACnB,8BAAQ,EAAE,QAAQ;AAClB,+BAAS,EAAE,SAAS;qBACrB,CAAC,CAAA;;;;;;;;WACH,EAAC,CAAA;SACH,MAAM;AACL,cAAI,CAAC,QAAQ,GAAG,IAAI;;AAAA;;;;;AAEpB,kCAAc,IAAI,CAAC,mBAAmB,mIAAE;kBAA/B,CAAC;;AACR,eAAC,EAAE,CAAA;aACJ;;;;;;;;;;;;;;;;AACD,cAAI,CAAC,mBAAmB,GAAG,EAAE,CAAA;AAC7B,cAAI,CAAC,CAAC,CAAC,EAAE,CAAC,kBAAkB,yBAAC;;;;;mDACpB,IAAI,CAAC,uBAAuB,EAAE;;;;;;;;WACtC,EAAC,CAAA;SACH;OACF;;;2BACK,GAAG,EAAE,OAAO,EAAE;AAClB,YAAI,IAAI,CAAC,KAAK,EAAE;AACd,iBAAO,CAAC,GAAG,WAAS,IAAI,CAAC,MAAM,YAAO,GAAG,UAAK,OAAO,CAAC,IAAI,EAAI,OAAO,CAAC;AAAA,SACvE;OACF;;;;;;;qCAIe,oBAAM,EAAe,sBAAO,EAAgB;;;AAC1D,YAAI,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE;AAC1B,iBAAM;SACP;AACD,YAAI,IAAI,CAAC,KAAK,EAAE;AACd,iBAAO,CAAC,GAAG,cAAY,MAAM,YAAO,IAAI,CAAC,MAAM,UAAK,OAAO,CAAC,IAAI,EAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC;AAAA,SACzG;AACD,YAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE;;;AAElC,gBAAI,IAAI,QAAO,CAAA;AACf,gBAAI,CAAC,GAAG,OAAO,CAAA;AACf,kBAAK,CAAC,CAAC,EAAE,CAAC,kBAAkB,yBAAC;kBACvB,eAAe,EAGf,EAAE,EACF,GAAG;;;;;qDAJsB,IAAI,CAAC,WAAW,EAAE;;;AAA3C,qCAAe;qDACZ,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;;;qDAEvB,IAAI,CAAC,YAAY,EAAE;;;AAA/B,wBAAE;qDACW,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC;;;AAA3C,yBAAG;;AACP,0BAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,4BAAI,EAAE,aAAa;AACnB,0BAAE,EAAE,GAAG;AACP,gCAAQ,EAAE,eAAe;AACzB,iCAAS,EAAE,EAAE;uBACd,CAAC,CAAA;AACF,0BAAI,IAAI,CAAC,uBAAuB,EAAE;AAChC,4BAAI,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;AAChC,kCAAU,CAAC,YAAY;AACrB,8BAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,GAAG,EAAE;AAC9D,mCAAO,GAAG,KAAK,MAAM,CAAA;2BACtB,CAAC,CAAA;AACF,8BAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,gCAAI,EAAE,WAAW;2BAClB,CAAC,CAAA;yBACH,EAAE,IAAI,CAAC;AAAA,uBACT,MAAM;AACL,8BAAI,CAAC,IAAI,CAAC,MAAM,EAAE;AAChB,gCAAI,EAAE,WAAW;2BAClB,CAAC,CAAA;yBACH;AACD,0BAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;;;;;;;;aAC5B,EAAC,CAAA;;SACH,MAAM,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,EAAE;cAErC,WAAW;cAEX,EAAE;cACF,KAAK;;;AAJT,gBAAI,IAAI,QAAO,CAAA;AACX,uBAAW,GAAG,CAAC,MAAK,aAAa;;AACrC,kBAAK,aAAa,GAAG,IAAI,CAAA;AACrB,cAAE,GAAG,MAAK,CAAC,CAAC,EAAE;AACd,iBAAK,GAAG,EAAE;;AACd,iBAAK,CAAC,OAAO,GAAG,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;AAC7C,mBAAK,CAAC,OAAO,GAAG,OAAO,CAAA;aACxB,CAAC,CAAA;AACF,kBAAK,SAAS,GAAG,KAAK,CAAC,OAAO,CAAA;AAC9B,gBAAI,yBAAC,GAA2B,OAAO,CAAA;AACvC,cAAE,CAAC,kBAAkB,yBAAC;;;;;qDACb,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;;;AACvC,0BAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AACtB,wBAAE,CAAC,kBAAkB,yBAAC;4BAChB,GAAG,EAED,2BAAM;;;;;+DAFK,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC;;;AAA3C,mCAAG;;AACP,oCAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;AACd,wCAAM,GAAwB;AAChC,wCAAI,EAAE,QAAQ;AACd,uCAAG,EAAE,GAAG;mCACT;;AACD,sCAAI,CAAC,WAAW,EAAE;;AAChB,wCAAI,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;mCAC1B,MAAM;;AAEL,wCAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAA;mCACvB;iCACF;AACD,qCAAK,CAAC,OAAO,EAAE,CAAA;;;;;;;;uBAChB,EAAC,CAAA;;;;;;;;aACH,EAAC,CAAA;;SACH,MAAM,IAAI,OAAO,CAAC,IAAI,KAAK,WAAW,EAAE;AACvC,cAAI,IAAI,GAAG,IAAI,CAAA;AACf,cAAI,CAAC,SAAS,CAAC,IAAI,CAAC,YAAY;AAC9B,gBAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAA;WAC5B,CAAC,CAAA;SACH,MAAM,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE;AACpC,cAAI,IAAI,CAAC,uBAAuB,EAAE;;;;;;AAChC,oCAAmB,IAAI,CAAC,cAAc,mIAAE;oBAA/B,MAAM;;AACb,oBAAI,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;eAC3B;;;;;;;;;;;;;;;WACF;AACD,cAAI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,EAAE;AACtC,gBAAI,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE;AAC3C,qBAAO,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAA;aAC7B,CAAC,CAAA;AACF,gBAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;AACrB,kBAAI,CAAC,SAAS,CAAC;AACb,oBAAI,EAAE,QAAQ;AACd,mBAAG,EAAE,MAAM;eACZ,CAAC,CAAA;aACH;WACF;AACD,cAAI,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;SAC7B;OACF;;;qCACe,IAAI,EAAE;AACpB,YAAI,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAA;AACjC,YAAI,IAAI,IAAI,IAAI,EAAE;AAChB,cAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;SACrB;AACD,YAAI,IAAI,KAAK,IAAI,CAAC,iBAAiB,EAAE;AACnC,cAAI,CAAC,iBAAiB,GAAG,IAAI,CAAA;AAC7B,cAAI,CAAC,kBAAkB,EAAE,CAAA;SAC1B;OACF;;;;;;;;;;;;;;0CAcoB,YAAC,EAAY;AAChC,iBAAS,UAAU,CAAE,IAAI,EAAE;;;;;;AACzB,kCAAc,IAAI,CAAC,QAAQ,mIAAE;kBAApB,CAAC;;AACR,kBAAI,CAAC,CAAC,YAAY,CAAC,SAAS,CAAC,KAAK,MAAM,EAAE;AACxC,uBAAO,UAAU,CAAC,CAAC,CAAC,CAAA;eACrB,MAAM;AACL,uBAAO,WAAW,CAAC,CAAC,CAAC,CAAA;eACtB;aACF;;;;;;;;;;;;;;;SACF;AACD,iBAAS,WAAW,CAAE,eAAI,EAAY;AACpC,cAAI,IAAI,GAAG,EAAE,CAAA;AACb,eAAK,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,EAAE;AAC/B,gBAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAA;AAChC,gBAAI,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;AAC7B,gBAAI,KAAK,CAAC,GAAG,CAAC,IAAI,AAAC,EAAE,GAAG,GAAG,KAAM,KAAK,EAAE;AACtC,kBAAI,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAA;aACvB,MAAM;AACL,kBAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAA;aACrB;WACF;AACD,eAAK,IAAI,CAAC,WAAA,IAAc,IAAI,CAAC,QAAQ,EAAE;AACrC,gBAAI,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;AACjB,gBAAI,CAAC,CAAC,YAAY,CAAC,SAAS,CAAC,KAAK,MAAM,EAAE;AACxC,kBAAI,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;aAC3B,MAAM;AACL,kBAAI,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,CAAA;aAC5B;WACF;AACD,iBAAO,IAAI,CAAA;SACZ;AACD,mBAAW,CAAC,CAAC,CAAC,CAAA;OACf;;;;;;;;;;;;;;yCAWmB,GAAG,EAAE,GAAG,EAAE;;AAE5B,iBAAS,YAAY,CAAE,CAAC,EAAE,IAAI,EAAE;AAC9B,eAAK,IAAI,IAAI,IAAI,IAAI,EAAE;AACrB,gBAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;AACtB,gBAAI,IAAI,IAAI,IAAI,EAAE;;aAEjB,MAAM,IAAI,KAAK,CAAC,WAAW,KAAK,MAAM,EAAE;AACvC,4BAAY,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAA;eAC/B,MAAM,IAAI,KAAK,CAAC,WAAW,KAAK,KAAK,EAAE;AACtC,2BAAW,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAA;eAC9B,MAAM;AACL,iBAAC,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;eAC5B;WACF;SACF;AACD,iBAAS,WAAW,CAAE,CAAC,EAAE,KAAK,EAAE;AAC9B,WAAC,CAAC,YAAY,CAAC,SAAS,EAAE,MAAM,CAAC,CAAA;;;;;;AACjC,kCAAc,KAAK,mIAAE;kBAAZ,CAAC;;AACR,kBAAI,CAAC,CAAC,WAAW,KAAK,MAAM,EAAE;AAC5B,4BAAY,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAA;eACtC,MAAM;AACL,2BAAW,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,EAAE,CAAC,CAAC,CAAA;eACrC;aACF;;;;;;;;;;;;;;;SACF;AACD,YAAI,GAAG,CAAC,WAAW,KAAK,MAAM,EAAE;AAC9B,sBAAY,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,iCAAiC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;SAC5E,MAAM,IAAI,GAAG,CAAC,WAAW,KAAK,KAAK,EAAE;AACpC,qBAAW,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,EAAE,KAAK,EAAE,iCAAiC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;SAC3E,MAAM;AACL,gBAAM,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAA;SAC7C;OACF;;;WAtWG,iBAAiB;;;AAwWvB,GAAC,CAAC,iBAAiB,GAAG,iBAAiB,CAAA;CACxC,CAAA;;;;AC5WD,YAAY,CAAA;;;;;;;;;;;;AAEZ,MAAM,CAAC,OAAO,GAAG,UAAU,CAAC,EAAE;AAC5B,MAAI,UAAU,GAAG;AACf,SAAK,EAAE,EAAE;AACT,WAAO,EAAE,EAAE;AACX,cAAU,EAAE,oBAAU,IAAI,EAAE;AAC1B,WAAK,IAAI,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE;AACxB,YAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;OAC7B;AACD,aAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;AACvB,aAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;KAC1B;AACD,WAAO,EAAE,iBAAU,SAAS,EAAE;AAC5B,UAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,SAAS,CAAA;AACxC,UAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,GAAG,EAAE,CAAA;AACnC,WAAK,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,EAAE;AAC5B,YAAI,KAAK,KAAK,SAAS,CAAC,MAAM,EAAE;AAC9B,cAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;AACzB,WAAC,CAAC,UAAU,CAAC,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;AACxC,mBAAS,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAA;SACzC;OACF;KACF;AACD,4BAAwB,EAAE,oCAAY;AACpC,UAAI,EAAE,GAAG,EAAE,CAAA;AACX,WAAK,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AAC3B,UAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,EAAE,CAAC,CAAA;OAC1D;AACD,aAAO,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;KACvB;AACD,YAAQ,EAAE,SAAS,QAAQ,GAAI;AAC7B,UAAI,IAAI,GAAG,EAAE,CAAA;AACb,WAAK,IAAI,CAAC,IAAI,UAAU,CAAC,OAAO,EAAE;AAChC,YAAI,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AACpC,cAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;SACb;OACF;AACD,UAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;AACnB,YAAI,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAA;AAC5B,YAAI,CAAC,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,CAAA;AAC1C,YAAI,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;AACnC,YAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AAC/B,eAAO,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,EAAE,CAAA;OAC5C,MAAM;AACL,eAAO,KAAK,CAAA;OACb;KACF;AACD,YAAQ,EAAE,oBAAY;AACpB,aAAO,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;;;AAGpC,iBAAS,SAAS,GAAI;AACpB,cAAI,CAAC,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAA;AAC7B,cAAI,CAAC,EAAE;AACL,mBAAO,CAAC,EAAE;AACR,eAAC,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAA;aAC1B;AACD,sBAAU,CAAC,wBAAwB,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;WACtD,MAAM;AACL,sBAAU,CAAC,YAAY;AACrB,kBAAI,CAAC,GAAG,UAAU,CAAC,QAAQ,EAAE,CAAA;AAC7B,kBAAI,CAAC,EAAE;AACL,iBAAC,CAAC,IAAI,CAAC,YAAY;AACjB,4BAAU,CAAC,wBAAwB,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;iBACtD,CAAC,CAAA;eACH,MAAM;AACL,uBAAO,EAAE,CAAA;eACV;aACF,EAAE,EAAE,CAAC,CAAA;WACP;SACF;AACD,kBAAU,CAAC,wBAAwB,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;OACtD,CAAC,CAAA;KACH;GACF,CAAA;AACD,GAAC,CAAC,KAAK,CAAC,UAAU,GAAG,UAAU,CAAA;;AAE/B,MAAI,aAAa,GAAG,CAAC,CAAA;;MAEf,IAAI;cAAJ,IAAI;;AACR,aADI,IAAI,CACK,CAAC,EAAE,OAAO,EAAE;4BADrB,IAAI;;AAEN,UAAI,OAAO,KAAK,SAAS,EAAE;AACzB,cAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAA;OAClD;AACD,aAAO,CAAC,IAAI,GAAG,QAAQ,CAAA;AACvB,aAAO,CAAC,uBAAuB,GAAG,KAAK,CAAA;;yEANrC,IAAI,aAOA,CAAC,EAAE,OAAO;;AAChB,YAAK,SAAS,CAAC,AAAC,aAAa,EAAE,GAAI,EAAE,CAAC,CAAC,IAAI,CAAC,YAAM;AAChD,kBAAU,CAAC,OAAO,OAAM,CAAA;OACzB,CAAC,CAAA;AACF,YAAK,UAAU,GAAG,UAAU,CAAA;AAC5B,YAAK,qBAAqB,GAAG,CAAC,CAAA;;KAC/B;;iBAbG,IAAI;;qCAcQ,MAAM,EAAE,CAAC,EAAE;AACzB,mCAfE,IAAI,gDAee,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAC;OAC5D;;;2BACK,MAAM,EAAE,OAAO,EAAE;AACrB,YAAI,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;AACvC,YAAI,MAAM,IAAI,IAAI,EAAE;AAClB,gBAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;SAChE;OACF;;;gCACU,OAAO,EAAE;AAClB,aAAK,IAAI,GAAG,IAAI,UAAU,CAAC,OAAO,EAAE;AAClC,oBAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAA;SACjF;OACF;;;uCACiB;AAChB,eAAO,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAA;OAC7C;;;kCACY;AACX,YAAI,IAAI,CAAC,cAAc,EAAE,EAAE;AACzB,oBAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAA;AACxB,qCAlCA,IAAI,2CAkCa;SAClB;AACD,eAAO,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,EAAE,CAAA;OACrC;;;mCACa;AACZ,YAAI,CAAC,IAAI,CAAC,cAAc,EAAE,EAAE;AAC1B,oBAAU,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;AAClC,qCAzCA,IAAI,4CAyCc;SACnB;AACD,eAAO,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,wBAAwB,EAAE,CAAA;OAC5C;;;8BACQ;AACP,YAAI,IAAI,GAAG,IAAI,CAAA;AACf,eAAO,KAAK,yBAAC;cAEL,CAAC;;;;;AADP,yBAAO,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AAC7C,qBAAC,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE;;AAC/C,wBAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;mBAChC;;yBACK,IAAI,CAAC,wBAAwB,EAAE;;;;;;;;SACtC,EAAC,CAAA;OACH;;;WAtDG,IAAI;KAAS,CAAC,CAAC,iBAAiB;;AAyDtC,GAAC,CAAC,IAAI,GAAG,IAAI,CAAA;CACd,CAAA;;;;AC1ID,YAAY,CAAA;;;;;;AAEZ,MAAM,CAAC,OAAO,GAAG,UAAU,YAAC,EAAa;;;;;;;;;;;;;MAajC,gBAAgB;;;;;;;;;;;;;;;;;;;;;;;;AAuBpB,aAvBI,gBAAgB,CAuBP,CAAC,EAAE,IAAI,EAAE;4BAvBlB,gBAAgB;;AAwBlB,UAAI,CAAC,CAAC,GAAG,CAAC;;AAAA,AAEV,UAAI,CAAC,wBAAwB,GAAG,KAAK;;AAAA,AAErC,UAAI,CAAC,aAAa,GAAG,EAAE;;AAAA,AAEvB,UAAI,CAAC,uBAAuB,GAAG,EAAE;;AAAA,AAEjC,UAAI,CAAC,2BAA2B,GAAG,KAAK;;;;;;;;;;;;AAAA,AAaxC,UAAI,CAAC,gBAAgB,GAAG,EAAE,CAAA;AAC1B,UAAI,CAAC,qBAAqB,GAAG,IAAI,CAAA;AACjC,UAAI,CAAC,mBAAmB,GAAG,EAAE,CAAA;AAC7B,UAAI,CAAC,qBAAqB,GAAG,KAAK,CAAA;AAClC,UAAI,OAAO,wBAAwB,KAAK,WAAW,EAAE;AACnD,YAAI,CAAC,YAAY,GAAG,EAAE,CAAA;OACvB;AACD,UAAI,CAAC,GAAG,GAAG,EAAE;AAAA,AACb,UAAI,CAAC,GAAG,GAAG,EAAE;AAAA,AACb,UAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,IAAI,CAAA;AACvC,UAAI,EAAE,GAAG,IAAI,CAAA;AACb,eAAS,cAAc,GAAI;AACzB,eAAO,IAAI,OAAO,CAAC,UAAC,OAAO,EAAK;AAC9B,YAAE,CAAC,kBAAkB,yBAAC;gBAET,CAAC,EACJ,GAAG;;;;;0BAFP,EAAE,CAAC,CAAC,CAAC,SAAS,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAA;;;;;AAC1C,qBAAC,GAAG,CAAC;;;0BAAE,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAA;;;;;AAC3B,uBAAG,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;kDACZ,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC;;;AAFP,qBAAC,EAAE;;;;;AAItC,sBAAE,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAA;AACf,sBAAE,CAAC,GAAG,GAAG,EAAE,CAAA;;;AAEb,wBAAI,EAAE,CAAC,SAAS,GAAG,CAAC,EAAE;AACpB,wBAAE,CAAC,UAAU,GAAG,UAAU,CAAC,cAAc,EAAE,EAAE,CAAC,SAAS,CAAC,CAAA;qBACzD;AACD,2BAAO,EAAE,CAAA;;;;;;;;WACV,EAAC,CAAA;SACH,CAAC,CAAA;OACH;AACD,UAAI,CAAC,cAAc,GAAG,cAAc,CAAA;AACpC,UAAI,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE;AACtB,sBAAc,EAAE,CAAA;OACjB;KACF;;iBA9EG,gBAAgB;;mCA+EN;AACZ,YAAI,OAAO,wBAAwB,KAAK,WAAW,EAAE;AACnD,cAAI,qBAAO,GAAiB,KAAK,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE;AAC3E,gBAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;AACzB,qBAAO,CAAC,CAAA;aACT,MAAM;AACL,qBAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;aACzB;WACF,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;AACtE,cAAI,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;SAChC;OACF;;;qCACe;AACd,eAAO,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;OAC1C;;;6CACuB;AACtB,YAAI,IAAI,GAAG,IAAI,CAAA;AACf,eAAO,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;AACpC,cAAI,CAAC,kBAAkB,yBAAC;gBAClB,yBAAI,EAGC,CAAC,EACJ,EAAE;;;;;AAJJ,wBAAI,GAAwB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC;;AACzD,wBAAI,CAAC,GAAG,GAAG,EAAE,CAAA;AACb,wBAAI,CAAC,GAAG,GAAG,EAAE,CAAA;AACJ,qBAAC,GAAG,CAAC;;;0BAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;;;;;mDACb,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;;AAAtC,sBAAE;;AACN,2BAAO,EAAE,CAAC,EAAE,CAAA;mDACL,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;;;AAHG,qBAAC,EAAE;;;;;AAKpC,2BAAO,EAAE,CAAA;;;;;;;;WACV,EAAC,CAAA;SACH,CAAC,CAAA;OACH;;;;;;;;;;;;;4CAasB,EAAE,EAAE,IAAI,EAAE;AAC/B,YACE,EAAE,CAAC,EAAE,IAAI,IAAI,IACb,EAAE,CAAC,OAAO,KAAK,IAAI,IACnB,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,IACzB,IAAI,IAAI,IAAI,IACZ,IAAI,CAAC,OAAO,KAAK,IAAI,EACrB;AACA,YAAE,CAAC,EAAE,GAAG,IAAI,CAAA;AACZ,cAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;AACpB,iBAAO,IAAI,CAAA;SACZ,MAAM;AACL,iBAAO,KAAK,CAAA;SACb;OACF;;;iDAC2B,EAAE,EAAE;AAC9B,iBAAS,MAAM,CAAE,CAAC,EAAE;AAClB,iBAAO,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;SACrC;AACD,YAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;AAClC,YAAI,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;AAClC,eAAO,EAAE,CAAC,EAAE,CAAA;OACb;;;gCACU;AACT,qBAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;AAC9B,YAAI,CAAC,UAAU,GAAG,IAAI,CAAA;OACvB;;;gCACU,MAAM,EAAE;AACjB,YAAI,IAAI,GAAG,IAAI,CAAA;AACf,eAAO,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;AACpC,cAAI,CAAC,kBAAkB,yBAAC;gBAElB,KAAK;;;;;AADT,wBAAI,CAAC,MAAM,GAAG,MAAM,CAAA;mDACD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;;;AAApC,yBAAK;;AACT,wBAAI,CAAC,OAAO,GAAG,KAAK,CAAC,KAAK,CAAA;AAC1B,wBAAI,IAAI,CAAC,qBAAqB,IAAI,IAAI,EAAE;AACtC,0BAAI,CAAC,qBAAqB,EAAE,CAAA;AAC5B,0BAAI,CAAC,qBAAqB,GAAG,IAAI,CAAA;qBAClC;AACD,2BAAO,EAAE,CAAA;;;;;;;;WACV,EAAC,CAAA;SACH,CAAC,CAAA;OACH;;;oCACc,CAAC,EAAE;AAChB,YAAI,IAAI,CAAC,MAAM,IAAI,IAAI,EAAE;AACvB,WAAC,EAAE,CAAA;SACJ,MAAM;AACL,cAAI,CAAC,qBAAqB,GAAG,CAAC,CAAA;SAC/B;OACF;;;oCACc;AACb,YAAI,IAAI,CAAC,WAAW,IAAI,IAAI,EAAE;AAC5B,iBAAO,IAAI,CAAC,WAAW,CAAA;SACxB,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,EAAE;AAC9B,gBAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAA;SACvD,MAAM;AACL,iBAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAA;SACrC;OACF;;;;;;;;;;;4BASM,GAAG,EAAE;AACV,aAAK,IAAI,GAAG,IAAI,GAAG,EAAE;AACnB,cAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;AAChB,cAAI,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAA;AAChD,cAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;SACtC;OACF;;;;;;;;0CAKoB,GAAG,EAAE,EAAE,EAAE;AAC5B,YAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;AAClB,cAAI,QAAQ,GAAG;AACb,cAAE,EAAE,EAAE;AACN,mBAAO,EAAE,GAAG,CAAC,MAAM;WACpB,CAAA;;AAED,eAAK,IAAI,GAAG,IAAI,GAAG,EAAE;AACnB,gBAAI,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;AACjB,gBAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAA;AAC5B,gBAAI,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;AAC/B,gBAAI,CAAC,IAAI,IAAI,EAAE;AACb,eAAC,GAAG,EAAE,CAAA;AACN,kBAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;aAC5B;AACD,aAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;WACjB;SACF,MAAM;AACL,cAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC;AAChC,cAAE,EAAE,EAAE;WACP,CAAC,CAAA;SACH;;AAED,YAAI,IAAI,CAAC,2BAA2B,EAAE;AACpC,iBAAM;SACP;;AAED,YAAI,CAAC,2BAA2B,GAAG,IAAI,CAAA;AACvC,YAAI,KAAK,GAAG,IAAI,CAAA;;AAEhB,YAAI,CAAC,kBAAkB,yBAAC;cAClB,MAAM,EAGN,EAAE,EAiBO,GAAG,EAEN,CAAC,EATF,GAAG,EACN,CAAC,EACD,EAAE,EACF,EAAE,EAKE,QAAQ;;;;;AArBd,wBAAM,GAAG,KAAK,CAAC,uBAAuB;;AAC1C,uBAAK,CAAC,uBAAuB,GAAG,EAAE,CAAA;;AAE9B,oBAAE,GAAG,KAAK,CAAC,aAAa;;AAC5B,uBAAK,CAAC,aAAa,GAAG,EAAE,CAAA;;AAExB,uBAAK,CAAC,2BAA2B,GAAG,KAAK,CAAA;;AAEhC,qBAAG,GAAG,CAAC;;;wBAAE,GAAG,GAAG,MAAM,CAAC,MAAM,CAAA;;;;;AAC/B,mBAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE;iDACf,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;;;AAFA,qBAAG,EAAE;;;;;yDAK5B,EAAE;;;;;;;;AAAT,qBAAG;AACN,mBAAC,GAAG,EAAE,CAAC,GAAG,CAAC;AACX,oBAAE,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;iDACR,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;;;AAAjC,oBAAE;;wBACF,EAAE,IAAI,IAAI,CAAA;;;;;AACZ,uBAAK,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;;;;;yDAEZ,CAAC;;;;;;;;AAAR,qBAAG;AACN,0BAAQ,GAAG,CAAC,CAAC,GAAG,CAAC;AACjB,mBAAC,GAAG,QAAQ,CAAC,EAAE;;wBACf,EAAE,QAAQ,CAAC,OAAO,KAAK,CAAC,CAAA;;;;;iDACnB,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;;;;;;;;;;;;;;;;SAK9C,EAAC,CAAA;OACH;;;;;;;;;;;;;;yDAWa,EAAE;YAMR,OAAO,EAEL,kBAAkB;;;;;AAP1B,oBAAI,CAAC,KAAK,CAAC,UAAU,CAAC,0CAA0C,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;;sBACtF,EAAE,CAAC,MAAM,KAAK,QAAQ,CAAA;;;;;+CACjB,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;;;+CACtC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC;;;;;;;+CAErB,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,CAAC;;;AAAzC,uBAAO;;sBACP,OAAO,IAAI,IAAI,CAAA;;;;;+CACe,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,EAAE,CAAC;;;AAA1D,kCAAkB;;oBACjB,kBAAkB;;;;;+CACd,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;;;+CAC1C,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;;;+CACrB,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC;;;;;;;;;;;;;6DAMhC,WAAW,EAAE,EAAE;YAEzB,MAAM,EAEJ,IAAI,EAUN,CAAC,EACD,KAAK,EAUL,GAAG,EACH,CAAC,EAIM,GAAG,EACN,QAAQ,EAMZ,CAAC,EAGD,WAAW,EAET,KAAK;;;;;sBAzCT,EAAE,CAAC,MAAM,KAAK,QAAQ,CAAA;;;;;+CACJ,WAAW,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC;;;AAAnD,sBAAM;;sBACN,MAAM,IAAI,IAAI,CAAA;;;;;AACZ,oBAAI,GAAG,WAAW,CAAC,KAAK,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;;sBACxE,IAAI,IAAI,IAAI,CAAA;;;;;+CACP,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE;AAChC,wBAAM,EAAE,QAAQ;AAChB,wBAAM,EAAE,EAAE,CAAC,MAAM;iBAClB,CAAC;;;;;;;;AAKF,iBAAC,GAAG,EAAE;+CACS,WAAW,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;;;AAA7C,qBAAK;;;sBACF,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;;;;;;AAEjE,qBAAK,CAAC,KAAK,EAAE,CAAA;+CACN,WAAW,CAAC,wBAAwB,CAAC,KAAK,CAAC;;;+CACvC,WAAW,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;;;AAAxC,iBAAC;;;;;+CAEI,WAAW,CAAC,QAAQ,CAAC,KAAK,CAAC;;;;;AAG9B,mBAAG,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;AAC3B,iBAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC;;AAC/B,uBAAO,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,CAAA;;AAE9B,oBAAI,CAAC,IAAI,IAAI,EAAE;AACb,uBAAS,GAAG,IAAI,CAAC,EAAE;AACb,4BAAQ,GAAG,CAAC,CAAC,GAAG,CAAC;;AACrB,wBAAI,EAAE,QAAQ,CAAC,OAAO,KAAK,CAAC,EAAE;AAC5B,0BAAI,CAAC,mBAAmB,CAAC,EAAE,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAA;qBAC1C;mBACF;iBACF;AACG,iBAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;;;;+CAG/B,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC;;;AAAjD,2BAAW;;sBACX,CAAC,EAAE,CAAC,OAAO,IAAI,WAAW,CAAA;;;;;AACxB,qBAAK,GAAG;AACV,wBAAM,EAAE,QAAQ;AAChB,wBAAM,EAAE,EAAE,CAAC,EAAE;iBACd;+CACM,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC;;;sBAIxD,CAAC,IAAI,IAAI,CAAA;;;;;+CACJ,CAAC,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;;;;;;;;;;;iDAIhC;AAC1B,YAAI,IAAI,CAAC,qBAAqB,EAAE;AAC9B,cAAI,IAAI,CAAC,oBAAoB,IAAI,IAAI,EAAE;AACrC,gBAAI,OAAO,CAAA;AACX,gBAAI,OAAO,GAAG,IAAI,OAAO,CAAC,UAAU,CAAC,EAAE;AACrC,qBAAO,GAAG,CAAC,CAAA;aACZ,CAAC,CAAA;AACF,gBAAI,CAAC,oBAAoB,GAAG;AAC1B,qBAAO,EAAE,OAAO;AAChB,qBAAO,EAAE,OAAO;aACjB,CAAA;AACD,mBAAO,OAAO,CAAA;WACf,MAAM;AACL,mBAAO,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAA;WACzC;SACF,MAAM;AACL,iBAAO,OAAO,CAAC,OAAO,EAAE,CAAA;SACzB;OACF;;;uCACiB;AAChB,YAAI,IAAI,CAAC,mBAAmB,CAAC,MAAM,KAAK,CAAC,EAAE;AACzC,cAAI,CAAC,qBAAqB,GAAG,KAAK,CAAA;AAClC,cAAI,IAAI,CAAC,oBAAoB,IAAI,IAAI,EAAE;AACrC,gBAAI,CAAC,oBAAoB,CAAC,OAAO,EAAE,CAAA;AACnC,gBAAI,CAAC,oBAAoB,GAAG,IAAI,CAAA;WACjC;AACD,iBAAO,IAAI,CAAA;SACZ,MAAM;AACL,iBAAO,IAAI,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAA;SACxC;OACF;;;yCACmB,kBAAO,EAAY,eAAe,EAAE;AACtD,YAAI,IAAI,IAAI,eAAe,EAAE;;AAC3B,cAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;AACtC,cAAI,CAAC,IAAI,CAAC,qBAAqB,EAAE;AAC/B,gBAAI,CAAC,qBAAqB,GAAG,IAAI,CAAA;AACjC,gBAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAA;WACrC;SACF,MAAM;AACL,cAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;AACtC,cAAI,CAAC,IAAI,CAAC,qBAAqB,EAAE;AAC/B,gBAAI,CAAC,qBAAqB,GAAG,IAAI,CAAA;AACjC,gBAAI,IAAI,GAAG,IAAI,CAAA;AACf,sBAAU,CAAC,YAAY;AACrB,kBAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,CAAA;aACrC,EAAE,CAAC,CAAC,CAAA;WACN;SACF;OACF;;;WAxYG,gBAAgB;;;AA0YtB,GAAC,CAAC,gBAAgB,GAAG,gBAAgB,CAAA;CACtC,CAAA;;;;AC1ZD,YAAY;;;;;;;;;;;;;;;;;;;;AAAA;AAoBZ,MAAM,CAAC,OAAO,GAAG,UAAU,YAAC,EAAY;AACtC,MAAI,MAAM,GAAG;;;;;;;AAQX,UAAM,EAAE;AACN,YAAM,EAAE,gBAAU,EAAE,EAAE;AACpB,eAAO,EAAE,CAAA;OACV;AACD,iBAAW,EAAE,qBAAU,EAAE,EAAE;AACzB,eAAO,EAAE;AAAA,OACV;AACD,aAAO,0BAAE,iBAAY,EAAE;;;;;8CACP,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,MAAM,CAAC;;;;;;;;;;;OAC9C,CAAA;KACF;AACD,UAAM,EAAE;;;;;;;;;;;AAWN,YAAM,EAAE,gBAAU,mBAAE,kBAAmC;;;AAGrD,YAAI,YAAC,GAAa;AAChB,YAAE,EAAE,EAAE,CAAC,EAAE;AACT,cAAI,EAAE,EAAE,CAAC,IAAI;AACb,eAAK,EAAE,EAAE,CAAC,KAAK;AACf,gBAAM,EAAE,EAAE,CAAC,MAAM;AACjB,gBAAM,EAAE,EAAE,CAAC,MAAM;AACjB,gBAAM,EAAE,EAAE,CAAC,MAAM;SAClB,CAAA;AACD,YAAI,EAAE,CAAC,SAAS,IAAI,IAAI,EAAE;AACxB,WAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAA;SAC3B;AACD,YAAI,EAAE,CAAC,SAAS,IAAI,IAAI,EAAE;AACxB,WAAC,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAA;SAC3B,MAAM;AACL,WAAC,CAAC,OAAO,GAAG,EAAE,CAAC,OAAO,CAAA;SACvB;;AAED,eAAO,CAAC,CAAA;OACT;AACD,iBAAW,EAAE,qBAAU,EAAE,EAAE;AACzB,YAAI,GAAG,GAAG,EAAE,CAAA;AACZ,YAAI,EAAE,CAAC,IAAI,IAAI,IAAI,EAAE;AACnB,aAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAA;SAClB;AACD,YAAI,EAAE,CAAC,KAAK,IAAI,IAAI,EAAE;AACpB,aAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,CAAA;SACnB;AACD,YAAI,EAAE,CAAC,MAAM,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE;AAChE,aAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;SACpB;;AAAA,AAED,WAAG,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;;AAEnB,YAAI,EAAE,CAAC,SAAS,IAAI,IAAI,EAAE;AACxB,aAAG,CAAC,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,CAAA;SACvB;AACD,eAAO,GAAG,CAAA;OACX;AACD,yBAAmB,0BAAE,6BAAY,EAAE;YAI3B,CAAC,EACD,CAAC;;;;;sBAJH,EAAE,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;kDACV,CAAC;;;AAEJ,iBAAC,GAAG,CAAC;+CACM,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC;;;AAArC,iBAAC;;;oBACG,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,MAAM,EAAG,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,IAAI,CAAE;;;;;AACtD,iBAAC,EAAE,CAAA;;sBACC,CAAC,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;;;;+CAGL,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC;;;AAApC,iBAAC;;;;;;;kDAGE,CAAC;;;;;;;;OAEX,CAAA;;;;;;;;;;;;;;;;AAgBD,aAAO,0BAAE,iBAAW,EAAE;YAChB,CAAC,EACD,gBAAgB,EAChB,CAAC,EACD,MAAM,EACN,KAAK,EAQH,OAAO,EAQL,eAAe,EA4BnB,IAAI,EACJ,KAAK;;;;;+CAhDyB,MAAM,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;;;AAA9E,gCAAgB,GAAG,CAAC;;sBAMpB,EAAE,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;+CACN,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC;;;AAArC,iBAAC;;sBACI,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+BAAI,IAAI;;;;;+CAAU,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;;;;AAAhE,iBAAC;;;;;+CAEe,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC;;;AAA5C,sBAAM;AACF,uBAAO,GAAG,EAAE,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,MAAM,CAAC,KAAK;;sBAC5D,OAAO,IAAI,IAAI,CAAA;;;;;+BAAG,IAAI;;;;;+CAAU,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC;;;;;;AAAlE,qBAAK;;AACL,iBAAC,GAAG,KAAK,CAAA;;;qBAIJ,IAAI;;;;;sBACL,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,KAAK,CAAC,CAAA;;;;;+CACrB,MAAM,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;;;AAAxE,+BAAe;;sBACf,eAAe,KAAK,CAAC,CAAA;;;;;;AAEvB,oBAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;AACtB,oBAAE,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAA;AACd,kCAAgB,GAAG,CAAC,GAAG,CAAC,CAAA;iBACzB;;;;;sBACQ,eAAe,GAAG,CAAC,CAAA;;;;;;AAE5B,oBAAI,CAAC,GAAG,gBAAgB,IAAI,eAAe,EAAE;AAC3C,oBAAE,CAAC,IAAI,GAAG,CAAC,CAAC,EAAE,CAAA;AACd,kCAAgB,GAAG,CAAC,GAAG,CAAC,CAAA;iBACzB;;;;;;;;AAIH,iBAAC,EAAE,CAAA;;sBACC,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACN,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;AAArC,iBAAC;;;;;AAED,iBAAC,GAAG,IAAI,CAAA;;;;;;;;;;;;;;;;AAQV,oBAAI,GAAG,IAAI;AACX,qBAAK,GAAG,IAAI;;sBACZ,MAAM,IAAI,IAAI,CAAA;;;;;+CACA,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,MAAM,CAAC;;;AAA5C,sBAAM;;;sBAIJ,EAAE,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;+CACH,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC;;;AAAxC,oBAAI;;AACJ,kBAAE,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAA;AACrB,oBAAI,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE,CAAA;;+CAEX,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;;;;;;;AAE9B,kBAAE,CAAC,KAAK,GAAG,EAAE,CAAC,SAAS,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,IAAI,GAAG,MAAM,CAAC,KAAK,CAAA;;;sBAGvE,EAAE,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACH,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,KAAK,CAAC;;;AAA1C,qBAAK;;AACL,qBAAK,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE;;;AAAA,AAGlB,oBAAI,KAAK,CAAC,EAAE,IAAI,IAAI,EAAE;AACpB,sBAAI,CAAC,KAAK,CAAC,0BAA0B,CAAC,KAAK,CAAC,CAAA;iBAC7C;+CACM,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;;sBAI7B,EAAE,CAAC,SAAS,IAAI,IAAI,CAAA;;;;;sBAClB,IAAI,IAAI,IAAI,CAAA;;;;;AACd,sBAAM,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,CAAA;+CACzB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;;;sBAI9B,EAAE,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACX,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,KAAK,EAAE,IAAI,CAAC;;;sBAEzC,EAAE,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;+CACV,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC;;;;;;;sBAGtC,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,CAAA;;;;;AAC/B,oBAAI,KAAK,IAAI,IAAI,EAAE;AACjB,wBAAM,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,CAAA;iBACnB;AACD,oBAAI,IAAI,IAAI,IAAI,EAAE;AAChB,wBAAM,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE,CAAA;iBACrB;+CACM,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;;;;;;;;OAGrC,CAAA;KACF;AACD,QAAI,EAAE;;;;;;;;;;AAUJ,YAAM,EAAE,gBAAU,EAAE,EAAE;AACpB,eAAO;AACL,gBAAM,EAAE,MAAM;AACd,YAAE,EAAE,EAAE,CAAC,EAAE;AACT,cAAI,EAAE,EAAE,CAAC,IAAI;SACd,CAAA;OACF;AACD,iBAAW,EAAE,uBAAY;;;;;;;;;;;AAWvB,eAAO,EAAE,CAAA;OACV;AACD,aAAO,0BAAE,iBAAY,EAAE;;;;;AACrB,kBAAE,CAAC,KAAK,GAAG,IAAI,CAAA;AACf,kBAAE,CAAC,GAAG,GAAG,IAAI,CAAA;;;;;;;;OACd,CAAA;AACD,SAAG,0BAAE,aAAY,EAAE,EAAE,GAAG;YAIlB,GAAG,EACH,CAAC;;;;;sBAJD,EAAE,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;kDACX,IAAI;;;AAET,mBAAG,GAAG,IAAI;+CACC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,KAAK,CAAC;;;AAAtC,iBAAC;;;qBAEE,IAAI;;;;;AACT,oBAAI,CAAC,CAAC,CAAC,OAAO,EAAE;AACd,qBAAG,GAAG,CAAC,CAAA;AACP,qBAAG,EAAE,CAAA;iBACN;;sBACG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CAClB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;AAArC,iBAAC;;;;;;;;;;;;kDAKE,GAAG;;;;;;;;OACX,CAAA;AACD,SAAG,0BAAE,aAAY,CAAC,EAAE,CAAC;YAEf,GAAG,EAED,SAAS;;;;;AAHf,iBAAC,GAAG,CAAC,CAAC,KAAK,CAAA;AACP,mBAAG,GAAG,EAAE;;;sBACL,CAAC,IAAI,IAAI,CAAA;;;;;+CACS,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;;;AAAvC,yBAAS;;AACb,oBAAI,CAAC,SAAS,CAAC,OAAO,EAAE;AACtB,qBAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAA;iBACvB;AACD,iBAAC,GAAG,SAAS,CAAC,KAAK,CAAA;;;;;kDAEd,GAAG;;;;;;;;OACX,CAAA;KACF;AACD,OAAG,EAAE;;;;;;;;;AASH,YAAM,EAAE,gBAAU,EAAE,EAAE;AACpB,eAAO;AACL,gBAAM,EAAE,KAAK;AACb,cAAI,EAAE,EAAE,CAAC,IAAI;AACb,YAAE,EAAE,EAAE,CAAC,EAAE;AACT,aAAG,EAAE,EAAE;AAAA,SACR,CAAA;OACF;AACD,iBAAW,EAAE,uBAAY;AACvB,eAAO,EAAE,CAAA;OACV;AACD,aAAO,0BAAE;;;;;;;;;;OAAgB,CAAA;;;;AAIzB,SAAG,0BAAE,aAAY,EAAE,EAAE,IAAI;YACnB,GAAG,EAED,GAAG;;;;;AAFL,mBAAG,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC;;sBAClB,GAAG,IAAI,IAAI,CAAA;;;;;+CACI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC;;;AAAnC,mBAAG;;sBACH,GAAG,IAAI,IAAI,IAAI,GAAG,CAAC,OAAO,CAAA;;;;;kDACrB,KAAK,CAAC;;;sBACJ,GAAG,CAAC,SAAS,IAAI,IAAI,CAAA;;;;;kDACvB,GAAG,CAAC,OAAO;;;+CAEJ,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC;;;;;;;;;;;OAG9C,CAAA;KACF;GACF,CAAA;AACD,GAAC,CAAC,MAAM,GAAG,MAAM,CAAA;CAClB,CAAA;;;;AC/UD,YAAY;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA;;;;;AA2EZ,MAAM,CAAC,OAAO,GAAG,UAAU,YAAC,EAAY;MAChC,oBAAoB;aAApB,oBAAoB;4BAApB,oBAAoB;;;iBAApB,oBAAoB;;;;;;;;;;;;;;sDAYb,EAAE;YACP,GAAG,EACH,CAAC,EAEC,gCAAE;;;;;AAHJ,mBAAG,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;AACxB,iBAAC,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC;;sBACpC,CAAC,IAAI,IAAI,CAAA;;;;;8CACkC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;;;AAA9D,kBAAE;;sBACF,EAAE,IAAI,IAAI,CAAA;;;;;8CACD,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC;;;AAAzD,iBAAC;;AACD,oBAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;;;iDAGjC,CAAC;;;;;;;;;;;;;;;;;qEAOgB,GAAG;YACvB,IAAI,EACC,CAAC,EACJ,EAAE;;;;;AAFJ,oBAAI,GAAG,EAAE;AACJ,iBAAC,GAAG,CAAC;;;sBAAE,CAAC,GAAG,GAAG,CAAC,MAAM,CAAA;;;;;AACxB,kBAAE,GAAG,GAAG,CAAC,CAAC,CAAC;+CACR,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;;;AAC3C,oBAAI,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAA;;;AAHX,iBAAC,EAAE;;;;;AAKnC,oBAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,cAAc,EAAE,EAAE;;;AAE5C,sBAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC;AAC/B,wBAAI,EAAE,QAAQ;AACd,uBAAG,EAAE,IAAI;mBACV,CAAC,CAAA;iBACH;;;;;;;;;;;yDAGW,KAAK;;;;;qBACb,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ;;;;;;sBAC1B,KAAK,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAA;;;;;+CACtC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;;AAAvC,qBAAK;;AACL,qBAAK,CAAC,EAAE,GAAG,IAAI,CAAA;+CACR,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;;;AAE/B,oBAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAA;AAC7B,qBAAK,GAAG,KAAK,CAAC,KAAK,CAAA;;;;;;;;;;;;;;;;;;;;;;;;8DAUN,QAAQ,EAAE,eAAe;YACtC,MAAM,EACN,QAAQ,EA6BG,IAAI,EAWb,IAAI,EAiBJ,KAAK;;;;;+CA1DS,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC;;;AAA3C,sBAAM;AACN,wBAAQ,GAAG,KAAK;;sBAEhB,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,CAAA;;;;;+CAC5B,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;;;sBAG/B,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,EAAE,IAAI,IAAI,CAAA;;;;;oBAChC,MAAM,CAAC,OAAO;;;;;AACjB,wBAAQ,GAAG,IAAI;;AAAA,AAEf,sBAAM,CAAC,OAAO,GAAG,IAAI;;;;;;;;;;;;;AAAA;sBAajB,MAAM,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CAEf,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC;;;+CAC7B,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;;;sBAE/B,MAAM,CAAC,GAAG,IAAI,IAAI,CAAA;;;;;uDACH,MAAM,CAAC,GAAG;;;;;;;;AAAlB,oBAAI;+CACJ,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;;;;;;;+CAGnC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;;;sBAE/B,MAAM,CAAC,SAAS,IAAI,IAAI,CAAA;;;;;+CACnB,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,SAAS,CAAC;;;AAC7C,sBAAM,CAAC,SAAS,GAAG,IAAI,CAAA;;;sBAIvB,MAAM,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;+CACP,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC;;;AAA5C,oBAAI;;;;;AAEJ,oBAAI,GAAG,IAAI,CAAA;;;;AAGb,oBAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,MAAM,EAAE,IAAI,CAAC;;;AAAA,+CAGvC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;;;sBAQ5B,MAAM,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACP,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC;;;AAA9C,qBAAK;;;;;AAEL,qBAAK,GAAG,IAAI,CAAA;;;sBAGZ,KAAK,IAAI,IAAI,IACb,IAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;;;;;+CAExC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;;kDAE1B,QAAQ;;;;;;;;;;;;;;;mEAMK,EAAE;YAEpB,CAAC,EAIG,MAAM,EAOR,IAAI,EACJ,IAAI;;;;;+CAZK,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC;;;AAA/B,iBAAC;;oBACA,CAAC,CAAC,EAAE;;;;;sBACH,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;;;;;;AAEb,sBAAM,GAAG,CAAC,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA,AAAC;;AACtC,iBAAC,CAAC,GAAG,IAAI,MAAM,CAAA;+CACR,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;AACrB,iBAAC,GAAG,EAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAC,CAAA;+CAC7B,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;+CAGL,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;;;AAAlC,oBAAI;+CACU,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;;;AAAlC,oBAAI;;sBAEJ,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAA;;;;;+CAEtB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE,EAAE,KAAK,EAAC,CAAC;;;AACvE,iBAAC,CAAC,GAAG,GAAG,CAAC,CAAA;;;;AAGX,iBAAC,CAAC,EAAE,GAAG,IAAI;;AAAA;sBAGT,IAAI,IAAI,IAAI,IACZ,IAAI,CAAC,EAAE,IACP,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAA;;;;;AAE7D,oBAAI,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAA;+CACV,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;;;AAC3B,iBAAC,GAAG,IAAI;;AAAA;;sBAKR,IAAI,IAAI,IAAI,IACZ,IAAI,CAAC,EAAE,IACP,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;;;;;AAEvD,iBAAC,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,CAAA;+CACV,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;;;+CAEzB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;;;;;;;;;;;;;;0DAQV,EAAE;YAEX,CAAC,EAmBD,IAAI;;;;;+CAnBO,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC;;;AAAzC,iBAAC;;sBACD,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAA;;;;;sBAC5B,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAA;;;;;kDAEtC,CAAC;;;sBACC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAA;;;;;;AAE3C,iBAAC,CAAC,GAAG,EAAE,CAAA;;;;;;AAGP,iBAAC,GAAG,EAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAC,CAAA;+CACxB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;;;;;;AAIvB,iBAAC,GAAG,EAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,KAAK,EAAC,CAAA;+CACxB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;+CAGL,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;;;AAApC,oBAAI;;sBAEN,IAAI,IAAI,IAAI,IACZ,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,IACvD,CAAC,IAAI,CAAC,EAAE,CAAA;;;;;AAER,iBAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAA;+CACjB,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;;;+CAEzB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;;;kDACd,CAAC;;;;;;;;;;;;;;;;;;;;;;+CAQD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,0BAAE,iBAAY,EAAE;sBAE/C,IAAI;;;;;gCADN,EAAE,CAAC,OAAO,IAAI,EAAE,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;yDACb,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC;;;AAAxC,8BAAI;;AACR,8BAAI,CAAC,KAAK,CAAC,qBAAqB,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;;;;;;;;iBAE7C,EAAC;;;;;;;;;;;;;;;;;;;;;sEAWuB,EAAE;YAGvB,KAAK,EAWL,CAAC,EAWG,IAAI,EAOJ,KAAK,EAKH,SAAS,EAEP,UAAU,EAaV,CAAC,EACD,GAAG,EAwBP,yBAAM,EACN,SAAS;;;;;AA7EjB,oBAAI,CAAC,KAAK,CAAC,UAAU,CAAC,sCAAsC,EAAE,EAAE,EAAE,GAAG,CAAC;;AAAA,+CAEnD,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;;;AAAnC,qBAAK;;sBACL,KAAK,CAAC,KAAK,KAAK,EAAE,CAAC,CAAC,CAAC,CAAA;;;;;AACvB,qBAAK,CAAC,KAAK,EAAE;;AAAA,+CAEN,IAAI,CAAC,wBAAwB,CAAC,KAAK,CAAC;;;+CAEpC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC;;;+CAEtB,IAAI,CAAC,oBAAoB,CAAC,EAAE,CAAC;;;+CAGrB,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;;;AAAhC,iBAAC;;sBACD,CAAC,IAAI,IAAI,CAAA;;;;;sBASP,CAAC,CAAC,IAAI,IAAI,IAAI,CAAA;;;;;+CACE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC;;;AAAvC,oBAAI;;AACR,oBAAI,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;+CACb,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC;;;sBAI5B,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACE,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;AAAzC,qBAAK;;AACT,qBAAK,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;;qBACf,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC;;;;;;;;AAGpC,yBAAS,GAAG,CAAC,CAAC,IAAI;;;sBACf,SAAS,IAAI,IAAI,CAAA;;;;;+CACE,IAAI,CAAC,YAAY,CAAC,SAAS,CAAC;;;AAAhD,0BAAU;;qBACV,UAAU,CAAC,OAAO;;;;;;;;AAGtB,yBAAS,GAAG,UAAU,CAAC,IAAI,CAAA;;;;;;;AAI7B,qBAAK,CAAC,MAAM,GAAG,SAAS;;;;AAAA;sBAIpB,KAAK,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;+CACN,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,KAAK,CAAC;;;AAAzC,iBAAC;AACD,mBAAG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC;;;qBAClB,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;AAC5B,yBAAO,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAA;iBACxC,CAAC;;;;;qBACI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAAC;;;;;;AAEpC,iBAAC,CAAC,MAAM,GAAG,SAAS,CAAA;+CACb,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;;;sBAGzB,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;;;;+CAGN,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;AAArC,iBAAC;;;;;;;+CAMF,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;;;sBAG7B,CAAC,CAAC,MAAM,IAAI,IAAI,CAAA;;;;;+CAEqB,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC;;;AAA9D,sBAAM;AACN,yBAAS,GAAG,KAAK;;AACrB,oBAAI,CAAC,CAAC,SAAS,IAAI,IAAI,EAAE;AACvB,sBAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;AACrD,6BAAS,GAAG,IAAI,CAAA;AAChB,0BAAM,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,KAAK,CAAA;mBAClC;iBACF,MAAM;AACL,sBAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;;AAE1C,6BAAS,GAAG,IAAI,CAAA;AAChB,0BAAM,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;mBACvB;AACD,sBAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;;AAExC,6BAAS,GAAG,IAAI,CAAA;AAChB,0BAAM,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAA;mBACpB;iBACF;;qBACG,SAAS;;;;;+CACJ,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;;;+CAI7B,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,CAAC;;;;;;;;;;;uEAGT,KAAK;YAC3B,CAAC;;;;;gDAAU,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;;;AAAhE,iBAAC;;AACL,oBAAI,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE,EAAE;AAC/C,uBAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;iBACrD;;;;;;;;;;;;;;;;6DAMe,EAAE;YACd,SAAS,EACJ,eAAe,EAMf,IAAI,EACP,EAAE,EACF,GAAG,EACH,CAAC,EA+CE,CAAC,EACJ,GAAG,EACH,EAAE,EAEF,YAAY,EAWZ,GAAG;;;;;AAvEA,+BAAe,YAAf,eAAe,CAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,EAAE,EAAE;AAC9C,uBAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,KAAK,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE;AACxC,6BAAS,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAA;mBAC9B;iBACF;;AALG,yBAAS,GAAG,EAAE;wDAOD,EAAE;;;;;;;;AAAV,oBAAI;AACP,kBAAE,GAAG,EAAE,CAAC,IAAI,CAAC;AACb,mBAAG,GAAG,CAAC;AACP,iBAAC,GAAG,EAAE,CAAC,GAAG,CAAC;gDACR,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,CAAC,0BAAE,kBAAY,CAAC;sBAYvE,IAAI;;;;;gCADH,CAAC,IAAI,IAAI,CAAA;;;;;AACV,8BAAI,GAAG,CAAC;;gCACR,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;;;;;;;;AAGpB,8BAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;;;;AAIzB,gCAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;AACrC,2CAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;2BACxC,MAAM;;AAEL,gCAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAAA,AAC7B,gCAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;;;AAGjB,6CAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;6BACxD;2BACF;;;AACD,8BAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;;AAEhB,6BAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAA;2BACd,MAAM;AACL,6BAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;AAAA,AAClB,6BAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI;AAAA,2BACnB;;;;;;;;;;iBAEJ,EAAC;;;;AAEF,uBAAO,GAAG,GAAG,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;AAC7B,mBAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAA;AACX,iCAAe,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;iBACxC;;;;;AAEM,iBAAC,GAAG,CAAC;;;sBAAE,CAAC,GAAG,SAAS,CAAC,MAAM,CAAA;;;;;AAC9B,mBAAG,GAAG,SAAS,CAAC,CAAC,CAAC;AAClB,kBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;;;gDAEC,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC;;;AAA9C,4BAAY;;qBACZ,YAAY;;;;;gDAEP,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,EAAE,EAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAC,CAAC;;;qBAEpE,GAAG,CAAC,CAAC,CAAC;;;;;gDAED,IAAI,CAAC,uBAAuB,CAAC,EAAE,CAAC;;;AAXL,iBAAC,EAAE;;;;;AAczC,oBAAI,IAAI,CAAC,KAAK,CAAC,wBAAwB,EAAE;AACnC,qBAAG,GAAG,SAAS,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE;AACnC,2BAAO,EAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAC,CAAA;mBAChD,CAAC;;AACF,sBAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC;AAC/B,wBAAI,EAAE,QAAQ;AACd,uBAAG,EAAE,GAAG;mBACT,CAAC,CAAA;iBACH;;;;;;;;;;;iEAEmB,EAAE;YAClB,CAAC;;;;;gDAAU,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC;;;AAAzC,iBAAC;mDACE,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE;;;;;;;;;;;;;;;;YAMpE,EAAE;;;;;AAAF,kBAAE,GAAG,EAAE;gDACJ,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,0BAAE,kBAAY,CAAC;sBAChD,IAAI,EACJ,OAAO,EACP,GAAG,EACH,EAAE,EACF,EAAE;;;;;AAJF,8BAAI,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACd,iCAAO,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACjB,6BAAG,GAAG,CAAC,CAAC,GAAG;AACX,4BAAE,GAAG,CAAC,CAAC,EAAE;AACT,4BAAE,GAAG,EAAE,CAAC,IAAI,CAAC;;AACjB,8BAAI,EAAE,KAAK,KAAK,CAAC,EAAE;AACjB,8BAAE,GAAG,EAAE,CAAA;AACP,8BAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;2BACd;AACD,4BAAE,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,CAAA;;;;;;;;iBAC5B,EAAC;;;mDACK,EAAE;;;;;;;;;;;wDAEE,EAAE;YACT,CAAC;;;;;gDAAU,IAAI,CAAC,EAAE,CAAC,kBAAkB,CAAC,EAAE,CAAC;;;AAAzC,iBAAC;mDACE,CAAC,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG;;;;;;;;;;;2DAElD,EAAE;;;;;gDACT,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;;;mDACf,EAAE;;;;;;;;;;;2DAEK,EAAE;;;;;gDACT,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;;;AACtB,oBAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,cAAc,EAAE,IAAI,IAAI,CAAC,KAAK,CAAC,wBAAwB,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE;;AAEvG,sBAAI,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC;AAC/B,wBAAI,EAAE,QAAQ;AACd,uBAAG,EAAE,CAAC,EAAE,CAAC;mBACV,CAAC,CAAA;iBACH;;;;;;;;;;;2DAEa,aAAE;YACZ,CAAC,EAMG,QAAQ;;;;;gDAND,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;;;AAA3B,iBAAC;;sBACD,CAAC,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAA;;;;;mDACrB,CAAC;;;sBAGJ,IAAI,CAAC,KAAK,CAAC,WAAW,IAAI,IAAI,CAAA;;;;;AAC5B,wBAAQ,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;;AAClC,oBAAI,CAAC,KAAK,CAAC,WAAW,GAAG,EAAE,CAAA;gDACpB,CAAC,CAAC,QAAQ,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;;;AACxC,uBAAO,IAAI,CAAC,KAAK,CAAC,WAAW,CAAA;gDACf,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;;;;;;mDAGvB,IAAI;;;;;;;;;;;8DAIE,EAAE;;;;;gDACZ,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;;;;;;;;;;;uDAEf,KAAK;YACX,GAAG;;;;;AAAH,mBAAG,GAAG;AACR,oBAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;AAChB,uBAAK,EAAE,KAAK,CAAC,KAAK;iBACnB;gDACM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC;;;;;;;;;;;uDAEb,IAAI;YACV,CAAC,EACD,KAAK;;;;;gDADM,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;;;AAA/B,iBAAC;AACD,qBAAK,GAAG,CAAC,IAAI,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK;;AACtC,oBAAI,KAAK,IAAI,IAAI,EAAE;AACjB,uBAAK,GAAG,CAAC,CAAA;iBACV;mDACM;AACL,sBAAI,EAAE,IAAI;AACV,uBAAK,EAAE,KAAK;iBACb;;;;;;;;;;;;YAGG,WAAW;;;;;AAAX,2BAAW,GAAG,EAAE;gDACb,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,0BAAE,kBAAY,CAAC;;;;;AACpD,qCAAW,CAAC,IAAI,CAAC;AACf,gCAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACb,iCAAK,EAAE,CAAC,CAAC,KAAK;2BACf,CAAC,CAAA;;;;;;;;iBACH,EAAC;;;mDACK,WAAW;;;;;;;;;;;;YAGd,EAAE;;;;;AAAF,kBAAE,GAAG,EAAE;gDACJ,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,0BAAE,kBAAY,CAAC;;;;;AACpD,4BAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,CAAA;;;;;;;;iBACtB,EAAC;;;mDACK,EAAE;;;;;;;;;;;4DAEM,OAAO;YAKlB,GAAG,EAEH,KAAK,kFACA,QAAQ,EACX,IAAI,EAIJ,QAAQ,EAMV,GAAG,uFACE,EAAE,EACL,CAAC;;;;;;;AAnBP,oBAAI,OAAO,IAAI,IAAI,EAAE;AACnB,yBAAO,GAAG,EAAE,CAAA;iBACb;AACG,mBAAG,GAAG,EAAE;gDAEO,IAAI,CAAC,cAAc,EAAE;;;AAApC,qBAAK;;;;;4BACY,KAAK;;;;;;;;AAAjB,wBAAQ;AACX,oBAAI,GAAG,QAAQ,CAAC,IAAI;;sBACpB,IAAI,KAAK,GAAG,CAAA;;;;;;;;AAGZ,wBAAQ,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;gDAE1B,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,SAAS,CAAC,0BAAE,kBAAY,EAAE;;;;;AACrF,6BAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;;;;;;;;iBACb,EAAC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEA,mBAAG,GAAG,EAAE;;;;;6BACG,GAAG;;;;;;;;AAAT,kBAAE;gDACM,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,EAAE,CAAC;;;AAA/C,iBAAC;;AACL,mBAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;mDAEN,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;iEAuCU,OAAO,EAAE,EAAE;YAG3B,CAAC,EACD,GAAG,EAMD,KAAK;;;;;AATX,kBAAE,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;AACnC,kBAAE,GAAG,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAA;AACvB,iBAAC,GAAG,EAAE;AACN,mBAAG,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;;;;;;;sBAKV,CAAC,CAAC,KAAK,IAAI,IAAI,CAAA;;;;;gDACD,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC;;;AAAzC,qBAAK;;sBACL,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA,AAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE;AACrE,yBAAO,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;iBAC5C,CAAC,CAAA;;;;;;;;AAGF,mBAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;AACjB,iBAAC,GAAG,KAAK,CAAA;;;;;AAEX,kBAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;AAClB,kBAAE,CAAC,IAAI,GAAG,EAAE,CAAC,MAAM,CAAA;mDACZ,EAAE;;;;;;;;;;;WA/mBP,oBAAoB;;;AAknB1B,GAAC,CAAC,WAAW,GAAG,oBAAoB,CAAA;CACrC,CAAA;;;;AC/rBD,YAAY;;;;;;;;;;;;;;;;;;;;;;;;AAAA;;;;;AAwBZ,MAAM,CAAC,OAAO,GAAG,UAAU,YAAC,EAAa;AACvC,GAAC,CAAC,KAAK,GAAG,EAAE,CAAA;;MAEN,YAAY;;;;;;;;;;;;;;AAchB,aAdI,YAAY,CAcH,wBAAO,EAAmB;4BAdnC,YAAY;;AAed,UAAI,CAAC,OAAO,GAAG,EAAE,CAAA;AACjB,UAAI,CAAC,QAAQ,GAAG,CAAC,CAAA;AACjB,UAAI,CAAC,OAAO,GAAG,OAAO,CAAA;AACtB,UAAI,CAAC,cAAc,GAAG,EAAE,CAAA;KACzB;;;;;AAAA;iBAnBG,YAAY;;iCAwBJ,EAAE,EAAE;AACd,YAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE;AACtB,cAAI,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;SACnB,MAAM;AACL,cAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,CAAA;SAC1C;OACF;;;;;;;;;8CAMwB,GAAG,EAAE;AAC5B,YAAI,CAAC,QAAQ,EAAE,CAAA;AACf,YAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;OAClB;;;;;;;;uCAKiB,CAAC,EAAE;AACnB,YAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;OAC5B;;;0CACoB,CAAC,EAAE;AACtB,YAAI,CAAC,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE;AAC5D,iBAAO,CAAC,KAAK,CAAC,CAAA;SACf,CAAC,CAAA;OACH;;;gDAC0B;AACzB,YAAI,CAAC,cAAc,GAAG,EAAE,CAAA;OACzB;;;yCACmB,KAAK,EAAE;AACzB,aAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACnD,cAAI;AACF,gBAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;WAC9B,CAAC,OAAO,CAAC,EAAE;AACV,mBAAO,CAAC,GAAG,CAAC,oCAAoC,CAAC;AAAA,WAClD;SACF;OACF;;;;;;;qCAIe,CAAC,EAAE;AACjB,YAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AACtD,aAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,EAAE,EAAE;AACzC,cAAI,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,CAAA;AACjB,cAAI,EAAE,CAAC,MAAM,KAAK,QAAQ,EAAE;AAC1B,iBAAK,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACjD,kBAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAA;AACvB,kBAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,EAAE;AACzB,oBAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;;AAErC,mBAAC,CAAC,KAAK,GAAG,EAAE,CAAC,EAAE;;AAAA,AAEf,oBAAE,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAA;iBACjB,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;;AAE7C,mBAAC,CAAC,IAAI,GAAG,EAAE,CAAC,EAAE,CAAA;AACd,oBAAE,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;iBACnB;eACF;aACF;WACF,MAAM;AACL,kBAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAA;WAC9C;SACF;AACD,YAAI,CAAC,cAAc,EAAE,CAAA;OACtB;;;;;;;qCAIe,CAAC,EAAE,OAAO,EAAE;AAC1B,YAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;AACtD,aAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACnC,cAAI,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;AAChB,cAAI,GAAG,CAAC,MAAM,KAAK,QAAQ,EAAE;AAC3B,gBAAI,OAAO,IAAI,IAAI,EAAE;AACnB,mBAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC5C,oBAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;;AAAA,AAEvB,oBAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE;AACnE,mBAAC,CAAC,IAAI,GAAG,OAAO,CAAA;iBACjB;eACF;aACF;WACF,MAAM;AACL,kBAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAA;WAC9C;SACF;AACD,YAAI,CAAC,cAAc,EAAE,CAAA;OACtB;;;;;;;uCAIiB;AAChB,YAAI,CAAC,QAAQ,EAAE,CAAA;AACf,YAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE;AACjD,cAAI,MAAM,GAAG,IAAI,CAAC,OAAO,CAAA;AACzB,cAAI,CAAC,OAAO,GAAG,EAAE,CAAA;AACjB,cAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;SACrB;OACF;;;WA9HG,YAAY;;;AAgIlB,GAAC,CAAC,KAAK,CAAC,YAAY,GAAG,YAAY;;;;;;;;;;;;AAAA;MAa7B,UAAU;;;;;;AAMd,WANI,UAAU,CAMD,GAAG,EAAE;0BANd,UAAU;;AAOZ,QAAI,GAAG,CAAC,UAAU,IAAI,IAAI,IACxB,GAAG,CAAC,QAAQ,IAAI,IAAI,IACpB,GAAG,CAAC,KAAK,IAAI,IAAI,EACjB;AACA,YAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAA;KAC9D;AACD,QAAI,CAAC,UAAU,GAAG,GAAG,CAAC,UAAU,CAAA;AAChC,QAAI,CAAC,QAAQ,GAAG,GAAG,CAAC,QAAQ,CAAA;AAC5B,QAAI,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,CAAA;GACvB;;AAEH,GAAC,CAAC,KAAK,CAAC,UAAU,GAAG,UAAU;;;;;;AAAA,AAM/B,WAAS,UAAU,CAAE,CAAC,EAAE;AACtB,QAAI,CAAC,GAAG,EAAE,CAAA;AACV,SAAK,IAAI,GAAG,IAAI,CAAC,EAAE;AACjB,OAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAA;KAChB;AACD,WAAO,CAAC,CAAA;GACT;AACD,GAAC,CAAC,KAAK,CAAC,UAAU,GAAG,UAAU;;;;;AAAA,AAK/B,WAAS,OAAO,CAAE,CAAC,EAAE,CAAC,EAAE;AACtB,WAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,AAAC,CAAA;GACrD;AACD,GAAC,CAAC,KAAK,CAAC,OAAO,GAAG,OAAO,CAAA;;AAEzB,WAAS,UAAU,CAAE,GAAG,EAAE,GAAG,EAAE;AAC7B,QAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;AAC9B,UAAI,GAAG,IAAI,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE;AAC9B,eAAO,IAAI,CAAA;OACZ;AACD,aAAO,KAAK,CAAA;KACb;AACD,QAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE;AAC1C,aAAO,IAAI,CAAA;KACZ,MAAM;AACL,aAAO,KAAK,CAAA;KACb;GACF;AACD,GAAC,CAAC,KAAK,CAAC,UAAU,GAAG,UAAU,CAAA;CAChC,CAAA;;;;AC/ND,YAAY,CAAA;;;;;;AAEZ,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAA;AAC5B,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAA;AAC3B,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAA;AAC9B,OAAO,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;AACzB,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAA;AACxB,OAAO,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAA;;AAElC,IAAI,gBAAgB,GAAG,EAAE,CAAA;;AAEzB,MAAM,CAAC,OAAO,GAAG,CAAC,CAAA;;AAElB,CAAC,CAAC,MAAM,GAAG,UAAU,IAAI,EAAE,KAAK,EAAE;AAChC,GAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAA;AACf,MAAI,gBAAgB,CAAC,IAAI,CAAC,IAAI,IAAI,EAAE;AAClC,oBAAgB,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,CAAA;AAChC,WAAO,gBAAgB,CAAC,IAAI,CAAC,CAAA;GAC9B;CACF,CAAA;;AAED,CAAC,CAAC,cAAc,GAAG,cAAc,CAAA;AACjC,SAAS,cAAc,CAAE,OAAO,EAAE;;;;AAIhC,MAAI,SAAS,GAAG,OAAO,kBAAkB,KAAK,WAAW,GAAG,KAAK,GAAG,MAAM,CAAA;AAC1E,MAAI,QAAQ,GAAG,EAAE,CAAA;AACjB,OAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACvC,QAAI,UAAU,GAAG,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAA;AAChD,QAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;AACzB,UAAI,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE;;AAExC,YAAI,OAAO,MAAM,KAAK,WAAW,IAAI,MAAM,CAAC,CAAC,KAAK,WAAW,EAAE;cACzD,QAAQ;;;AAAR,oBAAQ,GAAG,QAAQ,CAAC,aAAa,CAAC,QAAQ,CAAC;;AAC/C,oBAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,SAAS,GAAG,GAAG,GAAG,UAAU,GAAG,GAAG,GAAG,UAAU,GAAG,SAAS,CAAA;AAC5E,oBAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAA;;AAEnC,gBAAI,aAAa,GAAG,EAAE,CAAA;AACtB,4BAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,aAAa,CAAA;AAC5C,yBAAa,CAAC,OAAO,GAAG,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;AACrD,2BAAa,CAAC,OAAO,GAAG,OAAO,CAAA;aAChC,CAAC,CAAA;AACF,oBAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,CAAC,CAAA;;SACrC,MAAM;AACL,iBAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAA;SACvB;OACF,MAAM;AACL,gBAAQ,CAAC,IAAI,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAA;OACpD;KACF;GACF;AACD,SAAO,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;CAC7B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,AA+BD,SAAS,CAAC,CAAE,oBAAI,yBAAyC;AACvD,MAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,GAAG,EAAE,CAAA;AACjD,MAAI,OAAO,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;AACpE,OAAK,IAAI,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE;AAC3B,WAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAA;GAC/B;AACD,GAAC,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAA;AAC5B,SAAO,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,YAAY;AAChD,WAAO,IAAI,OAAO,CAAC,UAAU,OAAO,EAAE;AACpC,UAAI,OAAO,GAAG,IAAI,OAAO,CAAC,IAAI,EAAE,YAAY;AAC1C,eAAO,CAAC,EAAE,CAAC,aAAa,CAAC,YAAY;AACnC,iBAAO,CAAC,OAAO,CAAC,CAAA;SACjB,CAAC,CAAA;OACH,CAAC,CAAA;KACH,CAAC,CAAA;GACH,CAAC,CAAA;CACH;;IAEK,OAAO;;;;;;;AAMX,WANI,OAAO,CAME,IAAI,EAAE,QAAQ,EAAE;0BANzB,OAAO;;AAOT,QAAI,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC,CAAA;AAC5C,QAAI,CAAC,SAAS,GAAG,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,CAAA;AACjE,QAAI,KAAK,GAAG,EAAE,CAAA;AACd,QAAI,CAAC,KAAK,GAAG,KAAK,CAAA;AAClB,QAAI,CAAC,EAAE,CAAC,kBAAkB,yBAAC,SAAW,kBAAkB;UAE7C,YAAY;;;;;oDAAI,IAAI,CAAC,KAAK;;;;;;;;AAA1B,0BAAY;4CACU,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,GAAG,GAAG,YAAY,CAAC,CAAC;;;AAA/F,mBAAK,CAAC,YAAY,CAAC;;;;;AAErB,wBAAU,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAA;;;;;;;SALa,kBAAkB;KAMvD,EAAC,CAAA;GACH;;eAlBG,OAAO;;kCAmBI;AACb,aAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAA;KAC/B;;;iCACa;AACZ,aAAO,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAA;KACnC;;;gCACY;AACX,aAAO,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,CAAA;KAClC;;;8BACU;AACT,UAAI,CAAC,UAAU,EAAE,CAAA;AACjB,UAAI,CAAC,EAAE,CAAC,OAAO,EAAE,CAAA;AACjB,UAAI,CAAC,SAAS,GAAG,IAAI,CAAA;AACrB,UAAI,CAAC,EAAE,GAAG,IAAI,CAAA;KACf;;;SAjCG,OAAO;;;AAoCb,IAAI,OAAO,MAAM,KAAK,WAAW,EAAE;AACjC,QAAM,CAAC,CAAC,GAAG,CAAC,CAAA;CACb","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 if (state === GenStateSuspendedYield) {\n context.sent = arg;\n } else {\n context.sent = undefined;\n }\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 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","/* @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 */\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 }\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 this.userId = userId\n return this.y.db.setUserId(userId)\n }\n onUserEvent (f) {\n this.userEventListeners.push(f)\n }\n userLeft (user) {\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 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 if (syncUser != null) {\n var conn = this\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 })\n })\n } else {\n this.isSynced = true\n // call when synced listeners\n for (var f of this.whenSyncedListeners) {\n f()\n }\n this.whenSyncedListeners = []\n this.y.db.requestTransaction(function *() {\n yield* this.garbageCollectAfterSync()\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 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.type === 'sync step 1') {\n // TODO: make transaction, stream the ops\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 })\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 var update /* :MessageUpdate */ = {\n type: 'update',\n ops: ops\n }\n if (!broadcastHB) { // TODO: consider to broadcast here..\n conn.send(sender, update)\n } else {\n // broadcast only once!\n conn.broadcast(update)\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.broadcast({\n type: 'update',\n ops: delops\n })\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: {},\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 i in globalRoom.buffers) {\n if (globalRoom.buffers[i].length > 0) {\n bufs.push(i)\n }\n }\n if (bufs.length > 0) {\n var userId = getRandom(bufs)\n var m = globalRoom.buffers[userId].shift()\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 }, 10)\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 buffer.push(JSON.parse(JSON.stringify([this.userId, message])))\n }\n }\n broadcast (message) {\n for (var key in globalRoom.buffers) {\n globalRoom.buffers[key].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 while (globalRoom.buffers[self.userId].length > 0) {\n var m = globalRoom.buffers[self.userId].shift()\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 // 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.whenUserIdSetListener = null\n this.waitingTransactions = []\n this.transactionInProgress = 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 || 5000\n var os = this\n function garbageCollect () {\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 if (os.gcTimeout > 0) {\n os.gcInterval = setTimeout(garbageCollect, os.gcTimeout)\n }\n resolve()\n })\n })\n }\n this.garbageCollect = garbageCollect\n if (this.gcTimeout > 0) {\n garbageCollect()\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 delete op.gc\n yield* this.setOperation(op)\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 this.y.connector.isSynced &&\n left != null &&\n left.deleted === true\n ) {\n op.gc = true\n this.gc1.push(op.id)\n return true\n } else {\n return false\n }\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 }\n setUserId (userId) {\n var self = this\n return new Promise(function (resolve) {\n self.requestTransaction(function * () {\n self.userId = userId\n var state = yield* this.getState(userId)\n self.opClock = state.clock\n if (self.whenUserIdSetListener != null) {\n self.whenUserIdSetListener()\n self.whenUserIdSetListener = null\n }\n resolve()\n })\n })\n }\n whenUserIdSet (f) {\n if (this.userId != null) {\n f()\n } else {\n this.whenUserIdSetListener = f\n }\n }\n getNextOpId () {\n if (this._nextUserId != null) {\n return this._nextUserId\n } else if (this.userId == null) {\n throw new Error('OperationStore not yet initialized!')\n } else {\n return [this.userId, this.opClock++]\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 key in ops) {\n var o = ops[key]\n var required = Y.Struct[o.struct].requiredOps(o)\n this.whenOperationsExist(required, o)\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 key in ids) {\n let id = ids[key]\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 = yield* this.getOperation(id)\n if (op == null) {\n store.listenersById[sid] = l\n } else {\n for (let key in l) {\n let listener = l[key]\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 yield* this.store.operationAdded(this, op)\n } else {\n var defined = yield* this.getOperation(op.id)\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 }\n }\n }\n // called by a transaction when an operation is added\n * operationAdded (transaction, op) {\n if (op.struct === 'Delete') {\n var target = yield* transaction.getOperation(op.target)\n if (target != null) {\n var type = transaction.store.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(transaction, {\n struct: 'Delete',\n target: op.target\n })\n }\n }\n } else {\n // increase SS\n var o = op\n var state = yield* transaction.getState(op.id[0])\n while (o != null && o.id[1] === state.clock && op.id[0] === o.id[0]) {\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++\n yield* transaction.checkDeleteStoreForState(state)\n o = yield* transaction.os.findNext(o.id)\n }\n yield* transaction.setState(state)\n\n // notify whenOperation listeners (by id)\n var sid = JSON.stringify(op.id)\n var l = this.listenersById[sid]\n delete this.listenersById[sid]\n\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 var t = this.initializedTypes[JSON.stringify(op.parent)]\n\n // Delete if DS says this is actually deleted\n var opIsDeleted = yield* transaction.isDeleted(op.id)\n if (!op.deleted && opIsDeleted) {\n var delop = {\n struct: 'Delete',\n target: op.id\n }\n yield* Y.Struct['Delete'].execute.call(transaction, delop)\n }\n\n // notify parent, if it has been initialized as a custom type\n if (t != null) {\n yield* t._changed(transaction, Y.utils.copyObject(op))\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 getNextRequest () {\n if (this.waitingTransactions.length === 0) {\n this.transactionInProgress = false\n if (this.transactionsFinished != null) {\n this.transactionsFinished.resolve()\n this.transactionsFinished = null\n }\n return null\n } else {\n return this.waitingTransactions.shift()\n }\n }\n requestTransaction (makeGen/* :any */, callImmediately) {\n if (true || callImmediately) { // TODO: decide whether this is ok or not..\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n this.transact(this.getNextRequest())\n }\n } else {\n this.waitingTransactions.push(makeGen)\n if (!this.transactionInProgress) {\n this.transactionInProgress = true\n var self = this\n setTimeout(function () {\n self.transact(self.getNextRequest())\n }, 0)\n }\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)\n }\n },\n Insert: {\n /* {\n content: any,\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.opContent != null) {\n e.opContent = op.opContent\n } else {\n e.content = op.content\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.getOperation(op.left)\n while (!Y.utils.compareIds(op.origin, (o ? o.id : null))) {\n d++\n if (o.left == null) {\n break\n } else {\n o = yield* this.getOperation(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 var distanceToOrigin = i = yield* Struct.Insert.getDistanceToOrigin.call(this, op) // most cases: 0 (starts from 0)\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.getOperation(op.left)\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 // 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 = o.id\n distanceToOrigin = i + 1\n }\n } else if (oOriginDistance < i) {\n // case 2\n if (i - distanceToOrigin <= oOriginDistance) {\n op.left = o.id\n distanceToOrigin = i + 1\n }\n } else {\n break\n }\n i++\n if (o.right != null) {\n o = yield* this.getOperation(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.getOperation(op.left)\n op.right = left.right\n left.right = op.id\n\n yield* this.setOperation(left)\n } else {\n op.right = op.parentSub ? parent.map[op.parentSub] || null : parent.start\n }\n // reconnect right\n if (op.right != null) {\n right = yield* this.getOperation(op.right)\n right.left = op.id\n\n // if right exists, and it is supposed to be gc'd. Remove it from the gc\n if (right.gc != null) {\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 if (op.right != null) {\n yield* this.deleteOperation(op.right, true)\n }\n if (op.left != null) {\n yield* this.deleteOperation(op.id, true)\n }\n } else {\n if (right == null || left == null) {\n if (right == null) {\n parent.end = op.id\n }\n if (left == null) {\n parent.start = op.id\n }\n yield* this.setOperation(parent)\n }\n }\n }\n },\n List: {\n /*\n {\n start: null,\n end: null,\n struct: \"List\",\n type: \"\",\n id: this.os.getNextOpId()\n }\n */\n encode: function (op) {\n return {\n struct: 'List',\n id: op.id,\n type: op.type\n }\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()\n }\n */\n encode: function (op) {\n return {\n struct: 'Map',\n type: op.type,\n id: op.id,\n map: {} // overwrite map!!\n }\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\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) {\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].initType.call(this, this.store, op)\n this.store.initializedTypes[sid] = t\n }\n }\n return t\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 send.push(Y.Struct[op.struct].encode(op))\n }\n if (!this.store.y.connector.isDisconnected()) { // 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.broadcast({\n type: 'update',\n ops: send\n })\n }\n }\n\n * deleteList (start) {\n if (this.store.y.connector.isSynced) {\n while (start != null && this.store.y.connector.isSynced) {\n start = yield* this.getOperation(start)\n start.gc = true\n yield* this.setOperation(start)\n // TODO: will always reset the parent..\n this.store.gc1.push(start.id)\n start = start.right\n }\n } else {\n // TODO: when not possible??? do later in (gcWhenSynced)\n }\n }\n\n /*\n Mark an operation as deleted, and add it to the GC, if possible.\n */\n * deleteOperation (targetId, preventCallType) /* :Generator */ {\n var target = yield* this.getOperation(targetId)\n var callType = false\n\n if (target == null || !target.deleted) {\n yield* this.markDeleted(targetId)\n }\n\n if (target != null && target.gc == null) {\n if (!target.deleted) {\n callType = true\n // set deleted & notify type\n target.deleted = true\n /*\n if (!preventCallType) {\n var type = this.store.initializedTypes[JSON.stringify(target.parent)]\n if (type != null) {\n yield* type._changed(this, {\n struct: 'Delete',\n target: targetId\n })\n }\n }\n */\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)\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)\n }\n if (target.opContent != null) {\n yield* this.deleteOperation(target.opContent)\n target.opContent = null\n }\n }\n var left\n if (target.left != null) {\n left = yield* this.getOperation(target.left)\n } else {\n left = null\n }\n\n this.store.addToGarbageCollector(target, left)\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 (\n right != null &&\n this.store.addToGarbageCollector(right, target)\n ) {\n yield* this.setOperation(right)\n }\n return callType\n }\n }\n /*\n Mark an operation as deleted&gc'd\n */\n * markGarbageCollected (id) {\n // this.mem.push([\"gc\", id]);\n var n = yield* this.markDeleted(id)\n if (!n.gc) {\n if (n.id[1] < id[1]) {\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] < n.id[1] + n.len - 1) {\n // un-extend right\n yield* this.ds.put({id: [id[0], id[1] + 1], len: n.len - 1, gc: false})\n n.len = 1\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 }\n }\n /*\n Mark an operation as deleted.\n\n returns the delete node\n */\n * markDeleted (id) {\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 // already deleted\n return n\n } else if (n.id[1] + n.len === id[1] && !n.gc) {\n // can extend existing deletion\n n.len++\n } else {\n // cannot extend left\n n = {id: id, len: 1, gc: false}\n yield* this.ds.put(n)\n }\n } else {\n // cannot extend left\n n = {id: id, len: 1, 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 Y.utils.compareIds([n.id[0], n.id[1] + n.len], next.id) &&\n !next.gc\n ) {\n n.len = n.len + next.len\n yield* this.ds.delete(next.id)\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 yield* this.os.iterate(this, null, null, function * (op) {\n if (op.deleted && op.left != null) {\n var left = yield* this.getOperation(op.left)\n this.store.addToGarbageCollector(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 // check to increase the state of the respective user\n var state = yield* this.getState(id[0])\n if (state.clock === id[1]) {\n state.clock++\n // also check if more expected operations were gc'd\n yield* this.checkDeleteStoreForState(state)\n // then set the state\n yield* this.setState(state)\n }\n yield* this.markGarbageCollected(id)\n\n // if op exists, then clean that mess up..\n var o = yield* this.getOperation(id)\n if (o != null) {\n /*\n if (!o.deleted) {\n yield* this.deleteOperation(id)\n o = yield* this.getOperation(id)\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.getOperation(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 if (Y.utils.compareIds(right.origin, o.id)) { // rights origin is o\n // find new origin of right ops\n // origin is the first left deleted operation\n var neworigin = o.left\n while (neworigin != null) {\n var neworigin_ = yield* this.getOperation(neworigin)\n if (neworigin_.deleted) {\n break\n }\n neworigin = neworigin_.left\n }\n\n // reset origin of right\n right.origin = neworigin\n\n // reset origin of all right ops (except first right - duh!),\n // 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 i = yield* this.getOperation(i.right)\n }\n }\n }\n } /* otherwise, rights origin is to the left of o,\n then there is no right op (from o), that origins in o */\n yield* this.setOperation(right)\n }\n\n if (o.parent != null) {\n // remove gc'd op from parent, if it exists\n var parent /* MapOperation */ = yield* this.getOperation(o.parent)\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 parent.map[o.parentSub] = o.right\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.compareIds(parent.end, o.id)) {\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 /*\n apply a delete set in order to get\n the state of the supplied ds\n */\n * applyDeleteSet (ds) {\n var deletions = []\n function createDeletions (user, start, len, gc) {\n for (var c = start; c < start + len; c++) {\n deletions.push([user, c, gc])\n }\n }\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 createDeletions(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 createDeletions(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 createDeletions(user, d[0], d[1], d[2])\n }\n }\n for (var i = 0; i < deletions.length; i++) {\n var del = deletions[i]\n var id = [del[0], del[1]]\n // always try to delete..\n var addOperation = yield* this.deleteOperation(id)\n if (addOperation) {\n // TODO:.. really .. here? You could prevent calling all these functions in operationAdded\n yield* this.store.operationAdded(this, {struct: 'Delete', target: id})\n }\n if (del[2]) {\n // gc\n yield* this.garbageCollectOperation(id)\n }\n }\n if (this.store.forwardAppliedOperations) {\n var ops = deletions.map(function (d) {\n return {struct: 'Delete', target: [d[0], d[1]]}\n })\n this.store.y.connector.broadcast({\n type: 'update',\n ops: 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 && op.id[0] !== '_') {\n // is connected, and this is not going to be send in addOperation\n this.store.y.connector.broadcast({\n type: 'update',\n ops: [op]\n })\n }\n }\n * getOperation (id/* :any */)/* :Transaction */ {\n var o = yield* this.os.find(id)\n if (o != null || id[0] !== '_') {\n return o\n } else {\n // need to generate this operation\n if (this.store._nextUserId == null) {\n var typename = id[1].split('_')[0]\n this.store._nextUserId = id\n yield* Y[typename].createType.call(this)\n delete this.store._nextUserId\n return yield* this.os.find(id)\n } else {\n // Can only generate one operation at a time\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 * getOperations (startSS) {\n // TODO: use bounds here!\n if (startSS == null) {\n startSS = {}\n }\n var ops = []\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\n yield* this.os.iterate(this, [user, startPos], [user, Number.MAX_VALUE], function * (op) {\n ops.push(op)\n })\n }\n var res = []\n for (var op of ops) {\n var o = yield* this.makeOperationReady(startSS, op)\n res.push(o)\n }\n return res\n }\n /*\n Here, we make op 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 * makeOperationReady (startSS, op) {\n op = Y.Struct[op.struct].encode(op)\n op = Y.utils.copyObject(op)\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 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 will help you to make your type\n synchronous.\n*/\nmodule.exports = function (Y /* : any*/) {\n Y.utils = {}\n\n class EventHandler {\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 this.waiting = []\n this.awaiting = 0\n this.onevent = onevent\n this.eventListeners = []\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(Y.utils.copyObject(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 this.onevent(ops)\n }\n /*\n Basic event listener boilerplate...\n TODO: maybe put this in a different type..\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.log('User events must not throw Errors!') // eslint-disable-line\n }\n }\n }\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 if (w.struct === 'Insert') {\n if (Y.utils.compareIds(op.left, w.id)) {\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(op.right, w.id)) {\n // similar..\n w.left = op.id\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 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 /* (private)\n Try to execute the events for the waiting operations\n */\n _tryCallEvents () {\n this.awaiting--\n if (this.awaiting <= 0 && this.waiting.length > 0) {\n var events = this.waiting\n this.waiting = []\n this.onevent(events)\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 * createType\n - Defines the model of a newly created custom type and returns the 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 createType: any;\n initType: any;\n class: Function;\n */\n constructor (def) {\n if (def.createType == null ||\n def.initType == null ||\n def.class == null\n ) {\n throw new Error('Custom type was not initialized correctly!')\n }\n this.createType = def.createType\n this.initType = def.initType\n this.class = def.class\n }\n }\n Y.utils.CustomType = CustomType\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 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])\n }\n Y.utils.smaller = smaller\n\n function compareIds (id1, id2) {\n if (id1 == null || id2 == null) {\n if (id1 == null && id2 == null) {\n return true\n }\n return false\n }\n if (id1[0] === id2[0] && id1[1] === id2[1]) {\n return true\n } else {\n return false\n }\n }\n Y.utils.compareIds = compareIds\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\n\nY.extend = function (name, value) {\n Y[name] = value\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 modulename = 'y-' + modules[i].toLowerCase()\n if (Y[modules[i]] == null) {\n if (requiringModules[modules[i]] == 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[modules[i]] = requireModule\n requireModule.promise = new Promise(function (resolve) {\n requireModule.resolve = resolve\n })\n promises.push(requireModule.promise)\n } else {\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 Y.requestModules(modules).then(function () {\n return new Promise(function (resolve) {\n var yconfig = new YConfig(opts, function () {\n yconfig.db.whenUserIdSet(function () {\n resolve(yconfig)\n })\n })\n })\n })\n}\n\nclass YConfig {\n /* ::\n db: Y.AbstractDatabase;\n connector: Y.AbstractConnector;\n share: {[key: string]: any};\n */\n constructor (opts, callback) {\n this.db = new Y[opts.db.name](this, opts.db)\n this.connector = new Y[opts.connector.name](this, opts.connector)\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 share[propertyname] = yield* this.getType(['_', opts.share[propertyname] + '_' + propertyname])\n }\n setTimeout(callback, 0)\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 this.disconnect()\n this.db.destroy()\n this.connector = null\n this.db = null\n }\n}\n\nif (typeof window !== 'undefined') {\n window.Y = Y\n}\n"]} \ No newline at end of file