npm - @natlibfi/melinda-record-matching - Versions diffs - 2.2.0-alpha.3 → 2.2.0-alpha.4 - Mend

@natlibfi/melinda-record-matching 2.2.0-alpha.3 → 2.2.0-alpha.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (31) hide show

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

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~all-source-ids.js"],"names":["debug","debugData","extend","name","extract","record","fSids","get","length","JSON","stringify","sidFeatures","getSidFeatures","map","toSidFeature","filter","nonEmptySid","field","createSidFeature","sfC","sfB","compare","a","b","matches","sidA","some","sidB","sourceDb","sourceId","mismatches"],"~~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;AAKA,MAAMA,KAAK,GAAG,oBAAkB,2EAAlB,CAAd;AACA,MAAMC,SAAS,GAAGD,KAAK,CAACE,MAAN,CAAa,MAAb,CAAlB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;eAEe,OAAO;AACpBC,EAAAA,IAAI,EAAE,gBADc;AAEpBC,EAAAA,OAAO,EAAEC,MAAM,IAAI;AACjBL,IAAAA,KAAK,CAAE,6DAAF,CAAL;AAEA,UAAMM,KAAK,GAAGD,MAAM,CAACE,GAAP,CAAW,KAAX,CAAd;AACAN,IAAAA,SAAS,CAAE,eAAcK,KAAK,CAACE,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAeJ,KAAf,CAAsB,EAAxD,CAAT;AAEA,UAAMK,WAAW,GAAGC,cAAc,CAACN,KAAD,CAAlC;AACAL,IAAAA,SAAS,CAAE,iBAAgBU,WAAW,CAACH,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAeC,WAAf,CAA4B,EAAtE,CAAT;AAEA,WAAOA,WAAP;;AAEA,aAASC,cAAT,CAAwBN,KAAxB,EAA+B;AAC7BN,MAAAA,KAAK,CAAE,qCAAF,CAAL,CAD6B,CAG7B;;AACA,YAAMW,WAAW,GAAGL,KAAK,CAACO,GAAN,CAAUC,YAAV,EAAwBC,MAAxB,CAA+BC,WAAW,IAAIA,WAA9C,CAApB;AACA,aAAOL,WAAP;;AAEA,eAASG,YAAT,CAAsBG,KAAtB,EAA6B;AAC3BjB,QAAAA,KAAK,CAAE,8BAAF,CAAL;AAEA,eAAO,mDAA+BiB,KAA/~~B,IAAwCC,gBAAgB,CAACD,KAAD,CAAxD,GAAkE,EAAzE;;AAEA,iBAASC,gBAAT,CAA0BD,KAA1B,EAAiC;AAC~~/BjB,UAAAA,KAAK,CAAE,+BAAF,CAAL;AACA,gBAAM,CAACmB,GAAD,IAAQ,sCAAkBF,KAAlB,EAAyB,GAAzB,CAAd;AACA,gBAAM,CAACG,GAAD,IAAQ,sCAAkBH,KAAlB,EAAyB,GAAzB,CAAd;AAEAhB,UAAAA,SAAS,CAAE,GAAEQ,IAAI,CAACC,SAAL,CAAeS,GAAf,CAAoB,MAAKV,IAAI,CAACC,SAAL,CAAeU,GAAf,CAAoB,EAAjD,CAAT;AACAnB,UAAAA,SAAS,CAAE,aAAYmB,GAAI,eAAcD,GAAI,EAApC,CAAT;AACA,iBAAO;AAAC,wBAAYC,GAAb;AAAkB,wBAAYD;AAA9B,WAAP;AACD;AACF;AAEF;AAEF,GAtCmB;AAuCpBE,EAAAA,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;AAEjBtB,IAAAA,SAAS,CAAE,aAAYQ,IAAI,CAACC,SAAL,CAAeY,CAAf,CAAkB,QAAOb,IAAI,CAACC,SAAL,CAAea,CAAf,CAAkB,EAAzD,CAAT;AAEA,UAAMC,OAAO,GAAGF,CAAC,CAACP,MAAF,CAASU,IAAI,IAAIF,CAAC,CAACG,IAAF,CAAOC,IAAI,IAAIF,IAAI,CAACG,QAAL,KAAkBD,IAAI,CAACC,QAAvB,IACxCH,IAAI,CAACI,QAAL,KAAkBF,IAAI,CAACE,QADE,CAAjB,CAAhB;AAEA5B,IAAAA,SAAS,CAAE,YAAWuB,OAAO,CAAChB,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAec,OAAf,CAAwB,EAAzD,CAAT;AAEA,UAAMM,UAAU,GAAGR,CAAC,CAACP,MAAF,CAASU,IAAI,IAAIF,CAAC,CAACG,IAAF,CAAOC,IAAI,IAAIF,IAAI,CAACG,QAAL,KAAkBD,IAAI,CAACC,QAAvB,IACjDH,IAAI,CAACI,QAAL,KAAkBF,IAAI,CAACE,QADW,CAAjB,CAAnB;AAEA5B,IAAAA,SAAS,CAAE,eAAc6B,UAAU,CAACtB,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAeoB,UAAf,CAA2B,EAAlE,CAAT,CAViB,CAYjB;;AACA,QAAIA,UAAU,CAACtB,MAAX,GAAoB,CAAxB,EAA2B;AACzB,aAAO,CAAC,CAAR;AACD,KAfgB,CAiBjB;;;AACA,QAAIgB,OAAO,CAAChB,MAAR,GAAiB,CAArB,EAAwB;AACtB,aAAO,CAAP;AACD,KApBgB,CAsBjB;;;AACA,WAAO,CAAP;AAED;AAhEmB,CAAP,C","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"],"~~file~~":"~~all-source-ids.js~~"}
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;;;;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;AAKA,MAAMA,KAAK,GAAG,IAAAC,cAAA,EAAkB,2EAAlB,CAAd;AACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;eAEe,OAAO;EACpBC,IAAI,EAAE,gBADc;EAEpBC,OAAO,EAAEC,MAAM,IAAI;IACjBN,KAAK,CAAE,6DAAF,CAAL;IAEA,MAAMO,KAAK,GAAGD,MAAM,CAACE,GAAP,CAAW,KAAX,CAAd;IACAN,SAAS,CAAE,eAAcK,KAAK,CAACE,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAeJ,KAAf,CAAsB,EAAxD,CAAT;IAEA,MAAMK,WAAW,GAAGC,cAAc,CAACN,KAAD,CAAlC;IACAL,SAAS,CAAE,iBAAgBU,WAAW,CAACH,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAeC,WAAf,CAA4B,EAAtE,CAAT;IAEA,OAAOA,WAAP;;IAEA,SAASC,cAAT,CAAwBN,KAAxB,EAA+B;MAC7BP,KAAK,CAAE,qCAAF,CAAL,CAD6B,CAG7B;;MACA,MAAMY,WAAW,GAAGL,KAAK,CAACO,GAAN,CAAUC,YAAV,EAAwBC,MAAxB,CAA+BC,WAAW,IAAIA,WAA9C,CAApB;MACA,OAAOL,WAAP;;MAEA,SAASG,YAAT,CAAsBG,KAAtB,EAA6B;QAC3BlB,KAAK,CAAE,8BAAF,CAAL;QAEA,OAAO,IAAAmB,6CAAA,EAA+BD,KAA/B,IAAwCE,gBAAgB,CAACF,KAAD,CAAxD,GAAkE,EAAzE;;QAEA,SAASE,gBAAT,CAA0BF,KAA1B,EAAiC;UAC/BlB,KAAK,CAAE,+BAAF,CAAL;UACA,MAAM,CAACqB,GAAD,IAAQ,IAAAC,gCAAA,EAAkBJ,KAAlB,EAAyB,GAAzB,CAAd;UACA,MAAM,CAACK,GAAD,IAAQ,IAAAD,gCAAA,EAAkBJ,KAAlB,EAAyB,GAAzB,CAAd;UAEAhB,SAAS,CAAE,GAAEQ,IAAI,CAACC,SAAL,CAAeU,GAAf,CAAoB,MAAKX,IAAI,CAACC,SAAL,CAAeY,GAAf,CAAoB,EAAjD,CAAT;UACArB,SAAS,CAAE,aAAYqB,GAAI,eAAcF,GAAI,EAApC,CAAT;UACA,OAAO;YAAC,YAAYE,GAAb;YAAkB,YAAYF;UAA9B,CAAP;QACD;MACF;IAEF;EAEF,CAtCmB;EAuCpBG,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;IAEjBxB,SAAS,CAAE,aAAYQ,IAAI,CAACC,SAAL,CAAec,CAAf,CAAkB,QAAOf,IAAI,CAACC,SAAL,CAAee,CAAf,CAAkB,EAAzD,CAAT;IAEA,MAAMC,OAAO,GAAGF,CAAC,CAACT,MAAF,CAASY,IAAI,IAAIF,CAAC,CAACG,IAAF,CAAOC,IAAI,IAAIF,IAAI,CAACG,QAAL,KAAkBD,IAAI,CAACC,QAAvB,IACxCH,IAAI,CAACI,QAAL,KAAkBF,IAAI,CAACE,QADE,CAAjB,CAAhB;IAEA9B,SAAS,CAAE,YAAWyB,OAAO,CAAClB,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAegB,OAAf,CAAwB,EAAzD,CAAT;IAEA,MAAMM,UAAU,GAAGR,CAAC,CAACT,MAAF,CAASY,IAAI,IAAIF,CAAC,CAACG,IAAF,CAAOC,IAAI,IAAIF,IAAI,CAACG,QAAL,KAAkBD,IAAI,CAACC,QAAvB,IACjDH,IAAI,CAACI,QAAL,KAAkBF,IAAI,CAACE,QADW,CAAjB,CAAnB;IAEA9B,SAAS,CAAE,eAAc+B,UAAU,CAACxB,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAesB,UAAf,CAA2B,EAAlE,CAAT,CAViB,CAYjB;;IACA,IAAIA,UAAU,CAACxB,MAAX,GAAoB,CAAxB,EAA2B;MACzB,OAAO,CAAC,CAAR;IACD,CAfgB,CAiBjB;;;IACA,IAAIkB,OAAO,CAAClB,MAAR,GAAiB,CAArB,EAAwB;MACtB,OAAO,CAAP;IACD,CApBgB,CAsBjB;;;IACA,OAAO,CAAP;EAED;AAhEmB,CAAP,C"}

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

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~authors.js"],"names":["nameTreshold","name","extract","record","get","map","subfields","filter","code","value","includes","toObj","reduce","acc","v","replace","toLowerCase","id","compare","a","b","maxAuthors","length","matchingIds","findMatchingIds","matchingNames","findMatchingNames","idPoints","namePoints","totalPoints","findMatches","distance","maxLength","getMaxLength","percentage","key","cb","valuesA","o","valuesB","allValues","concat","occurrance","otherValue"],"~~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;eAIe,CAAC;AAACA,EAAAA,YAAY,GAAG;AAAhB,IAAsB,EAAvB,MAA+B;AAC5CC,EAAAA,IAAI,EAAE,SADsC;AAE5CC,EAAAA,OAAO,EAAEC,MAAM,IAAIA,MAAM,CAACC,GAAP,CAAW,oBAAX,EAChBC,GADgB,CACZ,CAAC;AAACC,IAAAA;AAAD,GAAD,KAAiB;AACpB,WAAOA,SAAS,CACbC,MADI,CACG,CAAC;AAACC,MAAAA,IAAD;AAAOC,MAAAA;AAAP,KAAD,KAAmBD,IAAI,IAAIC,KAD9B,EAEJF,MAFI,CAEG,CAAC;AAACC,MAAAA;AAAD,KAAD,KAAY,CAAC,GAAD,EAAM,GAAN,EAAWE,QAAX,CAAoBF,IAApB,CAFf,EAGJH,GAHI,CAGAM,KAHA,EAIJC,MAJI,CAIG,CAACC,GAAD,EAAMC,CAAN,MAAa,EAAC,GAAGD,GAAJ;AAAS,SAAGC;AAAZ,KAAb,CAJH,EAIiC,EAJjC,CAAP;;AAMA,aAASH,KAAT,CAAe;AAACH,MAAAA,IAAD;AAAOC,MAAAA;AAAP,KAAf,EAA8B;AAC5B,UAAID,IAAI,KAAK,GAAb,EAAkB;AAChB,eAAO;AAACP,UAAAA,IAAI,EAAEQ,KAAK,GAAGA,KAAK,CAACM,OAAN,CAAc,2BAAd,EAA2C,EAA3C,EAA+CC,WAA/C,EAAH,GAAkE;AAA9E,SAAP;AACD;;AAED,aAAO;AAACC,QAAAA,EAAE,EAAER;AAAL,OAAP;AACD;AACF,GAfgB,CAFyB;AAkB5CS,EAAAA,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;AACjB,UAAMC,UAAU,GAAGF,CAAC,CAACG,MAAF,GAAWF,CAAC,CAACE,MAAb,GAAsBH,CAAC,CAACG,MAAxB,GAAiCF,CAAC,CAACE,MAAtD;AACA,UAAMC,WAAW,GAAGC,eAAe,EAAnC;;AAEA,QAAIH,UAAU,IAAI,CAAd,IAAmBE,WAAW,IAAI,CAAtC,EAAyC;AACvC,aAAO,GAAP;AACD;;AAED,UAAME,aAAa,GAAGC,iBAAiB,EAAvC;AACA,UAAMC,QAAQ,GAAGJ,WAAW,GAAGF,UAAd,GAA2B,GAA5C;AACA,UAAMO,UAAU,GAAGH,aAAa,GAAGJ,UAAhB,GAA6B,GAAhD;AACA,UAAMQ,WAAW,GAAGF,QAAQ,GAAGC,UAA/B;AAEA,WAAOC,WAAW,IAAI,GAAf,GAAqBA,WAArB,GAAmC,GAA1C;;AAEA,aAASL,eAAT,GAA2B;AACzB,aAAOM,WAAW,CAAC,IAAD,EAAO,CAACX,CAAD,EAAIC,CAAJ,KAAUD,CAAC,KAAKC,CAAvB,CAAlB;AACD;;AAED,aAASM,iBAAT,GAA6B;AAC3B,aAAOI,WAAW,CAAC,MAAD,EAAS,CAACX,CAAD,EAAIC,CAAJ,KAAU;AACnC,cAAMW,QAAQ,GAAG,kCAAMZ,CAAN,EAASC,CAAT,CAAjB;;AAEA,YAAIW,QAAQ,KAAK,CAAjB,EAAoB;AAClB,iBAAO,IAAP;AACD;;AAED,cAAMC,SAAS,GAAGC,YAAY,EAA9B;AACA,cAAMC,UAAU,GAAGH,QAAQ,GAAGC,SAAX,GAAuB,GAA1C;AAEA,eAAOE,UAAU,IAAIlC,YAArB;;AAEA,iBAASiC,YAAT,GAAwB;AACtB,iBAAOd,CAAC,CAACG,MAAF,GAAWF,CAAC,CAACE,MAAb,GAAsBH,CAAC,CAACG,MAAxB,GAAiCF,CAAC,CAACE,MAA1C;AACD;AACF,OAfiB,CAAlB;AAgBD;;AAED,aAASQ,WAAT,CAAqBK,GAArB,EAA0BC,EAA1B,EAA8B;AAC5B,YAAMC,OAAO,GAAGlB,CAAC,CAACZ,MAAF,CAAS+B,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAf,EAAsB9B,GAAtB,CAA0BiC,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAhC,CAAhB;AACA,YAAMI,OAAO,GAAGnB,CAAC,CAACb,MAAF,CAAS+B,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAf,EAAsB9B,GAAtB,CAA0BiC,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAhC,CAAhB;AACA,YAAMK,SAAS,GAAGH,OAAO,CAACI,MAAR,CAAeF,OAAf,CAAlB;AAEA,aAAOC,SAAS,CAAC5B,MAAV,CAAiB,CAACC,GAAD,EAAMJ,KAAN,KAAgB;AACtC,cAAMiC,UAAU,GAAGF,SAAS,CAACjC,MAAV,CAAiBoC,UAAU,IAAIP,EAAE,CAAC3B,KAAD,EAAQkC,UAAR,CAAjC,EAAsDrB,MAAzE;AACA,eAAOoB,UAAU,IAAI,CAAd,GAAkB7B,GAAG,GAAG,CAAxB,GAA4BA,GAAnC;AACD,OAHM,EAGJ,CAHI,CAAP;AAID;AACF;AAlE2C,CAA/~~B,C~~","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 {LevenshteinDistance as leven} from 'natural';\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: value ? 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"],"~~file~~":"~~authors.js~~"}
1	+ {"version":3,"file":"authors.js","names":["nameTreshold","name","extract","record","get","map","subfields","filter","code","value","includes","toObj","reduce","acc","v","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 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';\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: value ? 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;;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;eAIe,CAAC;EAACA,YAAY,GAAG;AAAhB,IAAsB,EAAvB,MAA+B;EAC5CC,IAAI,EAAE,SADsC;EAE5CC,OAAO,EAAEC,MAAM,IAAIA,MAAM,CAACC,GAAP,CAAW,oBAAX,EAChBC,GADgB,CACZ,CAAC;IAACC;EAAD,CAAD,KAAiB;IACpB,OAAOA,SAAS,CACbC,MADI,CACG,CAAC;MAACC,IAAD;MAAOC;IAAP,CAAD,KAAmBD,IAAI,IAAIC,KAD9B,EAEJF,MAFI,CAEG,CAAC;MAACC;IAAD,CAAD,KAAY,CAAC,GAAD,EAAM,GAAN,EAAWE,QAAX,CAAoBF,IAApB,CAFf,EAGJH,GAHI,CAGAM,KAHA,EAIJC,MAJI,CAIG,CAACC,GAAD,EAAMC,CAAN,MAAa,EAAC,GAAGD,GAAJ;MAAS,GAAGC;IAAZ,CAAb,CAJH,EAIiC,EAJjC,CAAP;;IAMA,SAASH,KAAT,CAAe;MAACH,IAAD;MAAOC;IAAP,CAAf,EAA8B;MAC5B,IAAID,IAAI,KAAK,GAAb,EAAkB;QAChB,OAAO;UAACP,IAAI,EAAEQ,KAAK,GAAGA,KAAK,CAACM,OAAN,CAAc,2BAAd,EAA2C,EAA3C,EAA+CC,WAA/C,EAAH,GAAkE;QAA9E,CAAP;MACD;;MAED,OAAO;QAACC,EAAE,EAAER;MAAL,CAAP;IACD;EACF,CAfgB,CAFyB;EAkB5CS,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;IACjB,MAAMC,UAAU,GAAGF,CAAC,CAACG,MAAF,GAAWF,CAAC,CAACE,MAAb,GAAsBH,CAAC,CAACG,MAAxB,GAAiCF,CAAC,CAACE,MAAtD;IACA,MAAMC,WAAW,GAAGC,eAAe,EAAnC;;IAEA,IAAIH,UAAU,IAAI,CAAd,IAAmBE,WAAW,IAAI,CAAtC,EAAyC;MACvC,OAAO,GAAP;IACD;;IAED,MAAME,aAAa,GAAGC,iBAAiB,EAAvC;IACA,MAAMC,QAAQ,GAAGJ,WAAW,GAAGF,UAAd,GAA2B,GAA5C;IACA,MAAMO,UAAU,GAAGH,aAAa,GAAGJ,UAAhB,GAA6B,GAAhD;IACA,MAAMQ,WAAW,GAAGF,QAAQ,GAAGC,UAA/B;IAEA,OAAOC,WAAW,IAAI,GAAf,GAAqBA,WAArB,GAAmC,GAA1C;;IAEA,SAASL,eAAT,GAA2B;MACzB,OAAOM,WAAW,CAAC,IAAD,EAAO,CAACX,CAAD,EAAIC,CAAJ,KAAUD,CAAC,KAAKC,CAAvB,CAAlB;IACD;;IAED,SAASM,iBAAT,GAA6B;MAC3B,OAAOI,WAAW,CAAC,MAAD,EAAS,CAACX,CAAD,EAAIC,CAAJ,KAAU;QACnC,MAAMW,QAAQ,GAAG,IAAAC,4BAAA,EAAMb,CAAN,EAASC,CAAT,CAAjB;;QAEA,IAAIW,QAAQ,KAAK,CAAjB,EAAoB;UAClB,OAAO,IAAP;QACD;;QAED,MAAME,SAAS,GAAGC,YAAY,EAA9B;QACA,MAAMC,UAAU,GAAGJ,QAAQ,GAAGE,SAAX,GAAuB,GAA1C;QAEA,OAAOE,UAAU,IAAInC,YAArB;;QAEA,SAASkC,YAAT,GAAwB;UACtB,OAAOf,CAAC,CAACG,MAAF,GAAWF,CAAC,CAACE,MAAb,GAAsBH,CAAC,CAACG,MAAxB,GAAiCF,CAAC,CAACE,MAA1C;QACD;MACF,CAfiB,CAAlB;IAgBD;;IAED,SAASQ,WAAT,CAAqBM,GAArB,EAA0BC,EAA1B,EAA8B;MAC5B,MAAMC,OAAO,GAAGnB,CAAC,CAACZ,MAAF,CAASgC,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAf,EAAsB/B,GAAtB,CAA0BkC,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAhC,CAAhB;MACA,MAAMI,OAAO,GAAGpB,CAAC,CAACb,MAAF,CAASgC,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAf,EAAsB/B,GAAtB,CAA0BkC,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAhC,CAAhB;MACA,MAAMK,SAAS,GAAGH,OAAO,CAACI,MAAR,CAAeF,OAAf,CAAlB;MAEA,OAAOC,SAAS,CAAC7B,MAAV,CAAiB,CAACC,GAAD,EAAMJ,KAAN,KAAgB;QACtC,MAAMkC,UAAU,GAAGF,SAAS,CAAClC,MAAV,CAAiBqC,UAAU,IAAIP,EAAE,CAAC5B,KAAD,EAAQmC,UAAR,CAAjC,EAAsDtB,MAAzE;QACA,OAAOqB,UAAU,IAAI,CAAd,GAAkB9B,GAAG,GAAG,CAAxB,GAA4BA,GAAnC;MACD,CAHM,EAGJ,CAHI,CAAP;IAID;EACF;AAlE2C,CAA/B,C"}

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

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~bibliographic-level.js"],"names":["name","extract","r","leader","compare","a","b"],"~~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;eAEe,OAAO;AACpBA,EAAAA,IAAI,EAAE,qBADc;AAEpBC,EAAAA,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,MAAF,CAAS,CAAT,IAAc,CAACD,CAAC,CAACC,MAAF,CAAS,CAAT,CAAD,CAAd,GAA8B,EAFxB;AAGpBC,EAAAA,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AAHtB,CAAP,C","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"],"~~file~~":"~~bibliographic-level.js~~"}
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;eAEe,OAAO;EACpBA,IAAI,EAAE,qBADc;EAEpBC,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,MAAF,CAAS,CAAT,IAAc,CAACD,CAAC,CAACC,MAAF,CAAS,CAAT,CAAD,CAAd,GAA8B,EAFxB;EAGpBC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AAHtB,CAAP,C"}

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

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~host-component.js"],"names":["name","extract","r","get","length","compare","a","b"],"~~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;eAEe,OAAO;AACpBA,EAAAA,IAAI,EAAE,uBADc;AAEpBC,EAAAA,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,GAAF,CAAM,QAAN,EAAgBC,MAAhB,GAAyB,CAAzB,GAA6B,CAAC,WAAD,CAA7B,GAA6C,CAAC,MAAD,CAFvC;AAGpBC,EAAAA,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AAHtB,CAAP,C","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"],"~~file~~":"~~host-component.js~~"}
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;eAEe,OAAO;EACpBA,IAAI,EAAE,uBADc;EAEpBC,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,GAAF,CAAM,QAAN,EAAgBC,MAAhB,GAAyB,CAAzB,GAA6B,CAAC,WAAD,CAA7B,GAA6C,CAAC,MAAD,CAFvC;EAGpBC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AAHtB,CAAP,C"}

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

	@@ -1 +1 @@
1	- {"version":3,"sources":["../../../../src/match-detection/features/bib/index.js"],"~~names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA;;AACA","~~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"],"~~file~~":"~~index.js~~"}
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"}

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

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~index.spec.js"],"names":["describe","path","__dirname","useMetadataFile","fixura","reader","READERS","JSON","callback","enabled","feature","options","type","expectations","expectedFeatures","inputRecord","record","MarcRecord","subfieldValues","extract","features","to","eql","featuresA","featuresB","expectedPoints","compare","equal","Error"],"~~mappings~~":";;AA4BA;;AACA;;AACA;;AACA;;AACA;;;;;;;;AAhCA;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;AASAA,QAAQ,CAAC,+BAAD,EAAkC,MAAM;AAC9C,wBAAc;AACZC,IAAAA,IAAI,EAAE,CAACC,SAAD,EAAY,IAAZ,EAAkB,IAAlB,EAAwB,IAAxB,EAA8B,IAA9B,EAAoC,eAApC,EAAqD,iBAArD,EAAwE,UAAxE,EAAoF,KAApF,CADM;AAEZC,IAAAA,eAAe,EAAE,IAFL;AAGZC,IAAAA,MAAM,EAAE;AACNC,MAAAA,MAAM,EAAEC,gBAAQC;AADV,KAHI;AAMZ;AACAC,IAAAA,QAAQ,EAAE,CAAC;AAACC,MAAAA,OAAO,GAAG,IAAX;AAAiBC,MAAAA,OAAjB;AAA0BC,MAAAA,OAA1B;AAAmCC,MAAAA,IAAnC;AAAyC,SAAGC;AAA5C,KAAD,KAA+D;AAEvE,UAAI,CAACJ,OAAL,EAAc;AACZ;AACD;;AAED,UAAIG,IAAI,KAAK,SAAb,EAAwB;AACtB,cAAM;AAACE,UAAAA,gBAAD;AAAmBC,UAAAA;AAAnB,YAAkCF,YAAxC;AACA,cAAMG,MAAM,GAAG,IAAIC,sBAAJ,CAAeF,WAAf,EAA4B;AAACG,UAAAA,cAAc,EAAE;AAAjB,SAA5B,CAAf;AACA,cAAM;AAACC,UAAAA;AAAD,YAAYC,QAAQ,CAACV,OAAD,CAAR,CAAkBC,OAAlB,CAAlB;AAEA,0BAAOQ,OAAO,CAACH,MAAD,CAAd,EAAwBK,EAAxB,CAA2BC,GAA3B,CAA+BR,gBAA/~~B;AACA;AACD;;AAED,UAAIF,IAAI,KAAK,SAAb,EAAwB;AACtB,cAAM;AAACW,UAAAA,SAAD;AAAYC,UAAAA,SAAZ;AAAuBC,UAAAA;AAAvB,YAAyCZ,YAA~~/~~C;AACA,cAAM;AAACa,UAAAA;AAAD,YAAYN,QAAQ,CAACV,OAAD,CAAR,CAAkBC,OAAlB,CAAlB;AAEA,0BAAOe,OAAO,CAACH,SAAD,EAAYC,SAAZ,CAAd,EAAsCH,EAAtC,CAAyCM,KAAzC,CAA+CF,cAA~~/~~C;AACA;AACD;;AAED,YAAM,IAAIG,KAAJ,CAAW,gBAAehB,IAAK,EAA~~/~~B,CAAN;AACD;AA/BW,GAAd;AAiCD,CAlCO,CAAR~~","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 '.';\n\n\ndescribe('match-detection/features/bib/', () => {\n generateTests({\n path: [__dirname, '..', '..', '..', '..', 'test-fixtures', 'match-detection', 'features', 'bib'],\n useMetadataFile: true,\n fixura: {\n reader: READERS.JSON\n },\n // eslint-disable-next-line max-statements\n callback: ({enabled = true, feature, options, type, ...expectations}) => {\n\n if (!enabled) {\n return;\n }\n\n if (type === 'extract') {\n const {expectedFeatures, inputRecord} = expectations;\n const record = new MarcRecord(inputRecord, {subfieldValues: false});\n const {extract} = features[feature](options);\n\n expect(extract(record)).to.eql(expectedFeatures);\n return;\n }\n\n if (type === 'compare') {\n const {featuresA, featuresB, expectedPoints} = expectations;\n const {compare} = features[feature](options);\n\n expect(compare(featuresA, featuresB)).to.equal(expectedPoints);\n return;\n }\n\n throw new Error(`Invalid type ${type}`);\n }\n });\n});\n"],"~~file~~":"~~index.spec.js~~"}
1	+ {"version":3,"file":"index.spec.js","names":["describe","generateTests","path","__dirname","useMetadataFile","fixura","reader","READERS","JSON","callback","enabled","feature","options","type","expectations","expectedFeatures","inputRecord","record","MarcRecord","subfieldValues","extract","features","expect","to","eql","featuresA","featuresB","expectedPoints","compare","equal","Error"],"sources":["../../../../src/match-detection/features/bib/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 '.';\n\n\ndescribe('match-detection/features/bib/', () => {\n generateTests({\n path: [__dirname, '..', '..', '..', '..', 'test-fixtures', 'match-detection', 'features', 'bib'],\n useMetadataFile: true,\n fixura: {\n reader: READERS.JSON\n },\n // eslint-disable-next-line max-statements\n callback: ({enabled = true, feature, options, type, ...expectations}) => {\n\n if (!enabled) {\n return;\n }\n\n if (type === 'extract') {\n const {expectedFeatures, inputRecord} = expectations;\n const record = new MarcRecord(inputRecord, {subfieldValues: false});\n const {extract} = features[feature](options);\n\n expect(extract(record)).to.eql(expectedFeatures);\n return;\n }\n\n if (type === 'compare') {\n const {featuresA, featuresB, expectedPoints} = expectations;\n const {compare} = features[feature](options);\n\n expect(compare(featuresA, featuresB)).to.equal(expectedPoints);\n return;\n }\n\n throw new Error(`Invalid type ${type}`);\n }\n });\n});\n"],"mappings":";;AA4BA;;AACA;;AACA;;AACA;;AACA;;;;;;;;AAhCA;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;AASAA,QAAQ,CAAC,+BAAD,EAAkC,MAAM;EAC9C,IAAAC,gBAAA,EAAc;IACZC,IAAI,EAAE,CAACC,SAAD,EAAY,IAAZ,EAAkB,IAAlB,EAAwB,IAAxB,EAA8B,IAA9B,EAAoC,eAApC,EAAqD,iBAArD,EAAwE,UAAxE,EAAoF,KAApF,CADM;IAEZC,eAAe,EAAE,IAFL;IAGZC,MAAM,EAAE;MACNC,MAAM,EAAEC,eAAA,CAAQC;IADV,CAHI;IAMZ;IACAC,QAAQ,EAAE,CAAC;MAACC,OAAO,GAAG,IAAX;MAAiBC,OAAjB;MAA0BC,OAA1B;MAAmCC,IAAnC;MAAyC,GAAGC;IAA5C,CAAD,KAA+D;MAEvE,IAAI,CAACJ,OAAL,EAAc;QACZ;MACD;;MAED,IAAIG,IAAI,KAAK,SAAb,EAAwB;QACtB,MAAM;UAACE,gBAAD;UAAmBC;QAAnB,IAAkCF,YAAxC;QACA,MAAMG,MAAM,GAAG,IAAIC,sBAAJ,CAAeF,WAAf,EAA4B;UAACG,cAAc,EAAE;QAAjB,CAA5B,CAAf;QACA,MAAM;UAACC;QAAD,IAAYC,QAAQ,CAACV,OAAD,CAAR,CAAkBC,OAAlB,CAAlB;QAEA,IAAAU,YAAA,EAAOF,OAAO,CAACH,MAAD,CAAd,EAAwBM,EAAxB,CAA2BC,GAA3B,CAA+BT,gBAA/B;QACA;MACD;;MAED,IAAIF,IAAI,KAAK,SAAb,EAAwB;QACtB,MAAM;UAACY,SAAD;UAAYC,SAAZ;UAAuBC;QAAvB,IAAyCb,YAA/C;QACA,MAAM;UAACc;QAAD,IAAYP,QAAQ,CAACV,OAAD,CAAR,CAAkBC,OAAlB,CAAlB;QAEA,IAAAU,YAAA,EAAOM,OAAO,CAACH,SAAD,EAAYC,SAAZ,CAAd,EAAsCH,EAAtC,CAAyCM,KAAzC,CAA+CF,cAA/C;QACA;MACD;;MAED,MAAM,IAAIG,KAAJ,CAAW,gBAAejB,IAAK,EAA/B,CAAN;IACD;EA/BW,CAAd;AAiCD,CAlCO,CAAR"}

package/dist/match-detection/features/bib/isbn.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~isbn.js"],"names":["extract","compare","pattern","subfieldCodes","name"],"~~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;eAIe,MAAM;AACnB,QAAM;AAACA,IAAAA,OAAD;AAAUC,IAAAA;AAAV,MAAqB,wCAAgB;AAACC,IAAAA,OAAO,EAAE,QAAV;AAAoBC,IAAAA,aAAa,EAAE,CAAC,GAAD,EAAM,GAAN;AAAnC,GAAhB,CAA3B;AACA,SAAO;AAACH,IAAAA,OAAD;AAAUC,IAAAA,OAAV;AAAmBG,IAAAA,IAAI,EAAE;AAAzB,GAAP;AACD,C","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 createInterface from './standard-identifier-factory';\n\nexport default () => {\n const {extract, compare} = createInterface({pattern: /^020$/u, subfieldCodes: ['a', 'z']});\n return {extract, compare, name: 'ISBN'};\n};\n"],"~~file~~":"~~isbn.js~~"}
1	+ {"version":3,"file":"isbn.js","names":["extract","compare","createInterface","pattern","subfieldCodes","name"],"sources":["../../../../src/match-detection/features/bib/isbn.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 createInterface from './standard-identifier-factory';\n\nexport default () => {\n const {extract, compare} = createInterface({pattern: /^020$/u, subfieldCodes: ['a', 'z']});\n return {extract, compare, name: 'ISBN'};\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;eAIe,MAAM;EACnB,MAAM;IAACA,OAAD;IAAUC;EAAV,IAAqB,IAAAC,kCAAA,EAAgB;IAACC,OAAO,EAAE,QAAV;IAAoBC,aAAa,EAAE,CAAC,GAAD,EAAM,GAAN;EAAnC,CAAhB,CAA3B;EACA,OAAO;IAACJ,OAAD;IAAUC,OAAV;IAAmBI,IAAI,EAAE;EAAzB,CAAP;AACD,C"}

package/dist/match-detection/features/bib/issn.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~issn.js"],"names":["extract","compare","pattern","subfieldCodes","name"],"~~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;eAIe,MAAM;AACnB,QAAM;AAACA,IAAAA,OAAD;AAAUC,IAAAA;AAAV,MAAqB,wCAAgB;AAACC,IAAAA,OAAO,EAAE,QAAV;AAAoBC,IAAAA,aAAa,EAAE,CAAC,GAAD,EAAM,GAAN,EAAW,GAAX;AAAnC,GAAhB,CAA3B;AACA,SAAO;AAACH,IAAAA,OAAD;AAAUC,IAAAA,OAAV;AAAmBG,IAAAA,IAAI,EAAE;AAAzB,GAAP;AACD,C","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 createInterface from './standard-identifier-factory';\n\nexport default () => {\n const {extract, compare} = createInterface({pattern: /^022$/u, subfieldCodes: ['a', 'z', 'y']});\n return {extract, compare, name: 'ISSN'};\n};\n"],"~~file~~":"~~issn.js~~"}
1	+ {"version":3,"file":"issn.js","names":["extract","compare","createInterface","pattern","subfieldCodes","name"],"sources":["../../../../src/match-detection/features/bib/issn.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 createInterface from './standard-identifier-factory';\n\nexport default () => {\n const {extract, compare} = createInterface({pattern: /^022$/u, subfieldCodes: ['a', 'z', 'y']});\n return {extract, compare, name: 'ISSN'};\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;eAIe,MAAM;EACnB,MAAM;IAACA,OAAD;IAAUC;EAAV,IAAqB,IAAAC,kCAAA,EAAgB;IAACC,OAAO,EAAE,QAAV;IAAoBC,aAAa,EAAE,CAAC,GAAD,EAAM,GAAN,EAAW,GAAX;EAAnC,CAAhB,CAA3B;EACA,OAAO;IAACJ,OAAD;IAAUC,OAAV;IAAmBI,IAAI,EAAE;EAAzB,CAAP;AACD,C"}

package/dist/match-detection/features/bib/language.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~language.js"],"names":["debug","debugData","extend","name","extract","record","value008","get008Value","values041","get041Values","JSON","stringify","length","correspondingValue","find","v","value","get","undefined","code","slice","filter","ind2","map","subfields","flat","compare","a","b"],"~~mappings~~":";;;;;;;AA6BA;;;;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;AACA;AAIA,MAAMA,KAAK,GAAG,oBAAkB,qEAAlB,CAAd;AACA,MAAMC,SAAS,GAAGD,KAAK,CAACE,MAAN,CAAa,MAAb,CAAlB;;eAEe,OAAO;AACpBC,EAAAA,IAAI,EAAE,UADc;AAEpBC,EAAAA,OAAO,EAAEC,MAAM,IAAI;AACjB,UAAMC,QAAQ,GAAGC,WAAW,EAA5B;AACA,UAAMC,SAAS,GAAGC,YAAY,EAA9B;AACAR,IAAAA,SAAS,CAAE,QAAOS,IAAI,CAACC,SAAL,CAAeL,QAAf,CAAyB,UAASI,IAAI,CAACC,SAAL,CAAeH,SAAf,CAA0B,EAArE,CAAT;;AAEA,QAAIF,QAAQ,IAAIE,SAAS,CAACI,MAAV,GAAmB,CAAnC,EAAsC;AACpCX,MAAAA,SAAS,CAAE,uDAAF,CAAT;AACA,YAAMY,kBAAkB,GAAGL,SAAS,CAACM,IAAV,CAAeC,CAAC,IAAIA,CAAC,KAAKT,QAA1B,CAA3B;AACAL,MAAAA,SAAS,CAAE,wBAAuBY,kBAAmB,EAA5C,CAAT;AACA,aAAOA,kBAAkB,GAAG,CAACA,kBAAD,CAAH,GAA0B,EAAnD;AACD;;AAED,QAAI,CAACP,QAAD,IAAaE,SAAS,CAACI,MAAV,GAAmB,CAApC,EAAuC;AACrCX,MAAAA,SAAS,CAAE,wBAAF,CAAT;AACA,aAAO,EAAP;AACD;;AAED,WAAOK,QAAQ,GAAG,CAACA,QAAD,CAAH,GAAgB,CAACE,SAAS,CAAC,CAAD,CAAV,CAA/B;;AAEA,aAASD,WAAT,GAAuB;AAAA;;AACrB,YAAMS,KAAK,GAAG,gBAAAX,MAAM,CAACY,GAAP,CAAW,QAAX,6EAAuB,CAAvB,+DAA2BD,KAA3B,KAAoCE,SAAlD;AACAjB,MAAAA,SAAS,CAAE,cAAae,KAAM,EAArB,CAAT;;AAEA,UAAI,CAACA,KAAL,EAAY;AACV,eAAOE,SAAP;AACD;;AAED,YAAMC,IAAI,GAAGH,KAAK,CAACI,KAAN,CAAY,EAAZ,EAAgB,EAAhB,CAAb;AACAnB,MAAAA,SAAS,CAAE,aAAYkB,IAAK,EAAnB,CAAT;AACA,aAAOA,IAAI,KAAK,KAAT,IAAkBA,IAAI,KAAK,KAA3B,IAAoCA,IAAI,KAAK,KAA7C,GAAqDD,SAArD,GAAiEC,IAAxE;AACD,KA9BgB,CAgCjB;AACA;;;AAEA,aAASV,YAAT,GAAwB;AACtB,aAAOJ,MAAM,CAACY,GAAP,CAAW,QAAX,EACJI,MADI,CACG,CAAC;AAACC,QAAAA;AAAD,OAAD,KAAYA,IAAI,KAAK,GADxB,EAEJC,GAFI,CAEA,CAAC;AAACC,QAAAA;AAAD,OAAD,KAAiBA,SAFjB,EAGJC,IAHI,GAIJJ,MAJI,CAIG,CAAC;AAACF,QAAAA;AAAD,OAAD,KAAYA,IAAI,KAAK,GAAT,IAAgBA,IAAI,KAAK,GAJxC,EAKJI,GALI,CAKA,CAAC;AAACP,QAAAA;AAAD,OAAD,KAAaA,KALb,CAAP;AAMD;AACF,GA7CmB;AA8CpBU,EAAAA,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;AACjB3B,IAAAA,SAAS,CAAE,aAAYS,IAAI,CAACC,SAAL,CAAegB,CAAC,CAAC,CAAD,CAAhB,CAAqB,QAAOjB,IAAI,CAACC,SAAL,CAAeiB,CAAC,CAAC,CAAD,CAAhB,CAAqB,EAA/D,CAAT;;AAEA,QAAID,CAAC,CAACf,MAAF,KAAa,CAAb,IAAkBgB,CAAC,CAAChB,MAAF,KAAa,CAAnC,EAAsC;AACpCX,MAAAA,SAAS,CAAE,wBAAF,CAAT;AACA,aAAO,CAAP;AACD;;AAEDA,IAAAA,SAAS,CAAE,iCAAF,CAAT;;AAEA,QAAI0B,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAd,EAAmB;AACjB,aAAO,GAAP;AACD;;AAED,WAAOD,CAAC,CAAC,CAAD,CAAD,KAAS,KAAT,IAAkBC,CAAC,CAAC,CAAD,CAAD,KAAS,KAA3B,GAAmC,GAAnC,GAAyC,CAAC,GAAjD;AACD;AA7DmB,CAAP,C","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';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features:language');\nconst debugData = debug.extend('data');\n\nexport default () => ({\n name: 'Language',\n extract: record => {\n const value008 = get008Value();\n const values041 = get041Values();\n debugData(`008: ${JSON.stringify(value008)}, 041: ${JSON.stringify(values041)}`);\n\n if (value008 && values041.length > 0) {\n debugData(`There's both 008 and 041, searching for value in both`);\n const correspondingValue = values041.find(v => v === value008);\n debugData(`Corresponding value: ${correspondingValue}`);\n return correspondingValue ? [correspondingValue] : [];\n }\n\n if (!value008 && values041.length < 1) {\n debugData(`No actual values found`);\n return [];\n }\n\n return value008 ? [value008] : [values041[0]];\n\n function get008Value() {\n const value = record.get(/^008$/u)?.[0]?.value \|\| undefined;\n debugData(`008 value: ${value}`);\n\n if (!value) {\n return undefined;\n }\n\n const code = value.slice(35, 38);\n debugData(`008 code: ${code}`);\n return code === '\|\|\|' \|\| code === ' ' \|\| code === '^^^' ? undefined : code;\n }\n\n // Main language for the resource: in the first f041 $a or f041 $d\n // Uses only f041s that have 2nd ind ' ', which means that the codes used are MARC 21 language codes\n\n function get041Values() {\n return record.get(/^041$/u)\n .filter(({ind2}) => ind2 === ' ')\n .map(({subfields}) => subfields)\n .flat()\n .filter(({code}) => code === 'a' \|\| code === 'd')\n .map(({value}) => value);\n }\n },\n compare: (a, b) => {\n debugData(`Comparing ${JSON.stringify(a[0])} and ${JSON.stringify(b[0])}`);\n\n if (a.length === 0 \|\| b.length === 0) {\n debugData(`No language to compare`);\n return 0;\n }\n\n debugData(`There area languages to compare`);\n\n if (a[0] === b[0]) {\n return 0.1;\n }\n\n return a[0] === 'und' \|\| b[0] === 'und' ? 0.0 : -1.0;\n }\n});\n"],"~~file~~":"~~language.js~~"}
1	+ {"version":3,"file":"language.js","names":["debug","createDebugLogger","debugData","extend","name","extract","record","value008","get008Value","values041","get041Values","JSON","stringify","length","correspondingValue","find","v","value","get","undefined","code","slice","filter","ind2","map","subfields","flat","compare","a","b"],"sources":["../../../../src/match-detection/features/bib/language.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';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features:language');\nconst debugData = debug.extend('data');\n\nexport default () => ({\n name: 'Language',\n extract: record => {\n const value008 = get008Value();\n const values041 = get041Values();\n debugData(`008: ${JSON.stringify(value008)}, 041: ${JSON.stringify(values041)}`);\n\n if (value008 && values041.length > 0) {\n debugData(`There's both 008 and 041, searching for value in both`);\n const correspondingValue = values041.find(v => v === value008);\n debugData(`Corresponding value: ${correspondingValue}`);\n return correspondingValue ? [correspondingValue] : [];\n }\n\n if (!value008 && values041.length < 1) {\n debugData(`No actual values found`);\n return [];\n }\n\n return value008 ? [value008] : [values041[0]];\n\n function get008Value() {\n const value = record.get(/^008$/u)?.[0]?.value \|\| undefined;\n debugData(`008 value: ${value}`);\n\n if (!value) {\n return undefined;\n }\n\n const code = value.slice(35, 38);\n debugData(`008 code: ${code}`);\n return code === '\|\|\|' \|\| code === ' ' \|\| code === '^^^' ? undefined : code;\n }\n\n // Main language for the resource: in the first f041 $a or f041 $d\n // Uses only f041s that have 2nd ind ' ', which means that the codes used are MARC 21 language codes\n\n function get041Values() {\n return record.get(/^041$/u)\n .filter(({ind2}) => ind2 === ' ')\n .map(({subfields}) => subfields)\n .flat()\n .filter(({code}) => code === 'a' \|\| code === 'd')\n .map(({value}) => value);\n }\n },\n compare: (a, b) => {\n debugData(`Comparing ${JSON.stringify(a[0])} and ${JSON.stringify(b[0])}`);\n\n if (a.length === 0 \|\| b.length === 0) {\n debugData(`No language to compare`);\n return 0;\n }\n\n debugData(`There area languages to compare`);\n\n if (a[0] === b[0]) {\n return 0.1;\n }\n\n return a[0] === 'und' \|\| b[0] === 'und' ? 0.0 : -1.0;\n }\n});\n"],"mappings":";;;;;;;AA6BA;;;;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;AACA;AAIA,MAAMA,KAAK,GAAG,IAAAC,cAAA,EAAkB,qEAAlB,CAAd;AACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;;eAEe,OAAO;EACpBC,IAAI,EAAE,UADc;EAEpBC,OAAO,EAAEC,MAAM,IAAI;IACjB,MAAMC,QAAQ,GAAGC,WAAW,EAA5B;IACA,MAAMC,SAAS,GAAGC,YAAY,EAA9B;IACAR,SAAS,CAAE,QAAOS,IAAI,CAACC,SAAL,CAAeL,QAAf,CAAyB,UAASI,IAAI,CAACC,SAAL,CAAeH,SAAf,CAA0B,EAArE,CAAT;;IAEA,IAAIF,QAAQ,IAAIE,SAAS,CAACI,MAAV,GAAmB,CAAnC,EAAsC;MACpCX,SAAS,CAAE,uDAAF,CAAT;MACA,MAAMY,kBAAkB,GAAGL,SAAS,CAACM,IAAV,CAAeC,CAAC,IAAIA,CAAC,KAAKT,QAA1B,CAA3B;MACAL,SAAS,CAAE,wBAAuBY,kBAAmB,EAA5C,CAAT;MACA,OAAOA,kBAAkB,GAAG,CAACA,kBAAD,CAAH,GAA0B,EAAnD;IACD;;IAED,IAAI,CAACP,QAAD,IAAaE,SAAS,CAACI,MAAV,GAAmB,CAApC,EAAuC;MACrCX,SAAS,CAAE,wBAAF,CAAT;MACA,OAAO,EAAP;IACD;;IAED,OAAOK,QAAQ,GAAG,CAACA,QAAD,CAAH,GAAgB,CAACE,SAAS,CAAC,CAAD,CAAV,CAA/B;;IAEA,SAASD,WAAT,GAAuB;MAAA;;MACrB,MAAMS,KAAK,GAAG,gBAAAX,MAAM,CAACY,GAAP,CAAW,QAAX,6EAAuB,CAAvB,+DAA2BD,KAA3B,KAAoCE,SAAlD;MACAjB,SAAS,CAAE,cAAae,KAAM,EAArB,CAAT;;MAEA,IAAI,CAACA,KAAL,EAAY;QACV,OAAOE,SAAP;MACD;;MAED,MAAMC,IAAI,GAAGH,KAAK,CAACI,KAAN,CAAY,EAAZ,EAAgB,EAAhB,CAAb;MACAnB,SAAS,CAAE,aAAYkB,IAAK,EAAnB,CAAT;MACA,OAAOA,IAAI,KAAK,KAAT,IAAkBA,IAAI,KAAK,KAA3B,IAAoCA,IAAI,KAAK,KAA7C,GAAqDD,SAArD,GAAiEC,IAAxE;IACD,CA9BgB,CAgCjB;IACA;;;IAEA,SAASV,YAAT,GAAwB;MACtB,OAAOJ,MAAM,CAACY,GAAP,CAAW,QAAX,EACJI,MADI,CACG,CAAC;QAACC;MAAD,CAAD,KAAYA,IAAI,KAAK,GADxB,EAEJC,GAFI,CAEA,CAAC;QAACC;MAAD,CAAD,KAAiBA,SAFjB,EAGJC,IAHI,GAIJJ,MAJI,CAIG,CAAC;QAACF;MAAD,CAAD,KAAYA,IAAI,KAAK,GAAT,IAAgBA,IAAI,KAAK,GAJxC,EAKJI,GALI,CAKA,CAAC;QAACP;MAAD,CAAD,KAAaA,KALb,CAAP;IAMD;EACF,CA7CmB;EA8CpBU,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;IACjB3B,SAAS,CAAE,aAAYS,IAAI,CAACC,SAAL,CAAegB,CAAC,CAAC,CAAD,CAAhB,CAAqB,QAAOjB,IAAI,CAACC,SAAL,CAAeiB,CAAC,CAAC,CAAD,CAAhB,CAAqB,EAA/D,CAAT;;IAEA,IAAID,CAAC,CAACf,MAAF,KAAa,CAAb,IAAkBgB,CAAC,CAAChB,MAAF,KAAa,CAAnC,EAAsC;MACpCX,SAAS,CAAE,wBAAF,CAAT;MACA,OAAO,CAAP;IACD;;IAEDA,SAAS,CAAE,iCAAF,CAAT;;IAEA,IAAI0B,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAd,EAAmB;MACjB,OAAO,GAAP;IACD;;IAED,OAAOD,CAAC,CAAC,CAAD,CAAD,KAAS,KAAT,IAAkBC,CAAC,CAAC,CAAD,CAAD,KAAS,KAA3B,GAAmC,GAAnC,GAAyC,CAAC,GAAjD;EACD;AA7DmB,CAAP,C"}

package/dist/match-detection/features/bib/melinda-id.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~melinda-id.js"],"names":["extract","compare","name"],"~~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;eAIe,MAAM;AACnB,QAAM;AAACA,IAAAA,OAAD;AAAUC,IAAAA;AAAV,MAAqB,wCAA3B;AACA,SAAO;AAACD,IAAAA,OAAD;AAAUC,IAAAA,OAAV;AAAmBC,IAAAA,IAAI,EAAE;AAAzB,GAAP;AACD,C","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 createInterface from './melinda-identifier-factory';\n\nexport default () => {\n const {extract, compare} = createInterface();\n return {extract, compare, name: 'melinda-id'};\n};\n"],"~~file~~":"~~melinda-id.js~~"}
1	+ {"version":3,"file":"melinda-id.js","names":["extract","compare","createInterface","name"],"sources":["../../../../src/match-detection/features/bib/melinda-id.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 createInterface from './melinda-identifier-factory';\n\nexport default () => {\n const {extract, compare} = createInterface();\n return {extract, compare, name: 'melinda-id'};\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;eAIe,MAAM;EACnB,MAAM;IAACA,OAAD;IAAUC;EAAV,IAAqB,IAAAC,iCAAA,GAA3B;EACA,OAAO;IAACF,OAAD;IAAUC,OAAV;IAAmBE,IAAI,EAAE;EAAzB,CAAP;AACD,C"}

package/dist/match-detection/features/bib/melinda-identifier-factory.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~melinda-identifier-factory.js"],"names":["debug","debugData","extend","extract","compare","record","isMelindaRecord","get","some","f003","value","f001","map","field","f035MelindaIds","undefined","length","a","b","id","JSON","stringify","idA","idB"],"~~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;AACA;AACA;AACA;AACA;AACA;eAEe,MAAM;AAEnB,QAAMA,KAAK,GAAG,oBAAkB,2EAAlB,CAAd;AACA,QAAMC,SAAS,GAAGD,KAAK,CAACE,MAAN,CAAa,MAAb,CAAlB;AAEA,SAAO;AAACC,IAAAA,OAAD;AAAUC,IAAAA;AAAV,GAAP;;AAEA,WAASD,OAAT,CAAiBE,MAAjB,EAAyB;AAEvB,UAAMC,eAAe,GAAGD,MAAM,CAACE,GAAP,CAAW,KAAX,EAAkBC,IAAlB,CAAuBC,IAAI,IAAIA,IAAI,CAACC,KAAL,KAAe,YAA9C,CAAxB;AACA,UAAM,CAACC,IAAD,IAASN,MAAM,CAACE,GAAP,CAAW,KAAX,EAAkBK,GAAlB,CAAsBC,KAAK,IAAIA,KAAK,CAACH,KAArC,CAAf;AACA,UAAMI,cAAc,GAAG,sCAAkBT,MAAlB,CAAvB;;AAEA,QACEC,eAAe,KAAKS,SAApB,IACAJ,IAAI,KAAKI,SADT,IAEAD,cAAc,CAACE,MAAf,GAAwB,CAH1B,EAG6B;AAE3BhB,MAAAA,KAAK,CAAE,sBAAF,CAAL;AACA,aAAO,EAAP;AACD;;AAED,WAAO;AAACM,MAAAA,eAAD;AAAkBK,MAAAA,IAAlB;AAAwBG,MAAAA;AAAxB,KAAP;AAED,GAxBkB,CA0BnB;;;AACA,WAASV,OAAT,CAAiBa,CAAjB,EAAoBC,CAApB,EAAuB;AAErB,QAAID,CAAC,CAACX,eAAF,IAAqBY,CAAC,CAACZ,eAAvB,IACAW,CAAC,CAACN,IAAF,KAAWO,CAAC,CAACP,IADjB,EACuB;AACrBV,MAAAA,SAAS,CAAE,2BAA0BgB,CAAC,CAACN,IAAK,oCAAmCM,CAAC,CAACN,IAAK,EAA7E,CAAT;AACA,aAAO,CAAP;AACD;;AAED,QAAIM,CAAC,CAACX,eAAF,IAAqB,OAAOY,CAAC,CAACJ,cAAT,KAA4B,WAAjD,IACAI,CAAC,CAACJ,cAAF,CAAiBN,IAAjB,CAAsBW,EAAE,IAAIA,EAAE,KAAKF,CAAC,CAACN,IAArC,CADJ,EACgD;AAC9CV,MAAAA,SAAS,CAAE,2BAA0BgB,CAAC,CAACN,IAAK,0BAAyBS,IAAI,CAACC,SAAL,CAAeH,CAAC,CAACJ,cAAjB,CAAiC,EAA7F,CAAT;AACA,aAAO,CAAP;AACD;;AAED,QAAII,CAAC,CAACZ,eAAF,IAAqB,OAAOW,CAAC,CAACH,cAAT,KAA4B,WAAjD,IACAG,CAAC,CAACH,cAAF,CAAiBN,IAAjB,CAAsBW,EAAE,IAAIA,EAAE,KAAKD,CAAC,CAACP,IAArC,CADJ,EACgD;AAC9CV,MAAAA,SAAS,CAAE,2BAA0BiB,CAAC,CAACP,IAAK,0BAAyBS,IAAI,CAACC,SAAL,CAAeJ,CAAC,CAACH,cAAjB,CAAiC,EAA7F,CAAT;AACA,aAAO,CAAP;AACD;;AAED,QAAI,OAAOG,CAAC,CAACH,cAAT,KAA4B,WAA5B,IAA2C,OAAOI,CAAC,CAACJ,cAAT,KAA4B,WAAvE,IACCG,CAAC,CAACH,cAAF,CAAiBN,IAAjB,CAAsBc,GAAG,IAAIJ,CAAC,CAACJ,cAAF,CAAiBN,IAAjB,CAAsBe,GAAG,IAAIA,GAAG,KAAKD,GAArC,CAA7B,CADL,EAC8E;AAC5ErB,MAAAA,SAAS,CAAE,iBAAgBmB,IAAI,CAACC,SAAL,CAAeJ,CAAC,CAACH,cAAjB,CAAiC,0BAAyBM,IAAI,CAACC,SAAL,CAAeH,CAAC,CAACJ,cAAjB,CAAiC,EAA7G,CAAT;AACA,aAAO,CAAP;AACD;;AACDd,IAAAA,KAAK,CAAE,0BAAF,CAAL;AACA,WAAO,CAAP;AACD;AACF,C","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 createDebugLogger from 'debug';\nimport {getMelindaIdsF035} from '../../../matching-utils';\n\n// 003+001 FI-MELINDA <melinda-id>\n// 035 $a (FI-MELINDA)<melinda-id>\n// 035 $z (FI-MELINDA)<melinda-id>\n// 035 $a FCC<melinda-id>\n// 035 $z FCC<melinda-id>\n// melinda-id = 001234567\n\nexport default () => {\n\n const debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features/bib/melinda-id');\n const debugData = debug.extend('data');\n\n return {extract, compare};\n\n function extract(record) {\n\n const isMelindaRecord = record.get('003').some(f003 => f003.value === 'FI-MELINDA');\n const [f001] = record.get('001').map(field => field.value);\n const f035MelindaIds = getMelindaIdsF035(record);\n\n if (\n isMelindaRecord === undefined &&\n f001 === undefined &&\n f035MelindaIds.length < 1) {\n\n debug(`No Melinda-IDs found`);\n return {};\n }\n\n return {isMelindaRecord, f001, f035MelindaIds};\n\n }\n\n // eslint-disable-next-line max-statements\n function compare(a, b) {\n\n if (a.isMelindaRecord && b.isMelindaRecord &&\n a.f001 === b.f001) {\n debugData(`Melinda record's A f001 ${a.f001} matches Melinda record's B f001 ${a.f001}`);\n return 1;\n }\n\n if (a.isMelindaRecord && typeof b.f035MelindaIds !== 'undefined' &&\n b.f035MelindaIds.some(id => id === a.f001)) {\n debugData(`Melinda record's A f001 ${a.f001} matches record B f035 ${JSON.stringify(b.f035MelindaIds)}`);\n return 1;\n }\n\n if (b.isMelindaRecord && typeof a.f035MelindaIds !== 'undefined' &&\n a.f035MelindaIds.some(id => id === b.f001)) {\n debugData(`Melinda record's B f001 ${b.f001} matches record A f035 ${JSON.stringify(a.f035MelindaIds)}`);\n return 1;\n }\n\n if (typeof a.f035MelindaIds !== 'undefined' && typeof b.f035MelindaIds !== 'undefined' &&\n a.f035MelindaIds.some(idA => b.f035MelindaIds.some(idB => idB === idA))) {\n debugData(`Record A f035 ${JSON.stringify(a.f035MelindaIds)} matches record B f035 ${JSON.stringify(b.f035MelindaIds)}`);\n return 1;\n }\n debug(`No matching Melinda-IDs.`);\n return 0;\n }\n};\n"],"~~file~~":"~~melinda-identifier-factory.js~~"}
1	+ {"version":3,"file":"melinda-identifier-factory.js","names":["debug","createDebugLogger","debugData","extend","extract","compare","record","isMelindaRecord","get","some","f003","value","f001","map","field","f035MelindaIds","getMelindaIdsF035","undefined","length","a","b","id","JSON","stringify","idA","idB"],"sources":["../../../../src/match-detection/features/bib/melinda-identifier-factory.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 createDebugLogger from 'debug';\nimport {getMelindaIdsF035} from '../../../matching-utils';\n\n// 003+001 FI-MELINDA <melinda-id>\n// 035 $a (FI-MELINDA)<melinda-id>\n// 035 $z (FI-MELINDA)<melinda-id>\n// 035 $a FCC<melinda-id>\n// 035 $z FCC<melinda-id>\n// melinda-id = 001234567\n\nexport default () => {\n\n const debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features/bib/melinda-id');\n const debugData = debug.extend('data');\n\n return {extract, compare};\n\n function extract(record) {\n\n const isMelindaRecord = record.get('003').some(f003 => f003.value === 'FI-MELINDA');\n const [f001] = record.get('001').map(field => field.value);\n const f035MelindaIds = getMelindaIdsF035(record);\n\n if (\n isMelindaRecord === undefined &&\n f001 === undefined &&\n f035MelindaIds.length < 1) {\n\n debug(`No Melinda-IDs found`);\n return {};\n }\n\n return {isMelindaRecord, f001, f035MelindaIds};\n\n }\n\n // eslint-disable-next-line max-statements\n function compare(a, b) {\n\n if (a.isMelindaRecord && b.isMelindaRecord &&\n a.f001 === b.f001) {\n debugData(`Melinda record's A f001 ${a.f001} matches Melinda record's B f001 ${a.f001}`);\n return 1;\n }\n\n if (a.isMelindaRecord && typeof b.f035MelindaIds !== 'undefined' &&\n b.f035MelindaIds.some(id => id === a.f001)) {\n debugData(`Melinda record's A f001 ${a.f001} matches record B f035 ${JSON.stringify(b.f035MelindaIds)}`);\n return 1;\n }\n\n if (b.isMelindaRecord && typeof a.f035MelindaIds !== 'undefined' &&\n a.f035MelindaIds.some(id => id === b.f001)) {\n debugData(`Melinda record's B f001 ${b.f001} matches record A f035 ${JSON.stringify(a.f035MelindaIds)}`);\n return 1;\n }\n\n if (typeof a.f035MelindaIds !== 'undefined' && typeof b.f035MelindaIds !== 'undefined' &&\n a.f035MelindaIds.some(idA => b.f035MelindaIds.some(idB => idB === idA))) {\n debugData(`Record A f035 ${JSON.stringify(a.f035MelindaIds)} matches record B f035 ${JSON.stringify(b.f035MelindaIds)}`);\n return 1;\n }\n debug(`No matching Melinda-IDs.`);\n return 0;\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;AACA;AACA;AACA;AACA;AACA;eAEe,MAAM;EAEnB,MAAMA,KAAK,GAAG,IAAAC,cAAA,EAAkB,2EAAlB,CAAd;EACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;EAEA,OAAO;IAACC,OAAD;IAAUC;EAAV,CAAP;;EAEA,SAASD,OAAT,CAAiBE,MAAjB,EAAyB;IAEvB,MAAMC,eAAe,GAAGD,MAAM,CAACE,GAAP,CAAW,KAAX,EAAkBC,IAAlB,CAAuBC,IAAI,IAAIA,IAAI,CAACC,KAAL,KAAe,YAA9C,CAAxB;IACA,MAAM,CAACC,IAAD,IAASN,MAAM,CAACE,GAAP,CAAW,KAAX,EAAkBK,GAAlB,CAAsBC,KAAK,IAAIA,KAAK,CAACH,KAArC,CAAf;IACA,MAAMI,cAAc,GAAG,IAAAC,gCAAA,EAAkBV,MAAlB,CAAvB;;IAEA,IACEC,eAAe,KAAKU,SAApB,IACAL,IAAI,KAAKK,SADT,IAEAF,cAAc,CAACG,MAAf,GAAwB,CAH1B,EAG6B;MAE3BlB,KAAK,CAAE,sBAAF,CAAL;MACA,OAAO,EAAP;IACD;;IAED,OAAO;MAACO,eAAD;MAAkBK,IAAlB;MAAwBG;IAAxB,CAAP;EAED,CAxBkB,CA0BnB;;;EACA,SAASV,OAAT,CAAiBc,CAAjB,EAAoBC,CAApB,EAAuB;IAErB,IAAID,CAAC,CAACZ,eAAF,IAAqBa,CAAC,CAACb,eAAvB,IACAY,CAAC,CAACP,IAAF,KAAWQ,CAAC,CAACR,IADjB,EACuB;MACrBV,SAAS,CAAE,2BAA0BiB,CAAC,CAACP,IAAK,oCAAmCO,CAAC,CAACP,IAAK,EAA7E,CAAT;MACA,OAAO,CAAP;IACD;;IAED,IAAIO,CAAC,CAACZ,eAAF,IAAqB,OAAOa,CAAC,CAACL,cAAT,KAA4B,WAAjD,IACAK,CAAC,CAACL,cAAF,CAAiBN,IAAjB,CAAsBY,EAAE,IAAIA,EAAE,KAAKF,CAAC,CAACP,IAArC,CADJ,EACgD;MAC9CV,SAAS,CAAE,2BAA0BiB,CAAC,CAACP,IAAK,0BAAyBU,IAAI,CAACC,SAAL,CAAeH,CAAC,CAACL,cAAjB,CAAiC,EAA7F,CAAT;MACA,OAAO,CAAP;IACD;;IAED,IAAIK,CAAC,CAACb,eAAF,IAAqB,OAAOY,CAAC,CAACJ,cAAT,KAA4B,WAAjD,IACAI,CAAC,CAACJ,cAAF,CAAiBN,IAAjB,CAAsBY,EAAE,IAAIA,EAAE,KAAKD,CAAC,CAACR,IAArC,CADJ,EACgD;MAC9CV,SAAS,CAAE,2BAA0BkB,CAAC,CAACR,IAAK,0BAAyBU,IAAI,CAACC,SAAL,CAAeJ,CAAC,CAACJ,cAAjB,CAAiC,EAA7F,CAAT;MACA,OAAO,CAAP;IACD;;IAED,IAAI,OAAOI,CAAC,CAACJ,cAAT,KAA4B,WAA5B,IAA2C,OAAOK,CAAC,CAACL,cAAT,KAA4B,WAAvE,IACCI,CAAC,CAACJ,cAAF,CAAiBN,IAAjB,CAAsBe,GAAG,IAAIJ,CAAC,CAACL,cAAF,CAAiBN,IAAjB,CAAsBgB,GAAG,IAAIA,GAAG,KAAKD,GAArC,CAA7B,CADL,EAC8E;MAC5EtB,SAAS,CAAE,iBAAgBoB,IAAI,CAACC,SAAL,CAAeJ,CAAC,CAACJ,cAAjB,CAAiC,0BAAyBO,IAAI,CAACC,SAAL,CAAeH,CAAC,CAACL,cAAjB,CAAiC,EAA7G,CAAT;MACA,OAAO,CAAP;IACD;;IACDf,KAAK,CAAE,0BAAF,CAAL;IACA,OAAO,CAAP;EACD;AACF,C"}

package/dist/match-detection/features/bib/other-standard-identifier.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~other-standard-identifier.js"],"names":["extract","compare","pattern","subfieldCodes","name"],"~~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;eAIe,MAAM;AACnB,QAAM;AAACA,IAAAA,OAAD;AAAUC,IAAAA;AAAV,MAAqB,wCAAgB;AAACC,IAAAA,OAAO,EAAE,QAAV;AAAoBC,IAAAA,aAAa,EAAE,CAAC,GAAD,EAAM,GAAN;AAAnC,GAAhB,CAA3B;AACA,SAAO;AAACH,IAAAA,OAAD;AAAUC,IAAAA,OAAV;AAAmBG,IAAAA,IAAI,EAAE;AAAzB,GAAP;AACD,C","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 createInterface from './standard-identifier-factory';\n\nexport default () => {\n const {extract, compare} = createInterface({pattern: /^024$/u, subfieldCodes: ['a', 'z']});\n return {extract, compare, name: 'Other standard identifier'};\n};\n"],"~~file~~":"~~other-standard-identifier.js~~"}
1	+ {"version":3,"file":"other-standard-identifier.js","names":["extract","compare","createInterface","pattern","subfieldCodes","name"],"sources":["../../../../src/match-detection/features/bib/other-standard-identifier.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 createInterface from './standard-identifier-factory';\n\nexport default () => {\n const {extract, compare} = createInterface({pattern: /^024$/u, subfieldCodes: ['a', 'z']});\n return {extract, compare, name: 'Other standard identifier'};\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;eAIe,MAAM;EACnB,MAAM;IAACA,OAAD;IAAUC;EAAV,IAAqB,IAAAC,kCAAA,EAAgB;IAACC,OAAO,EAAE,QAAV;IAAoBC,aAAa,EAAE,CAAC,GAAD,EAAM,GAAN;EAAnC,CAAhB,CAA3B;EACA,OAAO;IAACJ,OAAD;IAAUC,OAAV;IAAmBI,IAAI,EAAE;EAAzB,CAAP;AACD,C"}

package/dist/match-detection/features/bib/publication-time.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~publication-time.js"],"names":["name","extract","record","value","get","slice","compare","a","b"],"~~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;eAEe,OAAO;AACpBA,EAAAA,IAAI,EAAE,kBADc;AAEpBC,EAAAA,OAAO,EAAEC,MAAM,IAAI;AAAA;;AACjB,UAAMC,KAAK,GAAG,gBAAAD,MAAM,CAACE,GAAP,CAAW,QAAX,6EAAuB,CAAvB,+DAA2BD,KAA3B,KAAoC,EAAlD;AACA,WAAOA,KAAK,GAAG,CAACA,KAAK,CAACE,KAAN,CAAY,CAAZ,EAAe,EAAf,CAAD,CAAH,GAA0B,EAAtC;AACD,GALmB;AAMpBC,EAAAA,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AANtB,CAAP,C","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: 'Publication time',\n extract: record => {\n const value = record.get(/^008$/u)?.[0]?.value \|\| '';\n return value ? [value.slice(7, 11)] : [];\n },\n compare: (a, b) => a[0] === b[0] ? 0.1 : -1.0\n});\n"],"~~file~~":"~~publication-time.js~~"}
1	+ {"version":3,"file":"publication-time.js","names":["name","extract","record","value","get","slice","compare","a","b"],"sources":["../../../../src/match-detection/features/bib/publication-time.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: 'Publication time',\n extract: record => {\n const value = record.get(/^008$/u)?.[0]?.value \|\| '';\n return value ? [value.slice(7, 11)] : [];\n },\n compare: (a, b) => a[0] === b[0] ? 0.1 : -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;eAEe,OAAO;EACpBA,IAAI,EAAE,kBADc;EAEpBC,OAAO,EAAEC,MAAM,IAAI;IAAA;;IACjB,MAAMC,KAAK,GAAG,gBAAAD,MAAM,CAACE,GAAP,CAAW,QAAX,6EAAuB,CAAvB,+DAA2BD,KAA3B,KAAoC,EAAlD;IACA,OAAOA,KAAK,GAAG,CAACA,KAAK,CAACE,KAAN,CAAY,CAAZ,EAAe,EAAf,CAAD,CAAH,GAA0B,EAAtC;EACD,CALmB;EAMpBC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AANtB,CAAP,C"}

package/dist/match-detection/features/bib/record-type.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~record-type.js"],"names":["name","extract","r","leader","compare","a","b"],"~~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;eAEe,OAAO;AACpBA,EAAAA,IAAI,EAAE,aADc;AAEpBC,EAAAA,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,MAAF,CAAS,CAAT,IAAc,CAACD,CAAC,CAACC,MAAF,CAAS,CAAT,CAAD,CAAd,GAA8B,EAFxB;AAGpBC,EAAAA,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AAHtB,CAAP,C","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: 'Record type',\n extract: r => r.leader[6] ? [r.leader[6]] : [],\n compare: (a, b) => a[0] === b[0] ? 0.1 : -0.5\n});\n"],"~~file~~":"~~record-type.js~~"}
1	+ {"version":3,"file":"record-type.js","names":["name","extract","r","leader","compare","a","b"],"sources":["../../../../src/match-detection/features/bib/record-type.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: 'Record type',\n extract: r => r.leader[6] ? [r.leader[6]] : [],\n compare: (a, b) => a[0] === b[0] ? 0.1 : -0.5\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;eAEe,OAAO;EACpBA,IAAI,EAAE,aADc;EAEpBC,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,MAAF,CAAS,CAAT,IAAc,CAACD,CAAC,CAACC,MAAF,CAAS,CAAT,CAAD,CAAd,GAA8B,EAFxB;EAGpBC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AAHtB,CAAP,C"}

package/dist/match-detection/features/bib/standard-identifier-factory.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~standard-identifier-factory.js"],"names":["debug","debugData","extend","pattern","subfieldCodes","extract","compare","record","field","get","subfields","filter","code","includes","map","value","replace","a","b","length","bothHaveValidIdentifiers","maxValues","matchingValues","getValueCount","aValues","bValues","validOnly","getIdentifiers","aValue","some","bValue","values"],"~~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,oBAAkB,iFAAlB,CAAd;AACA,MAAMC,SAAS,GAAGD,KAAK,CAACE,MAAN,CAAa,MAAb,CAAlB;;eAEe,CAAC;AAACC,EAAAA,OAAD;AAAUC,EAAAA;AAAV,CAAD,KAA8B;AAC3C,SAAO;AAACC,IAAAA,OAAD;AAAUC,IAAAA;AAAV,GAAP;;AAEA,WAASD,OAAT,CAAiBE,MAAjB,EAAyB;AACvB,UAAM,CAACC,KAAD,IAAUD,MAAM,CAACE,GAAP,CAAWN,OAAX,CAAhB;;AAEA,QAAIK,KAAJ,EAAW;AACT,aAAOA,KAAK,CAACE,SAAN,CACJC,MADI,CACG,CAAC;AAACC,QAAAA;AAAD,OAAD,KAAYR,aAAa,CAACS,QAAd,CAAuBD,IAAvB,CADf,EAEP;AAFO,OAGJE,GAHI,CAGA,CAAC;AAACF,QAAAA,IAAD;AAAOG,QAAAA;AAAP,OAAD,MAAoB;AAACH,QAAAA,IAAD;AAAOG,QAAAA,KAAK,EAAEA,KAAK,GAAGA,KAAK,CAACC,OAAN,CAAc,KAAd,EAAqB,EAArB,CAAH,GAA8B;AAAjD,OAApB,CAHA,CAAP;AAID;;AAED,WAAO,EAAP;AACD;;AAED,WAASV,OAAT,CAAiBW,CAAjB,EAAoBC,CAApB,EAAuB;AACrB,QAAID,CAAC,CAACE,MAAF,KAAa,CAAb,IAAkBD,CAAC,CAACC,MAAF,KAAa,CAAnC,EAAsC;AACpClB,MAAAA,SAAS,CAAE,mCAAF,CAAT;AACA,aAAO,CAAP;AACD;;AAED,QAAImB,wBAAwB,EAA5B,EAAgC;AAC9B,YAAM;AAACC,QAAAA,SAAD;AAAYC,QAAAA;AAAZ,UAA8BC,aAAa,CAAC,IAAD,CAAjD;AACA,aAAOD,cAAc,GAAGD,SAAjB,GAA6B,IAApC;AACD;;AAED,UAAM;AAACA,MAAAA,SAAD;AAAYC,MAAAA;AAAZ,QAA8BC,aAAa,EAAjD;AACA,WAAOD,cAAc,GAAGD,SAAjB,GAA6B,GAApC;;AAEA,aAASD,wBAAT,GAAoC;AAClC,YAAMI,OAAO,GAAGP,CAAC,CAACN,MAAF,CAAS,CAAC;AAACC,QAAAA;AAAD,OAAD,KAAYA,IAAI,KAAK,GAA9B,CAAhB;AACA,YAAMa,OAAO,GAAGR,CAAC,CAACN,MAAF,CAAS,CAAC;AAACC,QAAAA;AAAD,OAAD,KAAYA,IAAI,KAAK,GAA9B,CAAhB;AACA,aAAOY,OAAO,CAACL,MAAR,GAAiB,CAAjB,IAAsBM,OAAO,CAACN,MAAR,GAAiB,CAA9C;AACD;;AAED,aAASI,aAAT,CAAuBG,SAAS,GAAG,KAAnC,EAA0C;AACxC,YAAMF,OAAO,GAAGG,cAAc,CAACV,CAAD,CAA9B;AACA,YAAMQ,OAAO,GAAGE,cAAc,CAACT,CAAD,CAA9B;AAEA,aAAO;AACLG,QAAAA,SAAS,EAAEG,OAAO,CAACL,MAAR,GAAiBM,OAAO,CAACN,MAAzB,GAAkCK,OAAO,CAACL,MAA1C,GAAmDM,OAAO,CAACN,MADjE;AAELG,QAAAA,cAAc,EAAEE,OAAO,CAACb,MAAR,CAAeiB,MAAM,IAAIH,OAAO,CAACI,IAAR,CAAaC,MAAM,IAAIF,MAAM,KAAKE,MAAlC,CAAzB,EAAoEX;AAF/E,OAAP;;AAKA,eAASQ,cAAT,CAAwBI,MAAxB,EAAgC;AAC9B,YAAIL,SAAJ,EAAe;AACb,iBAAOK,MAAM,CACVpB,MADI,CACG,CAAC;AAACC,YAAAA;AAAD,WAAD,KAAYA,IAAI,KAAK,GADxB,EAEJE,GAFI,CAEA,CAAC;AAACC,YAAAA;AAAD,WAAD,KAAaA,KAFb,CAAP;AAGD;;AAED,eAAOgB,MAAM,CAACjB,GAAP,CAAW,CAAC;AAACC,UAAAA;AAAD,SAAD,KAAaA,KAAxB,CAAP;AACD;AACF;AACF;AACF,C","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 createDebugLogger from 'debug';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features:standard-identifiers');\nconst debugData = debug.extend('data');\n\nexport default ({pattern, subfieldCodes}) => {\n return {extract, compare};\n\n function extract(record) {\n const [field] = record.get(pattern);\n\n if (field) {\n return field.subfields\n .filter(({code}) => subfieldCodes.includes(code))\n // .map(({code, value}) => ({code, value: value.replace(/-/ug, '')}));\n .map(({code, value}) => ({code, value: value ? value.replace(/-/ug, '') : ''}));\n }\n\n return [];\n }\n\n function compare(a, b) {\n if (a.length === 0 \|\| b.length === 0) {\n debugData(`No standardidentifiers to compare`);\n return 0;\n }\n\n if (bothHaveValidIdentifiers()) {\n const {maxValues, matchingValues} = getValueCount(true);\n return matchingValues / maxValues * 0.75;\n }\n\n const {maxValues, matchingValues} = getValueCount();\n return matchingValues / maxValues * 0.2;\n\n function bothHaveValidIdentifiers() {\n const aValues = a.filter(({code}) => code === 'a');\n const bValues = a.filter(({code}) => code === 'a');\n return aValues.length > 0 && bValues.length > 0;\n }\n\n function getValueCount(validOnly = false) {\n const aValues = getIdentifiers(a);\n const bValues = getIdentifiers(b);\n\n return {\n maxValues: aValues.length > bValues.length ? aValues.length : bValues.length,\n matchingValues: aValues.filter(aValue => bValues.some(bValue => aValue === bValue)).length\n };\n\n function getIdentifiers(values) {\n if (validOnly) {\n return values\n .filter(({code}) => code === 'a')\n .map(({value}) => value);\n }\n\n return values.map(({value}) => value);\n }\n }\n }\n};\n"],"~~file~~":"~~standard-identifier-factory.js~~"}
1	+ {"version":3,"file":"standard-identifier-factory.js","names":["debug","createDebugLogger","debugData","extend","pattern","subfieldCodes","extract","compare","record","field","get","subfields","filter","code","includes","map","value","replace","a","b","length","bothHaveValidIdentifiers","maxValues","matchingValues","getValueCount","aValues","bValues","validOnly","getIdentifiers","aValue","some","bValue","values"],"sources":["../../../../src/match-detection/features/bib/standard-identifier-factory.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 createDebugLogger from 'debug';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features:standard-identifiers');\nconst debugData = debug.extend('data');\n\nexport default ({pattern, subfieldCodes}) => {\n return {extract, compare};\n\n function extract(record) {\n const [field] = record.get(pattern);\n\n if (field) {\n return field.subfields\n .filter(({code}) => subfieldCodes.includes(code))\n // .map(({code, value}) => ({code, value: value.replace(/-/ug, '')}));\n .map(({code, value}) => ({code, value: value ? value.replace(/-/ug, '') : ''}));\n }\n\n return [];\n }\n\n function compare(a, b) {\n if (a.length === 0 \|\| b.length === 0) {\n debugData(`No standardidentifiers to compare`);\n return 0;\n }\n\n if (bothHaveValidIdentifiers()) {\n const {maxValues, matchingValues} = getValueCount(true);\n return matchingValues / maxValues * 0.75;\n }\n\n const {maxValues, matchingValues} = getValueCount();\n return matchingValues / maxValues * 0.2;\n\n function bothHaveValidIdentifiers() {\n const aValues = a.filter(({code}) => code === 'a');\n const bValues = a.filter(({code}) => code === 'a');\n return aValues.length > 0 && bValues.length > 0;\n }\n\n function getValueCount(validOnly = false) {\n const aValues = getIdentifiers(a);\n const bValues = getIdentifiers(b);\n\n return {\n maxValues: aValues.length > bValues.length ? aValues.length : bValues.length,\n matchingValues: aValues.filter(aValue => bValues.some(bValue => aValue === bValue)).length\n };\n\n function getIdentifiers(values) {\n if (validOnly) {\n return values\n .filter(({code}) => code === 'a')\n .map(({value}) => value);\n }\n\n return values.map(({value}) => value);\n }\n }\n }\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,iFAAlB,CAAd;AACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;;eAEe,CAAC;EAACC,OAAD;EAAUC;AAAV,CAAD,KAA8B;EAC3C,OAAO;IAACC,OAAD;IAAUC;EAAV,CAAP;;EAEA,SAASD,OAAT,CAAiBE,MAAjB,EAAyB;IACvB,MAAM,CAACC,KAAD,IAAUD,MAAM,CAACE,GAAP,CAAWN,OAAX,CAAhB;;IAEA,IAAIK,KAAJ,EAAW;MACT,OAAOA,KAAK,CAACE,SAAN,CACJC,MADI,CACG,CAAC;QAACC;MAAD,CAAD,KAAYR,aAAa,CAACS,QAAd,CAAuBD,IAAvB,CADf,EAEP;MAFO,CAGJE,GAHI,CAGA,CAAC;QAACF,IAAD;QAAOG;MAAP,CAAD,MAAoB;QAACH,IAAD;QAAOG,KAAK,EAAEA,KAAK,GAAGA,KAAK,CAACC,OAAN,CAAc,KAAd,EAAqB,EAArB,CAAH,GAA8B;MAAjD,CAApB,CAHA,CAAP;IAID;;IAED,OAAO,EAAP;EACD;;EAED,SAASV,OAAT,CAAiBW,CAAjB,EAAoBC,CAApB,EAAuB;IACrB,IAAID,CAAC,CAACE,MAAF,KAAa,CAAb,IAAkBD,CAAC,CAACC,MAAF,KAAa,CAAnC,EAAsC;MACpClB,SAAS,CAAE,mCAAF,CAAT;MACA,OAAO,CAAP;IACD;;IAED,IAAImB,wBAAwB,EAA5B,EAAgC;MAC9B,MAAM;QAACC,SAAD;QAAYC;MAAZ,IAA8BC,aAAa,CAAC,IAAD,CAAjD;MACA,OAAOD,cAAc,GAAGD,SAAjB,GAA6B,IAApC;IACD;;IAED,MAAM;MAACA,SAAD;MAAYC;IAAZ,IAA8BC,aAAa,EAAjD;IACA,OAAOD,cAAc,GAAGD,SAAjB,GAA6B,GAApC;;IAEA,SAASD,wBAAT,GAAoC;MAClC,MAAMI,OAAO,GAAGP,CAAC,CAACN,MAAF,CAAS,CAAC;QAACC;MAAD,CAAD,KAAYA,IAAI,KAAK,GAA9B,CAAhB;MACA,MAAMa,OAAO,GAAGR,CAAC,CAACN,MAAF,CAAS,CAAC;QAACC;MAAD,CAAD,KAAYA,IAAI,KAAK,GAA9B,CAAhB;MACA,OAAOY,OAAO,CAACL,MAAR,GAAiB,CAAjB,IAAsBM,OAAO,CAACN,MAAR,GAAiB,CAA9C;IACD;;IAED,SAASI,aAAT,CAAuBG,SAAS,GAAG,KAAnC,EAA0C;MACxC,MAAMF,OAAO,GAAGG,cAAc,CAACV,CAAD,CAA9B;MACA,MAAMQ,OAAO,GAAGE,cAAc,CAACT,CAAD,CAA9B;MAEA,OAAO;QACLG,SAAS,EAAEG,OAAO,CAACL,MAAR,GAAiBM,OAAO,CAACN,MAAzB,GAAkCK,OAAO,CAACL,MAA1C,GAAmDM,OAAO,CAACN,MADjE;QAELG,cAAc,EAAEE,OAAO,CAACb,MAAR,CAAeiB,MAAM,IAAIH,OAAO,CAACI,IAAR,CAAaC,MAAM,IAAIF,MAAM,KAAKE,MAAlC,CAAzB,EAAoEX;MAF/E,CAAP;;MAKA,SAASQ,cAAT,CAAwBI,MAAxB,EAAgC;QAC9B,IAAIL,SAAJ,EAAe;UACb,OAAOK,MAAM,CACVpB,MADI,CACG,CAAC;YAACC;UAAD,CAAD,KAAYA,IAAI,KAAK,GADxB,EAEJE,GAFI,CAEA,CAAC;YAACC;UAAD,CAAD,KAAaA,KAFb,CAAP;QAGD;;QAED,OAAOgB,MAAM,CAACjB,GAAP,CAAW,CAAC;UAACC;QAAD,CAAD,KAAaA,KAAxB,CAAP;MACD;IACF;EACF;AACF,C"}

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

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../../src/match-detection/features/bib/~~title.js"],"names":["treshold","name","extract","record","title","getTitle","replace","toLowerCase","field","get","subfields","filter","code","includes","map","value","join","compare","a","b","debug","distance","maxLength","getMaxLength","percentage","length"],"~~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;eAKe,CAAC;AAACA,EAAAA,QAAQ,GAAG;AAAZ,IAAkB,EAAnB,MAA2B;AACxCC,EAAAA,IAAI,EAAE,OADkC;AAExCC,EAAAA,OAAO,EAAEC,MAAM,IAAI;AACjB,UAAMC,KAAK,GAAGC,QAAQ,EAAtB;;AAEA,QAAID,KAAJ,EAAW;AACT,aAAO,CAACA,KAAK,CAACE,OAAN,CAAc,2BAAd,EAA2C,EAA3C,EAA+CC,WAA/C,EAAD,CAAP;AACD;;AAED,WAAO,EAAP;;AAEA,aAASF,QAAT,GAAoB;AAClB,YAAM,CAACG,KAAD,IAAUL,MAAM,CAACM,GAAP,CAAW,QAAX,CAAhB;;AAEA,UAAID,KAAJ,EAAW;AACT,eAAOA,KAAK,CAACE,SAAN,CACJC,MADI,CACG,CAAC;AAACC,UAAAA;AAAD,SAAD,KAAY,CAAC,GAAD,EAAM,GAAN,EAAWC,QAAX,CAAoBD,IAApB,CADf,EAEJE,GAFI,CAEA,CAAC;AAACC,UAAAA;AAAD,SAAD,KAAaA,KAFb,EAGJC,IAHI,CAGC,EAHD,CAAP;AAID;AACF;AACF,GArBuC;AAsBxCC,EAAAA,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;AACjB,UAAMC,KAAK,GAAG,oBAAkB,sEAAlB,CAAd;AACA,UAAMC,QAAQ,GAAG,kCAAMH,CAAC,CAAC,CAAD,CAAP,EAAYC,CAAC,CAAC,CAAD,CAAb,CAAjB;;AAEA,QAAIE,QAAQ,KAAK,CAAjB,EAAoB;AAClB,aAAO,GAAP;AACD;;AAED,UAAMC,SAAS,GAAGC,YAAY,EAA9B;AACA,UAAMC,UAAU,GAAGH,QAAQ,GAAGC,SAAX,GAAuB,GAA1C;AAEAF,IAAAA,KAAK,CAAE,IAAGF,CAAE,SAAQC,CAAE,mBAAkBG,SAAU,gBAAeD,QAAS,kBAAiBG,UAAW,EAAjG,CAAL;;AAEA,QAAIA,UAAU,IAAIxB,QAAlB,EAA4B;AAC1B,aAAO,GAAP;AACD;;AAED,WAAO,CAAC,GAAR;;AAEA,aAASuB,YAAT,GAAwB;AACtB,aAAOL,CAAC,CAAC,CAAD,CAAD,CAAKO,MAAL,GAAcN,CAAC,CAAC,CAAD,CAAD,CAAKM,MAAnB,GAA4BP,CAAC,CAAC,CAAD,CAAD,CAAKO,MAAjC,GAA0CN,CAAC,CAAC,CAAD,CAAD,CAAKM,MAAtD;AACD;AAEF;AA7CuC,CAA3B,C","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 createDebugLogger from 'debug';\nimport {LevenshteinDistance as leven} from 'natural';\n\nexport default ({treshold = 10} = {}) => ({\n name: 'Title',\n extract: record => {\n const title = getTitle();\n\n if (title) {\n return [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}) => value)\n .join('');\n }\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"],"~~file~~":"~~title.js~~"}
1	+ {"version":3,"file":"title.js","names":["treshold","name","extract","record","title","getTitle","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 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';\n\nexport default ({treshold = 10} = {}) => ({\n name: 'Title',\n extract: record => {\n const title = getTitle();\n\n if (title) {\n return [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}) => value)\n .join('');\n }\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;;;;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;eAKe,CAAC;EAACA,QAAQ,GAAG;AAAZ,IAAkB,EAAnB,MAA2B;EACxCC,IAAI,EAAE,OADkC;EAExCC,OAAO,EAAEC,MAAM,IAAI;IACjB,MAAMC,KAAK,GAAGC,QAAQ,EAAtB;;IAEA,IAAID,KAAJ,EAAW;MACT,OAAO,CAACA,KAAK,CAACE,OAAN,CAAc,2BAAd,EAA2C,EAA3C,EAA+CC,WAA/C,EAAD,CAAP;IACD;;IAED,OAAO,EAAP;;IAEA,SAASF,QAAT,GAAoB;MAClB,MAAM,CAACG,KAAD,IAAUL,MAAM,CAACM,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,KAAaA,KAFb,EAGJC,IAHI,CAGC,EAHD,CAAP;MAID;IACF;EACF,CArBuC;EAsBxCC,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,IAAI1B,QAAlB,EAA4B;MAC1B,OAAO,GAAP;IACD;;IAED,OAAO,CAAC,GAAR;;IAEA,SAASyB,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;AA7CuC,CAA3B,C"}

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

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../../src/match-detection/features/~~index.js"],"names":[],"~~mappings~~":"~~;;;;;;;AA4BA~~","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"],"~~file~~":"~~index.js~~"}
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"}

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

	@@ -1 +1 @@
1	- {"version":3,"sources":["../../src/match-detection/index.js"],"names":["strategy","treshold","returnStrategy","recordA","recordB","minProbabilityQuantifier","debug","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"],"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;AAACA,EAAAA,QAAD;AAAWC,EAAAA,QAAQ,GAAG;AAAtB,CAAD,EAA6BC,cAAc,GAAG,KAA9C,KAAwD,CAACC,OAAD,EAAUC,OAAV,KAAsB;AAC3F,QAAMC,wBAAwB,GAAG,GAAjC;AAEA,QAAMC,KAAK,GAAG,oBAAkB,mDAAlB,CAAd;AACA,QAAMC,SAAS,GAAGD,KAAK,CAACE,MAAN,CAAa,MAAb,CAAlB;AAEAD,EAAAA,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAL,CAAeV,QAAf,CAAyB,EAAvC,CAAT;AACAO,EAAAA,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAL,CAAeT,QAAf,CAAyB,EAAvC,CAAT;AACAM,EAAAA,SAAS,CAAE,mBAAkBE,IAAI,CAACC,SAAL,CAAeR,cAAf,CAA+B,EAAnD,CAAT;AAEA,QAAMS,SAAS,GAAGC,eAAe,CAACT,OAAD,CAAjC;AAEAG,EAAAA,KAAK,CAAE,+BAA8BO,KAAK,CAACC,OAAN,CAAcV,OAAd,CAAuB,EAAvD,CAAL;AACA,QAAMW,QAAQ,GAAGF,KAAK,CAACC,OAAN,CAAcV,OAAd,IAAyBA,OAAzB,GAAmC,CAACA,OAAD,CAApD;AACA,QAAMY,gBAAgB,GAAGD,QAAQ,CAACE,GAAT,CAAaC,MAAM,IAAIC,eAAe,CAACR,SAAD,EAAYO,MAAZ,CAAtC,CAAzB;AAEA,SAAOL,KAAK,CAACC,OAAN,CAAcV,OAAd,IAAyBY,gBAAzB,GAA4CA,gBAAgB,CAAC,CAAD,CAAnE;;AAEA,WAASG,eAAT,CAAyBR,SAAzB,EAAoCO,MAApC,EAA4C;AAE1C,UAAME,SAAS,GAAGR,eAAe,CAACM,MAAD,CAAjC;AAEAX,IAAAA,SAAS,CAAE,iBAAgBE,IAAI,CAACC,SAAL,CAAeC,SAAf,CAA0B,EAA5C,CAAT;AACAJ,IAAAA,SAAS,CAAE,iBAAgBE,IAAI,CAACC,SAAL,CAAeU,SAAf,CAA0B,EAA5C,CAAT;AAEA,UAAMC,YAAY,GAAGC,oBAAoB,CAACX,SAAD,EAAYS,SAAZ,CAAzC;AACA,UAAMG,gBAAgB,GAAGC,wBAAwB,CAACH,YAAD,CAAjD;;AAEA,QAAIE,gBAAgB,CAACE,IAAjB,CAAsBC,CAAC,IAAIA,CAAC,IAAIrB,wBAAhC,CAAJ,EAA+D;AAC7D,YAAMsB,WAAW,GAAGC,oBAAoB,CAACL,gBAAD,CAAxC;AACAjB,MAAAA,KAAK,CAAE,gBAAeqB,WAAY,eAAc1B,QAAS,GAApD,CAAL;AACA,aAAO4B,YAAY,CAAC;AAACC,QAAAA,KAAK,EAAEH,WAAW,IAAI1B,QAAvB;AAAiC0B,QAAAA;AAAjC,OAAD,CAAnB;AACD;;AAEDpB,IAAAA,SAAS,CAAE,4DAA2DF,wBAAyB,GAAtF,CAAT;AACA,WAAOwB,YAAY,CAAC;AAACC,MAAAA,KAAK,EAAE,KAAR;AAAeH,MAAAA,WAAW,EAAE;AAA5B,KAAD,CAAnB;AACD;;AAED,WAASf,eAAT,CAAyBM,MAAzB,EAAiC;AAC/B,WAAOlB,QAAQ,CAAC+B,MAAT,CAAgB,CAACC,GAAD,EAAM;AAACC,MAAAA,IAAD;AAAOC,MAAAA;AAAP,KAAN,KAA0BF,GAAG,CAACG,MAAJ,CAAW;AAACF,MAAAA,IAAD;AAAOG,MAAAA,KAAK,EAAEF,OAAO,CAAChB,MAAD;AAArB,KAAX,CAA1C,EAAsF,EAAtF,CAAP;AACD;;AAED,WAASW,YAAT,CAAsBQ,MAAtB,EAA8B;AAC5B,QAAInC,cAAJ,EAAoB;AAClBI,MAAAA,KAAK,CAAE,8CAAF,CAAL;AACA,YAAMgC,kBAAkB,GAAG;AAACR,QAAAA,KAAK,EAAEO,MAAM,CAACP,KAAf;AAAsBH,QAAAA,WAAW,EAAEU,MAAM,CAACV,WAA1C;AAAuD3B,QAAAA,QAAQ,EAAEuC,cAAc,CAACvC,QAAD,CAA/E;AAA2FC,QAAAA;AAA3F,OAA3B;AACAM,MAAAA,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAL,CAAe4B,kBAAf,CAAmC,EAAvC,CAAT;AACA,aAAOA,kBAAP;AACD;;AACD,WAAOD,MAAP;AACD;;AAED,WAASE,cAAT,CAAwBvC,QAAxB,EAAkC;AAChC,UAAMwC,aAAa,GAAGxC,QAAQ,CAACiB,GAAT,CAAawB,OAAO,IAAIA,OAAO,CAACR,IAAhC,CAAtB;AACA,WAAOO,aAAa,IAAI,EAAxB;AACD;;AAED,WAASZ,oBAAT,CAA8BL,gBAA9B,EAAgD;AAC9C,UAAMI,WAAW,GAAGJ,gBAAgB,CAACQ,MAAjB,CAAwB,CAACC,GAAD,EAAMN,CAAN,KAAYM,GAAG,GAAGN,CAA1C,EAA6C,GAA7C,CAApB;AACA,WAAOC,WAAW,GAAG,GAAd,GAAoB,GAApB,GAA0BA,WAAjC;AACD;;AAED,WAASH,wBAAT,CAAkCH,YAAlC,EAAgD;AAC9C,UAAMqB,QAAQ,GAAGrB,YAAY,CAACJ,GAAb,CAAiB,CAAC;AAACgB,MAAAA,IAAD;AAAOU,MAAAA,CAAP;AAAUC,MAAAA;AAAV,KAAD,KAAkB;AAClD,YAAM;AAACC,QAAAA;AAAD,UAAY7C,QAAQ,CAAC8C,IAAT,CAAc,CAAC;AAACb,QAAAA,IAAI,EAAEc;AAAP,OAAD,KAAyBd,IAAI,KAAKc,WAAhD,CAAlB;AACA,YAAMC,MAAM,GAAGH,OAAO,CAACF,CAAD,EAAIC,CAAJ,CAAtB;AACA,aAAO;AAACX,QAAAA,IAAD;AAAOe,QAAAA;AAAP,OAAP;AACD,KAJgB,CAAjB;AAMAzC,IAAAA,SAAS,CAAE,WAAUE,IAAI,CAACC,SAAL,CAAegC,QAAf,CAAyB,EAArC,CAAT;AACA,WAAOA,QAAQ,CAACzB,GAAT,CAAa,CAAC;AAAC+B,MAAAA;AAAD,KAAD,KAAcA,MAA3B,CAAP;AACD;;AAED,WAAS1B,oBAAT,CAA8BX,SAA9B,EAAyCS,SAAzC,EAAoD;AAClD,UAAM6B,KAAK,GAAGC,aAAa,EAA3B;AACA,UAAMC,eAAe,GAAGC,WAAW,EAAnC;AAEA9C,IAAAA,KAAK,CAAE,2FAA0FG,IAAI,CAACC,SAAL,CAAeyC,eAAf,CAAgC,EAA5H,CAAL;AACA,WAAOF,KAAP;;AAEA,aAASC,aAAT,GAAyB;AACvB,aAAOvC,SAAS,CACboB,MADI,CACG,CAACC,GAAD,EAAM;AAACC,QAAAA,IAAD;AAAOG,QAAAA;AAAP,OAAN,EAAqBiB,KAArB,KAA+BrB,GAAG,CAACG,MAAJ,CAAW;AAChDF,QAAAA,IADgD;AAEhDU,QAAAA,CAAC,EAAEP,KAF6C;AAGhDQ,QAAAA,CAAC,EAAExB,SAAS,CAACiC,KAAD,CAAT,CAAiBjB;AAH4B,OAAX,CADlC,EAKD,EALC,EAMJkB,MANI,CAMG,CAAC;AAACX,QAAAA,CAAD;AAAIC,QAAAA;AAAJ,OAAD,KAAY;AAClB,YAAID,CAAC,CAACY,MAAF,KAAa,CAAb,IAAkBX,CAAC,CAACW,MAAF,KAAa,CAAnC,EAAsC;AACpC,iBAAO,KAAP;AACD;;AAED,eAAO,IAAP;AACD,OAZI,CAAP;AAaD;;AAED,aAASH,WAAT,GAAuB;AACrB,aAAOzC,SAAS,CACbM,GADI,CACA,CAAC;AAACgB,QAAAA;AAAD,OAAD,KAAYA,IADZ,EAEJqB,MAFI,CAEG5B,CAAC,IAAIuB,KAAK,CAACxB,IAAN,CAAW,CAAC;AAACQ,QAAAA;AAAD,OAAD,KAAYA,IAAI,KAAKP,CAAhC,MAAuC,KAF/C,CAAP;AAGD;AACF;AAEF,C","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"],"file":"index.js"}
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"}

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

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../../src/match-detection/~~index.spec.js"],"names":["debug","debugData","extend","describe","path","__dirname","useMetadataFile","recurse","fixura","reader","READERS","JSON","callback","getFixture","options","expectedResults","array","enabled","detect","formatOptions","recordA","MarcRecord","subfieldValues","recordB","map","recordJson","results","stringify","to","eql","contextFeatures","features","strategy","type","v"],"~~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,oBAAkB,wDAAlB,CAAd;AACA,MAAMC,SAAS,GAAGD,KAAK,CAACE,MAAN,CAAa,MAAb,CAAlB;AAEAC,QAAQ,CAAC,iBAAD,EAAoB,MAAM;AAChC,wBAAc;AACZC,IAAAA,IAAI,EAAE,CAACC,SAAD,EAAY,IAAZ,EAAkB,IAAlB,EAAwB,eAAxB,EAAyC,iBAAzC,EAA4D,OAA5D,CADM;AAEZC,IAAAA,eAAe,EAAE,IAFL;AAGZC,IAAAA,OAAO,EAAE,KAHG;AAIZC,IAAAA,MAAM,EAAE;AACNC,MAAAA,MAAM,EAAEC,gBAAQC;AADV,KAJI;AAOZC,IAAAA,QAAQ,EAAE,CAAC;AAACC,MAAAA,UAAD;AAAaC,MAAAA,OAAb;AAAsBC,MAAAA,eAAtB;AAAuCC,MAAAA,KAAvC;AAA8CC,MAAAA,OAAO,GAAG;AAAxD,KAAD,KAAmE;AAE3E,UAAI,CAACA,OAAL,EAAc;AACZjB,QAAAA,KAAK,CAAE,wBAAF,CAAL;AACA;AACD;;AAED,YAAMkB,MAAM,GAAG,eAAyBC,aAAa,EAAtC,CAAf;AACA,YAAMC,OAAO,GAAG,IAAIC,sBAAJ,CAAeR,UAAU,CAAC,cAAD,CAAzB,EAA2C;AAACS,QAAAA,cAAc,EAAE;AAAjB,OAA3C,CAAhB;AACArB,MAAAA,SAAS,CAAC,mBAAQmB,OAAR,CAAD,CAAT;AAEApB,MAAAA,KAAK,CAAE,uCAAsCgB,KAAM,EAA9C,CAAL;AACA,YAAMO,OAAO,GAAGP,KAAK,GACjBH,UAAU,CAAC,cAAD,CAAV,CAA2BW,GAA3B,CAA+BC,UAAU,IAAI,IAAIJ,sBAAJ,CAAeI,UAAf,EAA2B;AAACH,QAAAA,cAAc,EAAE;AAAjB,OAA3B,CAA7C,CADiB,GAEjB,IAAID,sBAAJ,CAAeR,UAAU,CAAC,cAAD,CAAzB,EAA2C;AAACS,QAAAA,cAAc,EAAE;AAAjB,OAA3C,CAFJ;AAGArB,MAAAA,SAAS,CAAC,mBAAQsB,OAAR,CAAD,CAAT;AAEA,YAAMG,OAAO,GAAGR,MAAM,CAACE,OAAD,EAAUG,OAAV,CAAtB;AACAtB,MAAAA,SAAS,CAAE,GAAEU,IAAI,CAACgB,SAAL,CAAeD,OAAf,CAAwB,EAA5B,CAAT;AAEA,wBAAOA,OAAP,EAAgBE,EAAhB,CAAmBC,GAAnB,CAAuBd,eAAvB;;AAEA,eAASI,aAAT,GAAyB;AACvB,cAAMW,eAAe,GAAGC,QAAQ,CAACjB,OAAO,CAACkB,QAAR,CAAiBC,IAAlB,CAAhC;AAEA,eAAO,EACL,GAAGnB,OADE;AAELkB,UAAAA,QAAQ,EAAElB,OAAO,CAACkB,QAAR,CAAiBD,QAAjB,CAA0BP,GAA1B,CAA8BU,CAAC,IAAIJ,eAAe,CAACI,CAAD,CAAf,EAAnC;AAFL,SAAP;AAID;AACF;AArCW,GAAd;AAuCD,CAxCO,CAAR","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"],"~~file~~":"~~index.spec.js~~"}
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"}

package/dist/matching-utils.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"~~sources~~":["~~../src/~~matching-utils.js"],"names":["debug","debugData","extend","getMelindaIdsF035","record","f035s","getFields","length","allF035MelindaIds","concat","map","toMelindaIds","f035MelindaIds","Set","JSON","stringify","subfields","melindaIdRegExp","filter","sub","includes","code","test","value","replace","validateSidFieldSubfieldCounts","field","countC","countSubfields","countB","subfieldCode","getSubfieldValues"],"~~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,oBAAkB,yCAAlB,CAAd;AACA,MAAMC,SAAS,GAAGD,KAAK,CAACE,MAAN,CAAa,MAAb,CAAlB,C,CAEA;;AACO,SAASC,iBAAT,CAA2BC,MAA3B,EAAmC;AAExC,QAAMJ,KAAK,GAAG,oBAAkB,8CAAlB,CAAd;AACA,QAAMC,SAAS,GAAGD,KAAK,CAACE,MAAN,CAAa,MAAb,CAAlB;AAEA,QAAMG,KAAK,GAAGD,MAAM,CAACE,SAAP,CAAiB,KAAjB,CAAd;;AAEA,MAAID,KAAK,CAACE,MAAN,GAAe,CAAnB,EAAsB;AACpBP,IAAAA,KAAK,CAAE,iBAAF,CAAL;AACA,WAAO,EAAP;AACD;;AAED,QAAMQ,iBAAiB,GAAG,GAAGC,MAAH,CAAU,GAAGJ,KAAK,CAACK,GAAN,CAAUC,YAAV,CAAb,CAA1B;AACA,QAAMC,cAAc,GAAG,CAAC,GAAG,IAAIC,GAAJ,CAAQL,iBAAR,CAAJ,CAAvB;AAEAP,EAAAA,SAAS,CAAE,WAAUI,KAAK,CAACE,MAAO,MAAKO,IAAI,CAACC,SAAL,CAAeV,KAAf,CAAsB,EAApD,CAAT;AACAJ,EAAAA,SAAS,CAAE,QAAOO,iBAAiB,CAACD,MAAO,MAAKO,IAAI,CAACC,SAAL,CAAeP,iBAAf,CAAkC,EAAzE,CAAT;AACAP,EAAAA,SAAS,CAAE,eAAcW,cAAc,CAACL,MAAO,MAAKO,IAAI,CAACC,SAAL,CAAeH,cAAf,CAA+B,EAA1E,CAAT;AAEA,SAAOA,cAAP;;AAEA,WAASD,YAAT,CAAsB;AAACK,IAAAA;AAAD,GAAtB,EAAmC;AACjC,UAAMC,eAAe,GAAG,8CAAxB;AAEA,WAAOD,SAAS,CACbE,MADI,CACGC,GAAG,IAAI,CAAC,GAAD,EAAM,GAAN,EAAWC,QAAX,CAAoBD,GAAG,CAACE,IAAxB,CADV,EAEJH,MAFI,CAEGC,GAAG,IAAIF,eAAe,CAACK,IAAhB,CAAqBH,GAAG,CAACI,KAAzB,CAFV,EAGJb,GAHI,CAGA,CAAC;AAACa,MAAAA;AAAD,KAAD,KAAaA,KAAK,GAAGA,KAAK,CAACC,OAAN,CAAcP,eAAd,EAA+B,OAA/B,CAAH,GAA6C,EAH/D,CAAP;AAKD;AACF;;AAEM,SAASQ,8BAAT,CAAwCC,KAAxC,EAA+C;AACpD;AACAzB,EAAAA,SAAS,CAAE,wBAAuBa,IAAI,CAACC,SAAL,CAAeW,KAAf,CAAsB,EAA/C,CAAT;AACA,QAAMC,MAAM,GAAGC,cAAc,CAACF,KAAD,EAAQ,GAAR,CAA7B;AACA,QAAMG,MAAM,GAAGD,cAAc,CAACF,KAAD,EAAQ,GAAR,CAA7B;AACA1B,EAAAA,KAAK,CAAE,SAAQ2B,MAAO,eAAcE,MAAO,qBAAoBF,MAAM,KAAK,CAAX,IAAgBE,MAAM,KAAK,CAAE,EAAvF,CAAL;AAEA,SAAOF,MAAM,KAAK,CAAX,IAAgBE,MAAM,KAAK,CAAlC;AACD;;AAED,SAASD,cAAT,CAAwBF,KAAxB,EAA+BI,YAA/B,EAA6C;AAC3C;AACA,SAAOJ,KAAK,CAACV,SAAN,CAAgBE,MAAhB,CAAuB,CAAC;AAACG,IAAAA;AAAD,GAAD,KAAYA,IAAI,KAAKS,YAA5C,EAA0DvB,MAAjE;AACD;;AAEM,SAASwB,iBAAT,CAA2BL,KAA3B,EAAkCI,YAAlC,EAAgD;AACrD7B,EAAAA,SAAS,CAAE,oBAAmB6B,YAAa,SAAQhB,IAAI,CAACC,SAAL,CAAeW,KAAf,CAAsB,EAAhE,CAAT;AACA,SAAOA,KAAK,CAACV,SAAN,CAAgBE,MAAhB,CAAuB,CAAC;AAACG,IAAAA;AAAD,GAAD,KAAYA,IAAI,KAAKS,YAA5C,EAA0DpB,GAA1D,CAA8D,CAAC;AAACa,IAAAA;AAAD,GAAD,KAAaA,KAA3E,CAAP;AACD","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 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 => melindaIdRegExp.test(sub.value))\n .map(({value}) => value ? 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.filter(({code}) => code === subfieldCode).map(({value}) => value);\n}\n\n"],"~~file~~":"~~matching-utils.js~~"}
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","test","value","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 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 => melindaIdRegExp.test(sub.value))\n .map(({value}) => value ? 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.filter(({code}) => code === subfieldCode).map(({value}) => value);\n}\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,IAAIF,eAAe,CAACK,IAAhB,CAAqBH,GAAG,CAACI,KAAzB,CAFV,EAGJb,GAHI,CAGA,CAAC;MAACa;IAAD,CAAD,KAAaA,KAAK,GAAGA,KAAK,CAACC,OAAN,CAAcP,eAAd,EAA+B,OAA/B,CAAH,GAA6C,EAH/D,CAAP;EAKD;AACF;;AAEM,SAASQ,8BAAT,CAAwCC,KAAxC,EAA+C;EACpD;EACAzB,SAAS,CAAE,wBAAuBa,IAAI,CAACC,SAAL,CAAeW,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;EACA3B,KAAK,CAAE,SAAQ4B,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,CAACV,SAAN,CAAgBE,MAAhB,CAAuB,CAAC;IAACG;EAAD,CAAD,KAAYA,IAAI,KAAKS,YAA5C,EAA0DvB,MAAjE;AACD;;AAEM,SAASwB,iBAAT,CAA2BL,KAA3B,EAAkCI,YAAlC,EAAgD;EACrD7B,SAAS,CAAE,oBAAmB6B,YAAa,SAAQhB,IAAI,CAACC,SAAL,CAAeW,KAAf,CAAsB,EAAhE,CAAT;EACA,OAAOA,KAAK,CAACV,SAAN,CAAgBE,MAAhB,CAAuB,CAAC;IAACG;EAAD,CAAD,KAAYA,IAAI,KAAKS,YAA5C,EAA0DpB,GAA1D,CAA8D,CAAC;IAACa;EAAD,CAAD,KAAaA,KAA3E,CAAP;AACD"}

package/package.json CHANGED Viewed

@@ -14,7 +14,7 @@
 		"url": "git@github.com:natlibfi/melinda-record-matching-js.git"
 	},
 	"license": "LGPL-3.0+",
-	"version": "2.2.0-alpha.3",
+	"version": "2.2.0-alpha.4",
 	"main": "./dist/index.js",
 	"engines": {
 		"node": ">=14"
@@ -40,20 +40,20 @@
 		"@natlibfi/melinda-commons": "^12.0.3",
 		"@natlibfi/sru-client": "^5.0.1",
 		"debug": "^4.3.4",
-		"moment": "^2.29.2",
-		"natural": "^5.1.13",
+		"moment": "^2.29.4",
+		"natural": "^5.2.3",
 		"uuid": "^8.3.2",
-		"winston": "^3.7.2"
+		"winston": "^3.8.1"
 	},
 	"devDependencies": {
-		"@babel/cli": "^7.17.6",
-		"@babel/core": "^7.17.9",
-		"@babel/eslint-parser": "^7.17.0",
-		"@babel/node": "^7.16.8",
-		"@babel/preset-env": "^7.16.11",
-		"@babel/register": "^7.17.7",
+		"@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/register": "^7.18.9",
 		"@natlibfi/eslint-config-melinda-backend": "^2.0.0",
-		"@natlibfi/fixugen": "^1.0.2",
+		"@natlibfi/fixugen": "^1.1.0",
 		"@natlibfi/fixugen-http-client": "^2.0.1",
 		"@natlibfi/fixura": "^2.2.1",
 		"babel-plugin-istanbul": "^6.1.1",
@@ -61,9 +61,9 @@
 		"chai": "^4.3.6",
 		"chai-as-promised": "^7.1.1",
 		"cross-env": "^7.0.3",
-		"eslint": "^8.13.0",
+		"eslint": "^8.23.0",
 		"mocha": "^9.2.2",
-		"nodemon": "^2.0.15",
+		"nodemon": "^2.0.19",
 		"nyc": "^15.1.0"
 	},
 	"eslintConfig": {

package/src/candidate-search/index.js CHANGED Viewed

@@ -152,21 +152,21 @@ export default ({record, searchSpec, url, maxCandidates, maxRecordsPerRequest =
               reject(err);
             }
           })
-          .on('record', foundRecordXML => {
+          .on('record', recordXML => {
             promises.push(handleRecord()); // eslint-disable-line functional/immutable-data
             async function handleRecord() {
               try {
-                const foundRecordMarc = await MARCXML.from(foundRecordXML, {subfieldValues: false});
-                const foundRecordId = getRecordId(foundRecordMarc);
+                const recordMarc = await MARCXML.from(recordXML, {subfieldValues: false});
+                const recordId = getRecordId(recordMarc);
-                return {record: foundRecordMarc, id: foundRecordId};
+                return {record: recordMarc, id: recordId};
               } catch (err) {
                 // What should this do?
-                const idFromXML = getRecordIdFromXML(foundRecordXML);
-                debugData(`Failed converting record: ${err.message}, id: ${idFromXML}, data: ${foundRecordXML}`);
-                //return {message: `Failed converting record: ${err.message}`, id: idFromXML, data: foundRecordXML};
-                throw new MatchingError(422, {message: `Failed converting record: ${err.message}`, id: idFromXML || '000000000', data: foundRecordXML});
+                const idFromXML = getRecordIdFromXML(recordXML);
+                debugData(`Failed converting record: ${err.message}, id: ${idFromXML}, data: ${recordXML}`);
+                //return {message: `Failed converting record: ${err.message}`, id: idFromXML, data: recordXML};
+                throw new MatchingError(422, {message: `Failed converting record: ${err.message}`, id: idFromXML || '000000000', data: recordXML});
               }
             }
           });