@icure/api 6.4.0 → 7.0.0-beta.0

package/dist/icc-x-api/utils/graph-utils.js

@@ -0,0 +1,203 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.acyclic = exports.reachSetsAcyclic = exports.graphFromEdges = void 0;
+/**
+ * @internal
+ * Creates a graph from a series of edges and optionally additional nodes.
+ * @param edges edges between nodes, [from, to].
+ * @param additionalNodes nodes which do not appear in any edge.
+ * @return a graph built using the provided parameters.
+ */
+function graphFromEdges(edges, additionalNodes) {
+    const nodes = edges.reduce((acc, [edgeFrom, edgeTo]) => {
+        acc.add(edgeFrom);
+        acc.add(edgeTo);
+        return acc;
+    }, new Set(additionalNodes !== null && additionalNodes !== void 0 ? additionalNodes : []));
+    const res = Array.from(nodes).reduce((res, node) => {
+        res[node] = new Set();
+        return res;
+    }, {});
+    edges.forEach(([edgeFrom, edgeTo]) => {
+        if (edgeFrom != edgeTo) {
+            res[edgeFrom].add(edgeTo);
+        }
+    });
+    return res;
+}
+exports.graphFromEdges = graphFromEdges;
+/**
+ * @internal
+ * Get the nodes reachable from each node in an acyclic graph. Exclude the node itself.
+ * @param graph an acyclic graph.
+ * @return all nodes reachable from each node in the graph with 1 or more steps.
+ */
+function reachSetsAcyclic(graph) {
+    const res = {};
+    function calculateAndCacheReachSetRecursive(node) {
+        if (res[node])
+            return res[node];
+        const set = new Set(Array.from(graph[node]));
+        graph[node].forEach((child) => {
+            calculateAndCacheReachSetRecursive(child).forEach((x) => set.add(x));
+        });
+        res[node] = set;
+        return set;
+    }
+    Object.keys(graph).forEach((n) => calculateAndCacheReachSetRecursive(n));
+    return res;
+}
+exports.reachSetsAcyclic = reachSetsAcyclic;
+/**
+ * @internal
+ * Get a new graph where each cycle has been replaced by a single node, with label chosen from the labels of nodes in the cycle (the specific way
+ * the label is chosen is implementation-dependant).
+ * @param graph a graph.
+ * @return the new graph and dictionaries to allow mapping between original labels and labels in the new graph
+ */
+function acyclic(graph) {
+    const idToName = Object.keys(graph);
+    const nameToId = {};
+    idToName.forEach((name, id) => {
+        nameToId[name] = id;
+    });
+    const ogAdjacency = idToName.map((name) => {
+        return Array.from(graph[name]).map((adjacencyName) => nameToId[adjacencyName]);
+    });
+    const { components, adjacencyList } = stronglyConnectedComponents(ogAdjacency);
+    const namedGroups = components.map((group) => group.map((id) => idToName[id]));
+    const originalLabelToAcyclicLabel = {};
+    namedGroups.forEach((group) => {
+        group.forEach((element) => {
+            originalLabelToAcyclicLabel[element] = group[0];
+        });
+    });
+    const acyclicLabelToGroup = {};
+    namedGroups.forEach((group) => {
+        acyclicLabelToGroup[group[0]] = group;
+    });
+    const remappedIdToName = components.map((group) => idToName[group[0]]);
+    const res = {};
+    adjacencyList.forEach((adjacencyList, index) => {
+        res[remappedIdToName[index]] = new Set(adjacencyList.filter((x) => x !== index).map((x) => remappedIdToName[x]));
+    });
+    return { acyclicGraph: res, originalLabelToAcyclicLabel, acyclicLabelToGroup };
+}
+exports.acyclic = acyclic;
+// Implementation from https://github.com/mikolalysenko/strongly-connected-components
+function stronglyConnectedComponents(adjList) {
+    const numVertices = adjList.length;
+    const index = new Array(numVertices);
+    const lowValue = new Array(numVertices);
+    const active = new Array(numVertices);
+    const child = new Array(numVertices);
+    const scc = new Array(numVertices);
+    const sccLinks = new Array(numVertices);
+    //Initialize tables
+    for (let i = 0; i < numVertices; ++i) {
+        index[i] = -1;
+        lowValue[i] = 0;
+        active[i] = false;
+        child[i] = 0;
+        scc[i] = -1;
+        sccLinks[i] = [];
+    }
+    // The strongConnect function
+    let count = 0;
+    const components = [];
+    const sccAdjList = [];
+    function strongConnect(v) {
+        // To avoid running out of stack space, this emulates the recursive behaviour of the normal algorithm, effectively using T as the call stack.
+        const S = [v], T = [v];
+        index[v] = lowValue[v] = count;
+        active[v] = true;
+        count += 1;
+        while (T.length > 0) {
+            v = T[T.length - 1];
+            const e = adjList[v];
+            if (child[v] < e.length) {
+                // If we're not done iterating over the children, first try finishing that.
+                let i;
+                for (i = child[v]; i < e.length; ++i) {
+                    // Start where we left off.
+                    const u = e[i];
+                    if (index[u] < 0) {
+                        index[u] = lowValue[u] = count;
+                        active[u] = true;
+                        count += 1;
+                        S.push(u);
+                        T.push(u);
+                        break; // First recurse, then continue here (with the same child!).
+                        // There is a slight change to Tarjan's algorithm here.
+                        // Normally, after having recursed, we set lowValue like we do for an active child (although some variants of the algorithm do it slightly differently).
+                        // Here, we only do so if the child we recursed on is still active.
+                        // The reasoning is that if it is no longer active, it must have had a lowValue equal to its own index, which means that it is necessarily higher than our lowValue.
+                    }
+                    else if (active[u]) {
+                        lowValue[v] = Math.min(lowValue[v], lowValue[u]) | 0;
+                    }
+                    if (scc[u] >= 0) {
+                        // Node v is not yet assigned an scc, but once it is that scc can apparently reach scc[u].
+                        sccLinks[v].push(scc[u]);
+                    }
+                }
+                child[v] = i; // Remember where we left off.
+            }
+            else {
+                // If we're done iterating over the children, check whether we have an scc.
+                if (lowValue[v] === index[v]) {
+                    // NOTTODO: It /might/ be true that T is always a prefix of S (at this point!!!), and if so, this could be used here.
+                    const component = [];
+                    const links = [];
+                    let linkCount = 0;
+                    for (let i = S.length - 1; i >= 0; --i) {
+                        const w = S[i];
+                        active[w] = false;
+                        component.push(w);
+                        links.push(sccLinks[w]);
+                        linkCount += sccLinks[w].length;
+                        scc[w] = components.length;
+                        if (w === v) {
+                            S.length = i;
+                            break;
+                        }
+                    }
+                    components.push(component);
+                    const allLinks = new Array(linkCount);
+                    for (let i = 0; i < links.length; i++) {
+                        for (let j = 0; j < links[i].length; j++) {
+                            allLinks[--linkCount] = links[i][j];
+                        }
+                    }
+                    sccAdjList.push(allLinks);
+                }
+                T.pop(); // Now we're finished exploring this particular node (normally corresponds to the return statement)
+            }
+        }
+    }
+    //Run strong connect starting from each vertex
+    for (let i = 0; i < numVertices; ++i) {
+        if (index[i] < 0) {
+            strongConnect(i);
+        }
+    }
+    // Compact sccAdjList
+    let newE;
+    for (let i = 0; i < sccAdjList.length; i++) {
+        const e = sccAdjList[i];
+        if (e.length === 0)
+            continue;
+        e.sort(function (a, b) {
+            return a - b;
+        });
+        newE = [e[0]];
+        for (let j = 1; j < e.length; j++) {
+            if (e[j] !== e[j - 1]) {
+                newE.push(e[j]);
+            }
+        }
+        sccAdjList[i] = newE;
+    }
+    return { components: components, adjacencyList: sccAdjList };
+}
+//# sourceMappingURL=graph-utils.js.map

package/dist/icc-x-api/utils/graph-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-utils.js","sourceRoot":"","sources":["../../../icc-x-api/utils/graph-utils.ts"],"names":[],"mappings":";;;AAgBA;;;;;;GAMG;AACH,SAAgB,cAAc,CAAC,KAAyB,EAAE,eAA0B;IAClF,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAc,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE;QAClE,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QACjB,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACf,OAAO,GAAG,CAAA;IACZ,CAAC,EAAE,IAAI,GAAG,CAAC,eAAe,aAAf,eAAe,cAAf,eAAe,GAAI,EAAE,CAAC,CAAC,CAAA;IAClC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAQ,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE;QACxD,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,GAAG,EAAU,CAAA;QAC7B,OAAO,GAAG,CAAA;IACZ,CAAC,EAAE,EAAE,CAAC,CAAA;IACN,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,MAAM,CAAC,EAAE,EAAE;QACnC,IAAI,QAAQ,IAAI,MAAM,EAAE;YACtB,GAAG,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;SAC1B;IACH,CAAC,CAAC,CAAA;IACF,OAAO,GAAG,CAAA;AACZ,CAAC;AAhBD,wCAgBC;AAED;;;;;GAKG;AACH,SAAgB,gBAAgB,CAAC,KAAY;IAC3C,MAAM,GAAG,GAAoC,EAAE,CAAA;IAC/C,SAAS,kCAAkC,CAAC,IAAY;QACtD,IAAI,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO,GAAG,CAAC,IAAI,CAAC,CAAA;QAC/B,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC5C,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YAC5B,kCAAkC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACtE,CAAC,CAAC,CAAA;QACF,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAA;QACf,OAAO,GAAG,CAAA;IACZ,CAAC;IACD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kCAAkC,CAAC,CAAC,CAAC,CAAC,CAAA;IACxE,OAAO,GAAG,CAAA;AACZ,CAAC;AAbD,4CAaC;AAED;;;;;;GAMG;AACH,SAAgB,OAAO,CAAC,KAAY;IAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACnC,MAAM,QAAQ,GAA+B,EAAE,CAAA;IAC/C,QAAQ,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,EAAE;QAC5B,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,CAAA;IACrB,CAAC,CAAC,CAAA;IACF,MAAM,WAAW,GAAe,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACpD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,EAAE,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAA;IAChF,CAAC,CAAC,CAAA;IACF,MAAM,EAAE,UAAU,EAAE,aAAa,EAAE,GAAG,2BAA2B,CAAC,WAAW,CAAC,CAAA;IAC9E,MAAM,WAAW,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAC9E,MAAM,2BAA2B,GAAwC,EAAE,CAAA;IAC3E,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC5B,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YACxB,2BAA2B,CAAC,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAA;QACjD,CAAC,CAAC,CAAA;IACJ,CAAC,CAAC,CAAA;IACF,MAAM,mBAAmB,GAAqC,EAAE,CAAA;IAChE,WAAW,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC5B,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;IACvC,CAAC,CAAC,CAAA;IACF,MAAM,gBAAgB,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACtE,MAAM,GAAG,GAAU,EAAE,CAAA;IACrB,aAAa,CAAC,OAAO,CAAC,CAAC,aAAa,EAAE,KAAK,EAAE,EAAE;QAC7C,GAAG,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAClH,CAAC,CAAC,CAAA;IACF,OAAO,EAAE,YAAY,EAAE,GAAG,EAAE,2BAA2B,EAAE,mBAAmB,EAAE,CAAA;AAChF,CAAC;AA3BD,0BA2BC;AAED,qFAAqF;AACrF,SAAS,2BAA2B,CAAC,OAAmB;IACtD,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAA;IAClC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAA;IACpC,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAA;IACvC,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAA;IACrC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAA;IACpC,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAA;IAClC,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,WAAW,CAAC,CAAA;IAEvC,mBAAmB;IACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,EAAE,CAAC,EAAE;QACpC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACb,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACf,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;QACjB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;QACZ,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QACX,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAA;KACjB;IAED,6BAA6B;IAC7B,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,MAAM,UAAU,GAAe,EAAE,CAAA;IACjC,MAAM,UAAU,GAAe,EAAE,CAAA;IAEjC,SAAS,aAAa,CAAC,CAAS;QAC9B,6IAA6I;QAC7I,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EACX,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACT,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;QAC9B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;QAChB,KAAK,IAAI,CAAC,CAAA;QACV,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;YACnB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YACnB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;YACpB,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE;gBACvB,2EAA2E;gBAC3E,IAAI,CAAC,CAAA;gBACL,KAAK,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;oBACpC,2BAA2B;oBAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;oBACd,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;wBAChB,KAAK,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;wBAC9B,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;wBAChB,KAAK,IAAI,CAAC,CAAA;wBACV,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;wBACT,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;wBACT,MAAK,CAAC,4DAA4D;wBAClE,uDAAuD;wBACvD,wJAAwJ;wBACxJ,mEAAmE;wBACnE,oKAAoK;qBACrK;yBAAM,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE;wBACpB,QAAQ,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA;qBACrD;oBACD,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE;wBACf,0FAA0F;wBAC1F,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;qBACzB;iBACF;gBACD,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,8BAA8B;aAC5C;iBAAM;gBACL,2EAA2E;gBAC3E,IAAI,QAAQ,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE;oBAC5B,qHAAqH;oBACrH,MAAM,SAAS,GAAG,EAAE,CAAA;oBACpB,MAAM,KAAK,GAAG,EAAE,CAAA;oBAChB,IAAI,SAAS,GAAG,CAAC,CAAA;oBACjB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;wBACtC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;wBACd,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;wBACjB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;wBACjB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAA;wBACvB,SAAS,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAA;wBAC/B,GAAG,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,MAAM,CAAA;wBAC1B,IAAI,CAAC,KAAK,CAAC,EAAE;4BACX,CAAC,CAAC,MAAM,GAAG,CAAC,CAAA;4BACZ,MAAK;yBACN;qBACF;oBACD,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;oBAC1B,MAAM,QAAQ,GAAG,IAAI,KAAK,CAAC,SAAS,CAAC,CAAA;oBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;wBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;4BACxC,QAAQ,CAAC,EAAE,SAAS,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;yBACpC;qBACF;oBACD,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAA;iBAC1B;gBACD,CAAC,CAAC,GAAG,EAAE,CAAA,CAAC,mGAAmG;aAC5G;SACF;IACH,CAAC;IAED,8CAA8C;IAC9C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,EAAE,CAAC,EAAE;QACpC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE;YAChB,aAAa,CAAC,CAAC,CAAC,CAAA;SACjB;KACF;IAED,qBAAqB;IACrB,IAAI,IAAI,CAAA;IACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAC1C,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAA;QACvB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAC5B,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,CAAA;QACd,CAAC,CAAC,CAAA;QACF,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACjC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE;gBACrB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;aAChB;SACF;QACD,UAAU,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;KACrB;IAED,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,aAAa,EAAE,UAAU,EAAE,CAAA;AAC9D,CAAC","sourcesContent":["/**\n * @internal\n * Represents a graph. Each node is associated to a set of nodes that can be directly reached from it in a single step.\n */\nexport type Graph = { [node: string]: Set<string> }\n\n/**\n * @internal\n * Represents from which all cycles have been removed using strongly connected components. Also holds information on all groups.\n */\nexport type StronglyConnectedGraph = {\n  acyclicGraph: Graph\n  originalLabelToAcyclicLabel: { [originalLabel: string]: string }\n  acyclicLabelToGroup: { [newLabel: string]: string[] } // includes new label.\n}\n\n/**\n * @internal\n * Creates a graph from a series of edges and optionally additional nodes.\n * @param edges edges between nodes, [from, to].\n * @param additionalNodes nodes which do not appear in any edge.\n * @return a graph built using the provided parameters.\n */\nexport function graphFromEdges(edges: [string, string][], additionalNodes?: string[]): Graph {\n  const nodes = edges.reduce<Set<string>>((acc, [edgeFrom, edgeTo]) => {\n    acc.add(edgeFrom)\n    acc.add(edgeTo)\n    return acc\n  }, new Set(additionalNodes ?? []))\n  const res = Array.from(nodes).reduce<Graph>((res, node) => {\n    res[node] = new Set<string>()\n    return res\n  }, {})\n  edges.forEach(([edgeFrom, edgeTo]) => {\n    if (edgeFrom != edgeTo) {\n      res[edgeFrom].add(edgeTo)\n    }\n  })\n  return res\n}\n\n/**\n * @internal\n * Get the nodes reachable from each node in an acyclic graph. Exclude the node itself.\n * @param graph an acyclic graph.\n * @return all nodes reachable from each node in the graph with 1 or more steps.\n */\nexport function reachSetsAcyclic(graph: Graph): { [node: string]: Set<string> } {\n  const res: { [node: string]: Set<string> } = {}\n  function calculateAndCacheReachSetRecursive(node: string): Set<string> {\n    if (res[node]) return res[node]\n    const set = new Set(Array.from(graph[node]))\n    graph[node].forEach((child) => {\n      calculateAndCacheReachSetRecursive(child).forEach((x) => set.add(x))\n    })\n    res[node] = set\n    return set\n  }\n  Object.keys(graph).forEach((n) => calculateAndCacheReachSetRecursive(n))\n  return res\n}\n\n/**\n * @internal\n * Get a new graph where each cycle has been replaced by a single node, with label chosen from the labels of nodes in the cycle (the specific way\n * the label is chosen is implementation-dependant).\n * @param graph a graph.\n * @return the new graph and dictionaries to allow mapping between original labels and labels in the new graph\n */\nexport function acyclic(graph: Graph): StronglyConnectedGraph {\n  const idToName = Object.keys(graph)\n  const nameToId: { [name: string]: number } = {}\n  idToName.forEach((name, id) => {\n    nameToId[name] = id\n  })\n  const ogAdjacency: number[][] = idToName.map((name) => {\n    return Array.from(graph[name]).map((adjacencyName) => nameToId[adjacencyName])\n  })\n  const { components, adjacencyList } = stronglyConnectedComponents(ogAdjacency)\n  const namedGroups = components.map((group) => group.map((id) => idToName[id]))\n  const originalLabelToAcyclicLabel: { [originalLabel: string]: string } = {}\n  namedGroups.forEach((group) => {\n    group.forEach((element) => {\n      originalLabelToAcyclicLabel[element] = group[0]\n    })\n  })\n  const acyclicLabelToGroup: { [newLabel: string]: string[] } = {}\n  namedGroups.forEach((group) => {\n    acyclicLabelToGroup[group[0]] = group\n  })\n  const remappedIdToName = components.map((group) => idToName[group[0]])\n  const res: Graph = {}\n  adjacencyList.forEach((adjacencyList, index) => {\n    res[remappedIdToName[index]] = new Set(adjacencyList.filter((x) => x !== index).map((x) => remappedIdToName[x]))\n  })\n  return { acyclicGraph: res, originalLabelToAcyclicLabel, acyclicLabelToGroup }\n}\n\n// Implementation from https://github.com/mikolalysenko/strongly-connected-components\nfunction stronglyConnectedComponents(adjList: number[][]): { components: number[][]; adjacencyList: number[][] } {\n  const numVertices = adjList.length\n  const index = new Array(numVertices)\n  const lowValue = new Array(numVertices)\n  const active = new Array(numVertices)\n  const child = new Array(numVertices)\n  const scc = new Array(numVertices)\n  const sccLinks = new Array(numVertices)\n\n  //Initialize tables\n  for (let i = 0; i < numVertices; ++i) {\n    index[i] = -1\n    lowValue[i] = 0\n    active[i] = false\n    child[i] = 0\n    scc[i] = -1\n    sccLinks[i] = []\n  }\n\n  // The strongConnect function\n  let count = 0\n  const components: number[][] = []\n  const sccAdjList: number[][] = []\n\n  function strongConnect(v: number) {\n    // To avoid running out of stack space, this emulates the recursive behaviour of the normal algorithm, effectively using T as the call stack.\n    const S = [v],\n      T = [v]\n    index[v] = lowValue[v] = count\n    active[v] = true\n    count += 1\n    while (T.length > 0) {\n      v = T[T.length - 1]\n      const e = adjList[v]\n      if (child[v] < e.length) {\n        // If we're not done iterating over the children, first try finishing that.\n        let i\n        for (i = child[v]; i < e.length; ++i) {\n          // Start where we left off.\n          const u = e[i]\n          if (index[u] < 0) {\n            index[u] = lowValue[u] = count\n            active[u] = true\n            count += 1\n            S.push(u)\n            T.push(u)\n            break // First recurse, then continue here (with the same child!).\n            // There is a slight change to Tarjan's algorithm here.\n            // Normally, after having recursed, we set lowValue like we do for an active child (although some variants of the algorithm do it slightly differently).\n            // Here, we only do so if the child we recursed on is still active.\n            // The reasoning is that if it is no longer active, it must have had a lowValue equal to its own index, which means that it is necessarily higher than our lowValue.\n          } else if (active[u]) {\n            lowValue[v] = Math.min(lowValue[v], lowValue[u]) | 0\n          }\n          if (scc[u] >= 0) {\n            // Node v is not yet assigned an scc, but once it is that scc can apparently reach scc[u].\n            sccLinks[v].push(scc[u])\n          }\n        }\n        child[v] = i // Remember where we left off.\n      } else {\n        // If we're done iterating over the children, check whether we have an scc.\n        if (lowValue[v] === index[v]) {\n          // NOTTODO: It /might/ be true that T is always a prefix of S (at this point!!!), and if so, this could be used here.\n          const component = []\n          const links = []\n          let linkCount = 0\n          for (let i = S.length - 1; i >= 0; --i) {\n            const w = S[i]\n            active[w] = false\n            component.push(w)\n            links.push(sccLinks[w])\n            linkCount += sccLinks[w].length\n            scc[w] = components.length\n            if (w === v) {\n              S.length = i\n              break\n            }\n          }\n          components.push(component)\n          const allLinks = new Array(linkCount)\n          for (let i = 0; i < links.length; i++) {\n            for (let j = 0; j < links[i].length; j++) {\n              allLinks[--linkCount] = links[i][j]\n            }\n          }\n          sccAdjList.push(allLinks)\n        }\n        T.pop() // Now we're finished exploring this particular node (normally corresponds to the return statement)\n      }\n    }\n  }\n\n  //Run strong connect starting from each vertex\n  for (let i = 0; i < numVertices; ++i) {\n    if (index[i] < 0) {\n      strongConnect(i)\n    }\n  }\n\n  // Compact sccAdjList\n  let newE\n  for (let i = 0; i < sccAdjList.length; i++) {\n    const e = sccAdjList[i]\n    if (e.length === 0) continue\n    e.sort(function (a, b) {\n      return a - b\n    })\n    newE = [e[0]]\n    for (let j = 1; j < e.length; j++) {\n      if (e[j] !== e[j - 1]) {\n        newE.push(e[j])\n      }\n    }\n    sccAdjList[i] = newE\n  }\n\n  return { components: components, adjacencyList: sccAdjList }\n}\n"]}

package/dist/icc-x-api/utils/lru-temporised-async-cache.d.ts

@@ -0,0 +1,27 @@
+export declare class LruTemporisedAsyncCache<K, V> {
+    private readonly maxCacheSize;
+    private readonly lifetimeForValue;
+    private readonly nodesMap;
+    private firstNode;
+    private lastNode;
+    /**
+     * @param maxCacheSize Maximum size of the cache. Any value <= 0 is considered as no limit.
+     * @param lifetimeForValue Get the maximum lifetime for an entry given its value.
+     */
+    constructor(maxCacheSize: number, lifetimeForValue: (value: V) => number);
+    /**
+     * Gets a cached value or retrieves it and caches it if the value is not available or if it is available but expired. A value will never be expired
+     * if it was not yet retrieved, even if the retrieved value would be expired according to the {@link additionalExpirationCondition}
+     * @param key key of the entry
+     * @param retrieve given the previous value (if available, expired but not yet removed) of the entry retrieves an updated value.
+     * @param additionalExpirationCondition an expiration condition for already cached values to consider in addition to time-based expiration. Returns
+     * always false by default, meaning the value is not expired if its lifetime didn't already surpass the maximum lifetime.
+     * @return the cached value if present and not expired, else the retrieved value.
+     */
+    get(key: K, retrieve: (previousValue: V | undefined) => Promise<V>, additionalExpirationCondition?: (value: V) => boolean): Promise<V>;
+    clear(): void;
+    private addToTail;
+    private evict;
+    private markUsed;
+    private registerJob;
+}

package/dist/icc-x-api/utils/lru-temporised-async-cache.js

@@ -0,0 +1,120 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LruTemporisedAsyncCache = void 0;
+class LruTemporisedAsyncCache {
+    /**
+     * @param maxCacheSize Maximum size of the cache. Any value <= 0 is considered as no limit.
+     * @param lifetimeForValue Get the maximum lifetime for an entry given its value.
+     */
+    constructor(maxCacheSize, lifetimeForValue) {
+        this.nodesMap = new Map();
+        this.firstNode = null;
+        this.lastNode = null;
+        this.maxCacheSize = maxCacheSize;
+        this.lifetimeForValue = lifetimeForValue;
+    }
+    /**
+     * Gets a cached value or retrieves it and caches it if the value is not available or if it is available but expired. A value will never be expired
+     * if it was not yet retrieved, even if the retrieved value would be expired according to the {@link additionalExpirationCondition}
+     * @param key key of the entry
+     * @param retrieve given the previous value (if available, expired but not yet removed) of the entry retrieves an updated value.
+     * @param additionalExpirationCondition an expiration condition for already cached values to consider in addition to time-based expiration. Returns
+     * always false by default, meaning the value is not expired if its lifetime didn't already surpass the maximum lifetime.
+     * @return the cached value if present and not expired, else the retrieved value.
+     */
+    get(key, retrieve, additionalExpirationCondition = () => false) {
+        const retrieved = this.nodesMap.get(key);
+        if (retrieved !== undefined) {
+            this.markUsed(retrieved);
+            const cachedValue = retrieved.cachedValue;
+            if (retrieved.expired((x) => this.lifetimeForValue(x)) || (cachedValue !== undefined && additionalExpirationCondition(cachedValue))) {
+                retrieved.value = this.registerJob(key, () => retrieve(cachedValue));
+            }
+            return retrieved.valuePromise();
+        }
+        else {
+            const newNode = new CacheNode(key, this.lastNode, null, this.registerJob(key, () => retrieve(undefined)));
+            this.addToTail(key, newNode);
+            if (this.maxCacheSize > 0 && this.nodesMap.size > this.maxCacheSize)
+                this.evict(this.firstNode.key, this.firstNode);
+            return newNode.valuePromise();
+        }
+    }
+    clear() {
+        this.firstNode = null;
+        this.lastNode = null;
+        this.nodesMap.clear();
+    }
+    addToTail(key, node) {
+        node.previous = this.lastNode;
+        node.next = null;
+        if (this.lastNode)
+            this.lastNode.next = node;
+        this.lastNode = node;
+        if (this.firstNode === null)
+            this.firstNode = node;
+        if (key != null)
+            this.nodesMap.set(key, node);
+    }
+    evict(key, node) {
+        if (node.previous)
+            node.previous.next = node.next;
+        if (node.next)
+            node.next.previous = node.previous;
+        if (this.firstNode === node)
+            this.firstNode = node.next;
+        if (this.lastNode === node)
+            this.lastNode = node.previous;
+        if (key !== null)
+            this.nodesMap.delete(key);
+    }
+    markUsed(node) {
+        if (node !== this.lastNode) {
+            // No need to modify the nodes map
+            this.evict(null, node);
+            this.addToTail(null, node);
+        }
+    }
+    registerJob(key, retrieve) {
+        // The node may have already been evicted by the time the promise completed if the cached surpassed the maximum size.
+        return retrieve()
+            .then((v) => {
+            const node = this.nodesMap.get(key);
+            if (node) {
+                node.value = { cached: v, timestamp: Date.now() };
+            }
+            return v;
+        })
+            .catch((e) => {
+            const node = this.nodesMap.get(key);
+            if (node) {
+                this.evict(key, node);
+            }
+            throw e;
+        });
+    }
+}
+exports.LruTemporisedAsyncCache = LruTemporisedAsyncCache;
+class CacheNode {
+    constructor(key, previous, next, value) {
+        this.key = key;
+        this.previous = previous;
+        this.next = next;
+        this.value = value;
+    }
+    expired(lifetimeForValue) {
+        if ('timestamp' in this.value) {
+            const maxLifetime = lifetimeForValue(this.value.cached);
+            return maxLifetime > 0 && Date.now() - this.value.timestamp > maxLifetime;
+        }
+        else
+            return false;
+    }
+    valuePromise() {
+        return 'timestamp' in this.value ? Promise.resolve(this.value.cached) : this.value;
+    }
+    get cachedValue() {
+        return 'timestamp' in this.value ? this.value.cached : undefined;
+    }
+}
+//# sourceMappingURL=lru-temporised-async-cache.js.map

package/dist/icc-x-api/utils/lru-temporised-async-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lru-temporised-async-cache.js","sourceRoot":"","sources":["../../../icc-x-api/utils/lru-temporised-async-cache.ts"],"names":[],"mappings":";;;AAAA,MAAa,uBAAuB;IAQlC;;;OAGG;IACH,YAAY,YAAoB,EAAE,gBAAsC;QARvD,aAAQ,GAA4B,IAAI,GAAG,EAAE,CAAA;QACtD,cAAS,GAA2B,IAAI,CAAA;QACxC,aAAQ,GAA2B,IAAI,CAAA;QAO7C,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;QAChC,IAAI,CAAC,gBAAgB,GAAG,gBAAgB,CAAA;IAC1C,CAAC;IAED;;;;;;;;OAQG;IACH,GAAG,CACD,GAAM,EACN,QAAsD,EACtD,gCAAuD,GAAG,EAAE,CAAC,KAAK;QAElE,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;QACxC,IAAI,SAAS,KAAK,SAAS,EAAE;YAC3B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAA;YACxB,MAAM,WAAW,GAAG,SAAS,CAAC,WAAW,CAAA;YACzC,IAAI,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,6BAA6B,CAAC,WAAW,CAAC,CAAC,EAAE;gBACnI,SAAS,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAA;aACrE;YACD,OAAO,SAAS,CAAC,YAAY,EAAE,CAAA;SAChC;aAAM;YACL,MAAM,OAAO,GAAG,IAAI,SAAS,CAC3B,GAAG,EACH,IAAI,CAAC,QAAQ,EACb,IAAI,EACJ,IAAI,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,EAAE,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CACjD,CAAA;YACD,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,OAAO,CAAC,CAAA;YAC5B,IAAI,IAAI,CAAC,YAAY,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,YAAY;gBAAE,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAU,CAAC,GAAG,EAAE,IAAI,CAAC,SAAU,CAAC,CAAA;YACrH,OAAO,OAAO,CAAC,YAAY,EAAE,CAAA;SAC9B;IACH,CAAC;IAED,KAAK;QACH,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;QACrB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;QACpB,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAA;IACvB,CAAC;IAEO,SAAS,CAAC,GAAa,EAAE,IAAqB;QACpD,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAA;QAC5C,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;QACpB,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI;YAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;QAClD,IAAI,GAAG,IAAI,IAAI;YAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;IAC/C,CAAC;IAEO,KAAK,CAAC,GAAa,EAAE,IAAqB;QAChD,IAAI,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACjD,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QACjD,IAAI,IAAI,CAAC,SAAS,KAAK,IAAI;YAAE,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAA;QACvD,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI;YAAE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QACzD,IAAI,GAAG,KAAK,IAAI;YAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAA;IAC7C,CAAC;IAEO,QAAQ,CAAC,IAAqB;QACpC,IAAI,IAAI,KAAK,IAAI,CAAC,QAAQ,EAAE;YAC1B,kCAAkC;YAClC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACtB,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;SAC3B;IACH,CAAC;IAEO,WAAW,CAAC,GAAM,EAAE,QAA0B;QACpD,qHAAqH;QACrH,OAAO,QAAQ,EAAE;aACd,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;YACV,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACnC,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,KAAK,GAAG,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAA;aAClD;YACD,OAAO,CAAC,CAAA;QACV,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE;YACX,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;YACnC,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;aACtB;YACD,MAAM,CAAC,CAAA;QACT,CAAC,CAAC,CAAA;IACN,CAAC;CACF;AArGD,0DAqGC;AAID,MAAM,SAAS;IAMb,YAAY,GAAM,EAAE,QAAgC,EAAE,IAA4B,EAAE,KAAiB;QACnG,IAAI,CAAC,GAAG,GAAG,GAAG,CAAA;QACd,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,CAAC;IAED,OAAO,CAAC,gBAAsC;QAC5C,IAAI,WAAW,IAAI,IAAI,CAAC,KAAK,EAAE;YAC7B,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;YACvD,OAAO,WAAW,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,WAAW,CAAA;SAC1E;;YAAM,OAAO,KAAK,CAAA;IACrB,CAAC;IAED,YAAY;QACV,OAAO,WAAW,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAA;IACpF,CAAC;IAED,IAAI,WAAW;QACb,OAAO,WAAW,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAA;IAClE,CAAC;CACF","sourcesContent":["export class LruTemporisedAsyncCache<K, V> {\n  private readonly maxCacheSize: number\n  private readonly lifetimeForValue: (value: V) => number\n\n  private readonly nodesMap: Map<K, CacheNode<K, V>> = new Map()\n  private firstNode: CacheNode<K, V> | null = null\n  private lastNode: CacheNode<K, V> | null = null\n\n  /**\n   * @param maxCacheSize Maximum size of the cache. Any value <= 0 is considered as no limit.\n   * @param lifetimeForValue Get the maximum lifetime for an entry given its value.\n   */\n  constructor(maxCacheSize: number, lifetimeForValue: (value: V) => number) {\n    this.maxCacheSize = maxCacheSize\n    this.lifetimeForValue = lifetimeForValue\n  }\n\n  /**\n   * Gets a cached value or retrieves it and caches it if the value is not available or if it is available but expired. A value will never be expired\n   * if it was not yet retrieved, even if the retrieved value would be expired according to the {@link additionalExpirationCondition}\n   * @param key key of the entry\n   * @param retrieve given the previous value (if available, expired but not yet removed) of the entry retrieves an updated value.\n   * @param additionalExpirationCondition an expiration condition for already cached values to consider in addition to time-based expiration. Returns\n   * always false by default, meaning the value is not expired if its lifetime didn't already surpass the maximum lifetime.\n   * @return the cached value if present and not expired, else the retrieved value.\n   */\n  get(\n    key: K,\n    retrieve: (previousValue: V | undefined) => Promise<V>,\n    additionalExpirationCondition: (value: V) => boolean = () => false\n  ): Promise<V> {\n    const retrieved = this.nodesMap.get(key)\n    if (retrieved !== undefined) {\n      this.markUsed(retrieved)\n      const cachedValue = retrieved.cachedValue\n      if (retrieved.expired((x) => this.lifetimeForValue(x)) || (cachedValue !== undefined && additionalExpirationCondition(cachedValue))) {\n        retrieved.value = this.registerJob(key, () => retrieve(cachedValue))\n      }\n      return retrieved.valuePromise()\n    } else {\n      const newNode = new CacheNode(\n        key,\n        this.lastNode,\n        null,\n        this.registerJob(key, () => retrieve(undefined))\n      )\n      this.addToTail(key, newNode)\n      if (this.maxCacheSize > 0 && this.nodesMap.size > this.maxCacheSize) this.evict(this.firstNode!.key, this.firstNode!)\n      return newNode.valuePromise()\n    }\n  }\n\n  clear() {\n    this.firstNode = null\n    this.lastNode = null\n    this.nodesMap.clear()\n  }\n\n  private addToTail(key: K | null, node: CacheNode<K, V>) {\n    node.previous = this.lastNode\n    node.next = null\n    if (this.lastNode) this.lastNode.next = node\n    this.lastNode = node\n    if (this.firstNode === null) this.firstNode = node\n    if (key != null) this.nodesMap.set(key, node)\n  }\n\n  private evict(key: K | null, node: CacheNode<K, V>) {\n    if (node.previous) node.previous.next = node.next\n    if (node.next) node.next.previous = node.previous\n    if (this.firstNode === node) this.firstNode = node.next\n    if (this.lastNode === node) this.lastNode = node.previous\n    if (key !== null) this.nodesMap.delete(key)\n  }\n\n  private markUsed(node: CacheNode<K, V>) {\n    if (node !== this.lastNode) {\n      // No need to modify the nodes map\n      this.evict(null, node)\n      this.addToTail(null, node)\n    }\n  }\n\n  private registerJob(key: K, retrieve: () => Promise<V>): Promise<V> {\n    // The node may have already been evicted by the time the promise completed if the cached surpassed the maximum size.\n    return retrieve()\n      .then((v) => {\n        const node = this.nodesMap.get(key)\n        if (node) {\n          node.value = { cached: v, timestamp: Date.now() }\n        }\n        return v\n      })\n      .catch((e) => {\n        const node = this.nodesMap.get(key)\n        if (node) {\n          this.evict(key, node)\n        }\n        throw e\n      })\n  }\n}\n\ntype Cached<V> = { cached: V; timestamp: number }\n\nclass CacheNode<K, V> {\n  readonly key: K\n  previous: CacheNode<K, V> | null\n  next: CacheNode<K, V> | null\n  value: Promise<V> | Cached<V>\n\n  constructor(key: K, previous: CacheNode<K, V> | null, next: CacheNode<K, V> | null, value: Promise<V>) {\n    this.key = key\n    this.previous = previous\n    this.next = next\n    this.value = value\n  }\n\n  expired(lifetimeForValue: (value: V) => number): boolean {\n    if ('timestamp' in this.value) {\n      const maxLifetime = lifetimeForValue(this.value.cached)\n      return maxLifetime > 0 && Date.now() - this.value.timestamp > maxLifetime\n    } else return false\n  }\n\n  valuePromise(): Promise<V> {\n    return 'timestamp' in this.value ? Promise.resolve(this.value.cached) : this.value\n  }\n\n  get cachedValue(): V | undefined {\n    return 'timestamp' in this.value ? this.value.cached : undefined\n  }\n}\n"]}

package/dist/package.json

@@ -0,0 +1,22 @@
+{
+  "name": "@icure/api",
+  "version": "7.0.0-beta.0",
+  "description": "Typescript version of iCure standalone API client",
+  "main": "index.js",
+  "types": "index.d.ts",
+  "dependencies": {
+    "date-fns": "^2.23.0",
+    "libphonenumber-js": "^1.7.18",
+    "lodash": "^4.17.21",
+    "moment": "^2.22.1",
+    "text-encoding": "^0.7.0",
+    "uuid": "^8.3.2",
+    "uuid-encoder": "^1.1.0"
+  },
+  "author": "Taktik sa - B12 Consulting",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/taktik/icc-api/issues"
+  },
+  "homepage": "https://github.com/taktik/icc-api#readme"
+}

package/fake-secrets.txt

@@ -0,0 +1,3 @@
+secretEncryptionKeyOfObject
+LetMeInForReal
+{}

package/icc-api/.swagger-codegen/VERSION

@@ -0,0 +1 @@
+1.4.3

package/icc-api/.swagger-codegen-ignore

@@ -0,0 +1,23 @@
+# Swagger Codegen Ignore
+# Generated by swagger-codegen https://github.com/swagger-api/swagger-codegen
+
+# Use this file to prevent files from being overwritten by the generator.
+# The patterns follow closely to .gitignore or .dockerignore.
+
+# As an example, the C# client generator defines ApiClient.cs.
+# You can make changes and tell Swagger Codgen to ignore just this file by uncommenting the following line:
+#ApiClient.cs
+
+# You can match any string of characters against a directory, file or extension with a single asterisk (*):
+#foo/*/qux
+# The above matches foo/bar/qux and foo/baz/qux, but not foo/bar/baz/qux
+
+# You can recursively match patterns against a directory, file or extension with a double asterisk (**):
+#foo/**/qux
+# This matches foo/bar/qux, foo/baz/qux, and foo/bar/baz/qux
+
+# You can also negate patterns with an exclamation (!).
+# For example, you can ignore all files in a docs folder with the file extension .md:
+#docs/*.md
+# Then explicitly reverse the ignore rule for a single file:
+#!docs/README.md