async-dependency-graph
Version:
A dependency graph that can traverse asynchronous nodes.
273 lines • 19.7 kB
JavaScript
"use strict";
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
return new (P || (P = Promise))(function (resolve, reject) {
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
step((generator = generator.apply(thisArg, _arguments || [])).next());
});
};
var __generator = (this && this.__generator) || function (thisArg, body) {
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
return g.next = verb(0), g["throw"] = verb(1), g["return"] = verb(2), typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
function verb(n) { return function (v) { return step([n, v]); }; }
function step(op) {
if (f) throw new TypeError("Generator is already executing.");
while (g && (g = 0, op[0] && (_ = 0)), _) try {
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
if (y = 0, t) op = [op[0] & 2, t.value];
switch (op[0]) {
case 0: case 1: t = op; break;
case 4: _.label++; return { value: op[1], done: false };
case 5: _.label++; y = op[1]; op = [0]; continue;
case 7: op = _.ops.pop(); _.trys.pop(); continue;
default:
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
if (t[2]) _.ops.pop();
_.trys.pop(); continue;
}
op = body.call(thisArg, _);
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
}
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.Graph = void 0;
/**
* Base dependency graph class.
*/
var Graph = /** @class */ (function () {
function Graph() {
this.nodes = new Set();
this.outgoingEdges = new Map();
this.incomingEdges = new Map();
}
/**
* Add a node to the graph.
* @param node Node object.
*/
Graph.prototype.ensureNode = function (node) {
if (!this.nodes.has(node)) {
this.nodes.add(node);
this.outgoingEdges.set(node, []);
this.incomingEdges.set(node, []);
}
};
/**
* Remove a node from the graph.
* @param node Node instance.
*/
Graph.prototype.removeNode = function (node) {
if (!this.nodes.has(node))
throw new Error("Node does not exist in the graph!");
this.nodes.delete(node);
this.outgoingEdges.delete(node);
this.incomingEdges.delete(node);
for (var _i = 0, _a = Array.from(this.incomingEdges.keys()); _i < _a.length; _i++) {
var dependent = _a[_i];
var edges = this.incomingEdges.get(dependent);
var index = edges.indexOf(node);
if (index !== -1) {
edges.splice(index, 1);
}
}
for (var _b = 0, _c = Array.from(this.outgoingEdges.keys()); _b < _c.length; _b++) {
var dependency = _c[_b];
var edges = this.outgoingEdges.get(dependency);
var index = edges.indexOf(node);
if (index !== -1) {
edges.splice(index, 1);
}
}
};
/**
* Checks to see if the graph contains a Node.
* @param node Node instance.
*/
Graph.prototype.hasNode = function (node) {
return this.nodes.has(node);
};
Object.defineProperty(Graph.prototype, "size", {
/**
* Returns the number of nodes in a graph.
*/
get: function () {
return this.nodes.size;
},
enumerable: false,
configurable: true
});
/**
* Adds a node dependence. "from" is dependent on "to"
* @param from Node instance.
* @param to Node instance.
*/
Graph.prototype.addDependency = function (from, to) {
if (from === to)
throw new Error("Cannot add self dependency");
this.ensureNode(from);
this.ensureNode(to);
var outgoing = this.outgoingEdges.get(from);
if (!outgoing.includes(to)) {
outgoing.push(to);
}
var incoming = this.incomingEdges.get(to);
if (!incoming.includes(from)) {
incoming.push(from);
}
};
/**
* Removes a node dependence. "from" is no longer dependent on "to".
* @param from Node instance.
* @param to Node instance.
* @todo Test this function.
*/
Graph.prototype.removeDependency = function (from, to) {
if (!this.hasNode(from))
throw new Error("Node does not exist: ".concat(from.name));
if (!this.hasNode(to)) {
// Dependency is not in the graph, so do nothing
return;
}
;
if (from === to)
throw new Error("Cannot remove self dependency");
var outgoing = this.outgoingEdges.get(from);
var outgoingIndex = outgoing.indexOf(to);
if (outgoingIndex !== -1) {
outgoing.splice(outgoingIndex, 1);
}
var incoming = this.incomingEdges.get(to);
var incomingIndex = incoming.indexOf(from);
if (incomingIndex !== -1) {
incoming.splice(incomingIndex, 1);
}
};
/**
* Get dependency nodes for a Node. (Required nodes for this node to execute).
* @param node Node instance.
*/
Graph.prototype.dependenciesOf = function (node) {
return this.outgoingEdges.get(node) || [];
};
/**
* Get dependents nodes for a Node. (Nodes that require this node to complete).
* @param node Node instance.
*/
Graph.prototype.dependentsOf = function (node) {
return this.incomingEdges.get(node) || [];
};
/**
* Breadth first search.
*/
Graph.prototype.traverse = function () {
return __awaiter(this, void 0, void 0, function () {
var visit, rootNodes;
var _this = this;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
// Clear all complete node mutexes.
Array.from(this.nodes).forEach(function (node) { return node.clearMutex(); });
visit = function (node) { return __awaiter(_this, void 0, void 0, function () {
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
// First await all dependencies
return [4 /*yield*/, Promise.all(this.dependenciesOf(node).map(function (dependency) { return dependency.data(); }))];
case 1:
// First await all dependencies
_a.sent();
node.signalDependenciesReady();
if (!(this.dependentsOf(node).length > 0)) return [3 /*break*/, 3];
// Then recursively visit all dependents
return [4 /*yield*/, Promise.all(this.dependentsOf(node).map(function (dependent) { return visit(dependent); }))];
case 2:
// Then recursively visit all dependents
_a.sent();
return [3 /*break*/, 5];
case 3:
// node has no dependents so await data
return [4 /*yield*/, node.data()];
case 4:
// node has no dependents so await data
_a.sent();
_a.label = 5;
case 5: return [2 /*return*/];
}
});
}); };
rootNodes = Array.from(this.nodes).filter(function (node) { return _this.dependenciesOf(node).length === 0; });
if (rootNodes.length === 0 && this.nodes.size > 0) {
throw new Error('The graph is circular. Cannot traverse graph due to no root node.');
}
// Start recursive traversal from root nodes.
return [4 /*yield*/, Promise.all(rootNodes.map(function (node) { return visit(node); }))];
case 1:
// Start recursive traversal from root nodes.
_a.sent();
return [2 /*return*/];
}
});
});
};
/**
* Clears the value of a node and the values of dependent nodes
* @param node Node instance.
*/
Graph.prototype.clearNodeAndDependents = function (node) {
return __awaiter(this, void 0, void 0, function () {
var visitAndClear;
var _this = this;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
visitAndClear = function (node) { return __awaiter(_this, void 0, void 0, function () {
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
if (!node.hasData()) return [3 /*break*/, 2];
node.clearData();
return [4 /*yield*/, Promise.all(this.dependentsOf(node).map(function (dependent) { return visitAndClear(dependent); }))];
case 1:
_a.sent();
_a.label = 2;
case 2: return [2 /*return*/];
}
});
}); };
return [4 /*yield*/, visitAndClear(node)];
case 1:
_a.sent();
return [2 /*return*/];
}
});
});
};
/**
* Resets the graph by resetting each node in the graph.
*/
Graph.prototype.reset = function () {
for (var _i = 0, _a = Array.from(this.nodes); _i < _a.length; _i++) {
var node = _a[_i];
node.reset();
}
};
/**
* Prints graph nodes and node dependents.
*/
Graph.prototype.ls = function () {
for (var _i = 0, _a = Array.from(this.nodes); _i < _a.length; _i++) {
var node = _a[_i];
console.log(node.name || 'Unnamed Node');
console.log(this.dependentsOf(node));
}
};
return Graph;
}());
exports.Graph = Graph;
//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZ3JhcGguanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi9zcmMvZ3JhcGgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7O0FBRUE7O0dBRUc7QUFDSDtJQUFBO1FBQ1ksVUFBSyxHQUFjLElBQUksR0FBRyxFQUFFLENBQUM7UUFDN0Isa0JBQWEsR0FBc0IsSUFBSSxHQUFHLEVBQUUsQ0FBQztRQUM3QyxrQkFBYSxHQUFzQixJQUFJLEdBQUcsRUFBRSxDQUFDO0lBbUx6RCxDQUFDO0lBakxHOzs7T0FHRztJQUNLLDBCQUFVLEdBQWxCLFVBQW1CLElBQVU7UUFDekIsSUFBSSxDQUFDLElBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxFQUFFLENBQUM7WUFDeEIsSUFBSSxDQUFDLEtBQUssQ0FBQyxHQUFHLENBQUMsSUFBSSxDQUFDLENBQUM7WUFDckIsSUFBSSxDQUFDLGFBQWEsQ0FBQyxHQUFHLENBQUMsSUFBSSxFQUFFLEVBQUUsQ0FBQyxDQUFDO1lBQ2pDLElBQUksQ0FBQyxhQUFhLENBQUMsR0FBRyxDQUFDLElBQUksRUFBRSxFQUFFLENBQUMsQ0FBQztRQUNyQyxDQUFDO0lBQ0wsQ0FBQztJQUVEOzs7T0FHRztJQUNJLDBCQUFVLEdBQWpCLFVBQWtCLElBQVU7UUFDeEIsSUFBSSxDQUFDLElBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQztZQUFFLE1BQU0sSUFBSSxLQUFLLENBQUMsbUNBQW1DLENBQUMsQ0FBQztRQUNoRixJQUFJLENBQUMsS0FBSyxDQUFDLE1BQU0sQ0FBQyxJQUFJLENBQUMsQ0FBQztRQUN4QixJQUFJLENBQUMsYUFBYSxDQUFDLE1BQU0sQ0FBQyxJQUFJLENBQUMsQ0FBQztRQUNoQyxJQUFJLENBQUMsYUFBYSxDQUFDLE1BQU0sQ0FBQyxJQUFJLENBQUMsQ0FBQztRQUNoQyxLQUF3QixVQUFxQyxFQUFyQyxLQUFBLEtBQUssQ0FBQyxJQUFJLENBQUMsSUFBSSxDQUFDLGFBQWEsQ0FBQyxJQUFJLEVBQUUsQ0FBQyxFQUFyQyxjQUFxQyxFQUFyQyxJQUFxQyxFQUFFLENBQUM7WUFBM0QsSUFBTSxTQUFTLFNBQUE7WUFDaEIsSUFBTSxLQUFLLEdBQUcsSUFBSSxDQUFDLGFBQWEsQ0FBQyxHQUFHLENBQUMsU0FBUyxDQUFFLENBQUM7WUFDakQsSUFBTSxLQUFLLEdBQUcsS0FBSyxDQUFDLE9BQU8sQ0FBQyxJQUFJLENBQUMsQ0FBQztZQUNsQyxJQUFJLEtBQUssS0FBSyxDQUFDLENBQUMsRUFBRSxDQUFDO2dCQUNmLEtBQUssQ0FBQyxNQUFNLENBQUMsS0FBSyxFQUFFLENBQUMsQ0FBQyxDQUFDO1lBQzNCLENBQUM7UUFDTCxDQUFDO1FBQ0QsS0FBeUIsVUFBcUMsRUFBckMsS0FBQSxLQUFLLENBQUMsSUFBSSxDQUFDLElBQUksQ0FBQyxhQUFhLENBQUMsSUFBSSxFQUFFLENBQUMsRUFBckMsY0FBcUMsRUFBckMsSUFBcUMsRUFBRSxDQUFDO1lBQTVELElBQU0sVUFBVSxTQUFBO1lBQ2pCLElBQU0sS0FBSyxHQUFHLElBQUksQ0FBQyxhQUFhLENBQUMsR0FBRyxDQUFDLFVBQVUsQ0FBRSxDQUFDO1lBQ2xELElBQU0sS0FBSyxHQUFHLEtBQUssQ0FBQyxPQUFPLENBQUMsSUFBSSxDQUFDLENBQUM7WUFDbEMsSUFBSSxLQUFLLEtBQUssQ0FBQyxDQUFDLEVBQUUsQ0FBQztnQkFDZixLQUFLLENBQUMsTUFBTSxDQUFDLEtBQUssRUFBRSxDQUFDLENBQUMsQ0FBQztZQUMzQixDQUFDO1FBQ0wsQ0FBQztJQUNMLENBQUM7SUFFRDs7O09BR0c7SUFDSSx1QkFBTyxHQUFkLFVBQWUsSUFBVTtRQUNyQixPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxDQUFDO0lBQ2hDLENBQUM7SUFLRCxzQkFBSSx1QkFBSTtRQUhSOztXQUVHO2FBQ0g7WUFDSSxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsSUFBSSxDQUFDO1FBQzNCLENBQUM7OztPQUFBO0lBRUQ7Ozs7T0FJRztJQUNJLDZCQUFhLEdBQXBCLFVBQXFCLElBQVUsRUFBRSxFQUFRO1FBQ3JDLElBQUksSUFBSSxLQUFLLEVBQUU7WUFBRSxNQUFNLElBQUksS0FBSyxDQUFDLDRCQUE0QixDQUFDLENBQUM7UUFFL0QsSUFBSSxDQUFDLFVBQVUsQ0FBQyxJQUFJLENBQUMsQ0FBQztRQUN0QixJQUFJLENBQUMsVUFBVSxDQUFDLEVBQUUsQ0FBQyxDQUFDO1FBRXBCLElBQU0sUUFBUSxHQUFHLElBQUksQ0FBQyxhQUFhLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBRSxDQUFDO1FBQy9DLElBQUksQ0FBQyxRQUFRLENBQUMsUUFBUSxDQUFDLEVBQUUsQ0FBQyxFQUFFLENBQUM7WUFDekIsUUFBUSxDQUFDLElBQUksQ0FBQyxFQUFFLENBQUMsQ0FBQztRQUN0QixDQUFDO1FBQ0QsSUFBTSxRQUFRLEdBQUcsSUFBSSxDQUFDLGFBQWEsQ0FBQyxHQUFHLENBQUMsRUFBRSxDQUFFLENBQUM7UUFDN0MsSUFBSSxDQUFDLFFBQVEsQ0FBQyxRQUFRLENBQUMsSUFBSSxDQUFDLEVBQUUsQ0FBQztZQUMzQixRQUFRLENBQUMsSUFBSSxDQUFDLElBQUksQ0FBQyxDQUFDO1FBQ3hCLENBQUM7SUFDTCxDQUFDO0lBRUQ7Ozs7O09BS0c7SUFDSSxnQ0FBZ0IsR0FBdkIsVUFBd0IsSUFBVSxFQUFFLEVBQVE7UUFDeEMsSUFBSSxDQUFDLElBQUksQ0FBQyxPQUFPLENBQUMsSUFBSSxDQUFDO1lBQUUsTUFBTSxJQUFJLEtBQUssQ0FBQywrQkFBd0IsSUFBSSxDQUFDLElBQUksQ0FBRSxDQUFDLENBQUM7UUFDOUUsSUFBSSxDQUFDLElBQUksQ0FBQyxPQUFPLENBQUMsRUFBRSxDQUFDLEVBQUUsQ0FBQztZQUNwQixnREFBZ0Q7WUFDaEQsT0FBTztRQUNYLENBQUM7UUFBQSxDQUFDO1FBQ0YsSUFBSSxJQUFJLEtBQUssRUFBRTtZQUFFLE1BQU0sSUFBSSxLQUFLLENBQUMsK0JBQStCLENBQUMsQ0FBQztRQUVsRSxJQUFNLFFBQVEsR0FBRyxJQUFJLENBQUMsYUFBYSxDQUFDLEdBQUcsQ0FBQyxJQUFJLENBQUUsQ0FBQztRQUMvQyxJQUFNLGFBQWEsR0FBRyxRQUFRLENBQUMsT0FBTyxDQUFDLEVBQUUsQ0FBQyxDQUFDO1FBQzNDLElBQUksYUFBYSxLQUFLLENBQUMsQ0FBQyxFQUFFLENBQUM7WUFDdkIsUUFBUSxDQUFDLE1BQU0sQ0FBQyxhQUFhLEVBQUUsQ0FBQyxDQUFDLENBQUM7UUFDdEMsQ0FBQztRQUNELElBQU0sUUFBUSxHQUFHLElBQUksQ0FBQyxhQUFhLENBQUMsR0FBRyxDQUFDLEVBQUUsQ0FBRSxDQUFDO1FBQzdDLElBQU0sYUFBYSxHQUFHLFFBQVEsQ0FBQyxPQUFPLENBQUMsSUFBSSxDQUFDLENBQUM7UUFDN0MsSUFBSSxhQUFhLEtBQUssQ0FBQyxDQUFDLEVBQUUsQ0FBQztZQUN2QixRQUFRLENBQUMsTUFBTSxDQUFDLGFBQWEsRUFBRSxDQUFDLENBQUMsQ0FBQztRQUN0QyxDQUFDO0lBQ0wsQ0FBQztJQUVEOzs7T0FHRztJQUNJLDhCQUFjLEdBQXJCLFVBQXNCLElBQVU7UUFDNUIsT0FBTyxJQUFJLENBQUMsYUFBYSxDQUFDLEdBQUcsQ0FBQyxJQUFJLENBQUMsSUFBSSxFQUFFLENBQUM7SUFDOUMsQ0FBQztJQUVEOzs7T0FHRztJQUNJLDRCQUFZLEdBQW5CLFVBQW9CLElBQVU7UUFDMUIsT0FBTyxJQUFJLENBQUMsYUFBYSxDQUFDLEdBQUcsQ0FBQyxJQUFJLENBQUMsSUFBSSxFQUFFLENBQUM7SUFDOUMsQ0FBQztJQUVEOztPQUVHO0lBQ1Usd0JBQVEsR0FBckI7Ozs7Ozs7d0JBQ0ksbUNBQW1DO3dCQUNuQyxLQUFLLENBQUMsSUFBSSxDQUFDLElBQUksQ0FBQyxLQUFLLENBQUMsQ0FBQyxPQUFPLENBQUMsVUFBQSxJQUFJLElBQUksT0FBQSxJQUFJLENBQUMsVUFBVSxFQUFFLEVBQWpCLENBQWlCLENBQUMsQ0FBQzt3QkFFcEQsS0FBSyxHQUFHLFVBQU8sSUFBVTs7OztvQ0FDM0IsK0JBQStCO29DQUMvQixxQkFBTSxPQUFPLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxjQUFjLENBQUMsSUFBSSxDQUFDLENBQUMsR0FBRyxDQUFDLFVBQUMsVUFBVSxJQUFLLE9BQUEsVUFBVSxDQUFDLElBQUksRUFBRSxFQUFqQixDQUFpQixDQUFDLENBQUMsRUFBQTs7d0NBRG5GLCtCQUErQjt3Q0FDL0IsU0FBbUYsQ0FBQzt3Q0FDcEYsSUFBSSxDQUFDLHVCQUF1QixFQUFFLENBQUM7NkNBQzNCLENBQUEsSUFBSSxDQUFDLFlBQVksQ0FBQyxJQUFJLENBQUMsQ0FBQyxNQUFNLEdBQUcsQ0FBQyxDQUFBLEVBQWxDLHdCQUFrQzt3Q0FDbEMsd0NBQXdDO3dDQUN4QyxxQkFBTSxPQUFPLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxZQUFZLENBQUMsSUFBSSxDQUFDLENBQUMsR0FBRyxDQUFDLFVBQUMsU0FBUyxJQUFLLE9BQUEsS0FBSyxDQUFDLFNBQVMsQ0FBQyxFQUFoQixDQUFnQixDQUFDLENBQUMsRUFBQTs7d0NBRC9FLHdDQUF3Qzt3Q0FDeEMsU0FBK0UsQ0FBQzs7O29DQUVoRix1Q0FBdUM7b0NBQ3ZDLHFCQUFNLElBQUksQ0FBQyxJQUFJLEVBQUUsRUFBQTs7d0NBRGpCLHVDQUF1Qzt3Q0FDdkMsU0FBaUIsQ0FBQzs7Ozs7NkJBRXpCLENBQUM7d0JBR0ksU0FBUyxHQUFHLEtBQUssQ0FBQyxJQUFJLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxDQUFDLE1BQU0sQ0FBQyxVQUFDLElBQUksSUFBSyxPQUFBLEtBQUksQ0FBQyxjQUFjLENBQUMsSUFBSSxDQUFDLENBQUMsTUFBTSxLQUFLLENBQUMsRUFBdEMsQ0FBc0MsQ0FBQyxDQUFDO3dCQUNsRyxJQUFJLFNBQVMsQ0FBQyxNQUFNLEtBQUssQ0FBQyxJQUFJLElBQUksQ0FBQyxLQUFLLENBQUMsSUFBSSxHQUFHLENBQUMsRUFBRSxDQUFDOzRCQUNoRCxNQUFNLElBQUksS0FBSyxDQUFDLG1FQUFtRSxDQUFDLENBQUM7d0JBQ3pGLENBQUM7d0JBRUQsNkNBQTZDO3dCQUM3QyxxQkFBTSxPQUFPLENBQUMsR0FBRyxDQUFDLFNBQVMsQ0FBQyxHQUFHLENBQUMsVUFBQyxJQUFJLElBQUssT0FBQSxLQUFLLENBQUMsSUFBSSxDQUFDLEVBQVgsQ0FBVyxDQUFDLENBQUMsRUFBQTs7d0JBRHZELDZDQUE2Qzt3QkFDN0MsU0FBdUQsQ0FBQzs7Ozs7S0FDM0Q7SUFFRDs7O09BR0c7SUFDVSxzQ0FBc0IsR0FBbkMsVUFBb0MsSUFBVTs7Ozs7Ozt3QkFDcEMsYUFBYSxHQUFHLFVBQU8sSUFBVTs7Ozs2Q0FDL0IsSUFBSSxDQUFDLE9BQU8sRUFBRSxFQUFkLHdCQUFjO3dDQUNkLElBQUksQ0FBQyxTQUFTLEVBQUUsQ0FBQzt3Q0FDakIscUJBQU0sT0FBTyxDQUFDLEdBQUcsQ0FBQyxJQUFJLENBQUMsWUFBWSxDQUFDLElBQUksQ0FBQyxDQUFDLEdBQUcsQ0FBQyxVQUFBLFNBQVMsSUFBSSxPQUFBLGFBQWEsQ0FBQyxTQUFTLENBQUMsRUFBeEIsQ0FBd0IsQ0FBQyxDQUFDLEVBQUE7O3dDQUFyRixTQUFxRixDQUFDOzs7Ozs2QkFFN0YsQ0FBQzt3QkFDRixxQkFBTSxhQUFhLENBQUMsSUFBSSxDQUFDLEVBQUE7O3dCQUF6QixTQUF5QixDQUFDOzs7OztLQUM3QjtJQUVEOztPQUVHO0lBQ0kscUJBQUssR0FBWjtRQUNJLEtBQW1CLFVBQXNCLEVBQXRCLEtBQUEsS0FBSyxDQUFDLElBQUksQ0FBQyxJQUFJLENBQUMsS0FBSyxDQUFDLEVBQXRCLGNBQXNCLEVBQXRCLElBQXNCLEVBQUUsQ0FBQztZQUF2QyxJQUFNLElBQUksU0FBQTtZQUNYLElBQUksQ0FBQyxLQUFLLEVBQUUsQ0FBQztRQUNqQixDQUFDO0lBQ0wsQ0FBQztJQUVEOztPQUVHO0lBQ0ksa0JBQUUsR0FBVDtRQUNJLEtBQW1CLFVBQXNCLEVBQXRCLEtBQUEsS0FBSyxDQUFDLElBQUksQ0FBQyxJQUFJLENBQUMsS0FBSyxDQUFDLEVBQXRCLGNBQXNCLEVBQXRCLElBQXNCLEVBQUUsQ0FBQztZQUF2QyxJQUFNLElBQUksU0FBQTtZQUNYLE9BQU8sQ0FBQyxHQUFHLENBQUMsSUFBSSxDQUFDLElBQUksSUFBSSxjQUFjLENBQUMsQ0FBQztZQUN6QyxPQUFPLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxZQUFZLENBQUMsSUFBSSxDQUFDLENBQUMsQ0FBQztRQUN6QyxDQUFDO0lBQ0wsQ0FBQztJQUNMLFlBQUM7QUFBRCxDQUFDLEFBdExELElBc0xDO0FBdExZLHNCQUFLIn0=