@natlibfi/melinda-record-matching 2.2.1-alpha.1 → 2.2.1-alpha.3

package/dist/index.spec.js

@@ -0,0 +1,125 @@
+"use strict";
+
+var _chai = require("chai");
+var _fixura = require("@natlibfi/fixura");
+var _fixugenHttpClient = _interopRequireDefault(require("@natlibfi/fixugen-http-client"));
+var _marcRecord = require("@natlibfi/marc-record");
+var _ = _interopRequireWildcard(require("."));
+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.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js is distributed in the hope that it will be useful,
+* but WITHOUT ANY WARRANTY; without even the implied warranty of
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+* GNU Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+
+const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:index:test');
+const debugData = debug.extend('data');
+describe('INDEX', () => {
+  (0, _fixugenHttpClient.default)({
+    callback,
+    path: [__dirname, '..', 'test-fixtures', 'index'],
+    recurse: false,
+    fixura: {
+      reader: _fixura.READERS.JSON
+    }
+  });
+  async function callback({
+    getFixture,
+    options,
+    enabled = true,
+    expectedMatchStatus,
+    expectedStopReason,
+    expectedFailures
+  }) {
+    if (!enabled) {
+      debug(`Disabled test!`);
+      return;
+    }
+    const record = new _marcRecord.MarcRecord(getFixture('inputRecord.json'), {
+      subfieldValues: false
+    });
+    const expectedMatches = getFixture('expectedMatches.json');
+    const expectedNonMatches = getFixture('expectedNonMatches.json') || [];
+    const match = (0, _.default)(formatOptions());
+    const {
+      matches,
+      matchStatus,
+      nonMatches,
+      conversionFailures
+    } = await match(record);
+    debugData(`Matches: ${matches.length}, Status: ${matchStatus.status}/${matchStatus.stopReason}, NonMatches: ${nonMatches ? nonMatches.length : 'not returned'}, ConversionFailures: ${conversionFailures ? conversionFailures.length : 'not returned'}`);
+    (0, _chai.expect)(matchStatus.status).to.eql(expectedMatchStatus);
+    (0, _chai.expect)(matchStatus.stopReason).to.eql(expectedStopReason);
+    const formattedMatchResult = formatRecordResults(matches);
+    (0, _chai.expect)(formattedMatchResult).to.eql(expectedMatches);
+    const formattedNonMatchResult = formatRecordResults(nonMatches);
+    (0, _chai.expect)(formattedNonMatchResult).to.eql(expectedNonMatches);
+
+    // eslint-disable-next-line functional/no-conditional-statement
+    if (expectedFailures) {
+      (0, _chai.expect)(conversionFailures).to.eql(expectedFailures);
+    }
+    function formatOptions() {
+      const contextFeatures = _.matchDetection.features[options.detection.strategy.type];
+      return {
+        ...options,
+        search: {
+          ...options.search
+        },
+        detection: {
+          ...options.detect,
+          strategy: options.detection.strategy.features.map(v => contextFeatures[v]())
+        }
+      };
+    }
+    function formatRecordResults(matches) {
+      if (matches) {
+        debugData(JSON.stringify(matches));
+        return matches.map(match => ({
+          ...match,
+          candidate: formatCandidate(match.candidate)
+        }));
+      }
+      return [];
+    }
+
+    // Format candidate to remove validationOptions from record
+    function formatCandidate({
+      id,
+      record
+    }) {
+      const newId = id;
+      const newRecord = record;
+      return {
+        id: newId,
+        record: newRecord.toObject()
+      };
+    }
+  }
+});
+//# sourceMappingURL=index.spec.js.map

package/dist/index.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.spec.js","names":["debug","createDebugLogger","debugData","extend","describe","generateTests","callback","path","__dirname","recurse","fixura","reader","READERS","JSON","getFixture","options","enabled","expectedMatchStatus","expectedStopReason","expectedFailures","record","MarcRecord","subfieldValues","expectedMatches","expectedNonMatches","match","createMatchInterface","formatOptions","matches","matchStatus","nonMatches","conversionFailures","length","status","stopReason","expect","to","eql","formattedMatchResult","formatRecordResults","formattedNonMatchResult","contextFeatures","matchDetection","features","detection","strategy","type","search","detect","map","v","stringify","candidate","formatCandidate","id","newId","newRecord","toObject"],"sources":["../src/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-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 {expect} from 'chai';\nimport {READERS} from '@natlibfi/fixura';\nimport generateTests from '@natlibfi/fixugen-http-client';\nimport {MarcRecord} from '@natlibfi/marc-record';\nimport createMatchInterface, {matchDetection} from '.';\nimport createDebugLogger from 'debug';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:index:test');\nconst debugData = debug.extend('data');\n\ndescribe('INDEX', () => {\n  generateTests({\n    callback,\n    path: [__dirname, '..', 'test-fixtures', 'index'],\n    recurse: false,\n    fixura: {\n      reader: READERS.JSON\n    }\n  });\n\n  async function callback({getFixture, options, enabled = true, expectedMatchStatus, expectedStopReason, expectedFailures}) {\n\n    if (!enabled) {\n      debug(`Disabled test!`);\n      return;\n    }\n\n    const record = new MarcRecord(getFixture('inputRecord.json'), {subfieldValues: false});\n    const expectedMatches = getFixture('expectedMatches.json');\n    const expectedNonMatches = getFixture('expectedNonMatches.json') || [];\n\n\n    const match = createMatchInterface(formatOptions());\n    const {matches, matchStatus, nonMatches, conversionFailures} = await match(record);\n    debugData(`Matches: ${matches.length}, Status: ${matchStatus.status}/${matchStatus.stopReason}, NonMatches: ${nonMatches ? nonMatches.length : 'not returned'}, ConversionFailures: ${conversionFailures ? conversionFailures.length : 'not returned'}`);\n\n    expect(matchStatus.status).to.eql(expectedMatchStatus);\n    expect(matchStatus.stopReason).to.eql(expectedStopReason);\n\n    const formattedMatchResult = formatRecordResults(matches);\n    expect(formattedMatchResult).to.eql(expectedMatches);\n\n    const formattedNonMatchResult = formatRecordResults(nonMatches);\n    expect(formattedNonMatchResult).to.eql(expectedNonMatches);\n\n    // eslint-disable-next-line functional/no-conditional-statement\n    if (expectedFailures) {\n      expect(conversionFailures).to.eql(expectedFailures);\n    }\n\n    function formatOptions() {\n      const contextFeatures = matchDetection.features[options.detection.strategy.type];\n\n      return {\n        ...options,\n        search: {\n          ...options.search\n        },\n        detection: {\n          ...options.detect,\n          strategy: options.detection.strategy.features.map(v => contextFeatures[v]())\n        }\n      };\n    }\n\n    function formatRecordResults(matches) {\n      if (matches) {\n        debugData(JSON.stringify(matches));\n        return matches.map((match) => ({\n          ...match,\n          candidate: formatCandidate(match.candidate)\n        }));\n      }\n      return [];\n    }\n\n    // Format candidate to remove validationOptions from record\n    function formatCandidate({id, record}) {\n      const newId = id;\n      const newRecord = record;\n      return {\n        id: newId,\n        record: newRecord.toObject()\n      };\n    }\n\n\n  }\n\n});\n"],"mappings":";;AA4BA;AACA;AACA;AACA;AACA;AACA;AAAsC;AAAA;AAAA;AAjCtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AASA,MAAMA,KAAK,GAAG,IAAAC,cAAiB,EAAC,8CAA8C,CAAC;AAC/E,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;AAEtCC,QAAQ,CAAC,OAAO,EAAE,MAAM;EACtB,IAAAC,0BAAa,EAAC;IACZC,QAAQ;IACRC,IAAI,EAAE,CAACC,SAAS,EAAE,IAAI,EAAE,eAAe,EAAE,OAAO,CAAC;IACjDC,OAAO,EAAE,KAAK;IACdC,MAAM,EAAE;MACNC,MAAM,EAAEC,eAAO,CAACC;IAClB;EACF,CAAC,CAAC;EAEF,eAAeP,QAAQ,CAAC;IAACQ,UAAU;IAAEC,OAAO;IAAEC,OAAO,GAAG,IAAI;IAAEC,mBAAmB;IAAEC,kBAAkB;IAAEC;EAAgB,CAAC,EAAE;IAExH,IAAI,CAACH,OAAO,EAAE;MACZhB,KAAK,CAAE,gBAAe,CAAC;MACvB;IACF;IAEA,MAAMoB,MAAM,GAAG,IAAIC,sBAAU,CAACP,UAAU,CAAC,kBAAkB,CAAC,EAAE;MAACQ,cAAc,EAAE;IAAK,CAAC,CAAC;IACtF,MAAMC,eAAe,GAAGT,UAAU,CAAC,sBAAsB,CAAC;IAC1D,MAAMU,kBAAkB,GAAGV,UAAU,CAAC,yBAAyB,CAAC,IAAI,EAAE;IAGtE,MAAMW,KAAK,GAAG,IAAAC,SAAoB,EAACC,aAAa,EAAE,CAAC;IACnD,MAAM;MAACC,OAAO;MAAEC,WAAW;MAAEC,UAAU;MAAEC;IAAkB,CAAC,GAAG,MAAMN,KAAK,CAACL,MAAM,CAAC;IAClFlB,SAAS,CAAE,YAAW0B,OAAO,CAACI,MAAO,aAAYH,WAAW,CAACI,MAAO,IAAGJ,WAAW,CAACK,UAAW,iBAAgBJ,UAAU,GAAGA,UAAU,CAACE,MAAM,GAAG,cAAe,yBAAwBD,kBAAkB,GAAGA,kBAAkB,CAACC,MAAM,GAAG,cAAe,EAAC,CAAC;IAExP,IAAAG,YAAM,EAACN,WAAW,CAACI,MAAM,CAAC,CAACG,EAAE,CAACC,GAAG,CAACpB,mBAAmB,CAAC;IACtD,IAAAkB,YAAM,EAACN,WAAW,CAACK,UAAU,CAAC,CAACE,EAAE,CAACC,GAAG,CAACnB,kBAAkB,CAAC;IAEzD,MAAMoB,oBAAoB,GAAGC,mBAAmB,CAACX,OAAO,CAAC;IACzD,IAAAO,YAAM,EAACG,oBAAoB,CAAC,CAACF,EAAE,CAACC,GAAG,CAACd,eAAe,CAAC;IAEpD,MAAMiB,uBAAuB,GAAGD,mBAAmB,CAACT,UAAU,CAAC;IAC/D,IAAAK,YAAM,EAACK,uBAAuB,CAAC,CAACJ,EAAE,CAACC,GAAG,CAACb,kBAAkB,CAAC;;IAE1D;IACA,IAAIL,gBAAgB,EAAE;MACpB,IAAAgB,YAAM,EAACJ,kBAAkB,CAAC,CAACK,EAAE,CAACC,GAAG,CAAClB,gBAAgB,CAAC;IACrD;IAEA,SAASQ,aAAa,GAAG;MACvB,MAAMc,eAAe,GAAGC,gBAAc,CAACC,QAAQ,CAAC5B,OAAO,CAAC6B,SAAS,CAACC,QAAQ,CAACC,IAAI,CAAC;MAEhF,OAAO;QACL,GAAG/B,OAAO;QACVgC,MAAM,EAAE;UACN,GAAGhC,OAAO,CAACgC;QACb,CAAC;QACDH,SAAS,EAAE;UACT,GAAG7B,OAAO,CAACiC,MAAM;UACjBH,QAAQ,EAAE9B,OAAO,CAAC6B,SAAS,CAACC,QAAQ,CAACF,QAAQ,CAACM,GAAG,CAACC,CAAC,IAAIT,eAAe,CAACS,CAAC,CAAC,EAAE;QAC7E;MACF,CAAC;IACH;IAEA,SAASX,mBAAmB,CAACX,OAAO,EAAE;MACpC,IAAIA,OAAO,EAAE;QACX1B,SAAS,CAACW,IAAI,CAACsC,SAAS,CAACvB,OAAO,CAAC,CAAC;QAClC,OAAOA,OAAO,CAACqB,GAAG,CAAExB,KAAK,KAAM;UAC7B,GAAGA,KAAK;UACR2B,SAAS,EAAEC,eAAe,CAAC5B,KAAK,CAAC2B,SAAS;QAC5C,CAAC,CAAC,CAAC;MACL;MACA,OAAO,EAAE;IACX;;IAEA;IACA,SAASC,eAAe,CAAC;MAACC,EAAE;MAAElC;IAAM,CAAC,EAAE;MACrC,MAAMmC,KAAK,GAAGD,EAAE;MAChB,MAAME,SAAS,GAAGpC,MAAM;MACxB,OAAO;QACLkC,EAAE,EAAEC,KAAK;QACTnC,MAAM,EAAEoC,SAAS,CAACC,QAAQ;MAC5B,CAAC;IACH;EAGF;AAEF,CAAC,CAAC"}

package/dist/match-detection/features/bib/all-source-ids.js

@@ -0,0 +1,116 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _debug = _interopRequireDefault(require("debug"));
+var _matchingUtils = require("../../../matching-utils");
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+/* eslint-disable max-statements */
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js is distributed in the hope that it will be useful,
+* but WITHOUT ANY WARRANTY; without even the implied warranty of
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+* GNU Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+
+const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:match-detection:features:all-source-ids');
+const debugData = debug.extend('data');
+
+/*
+
+SID-fields in Melinda have sf $c with local id and sf $b with a code for the local db:
+
+ SID__ $c 123457 $b helka
+ SID__ $c (ANDL100020)1077305 $b sata
+ SID__ $c VER999999 $ FI-KV
+
+allSourceIds matching feature is formatted as [{sourceDb: "helka", sourceId: "123457"}, {sourceDb: "sata", sourceId: "(ANDL100020)1077305"}, {sourceDb: "FI-KV", sourceId: "VER999999"}]
+- no normalization / prefix deletions etc. in the feature
+
+Note: All Melinda records that have a matching records in a local db do NOT have SID for that local records,
+      existence of a SID field depends on how the record has been added to Melinda and how it has been handled
+      afterwards. SIDs are also not reliably maintained. A record might or might not have a SID for a local db
+      after the matching record is removed from the local db.
+
+Records with mismatching local ids for matching local db are a strong mismatch.
+Records with matching local ids for matching local db are a very good match.
+
+*/
+var _default = () => ({
+  name: 'All source IDs',
+  extract: record => {
+    debug(`Creating match detection features for all local source id's`);
+    const fSids = record.get('SID');
+    debugData(`SID-fields (${fSids.length}): ${JSON.stringify(fSids)}`);
+    const sidFeatures = getSidFeatures(fSids);
+    debugData(`SID-features (${sidFeatures.length}): ${JSON.stringify(sidFeatures)}`);
+    return sidFeatures;
+    function getSidFeatures(fSids) {
+      debug(`Getting Sid strings from SID fields`);
+
+      // Map SID fields to sidFeatures, filter out empty strings
+      const sidFeatures = fSids.map(toSidFeature).filter(nonEmptySid => nonEmptySid);
+      return sidFeatures;
+      function toSidFeature(field) {
+        debug(`Getting feature from a field`);
+        return (0, _matchingUtils.validateSidFieldSubfieldCounts)(field) ? createSidFeature(field) : '';
+        function createSidFeature(field) {
+          debug(`Creating feature from a field`);
+          const [sfC] = (0, _matchingUtils.getSubfieldValues)(field, 'c');
+          const [sfB] = (0, _matchingUtils.getSubfieldValues)(field, 'b');
+          debugData(`${JSON.stringify(sfC)} + ${JSON.stringify(sfB)}`);
+          debugData(`sourceDb: ${sfB}, sourceId: ${sfC}`);
+          return {
+            'sourceDb': sfB,
+            'sourceId': sfC
+          };
+        }
+      }
+    }
+  },
+  compare: (a, b) => {
+    debugData(`Comparing ${JSON.stringify(a)} and ${JSON.stringify(b)}`);
+    const matches = a.filter(sidA => b.some(sidB => sidA.sourceDb === sidB.sourceDb && sidA.sourceId === sidB.sourceId));
+    debugData(`Matches (${matches.length}): ${JSON.stringify(matches)}`);
+    const mismatches = a.filter(sidA => b.some(sidB => sidA.sourceDb === sidB.sourceDb && sidA.sourceId !== sidB.sourceId));
+    debugData(`Mismatches (${mismatches.length}): ${JSON.stringify(mismatches)}`);
+
+    // If there's at least one mismatching source ID from matching source db
+    if (mismatches.length > 0) {
+      return -1;
+    }
+
+    // If there's at least one matching source ID from matching source db
+    if (matches.length > 0) {
+      return 1;
+    }
+
+    // If there are no source IDs with matching sources
+    return 0;
+  }
+});
+exports.default = _default;
+//# sourceMappingURL=all-source-ids.js.map

package/dist/match-detection/features/bib/all-source-ids.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"all-source-ids.js","names":["debug","createDebugLogger","debugData","extend","name","extract","record","fSids","get","length","JSON","stringify","sidFeatures","getSidFeatures","map","toSidFeature","filter","nonEmptySid","field","validateSidFieldSubfieldCounts","createSidFeature","sfC","getSubfieldValues","sfB","compare","a","b","matches","sidA","some","sidB","sourceDb","sourceId","mismatches"],"sources":["../../../../src/match-detection/features/bib/all-source-ids.js"],"sourcesContent":["/* eslint-disable max-statements */\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 {validateSidFieldSubfieldCounts, getSubfieldValues} from '../../../matching-utils';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features:all-source-ids');\nconst debugData = debug.extend('data');\n\n/*\n\nSID-fields in Melinda have sf $c with local id and sf $b with a code for the local db:\n\n SID__ $c 123457 $b helka\n SID__ $c (ANDL100020)1077305 $b sata\n SID__ $c VER999999 $ FI-KV\n\nallSourceIds matching feature is formatted as [{sourceDb: \"helka\", sourceId: \"123457\"}, {sourceDb: \"sata\", sourceId: \"(ANDL100020)1077305\"}, {sourceDb: \"FI-KV\", sourceId: \"VER999999\"}]\n- no normalization / prefix deletions etc. in the feature\n\nNote: All Melinda records that have a matching records in a local db do NOT have SID for that local records,\n      existence of a SID field depends on how the record has been added to Melinda and how it has been handled\n      afterwards. SIDs are also not reliably maintained. A record might or might not have a SID for a local db\n      after the matching record is removed from the local db.\n\nRecords with mismatching local ids for matching local db are a strong mismatch.\nRecords with matching local ids for matching local db are a very good match.\n\n*/\n\nexport default () => ({\n  name: 'All source IDs',\n  extract: record => {\n    debug(`Creating match detection features for all local source id's`);\n\n    const fSids = record.get('SID');\n    debugData(`SID-fields (${fSids.length}): ${JSON.stringify(fSids)}`);\n\n    const sidFeatures = getSidFeatures(fSids);\n    debugData(`SID-features (${sidFeatures.length}): ${JSON.stringify(sidFeatures)}`);\n\n    return sidFeatures;\n\n    function getSidFeatures(fSids) {\n      debug(`Getting Sid strings from SID fields`);\n\n      // Map SID fields to sidFeatures, filter out empty strings\n      const sidFeatures = fSids.map(toSidFeature).filter(nonEmptySid => nonEmptySid);\n      return sidFeatures;\n\n      function toSidFeature(field) {\n        debug(`Getting feature from a field`);\n\n        return validateSidFieldSubfieldCounts(field) ? createSidFeature(field) : '';\n\n        function createSidFeature(field) {\n          debug(`Creating feature from a field`);\n          const [sfC] = getSubfieldValues(field, 'c');\n          const [sfB] = getSubfieldValues(field, 'b');\n\n          debugData(`${JSON.stringify(sfC)} + ${JSON.stringify(sfB)}`);\n          debugData(`sourceDb: ${sfB}, sourceId: ${sfC}`);\n          return {'sourceDb': sfB, 'sourceId': sfC};\n        }\n      }\n\n    }\n\n  },\n  compare: (a, b) => {\n\n    debugData(`Comparing ${JSON.stringify(a)} and ${JSON.stringify(b)}`);\n\n    const matches = a.filter(sidA => b.some(sidB => sidA.sourceDb === sidB.sourceDb &&\n            sidA.sourceId === sidB.sourceId));\n    debugData(`Matches (${matches.length}): ${JSON.stringify(matches)}`);\n\n    const mismatches = a.filter(sidA => b.some(sidB => sidA.sourceDb === sidB.sourceDb &&\n      sidA.sourceId !== sidB.sourceId));\n    debugData(`Mismatches (${mismatches.length}): ${JSON.stringify(mismatches)}`);\n\n    // If there's at least one mismatching source ID from matching source db\n    if (mismatches.length > 0) {\n      return -1;\n    }\n\n    // If there's at least one matching source ID from matching source db\n    if (matches.length > 0) {\n      return 1;\n    }\n\n    // If there are no source IDs with matching sources\n    return 0;\n\n  }\n});\n"],"mappings":";;;;;;AA6BA;AACA;AAA0F;AA9B1F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAKA,MAAMA,KAAK,GAAG,IAAAC,cAAiB,EAAC,2EAA2E,CAAC;AAC5G,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAnBA,eAqBe,OAAO;EACpBC,IAAI,EAAE,gBAAgB;EACtBC,OAAO,EAAEC,MAAM,IAAI;IACjBN,KAAK,CAAE,6DAA4D,CAAC;IAEpE,MAAMO,KAAK,GAAGD,MAAM,CAACE,GAAG,CAAC,KAAK,CAAC;IAC/BN,SAAS,CAAE,eAAcK,KAAK,CAACE,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACJ,KAAK,CAAE,EAAC,CAAC;IAEnE,MAAMK,WAAW,GAAGC,cAAc,CAACN,KAAK,CAAC;IACzCL,SAAS,CAAE,iBAAgBU,WAAW,CAACH,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACC,WAAW,CAAE,EAAC,CAAC;IAEjF,OAAOA,WAAW;IAElB,SAASC,cAAc,CAACN,KAAK,EAAE;MAC7BP,KAAK,CAAE,qCAAoC,CAAC;;MAE5C;MACA,MAAMY,WAAW,GAAGL,KAAK,CAACO,GAAG,CAACC,YAAY,CAAC,CAACC,MAAM,CAACC,WAAW,IAAIA,WAAW,CAAC;MAC9E,OAAOL,WAAW;MAElB,SAASG,YAAY,CAACG,KAAK,EAAE;QAC3BlB,KAAK,CAAE,8BAA6B,CAAC;QAErC,OAAO,IAAAmB,6CAA8B,EAACD,KAAK,CAAC,GAAGE,gBAAgB,CAACF,KAAK,CAAC,GAAG,EAAE;QAE3E,SAASE,gBAAgB,CAACF,KAAK,EAAE;UAC/BlB,KAAK,CAAE,+BAA8B,CAAC;UACtC,MAAM,CAACqB,GAAG,CAAC,GAAG,IAAAC,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAC3C,MAAM,CAACK,GAAG,CAAC,GAAG,IAAAD,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAE3ChB,SAAS,CAAE,GAAEQ,IAAI,CAACC,SAAS,CAACU,GAAG,CAAE,MAAKX,IAAI,CAACC,SAAS,CAACY,GAAG,CAAE,EAAC,CAAC;UAC5DrB,SAAS,CAAE,aAAYqB,GAAI,eAAcF,GAAI,EAAC,CAAC;UAC/C,OAAO;YAAC,UAAU,EAAEE,GAAG;YAAE,UAAU,EAAEF;UAAG,CAAC;QAC3C;MACF;IAEF;EAEF,CAAC;EACDG,OAAO,EAAE,CAACC,CAAC,EAAEC,CAAC,KAAK;IAEjBxB,SAAS,CAAE,aAAYQ,IAAI,CAACC,SAAS,CAACc,CAAC,CAAE,QAAOf,IAAI,CAACC,SAAS,CAACe,CAAC,CAAE,EAAC,CAAC;IAEpE,MAAMC,OAAO,GAAGF,CAAC,CAACT,MAAM,CAACY,IAAI,IAAIF,CAAC,CAACG,IAAI,CAACC,IAAI,IAAIF,IAAI,CAACG,QAAQ,KAAKD,IAAI,CAACC,QAAQ,IACvEH,IAAI,CAACI,QAAQ,KAAKF,IAAI,CAACE,QAAQ,CAAC,CAAC;IACzC9B,SAAS,CAAE,YAAWyB,OAAO,CAAClB,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACgB,OAAO,CAAE,EAAC,CAAC;IAEpE,MAAMM,UAAU,GAAGR,CAAC,CAACT,MAAM,CAACY,IAAI,IAAIF,CAAC,CAACG,IAAI,CAACC,IAAI,IAAIF,IAAI,CAACG,QAAQ,KAAKD,IAAI,CAACC,QAAQ,IAChFH,IAAI,CAACI,QAAQ,KAAKF,IAAI,CAACE,QAAQ,CAAC,CAAC;IACnC9B,SAAS,CAAE,eAAc+B,UAAU,CAACxB,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACsB,UAAU,CAAE,EAAC,CAAC;;IAE7E;IACA,IAAIA,UAAU,CAACxB,MAAM,GAAG,CAAC,EAAE;MACzB,OAAO,CAAC,CAAC;IACX;;IAEA;IACA,IAAIkB,OAAO,CAAClB,MAAM,GAAG,CAAC,EAAE;MACtB,OAAO,CAAC;IACV;;IAEA;IACA,OAAO,CAAC;EAEV;AACF,CAAC,CAAC;AAAA"}

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

@@ -0,0 +1,107 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+var _natural = require("natural");
+var _matchingUtils = require("../../../matching-utils");
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js is distributed in the hope that it will be useful,
+* but WITHOUT ANY WARRANTY; without even the implied warranty of
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+* GNU Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+// We should extract also organisational authors (110/710)
+var _default = ({
+  nameTreshold = 10
+} = {}) => ({
+  name: 'Authors',
+  extract: record => record.get(/^(?<def>100|700)$/u).map(({
+    subfields
+  }) => {
+    return subfields.filter(({
+      code,
+      value
+    }) => code && value).filter(({
+      code
+    }) => ['a', '0'].includes(code)).map(toObj).reduce((acc, v) => ({
+      ...acc,
+      ...v
+    }), {});
+    function toObj({
+      code,
+      value
+    }) {
+      if (code === 'a') {
+        return {
+          name: (0, _matchingUtils.testStringOrNumber)(value) ? String(value).replace(/[^\p{Letter}\p{Number}]/gu, '').toLowerCase() : ''
+        };
+      }
+      return {
+        id: value
+      };
+    }
+  }),
+  compare: (a, b) => {
+    const maxAuthors = a.length > b.length ? a.length : b.length;
+    const matchingIds = findMatchingIds();
+    if (maxAuthors >= 3 && matchingIds >= 3) {
+      return 0.3;
+    }
+    const matchingNames = findMatchingNames();
+    const idPoints = matchingIds / maxAuthors * 0.3;
+    const namePoints = matchingNames / maxAuthors * 0.2;
+    const totalPoints = idPoints + namePoints;
+    return totalPoints <= 0.2 ? totalPoints : 0.2;
+    function findMatchingIds() {
+      return findMatches('id', (a, b) => a === b);
+    }
+    function findMatchingNames() {
+      return findMatches('name', (a, b) => {
+        const distance = (0, _natural.LevenshteinDistance)(a, b);
+        if (distance === 0) {
+          return true;
+        }
+        const maxLength = getMaxLength();
+        const percentage = distance / maxLength * 100;
+        return percentage <= nameTreshold;
+        function getMaxLength() {
+          return a.length > b.length ? a.length : b.length;
+        }
+      });
+    }
+    function findMatches(key, cb) {
+      const valuesA = a.filter(o => o[key]).map(o => o[key]);
+      const valuesB = b.filter(o => o[key]).map(o => o[key]);
+      const allValues = valuesA.concat(valuesB);
+      return allValues.reduce((acc, value) => {
+        const occurrance = allValues.filter(otherValue => cb(value, otherValue)).length;
+        return occurrance >= 2 ? acc + 1 : acc;
+      }, 0);
+    }
+  }
+});
+exports.default = _default;
+//# sourceMappingURL=authors.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"authors.js","names":["nameTreshold","name","extract","record","get","map","subfields","filter","code","value","includes","toObj","reduce","acc","v","testStringOrNumber","String","replace","toLowerCase","id","compare","a","b","maxAuthors","length","matchingIds","findMatchingIds","matchingNames","findMatchingNames","idPoints","namePoints","totalPoints","findMatches","distance","leven","maxLength","getMaxLength","percentage","key","cb","valuesA","o","valuesB","allValues","concat","occurrance","otherValue"],"sources":["../../../../src/match-detection/features/bib/authors.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 {LevenshteinDistance as leven} from 'natural';\nimport {testStringOrNumber} from '../../../matching-utils';\n\n// We should extract also organisational authors (110/710)\n\nexport default ({nameTreshold = 10} = {}) => ({\n  name: 'Authors',\n  extract: record => record.get(/^(?<def>100|700)$/u)\n    .map(({subfields}) => {\n      return subfields\n        .filter(({code, value}) => code && value)\n        .filter(({code}) => ['a', '0'].includes(code))\n        .map(toObj)\n        .reduce((acc, v) => ({...acc, ...v}), {});\n\n      function toObj({code, value}) {\n        if (code === 'a') {\n          return {name: testStringOrNumber(value) ? String(value).replace(/[^\\p{Letter}\\p{Number}]/gu, '').toLowerCase() : ''};\n        }\n\n        return {id: value};\n      }\n    }),\n  compare: (a, b) => {\n    const maxAuthors = a.length > b.length ? a.length : b.length;\n    const matchingIds = findMatchingIds();\n\n    if (maxAuthors >= 3 && matchingIds >= 3) {\n      return 0.3;\n    }\n\n    const matchingNames = findMatchingNames();\n    const idPoints = matchingIds / maxAuthors * 0.3;\n    const namePoints = matchingNames / maxAuthors * 0.2;\n    const totalPoints = idPoints + namePoints;\n\n    return totalPoints <= 0.2 ? totalPoints : 0.2;\n\n    function findMatchingIds() {\n      return findMatches('id', (a, b) => a === b);\n    }\n\n    function findMatchingNames() {\n      return findMatches('name', (a, b) => {\n        const distance = leven(a, b);\n\n        if (distance === 0) {\n          return true;\n        }\n\n        const maxLength = getMaxLength();\n        const percentage = distance / maxLength * 100;\n\n        return percentage <= nameTreshold;\n\n        function getMaxLength() {\n          return a.length > b.length ? a.length : b.length;\n        }\n      });\n    }\n\n    function findMatches(key, cb) {\n      const valuesA = a.filter(o => o[key]).map(o => o[key]);\n      const valuesB = b.filter(o => o[key]).map(o => o[key]);\n      const allValues = valuesA.concat(valuesB);\n\n      return allValues.reduce((acc, value) => {\n        const occurrance = allValues.filter(otherValue => cb(value, otherValue)).length;\n        return occurrance >= 2 ? acc + 1 : acc;\n      }, 0);\n    }\n  }\n});\n"],"mappings":";;;;;;AA4BA;AACA;AA7BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAKA;AAAA,eAEe,CAAC;EAACA,YAAY,GAAG;AAAE,CAAC,GAAG,CAAC,CAAC,MAAM;EAC5CC,IAAI,EAAE,SAAS;EACfC,OAAO,EAAEC,MAAM,IAAIA,MAAM,CAACC,GAAG,CAAC,oBAAoB,CAAC,CAChDC,GAAG,CAAC,CAAC;IAACC;EAAS,CAAC,KAAK;IACpB,OAAOA,SAAS,CACbC,MAAM,CAAC,CAAC;MAACC,IAAI;MAAEC;IAAK,CAAC,KAAKD,IAAI,IAAIC,KAAK,CAAC,CACxCF,MAAM,CAAC,CAAC;MAACC;IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAACE,QAAQ,CAACF,IAAI,CAAC,CAAC,CAC7CH,GAAG,CAACM,KAAK,CAAC,CACVC,MAAM,CAAC,CAACC,GAAG,EAAEC,CAAC,MAAM;MAAC,GAAGD,GAAG;MAAE,GAAGC;IAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE3C,SAASH,KAAK,CAAC;MAACH,IAAI;MAAEC;IAAK,CAAC,EAAE;MAC5B,IAAID,IAAI,KAAK,GAAG,EAAE;QAChB,OAAO;UAACP,IAAI,EAAE,IAAAc,iCAAkB,EAACN,KAAK,CAAC,GAAGO,MAAM,CAACP,KAAK,CAAC,CAACQ,OAAO,CAAC,2BAA2B,EAAE,EAAE,CAAC,CAACC,WAAW,EAAE,GAAG;QAAE,CAAC;MACtH;MAEA,OAAO;QAACC,EAAE,EAAEV;MAAK,CAAC;IACpB;EACF,CAAC,CAAC;EACJW,OAAO,EAAE,CAACC,CAAC,EAAEC,CAAC,KAAK;IACjB,MAAMC,UAAU,GAAGF,CAAC,CAACG,MAAM,GAAGF,CAAC,CAACE,MAAM,GAAGH,CAAC,CAACG,MAAM,GAAGF,CAAC,CAACE,MAAM;IAC5D,MAAMC,WAAW,GAAGC,eAAe,EAAE;IAErC,IAAIH,UAAU,IAAI,CAAC,IAAIE,WAAW,IAAI,CAAC,EAAE;MACvC,OAAO,GAAG;IACZ;IAEA,MAAME,aAAa,GAAGC,iBAAiB,EAAE;IACzC,MAAMC,QAAQ,GAAGJ,WAAW,GAAGF,UAAU,GAAG,GAAG;IAC/C,MAAMO,UAAU,GAAGH,aAAa,GAAGJ,UAAU,GAAG,GAAG;IACnD,MAAMQ,WAAW,GAAGF,QAAQ,GAAGC,UAAU;IAEzC,OAAOC,WAAW,IAAI,GAAG,GAAGA,WAAW,GAAG,GAAG;IAE7C,SAASL,eAAe,GAAG;MACzB,OAAOM,WAAW,CAAC,IAAI,EAAE,CAACX,CAAC,EAAEC,CAAC,KAAKD,CAAC,KAAKC,CAAC,CAAC;IAC7C;IAEA,SAASM,iBAAiB,GAAG;MAC3B,OAAOI,WAAW,CAAC,MAAM,EAAE,CAACX,CAAC,EAAEC,CAAC,KAAK;QACnC,MAAMW,QAAQ,GAAG,IAAAC,4BAAK,EAACb,CAAC,EAAEC,CAAC,CAAC;QAE5B,IAAIW,QAAQ,KAAK,CAAC,EAAE;UAClB,OAAO,IAAI;QACb;QAEA,MAAME,SAAS,GAAGC,YAAY,EAAE;QAChC,MAAMC,UAAU,GAAGJ,QAAQ,GAAGE,SAAS,GAAG,GAAG;QAE7C,OAAOE,UAAU,IAAIrC,YAAY;QAEjC,SAASoC,YAAY,GAAG;UACtB,OAAOf,CAAC,CAACG,MAAM,GAAGF,CAAC,CAACE,MAAM,GAAGH,CAAC,CAACG,MAAM,GAAGF,CAAC,CAACE,MAAM;QAClD;MACF,CAAC,CAAC;IACJ;IAEA,SAASQ,WAAW,CAACM,GAAG,EAAEC,EAAE,EAAE;MAC5B,MAAMC,OAAO,GAAGnB,CAAC,CAACd,MAAM,CAACkC,CAAC,IAAIA,CAAC,CAACH,GAAG,CAAC,CAAC,CAACjC,GAAG,CAACoC,CAAC,IAAIA,CAAC,CAACH,GAAG,CAAC,CAAC;MACtD,MAAMI,OAAO,GAAGpB,CAAC,CAACf,MAAM,CAACkC,CAAC,IAAIA,CAAC,CAACH,GAAG,CAAC,CAAC,CAACjC,GAAG,CAACoC,CAAC,IAAIA,CAAC,CAACH,GAAG,CAAC,CAAC;MACtD,MAAMK,SAAS,GAAGH,OAAO,CAACI,MAAM,CAACF,OAAO,CAAC;MAEzC,OAAOC,SAAS,CAAC/B,MAAM,CAAC,CAACC,GAAG,EAAEJ,KAAK,KAAK;QACtC,MAAMoC,UAAU,GAAGF,SAAS,CAACpC,MAAM,CAACuC,UAAU,IAAIP,EAAE,CAAC9B,KAAK,EAAEqC,UAAU,CAAC,CAAC,CAACtB,MAAM;QAC/E,OAAOqB,UAAU,IAAI,CAAC,GAAGhC,GAAG,GAAG,CAAC,GAAGA,GAAG;MACxC,CAAC,EAAE,CAAC,CAAC;IACP;EACF;AACF,CAAC,CAAC;AAAA"}

package/dist/match-detection/features/bib/bibliographic-level.js

@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js is distributed in the hope that it will be useful,
+* but WITHOUT ANY WARRANTY; without even the implied warranty of
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+* GNU Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/var _default = () => ({
+  name: 'Bibliographic level',
+  extract: r => r.leader[7] ? [r.leader[7]] : [],
+  compare: (a, b) => a[0] === b[0] ? 0.1 : -0.2
+});
+exports.default = _default;
+//# sourceMappingURL=bibliographic-level.js.map

package/dist/match-detection/features/bib/bibliographic-level.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bibliographic-level.js","names":["name","extract","r","leader","compare","a","b"],"sources":["../../../../src/match-detection/features/bib/bibliographic-level.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\nexport default () => ({\n  name: 'Bibliographic level',\n  extract: r => r.leader[7] ? [r.leader[7]] : [],\n  compare: (a, b) => a[0] === b[0] ? 0.1 : -0.2\n});\n"],"mappings":";;;;;;AAAA;AACA;AACA;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,eA4Be,OAAO;EACpBA,IAAI,EAAE,qBAAqB;EAC3BC,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,MAAM,CAAC,CAAC,CAAC,GAAG,CAACD,CAAC,CAACC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE;EAC9CC,OAAO,EAAE,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC,CAAC,CAAC,KAAKC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;AAC5C,CAAC,CAAC;AAAA"}

package/dist/match-detection/features/bib/host-component.js

@@ -0,0 +1,39 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js is distributed in the hope that it will be useful,
+* but WITHOUT ANY WARRANTY; without even the implied warranty of
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+* GNU Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/var _default = () => ({
+  name: 'Host/Component record',
+  extract: r => r.get(/^773$/u).length > 0 ? ['component'] : ['host'],
+  compare: (a, b) => a[0] === b[0] ? 0.0 : -1.0
+});
+exports.default = _default;
+//# sourceMappingURL=host-component.js.map

package/dist/match-detection/features/bib/host-component.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"host-component.js","names":["name","extract","r","get","length","compare","a","b"],"sources":["../../../../src/match-detection/features/bib/host-component.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\nexport default () => ({\n  name: 'Host/Component record',\n  extract: r => r.get(/^773$/u).length > 0 ? ['component'] : ['host'],\n  compare: (a, b) => a[0] === b[0] ? 0.0 : -1.0\n});\n"],"mappings":";;;;;;AAAA;AACA;AACA;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,eA4Be,OAAO;EACpBA,IAAI,EAAE,uBAAuB;EAC7BC,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,GAAG,CAAC,QAAQ,CAAC,CAACC,MAAM,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC;EACnEC,OAAO,EAAE,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC,CAAC,CAAC,KAAKC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;AAC5C,CAAC,CAAC;AAAA"}

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

@@ -0,0 +1,91 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+Object.defineProperty(exports, "allSourceIds", {
+  enumerable: true,
+  get: function () {
+    return _allSourceIds.default;
+  }
+});
+Object.defineProperty(exports, "authors", {
+  enumerable: true,
+  get: function () {
+    return _authors.default;
+  }
+});
+Object.defineProperty(exports, "bibliographicLevel", {
+  enumerable: true,
+  get: function () {
+    return _bibliographicLevel.default;
+  }
+});
+Object.defineProperty(exports, "hostComponent", {
+  enumerable: true,
+  get: function () {
+    return _hostComponent.default;
+  }
+});
+Object.defineProperty(exports, "isbn", {
+  enumerable: true,
+  get: function () {
+    return _isbn.default;
+  }
+});
+Object.defineProperty(exports, "issn", {
+  enumerable: true,
+  get: function () {
+    return _issn.default;
+  }
+});
+Object.defineProperty(exports, "language", {
+  enumerable: true,
+  get: function () {
+    return _language.default;
+  }
+});
+Object.defineProperty(exports, "melindaId", {
+  enumerable: true,
+  get: function () {
+    return _melindaId.default;
+  }
+});
+Object.defineProperty(exports, "otherStandardIdentifier", {
+  enumerable: true,
+  get: function () {
+    return _otherStandardIdentifier.default;
+  }
+});
+Object.defineProperty(exports, "publicationTime", {
+  enumerable: true,
+  get: function () {
+    return _publicationTime.default;
+  }
+});
+Object.defineProperty(exports, "recordType", {
+  enumerable: true,
+  get: function () {
+    return _recordType.default;
+  }
+});
+Object.defineProperty(exports, "title", {
+  enumerable: true,
+  get: function () {
+    return _title.default;
+  }
+});
+var _hostComponent = _interopRequireDefault(require("./host-component"));
+var _isbn = _interopRequireDefault(require("./isbn"));
+var _issn = _interopRequireDefault(require("./issn"));
+var _otherStandardIdentifier = _interopRequireDefault(require("./other-standard-identifier"));
+var _title = _interopRequireDefault(require("./title"));
+var _authors = _interopRequireDefault(require("./authors"));
+var _recordType = _interopRequireDefault(require("./record-type"));
+var _publicationTime = _interopRequireDefault(require("./publication-time"));
+var _language = _interopRequireDefault(require("./language"));
+var _bibliographicLevel = _interopRequireDefault(require("./bibliographic-level"));
+var _melindaId = _interopRequireDefault(require("./melinda-id"));
+var _allSourceIds = _interopRequireDefault(require("./all-source-ids"));
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../../../src/match-detection/features/bib/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\nexport {default as hostComponent} from './host-component';\nexport {default as isbn} from './isbn';\nexport {default as issn} from './issn';\nexport {default as otherStandardIdentifier} from './other-standard-identifier';\nexport {default as title} from './title';\nexport {default as authors} from './authors';\nexport {default as recordType} from './record-type';\nexport {default as publicationTime} from './publication-time';\nexport {default as language} from './language';\nexport {default as bibliographicLevel} from './bibliographic-level';\nexport {default as melindaId} from './melinda-id';\nexport {default as allSourceIds} from './all-source-ids';\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAAyD"}