@icure/api 6.4.0 → 7.0.0-beta.1

package/icc-x-api/storage/StorageEntryKeysFactory.d.ts

@@ -0,0 +1,31 @@
+/**
+ * Specifies the entry keys to use for storage of data needed by iCure.
+ */
+export interface StorageEntryKeysFactory {
+    /**
+     * Get the entry key for the storage of a key pair of a data owner which was created on this device. All keys created on this device will be
+     * considered as verified and safe.
+     * This entry key will be used in a {@link KeyStorageFacade}.
+     * @param dataOwnerId Id of a data owner.
+     * @param publicKeyFingerprint Fingerprint of the public key in a keypair of the data owner.
+     * @return entry key for the keypair.
+     */
+    deviceKeypairOfDataOwner(dataOwnerId: string, publicKeyFingerprint: string): string;
+    /**
+     * Get the entry key for the storage of a key pair of a data owner which was recovered from transfer keys or shamir.
+     * These keys are going to be considered as UNSAFE for encryption unless their public key has been verified by the human user and has been stored in
+     * {@link selfPublicKeysVerificationCacheForDataOwner}.
+     * This entry key will be used in a {@link KeyStorageFacade}.
+     * @param dataOwnerId Id of a data owner.
+     * @param publicKeyFingerprint Fingerprint of the public key in a keypair of the data owner.
+     * @return entry key for the keypair.
+     */
+    cachedRecoveredKeypairOfDataOwner(dataOwnerId: string, publicKeyFingerprint: string): string;
+    /**
+     * Get the entry key for the storage of answers to own public key verification (from {@link CryptoStrategies.verifyOwnPublicKeys}).
+     * This entry key will be used in a {@link StorageFacade}.
+     * @param dataOwnerId Id of a data owner.
+     * @return entry key for verified public keys of the data owner.
+     */
+    selfPublicKeysVerificationCacheForDataOwner(dataOwnerId: string): string;
+}

package/icc-x-api/storage/StorageEntryKeysFactory.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=StorageEntryKeysFactory.js.map

package/icc-x-api/storage/StorageEntryKeysFactory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"StorageEntryKeysFactory.js","sourceRoot":"","sources":["../../../icc-x-api/storage/StorageEntryKeysFactory.ts"],"names":[],"mappings":"","sourcesContent":["/**\n * Specifies the entry keys to use for storage of data needed by iCure.\n */\nexport interface StorageEntryKeysFactory {\n  /**\n   * Get the entry key for the storage of a key pair of a data owner which was created on this device. All keys created on this device will be\n   * considered as verified and safe.\n   * This entry key will be used in a {@link KeyStorageFacade}.\n   * @param dataOwnerId Id of a data owner.\n   * @param publicKeyFingerprint Fingerprint of the public key in a keypair of the data owner.\n   * @return entry key for the keypair.\n   */\n  deviceKeypairOfDataOwner(dataOwnerId: string, publicKeyFingerprint: string): string\n\n  /**\n   * Get the entry key for the storage of a key pair of a data owner which was recovered from transfer keys or shamir.\n   * These keys are going to be considered as UNSAFE for encryption unless their public key has been verified by the human user and has been stored in\n   * {@link selfPublicKeysVerificationCacheForDataOwner}.\n   * This entry key will be used in a {@link KeyStorageFacade}.\n   * @param dataOwnerId Id of a data owner.\n   * @param publicKeyFingerprint Fingerprint of the public key in a keypair of the data owner.\n   * @return entry key for the keypair.\n   */\n  cachedRecoveredKeypairOfDataOwner(dataOwnerId: string, publicKeyFingerprint: string): string\n\n  /**\n   * Get the entry key for the storage of answers to own public key verification (from {@link CryptoStrategies.verifyOwnPublicKeys}).\n   * This entry key will be used in a {@link StorageFacade}.\n   * @param dataOwnerId Id of a data owner.\n   * @return entry key for verified public keys of the data owner.\n   */\n  selfPublicKeysVerificationCacheForDataOwner(dataOwnerId: string): string\n\n  /*\n   * There is no need to store verified public keys for other data owners: we verify only when we want to create a new exchange key, and we need to\n   * create an exchange key to each user only once unless we lose our key. But we can lose our key only if we delete our data, which means we would\n   * also used the verified keys for other data owners...\n   */\n}\n"]}

package/icc-x-api/utils/collection-utils.d.ts

@@ -0,0 +1,8 @@
+/**
+ * Check if two sets are equals (they contain the same elements). Will not work if the content can't be compared by `==`.
+ */
+export declare function setEquals<T>(setA: Set<T>, setB: Set<T>): boolean;
+/**
+ * Check if two arrays are equals (they contain the same elements). Will not work if the content can't be compared by `==`.
+ */
+export declare function arrayEquals<T>(arrayA: T[], arrayB: T[]): boolean;

package/icc-x-api/utils/collection-utils.js

@@ -0,0 +1,26 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.arrayEquals = exports.setEquals = void 0;
+/**
+ * Check if two sets are equals (they contain the same elements). Will not work if the content can't be compared by `==`.
+ */
+function setEquals(setA, setB) {
+    if (setA.size != setB.size)
+        return false;
+    return Array.from(setA).every((x) => setB.has(x));
+}
+exports.setEquals = setEquals;
+/**
+ * Check if two arrays are equals (they contain the same elements). Will not work if the content can't be compared by `==`.
+ */
+function arrayEquals(arrayA, arrayB) {
+    if (arrayA.length != arrayB.length)
+        return false;
+    for (let i = 0; i < arrayA.length; ++i) {
+        if (arrayA[i] !== arrayB[i])
+            return false;
+    }
+    return true;
+}
+exports.arrayEquals = arrayEquals;
+//# sourceMappingURL=collection-utils.js.map

package/icc-x-api/utils/collection-utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collection-utils.js","sourceRoot":"","sources":["../../../icc-x-api/utils/collection-utils.ts"],"names":[],"mappings":";;;AAAA;;GAEG;AACH,SAAgB,SAAS,CAAI,IAAY,EAAE,IAAY;IACrD,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAA;IACxC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;AACnD,CAAC;AAHD,8BAGC;AAED;;GAEG;AACH,SAAgB,WAAW,CAAI,MAAW,EAAE,MAAW;IACrD,IAAI,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM;QAAE,OAAO,KAAK,CAAA;IAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;QACtC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;KAC1C;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAND,kCAMC","sourcesContent":["/**\n * Check if two sets are equals (they contain the same elements). Will not work if the content can't be compared by `==`.\n */\nexport function setEquals<T>(setA: Set<T>, setB: Set<T>): boolean {\n  if (setA.size != setB.size) return false\n  return Array.from(setA).every((x) => setB.has(x))\n}\n\n/**\n * Check if two arrays are equals (they contain the same elements). Will not work if the content can't be compared by `==`.\n */\nexport function arrayEquals<T>(arrayA: T[], arrayB: T[]): boolean {\n  if (arrayA.length != arrayB.length) return false\n  for (let i = 0; i < arrayA.length; ++i) {\n    if (arrayA[i] !== arrayB[i]) return false\n  }\n  return true\n}\n"]}

package/icc-x-api/utils/crypto-utils.d.ts

@@ -1,5 +1,6 @@
+import { KeyPair } from '../crypto/RSA';
 export declare function notConcurrent<T>(concurrencyMap: {
-    [key: string]: PromiseLike<T>;
+    [key: string]: PromiseLike<any>;
 }, key: string, proc: () => PromiseLike<T>): PromiseLike<T>;
 export declare function jwk2pkcs8(jwk: any): string;
 export declare function jwk2spki(jwk: any): string;
@@ -59,3 +60,9 @@ export declare function crypt(obj: any, cryptor: (obj: {
 export declare function decrypt(obj: any, decryptor: (obj: Uint8Array) => Promise<{
     [key: string]: string;
 }>): Promise<any>;
+/**
+ * Extracts the full jwk key pair from the jwk representation of the private key.
+ * @param privateKeyJwk private key in jwk representation
+ * @throws if the key is missing the public modulus or public exponent.
+ */
+export declare function keyPairFromPrivateKeyJwk(privateKeyJwk: JsonWebKey): KeyPair<JsonWebKey>;

package/icc-x-api/utils/crypto-utils.js

@@ -9,7 +9,7 @@ var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, ge
     });
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.decrypt = exports.crypt = exports.before = exports.after = exports.appendBuffer = exports.truncateTrailingNulls = exports.pkcs8ToJwk = exports.spkiToJwk = exports.jwk2spki = exports.jwk2pkcs8 = exports.notConcurrent = void 0;
+exports.keyPairFromPrivateKeyJwk = exports.decrypt = exports.crypt = exports.before = exports.after = exports.appendBuffer = exports.truncateTrailingNulls = exports.pkcs8ToJwk = exports.spkiToJwk = exports.jwk2spki = exports.jwk2pkcs8 = exports.notConcurrent = void 0;
 const mm = require("moment");
 const _ = require("lodash");
 const binary_utils_1 = require("../utils/binary-utils");
@@ -18,14 +18,16 @@ const asn1_parser_1 = require("./asn1-parser");
 function notConcurrent(concurrencyMap, key, proc) {
     const inFlight = concurrencyMap[key];
     if (!inFlight) {
-        return (concurrencyMap[key] = (() => __awaiter(this, void 0, void 0, function* () {
+        const newJob = (() => __awaiter(this, void 0, void 0, function* () {
             try {
                 return yield proc();
             }
             finally {
                 delete concurrencyMap[key];
             }
-        }))());
+        }))();
+        concurrencyMap[key] = newJob;
+        return newJob;
     }
     else {
         return concurrencyMap[key].then(() => notConcurrent(concurrencyMap, key, proc));
@@ -243,4 +245,18 @@ function decrypt(obj, decryptor) {
     });
 }
 exports.decrypt = decrypt;
+/**
+ * Extracts the full jwk key pair from the jwk representation of the private key.
+ * @param privateKeyJwk private key in jwk representation
+ * @throws if the key is missing the public modulus or public exponent.
+ */
+function keyPairFromPrivateKeyJwk(privateKeyJwk) {
+    if (!privateKeyJwk.n || !privateKeyJwk.e)
+        throw new Error('Incomplete private JsonWebKey: missing public modulus and/or exponent');
+    return {
+        privateKey: privateKeyJwk,
+        publicKey: spkiToJwk((0, binary_utils_1.hex2ua)(jwk2spki(privateKeyJwk))),
+    };
+}
+exports.keyPairFromPrivateKeyJwk = keyPairFromPrivateKeyJwk;
 //# sourceMappingURL=crypto-utils.js.map

package/icc-x-api/utils/crypto-utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"crypto-utils.js","sourceRoot":"","sources":["../../../icc-x-api/utils/crypto-utils.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA,6BAA4B;AAE5B,4BAA2B;AAC3B,wDAAoG;AACpG,+CAAoC;AACpC,+CAAyC;AAEzC,SAAgB,aAAa,CAAI,cAAiD,EAAE,GAAW,EAAE,IAA0B;IACzH,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,CAAA;IACpC,IAAI,CAAC,QAAQ,EAAE;QACb,OAAO,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,GAAS,EAAE;YACxC,IAAI;gBACF,OAAO,MAAM,IAAI,EAAE,CAAA;aACpB;oBAAS;gBACR,OAAO,cAAc,CAAC,GAAG,CAAC,CAAA;aAC3B;QACH,CAAC,CAAA,CAAC,EAAE,CAAC,CAAA;KACN;SAAM;QACL,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,cAAc,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAA;KAChF;AACH,CAAC;AAbD,sCAaC;AAED,SAAgB,SAAS,CAAC,GAAQ;IAChC,OAAO,IAAA,kBAAI,EAAC;QACV,IAAI;QACJ;YACE,CAAC,IAAI,EAAE,IAAI,CAAC;YACZ,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,oBAAoB,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C;gBACE,IAAI;gBACJ;oBACE;wBACE,IAAI;wBACJ;4BACE,CAAC,IAAI,EAAE,IAAI,CAAC;4BACZ,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;4BACjC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;4BACjC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;yBAClC;qBACF;iBACF;aACF;SACF;KACF,CAAC,CAAA;AACJ,CAAC;AA3BD,8BA2BC;AAED,SAAgB,QAAQ,CAAC,GAAQ;IAC/B,OAAO,IAAA,kBAAI,EAAC;QACV,IAAI;QACJ;YACE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,oBAAoB,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C;gBACE,IAAI;gBACJ;oBACE;wBACE,IAAI;wBACJ;4BACE,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;yBACjC;qBACF;iBACF;aACF;SACF;KACF,CAAC,CAAA;AACJ,CAAC;AAnBD,4BAmBC;AAED,SAAgB,SAAS,CAAC,GAAe;;IACvC,MAAM,IAAI,GAAG,IAAA,uBAAS,EAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAA;IAE3C,IAAI,OAAO,GAA2B,SAAS,CAAA;IAC/C,IAAI,QAAQ,GAA2B,SAAS,CAAA;IAChD,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;QAClB,CAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,IAAI,MAAK,IAAI;QACjC,CAAA,MAAA,MAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,IAAI,MAAK,IAAI;QAChD,IAAA,qBAAM,EAAC,MAAA,MAAA,MAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,KAAK,mCAAI,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,oBAAoB,CAAC,2BAA2B;MAC1H;QACA,OAAO,GAAG,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,KAAK,CAAA;QACjE,QAAQ,GAAG,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,KAAK,CAAA;KACnE;SAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,IAAI,MAAK,IAAI,IAAI,CAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,IAAI,MAAK,IAAI,EAAE;QACvG,OAAO,GAAG,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,KAAK,CAAA;QACnC,QAAQ,GAAG,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,KAAK,CAAA;KACrC;IAED,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,EAAE;QACzB,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAA;KACvC;IACD,OAAO;QACL,GAAG,EAAE,KAAK;QACV,GAAG,EAAE,UAAU;QACf,GAAG,EAAE,IAAI;QACT,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;KACnC,CAAA;AACH,CAAC;AA5BD,8BA4BC;AAED,SAAgB,UAAU,CAAC,GAA6B;;IACtD,MAAM,MAAM,GAAG,IAAA,uBAAS,EAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAA;IAC7C,MAAM,GAAG,GACP,CAAA,MAAA,MAAM,CAAC,QAAQ,0CAAE,MAAM,MAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAA,MAAA,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,0CAAE,MAAM,MAAK,CAAC;QAC5G,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,MAAM,CAAA;IACZ,OAAO;QACL,GAAG,EAAE,KAAK;QACV,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC9D,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC9D,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC9D,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC9D,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC9D,EAAE,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC/D,EAAE,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC/D,EAAE,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;KAChE,CAAA;AACH,CAAC;AAjBD,gCAiBC;AAED,SAAS,UAAU,CAAC,CAAa;IAC/B,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;QACjB,CAAC,EAAE,CAAA;KACJ;IACD,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;AACnB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,qBAAqB,CAAC,CAAa;IACjD,IAAI,GAAG,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAA;IAC1B,OAAO,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE;QAC/B,GAAG,EAAE,CAAA;KACN;IACD,yEAAyE;IACzE,8CAA8C;IAC9C,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAA;AAC/B,CAAC;AARD,sDAQC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,OAAoB,EAAE,OAAoB;IACrE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,CAAA;IACnE,GAAG,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAA;IACnC,GAAG,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,CAAA;IACpD,OAAO,GAAG,CAAC,MAAqB,CAAA;AAClC,CAAC;AALD,oCAKC;AAED,0CAA0C;AAC1C,SAAgB,KAAK,CAAC,EAA6B,EAAE,EAA6B;IAChF,OAAO,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,MAAM,CAAC,EAAE,CAAE,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC,CAAA;AAC/G,CAAC;AAFD,sBAEC;AAED,SAAgB,MAAM,CAAC,EAA6B,EAAE,EAA6B;IACjF,OAAO,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,MAAM,CAAC,EAAE,CAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC,CAAA;AAChH,CAAC;AAFD,wBAEC;AAED,SAAS,MAAM,CAAC,mBAA2B;IACzC,IAAI,CAAC,mBAAmB,IAAI,mBAAmB,KAAK,CAAC,EAAE;QACrD,OAAO,IAAI,CAAA;KACZ;IACD,IAAI,mBAAmB,IAAI,QAAQ,IAAI,mBAAmB,GAAG,QAAQ,EAAE;QACrE,OAAO,EAAE,CAAC,EAAE,GAAG,mBAAmB,EAAE,UAAU,CAAC,CAAA;KAChD;SAAM,IAAI,mBAAmB,IAAI,cAAc,EAAE;QAChD,OAAO,EAAE,CAAC,EAAE,GAAG,mBAAmB,EAAE,gBAAgB,CAAC,CAAA;KACtD;SAAM;QACL,OAAO,EAAE,CAAC,mBAAmB,CAAC,CAAA;KAC/B;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAsB,KAAK,CAAC,GAAQ,EAAE,OAAiE,EAAE,IAAmB;;QAC1H,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CACnB,GAAG,EACH,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CACrC,CAAA;QACD,GAAG,CAAC,aAAa,GAAG,IAAA,kBAAG,EAAC,IAAA,wBAAS,EAAC,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACzD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAEjD,MAAM,IAAI;aACP,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;aAC9B,MAAM,CAAC,CAAO,IAAmB,EAAE,CAAM,EAAE,EAAE;YAC5C,MAAM,IAAI,CAAA;YACV,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YAC5B,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YAElC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAO,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YACzI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,CAAC,CAAA;QACxB,CAAC,CAAA,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAA;QAEvB,OAAO,GAAG,CAAA;IACZ,CAAC;CAAA;AApBD,sBAoBC;AAED;;;;;GAKG;AACH,SAAsB,OAAO,CAAC,GAAQ,EAAE,SAAkE;;QACxG,MAAM,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAO,IAAmB,EAAE,CAAM,EAAE,EAAE;YAClE,MAAM,IAAI,CAAA;YACV,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE;gBACzB,MAAO,GAAG,CAAC,CAAC,CAAgB;qBACzB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,CAAC;qBAClD,MAAM,CAAC,CAAO,IAAmB,EAAE,EAAO,EAAE,EAAE;oBAC7C,MAAM,IAAI,CAAA;oBACV,MAAM,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,CAAA;gBAC9B,CAAC,CAAA,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAA;aACxB;QACH,CAAC,CAAA,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAA;QACrB,IAAI,GAAG,CAAC,aAAa,EAAE;YACrB,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,SAAS,CAAC,IAAA,wBAAS,EAAC,IAAA,kBAAG,EAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;SACvE;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;CAAA;AAhBD,0BAgBC","sourcesContent":["import * as mm from 'moment'\nimport { Moment } from 'moment'\nimport * as _ from 'lodash'\nimport { a2b, b2a, b64Url2ua, string2ua, ua2b64Url, ua2hex, ua2string } from '../utils/binary-utils'\nimport { pack } from './asn1-packer'\nimport { parseAsn1 } from './asn1-parser'\n\nexport function notConcurrent<T>(concurrencyMap: { [key: string]: PromiseLike<T> }, key: string, proc: () => PromiseLike<T>): PromiseLike<T> {\n  const inFlight = concurrencyMap[key]\n  if (!inFlight) {\n    return (concurrencyMap[key] = (async () => {\n      try {\n        return await proc()\n      } finally {\n        delete concurrencyMap[key]\n      }\n    })())\n  } else {\n    return concurrencyMap[key].then(() => notConcurrent(concurrencyMap, key, proc))\n  }\n}\n\nexport function jwk2pkcs8(jwk: any): string {\n  return pack([\n    0x30,\n    [\n      [0x02, '00'],\n      [0x30, [[0x06, '2a864886f70d010101'], [0x05]]], // pragma: allowlist secret\n      [\n        0x04,\n        [\n          [\n            0x30,\n            [\n              [0x02, '00'],\n              [0x02, ua2hex(b64Url2ua(jwk.n))],\n              [0x02, ua2hex(b64Url2ua(jwk.e))],\n              [0x02, ua2hex(b64Url2ua(jwk.d))],\n              [0x02, ua2hex(b64Url2ua(jwk.p))],\n              [0x02, ua2hex(b64Url2ua(jwk.q))],\n              [0x02, ua2hex(b64Url2ua(jwk.dp))],\n              [0x02, ua2hex(b64Url2ua(jwk.dq))],\n              [0x02, ua2hex(b64Url2ua(jwk.qi))],\n            ],\n          ],\n        ],\n      ],\n    ],\n  ])\n}\n\nexport function jwk2spki(jwk: any): string {\n  return pack([\n    0x30,\n    [\n      [0x30, [[0x06, '2a864886f70d010101'], [0x05]]], // pragma: allowlist secret\n      [\n        0x03,\n        [\n          [\n            0x30,\n            [\n              [0x02, ua2hex(b64Url2ua(jwk.n))],\n              [0x02, ua2hex(b64Url2ua(jwk.e))],\n            ],\n          ],\n        ],\n      ],\n    ],\n  ])\n}\n\nexport function spkiToJwk(buf: Uint8Array): { kty: string; alg: string; n: string; e: string; ext: boolean } {\n  const asn1 = parseAsn1(new Uint8Array(buf))\n\n  var modulus: Uint8Array | undefined = undefined\n  var exponent: Uint8Array | undefined = undefined\n  if (\n    asn1.type === 0x30 &&\n    asn1.children?.[0]?.type === 0x30 &&\n    asn1.children?.[0]?.children?.[0]?.type === 0x06 &&\n    ua2hex(asn1.children?.[0]?.children?.[0]?.value ?? new Uint8Array(0)) === '2a864886f70d010101' // pragma: allowlist secret\n  ) {\n    modulus = asn1.children?.[1]?.children?.[0]?.children?.[0]?.value\n    exponent = asn1.children?.[1]?.children?.[0]?.children?.[1]?.value\n  } else if (asn1.type === 0x30 && asn1.children?.[0]?.type === 0x02 && asn1.children?.[1]?.type === 0x02) {\n    modulus = asn1.children?.[0]?.value\n    exponent = asn1.children?.[1]?.value\n  }\n\n  if (!modulus || !exponent) {\n    throw new Error('Invalid spki format')\n  }\n  return {\n    kty: 'RSA',\n    alg: 'RSA-OAEP',\n    ext: true,\n    n: ua2b64Url(minimalRep(modulus)),\n    e: ua2b64Url(minimalRep(exponent)),\n  }\n}\n\nexport function pkcs8ToJwk(buf: Uint8Array | ArrayBuffer) {\n  const parsed = parseAsn1(new Uint8Array(buf))\n  const seq =\n    parsed.children?.length === 3 && parsed.children[2].type === 0x04 && parsed.children[2].children?.length === 1\n      ? parsed.children[2].children[0]\n      : parsed\n  return {\n    kty: 'RSA',\n    n: ua2b64Url(minimalRep(seq.children![1].value as Uint8Array)),\n    e: ua2b64Url(minimalRep(seq.children![2].value as Uint8Array)),\n    d: ua2b64Url(minimalRep(seq.children![3].value as Uint8Array)),\n    p: ua2b64Url(minimalRep(seq.children![4].value as Uint8Array)),\n    q: ua2b64Url(minimalRep(seq.children![5].value as Uint8Array)),\n    dp: ua2b64Url(minimalRep(seq.children![6].value as Uint8Array)),\n    dq: ua2b64Url(minimalRep(seq.children![7].value as Uint8Array)),\n    qi: ua2b64Url(minimalRep(seq.children![8].value as Uint8Array)),\n  }\n}\n\nfunction minimalRep(b: Uint8Array) {\n  let i = 0\n  while (b[i] === 0) {\n    i++\n  }\n  return b.slice(i)\n}\n\n/**\n * Provide a view over the given Uint8Array where any trailing null bytes at\n * the end are truncated.\n *\n * This can be used to ignore null bytes at the end of a padded UTF-8 string\n * without needing to copy that string, assuming code point U+0000 is encoded\n * in one null byte according to standards rather than in a multi-byte\n * overlong form.\n */\nexport function truncateTrailingNulls(a: Uint8Array) {\n  let end = a.byteLength - 1\n  while (a[end] === 0 && end >= 0) {\n    end--\n  }\n  // end is now either the last non-null position in a or -1; in the latter\n  // case the returned array will have length 0.\n  return a.subarray(0, end + 1)\n}\n\n/**\n *\n * @param buffer1 {Uint8Array}\n * @param buffer2{ Uint8Array}\n * @returns {ArrayBuffer}\n */\nexport function appendBuffer(buffer1: ArrayBuffer, buffer2: ArrayBuffer): ArrayBuffer {\n  const tmp = new Uint8Array(buffer1.byteLength + buffer2.byteLength)\n  tmp.set(new Uint8Array(buffer1), 0)\n  tmp.set(new Uint8Array(buffer2), buffer1.byteLength)\n  return tmp.buffer as ArrayBuffer\n}\n\n//Convenience methods for dates management\nexport function after(d1: number | null | undefined, d2: number | null | undefined): boolean {\n  return d1 === null || d2 === null || d1 === undefined || d2 === undefined || moment(d1)!.isAfter(moment(d2)!)\n}\n\nexport function before(d1: number | null | undefined, d2: number | null | undefined): boolean {\n  return d1 === null || d2 === null || d1 === undefined || d2 === undefined || moment(d1)!.isBefore(moment(d2)!)\n}\n\nfunction moment(epochOrLongCalendar: number): Moment | null {\n  if (!epochOrLongCalendar && epochOrLongCalendar !== 0) {\n    return null\n  }\n  if (epochOrLongCalendar >= 18000101 && epochOrLongCalendar < 25400000) {\n    return mm('' + epochOrLongCalendar, 'YYYYMMDD')\n  } else if (epochOrLongCalendar >= 18000101000000) {\n    return mm('' + epochOrLongCalendar, 'YYYYMMDDHHmmss')\n  } else {\n    return mm(epochOrLongCalendar)\n  }\n}\n\n/**\n * Encrypt object graph recursively\n *\n * @param obj the object to encrypt\n * @param cryptor the cryptor function (returns a promise)\n * @param keys the keys to be crypted: ex for a Patient ['note', 'addresses.*.[\"street\", \"houseNumber\", \"telecoms.*.telecomNumber\"]']\n */\nexport async function crypt(obj: any, cryptor: (obj: { [key: string]: string }) => Promise<ArrayBuffer>, keys: Array<string>) {\n  const subObj = _.pick(\n    obj,\n    keys.filter((k) => !k.includes('*'))\n  )\n  obj.encryptedSelf = b2a(ua2string(await cryptor(subObj)))\n  Object.keys(subObj).forEach((k) => delete obj[k])\n\n  await keys\n    .filter((k) => k.includes('*'))\n    .reduce(async (prev: Promise<void>, k: any) => {\n      await prev\n      const k1 = k.split('.*.')[0]\n      const k2 = k.substr(k1.length + 3)\n\n      const mapped = await Promise.all((_.get(obj, k1) || []).map((so: any) => crypt(so, cryptor, k2.startsWith('[') ? JSON.parse(k2) : [k2])))\n      _.set(obj, k1, mapped)\n    }, Promise.resolve())\n\n  return obj\n}\n\n/**\n * Decrypt object graph recursively\n *\n * @param obj the object to encrypt\n * @param decryptor the decryptor function (returns a promise)\n */\nexport async function decrypt(obj: any, decryptor: (obj: Uint8Array) => Promise<{ [key: string]: string }>) {\n  await Object.keys(obj).reduce(async (prev: Promise<void>, k: any) => {\n    await prev\n    if (Array.isArray(obj[k])) {\n      await (obj[k] as Array<any>)\n        .filter((o) => typeof o === 'object' && o !== null)\n        .reduce(async (prev: Promise<void>, so: any) => {\n          await prev\n          await decrypt(so, decryptor)\n        }, Promise.resolve())\n    }\n  }, Promise.resolve())\n  if (obj.encryptedSelf) {\n    Object.assign(obj, await decryptor(string2ua(a2b(obj.encryptedSelf))))\n  }\n  return obj\n}\n"]}
+{"version":3,"file":"crypto-utils.js","sourceRoot":"","sources":["../../../icc-x-api/utils/crypto-utils.ts"],"names":[],"mappings":";;;;;;;;;;;;AAAA,6BAA4B;AAE5B,4BAA2B;AAC3B,wDAA4G;AAC5G,+CAAoC;AACpC,+CAAyC;AAGzC,SAAgB,aAAa,CAAI,cAAmD,EAAE,GAAW,EAAE,IAA0B;IAC3H,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,CAAA;IACpC,IAAI,CAAC,QAAQ,EAAE;QACb,MAAM,MAAM,GAAG,CAAC,GAAS,EAAE;YACzB,IAAI;gBACF,OAAO,MAAM,IAAI,EAAE,CAAA;aACpB;oBAAS;gBACR,OAAO,cAAc,CAAC,GAAG,CAAC,CAAA;aAC3B;QACH,CAAC,CAAA,CAAC,EAAE,CAAA;QACJ,cAAc,CAAC,GAAG,CAAC,GAAG,MAAM,CAAA;QAC5B,OAAO,MAAM,CAAA;KACd;SAAM;QACL,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,aAAa,CAAC,cAAc,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAA;KAChF;AACH,CAAC;AAfD,sCAeC;AAED,SAAgB,SAAS,CAAC,GAAQ;IAChC,OAAO,IAAA,kBAAI,EAAC;QACV,IAAI;QACJ;YACE,CAAC,IAAI,EAAE,IAAI,CAAC;YACZ,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,oBAAoB,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C;gBACE,IAAI;gBACJ;oBACE;wBACE,IAAI;wBACJ;4BACE,CAAC,IAAI,EAAE,IAAI,CAAC;4BACZ,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;4BACjC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;4BACjC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;yBAClC;qBACF;iBACF;aACF;SACF;KACF,CAAC,CAAA;AACJ,CAAC;AA3BD,8BA2BC;AAED,SAAgB,QAAQ,CAAC,GAAQ;IAC/B,OAAO,IAAA,kBAAI,EAAC;QACV,IAAI;QACJ;YACE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,oBAAoB,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C;gBACE,IAAI;gBACJ;oBACE;wBACE,IAAI;wBACJ;4BACE,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;4BAChC,CAAC,IAAI,EAAE,IAAA,qBAAM,EAAC,IAAA,wBAAS,EAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;yBACjC;qBACF;iBACF;aACF;SACF;KACF,CAAC,CAAA;AACJ,CAAC;AAnBD,4BAmBC;AAED,SAAgB,SAAS,CAAC,GAAe;;IACvC,MAAM,IAAI,GAAG,IAAA,uBAAS,EAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAA;IAE3C,IAAI,OAAO,GAA2B,SAAS,CAAA;IAC/C,IAAI,QAAQ,GAA2B,SAAS,CAAA;IAChD,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;QAClB,CAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,IAAI,MAAK,IAAI;QACjC,CAAA,MAAA,MAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,IAAI,MAAK,IAAI;QAChD,IAAA,qBAAM,EAAC,MAAA,MAAA,MAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,KAAK,mCAAI,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,oBAAoB,CAAC,2BAA2B;MAC1H;QACA,OAAO,GAAG,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,KAAK,CAAA;QACjE,QAAQ,GAAG,MAAA,MAAA,MAAA,MAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,QAAQ,0CAAG,CAAC,CAAC,0CAAE,KAAK,CAAA;KACnE;SAAM,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,CAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,IAAI,MAAK,IAAI,IAAI,CAAA,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,IAAI,MAAK,IAAI,EAAE;QACvG,OAAO,GAAG,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,KAAK,CAAA;QACnC,QAAQ,GAAG,MAAA,MAAA,IAAI,CAAC,QAAQ,0CAAG,CAAC,CAAC,0CAAE,KAAK,CAAA;KACrC;IAED,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,EAAE;QACzB,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAA;KACvC;IACD,OAAO;QACL,GAAG,EAAE,KAAK;QACV,GAAG,EAAE,UAAU;QACf,GAAG,EAAE,IAAI;QACT,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;KACnC,CAAA;AACH,CAAC;AA5BD,8BA4BC;AAED,SAAgB,UAAU,CAAC,GAA6B;;IACtD,MAAM,MAAM,GAAG,IAAA,uBAAS,EAAC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAA;IAC7C,MAAM,GAAG,GACP,CAAA,MAAA,MAAM,CAAC,QAAQ,0CAAE,MAAM,MAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAA,MAAA,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,0CAAE,MAAM,MAAK,CAAC;QAC5G,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QAChC,CAAC,CAAC,MAAM,CAAA;IACZ,OAAO;QACL,GAAG,EAAE,KAAK;QACV,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC9D,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC9D,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC9D,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC9D,CAAC,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC9D,EAAE,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC/D,EAAE,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;QAC/D,EAAE,EAAE,IAAA,wBAAS,EAAC,UAAU,CAAC,GAAG,CAAC,QAAS,CAAC,CAAC,CAAC,CAAC,KAAmB,CAAC,CAAC;KAChE,CAAA;AACH,CAAC;AAjBD,gCAiBC;AAED,SAAS,UAAU,CAAC,CAAa;IAC/B,IAAI,CAAC,GAAG,CAAC,CAAA;IACT,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE;QACjB,CAAC,EAAE,CAAA;KACJ;IACD,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;AACnB,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,qBAAqB,CAAC,CAAa;IACjD,IAAI,GAAG,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAA;IAC1B,OAAO,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE;QAC/B,GAAG,EAAE,CAAA;KACN;IACD,yEAAyE;IACzE,8CAA8C;IAC9C,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAA;AAC/B,CAAC;AARD,sDAQC;AAED;;;;;GAKG;AACH,SAAgB,YAAY,CAAC,OAAoB,EAAE,OAAoB;IACrE,MAAM,GAAG,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,CAAA;IACnE,GAAG,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAA;IACnC,GAAG,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,CAAA;IACpD,OAAO,GAAG,CAAC,MAAqB,CAAA;AAClC,CAAC;AALD,oCAKC;AAED,0CAA0C;AAC1C,SAAgB,KAAK,CAAC,EAA6B,EAAE,EAA6B;IAChF,OAAO,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,MAAM,CAAC,EAAE,CAAE,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC,CAAA;AAC/G,CAAC;AAFD,sBAEC;AAED,SAAgB,MAAM,CAAC,EAA6B,EAAE,EAA6B;IACjF,OAAO,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,MAAM,CAAC,EAAE,CAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC,CAAA;AAChH,CAAC;AAFD,wBAEC;AAED,SAAS,MAAM,CAAC,mBAA2B;IACzC,IAAI,CAAC,mBAAmB,IAAI,mBAAmB,KAAK,CAAC,EAAE;QACrD,OAAO,IAAI,CAAA;KACZ;IACD,IAAI,mBAAmB,IAAI,QAAQ,IAAI,mBAAmB,GAAG,QAAQ,EAAE;QACrE,OAAO,EAAE,CAAC,EAAE,GAAG,mBAAmB,EAAE,UAAU,CAAC,CAAA;KAChD;SAAM,IAAI,mBAAmB,IAAI,cAAc,EAAE;QAChD,OAAO,EAAE,CAAC,EAAE,GAAG,mBAAmB,EAAE,gBAAgB,CAAC,CAAA;KACtD;SAAM;QACL,OAAO,EAAE,CAAC,mBAAmB,CAAC,CAAA;KAC/B;AACH,CAAC;AAED;;;;;;GAMG;AACH,SAAsB,KAAK,CAAC,GAAQ,EAAE,OAAiE,EAAE,IAAmB;;QAC1H,MAAM,MAAM,GAAG,CAAC,CAAC,IAAI,CACnB,GAAG,EACH,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CACrC,CAAA;QACD,GAAG,CAAC,aAAa,GAAG,IAAA,kBAAG,EAAC,IAAA,wBAAS,EAAC,MAAM,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACzD,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAEjD,MAAM,IAAI;aACP,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;aAC9B,MAAM,CAAC,CAAO,IAAmB,EAAE,CAAM,EAAE,EAAE;YAC5C,MAAM,IAAI,CAAA;YACV,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YAC5B,MAAM,EAAE,GAAG,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YAElC,MAAM,MAAM,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAO,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YACzI,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,EAAE,MAAM,CAAC,CAAA;QACxB,CAAC,CAAA,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAA;QAEvB,OAAO,GAAG,CAAA;IACZ,CAAC;CAAA;AApBD,sBAoBC;AAED;;;;;GAKG;AACH,SAAsB,OAAO,CAAC,GAAQ,EAAE,SAAkE;;QACxG,MAAM,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAO,IAAmB,EAAE,CAAM,EAAE,EAAE;YAClE,MAAM,IAAI,CAAA;YACV,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE;gBACzB,MAAO,GAAG,CAAC,CAAC,CAAgB;qBACzB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,CAAC;qBAClD,MAAM,CAAC,CAAO,IAAmB,EAAE,EAAO,EAAE,EAAE;oBAC7C,MAAM,IAAI,CAAA;oBACV,MAAM,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,CAAA;gBAC9B,CAAC,CAAA,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAA;aACxB;QACH,CAAC,CAAA,EAAE,OAAO,CAAC,OAAO,EAAE,CAAC,CAAA;QACrB,IAAI,GAAG,CAAC,aAAa,EAAE;YACrB,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,MAAM,SAAS,CAAC,IAAA,wBAAS,EAAC,IAAA,kBAAG,EAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAA;SACvE;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;CAAA;AAhBD,0BAgBC;AAED;;;;GAIG;AACH,SAAgB,wBAAwB,CAAC,aAAyB;IAChE,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,uEAAuE,CAAC,CAAA;IAClI,OAAO;QACL,UAAU,EAAE,aAAa;QACzB,SAAS,EAAE,SAAS,CAAC,IAAA,qBAAM,EAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC;KACtD,CAAA;AACH,CAAC;AAND,4DAMC","sourcesContent":["import * as mm from 'moment'\nimport { Moment } from 'moment'\nimport * as _ from 'lodash'\nimport { a2b, b2a, b64Url2ua, hex2ua, string2ua, ua2b64Url, ua2hex, ua2string } from '../utils/binary-utils'\nimport { pack } from './asn1-packer'\nimport { parseAsn1 } from './asn1-parser'\nimport { KeyPair } from '../crypto/RSA'\n\nexport function notConcurrent<T>(concurrencyMap: { [key: string]: PromiseLike<any> }, key: string, proc: () => PromiseLike<T>): PromiseLike<T> {\n  const inFlight = concurrencyMap[key]\n  if (!inFlight) {\n    const newJob = (async () => {\n      try {\n        return await proc()\n      } finally {\n        delete concurrencyMap[key]\n      }\n    })()\n    concurrencyMap[key] = newJob\n    return newJob\n  } else {\n    return concurrencyMap[key].then(() => notConcurrent(concurrencyMap, key, proc))\n  }\n}\n\nexport function jwk2pkcs8(jwk: any): string {\n  return pack([\n    0x30,\n    [\n      [0x02, '00'],\n      [0x30, [[0x06, '2a864886f70d010101'], [0x05]]], // pragma: allowlist secret\n      [\n        0x04,\n        [\n          [\n            0x30,\n            [\n              [0x02, '00'],\n              [0x02, ua2hex(b64Url2ua(jwk.n))],\n              [0x02, ua2hex(b64Url2ua(jwk.e))],\n              [0x02, ua2hex(b64Url2ua(jwk.d))],\n              [0x02, ua2hex(b64Url2ua(jwk.p))],\n              [0x02, ua2hex(b64Url2ua(jwk.q))],\n              [0x02, ua2hex(b64Url2ua(jwk.dp))],\n              [0x02, ua2hex(b64Url2ua(jwk.dq))],\n              [0x02, ua2hex(b64Url2ua(jwk.qi))],\n            ],\n          ],\n        ],\n      ],\n    ],\n  ])\n}\n\nexport function jwk2spki(jwk: any): string {\n  return pack([\n    0x30,\n    [\n      [0x30, [[0x06, '2a864886f70d010101'], [0x05]]], // pragma: allowlist secret\n      [\n        0x03,\n        [\n          [\n            0x30,\n            [\n              [0x02, ua2hex(b64Url2ua(jwk.n))],\n              [0x02, ua2hex(b64Url2ua(jwk.e))],\n            ],\n          ],\n        ],\n      ],\n    ],\n  ])\n}\n\nexport function spkiToJwk(buf: Uint8Array): { kty: string; alg: string; n: string; e: string; ext: boolean } {\n  const asn1 = parseAsn1(new Uint8Array(buf))\n\n  var modulus: Uint8Array | undefined = undefined\n  var exponent: Uint8Array | undefined = undefined\n  if (\n    asn1.type === 0x30 &&\n    asn1.children?.[0]?.type === 0x30 &&\n    asn1.children?.[0]?.children?.[0]?.type === 0x06 &&\n    ua2hex(asn1.children?.[0]?.children?.[0]?.value ?? new Uint8Array(0)) === '2a864886f70d010101' // pragma: allowlist secret\n  ) {\n    modulus = asn1.children?.[1]?.children?.[0]?.children?.[0]?.value\n    exponent = asn1.children?.[1]?.children?.[0]?.children?.[1]?.value\n  } else if (asn1.type === 0x30 && asn1.children?.[0]?.type === 0x02 && asn1.children?.[1]?.type === 0x02) {\n    modulus = asn1.children?.[0]?.value\n    exponent = asn1.children?.[1]?.value\n  }\n\n  if (!modulus || !exponent) {\n    throw new Error('Invalid spki format')\n  }\n  return {\n    kty: 'RSA',\n    alg: 'RSA-OAEP',\n    ext: true,\n    n: ua2b64Url(minimalRep(modulus)),\n    e: ua2b64Url(minimalRep(exponent)),\n  }\n}\n\nexport function pkcs8ToJwk(buf: Uint8Array | ArrayBuffer) {\n  const parsed = parseAsn1(new Uint8Array(buf))\n  const seq =\n    parsed.children?.length === 3 && parsed.children[2].type === 0x04 && parsed.children[2].children?.length === 1\n      ? parsed.children[2].children[0]\n      : parsed\n  return {\n    kty: 'RSA',\n    n: ua2b64Url(minimalRep(seq.children![1].value as Uint8Array)),\n    e: ua2b64Url(minimalRep(seq.children![2].value as Uint8Array)),\n    d: ua2b64Url(minimalRep(seq.children![3].value as Uint8Array)),\n    p: ua2b64Url(minimalRep(seq.children![4].value as Uint8Array)),\n    q: ua2b64Url(minimalRep(seq.children![5].value as Uint8Array)),\n    dp: ua2b64Url(minimalRep(seq.children![6].value as Uint8Array)),\n    dq: ua2b64Url(minimalRep(seq.children![7].value as Uint8Array)),\n    qi: ua2b64Url(minimalRep(seq.children![8].value as Uint8Array)),\n  }\n}\n\nfunction minimalRep(b: Uint8Array) {\n  let i = 0\n  while (b[i] === 0) {\n    i++\n  }\n  return b.slice(i)\n}\n\n/**\n * Provide a view over the given Uint8Array where any trailing null bytes at\n * the end are truncated.\n *\n * This can be used to ignore null bytes at the end of a padded UTF-8 string\n * without needing to copy that string, assuming code point U+0000 is encoded\n * in one null byte according to standards rather than in a multi-byte\n * overlong form.\n */\nexport function truncateTrailingNulls(a: Uint8Array) {\n  let end = a.byteLength - 1\n  while (a[end] === 0 && end >= 0) {\n    end--\n  }\n  // end is now either the last non-null position in a or -1; in the latter\n  // case the returned array will have length 0.\n  return a.subarray(0, end + 1)\n}\n\n/**\n *\n * @param buffer1 {Uint8Array}\n * @param buffer2{ Uint8Array}\n * @returns {ArrayBuffer}\n */\nexport function appendBuffer(buffer1: ArrayBuffer, buffer2: ArrayBuffer): ArrayBuffer {\n  const tmp = new Uint8Array(buffer1.byteLength + buffer2.byteLength)\n  tmp.set(new Uint8Array(buffer1), 0)\n  tmp.set(new Uint8Array(buffer2), buffer1.byteLength)\n  return tmp.buffer as ArrayBuffer\n}\n\n//Convenience methods for dates management\nexport function after(d1: number | null | undefined, d2: number | null | undefined): boolean {\n  return d1 === null || d2 === null || d1 === undefined || d2 === undefined || moment(d1)!.isAfter(moment(d2)!)\n}\n\nexport function before(d1: number | null | undefined, d2: number | null | undefined): boolean {\n  return d1 === null || d2 === null || d1 === undefined || d2 === undefined || moment(d1)!.isBefore(moment(d2)!)\n}\n\nfunction moment(epochOrLongCalendar: number): Moment | null {\n  if (!epochOrLongCalendar && epochOrLongCalendar !== 0) {\n    return null\n  }\n  if (epochOrLongCalendar >= 18000101 && epochOrLongCalendar < 25400000) {\n    return mm('' + epochOrLongCalendar, 'YYYYMMDD')\n  } else if (epochOrLongCalendar >= 18000101000000) {\n    return mm('' + epochOrLongCalendar, 'YYYYMMDDHHmmss')\n  } else {\n    return mm(epochOrLongCalendar)\n  }\n}\n\n/**\n * Encrypt object graph recursively\n *\n * @param obj the object to encrypt\n * @param cryptor the cryptor function (returns a promise)\n * @param keys the keys to be crypted: ex for a Patient ['note', 'addresses.*.[\"street\", \"houseNumber\", \"telecoms.*.telecomNumber\"]']\n */\nexport async function crypt(obj: any, cryptor: (obj: { [key: string]: string }) => Promise<ArrayBuffer>, keys: Array<string>) {\n  const subObj = _.pick(\n    obj,\n    keys.filter((k) => !k.includes('*'))\n  )\n  obj.encryptedSelf = b2a(ua2string(await cryptor(subObj)))\n  Object.keys(subObj).forEach((k) => delete obj[k])\n\n  await keys\n    .filter((k) => k.includes('*'))\n    .reduce(async (prev: Promise<void>, k: any) => {\n      await prev\n      const k1 = k.split('.*.')[0]\n      const k2 = k.substr(k1.length + 3)\n\n      const mapped = await Promise.all((_.get(obj, k1) || []).map((so: any) => crypt(so, cryptor, k2.startsWith('[') ? JSON.parse(k2) : [k2])))\n      _.set(obj, k1, mapped)\n    }, Promise.resolve())\n\n  return obj\n}\n\n/**\n * Decrypt object graph recursively\n *\n * @param obj the object to encrypt\n * @param decryptor the decryptor function (returns a promise)\n */\nexport async function decrypt(obj: any, decryptor: (obj: Uint8Array) => Promise<{ [key: string]: string }>) {\n  await Object.keys(obj).reduce(async (prev: Promise<void>, k: any) => {\n    await prev\n    if (Array.isArray(obj[k])) {\n      await (obj[k] as Array<any>)\n        .filter((o) => typeof o === 'object' && o !== null)\n        .reduce(async (prev: Promise<void>, so: any) => {\n          await prev\n          await decrypt(so, decryptor)\n        }, Promise.resolve())\n    }\n  }, Promise.resolve())\n  if (obj.encryptedSelf) {\n    Object.assign(obj, await decryptor(string2ua(a2b(obj.encryptedSelf))))\n  }\n  return obj\n}\n\n/**\n * Extracts the full jwk key pair from the jwk representation of the private key.\n * @param privateKeyJwk private key in jwk representation\n * @throws if the key is missing the public modulus or public exponent.\n */\nexport function keyPairFromPrivateKeyJwk(privateKeyJwk: JsonWebKey): KeyPair<JsonWebKey> {\n  if (!privateKeyJwk.n || !privateKeyJwk.e) throw new Error('Incomplete private JsonWebKey: missing public modulus and/or exponent')\n  return {\n    privateKey: privateKeyJwk,\n    publicKey: spkiToJwk(hex2ua(jwk2spki(privateKeyJwk))),\n  }\n}\n"]}

package/icc-x-api/utils/graph-utils.d.ts

@@ -0,0 +1,45 @@
+/**
+ * @internal
+ * Represents a graph. Each node is associated to a set of nodes that can be directly reached from it in a single step.
+ */
+export type Graph = {
+    [node: string]: Set<string>;
+};
+/**
+ * @internal
+ * Represents from which all cycles have been removed using strongly connected components. Also holds information on all groups.
+ */
+export type StronglyConnectedGraph = {
+    acyclicGraph: Graph;
+    originalLabelToAcyclicLabel: {
+        [originalLabel: string]: string;
+    };
+    acyclicLabelToGroup: {
+        [newLabel: string]: string[];
+    };
+};
+/**
+ * @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.
+ */
+export declare function graphFromEdges(edges: [string, string][], additionalNodes?: string[]): Graph;
+/**
+ * @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.
+ */
+export declare function reachSetsAcyclic(graph: Graph): {
+    [node: string]: Set<string>;
+};
+/**
+ * @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
+ */
+export declare function acyclic(graph: Graph): StronglyConnectedGraph;

package/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/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/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;
+}