@natlibfi/melinda-record-matching 2.2.1-alpha.2 → 2.2.1

package/dist/match-detection/features/bib/title.js

@@ -4,15 +4,10 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.default = void 0;
-
 var _debug = _interopRequireDefault(require("debug"));
-
 var _natural = require("natural");
-
 var _matchingUtils = require("../../../matching-utils");
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
 /**
 *
 * @licstart  The following is the entire license notice for the JavaScript code in this file.
@@ -39,23 +34,18 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { de
 * @licend  The above is the entire license notice
 * for the JavaScript code in this file.
 *
-*/
-var _default = ({
+*/var _default = ({
   treshold = 10
 } = {}) => ({
   name: 'Title',
   extract: record => {
     const title = getTitle();
-
     if ((0, _matchingUtils.testStringOrNumber)(title)) {
       return [String(title).replace(/[^\p{Letter}\p{Number}]/gu, '').toLowerCase()];
     }
-
     return [];
-
     function getTitle() {
       const [field] = record.get(/^245$/u);
-
       if (field) {
         return field.subfields.filter(({
           code
@@ -63,33 +53,26 @@ var _default = ({
           value
         }) => (0, _matchingUtils.testStringOrNumber)(value) ? String(value) : '').join('');
       }
-
       return false;
     }
   },
   compare: (a, b) => {
     const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:match-detection:features/bib/title');
     const distance = (0, _natural.LevenshteinDistance)(a[0], b[0]);
-
     if (distance === 0) {
       return 0.5;
     }
-
     const maxLength = getMaxLength();
     const percentage = distance / maxLength * 100;
     debug(`'${a}' vs '${b}': Max length = ${maxLength}, distance = ${distance}, percentage = ${percentage}`);
-
     if (percentage <= treshold) {
       return 0.3;
     }
-
     return -0.5;
-
     function getMaxLength() {
       return a[0].length > b[0].length ? a[0].length : b[0].length;
     }
   }
 });
-
 exports.default = _default;
 //# sourceMappingURL=title.js.map

package/dist/match-detection/features/bib/title.js.map

@@ -1 +1 @@
-{"version":3,"file":"title.js","names":["treshold","name","extract","record","title","getTitle","testStringOrNumber","String","replace","toLowerCase","field","get","subfields","filter","code","includes","map","value","join","compare","a","b","debug","createDebugLogger","distance","leven","maxLength","getMaxLength","percentage","length"],"sources":["../../../../src/match-detection/features/bib/title.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport {LevenshteinDistance as leven} from 'natural';\nimport {testStringOrNumber} from '../../../matching-utils';\n\nexport default ({treshold = 10} = {}) => ({\n  name: 'Title',\n  extract: record => {\n    const title = getTitle();\n\n    if (testStringOrNumber(title)) {\n      return [String(title).replace(/[^\\p{Letter}\\p{Number}]/gu, '').toLowerCase()];\n    }\n\n    return [];\n\n    function getTitle() {\n      const [field] = record.get(/^245$/u);\n\n      if (field) {\n        return field.subfields\n          .filter(({code}) => ['a', 'b'].includes(code))\n          .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n          .join('');\n      }\n      return false;\n    }\n  },\n  compare: (a, b) => {\n    const debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features/bib/title');\n    const distance = leven(a[0], b[0]);\n\n    if (distance === 0) {\n      return 0.5;\n    }\n\n    const maxLength = getMaxLength();\n    const percentage = distance / maxLength * 100;\n\n    debug(`'${a}' vs '${b}': Max length = ${maxLength}, distance = ${distance}, percentage = ${percentage}`);\n\n    if (percentage <= treshold) {\n      return 0.3;\n    }\n\n    return -0.5;\n\n    function getMaxLength() {\n      return a[0].length > b[0].length ? a[0].length : b[0].length;\n    }\n\n  }\n});\n"],"mappings":";;;;;;;AA4BA;;AACA;;AACA;;;;AA9BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;eAMe,CAAC;EAACA,QAAQ,GAAG;AAAZ,IAAkB,EAAnB,MAA2B;EACxCC,IAAI,EAAE,OADkC;EAExCC,OAAO,EAAEC,MAAM,IAAI;IACjB,MAAMC,KAAK,GAAGC,QAAQ,EAAtB;;IAEA,IAAI,IAAAC,iCAAA,EAAmBF,KAAnB,CAAJ,EAA+B;MAC7B,OAAO,CAACG,MAAM,CAACH,KAAD,CAAN,CAAcI,OAAd,CAAsB,2BAAtB,EAAmD,EAAnD,EAAuDC,WAAvD,EAAD,CAAP;IACD;;IAED,OAAO,EAAP;;IAEA,SAASJ,QAAT,GAAoB;MAClB,MAAM,CAACK,KAAD,IAAUP,MAAM,CAACQ,GAAP,CAAW,QAAX,CAAhB;;MAEA,IAAID,KAAJ,EAAW;QACT,OAAOA,KAAK,CAACE,SAAN,CACJC,MADI,CACG,CAAC;UAACC;QAAD,CAAD,KAAY,CAAC,GAAD,EAAM,GAAN,EAAWC,QAAX,CAAoBD,IAApB,CADf,EAEJE,GAFI,CAEA,CAAC;UAACC;QAAD,CAAD,KAAa,IAAAX,iCAAA,EAAmBW,KAAnB,IAA4BV,MAAM,CAACU,KAAD,CAAlC,GAA4C,EAFzD,EAGJC,IAHI,CAGC,EAHD,CAAP;MAID;;MACD,OAAO,KAAP;IACD;EACF,CAtBuC;EAuBxCC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;IACjB,MAAMC,KAAK,GAAG,IAAAC,cAAA,EAAkB,sEAAlB,CAAd;IACA,MAAMC,QAAQ,GAAG,IAAAC,4BAAA,EAAML,CAAC,CAAC,CAAD,CAAP,EAAYC,CAAC,CAAC,CAAD,CAAb,CAAjB;;IAEA,IAAIG,QAAQ,KAAK,CAAjB,EAAoB;MAClB,OAAO,GAAP;IACD;;IAED,MAAME,SAAS,GAAGC,YAAY,EAA9B;IACA,MAAMC,UAAU,GAAGJ,QAAQ,GAAGE,SAAX,GAAuB,GAA1C;IAEAJ,KAAK,CAAE,IAAGF,CAAE,SAAQC,CAAE,mBAAkBK,SAAU,gBAAeF,QAAS,kBAAiBI,UAAW,EAAjG,CAAL;;IAEA,IAAIA,UAAU,IAAI5B,QAAlB,EAA4B;MAC1B,OAAO,GAAP;IACD;;IAED,OAAO,CAAC,GAAR;;IAEA,SAAS2B,YAAT,GAAwB;MACtB,OAAOP,CAAC,CAAC,CAAD,CAAD,CAAKS,MAAL,GAAcR,CAAC,CAAC,CAAD,CAAD,CAAKQ,MAAnB,GAA4BT,CAAC,CAAC,CAAD,CAAD,CAAKS,MAAjC,GAA0CR,CAAC,CAAC,CAAD,CAAD,CAAKQ,MAAtD;IACD;EAEF;AA9CuC,CAA3B,C"}
+{"version":3,"file":"title.js","names":["treshold","name","extract","record","title","getTitle","testStringOrNumber","String","replace","toLowerCase","field","get","subfields","filter","code","includes","map","value","join","compare","a","b","debug","createDebugLogger","distance","leven","maxLength","getMaxLength","percentage","length"],"sources":["../../../../src/match-detection/features/bib/title.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport {LevenshteinDistance as leven} from 'natural';\nimport {testStringOrNumber} from '../../../matching-utils';\n\nexport default ({treshold = 10} = {}) => ({\n  name: 'Title',\n  extract: record => {\n    const title = getTitle();\n\n    if (testStringOrNumber(title)) {\n      return [String(title).replace(/[^\\p{Letter}\\p{Number}]/gu, '').toLowerCase()];\n    }\n\n    return [];\n\n    function getTitle() {\n      const [field] = record.get(/^245$/u);\n\n      if (field) {\n        return field.subfields\n          .filter(({code}) => ['a', 'b'].includes(code))\n          .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n          .join('');\n      }\n      return false;\n    }\n  },\n  compare: (a, b) => {\n    const debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features/bib/title');\n    const distance = leven(a[0], b[0]);\n\n    if (distance === 0) {\n      return 0.5;\n    }\n\n    const maxLength = getMaxLength();\n    const percentage = distance / maxLength * 100;\n\n    debug(`'${a}' vs '${b}': Max length = ${maxLength}, distance = ${distance}, percentage = ${percentage}`);\n\n    if (percentage <= treshold) {\n      return 0.3;\n    }\n\n    return -0.5;\n\n    function getMaxLength() {\n      return a[0].length > b[0].length ? a[0].length : b[0].length;\n    }\n\n  }\n});\n"],"mappings":";;;;;;AA4BA;AACA;AACA;AAA2D;AA9B3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EA1BA,eAgCe,CAAC;EAACA,QAAQ,GAAG;AAAE,CAAC,GAAG,CAAC,CAAC,MAAM;EACxCC,IAAI,EAAE,OAAO;EACbC,OAAO,EAAEC,MAAM,IAAI;IACjB,MAAMC,KAAK,GAAGC,QAAQ,EAAE;IAExB,IAAI,IAAAC,iCAAkB,EAACF,KAAK,CAAC,EAAE;MAC7B,OAAO,CAACG,MAAM,CAACH,KAAK,CAAC,CAACI,OAAO,CAAC,2BAA2B,EAAE,EAAE,CAAC,CAACC,WAAW,EAAE,CAAC;IAC/E;IAEA,OAAO,EAAE;IAET,SAASJ,QAAQ,GAAG;MAClB,MAAM,CAACK,KAAK,CAAC,GAAGP,MAAM,CAACQ,GAAG,CAAC,QAAQ,CAAC;MAEpC,IAAID,KAAK,EAAE;QACT,OAAOA,KAAK,CAACE,SAAS,CACnBC,MAAM,CAAC,CAAC;UAACC;QAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAACC,QAAQ,CAACD,IAAI,CAAC,CAAC,CAC7CE,GAAG,CAAC,CAAC;UAACC;QAAK,CAAC,KAAK,IAAAX,iCAAkB,EAACW,KAAK,CAAC,GAAGV,MAAM,CAACU,KAAK,CAAC,GAAG,EAAE,CAAC,CAChEC,IAAI,CAAC,EAAE,CAAC;MACb;MACA,OAAO,KAAK;IACd;EACF,CAAC;EACDC,OAAO,EAAE,CAACC,CAAC,EAAEC,CAAC,KAAK;IACjB,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,sEAAsE,CAAC;IACvG,MAAMC,QAAQ,GAAG,IAAAC,4BAAK,EAACL,CAAC,CAAC,CAAC,CAAC,EAAEC,CAAC,CAAC,CAAC,CAAC,CAAC;IAElC,IAAIG,QAAQ,KAAK,CAAC,EAAE;MAClB,OAAO,GAAG;IACZ;IAEA,MAAME,SAAS,GAAGC,YAAY,EAAE;IAChC,MAAMC,UAAU,GAAGJ,QAAQ,GAAGE,SAAS,GAAG,GAAG;IAE7CJ,KAAK,CAAE,IAAGF,CAAE,SAAQC,CAAE,mBAAkBK,SAAU,gBAAeF,QAAS,kBAAiBI,UAAW,EAAC,CAAC;IAExG,IAAIA,UAAU,IAAI5B,QAAQ,EAAE;MAC1B,OAAO,GAAG;IACZ;IAEA,OAAO,CAAC,GAAG;IAEX,SAAS2B,YAAY,GAAG;MACtB,OAAOP,CAAC,CAAC,CAAC,CAAC,CAACS,MAAM,GAAGR,CAAC,CAAC,CAAC,CAAC,CAACQ,MAAM,GAAGT,CAAC,CAAC,CAAC,CAAC,CAACS,MAAM,GAAGR,CAAC,CAAC,CAAC,CAAC,CAACQ,MAAM;IAC9D;EAEF;AACF,CAAC,CAAC;AAAA"}

package/dist/match-detection/features/index.js

@@ -4,12 +4,8 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.bib = void 0;
-
 var bib = _interopRequireWildcard(require("./bib"));
-
 exports.bib = bib;
-
 function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
-
 function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
 //# sourceMappingURL=index.js.map

package/dist/match-detection/features/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../../src/match-detection/features/index.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport * as bib from './bib';\nexport {bib};\n"],"mappings":";;;;;;;AA4BA"}
+{"version":3,"file":"index.js","names":[],"sources":["../../../src/match-detection/features/index.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport * as bib from './bib';\nexport {bib};\n"],"mappings":";;;;;;AA4BA;AAA6B;AAAA;AAAA"}

package/dist/match-detection/index.js

@@ -4,21 +4,13 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.features = exports.default = void 0;
-
 var _debug = _interopRequireDefault(require("debug"));
-
 var features = _interopRequireWildcard(require("./features"));
-
 exports.features = features;
-
 function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
-
 function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
 /* eslint-disable no-console */
-
 /**
 *
 * @licstart  The following is the entire license notice for the JavaScript code in this file.
@@ -61,14 +53,12 @@ var _default = ({
   const recordsB = Array.isArray(recordB) ? recordB : [recordB];
   const detectionResults = recordsB.map(record => actualDetection(featuresA, record));
   return Array.isArray(recordB) ? detectionResults : detectionResults[0];
-
   function actualDetection(featuresA, record) {
     const featuresB = extractFeatures(record);
     debugData(`Features (a): ${JSON.stringify(featuresA)}`);
     debugData(`Features (b): ${JSON.stringify(featuresB)}`);
     const featurePairs = generateFeaturePairs(featuresA, featuresB);
     const similarityVector = generateSimilarityVector(featurePairs);
-
     if (similarityVector.some(v => v >= minProbabilityQuantifier)) {
       const probability = calculateprobability(similarityVector);
       debug(`probability: ${probability} (Treshold: ${treshold})`);
@@ -77,14 +67,12 @@ var _default = ({
         probability
       });
     }
-
     debugData(`No feature yielded minimum probability amount of points (${minProbabilityQuantifier})`);
     return returnResult({
       match: false,
       probability: 0.0
     });
   }
-
   function extractFeatures(record) {
     return strategy.reduce((acc, {
       name,
@@ -94,7 +82,6 @@ var _default = ({
       value: extract(record)
     }), []);
   }
-
   function returnResult(result) {
     if (returnStrategy) {
       debug(`Returning detection strategy with the result`);
@@ -107,20 +94,16 @@ var _default = ({
       debugData(`${JSON.stringify(resultWithStrategy)}`);
       return resultWithStrategy;
     }
-
     return result;
   }
-
   function formatStrategy(strategy) {
     const strategyNames = strategy.map(element => element.name);
     return strategyNames || [];
   }
-
   function calculateprobability(similarityVector) {
     const probability = similarityVector.reduce((acc, v) => acc + v, 0.0);
     return probability > 1.0 ? 1.0 : probability;
   }
-
   function generateSimilarityVector(featurePairs) {
     const compared = featurePairs.map(({
       name,
@@ -143,13 +126,11 @@ var _default = ({
       points
     }) => points);
   }
-
   function generateFeaturePairs(featuresA, featuresB) {
     const pairs = generatePairs();
     const missingFeatures = findMissing();
     debug(`Not comparing the following features because one, or both records are missing features: ${JSON.stringify(missingFeatures)}`);
     return pairs;
-
     function generatePairs() {
       return featuresA.reduce((acc, {
         name,
@@ -165,11 +146,9 @@ var _default = ({
         if (a.length === 0 || b.length === 0) {
           return false;
         }
-
         return true;
       });
     }
-
     function findMissing() {
       return featuresA.map(({
         name
@@ -179,6 +158,5 @@ var _default = ({
     }
   }
 };
-
 exports.default = _default;
 //# sourceMappingURL=index.js.map

package/dist/match-detection/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":["strategy","treshold","returnStrategy","recordA","recordB","minProbabilityQuantifier","debug","createDebugLogger","debugData","extend","JSON","stringify","featuresA","extractFeatures","Array","isArray","recordsB","detectionResults","map","record","actualDetection","featuresB","featurePairs","generateFeaturePairs","similarityVector","generateSimilarityVector","some","v","probability","calculateprobability","returnResult","match","reduce","acc","name","extract","concat","value","result","resultWithStrategy","formatStrategy","strategyNames","element","compared","a","b","compare","find","featureName","points","pairs","generatePairs","missingFeatures","findMissing","index","filter","length"],"sources":["../../src/match-detection/index.js"],"sourcesContent":["/* eslint-disable no-console */\n/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport * as features from './features';\n\nexport {features};\n\nexport default ({strategy, treshold = 0.9}, returnStrategy = false) => (recordA, recordB) => {\n  const minProbabilityQuantifier = 0.5;\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection');\n  const debugData = debug.extend('data');\n\n  debugData(`Strategy: ${JSON.stringify(strategy)}`);\n  debugData(`Treshold: ${JSON.stringify(treshold)}`);\n  debugData(`ReturnStrategy: ${JSON.stringify(returnStrategy)}`);\n\n  const featuresA = extractFeatures(recordA);\n\n  debug(`We got an array of records: ${Array.isArray(recordB)}`);\n  const recordsB = Array.isArray(recordB) ? recordB : [recordB];\n  const detectionResults = recordsB.map(record => actualDetection(featuresA, record));\n\n  return Array.isArray(recordB) ? detectionResults : detectionResults[0];\n\n  function actualDetection(featuresA, record) {\n\n    const featuresB = extractFeatures(record);\n\n    debugData(`Features (a): ${JSON.stringify(featuresA)}`);\n    debugData(`Features (b): ${JSON.stringify(featuresB)}`);\n\n    const featurePairs = generateFeaturePairs(featuresA, featuresB);\n    const similarityVector = generateSimilarityVector(featurePairs);\n\n    if (similarityVector.some(v => v >= minProbabilityQuantifier)) {\n      const probability = calculateprobability(similarityVector);\n      debug(`probability: ${probability} (Treshold: ${treshold})`);\n      return returnResult({match: probability >= treshold, probability});\n    }\n\n    debugData(`No feature yielded minimum probability amount of points (${minProbabilityQuantifier})`);\n    return returnResult({match: false, probability: 0.0});\n  }\n\n  function extractFeatures(record) {\n    return strategy.reduce((acc, {name, extract}) => acc.concat({name, value: extract(record)}), []);\n  }\n\n  function returnResult(result) {\n    if (returnStrategy) {\n      debug(`Returning detection strategy with the result`);\n      const resultWithStrategy = {match: result.match, probability: result.probability, strategy: formatStrategy(strategy), treshold};\n      debugData(`${JSON.stringify(resultWithStrategy)}`);\n      return resultWithStrategy;\n    }\n    return result;\n  }\n\n  function formatStrategy(strategy) {\n    const strategyNames = strategy.map(element => element.name);\n    return strategyNames || [];\n  }\n\n  function calculateprobability(similarityVector) {\n    const probability = similarityVector.reduce((acc, v) => acc + v, 0.0);\n    return probability > 1.0 ? 1.0 : probability;\n  }\n\n  function generateSimilarityVector(featurePairs) {\n    const compared = featurePairs.map(({name, a, b}) => {\n      const {compare} = strategy.find(({name: featureName}) => name === featureName);\n      const points = compare(a, b);\n      return {name, points};\n    });\n\n    debugData(`Points: ${JSON.stringify(compared)}`);\n    return compared.map(({points}) => points);\n  }\n\n  function generateFeaturePairs(featuresA, featuresB) {\n    const pairs = generatePairs();\n    const missingFeatures = findMissing();\n\n    debug(`Not comparing the following features because one, or both records are missing features: ${JSON.stringify(missingFeatures)}`);\n    return pairs;\n\n    function generatePairs() {\n      return featuresA\n        .reduce((acc, {name, value}, index) => acc.concat({\n          name,\n          a: value,\n          b: featuresB[index].value\n        }), [])\n        .filter(({a, b}) => {\n          if (a.length === 0 || b.length === 0) {\n            return false;\n          }\n\n          return true;\n        });\n    }\n\n    function findMissing() {\n      return featuresA\n        .map(({name}) => name)\n        .filter(v => pairs.some(({name}) => name === v) === false);\n    }\n  }\n\n};\n"],"mappings":";;;;;;;AA6BA;;AACA;;;;;;;;;;AA9BA;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;eAOe,CAAC;EAACA,QAAD;EAAWC,QAAQ,GAAG;AAAtB,CAAD,EAA6BC,cAAc,GAAG,KAA9C,KAAwD,CAACC,OAAD,EAAUC,OAAV,KAAsB;EAC3F,MAAMC,wBAAwB,GAAG,GAAjC;EAEA,MAAMC,KAAK,GAAG,IAAAC,cAAA,EAAkB,mDAAlB,CAAd;EACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;EAEAD,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAL,CAAeX,QAAf,CAAyB,EAAvC,CAAT;EACAQ,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAL,CAAeV,QAAf,CAAyB,EAAvC,CAAT;EACAO,SAAS,CAAE,mBAAkBE,IAAI,CAACC,SAAL,CAAeT,cAAf,CAA+B,EAAnD,CAAT;EAEA,MAAMU,SAAS,GAAGC,eAAe,CAACV,OAAD,CAAjC;EAEAG,KAAK,CAAE,+BAA8BQ,KAAK,CAACC,OAAN,CAAcX,OAAd,CAAuB,EAAvD,CAAL;EACA,MAAMY,QAAQ,GAAGF,KAAK,CAACC,OAAN,CAAcX,OAAd,IAAyBA,OAAzB,GAAmC,CAACA,OAAD,CAApD;EACA,MAAMa,gBAAgB,GAAGD,QAAQ,CAACE,GAAT,CAAaC,MAAM,IAAIC,eAAe,CAACR,SAAD,EAAYO,MAAZ,CAAtC,CAAzB;EAEA,OAAOL,KAAK,CAACC,OAAN,CAAcX,OAAd,IAAyBa,gBAAzB,GAA4CA,gBAAgB,CAAC,CAAD,CAAnE;;EAEA,SAASG,eAAT,CAAyBR,SAAzB,EAAoCO,MAApC,EAA4C;IAE1C,MAAME,SAAS,GAAGR,eAAe,CAACM,MAAD,CAAjC;IAEAX,SAAS,CAAE,iBAAgBE,IAAI,CAACC,SAAL,CAAeC,SAAf,CAA0B,EAA5C,CAAT;IACAJ,SAAS,CAAE,iBAAgBE,IAAI,CAACC,SAAL,CAAeU,SAAf,CAA0B,EAA5C,CAAT;IAEA,MAAMC,YAAY,GAAGC,oBAAoB,CAACX,SAAD,EAAYS,SAAZ,CAAzC;IACA,MAAMG,gBAAgB,GAAGC,wBAAwB,CAACH,YAAD,CAAjD;;IAEA,IAAIE,gBAAgB,CAACE,IAAjB,CAAsBC,CAAC,IAAIA,CAAC,IAAItB,wBAAhC,CAAJ,EAA+D;MAC7D,MAAMuB,WAAW,GAAGC,oBAAoB,CAACL,gBAAD,CAAxC;MACAlB,KAAK,CAAE,gBAAesB,WAAY,eAAc3B,QAAS,GAApD,CAAL;MACA,OAAO6B,YAAY,CAAC;QAACC,KAAK,EAAEH,WAAW,IAAI3B,QAAvB;QAAiC2B;MAAjC,CAAD,CAAnB;IACD;;IAEDpB,SAAS,CAAE,4DAA2DH,wBAAyB,GAAtF,CAAT;IACA,OAAOyB,YAAY,CAAC;MAACC,KAAK,EAAE,KAAR;MAAeH,WAAW,EAAE;IAA5B,CAAD,CAAnB;EACD;;EAED,SAASf,eAAT,CAAyBM,MAAzB,EAAiC;IAC/B,OAAOnB,QAAQ,CAACgC,MAAT,CAAgB,CAACC,GAAD,EAAM;MAACC,IAAD;MAAOC;IAAP,CAAN,KAA0BF,GAAG,CAACG,MAAJ,CAAW;MAACF,IAAD;MAAOG,KAAK,EAAEF,OAAO,CAAChB,MAAD;IAArB,CAAX,CAA1C,EAAsF,EAAtF,CAAP;EACD;;EAED,SAASW,YAAT,CAAsBQ,MAAtB,EAA8B;IAC5B,IAAIpC,cAAJ,EAAoB;MAClBI,KAAK,CAAE,8CAAF,CAAL;MACA,MAAMiC,kBAAkB,GAAG;QAACR,KAAK,EAAEO,MAAM,CAACP,KAAf;QAAsBH,WAAW,EAAEU,MAAM,CAACV,WAA1C;QAAuD5B,QAAQ,EAAEwC,cAAc,CAACxC,QAAD,CAA/E;QAA2FC;MAA3F,CAA3B;MACAO,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAL,CAAe4B,kBAAf,CAAmC,EAAvC,CAAT;MACA,OAAOA,kBAAP;IACD;;IACD,OAAOD,MAAP;EACD;;EAED,SAASE,cAAT,CAAwBxC,QAAxB,EAAkC;IAChC,MAAMyC,aAAa,GAAGzC,QAAQ,CAACkB,GAAT,CAAawB,OAAO,IAAIA,OAAO,CAACR,IAAhC,CAAtB;IACA,OAAOO,aAAa,IAAI,EAAxB;EACD;;EAED,SAASZ,oBAAT,CAA8BL,gBAA9B,EAAgD;IAC9C,MAAMI,WAAW,GAAGJ,gBAAgB,CAACQ,MAAjB,CAAwB,CAACC,GAAD,EAAMN,CAAN,KAAYM,GAAG,GAAGN,CAA1C,EAA6C,GAA7C,CAApB;IACA,OAAOC,WAAW,GAAG,GAAd,GAAoB,GAApB,GAA0BA,WAAjC;EACD;;EAED,SAASH,wBAAT,CAAkCH,YAAlC,EAAgD;IAC9C,MAAMqB,QAAQ,GAAGrB,YAAY,CAACJ,GAAb,CAAiB,CAAC;MAACgB,IAAD;MAAOU,CAAP;MAAUC;IAAV,CAAD,KAAkB;MAClD,MAAM;QAACC;MAAD,IAAY9C,QAAQ,CAAC+C,IAAT,CAAc,CAAC;QAACb,IAAI,EAAEc;MAAP,CAAD,KAAyBd,IAAI,KAAKc,WAAhD,CAAlB;MACA,MAAMC,MAAM,GAAGH,OAAO,CAACF,CAAD,EAAIC,CAAJ,CAAtB;MACA,OAAO;QAACX,IAAD;QAAOe;MAAP,CAAP;IACD,CAJgB,CAAjB;IAMAzC,SAAS,CAAE,WAAUE,IAAI,CAACC,SAAL,CAAegC,QAAf,CAAyB,EAArC,CAAT;IACA,OAAOA,QAAQ,CAACzB,GAAT,CAAa,CAAC;MAAC+B;IAAD,CAAD,KAAcA,MAA3B,CAAP;EACD;;EAED,SAAS1B,oBAAT,CAA8BX,SAA9B,EAAyCS,SAAzC,EAAoD;IAClD,MAAM6B,KAAK,GAAGC,aAAa,EAA3B;IACA,MAAMC,eAAe,GAAGC,WAAW,EAAnC;IAEA/C,KAAK,CAAE,2FAA0FI,IAAI,CAACC,SAAL,CAAeyC,eAAf,CAAgC,EAA5H,CAAL;IACA,OAAOF,KAAP;;IAEA,SAASC,aAAT,GAAyB;MACvB,OAAOvC,SAAS,CACboB,MADI,CACG,CAACC,GAAD,EAAM;QAACC,IAAD;QAAOG;MAAP,CAAN,EAAqBiB,KAArB,KAA+BrB,GAAG,CAACG,MAAJ,CAAW;QAChDF,IADgD;QAEhDU,CAAC,EAAEP,KAF6C;QAGhDQ,CAAC,EAAExB,SAAS,CAACiC,KAAD,CAAT,CAAiBjB;MAH4B,CAAX,CADlC,EAKD,EALC,EAMJkB,MANI,CAMG,CAAC;QAACX,CAAD;QAAIC;MAAJ,CAAD,KAAY;QAClB,IAAID,CAAC,CAACY,MAAF,KAAa,CAAb,IAAkBX,CAAC,CAACW,MAAF,KAAa,CAAnC,EAAsC;UACpC,OAAO,KAAP;QACD;;QAED,OAAO,IAAP;MACD,CAZI,CAAP;IAaD;;IAED,SAASH,WAAT,GAAuB;MACrB,OAAOzC,SAAS,CACbM,GADI,CACA,CAAC;QAACgB;MAAD,CAAD,KAAYA,IADZ,EAEJqB,MAFI,CAEG5B,CAAC,IAAIuB,KAAK,CAACxB,IAAN,CAAW,CAAC;QAACQ;MAAD,CAAD,KAAYA,IAAI,KAAKP,CAAhC,MAAuC,KAF/C,CAAP;IAGD;EACF;AAEF,C"}
+{"version":3,"file":"index.js","names":["strategy","treshold","returnStrategy","recordA","recordB","minProbabilityQuantifier","debug","createDebugLogger","debugData","extend","JSON","stringify","featuresA","extractFeatures","Array","isArray","recordsB","detectionResults","map","record","actualDetection","featuresB","featurePairs","generateFeaturePairs","similarityVector","generateSimilarityVector","some","v","probability","calculateprobability","returnResult","match","reduce","acc","name","extract","concat","value","result","resultWithStrategy","formatStrategy","strategyNames","element","compared","a","b","compare","find","featureName","points","pairs","generatePairs","missingFeatures","findMissing","index","filter","length"],"sources":["../../src/match-detection/index.js"],"sourcesContent":["/* eslint-disable no-console */\n/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport * as features from './features';\n\nexport {features};\n\nexport default ({strategy, treshold = 0.9}, returnStrategy = false) => (recordA, recordB) => {\n  const minProbabilityQuantifier = 0.5;\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection');\n  const debugData = debug.extend('data');\n\n  debugData(`Strategy: ${JSON.stringify(strategy)}`);\n  debugData(`Treshold: ${JSON.stringify(treshold)}`);\n  debugData(`ReturnStrategy: ${JSON.stringify(returnStrategy)}`);\n\n  const featuresA = extractFeatures(recordA);\n\n  debug(`We got an array of records: ${Array.isArray(recordB)}`);\n  const recordsB = Array.isArray(recordB) ? recordB : [recordB];\n  const detectionResults = recordsB.map(record => actualDetection(featuresA, record));\n\n  return Array.isArray(recordB) ? detectionResults : detectionResults[0];\n\n  function actualDetection(featuresA, record) {\n\n    const featuresB = extractFeatures(record);\n\n    debugData(`Features (a): ${JSON.stringify(featuresA)}`);\n    debugData(`Features (b): ${JSON.stringify(featuresB)}`);\n\n    const featurePairs = generateFeaturePairs(featuresA, featuresB);\n    const similarityVector = generateSimilarityVector(featurePairs);\n\n    if (similarityVector.some(v => v >= minProbabilityQuantifier)) {\n      const probability = calculateprobability(similarityVector);\n      debug(`probability: ${probability} (Treshold: ${treshold})`);\n      return returnResult({match: probability >= treshold, probability});\n    }\n\n    debugData(`No feature yielded minimum probability amount of points (${minProbabilityQuantifier})`);\n    return returnResult({match: false, probability: 0.0});\n  }\n\n  function extractFeatures(record) {\n    return strategy.reduce((acc, {name, extract}) => acc.concat({name, value: extract(record)}), []);\n  }\n\n  function returnResult(result) {\n    if (returnStrategy) {\n      debug(`Returning detection strategy with the result`);\n      const resultWithStrategy = {match: result.match, probability: result.probability, strategy: formatStrategy(strategy), treshold};\n      debugData(`${JSON.stringify(resultWithStrategy)}`);\n      return resultWithStrategy;\n    }\n    return result;\n  }\n\n  function formatStrategy(strategy) {\n    const strategyNames = strategy.map(element => element.name);\n    return strategyNames || [];\n  }\n\n  function calculateprobability(similarityVector) {\n    const probability = similarityVector.reduce((acc, v) => acc + v, 0.0);\n    return probability > 1.0 ? 1.0 : probability;\n  }\n\n  function generateSimilarityVector(featurePairs) {\n    const compared = featurePairs.map(({name, a, b}) => {\n      const {compare} = strategy.find(({name: featureName}) => name === featureName);\n      const points = compare(a, b);\n      return {name, points};\n    });\n\n    debugData(`Points: ${JSON.stringify(compared)}`);\n    return compared.map(({points}) => points);\n  }\n\n  function generateFeaturePairs(featuresA, featuresB) {\n    const pairs = generatePairs();\n    const missingFeatures = findMissing();\n\n    debug(`Not comparing the following features because one, or both records are missing features: ${JSON.stringify(missingFeatures)}`);\n    return pairs;\n\n    function generatePairs() {\n      return featuresA\n        .reduce((acc, {name, value}, index) => acc.concat({\n          name,\n          a: value,\n          b: featuresB[index].value\n        }), [])\n        .filter(({a, b}) => {\n          if (a.length === 0 || b.length === 0) {\n            return false;\n          }\n\n          return true;\n        });\n    }\n\n    function findMissing() {\n      return featuresA\n        .map(({name}) => name)\n        .filter(v => pairs.some(({name}) => name === v) === false);\n    }\n  }\n\n};\n"],"mappings":";;;;;;AA6BA;AACA;AAAuC;AAAA;AAAA;AAAA;AA9BvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AA1BA,eAiCe,CAAC;EAACA,QAAQ;EAAEC,QAAQ,GAAG;AAAG,CAAC,EAAEC,cAAc,GAAG,KAAK,KAAK,CAACC,OAAO,EAAEC,OAAO,KAAK;EAC3F,MAAMC,wBAAwB,GAAG,GAAG;EAEpC,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,mDAAmD,CAAC;EACpF,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EAEtCD,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAS,CAACX,QAAQ,CAAE,EAAC,CAAC;EAClDQ,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAS,CAACV,QAAQ,CAAE,EAAC,CAAC;EAClDO,SAAS,CAAE,mBAAkBE,IAAI,CAACC,SAAS,CAACT,cAAc,CAAE,EAAC,CAAC;EAE9D,MAAMU,SAAS,GAAGC,eAAe,CAACV,OAAO,CAAC;EAE1CG,KAAK,CAAE,+BAA8BQ,KAAK,CAACC,OAAO,CAACX,OAAO,CAAE,EAAC,CAAC;EAC9D,MAAMY,QAAQ,GAAGF,KAAK,CAACC,OAAO,CAACX,OAAO,CAAC,GAAGA,OAAO,GAAG,CAACA,OAAO,CAAC;EAC7D,MAAMa,gBAAgB,GAAGD,QAAQ,CAACE,GAAG,CAACC,MAAM,IAAIC,eAAe,CAACR,SAAS,EAAEO,MAAM,CAAC,CAAC;EAEnF,OAAOL,KAAK,CAACC,OAAO,CAACX,OAAO,CAAC,GAAGa,gBAAgB,GAAGA,gBAAgB,CAAC,CAAC,CAAC;EAEtE,SAASG,eAAe,CAACR,SAAS,EAAEO,MAAM,EAAE;IAE1C,MAAME,SAAS,GAAGR,eAAe,CAACM,MAAM,CAAC;IAEzCX,SAAS,CAAE,iBAAgBE,IAAI,CAACC,SAAS,CAACC,SAAS,CAAE,EAAC,CAAC;IACvDJ,SAAS,CAAE,iBAAgBE,IAAI,CAACC,SAAS,CAACU,SAAS,CAAE,EAAC,CAAC;IAEvD,MAAMC,YAAY,GAAGC,oBAAoB,CAACX,SAAS,EAAES,SAAS,CAAC;IAC/D,MAAMG,gBAAgB,GAAGC,wBAAwB,CAACH,YAAY,CAAC;IAE/D,IAAIE,gBAAgB,CAACE,IAAI,CAACC,CAAC,IAAIA,CAAC,IAAItB,wBAAwB,CAAC,EAAE;MAC7D,MAAMuB,WAAW,GAAGC,oBAAoB,CAACL,gBAAgB,CAAC;MAC1DlB,KAAK,CAAE,gBAAesB,WAAY,eAAc3B,QAAS,GAAE,CAAC;MAC5D,OAAO6B,YAAY,CAAC;QAACC,KAAK,EAAEH,WAAW,IAAI3B,QAAQ;QAAE2B;MAAW,CAAC,CAAC;IACpE;IAEApB,SAAS,CAAE,4DAA2DH,wBAAyB,GAAE,CAAC;IAClG,OAAOyB,YAAY,CAAC;MAACC,KAAK,EAAE,KAAK;MAAEH,WAAW,EAAE;IAAG,CAAC,CAAC;EACvD;EAEA,SAASf,eAAe,CAACM,MAAM,EAAE;IAC/B,OAAOnB,QAAQ,CAACgC,MAAM,CAAC,CAACC,GAAG,EAAE;MAACC,IAAI;MAAEC;IAAO,CAAC,KAAKF,GAAG,CAACG,MAAM,CAAC;MAACF,IAAI;MAAEG,KAAK,EAAEF,OAAO,CAAChB,MAAM;IAAC,CAAC,CAAC,EAAE,EAAE,CAAC;EAClG;EAEA,SAASW,YAAY,CAACQ,MAAM,EAAE;IAC5B,IAAIpC,cAAc,EAAE;MAClBI,KAAK,CAAE,8CAA6C,CAAC;MACrD,MAAMiC,kBAAkB,GAAG;QAACR,KAAK,EAAEO,MAAM,CAACP,KAAK;QAAEH,WAAW,EAAEU,MAAM,CAACV,WAAW;QAAE5B,QAAQ,EAAEwC,cAAc,CAACxC,QAAQ,CAAC;QAAEC;MAAQ,CAAC;MAC/HO,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAS,CAAC4B,kBAAkB,CAAE,EAAC,CAAC;MAClD,OAAOA,kBAAkB;IAC3B;IACA,OAAOD,MAAM;EACf;EAEA,SAASE,cAAc,CAACxC,QAAQ,EAAE;IAChC,MAAMyC,aAAa,GAAGzC,QAAQ,CAACkB,GAAG,CAACwB,OAAO,IAAIA,OAAO,CAACR,IAAI,CAAC;IAC3D,OAAOO,aAAa,IAAI,EAAE;EAC5B;EAEA,SAASZ,oBAAoB,CAACL,gBAAgB,EAAE;IAC9C,MAAMI,WAAW,GAAGJ,gBAAgB,CAACQ,MAAM,CAAC,CAACC,GAAG,EAAEN,CAAC,KAAKM,GAAG,GAAGN,CAAC,EAAE,GAAG,CAAC;IACrE,OAAOC,WAAW,GAAG,GAAG,GAAG,GAAG,GAAGA,WAAW;EAC9C;EAEA,SAASH,wBAAwB,CAACH,YAAY,EAAE;IAC9C,MAAMqB,QAAQ,GAAGrB,YAAY,CAACJ,GAAG,CAAC,CAAC;MAACgB,IAAI;MAAEU,CAAC;MAAEC;IAAC,CAAC,KAAK;MAClD,MAAM;QAACC;MAAO,CAAC,GAAG9C,QAAQ,CAAC+C,IAAI,CAAC,CAAC;QAACb,IAAI,EAAEc;MAAW,CAAC,KAAKd,IAAI,KAAKc,WAAW,CAAC;MAC9E,MAAMC,MAAM,GAAGH,OAAO,CAACF,CAAC,EAAEC,CAAC,CAAC;MAC5B,OAAO;QAACX,IAAI;QAAEe;MAAM,CAAC;IACvB,CAAC,CAAC;IAEFzC,SAAS,CAAE,WAAUE,IAAI,CAACC,SAAS,CAACgC,QAAQ,CAAE,EAAC,CAAC;IAChD,OAAOA,QAAQ,CAACzB,GAAG,CAAC,CAAC;MAAC+B;IAAM,CAAC,KAAKA,MAAM,CAAC;EAC3C;EAEA,SAAS1B,oBAAoB,CAACX,SAAS,EAAES,SAAS,EAAE;IAClD,MAAM6B,KAAK,GAAGC,aAAa,EAAE;IAC7B,MAAMC,eAAe,GAAGC,WAAW,EAAE;IAErC/C,KAAK,CAAE,2FAA0FI,IAAI,CAACC,SAAS,CAACyC,eAAe,CAAE,EAAC,CAAC;IACnI,OAAOF,KAAK;IAEZ,SAASC,aAAa,GAAG;MACvB,OAAOvC,SAAS,CACboB,MAAM,CAAC,CAACC,GAAG,EAAE;QAACC,IAAI;QAAEG;MAAK,CAAC,EAAEiB,KAAK,KAAKrB,GAAG,CAACG,MAAM,CAAC;QAChDF,IAAI;QACJU,CAAC,EAAEP,KAAK;QACRQ,CAAC,EAAExB,SAAS,CAACiC,KAAK,CAAC,CAACjB;MACtB,CAAC,CAAC,EAAE,EAAE,CAAC,CACNkB,MAAM,CAAC,CAAC;QAACX,CAAC;QAAEC;MAAC,CAAC,KAAK;QAClB,IAAID,CAAC,CAACY,MAAM,KAAK,CAAC,IAAIX,CAAC,CAACW,MAAM,KAAK,CAAC,EAAE;UACpC,OAAO,KAAK;QACd;QAEA,OAAO,IAAI;MACb,CAAC,CAAC;IACN;IAEA,SAASH,WAAW,GAAG;MACrB,OAAOzC,SAAS,CACbM,GAAG,CAAC,CAAC;QAACgB;MAAI,CAAC,KAAKA,IAAI,CAAC,CACrBqB,MAAM,CAAC5B,CAAC,IAAIuB,KAAK,CAACxB,IAAI,CAAC,CAAC;QAACQ;MAAI,CAAC,KAAKA,IAAI,KAAKP,CAAC,CAAC,KAAK,KAAK,CAAC;IAC9D;EACF;AAEF,CAAC;AAAA"}

package/dist/match-detection/index.spec.js

@@ -1,27 +1,16 @@
 "use strict";
 
 var _fixugen = _interopRequireDefault(require("@natlibfi/fixugen"));
-
 var _fixura = require("@natlibfi/fixura");
-
 var _chai = require("chai");
-
 var _marcRecord = require("@natlibfi/marc-record");
-
 var features = _interopRequireWildcard(require("./features"));
-
 var _ = _interopRequireDefault(require("."));
-
 var _util = require("util");
-
 var _debug = _interopRequireDefault(require("debug"));
-
 function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
-
 function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
 /**
 *
 * @licstart  The following is the entire license notice for the JavaScript code in this file.
@@ -49,6 +38,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { de
 * for the JavaScript code in this file.
 *
 */
+
 const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:match-detection:test');
 const debugData = debug.extend('data');
 describe('match-detection', () => {
@@ -70,7 +60,6 @@ describe('match-detection', () => {
         debug(`*** DISABLED TEST! ***`);
         return;
       }
-
       const detect = (0, _.default)(formatOptions());
       const recordA = new _marcRecord.MarcRecord(getFixture('recordA.json'), {
         subfieldValues: false
@@ -86,10 +75,10 @@ describe('match-detection', () => {
       const results = detect(recordA, recordB);
       debugData(`${JSON.stringify(results)}`);
       (0, _chai.expect)(results).to.eql(expectedResults);
-
       function formatOptions() {
         const contextFeatures = features[options.strategy.type];
-        return { ...options,
+        return {
+          ...options,
           strategy: options.strategy.features.map(v => contextFeatures[v]())
         };
       }

package/dist/match-detection/index.spec.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.spec.js","names":["debug","createDebugLogger","debugData","extend","describe","generateTests","path","__dirname","useMetadataFile","recurse","fixura","reader","READERS","JSON","callback","getFixture","options","expectedResults","array","enabled","detect","createDetectionInterface","formatOptions","recordA","MarcRecord","subfieldValues","inspect","recordB","map","recordJson","results","stringify","expect","to","eql","contextFeatures","features","strategy","type","v"],"sources":["../../src/match-detection/index.spec.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport generateTests from '@natlibfi/fixugen';\nimport {READERS} from '@natlibfi/fixura';\nimport {expect} from 'chai';\nimport {MarcRecord} from '@natlibfi/marc-record';\nimport * as features from './features';\nimport createDetectionInterface from '.';\nimport {inspect} from 'util';\nimport createDebugLogger from 'debug';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:test');\nconst debugData = debug.extend('data');\n\ndescribe('match-detection', () => {\n  generateTests({\n    path: [__dirname, '..', '..', 'test-fixtures', 'match-detection', 'index'],\n    useMetadataFile: true,\n    recurse: false,\n    fixura: {\n      reader: READERS.JSON\n    },\n    callback: ({getFixture, options, expectedResults, array, enabled = true}) => {\n\n      if (!enabled) {\n        debug(`*** DISABLED TEST! ***`);\n        return;\n      }\n\n      const detect = createDetectionInterface(formatOptions());\n      const recordA = new MarcRecord(getFixture('recordA.json'), {subfieldValues: false});\n      debugData(inspect(recordA));\n\n      debug(`Our recordB is an array of records: ${array}`);\n      const recordB = array\n        ? getFixture('recordB.json').map(recordJson => new MarcRecord(recordJson, {subfieldValues: false}))\n        : new MarcRecord(getFixture('recordB.json'), {subfieldValues: false});\n      debugData(inspect(recordB));\n\n      const results = detect(recordA, recordB);\n      debugData(`${JSON.stringify(results)}`);\n\n      expect(results).to.eql(expectedResults);\n\n      function formatOptions() {\n        const contextFeatures = features[options.strategy.type];\n\n        return {\n          ...options,\n          strategy: options.strategy.features.map(v => contextFeatures[v]())\n        };\n      }\n    }\n  });\n});\n"],"mappings":";;AA4BA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;;;;;;;AAnCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAWA,MAAMA,KAAK,GAAG,IAAAC,cAAA,EAAkB,wDAAlB,CAAd;AACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;AAEAC,QAAQ,CAAC,iBAAD,EAAoB,MAAM;EAChC,IAAAC,gBAAA,EAAc;IACZC,IAAI,EAAE,CAACC,SAAD,EAAY,IAAZ,EAAkB,IAAlB,EAAwB,eAAxB,EAAyC,iBAAzC,EAA4D,OAA5D,CADM;IAEZC,eAAe,EAAE,IAFL;IAGZC,OAAO,EAAE,KAHG;IAIZC,MAAM,EAAE;MACNC,MAAM,EAAEC,eAAA,CAAQC;IADV,CAJI;IAOZC,QAAQ,EAAE,CAAC;MAACC,UAAD;MAAaC,OAAb;MAAsBC,eAAtB;MAAuCC,KAAvC;MAA8CC,OAAO,GAAG;IAAxD,CAAD,KAAmE;MAE3E,IAAI,CAACA,OAAL,EAAc;QACZnB,KAAK,CAAE,wBAAF,CAAL;QACA;MACD;;MAED,MAAMoB,MAAM,GAAG,IAAAC,SAAA,EAAyBC,aAAa,EAAtC,CAAf;MACA,MAAMC,OAAO,GAAG,IAAIC,sBAAJ,CAAeT,UAAU,CAAC,cAAD,CAAzB,EAA2C;QAACU,cAAc,EAAE;MAAjB,CAA3C,CAAhB;MACAvB,SAAS,CAAC,IAAAwB,aAAA,EAAQH,OAAR,CAAD,CAAT;MAEAvB,KAAK,CAAE,uCAAsCkB,KAAM,EAA9C,CAAL;MACA,MAAMS,OAAO,GAAGT,KAAK,GACjBH,UAAU,CAAC,cAAD,CAAV,CAA2Ba,GAA3B,CAA+BC,UAAU,IAAI,IAAIL,sBAAJ,CAAeK,UAAf,EAA2B;QAACJ,cAAc,EAAE;MAAjB,CAA3B,CAA7C,CADiB,GAEjB,IAAID,sBAAJ,CAAeT,UAAU,CAAC,cAAD,CAAzB,EAA2C;QAACU,cAAc,EAAE;MAAjB,CAA3C,CAFJ;MAGAvB,SAAS,CAAC,IAAAwB,aAAA,EAAQC,OAAR,CAAD,CAAT;MAEA,MAAMG,OAAO,GAAGV,MAAM,CAACG,OAAD,EAAUI,OAAV,CAAtB;MACAzB,SAAS,CAAE,GAAEW,IAAI,CAACkB,SAAL,CAAeD,OAAf,CAAwB,EAA5B,CAAT;MAEA,IAAAE,YAAA,EAAOF,OAAP,EAAgBG,EAAhB,CAAmBC,GAAnB,CAAuBjB,eAAvB;;MAEA,SAASK,aAAT,GAAyB;QACvB,MAAMa,eAAe,GAAGC,QAAQ,CAACpB,OAAO,CAACqB,QAAR,CAAiBC,IAAlB,CAAhC;QAEA,OAAO,EACL,GAAGtB,OADE;UAELqB,QAAQ,EAAErB,OAAO,CAACqB,QAAR,CAAiBD,QAAjB,CAA0BR,GAA1B,CAA8BW,CAAC,IAAIJ,eAAe,CAACI,CAAD,CAAf,EAAnC;QAFL,CAAP;MAID;IACF;EArCW,CAAd;AAuCD,CAxCO,CAAR"}
+{"version":3,"file":"index.spec.js","names":["debug","createDebugLogger","debugData","extend","describe","generateTests","path","__dirname","useMetadataFile","recurse","fixura","reader","READERS","JSON","callback","getFixture","options","expectedResults","array","enabled","detect","createDetectionInterface","formatOptions","recordA","MarcRecord","subfieldValues","inspect","recordB","map","recordJson","results","stringify","expect","to","eql","contextFeatures","features","strategy","type","v"],"sources":["../../src/match-detection/index.spec.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport generateTests from '@natlibfi/fixugen';\nimport {READERS} from '@natlibfi/fixura';\nimport {expect} from 'chai';\nimport {MarcRecord} from '@natlibfi/marc-record';\nimport * as features from './features';\nimport createDetectionInterface from '.';\nimport {inspect} from 'util';\nimport createDebugLogger from 'debug';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:test');\nconst debugData = debug.extend('data');\n\ndescribe('match-detection', () => {\n  generateTests({\n    path: [__dirname, '..', '..', 'test-fixtures', 'match-detection', 'index'],\n    useMetadataFile: true,\n    recurse: false,\n    fixura: {\n      reader: READERS.JSON\n    },\n    callback: ({getFixture, options, expectedResults, array, enabled = true}) => {\n\n      if (!enabled) {\n        debug(`*** DISABLED TEST! ***`);\n        return;\n      }\n\n      const detect = createDetectionInterface(formatOptions());\n      const recordA = new MarcRecord(getFixture('recordA.json'), {subfieldValues: false});\n      debugData(inspect(recordA));\n\n      debug(`Our recordB is an array of records: ${array}`);\n      const recordB = array\n        ? getFixture('recordB.json').map(recordJson => new MarcRecord(recordJson, {subfieldValues: false}))\n        : new MarcRecord(getFixture('recordB.json'), {subfieldValues: false});\n      debugData(inspect(recordB));\n\n      const results = detect(recordA, recordB);\n      debugData(`${JSON.stringify(results)}`);\n\n      expect(results).to.eql(expectedResults);\n\n      function formatOptions() {\n        const contextFeatures = features[options.strategy.type];\n\n        return {\n          ...options,\n          strategy: options.strategy.features.map(v => contextFeatures[v]())\n        };\n      }\n    }\n  });\n});\n"],"mappings":";;AA4BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAAsC;AAAA;AAAA;AAnCtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAWA,MAAMA,KAAK,GAAG,IAAAC,cAAiB,EAAC,wDAAwD,CAAC;AACzF,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;AAEtCC,QAAQ,CAAC,iBAAiB,EAAE,MAAM;EAChC,IAAAC,gBAAa,EAAC;IACZC,IAAI,EAAE,CAACC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,eAAe,EAAE,iBAAiB,EAAE,OAAO,CAAC;IAC1EC,eAAe,EAAE,IAAI;IACrBC,OAAO,EAAE,KAAK;IACdC,MAAM,EAAE;MACNC,MAAM,EAAEC,eAAO,CAACC;IAClB,CAAC;IACDC,QAAQ,EAAE,CAAC;MAACC,UAAU;MAAEC,OAAO;MAAEC,eAAe;MAAEC,KAAK;MAAEC,OAAO,GAAG;IAAI,CAAC,KAAK;MAE3E,IAAI,CAACA,OAAO,EAAE;QACZnB,KAAK,CAAE,wBAAuB,CAAC;QAC/B;MACF;MAEA,MAAMoB,MAAM,GAAG,IAAAC,SAAwB,EAACC,aAAa,EAAE,CAAC;MACxD,MAAMC,OAAO,GAAG,IAAIC,sBAAU,CAACT,UAAU,CAAC,cAAc,CAAC,EAAE;QAACU,cAAc,EAAE;MAAK,CAAC,CAAC;MACnFvB,SAAS,CAAC,IAAAwB,aAAO,EAACH,OAAO,CAAC,CAAC;MAE3BvB,KAAK,CAAE,uCAAsCkB,KAAM,EAAC,CAAC;MACrD,MAAMS,OAAO,GAAGT,KAAK,GACjBH,UAAU,CAAC,cAAc,CAAC,CAACa,GAAG,CAACC,UAAU,IAAI,IAAIL,sBAAU,CAACK,UAAU,EAAE;QAACJ,cAAc,EAAE;MAAK,CAAC,CAAC,CAAC,GACjG,IAAID,sBAAU,CAACT,UAAU,CAAC,cAAc,CAAC,EAAE;QAACU,cAAc,EAAE;MAAK,CAAC,CAAC;MACvEvB,SAAS,CAAC,IAAAwB,aAAO,EAACC,OAAO,CAAC,CAAC;MAE3B,MAAMG,OAAO,GAAGV,MAAM,CAACG,OAAO,EAAEI,OAAO,CAAC;MACxCzB,SAAS,CAAE,GAAEW,IAAI,CAACkB,SAAS,CAACD,OAAO,CAAE,EAAC,CAAC;MAEvC,IAAAE,YAAM,EAACF,OAAO,CAAC,CAACG,EAAE,CAACC,GAAG,CAACjB,eAAe,CAAC;MAEvC,SAASK,aAAa,GAAG;QACvB,MAAMa,eAAe,GAAGC,QAAQ,CAACpB,OAAO,CAACqB,QAAQ,CAACC,IAAI,CAAC;QAEvD,OAAO;UACL,GAAGtB,OAAO;UACVqB,QAAQ,EAAErB,OAAO,CAACqB,QAAQ,CAACD,QAAQ,CAACR,GAAG,CAACW,CAAC,IAAIJ,eAAe,CAACI,CAAC,CAAC,EAAE;QACnE,CAAC;MACH;IACF;EACF,CAAC,CAAC;AACJ,CAAC,CAAC"}

package/dist/matching-utils.js

@@ -7,11 +7,8 @@ exports.getMelindaIdsF035 = getMelindaIdsF035;
 exports.getSubfieldValues = getSubfieldValues;
 exports.testStringOrNumber = testStringOrNumber;
 exports.validateSidFieldSubfieldCounts = validateSidFieldSubfieldCounts;
-
 var _debug = _interopRequireDefault(require("debug"));
-
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
-
 /**
 *
 * @licstart  The following is the entire license notice for the JavaScript code in this file.
@@ -39,26 +36,25 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { de
 * for the JavaScript code in this file.
 *
 */
+
 const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:utils');
-const debugData = debug.extend('data'); // eslint-disable-next-line max-statements
+const debugData = debug.extend('data');
 
+// eslint-disable-next-line max-statements
 function getMelindaIdsF035(record) {
   const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:melinda-id');
   const debugData = debug.extend('data');
   const f035s = record.getFields('035');
-
   if (f035s.length < 1) {
     debug(`No f035s found.`);
     return [];
   }
-
   const allF035MelindaIds = [].concat(...f035s.map(toMelindaIds));
   const f035MelindaIds = [...new Set(allF035MelindaIds)];
   debugData(`Fields (${f035s.length}): ${JSON.stringify(f035s)}`);
   debugData(`Ids (${allF035MelindaIds.length}): ${JSON.stringify(allF035MelindaIds)}`);
   debugData(`Unique ids (${f035MelindaIds.length}): ${JSON.stringify(f035MelindaIds)}`);
   return f035MelindaIds;
-
   function toMelindaIds({
     subfields
   }) {
@@ -68,7 +64,6 @@ function getMelindaIdsF035(record) {
     }) => testStringOrNumber(value) ? String(value).replace(melindaIdRegExp, '$<id>') : '');
   }
 }
-
 function validateSidFieldSubfieldCounts(field) {
   // Valid SID-fields have just one $c and one $b
   debugData(`Validating SID field ${JSON.stringify(field)}`);
@@ -77,14 +72,12 @@ function validateSidFieldSubfieldCounts(field) {
   debug(`Found ${countC} sf $cs and ${countB} sf $bs. IsValid: ${countC === 1 && countB === 1}`);
   return countC === 1 && countB === 1;
 }
-
 function countSubfields(field, subfieldCode) {
   // debug(`Counting subfields ${subfieldCode}`);
   return field.subfields.filter(({
     code
   }) => code === subfieldCode).length;
 }
-
 function getSubfieldValues(field, subfieldCode) {
   debugData(`Get subfield(s) $${subfieldCode} from ${JSON.stringify(field)}`);
   return field.subfields.filter(({
@@ -93,12 +86,10 @@ function getSubfieldValues(field, subfieldCode) {
     value
   }) => testStringOrNumber(value) ? String(value) : '').filter(value => value);
 }
-
 function testStringOrNumber(value) {
   if (typeof value === 'string' || typeof value === 'number') {
     return true;
   }
-
   return false;
 }
 //# sourceMappingURL=matching-utils.js.map

package/dist/matching-utils.js.map

@@ -1 +1 @@
-{"version":3,"file":"matching-utils.js","names":["debug","createDebugLogger","debugData","extend","getMelindaIdsF035","record","f035s","getFields","length","allF035MelindaIds","concat","map","toMelindaIds","f035MelindaIds","Set","JSON","stringify","subfields","melindaIdRegExp","filter","sub","includes","code","testStringOrNumber","value","test","String","replace","validateSidFieldSubfieldCounts","field","countC","countSubfields","countB","subfieldCode","getSubfieldValues"],"sources":["../src/matching-utils.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:utils');\nconst debugData = debug.extend('data');\n\n// eslint-disable-next-line max-statements\nexport function getMelindaIdsF035(record) {\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:melinda-id');\n  const debugData = debug.extend('data');\n\n  const f035s = record.getFields('035');\n\n  if (f035s.length < 1) {\n    debug(`No f035s found.`);\n    return [];\n  }\n\n  const allF035MelindaIds = [].concat(...f035s.map(toMelindaIds));\n  const f035MelindaIds = [...new Set(allF035MelindaIds)];\n\n  debugData(`Fields (${f035s.length}): ${JSON.stringify(f035s)}`);\n  debugData(`Ids (${allF035MelindaIds.length}): ${JSON.stringify(allF035MelindaIds)}`);\n  debugData(`Unique ids (${f035MelindaIds.length}): ${JSON.stringify(f035MelindaIds)}`);\n\n  return f035MelindaIds;\n\n  function toMelindaIds({subfields}) {\n    const melindaIdRegExp = /^(?<prefix>\\(FI-MELINDA\\)|FCC)(?<id>\\d{9})$/u;\n\n    return subfields\n      .filter(sub => ['a', 'z'].includes(sub.code))\n      .filter(sub => testStringOrNumber(sub.value) && melindaIdRegExp.test(String(sub.value)))\n      .map(({value}) => testStringOrNumber(value) ? String(value).replace(melindaIdRegExp, '$<id>') : '');\n\n  }\n}\n\nexport function validateSidFieldSubfieldCounts(field) {\n  // Valid SID-fields have just one $c and one $b\n  debugData(`Validating SID field ${JSON.stringify(field)}`);\n  const countC = countSubfields(field, 'c');\n  const countB = countSubfields(field, 'b');\n  debug(`Found ${countC} sf $cs and ${countB} sf $bs. IsValid: ${countC === 1 && countB === 1}`);\n\n  return countC === 1 && countB === 1;\n}\n\nfunction countSubfields(field, subfieldCode) {\n  // debug(`Counting subfields ${subfieldCode}`);\n  return field.subfields.filter(({code}) => code === subfieldCode).length;\n}\n\nexport function getSubfieldValues(field, subfieldCode) {\n  debugData(`Get subfield(s) $${subfieldCode} from ${JSON.stringify(field)}`);\n  return field.subfields\n    .filter(({code}) => code === subfieldCode)\n    .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n    .filter(value => value);\n}\n\nexport function testStringOrNumber(value) {\n  if (typeof value === 'string' || typeof value === 'number') {\n    return true;\n  }\n  return false;\n}\n"],"mappings":";;;;;;;;;;AA4BA;;;;AA5BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAIA,MAAMA,KAAK,GAAG,IAAAC,cAAA,EAAkB,yCAAlB,CAAd;AACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB,C,CAEA;;AACO,SAASC,iBAAT,CAA2BC,MAA3B,EAAmC;EAExC,MAAML,KAAK,GAAG,IAAAC,cAAA,EAAkB,8CAAlB,CAAd;EACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;EAEA,MAAMG,KAAK,GAAGD,MAAM,CAACE,SAAP,CAAiB,KAAjB,CAAd;;EAEA,IAAID,KAAK,CAACE,MAAN,GAAe,CAAnB,EAAsB;IACpBR,KAAK,CAAE,iBAAF,CAAL;IACA,OAAO,EAAP;EACD;;EAED,MAAMS,iBAAiB,GAAG,GAAGC,MAAH,CAAU,GAAGJ,KAAK,CAACK,GAAN,CAAUC,YAAV,CAAb,CAA1B;EACA,MAAMC,cAAc,GAAG,CAAC,GAAG,IAAIC,GAAJ,CAAQL,iBAAR,CAAJ,CAAvB;EAEAP,SAAS,CAAE,WAAUI,KAAK,CAACE,MAAO,MAAKO,IAAI,CAACC,SAAL,CAAeV,KAAf,CAAsB,EAApD,CAAT;EACAJ,SAAS,CAAE,QAAOO,iBAAiB,CAACD,MAAO,MAAKO,IAAI,CAACC,SAAL,CAAeP,iBAAf,CAAkC,EAAzE,CAAT;EACAP,SAAS,CAAE,eAAcW,cAAc,CAACL,MAAO,MAAKO,IAAI,CAACC,SAAL,CAAeH,cAAf,CAA+B,EAA1E,CAAT;EAEA,OAAOA,cAAP;;EAEA,SAASD,YAAT,CAAsB;IAACK;EAAD,CAAtB,EAAmC;IACjC,MAAMC,eAAe,GAAG,8CAAxB;IAEA,OAAOD,SAAS,CACbE,MADI,CACGC,GAAG,IAAI,CAAC,GAAD,EAAM,GAAN,EAAWC,QAAX,CAAoBD,GAAG,CAACE,IAAxB,CADV,EAEJH,MAFI,CAEGC,GAAG,IAAIG,kBAAkB,CAACH,GAAG,CAACI,KAAL,CAAlB,IAAiCN,eAAe,CAACO,IAAhB,CAAqBC,MAAM,CAACN,GAAG,CAACI,KAAL,CAA3B,CAF3C,EAGJb,GAHI,CAGA,CAAC;MAACa;IAAD,CAAD,KAAaD,kBAAkB,CAACC,KAAD,CAAlB,GAA4BE,MAAM,CAACF,KAAD,CAAN,CAAcG,OAAd,CAAsBT,eAAtB,EAAuC,OAAvC,CAA5B,GAA8E,EAH3F,CAAP;EAKD;AACF;;AAEM,SAASU,8BAAT,CAAwCC,KAAxC,EAA+C;EACpD;EACA3B,SAAS,CAAE,wBAAuBa,IAAI,CAACC,SAAL,CAAea,KAAf,CAAsB,EAA/C,CAAT;EACA,MAAMC,MAAM,GAAGC,cAAc,CAACF,KAAD,EAAQ,GAAR,CAA7B;EACA,MAAMG,MAAM,GAAGD,cAAc,CAACF,KAAD,EAAQ,GAAR,CAA7B;EACA7B,KAAK,CAAE,SAAQ8B,MAAO,eAAcE,MAAO,qBAAoBF,MAAM,KAAK,CAAX,IAAgBE,MAAM,KAAK,CAAE,EAAvF,CAAL;EAEA,OAAOF,MAAM,KAAK,CAAX,IAAgBE,MAAM,KAAK,CAAlC;AACD;;AAED,SAASD,cAAT,CAAwBF,KAAxB,EAA+BI,YAA/B,EAA6C;EAC3C;EACA,OAAOJ,KAAK,CAACZ,SAAN,CAAgBE,MAAhB,CAAuB,CAAC;IAACG;EAAD,CAAD,KAAYA,IAAI,KAAKW,YAA5C,EAA0DzB,MAAjE;AACD;;AAEM,SAAS0B,iBAAT,CAA2BL,KAA3B,EAAkCI,YAAlC,EAAgD;EACrD/B,SAAS,CAAE,oBAAmB+B,YAAa,SAAQlB,IAAI,CAACC,SAAL,CAAea,KAAf,CAAsB,EAAhE,CAAT;EACA,OAAOA,KAAK,CAACZ,SAAN,CACJE,MADI,CACG,CAAC;IAACG;EAAD,CAAD,KAAYA,IAAI,KAAKW,YADxB,EAEJtB,GAFI,CAEA,CAAC;IAACa;EAAD,CAAD,KAAaD,kBAAkB,CAACC,KAAD,CAAlB,GAA4BE,MAAM,CAACF,KAAD,CAAlC,GAA4C,EAFzD,EAGJL,MAHI,CAGGK,KAAK,IAAIA,KAHZ,CAAP;AAID;;AAEM,SAASD,kBAAT,CAA4BC,KAA5B,EAAmC;EACxC,IAAI,OAAOA,KAAP,KAAiB,QAAjB,IAA6B,OAAOA,KAAP,KAAiB,QAAlD,EAA4D;IAC1D,OAAO,IAAP;EACD;;EACD,OAAO,KAAP;AACD"}
+{"version":3,"file":"matching-utils.js","names":["debug","createDebugLogger","debugData","extend","getMelindaIdsF035","record","f035s","getFields","length","allF035MelindaIds","concat","map","toMelindaIds","f035MelindaIds","Set","JSON","stringify","subfields","melindaIdRegExp","filter","sub","includes","code","testStringOrNumber","value","test","String","replace","validateSidFieldSubfieldCounts","field","countC","countSubfields","countB","subfieldCode","getSubfieldValues"],"sources":["../src/matching-utils.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:utils');\nconst debugData = debug.extend('data');\n\n// eslint-disable-next-line max-statements\nexport function getMelindaIdsF035(record) {\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:melinda-id');\n  const debugData = debug.extend('data');\n\n  const f035s = record.getFields('035');\n\n  if (f035s.length < 1) {\n    debug(`No f035s found.`);\n    return [];\n  }\n\n  const allF035MelindaIds = [].concat(...f035s.map(toMelindaIds));\n  const f035MelindaIds = [...new Set(allF035MelindaIds)];\n\n  debugData(`Fields (${f035s.length}): ${JSON.stringify(f035s)}`);\n  debugData(`Ids (${allF035MelindaIds.length}): ${JSON.stringify(allF035MelindaIds)}`);\n  debugData(`Unique ids (${f035MelindaIds.length}): ${JSON.stringify(f035MelindaIds)}`);\n\n  return f035MelindaIds;\n\n  function toMelindaIds({subfields}) {\n    const melindaIdRegExp = /^(?<prefix>\\(FI-MELINDA\\)|FCC)(?<id>\\d{9})$/u;\n\n    return subfields\n      .filter(sub => ['a', 'z'].includes(sub.code))\n      .filter(sub => testStringOrNumber(sub.value) && melindaIdRegExp.test(String(sub.value)))\n      .map(({value}) => testStringOrNumber(value) ? String(value).replace(melindaIdRegExp, '$<id>') : '');\n\n  }\n}\n\nexport function validateSidFieldSubfieldCounts(field) {\n  // Valid SID-fields have just one $c and one $b\n  debugData(`Validating SID field ${JSON.stringify(field)}`);\n  const countC = countSubfields(field, 'c');\n  const countB = countSubfields(field, 'b');\n  debug(`Found ${countC} sf $cs and ${countB} sf $bs. IsValid: ${countC === 1 && countB === 1}`);\n\n  return countC === 1 && countB === 1;\n}\n\nfunction countSubfields(field, subfieldCode) {\n  // debug(`Counting subfields ${subfieldCode}`);\n  return field.subfields.filter(({code}) => code === subfieldCode).length;\n}\n\nexport function getSubfieldValues(field, subfieldCode) {\n  debugData(`Get subfield(s) $${subfieldCode} from ${JSON.stringify(field)}`);\n  return field.subfields\n    .filter(({code}) => code === subfieldCode)\n    .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n    .filter(value => value);\n}\n\nexport function testStringOrNumber(value) {\n  if (typeof value === 'string' || typeof value === 'number') {\n    return true;\n  }\n  return false;\n}\n"],"mappings":";;;;;;;;;AA4BA;AAAsC;AA5BtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAIA,MAAMA,KAAK,GAAG,IAAAC,cAAiB,EAAC,yCAAyC,CAAC;AAC1E,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;;AAEtC;AACO,SAASC,iBAAiB,CAACC,MAAM,EAAE;EAExC,MAAML,KAAK,GAAG,IAAAC,cAAiB,EAAC,8CAA8C,CAAC;EAC/E,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EAEtC,MAAMG,KAAK,GAAGD,MAAM,CAACE,SAAS,CAAC,KAAK,CAAC;EAErC,IAAID,KAAK,CAACE,MAAM,GAAG,CAAC,EAAE;IACpBR,KAAK,CAAE,iBAAgB,CAAC;IACxB,OAAO,EAAE;EACX;EAEA,MAAMS,iBAAiB,GAAG,EAAE,CAACC,MAAM,CAAC,GAAGJ,KAAK,CAACK,GAAG,CAACC,YAAY,CAAC,CAAC;EAC/D,MAAMC,cAAc,GAAG,CAAC,GAAG,IAAIC,GAAG,CAACL,iBAAiB,CAAC,CAAC;EAEtDP,SAAS,CAAE,WAAUI,KAAK,CAACE,MAAO,MAAKO,IAAI,CAACC,SAAS,CAACV,KAAK,CAAE,EAAC,CAAC;EAC/DJ,SAAS,CAAE,QAAOO,iBAAiB,CAACD,MAAO,MAAKO,IAAI,CAACC,SAAS,CAACP,iBAAiB,CAAE,EAAC,CAAC;EACpFP,SAAS,CAAE,eAAcW,cAAc,CAACL,MAAO,MAAKO,IAAI,CAACC,SAAS,CAACH,cAAc,CAAE,EAAC,CAAC;EAErF,OAAOA,cAAc;EAErB,SAASD,YAAY,CAAC;IAACK;EAAS,CAAC,EAAE;IACjC,MAAMC,eAAe,GAAG,8CAA8C;IAEtE,OAAOD,SAAS,CACbE,MAAM,CAACC,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAACC,QAAQ,CAACD,GAAG,CAACE,IAAI,CAAC,CAAC,CAC5CH,MAAM,CAACC,GAAG,IAAIG,kBAAkB,CAACH,GAAG,CAACI,KAAK,CAAC,IAAIN,eAAe,CAACO,IAAI,CAACC,MAAM,CAACN,GAAG,CAACI,KAAK,CAAC,CAAC,CAAC,CACvFb,GAAG,CAAC,CAAC;MAACa;IAAK,CAAC,KAAKD,kBAAkB,CAACC,KAAK,CAAC,GAAGE,MAAM,CAACF,KAAK,CAAC,CAACG,OAAO,CAACT,eAAe,EAAE,OAAO,CAAC,GAAG,EAAE,CAAC;EAEvG;AACF;AAEO,SAASU,8BAA8B,CAACC,KAAK,EAAE;EACpD;EACA3B,SAAS,CAAE,wBAAuBa,IAAI,CAACC,SAAS,CAACa,KAAK,CAAE,EAAC,CAAC;EAC1D,MAAMC,MAAM,GAAGC,cAAc,CAACF,KAAK,EAAE,GAAG,CAAC;EACzC,MAAMG,MAAM,GAAGD,cAAc,CAACF,KAAK,EAAE,GAAG,CAAC;EACzC7B,KAAK,CAAE,SAAQ8B,MAAO,eAAcE,MAAO,qBAAoBF,MAAM,KAAK,CAAC,IAAIE,MAAM,KAAK,CAAE,EAAC,CAAC;EAE9F,OAAOF,MAAM,KAAK,CAAC,IAAIE,MAAM,KAAK,CAAC;AACrC;AAEA,SAASD,cAAc,CAACF,KAAK,EAAEI,YAAY,EAAE;EAC3C;EACA,OAAOJ,KAAK,CAACZ,SAAS,CAACE,MAAM,CAAC,CAAC;IAACG;EAAI,CAAC,KAAKA,IAAI,KAAKW,YAAY,CAAC,CAACzB,MAAM;AACzE;AAEO,SAAS0B,iBAAiB,CAACL,KAAK,EAAEI,YAAY,EAAE;EACrD/B,SAAS,CAAE,oBAAmB+B,YAAa,SAAQlB,IAAI,CAACC,SAAS,CAACa,KAAK,CAAE,EAAC,CAAC;EAC3E,OAAOA,KAAK,CAACZ,SAAS,CACnBE,MAAM,CAAC,CAAC;IAACG;EAAI,CAAC,KAAKA,IAAI,KAAKW,YAAY,CAAC,CACzCtB,GAAG,CAAC,CAAC;IAACa;EAAK,CAAC,KAAKD,kBAAkB,CAACC,KAAK,CAAC,GAAGE,MAAM,CAACF,KAAK,CAAC,GAAG,EAAE,CAAC,CAChEL,MAAM,CAACK,KAAK,IAAIA,KAAK,CAAC;AAC3B;AAEO,SAASD,kBAAkB,CAACC,KAAK,EAAE;EACxC,IAAI,OAAOA,KAAK,KAAK,QAAQ,IAAI,OAAOA,KAAK,KAAK,QAAQ,EAAE;IAC1D,OAAO,IAAI;EACb;EACA,OAAO,KAAK;AACd"}

package/package.json

@@ -14,7 +14,7 @@
 		"url": "git@github.com:natlibfi/melinda-record-matching-js.git"
 	},
 	"license": "LGPL-3.0+",
-	"version": "2.2.1-alpha.2",
+	"version": "2.2.1",
 	"main": "./dist/index.js",
 	"engines": {
 		"node": ">=14"
@@ -36,35 +36,35 @@
 		"watch:test": "cross-env DEBUG=1 NODE_ENV=test nodemon -w src -w test-fixtures --exec 'npm run test:dev'"
 	},
 	"dependencies": {
-		"@natlibfi/marc-record": "^7.0.0",
-		"@natlibfi/marc-record-serializers": "^8.1.0",
-		"@natlibfi/melinda-commons": "^12.0.3",
-		"@natlibfi/sru-client": "^5.0.1",
+		"@natlibfi/marc-record": "^7.2.1",
+		"@natlibfi/marc-record-serializers": "^9.0.0",
+		"@natlibfi/melinda-commons": "^12.0.4",
+		"@natlibfi/sru-client": "^5.0.3",
 		"debug": "^4.3.4",
 		"moment": "^2.29.4",
 		"natural": "^5.2.3",
-		"uuid": "^8.3.2",
-		"winston": "^3.8.1"
+		"uuid": "^9.0.0",
+		"winston": "^3.8.2"
 	},
 	"devDependencies": {
-		"@babel/cli": "^7.18.10",
-		"@babel/core": "^7.18.13",
-		"@babel/eslint-parser": "^7.18.9",
-		"@babel/node": "^7.18.10",
-		"@babel/preset-env": "^7.18.10",
+		"@babel/cli": "^7.19.3",
+		"@babel/core": "^7.19.3",
+		"@babel/eslint-parser": "^7.19.1",
+		"@babel/node": "^7.19.1",
+		"@babel/preset-env": "^7.19.4",
 		"@babel/register": "^7.18.9",
-		"@natlibfi/eslint-config-melinda-backend": "^2.0.0",
+		"@natlibfi/eslint-config-melinda-backend": "^2.0.1",
 		"@natlibfi/fixugen": "^1.1.0",
 		"@natlibfi/fixugen-http-client": "^2.0.1",
-		"@natlibfi/fixura": "^2.2.1",
+		"@natlibfi/fixura": "^2.2.5",
 		"babel-plugin-istanbul": "^6.1.1",
 		"babel-plugin-rewire": "^1.2.0",
 		"chai": "^4.3.6",
 		"chai-as-promised": "^7.1.1",
 		"cross-env": "^7.0.3",
-		"eslint": "^8.23.0",
-		"mocha": "^9.2.2",
-		"nodemon": "^2.0.19",
+		"eslint": "^8.25.0",
+		"mocha": "^10.0.0",
+		"nodemon": "^2.0.20",
 		"nyc": "^15.1.0"
 	},
 	"eslintConfig": {