@natlibfi/melinda-record-matching 4.2.0-alpha.1 → 4.2.1-alpha.1

package/.github/dependabot.yml

@@ -10,7 +10,7 @@ updates:
       interval: "daily"
       time: "06:30"
       timezone: "Europe/Helsinki"
-    target-branch: "dependencies"
+    target-branch: "next"
 
   # Minor updates to npm production dependencies daily
   - package-ecosystem: "npm"
@@ -20,9 +20,14 @@ updates:
       time: "06:45"
       timezone: "Europe/Helsinki"
     versioning-strategy: lockfile-only
-    allow:
-      - dependency-type: "production"
-    target-branch: "dependencies"
+    target-branch: "next"
+    pull-request-branch-name:
+      separator: "-"
+    groups:
+      production-dependencies:
+        dependency-type: "production"
+      development-dependencies:
+        dependency-type: "development"
 
   # Major updates to npm dependencies weekly @tuesday
   # Not possible yet https://github.com/dependabot/dependabot-core/issues/1778

package/.github/workflows/melinda-node-tests.yml

@@ -16,7 +16,7 @@ jobs:
 
     steps:
     - name: Checkout the code
-      uses: actions/checkout@v3
+      uses: actions/checkout@v4
     - name: Use Node.js ${{ matrix.node-version }}
       uses: actions/setup-node@v3
       with:
@@ -35,7 +35,7 @@ jobs:
 
     steps:
     - name: Checkout the code
-      uses: actions/checkout@v3
+      uses: actions/checkout@v4
     - name: nodejsscan scan
       id: njsscan
       uses: ajinabraham/njsscan-action@master
@@ -47,7 +47,7 @@ jobs:
     runs-on: ubuntu-latest
 
     steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4
       - uses: mikaelvesavuori/license-compliance-action@v1.0.2
         with:
           exclude_pattern: /^@natlibfi/
@@ -58,7 +58,7 @@ jobs:
     if: contains(github.ref, 'refs/tags/')
 
     steps:
-      - uses: actions/checkout@v3
+      - uses: actions/checkout@v4
       # Setup .npmrc file to publish to npm
       - uses: actions/setup-node@v3
         with:

package/dist/candidate-search/index.js

@@ -16,8 +16,8 @@ var _marcRecord = require("@natlibfi/marc-record");
 var _marcRecordSerializers = require("@natlibfi/marc-record-serializers");
 var _queryList = _interopRequireWildcard(require("./query-list"));
 var _melindaCommons = require("@natlibfi/melinda-commons");
-function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
-function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function (e) { return e ? t : r; })(e); }
+function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != typeof e && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 /**
 *

package/dist/candidate-search/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","names":["_debug","_interopRequireDefault","require","_sruClient","_interopRequireWildcard","_marcRecord","_marcRecordSerializers","_queryList","_melindaCommons","_getRequireWildcardCache","nodeInterop","WeakMap","cacheBabelInterop","cacheNodeInterop","obj","__esModule","default","cache","has","get","newObj","hasPropertyDescriptor","Object","defineProperty","getOwnPropertyDescriptor","key","prototype","hasOwnProperty","call","desc","set","CandidateSearchError","Error","exports","_default","record","searchSpec","url","maxCandidates","maxRecordsPerRequest","serverMaxResult","MarcRecord","setValidationOptions","subfieldValues","debug","createDebugLogger","debugData","extend","JSON","stringify","adjustedMaxRecordsPerRequest","inputRecordId","getRecordId","queryList","generateQueryList","client","createClient","version","retrieveAll","length","queryOffset","resultSetOffset","totalRecords","searchCounter","queryCandidateCounter","queryCounter","maxedQueries","query","records","failures","nextOffset","total","retrieveRecords","newTotalRecords","newQueryCounter","newSearchCounter","newQueryCandidateCounter","maxedQuery","checkMaxedQuery","undefined","newMaxedQueries","concat","queriesLeft","Promise","resolve","reject","promises","searchRetrieve","startRecord","on","err","SruSearchError","recordPromises","allSettled","filtered","filter","r","status","map","value","reason","payload","recordXML","push","handleRecord","recordMarc","MARCXML","from","recordId","id","idFromXML","getRecordIdFromXML","message","MatchingError","data","field"],"sources":["../../src/candidate-search/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-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport createClient, {SruSearchError} from '@natlibfi/sru-client';\nimport {MarcRecord} from '@natlibfi/marc-record';\nimport {MARCXML} from '@natlibfi/marc-record-serializers';\nimport generateQueryList from './query-list';\nimport {Error as MatchingError} from '@natlibfi/melinda-commons';\n\nexport {searchTypes} from './query-list';\n\nexport class CandidateSearchError extends Error {}\n\n// serverMaxResults : maximum size of total search result available from the server, defaults to Aleph's 20000\n\nexport default ({record, searchSpec, url, maxCandidates, maxRecordsPerRequest = 50, serverMaxResult = 20000}) => {\n  MarcRecord.setValidationOptions({subfieldValues: false});\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search');\n  const debugData = debug.extend('data');\n\n  debugData(`SearchSpec: ${JSON.stringify(searchSpec)}`);\n  debugData(`Url: ${url}`);\n  debugData(`MaxRecordsPerRequest ${maxRecordsPerRequest}`);\n  debugData(`ServerMaxResult: ${serverMaxResult}`);\n  debugData(`MaxCandidates: ${maxCandidates}`);\n\n  // Do not retrieve more candidates than defined in maxCandidates\n  const adjustedMaxRecordsPerRequest = maxRecordsPerRequest >= maxCandidates ? maxCandidates : maxRecordsPerRequest;\n\n  const inputRecordId = getRecordId(record);\n  const queryList = generateQueryList(record, searchSpec);\n  const client = createClient({\n    url,\n    maxRecordsPerRequest: adjustedMaxRecordsPerRequest,\n    version: '2.0',\n    retrieveAll: false\n  });\n\n  debug(`Searching matches for ${inputRecordId}`);\n  debug(`Generated queryList ${JSON.stringify(queryList)}`);\n\n  // if generateQueryList errored we should throw 422\n\n  if (queryList.length === 0) {\n    throw new CandidateSearchError(`Generated query list contains no queries`);\n  }\n\n  // state.totalRecords : amount of candidate records available to the current query (undefined, if there was no queries left)\n  // state.query : current query (undefined if there was no queries left)\n  // state.searchCounter : sequence for current search for current query (undefined, if there we no queries left)\n  // state.queryCandidateCounter: amount of candidates (records+failures) retrieved from SRU for matching for current query, including the current record+failure set (undefined if there were no queries left)\n  // state.queriesLeft : amount of queries left\n  // state.queryCounter : sequence for current query\n  // state.maxedQueries : queries that resulted in more than serverMaxResults hits\n\n\n  return async ({queryOffset = 0, resultSetOffset = 1, totalRecords = 0, searchCounter = 0, queryCandidateCounter = 0, queryCounter = 0, maxedQueries = []}) => {\n    const query = queryList[queryOffset];\n\n    if (query) {\n      const {records, failures, nextOffset, total} = await retrieveRecords();\n\n      // If resultSetOffset === 1 this is the first search for the current query\n      debugData(`ResultSetOffset: ${resultSetOffset}`);\n      const newTotalRecords = resultSetOffset === 1 ? total : totalRecords;\n      const newQueryCounter = resultSetOffset === 1 ? queryCounter + 1 : queryCounter;\n      const newSearchCounter = resultSetOffset === 1 ? 1 : searchCounter + 1;\n      const newQueryCandidateCounter = resultSetOffset === 1 ? records.length + failures.length : queryCandidateCounter + records.length + failures.length;\n\n      const maxedQuery = resultSetOffset === 1 ? checkMaxedQuery(query, total, serverMaxResult) : undefined;\n      const newMaxedQueries = maxedQuery ? maxedQueries.concat(maxedQuery) : maxedQueries;\n\n      if (typeof nextOffset === 'number') {\n        debug(`Next search will be for query ${queryOffset} ${query}, starting from record ${nextOffset}`);\n        return {records, failures, queryOffset, resultSetOffset: nextOffset, queriesLeft: queryList.length - (queryOffset + 1), totalRecords: newTotalRecords, query, searchCounter: newSearchCounter, queryCandidateCounter: newQueryCandidateCounter, queryCounter: newQueryCounter, maxedQueries: newMaxedQueries};\n      }\n      debug(`Query ${queryOffset} ${query} done.`);\n      debug(`There are (${queryList.length - (queryOffset + 1)} queries left)`);\n      return {records, failures, queryOffset: queryOffset + 1, queriesLeft: queryList.length - (queryOffset + 1), totalRecords: newTotalRecords, query, searchCounter: newSearchCounter, queryCandidateCounter: newQueryCandidateCounter, queryCounter: newQueryCounter, maxedQueries: newMaxedQueries};\n    }\n\n    debug(`All ${queryList.length} queries done, there's no query for ${queryOffset}`);\n    return {records: [], failures: [], queriesLeft: 0, queryCounter, maxedQueries};\n\n    function retrieveRecords() {\n      return new Promise((resolve, reject) => {\n        const promises = [];\n        // eslint-disable-next-line functional/no-let\n        let totalRecords = 0;\n\n        debug(`Searching for candidates with query: ${query} (Offset ${resultSetOffset})`);\n\n        client.searchRetrieve(query, {startRecord: resultSetOffset})\n          .on('error', err => {\n            // eslint-disable-next-line functional/no-conditional-statements\n            if (err instanceof SruSearchError) {\n              debug(`SRU SruSearchError for query: ${query}: ${err}`);\n              reject(new CandidateSearchError(`SRU SruSearchError for query: ${query}: ${err}`));\n            }\n            debug(`SRU error for query: ${query}: ${err}`);\n            reject(new CandidateSearchError(`SRU error for query: ${query}: ${err}`));\n          })\n          .on('total', total => {\n            debug(`Got total: ${total}`);\n            totalRecords += total;\n          })\n          .on('end', async nextOffset => {\n            try {\n              const recordPromises = await Promise.allSettled(promises);\n              debugData(`All recordPromises: ${JSON.stringify(recordPromises)}`);\n              const filtered = recordPromises.filter(r => r.status === 'fulfilled').map(r => r.value);\n              const failures = recordPromises.filter(r => r.status === 'rejected').map(r => ({status: r.reason.status, payload: r.reason.payload}));\n\n              debug(`Found ${recordPromises.length} records`);\n              debug(`Found ${filtered.length} convertable candidates`);\n              debug(`Found ${failures.length} NON-convertable candidates`);\n              debugData(`Converted: ${JSON.stringify(filtered)}.`);\n              debugData(`Not converted: ${JSON.stringify(failures)}.`);\n\n\n              resolve({nextOffset, records: filtered, failures, total: totalRecords});\n            } catch (err) {\n              debug(`Error caught on END`);\n              reject(err);\n            }\n          })\n          .on('record', recordXML => {\n            promises.push(handleRecord()); // eslint-disable-line functional/immutable-data\n\n            async function handleRecord() {\n              try {\n                const recordMarc = await MARCXML.from(recordXML, {subfieldValues: false});\n                const recordId = getRecordId(recordMarc);\n\n                return {record: recordMarc, id: recordId};\n              } catch (err) {\n                // What should this do?\n                const idFromXML = getRecordIdFromXML(recordXML);\n                debugData(`Failed converting record: ${err.message}, id: ${idFromXML}, data: ${recordXML}`);\n                //return {message: `Failed converting record: ${err.message}`, id: idFromXML, data: recordXML};\n                throw new MatchingError(422, {message: `Failed converting record: ${err.message}`, id: idFromXML || '000000000', data: recordXML});\n              }\n            }\n          });\n      });\n    }\n  };\n\n  function checkMaxedQuery(query, total, serverMaxResult) {\n    if (total >= serverMaxResult) {\n      debug(`WARNING: Query ${query} resulted in ${total} hits which meets the serverMaxResult (${serverMaxResult}) `);\n      return query;\n    }\n  }\n\n\n  function getRecordId(record) {\n    const [field] = record.get(/^001$/u);\n    return field ? field.value : '';\n  }\n\n  function getRecordIdFromXML(recordXML) {\n    //<controlfield tag=\\\"001\\\">015376846</controlfield\n    debug(`Cannot yet find possible database record id from recordXML (length ${recordXML.length})`);\n    return undefined;\n  }\n\n};\n"],"mappings":";;;;;;;;;;;;AA4BA,IAAAA,MAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,UAAA,GAAAC,uBAAA,CAAAF,OAAA;AACA,IAAAG,WAAA,GAAAH,OAAA;AACA,IAAAI,sBAAA,GAAAJ,OAAA;AACA,IAAAK,UAAA,GAAAH,uBAAA,CAAAF,OAAA;AACA,IAAAM,eAAA,GAAAN,OAAA;AAAiE,SAAAO,yBAAAC,WAAA,eAAAC,OAAA,kCAAAC,iBAAA,OAAAD,OAAA,QAAAE,gBAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,WAAA,WAAAA,WAAA,GAAAG,gBAAA,GAAAD,iBAAA,KAAAF,WAAA;AAAA,SAAAN,wBAAAU,GAAA,EAAAJ,WAAA,SAAAA,WAAA,IAAAI,GAAA,IAAAA,GAAA,CAAAC,UAAA,WAAAD,GAAA,QAAAA,GAAA,oBAAAA,GAAA,wBAAAA,GAAA,4BAAAE,OAAA,EAAAF,GAAA,UAAAG,KAAA,GAAAR,wBAAA,CAAAC,WAAA,OAAAO,KAAA,IAAAA,KAAA,CAAAC,GAAA,CAAAJ,GAAA,YAAAG,KAAA,CAAAE,GAAA,CAAAL,GAAA,SAAAM,MAAA,WAAAC,qBAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,GAAA,IAAAX,GAAA,QAAAW,GAAA,kBAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAd,GAAA,EAAAW,GAAA,SAAAI,IAAA,GAAAR,qBAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAV,GAAA,EAAAW,GAAA,cAAAI,IAAA,KAAAA,IAAA,CAAAV,GAAA,IAAAU,IAAA,CAAAC,GAAA,KAAAR,MAAA,CAAAC,cAAA,CAAAH,MAAA,EAAAK,GAAA,EAAAI,IAAA,YAAAT,MAAA,CAAAK,GAAA,IAAAX,GAAA,CAAAW,GAAA,SAAAL,MAAA,CAAAJ,OAAA,GAAAF,GAAA,MAAAG,KAAA,IAAAA,KAAA,CAAAa,GAAA,CAAAhB,GAAA,EAAAM,MAAA,YAAAA,MAAA;AAAA,SAAAnB,uBAAAa,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AAjCjE;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;;AAWO,MAAMiB,oBAAoB,SAASC,KAAK,CAAC;;AAEhD;AAAAC,OAAA,CAAAF,oBAAA,GAAAA,oBAAA;AAAA,IAAAG,QAAA,GAEeA,CAAC;EAACC,MAAM;EAAEC,UAAU;EAAEC,GAAG;EAAEC,aAAa;EAAEC,oBAAoB,GAAG,EAAE;EAAEC,eAAe,GAAG;AAAK,CAAC,KAAK;EAC/GC,sBAAU,CAACC,oBAAoB,CAAC;IAACC,cAAc,EAAE;EAAK,CAAC,CAAC;EAExD,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,oDAAoD,CAAC;EACrF,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EAEtCD,SAAS,CAAE,eAAcE,IAAI,CAACC,SAAS,CAACb,UAAU,CAAE,EAAC,CAAC;EACtDU,SAAS,CAAE,QAAOT,GAAI,EAAC,CAAC;EACxBS,SAAS,CAAE,wBAAuBP,oBAAqB,EAAC,CAAC;EACzDO,SAAS,CAAE,oBAAmBN,eAAgB,EAAC,CAAC;EAChDM,SAAS,CAAE,kBAAiBR,aAAc,EAAC,CAAC;;EAE5C;EACA,MAAMY,4BAA4B,GAAGX,oBAAoB,IAAID,aAAa,GAAGA,aAAa,GAAGC,oBAAoB;EAEjH,MAAMY,aAAa,GAAGC,WAAW,CAACjB,MAAM,CAAC;EACzC,MAAMkB,SAAS,GAAG,IAAAC,kBAAiB,EAACnB,MAAM,EAAEC,UAAU,CAAC;EACvD,MAAMmB,MAAM,GAAG,IAAAC,kBAAY,EAAC;IAC1BnB,GAAG;IACHE,oBAAoB,EAAEW,4BAA4B;IAClDO,OAAO,EAAE,KAAK;IACdC,WAAW,EAAE;EACf,CAAC,CAAC;EAEFd,KAAK,CAAE,yBAAwBO,aAAc,EAAC,CAAC;EAC/CP,KAAK,CAAE,uBAAsBI,IAAI,CAACC,SAAS,CAACI,SAAS,CAAE,EAAC,CAAC;;EAEzD;;EAEA,IAAIA,SAAS,CAACM,MAAM,KAAK,CAAC,EAAE;IAC1B,MAAM,IAAI5B,oBAAoB,CAAE,0CAAyC,CAAC;EAC5E;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;;EAGA,OAAO,OAAO;IAAC6B,WAAW,GAAG,CAAC;IAAEC,eAAe,GAAG,CAAC;IAAEC,YAAY,GAAG,CAAC;IAAEC,aAAa,GAAG,CAAC;IAAEC,qBAAqB,GAAG,CAAC;IAAEC,YAAY,GAAG,CAAC;IAAEC,YAAY,GAAG;EAAE,CAAC,KAAK;IAC5J,MAAMC,KAAK,GAAGd,SAAS,CAACO,WAAW,CAAC;IAEpC,IAAIO,KAAK,EAAE;MACT,MAAM;QAACC,OAAO;QAAEC,QAAQ;QAAEC,UAAU;QAAEC;MAAK,CAAC,GAAG,MAAMC,eAAe,CAAC,CAAC;;MAEtE;MACA1B,SAAS,CAAE,oBAAmBe,eAAgB,EAAC,CAAC;MAChD,MAAMY,eAAe,GAAGZ,eAAe,KAAK,CAAC,GAAGU,KAAK,GAAGT,YAAY;MACpE,MAAMY,eAAe,GAAGb,eAAe,KAAK,CAAC,GAAGI,YAAY,GAAG,CAAC,GAAGA,YAAY;MAC/E,MAAMU,gBAAgB,GAAGd,eAAe,KAAK,CAAC,GAAG,CAAC,GAAGE,aAAa,GAAG,CAAC;MACtE,MAAMa,wBAAwB,GAAGf,eAAe,KAAK,CAAC,GAAGO,OAAO,CAACT,MAAM,GAAGU,QAAQ,CAACV,MAAM,GAAGK,qBAAqB,GAAGI,OAAO,CAACT,MAAM,GAAGU,QAAQ,CAACV,MAAM;MAEpJ,MAAMkB,UAAU,GAAGhB,eAAe,KAAK,CAAC,GAAGiB,eAAe,CAACX,KAAK,EAAEI,KAAK,EAAE/B,eAAe,CAAC,GAAGuC,SAAS;MACrG,MAAMC,eAAe,GAAGH,UAAU,GAAGX,YAAY,CAACe,MAAM,CAACJ,UAAU,CAAC,GAAGX,YAAY;MAEnF,IAAI,OAAOI,UAAU,KAAK,QAAQ,EAAE;QAClC1B,KAAK,CAAE,iCAAgCgB,WAAY,IAAGO,KAAM,0BAAyBG,UAAW,EAAC,CAAC;QAClG,OAAO;UAACF,OAAO;UAAEC,QAAQ;UAAET,WAAW;UAAEC,eAAe,EAAES,UAAU;UAAEY,WAAW,EAAE7B,SAAS,CAACM,MAAM,IAAIC,WAAW,GAAG,CAAC,CAAC;UAAEE,YAAY,EAAEW,eAAe;UAAEN,KAAK;UAAEJ,aAAa,EAAEY,gBAAgB;UAAEX,qBAAqB,EAAEY,wBAAwB;UAAEX,YAAY,EAAES,eAAe;UAAER,YAAY,EAAEc;QAAe,CAAC;MAC/S;MACApC,KAAK,CAAE,SAAQgB,WAAY,IAAGO,KAAM,QAAO,CAAC;MAC5CvB,KAAK,CAAE,cAAaS,SAAS,CAACM,MAAM,IAAIC,WAAW,GAAG,CAAC,CAAE,gBAAe,CAAC;MACzE,OAAO;QAACQ,OAAO;QAAEC,QAAQ;QAAET,WAAW,EAAEA,WAAW,GAAG,CAAC;QAAEsB,WAAW,EAAE7B,SAAS,CAACM,MAAM,IAAIC,WAAW,GAAG,CAAC,CAAC;QAAEE,YAAY,EAAEW,eAAe;QAAEN,KAAK;QAAEJ,aAAa,EAAEY,gBAAgB;QAAEX,qBAAqB,EAAEY,wBAAwB;QAAEX,YAAY,EAAES,eAAe;QAAER,YAAY,EAAEc;MAAe,CAAC;IACnS;IAEApC,KAAK,CAAE,OAAMS,SAAS,CAACM,MAAO,uCAAsCC,WAAY,EAAC,CAAC;IAClF,OAAO;MAACQ,OAAO,EAAE,EAAE;MAAEC,QAAQ,EAAE,EAAE;MAAEa,WAAW,EAAE,CAAC;MAAEjB,YAAY;MAAEC;IAAY,CAAC;IAE9E,SAASM,eAAeA,CAAA,EAAG;MACzB,OAAO,IAAIW,OAAO,CAAC,CAACC,OAAO,EAAEC,MAAM,KAAK;QACtC,MAAMC,QAAQ,GAAG,EAAE;QACnB;QACA,IAAIxB,YAAY,GAAG,CAAC;QAEpBlB,KAAK,CAAE,wCAAuCuB,KAAM,YAAWN,eAAgB,GAAE,CAAC;QAElFN,MAAM,CAACgC,cAAc,CAACpB,KAAK,EAAE;UAACqB,WAAW,EAAE3B;QAAe,CAAC,CAAC,CACzD4B,EAAE,CAAC,OAAO,EAAEC,GAAG,IAAI;UAClB;UACA,IAAIA,GAAG,YAAYC,yBAAc,EAAE;YACjC/C,KAAK,CAAE,iCAAgCuB,KAAM,KAAIuB,GAAI,EAAC,CAAC;YACvDL,MAAM,CAAC,IAAItD,oBAAoB,CAAE,iCAAgCoC,KAAM,KAAIuB,GAAI,EAAC,CAAC,CAAC;UACpF;UACA9C,KAAK,CAAE,wBAAuBuB,KAAM,KAAIuB,GAAI,EAAC,CAAC;UAC9CL,MAAM,CAAC,IAAItD,oBAAoB,CAAE,wBAAuBoC,KAAM,KAAIuB,GAAI,EAAC,CAAC,CAAC;QAC3E,CAAC,CAAC,CACDD,EAAE,CAAC,OAAO,EAAElB,KAAK,IAAI;UACpB3B,KAAK,CAAE,cAAa2B,KAAM,EAAC,CAAC;UAC5BT,YAAY,IAAIS,KAAK;QACvB,CAAC,CAAC,CACDkB,EAAE,CAAC,KAAK,EAAE,MAAMnB,UAAU,IAAI;UAC7B,IAAI;YACF,MAAMsB,cAAc,GAAG,MAAMT,OAAO,CAACU,UAAU,CAACP,QAAQ,CAAC;YACzDxC,SAAS,CAAE,uBAAsBE,IAAI,CAACC,SAAS,CAAC2C,cAAc,CAAE,EAAC,CAAC;YAClE,MAAME,QAAQ,GAAGF,cAAc,CAACG,MAAM,CAACC,CAAC,IAAIA,CAAC,CAACC,MAAM,KAAK,WAAW,CAAC,CAACC,GAAG,CAACF,CAAC,IAAIA,CAAC,CAACG,KAAK,CAAC;YACvF,MAAM9B,QAAQ,GAAGuB,cAAc,CAACG,MAAM,CAACC,CAAC,IAAIA,CAAC,CAACC,MAAM,KAAK,UAAU,CAAC,CAACC,GAAG,CAACF,CAAC,KAAK;cAACC,MAAM,EAAED,CAAC,CAACI,MAAM,CAACH,MAAM;cAAEI,OAAO,EAAEL,CAAC,CAACI,MAAM,CAACC;YAAO,CAAC,CAAC,CAAC;YAErIzD,KAAK,CAAE,SAAQgD,cAAc,CAACjC,MAAO,UAAS,CAAC;YAC/Cf,KAAK,CAAE,SAAQkD,QAAQ,CAACnC,MAAO,yBAAwB,CAAC;YACxDf,KAAK,CAAE,SAAQyB,QAAQ,CAACV,MAAO,6BAA4B,CAAC;YAC5Db,SAAS,CAAE,cAAaE,IAAI,CAACC,SAAS,CAAC6C,QAAQ,CAAE,GAAE,CAAC;YACpDhD,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAS,CAACoB,QAAQ,CAAE,GAAE,CAAC;YAGxDe,OAAO,CAAC;cAACd,UAAU;cAAEF,OAAO,EAAE0B,QAAQ;cAAEzB,QAAQ;cAAEE,KAAK,EAAET;YAAY,CAAC,CAAC;UACzE,CAAC,CAAC,OAAO4B,GAAG,EAAE;YACZ9C,KAAK,CAAE,qBAAoB,CAAC;YAC5ByC,MAAM,CAACK,GAAG,CAAC;UACb;QACF,CAAC,CAAC,CACDD,EAAE,CAAC,QAAQ,EAAEa,SAAS,IAAI;UACzBhB,QAAQ,CAACiB,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;;UAE/B,eAAeA,YAAYA,CAAA,EAAG;YAC5B,IAAI;cACF,MAAMC,UAAU,GAAG,MAAMC,8BAAO,CAACC,IAAI,CAACL,SAAS,EAAE;gBAAC3D,cAAc,EAAE;cAAK,CAAC,CAAC;cACzE,MAAMiE,QAAQ,GAAGxD,WAAW,CAACqD,UAAU,CAAC;cAExC,OAAO;gBAACtE,MAAM,EAAEsE,UAAU;gBAAEI,EAAE,EAAED;cAAQ,CAAC;YAC3C,CAAC,CAAC,OAAOlB,GAAG,EAAE;cACZ;cACA,MAAMoB,SAAS,GAAGC,kBAAkB,CAACT,SAAS,CAAC;cAC/CxD,SAAS,CAAE,6BAA4B4C,GAAG,CAACsB,OAAQ,SAAQF,SAAU,WAAUR,SAAU,EAAC,CAAC;cAC3F;cACA,MAAM,IAAIW,qBAAa,CAAC,GAAG,EAAE;gBAACD,OAAO,EAAG,6BAA4BtB,GAAG,CAACsB,OAAQ,EAAC;gBAAEH,EAAE,EAAEC,SAAS,IAAI,WAAW;gBAAEI,IAAI,EAAEZ;cAAS,CAAC,CAAC;YACpI;UACF;QACF,CAAC,CAAC;MACN,CAAC,CAAC;IACJ;EACF,CAAC;EAED,SAASxB,eAAeA,CAACX,KAAK,EAAEI,KAAK,EAAE/B,eAAe,EAAE;IACtD,IAAI+B,KAAK,IAAI/B,eAAe,EAAE;MAC5BI,KAAK,CAAE,kBAAiBuB,KAAM,gBAAeI,KAAM,0CAAyC/B,eAAgB,IAAG,CAAC;MAChH,OAAO2B,KAAK;IACd;EACF;EAGA,SAASf,WAAWA,CAACjB,MAAM,EAAE;IAC3B,MAAM,CAACgF,KAAK,CAAC,GAAGhF,MAAM,CAAChB,GAAG,CAAC,QAAQ,CAAC;IACpC,OAAOgG,KAAK,GAAGA,KAAK,CAAChB,KAAK,GAAG,EAAE;EACjC;EAEA,SAASY,kBAAkBA,CAACT,SAAS,EAAE;IACrC;IACA1D,KAAK,CAAE,sEAAqE0D,SAAS,CAAC3C,MAAO,GAAE,CAAC;IAChG,OAAOoB,SAAS;EAClB;AAEF,CAAC;AAAA9C,OAAA,CAAAjB,OAAA,GAAAkB,QAAA"}
+{"version":3,"file":"index.js","names":["_debug","_interopRequireDefault","require","_sruClient","_interopRequireWildcard","_marcRecord","_marcRecordSerializers","_queryList","_melindaCommons","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","prototype","hasOwnProperty","call","i","set","obj","CandidateSearchError","Error","exports","_default","record","searchSpec","url","maxCandidates","maxRecordsPerRequest","serverMaxResult","MarcRecord","setValidationOptions","subfieldValues","debug","createDebugLogger","debugData","extend","JSON","stringify","adjustedMaxRecordsPerRequest","inputRecordId","getRecordId","queryList","generateQueryList","client","createClient","version","retrieveAll","length","queryOffset","resultSetOffset","totalRecords","searchCounter","queryCandidateCounter","queryCounter","maxedQueries","query","records","failures","nextOffset","total","retrieveRecords","newTotalRecords","newQueryCounter","newSearchCounter","newQueryCandidateCounter","maxedQuery","checkMaxedQuery","undefined","newMaxedQueries","concat","queriesLeft","Promise","resolve","reject","promises","searchRetrieve","startRecord","on","err","SruSearchError","recordPromises","allSettled","filtered","filter","status","map","value","reason","payload","recordXML","push","handleRecord","recordMarc","MARCXML","from","recordId","id","idFromXML","getRecordIdFromXML","message","MatchingError","data","field"],"sources":["../../src/candidate-search/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-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport createClient, {SruSearchError} from '@natlibfi/sru-client';\nimport {MarcRecord} from '@natlibfi/marc-record';\nimport {MARCXML} from '@natlibfi/marc-record-serializers';\nimport generateQueryList from './query-list';\nimport {Error as MatchingError} from '@natlibfi/melinda-commons';\n\nexport {searchTypes} from './query-list';\n\nexport class CandidateSearchError extends Error {}\n\n// serverMaxResults : maximum size of total search result available from the server, defaults to Aleph's 20000\n\nexport default ({record, searchSpec, url, maxCandidates, maxRecordsPerRequest = 50, serverMaxResult = 20000}) => {\n  MarcRecord.setValidationOptions({subfieldValues: false});\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search');\n  const debugData = debug.extend('data');\n\n  debugData(`SearchSpec: ${JSON.stringify(searchSpec)}`);\n  debugData(`Url: ${url}`);\n  debugData(`MaxRecordsPerRequest ${maxRecordsPerRequest}`);\n  debugData(`ServerMaxResult: ${serverMaxResult}`);\n  debugData(`MaxCandidates: ${maxCandidates}`);\n\n  // Do not retrieve more candidates than defined in maxCandidates\n  const adjustedMaxRecordsPerRequest = maxRecordsPerRequest >= maxCandidates ? maxCandidates : maxRecordsPerRequest;\n\n  const inputRecordId = getRecordId(record);\n  const queryList = generateQueryList(record, searchSpec);\n  const client = createClient({\n    url,\n    maxRecordsPerRequest: adjustedMaxRecordsPerRequest,\n    version: '2.0',\n    retrieveAll: false\n  });\n\n  debug(`Searching matches for ${inputRecordId}`);\n  debug(`Generated queryList ${JSON.stringify(queryList)}`);\n\n  // if generateQueryList errored we should throw 422\n\n  if (queryList.length === 0) {\n    throw new CandidateSearchError(`Generated query list contains no queries`);\n  }\n\n  // state.totalRecords : amount of candidate records available to the current query (undefined, if there was no queries left)\n  // state.query : current query (undefined if there was no queries left)\n  // state.searchCounter : sequence for current search for current query (undefined, if there we no queries left)\n  // state.queryCandidateCounter: amount of candidates (records+failures) retrieved from SRU for matching for current query, including the current record+failure set (undefined if there were no queries left)\n  // state.queriesLeft : amount of queries left\n  // state.queryCounter : sequence for current query\n  // state.maxedQueries : queries that resulted in more than serverMaxResults hits\n\n\n  return async ({queryOffset = 0, resultSetOffset = 1, totalRecords = 0, searchCounter = 0, queryCandidateCounter = 0, queryCounter = 0, maxedQueries = []}) => {\n    const query = queryList[queryOffset];\n\n    if (query) {\n      const {records, failures, nextOffset, total} = await retrieveRecords();\n\n      // If resultSetOffset === 1 this is the first search for the current query\n      debugData(`ResultSetOffset: ${resultSetOffset}`);\n      const newTotalRecords = resultSetOffset === 1 ? total : totalRecords;\n      const newQueryCounter = resultSetOffset === 1 ? queryCounter + 1 : queryCounter;\n      const newSearchCounter = resultSetOffset === 1 ? 1 : searchCounter + 1;\n      const newQueryCandidateCounter = resultSetOffset === 1 ? records.length + failures.length : queryCandidateCounter + records.length + failures.length;\n\n      const maxedQuery = resultSetOffset === 1 ? checkMaxedQuery(query, total, serverMaxResult) : undefined;\n      const newMaxedQueries = maxedQuery ? maxedQueries.concat(maxedQuery) : maxedQueries;\n\n      if (typeof nextOffset === 'number') {\n        debug(`Next search will be for query ${queryOffset} ${query}, starting from record ${nextOffset}`);\n        return {records, failures, queryOffset, resultSetOffset: nextOffset, queriesLeft: queryList.length - (queryOffset + 1), totalRecords: newTotalRecords, query, searchCounter: newSearchCounter, queryCandidateCounter: newQueryCandidateCounter, queryCounter: newQueryCounter, maxedQueries: newMaxedQueries};\n      }\n      debug(`Query ${queryOffset} ${query} done.`);\n      debug(`There are (${queryList.length - (queryOffset + 1)} queries left)`);\n      return {records, failures, queryOffset: queryOffset + 1, queriesLeft: queryList.length - (queryOffset + 1), totalRecords: newTotalRecords, query, searchCounter: newSearchCounter, queryCandidateCounter: newQueryCandidateCounter, queryCounter: newQueryCounter, maxedQueries: newMaxedQueries};\n    }\n\n    debug(`All ${queryList.length} queries done, there's no query for ${queryOffset}`);\n    return {records: [], failures: [], queriesLeft: 0, queryCounter, maxedQueries};\n\n    function retrieveRecords() {\n      return new Promise((resolve, reject) => {\n        const promises = [];\n        // eslint-disable-next-line functional/no-let\n        let totalRecords = 0;\n\n        debug(`Searching for candidates with query: ${query} (Offset ${resultSetOffset})`);\n\n        client.searchRetrieve(query, {startRecord: resultSetOffset})\n          .on('error', err => {\n            // eslint-disable-next-line functional/no-conditional-statements\n            if (err instanceof SruSearchError) {\n              debug(`SRU SruSearchError for query: ${query}: ${err}`);\n              reject(new CandidateSearchError(`SRU SruSearchError for query: ${query}: ${err}`));\n            }\n            debug(`SRU error for query: ${query}: ${err}`);\n            reject(new CandidateSearchError(`SRU error for query: ${query}: ${err}`));\n          })\n          .on('total', total => {\n            debug(`Got total: ${total}`);\n            totalRecords += total;\n          })\n          .on('end', async nextOffset => {\n            try {\n              const recordPromises = await Promise.allSettled(promises);\n              debugData(`All recordPromises: ${JSON.stringify(recordPromises)}`);\n              const filtered = recordPromises.filter(r => r.status === 'fulfilled').map(r => r.value);\n              const failures = recordPromises.filter(r => r.status === 'rejected').map(r => ({status: r.reason.status, payload: r.reason.payload}));\n\n              debug(`Found ${recordPromises.length} records`);\n              debug(`Found ${filtered.length} convertable candidates`);\n              debug(`Found ${failures.length} NON-convertable candidates`);\n              debugData(`Converted: ${JSON.stringify(filtered)}.`);\n              debugData(`Not converted: ${JSON.stringify(failures)}.`);\n\n\n              resolve({nextOffset, records: filtered, failures, total: totalRecords});\n            } catch (err) {\n              debug(`Error caught on END`);\n              reject(err);\n            }\n          })\n          .on('record', recordXML => {\n            promises.push(handleRecord()); // eslint-disable-line functional/immutable-data\n\n            async function handleRecord() {\n              try {\n                const recordMarc = await MARCXML.from(recordXML, {subfieldValues: false});\n                const recordId = getRecordId(recordMarc);\n\n                return {record: recordMarc, id: recordId};\n              } catch (err) {\n                // What should this do?\n                const idFromXML = getRecordIdFromXML(recordXML);\n                debugData(`Failed converting record: ${err.message}, id: ${idFromXML}, data: ${recordXML}`);\n                //return {message: `Failed converting record: ${err.message}`, id: idFromXML, data: recordXML};\n                throw new MatchingError(422, {message: `Failed converting record: ${err.message}`, id: idFromXML || '000000000', data: recordXML});\n              }\n            }\n          });\n      });\n    }\n  };\n\n  function checkMaxedQuery(query, total, serverMaxResult) {\n    if (total >= serverMaxResult) {\n      debug(`WARNING: Query ${query} resulted in ${total} hits which meets the serverMaxResult (${serverMaxResult}) `);\n      return query;\n    }\n  }\n\n\n  function getRecordId(record) {\n    const [field] = record.get(/^001$/u);\n    return field ? field.value : '';\n  }\n\n  function getRecordIdFromXML(recordXML) {\n    //<controlfield tag=\\\"001\\\">015376846</controlfield\n    debug(`Cannot yet find possible database record id from recordXML (length ${recordXML.length})`);\n    return undefined;\n  }\n\n};\n"],"mappings":";;;;;;;;;;;;AA4BA,IAAAA,MAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,UAAA,GAAAC,uBAAA,CAAAF,OAAA;AACA,IAAAG,WAAA,GAAAH,OAAA;AACA,IAAAI,sBAAA,GAAAJ,OAAA;AACA,IAAAK,UAAA,GAAAH,uBAAA,CAAAF,OAAA;AACA,IAAAM,eAAA,GAAAN,OAAA;AAAiE,SAAAO,yBAAAC,CAAA,6BAAAC,OAAA,mBAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,CAAA,WAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA,KAAAF,CAAA;AAAA,SAAAN,wBAAAM,CAAA,EAAAE,CAAA,SAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA,eAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,WAAAK,OAAA,EAAAL,CAAA,QAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA,OAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA,OAAAQ,CAAA,KAAAC,SAAA,UAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,IAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAjB,CAAA,EAAAc,CAAA,SAAAI,CAAA,GAAAR,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA,UAAAI,CAAA,KAAAA,CAAA,CAAAX,GAAA,IAAAW,CAAA,CAAAC,GAAA,IAAAR,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAI,CAAA,IAAAV,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA,YAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAgB,GAAA,CAAAnB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAAA,SAAAjB,uBAAA6B,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAhB,UAAA,GAAAgB,GAAA,KAAAf,OAAA,EAAAe,GAAA;AAjCjE;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;;AAWO,MAAMC,oBAAoB,SAASC,KAAK,CAAC;;AAEhD;AAAAC,OAAA,CAAAF,oBAAA,GAAAA,oBAAA;AAAA,IAAAG,QAAA,GAEeA,CAAC;EAACC,MAAM;EAAEC,UAAU;EAAEC,GAAG;EAAEC,aAAa;EAAEC,oBAAoB,GAAG,EAAE;EAAEC,eAAe,GAAG;AAAK,CAAC,KAAK;EAC/GC,sBAAU,CAACC,oBAAoB,CAAC;IAACC,cAAc,EAAE;EAAK,CAAC,CAAC;EAExD,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,oDAAoD,CAAC;EACrF,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EAEtCD,SAAS,CAAE,eAAcE,IAAI,CAACC,SAAS,CAACb,UAAU,CAAE,EAAC,CAAC;EACtDU,SAAS,CAAE,QAAOT,GAAI,EAAC,CAAC;EACxBS,SAAS,CAAE,wBAAuBP,oBAAqB,EAAC,CAAC;EACzDO,SAAS,CAAE,oBAAmBN,eAAgB,EAAC,CAAC;EAChDM,SAAS,CAAE,kBAAiBR,aAAc,EAAC,CAAC;;EAE5C;EACA,MAAMY,4BAA4B,GAAGX,oBAAoB,IAAID,aAAa,GAAGA,aAAa,GAAGC,oBAAoB;EAEjH,MAAMY,aAAa,GAAGC,WAAW,CAACjB,MAAM,CAAC;EACzC,MAAMkB,SAAS,GAAG,IAAAC,kBAAiB,EAACnB,MAAM,EAAEC,UAAU,CAAC;EACvD,MAAMmB,MAAM,GAAG,IAAAC,kBAAY,EAAC;IAC1BnB,GAAG;IACHE,oBAAoB,EAAEW,4BAA4B;IAClDO,OAAO,EAAE,KAAK;IACdC,WAAW,EAAE;EACf,CAAC,CAAC;EAEFd,KAAK,CAAE,yBAAwBO,aAAc,EAAC,CAAC;EAC/CP,KAAK,CAAE,uBAAsBI,IAAI,CAACC,SAAS,CAACI,SAAS,CAAE,EAAC,CAAC;;EAEzD;;EAEA,IAAIA,SAAS,CAACM,MAAM,KAAK,CAAC,EAAE;IAC1B,MAAM,IAAI5B,oBAAoB,CAAE,0CAAyC,CAAC;EAC5E;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;;EAGA,OAAO,OAAO;IAAC6B,WAAW,GAAG,CAAC;IAAEC,eAAe,GAAG,CAAC;IAAEC,YAAY,GAAG,CAAC;IAAEC,aAAa,GAAG,CAAC;IAAEC,qBAAqB,GAAG,CAAC;IAAEC,YAAY,GAAG,CAAC;IAAEC,YAAY,GAAG;EAAE,CAAC,KAAK;IAC5J,MAAMC,KAAK,GAAGd,SAAS,CAACO,WAAW,CAAC;IAEpC,IAAIO,KAAK,EAAE;MACT,MAAM;QAACC,OAAO;QAAEC,QAAQ;QAAEC,UAAU;QAAEC;MAAK,CAAC,GAAG,MAAMC,eAAe,CAAC,CAAC;;MAEtE;MACA1B,SAAS,CAAE,oBAAmBe,eAAgB,EAAC,CAAC;MAChD,MAAMY,eAAe,GAAGZ,eAAe,KAAK,CAAC,GAAGU,KAAK,GAAGT,YAAY;MACpE,MAAMY,eAAe,GAAGb,eAAe,KAAK,CAAC,GAAGI,YAAY,GAAG,CAAC,GAAGA,YAAY;MAC/E,MAAMU,gBAAgB,GAAGd,eAAe,KAAK,CAAC,GAAG,CAAC,GAAGE,aAAa,GAAG,CAAC;MACtE,MAAMa,wBAAwB,GAAGf,eAAe,KAAK,CAAC,GAAGO,OAAO,CAACT,MAAM,GAAGU,QAAQ,CAACV,MAAM,GAAGK,qBAAqB,GAAGI,OAAO,CAACT,MAAM,GAAGU,QAAQ,CAACV,MAAM;MAEpJ,MAAMkB,UAAU,GAAGhB,eAAe,KAAK,CAAC,GAAGiB,eAAe,CAACX,KAAK,EAAEI,KAAK,EAAE/B,eAAe,CAAC,GAAGuC,SAAS;MACrG,MAAMC,eAAe,GAAGH,UAAU,GAAGX,YAAY,CAACe,MAAM,CAACJ,UAAU,CAAC,GAAGX,YAAY;MAEnF,IAAI,OAAOI,UAAU,KAAK,QAAQ,EAAE;QAClC1B,KAAK,CAAE,iCAAgCgB,WAAY,IAAGO,KAAM,0BAAyBG,UAAW,EAAC,CAAC;QAClG,OAAO;UAACF,OAAO;UAAEC,QAAQ;UAAET,WAAW;UAAEC,eAAe,EAAES,UAAU;UAAEY,WAAW,EAAE7B,SAAS,CAACM,MAAM,IAAIC,WAAW,GAAG,CAAC,CAAC;UAAEE,YAAY,EAAEW,eAAe;UAAEN,KAAK;UAAEJ,aAAa,EAAEY,gBAAgB;UAAEX,qBAAqB,EAAEY,wBAAwB;UAAEX,YAAY,EAAES,eAAe;UAAER,YAAY,EAAEc;QAAe,CAAC;MAC/S;MACApC,KAAK,CAAE,SAAQgB,WAAY,IAAGO,KAAM,QAAO,CAAC;MAC5CvB,KAAK,CAAE,cAAaS,SAAS,CAACM,MAAM,IAAIC,WAAW,GAAG,CAAC,CAAE,gBAAe,CAAC;MACzE,OAAO;QAACQ,OAAO;QAAEC,QAAQ;QAAET,WAAW,EAAEA,WAAW,GAAG,CAAC;QAAEsB,WAAW,EAAE7B,SAAS,CAACM,MAAM,IAAIC,WAAW,GAAG,CAAC,CAAC;QAAEE,YAAY,EAAEW,eAAe;QAAEN,KAAK;QAAEJ,aAAa,EAAEY,gBAAgB;QAAEX,qBAAqB,EAAEY,wBAAwB;QAAEX,YAAY,EAAES,eAAe;QAAER,YAAY,EAAEc;MAAe,CAAC;IACnS;IAEApC,KAAK,CAAE,OAAMS,SAAS,CAACM,MAAO,uCAAsCC,WAAY,EAAC,CAAC;IAClF,OAAO;MAACQ,OAAO,EAAE,EAAE;MAAEC,QAAQ,EAAE,EAAE;MAAEa,WAAW,EAAE,CAAC;MAAEjB,YAAY;MAAEC;IAAY,CAAC;IAE9E,SAASM,eAAeA,CAAA,EAAG;MACzB,OAAO,IAAIW,OAAO,CAAC,CAACC,OAAO,EAAEC,MAAM,KAAK;QACtC,MAAMC,QAAQ,GAAG,EAAE;QACnB;QACA,IAAIxB,YAAY,GAAG,CAAC;QAEpBlB,KAAK,CAAE,wCAAuCuB,KAAM,YAAWN,eAAgB,GAAE,CAAC;QAElFN,MAAM,CAACgC,cAAc,CAACpB,KAAK,EAAE;UAACqB,WAAW,EAAE3B;QAAe,CAAC,CAAC,CACzD4B,EAAE,CAAC,OAAO,EAAEC,GAAG,IAAI;UAClB;UACA,IAAIA,GAAG,YAAYC,yBAAc,EAAE;YACjC/C,KAAK,CAAE,iCAAgCuB,KAAM,KAAIuB,GAAI,EAAC,CAAC;YACvDL,MAAM,CAAC,IAAItD,oBAAoB,CAAE,iCAAgCoC,KAAM,KAAIuB,GAAI,EAAC,CAAC,CAAC;UACpF;UACA9C,KAAK,CAAE,wBAAuBuB,KAAM,KAAIuB,GAAI,EAAC,CAAC;UAC9CL,MAAM,CAAC,IAAItD,oBAAoB,CAAE,wBAAuBoC,KAAM,KAAIuB,GAAI,EAAC,CAAC,CAAC;QAC3E,CAAC,CAAC,CACDD,EAAE,CAAC,OAAO,EAAElB,KAAK,IAAI;UACpB3B,KAAK,CAAE,cAAa2B,KAAM,EAAC,CAAC;UAC5BT,YAAY,IAAIS,KAAK;QACvB,CAAC,CAAC,CACDkB,EAAE,CAAC,KAAK,EAAE,MAAMnB,UAAU,IAAI;UAC7B,IAAI;YACF,MAAMsB,cAAc,GAAG,MAAMT,OAAO,CAACU,UAAU,CAACP,QAAQ,CAAC;YACzDxC,SAAS,CAAE,uBAAsBE,IAAI,CAACC,SAAS,CAAC2C,cAAc,CAAE,EAAC,CAAC;YAClE,MAAME,QAAQ,GAAGF,cAAc,CAACG,MAAM,CAACnF,CAAC,IAAIA,CAAC,CAACoF,MAAM,KAAK,WAAW,CAAC,CAACC,GAAG,CAACrF,CAAC,IAAIA,CAAC,CAACsF,KAAK,CAAC;YACvF,MAAM7B,QAAQ,GAAGuB,cAAc,CAACG,MAAM,CAACnF,CAAC,IAAIA,CAAC,CAACoF,MAAM,KAAK,UAAU,CAAC,CAACC,GAAG,CAACrF,CAAC,KAAK;cAACoF,MAAM,EAAEpF,CAAC,CAACuF,MAAM,CAACH,MAAM;cAAEI,OAAO,EAAExF,CAAC,CAACuF,MAAM,CAACC;YAAO,CAAC,CAAC,CAAC;YAErIxD,KAAK,CAAE,SAAQgD,cAAc,CAACjC,MAAO,UAAS,CAAC;YAC/Cf,KAAK,CAAE,SAAQkD,QAAQ,CAACnC,MAAO,yBAAwB,CAAC;YACxDf,KAAK,CAAE,SAAQyB,QAAQ,CAACV,MAAO,6BAA4B,CAAC;YAC5Db,SAAS,CAAE,cAAaE,IAAI,CAACC,SAAS,CAAC6C,QAAQ,CAAE,GAAE,CAAC;YACpDhD,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAS,CAACoB,QAAQ,CAAE,GAAE,CAAC;YAGxDe,OAAO,CAAC;cAACd,UAAU;cAAEF,OAAO,EAAE0B,QAAQ;cAAEzB,QAAQ;cAAEE,KAAK,EAAET;YAAY,CAAC,CAAC;UACzE,CAAC,CAAC,OAAO4B,GAAG,EAAE;YACZ9C,KAAK,CAAE,qBAAoB,CAAC;YAC5ByC,MAAM,CAACK,GAAG,CAAC;UACb;QACF,CAAC,CAAC,CACDD,EAAE,CAAC,QAAQ,EAAEY,SAAS,IAAI;UACzBf,QAAQ,CAACgB,IAAI,CAACC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;;UAE/B,eAAeA,YAAYA,CAAA,EAAG;YAC5B,IAAI;cACF,MAAMC,UAAU,GAAG,MAAMC,8BAAO,CAACC,IAAI,CAACL,SAAS,EAAE;gBAAC1D,cAAc,EAAE;cAAK,CAAC,CAAC;cACzE,MAAMgE,QAAQ,GAAGvD,WAAW,CAACoD,UAAU,CAAC;cAExC,OAAO;gBAACrE,MAAM,EAAEqE,UAAU;gBAAEI,EAAE,EAAED;cAAQ,CAAC;YAC3C,CAAC,CAAC,OAAOjB,GAAG,EAAE;cACZ;cACA,MAAMmB,SAAS,GAAGC,kBAAkB,CAACT,SAAS,CAAC;cAC/CvD,SAAS,CAAE,6BAA4B4C,GAAG,CAACqB,OAAQ,SAAQF,SAAU,WAAUR,SAAU,EAAC,CAAC;cAC3F;cACA,MAAM,IAAIW,qBAAa,CAAC,GAAG,EAAE;gBAACD,OAAO,EAAG,6BAA4BrB,GAAG,CAACqB,OAAQ,EAAC;gBAAEH,EAAE,EAAEC,SAAS,IAAI,WAAW;gBAAEI,IAAI,EAAEZ;cAAS,CAAC,CAAC;YACpI;UACF;QACF,CAAC,CAAC;MACN,CAAC,CAAC;IACJ;EACF,CAAC;EAED,SAASvB,eAAeA,CAACX,KAAK,EAAEI,KAAK,EAAE/B,eAAe,EAAE;IACtD,IAAI+B,KAAK,IAAI/B,eAAe,EAAE;MAC5BI,KAAK,CAAE,kBAAiBuB,KAAM,gBAAeI,KAAM,0CAAyC/B,eAAgB,IAAG,CAAC;MAChH,OAAO2B,KAAK;IACd;EACF;EAGA,SAASf,WAAWA,CAACjB,MAAM,EAAE;IAC3B,MAAM,CAAC+E,KAAK,CAAC,GAAG/E,MAAM,CAAClB,GAAG,CAAC,QAAQ,CAAC;IACpC,OAAOiG,KAAK,GAAGA,KAAK,CAAChB,KAAK,GAAG,EAAE;EACjC;EAEA,SAASY,kBAAkBA,CAACT,SAAS,EAAE;IACrC;IACAzD,KAAK,CAAE,sEAAqEyD,SAAS,CAAC1C,MAAO,GAAE,CAAC;IAChG,OAAOoB,SAAS;EAClB;AAEF,CAAC;AAAA9C,OAAA,CAAAlB,OAAA,GAAAmB,QAAA"}

package/dist/candidate-search/index.spec.js

@@ -7,8 +7,8 @@ var _marcRecord = require("@natlibfi/marc-record");
 var _melindaCommons = require("@natlibfi/melinda-commons");
 var _ = _interopRequireWildcard(require("."));
 var _debug = _interopRequireDefault(require("debug"));
-function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
-function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function (e) { return e ? t : r; })(e); }
+function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != typeof e && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 /**
 *

package/dist/candidate-search/index.spec.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.spec.js","names":["_chai","require","_fixura","_fixugenHttpClient","_interopRequireDefault","_marcRecord","_melindaCommons","_","_interopRequireWildcard","_debug","_getRequireWildcardCache","nodeInterop","WeakMap","cacheBabelInterop","cacheNodeInterop","obj","__esModule","default","cache","has","get","newObj","hasPropertyDescriptor","Object","defineProperty","getOwnPropertyDescriptor","key","prototype","hasOwnProperty","call","desc","set","debug","createDebugLogger","describe","generateTests","callback","path","__dirname","recurse","fixura","reader","READERS","JSON","getFixture","factoryOptions","searchOptions","expectedFactoryError","expectedSearchError","enabled","url","isCandidateSearchError","expect","createSearchInterface","formatFactoryOptions","to","throw","CandidateSearchError","RegExp","search","iterate","stringify","maxRecordsPerRequest","maxServerResults","undefined","record","MarcRecord","subfieldValues","expectedErrorStatus","count","expectedResults","Error","err","be","an","errorMessage","MatchingError","payload","message","errorStatus","status","match","results","formatResults","eql","records","map","id","toObject"],"sources":["../../src/candidate-search/index.spec.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport {expect} from 'chai';\nimport {READERS} from '@natlibfi/fixura';\nimport generateTests from '@natlibfi/fixugen-http-client';\nimport {MarcRecord} from '@natlibfi/marc-record';\nimport {Error as MatchingError} from '@natlibfi/melinda-commons';\nimport createSearchInterface, {CandidateSearchError} from '.';\nimport createDebugLogger from 'debug';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:test');\n\ndescribe('candidate-search', () => {\n  generateTests({\n    callback,\n    path: [__dirname, '..', '..', 'test-fixtures', 'candidate-search', 'index'],\n    recurse: false,\n    fixura: {\n      reader: READERS.JSON\n    }\n  });\n\n  async function callback({getFixture, factoryOptions, searchOptions, expectedFactoryError = false, expectedSearchError = false, enabled = true}) {\n    const url = 'http://foo.bar';\n\n    if (!enabled) {\n      return;\n    }\n\n    if (expectedFactoryError) {\n      if (expectedFactoryError.isCandidateSearchError) {\n        expect(() => createSearchInterface({...formatFactoryOptions(), url})).to.throw(CandidateSearchError, new RegExp(expectedFactoryError, 'u'));\n        return;\n      }\n\n      expect(() => createSearchInterface({...formatFactoryOptions(), url})).to.throw(new RegExp(expectedFactoryError, 'u'));\n      return;\n    }\n\n    const search = createSearchInterface({...formatFactoryOptions(), url});\n    await iterate({searchOptions, expectedSearchError});\n\n    function formatFactoryOptions() {\n      debug(`Using factoryOptions: ${JSON.stringify(factoryOptions)}`);\n      return {\n        ...factoryOptions,\n        maxRecordsPerRequest: factoryOptions.maxRecordsPerRequest || 1,\n        maxServerResults: factoryOptions.maxServerResults || undefined,\n        record: new MarcRecord(factoryOptions.record, {subfieldValues: false})\n      };\n    }\n\n    async function iterate({searchOptions, expectedSearchError, expectedErrorStatus, count = 1}) {\n      const expectedResults = getFixture(`expectedResults${count}.json`);\n\n      if (expectedSearchError) { // eslint-disable-line functional/no-conditional-statements\n        try {\n          await search(searchOptions);\n          throw new Error('Expected an error');\n        } catch (err) {\n          debug(`Got an error: ${err}`);\n          expect(err).to.be.an('error');\n          const errorMessage = err instanceof MatchingError ? err.payload.message : err.message;\n          const errorStatus = err instanceof MatchingError ? err.status : undefined;\n          debug(`errorMessage: ${errorMessage}, errorStatus: ${errorStatus}`);\n          expect(errorMessage).to.match(new RegExp(expectedSearchError, 'u'));\n\n          if (expectedErrorStatus) {\n            expect(errorStatus).to.be(expectedErrorStatus);\n            return;\n          }\n          return;\n        }\n      }\n\n      // eslint-disable-next-line functional/no-conditional-statements\n      if (!expectedSearchError) {\n        const results = await search(searchOptions);\n        expect(formatResults(results)).to.eql(expectedResults);\n      }\n\n      function formatResults(results) {\n        debug(results);\n        return {\n          ...results,\n          records: results.records.map(({record, id}) => ({id, record: record.toObject()}))\n        };\n      }\n\n    }\n  }\n});\n"],"mappings":";;AA4BA,IAAAA,KAAA,GAAAC,OAAA;AACA,IAAAC,OAAA,GAAAD,OAAA;AACA,IAAAE,kBAAA,GAAAC,sBAAA,CAAAH,OAAA;AACA,IAAAI,WAAA,GAAAJ,OAAA;AACA,IAAAK,eAAA,GAAAL,OAAA;AACA,IAAAM,CAAA,GAAAC,uBAAA,CAAAP,OAAA;AACA,IAAAQ,MAAA,GAAAL,sBAAA,CAAAH,OAAA;AAAsC,SAAAS,yBAAAC,WAAA,eAAAC,OAAA,kCAAAC,iBAAA,OAAAD,OAAA,QAAAE,gBAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,WAAA,WAAAA,WAAA,GAAAG,gBAAA,GAAAD,iBAAA,KAAAF,WAAA;AAAA,SAAAH,wBAAAO,GAAA,EAAAJ,WAAA,SAAAA,WAAA,IAAAI,GAAA,IAAAA,GAAA,CAAAC,UAAA,WAAAD,GAAA,QAAAA,GAAA,oBAAAA,GAAA,wBAAAA,GAAA,4BAAAE,OAAA,EAAAF,GAAA,UAAAG,KAAA,GAAAR,wBAAA,CAAAC,WAAA,OAAAO,KAAA,IAAAA,KAAA,CAAAC,GAAA,CAAAJ,GAAA,YAAAG,KAAA,CAAAE,GAAA,CAAAL,GAAA,SAAAM,MAAA,WAAAC,qBAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,GAAA,IAAAX,GAAA,QAAAW,GAAA,kBAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAd,GAAA,EAAAW,GAAA,SAAAI,IAAA,GAAAR,qBAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAV,GAAA,EAAAW,GAAA,cAAAI,IAAA,KAAAA,IAAA,CAAAV,GAAA,IAAAU,IAAA,CAAAC,GAAA,KAAAR,MAAA,CAAAC,cAAA,CAAAH,MAAA,EAAAK,GAAA,EAAAI,IAAA,YAAAT,MAAA,CAAAK,GAAA,IAAAX,GAAA,CAAAW,GAAA,SAAAL,MAAA,CAAAJ,OAAA,GAAAF,GAAA,MAAAG,KAAA,IAAAA,KAAA,CAAAa,GAAA,CAAAhB,GAAA,EAAAM,MAAA,YAAAA,MAAA;AAAA,SAAAjB,uBAAAW,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AAlCtC;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;;AAUA,MAAMiB,KAAK,GAAG,IAAAC,cAAiB,EAAC,yDAAyD,CAAC;AAE1FC,QAAQ,CAAC,kBAAkB,EAAE,MAAM;EACjC,IAAAC,0BAAa,EAAC;IACZC,QAAQ;IACRC,IAAI,EAAE,CAACC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,eAAe,EAAE,kBAAkB,EAAE,OAAO,CAAC;IAC3EC,OAAO,EAAE,KAAK;IACdC,MAAM,EAAE;MACNC,MAAM,EAAEC,eAAO,CAACC;IAClB;EACF,CAAC,CAAC;EAEF,eAAeP,QAAQA,CAAC;IAACQ,UAAU;IAAEC,cAAc;IAAEC,aAAa;IAAEC,oBAAoB,GAAG,KAAK;IAAEC,mBAAmB,GAAG,KAAK;IAAEC,OAAO,GAAG;EAAI,CAAC,EAAE;IAC9I,MAAMC,GAAG,GAAG,gBAAgB;IAE5B,IAAI,CAACD,OAAO,EAAE;MACZ;IACF;IAEA,IAAIF,oBAAoB,EAAE;MACxB,IAAIA,oBAAoB,CAACI,sBAAsB,EAAE;QAC/C,IAAAC,YAAM,EAAC,MAAM,IAAAC,SAAqB,EAAC;UAAC,GAAGC,oBAAoB,CAAC,CAAC;UAAEJ;QAAG,CAAC,CAAC,CAAC,CAACK,EAAE,CAACC,KAAK,CAACC,sBAAoB,EAAE,IAAIC,MAAM,CAACX,oBAAoB,EAAE,GAAG,CAAC,CAAC;QAC3I;MACF;MAEA,IAAAK,YAAM,EAAC,MAAM,IAAAC,SAAqB,EAAC;QAAC,GAAGC,oBAAoB,CAAC,CAAC;QAAEJ;MAAG,CAAC,CAAC,CAAC,CAACK,EAAE,CAACC,KAAK,CAAC,IAAIE,MAAM,CAACX,oBAAoB,EAAE,GAAG,CAAC,CAAC;MACrH;IACF;IAEA,MAAMY,MAAM,GAAG,IAAAN,SAAqB,EAAC;MAAC,GAAGC,oBAAoB,CAAC,CAAC;MAAEJ;IAAG,CAAC,CAAC;IACtE,MAAMU,OAAO,CAAC;MAACd,aAAa;MAAEE;IAAmB,CAAC,CAAC;IAEnD,SAASM,oBAAoBA,CAAA,EAAG;MAC9BtB,KAAK,CAAE,yBAAwBW,IAAI,CAACkB,SAAS,CAAChB,cAAc,CAAE,EAAC,CAAC;MAChE,OAAO;QACL,GAAGA,cAAc;QACjBiB,oBAAoB,EAAEjB,cAAc,CAACiB,oBAAoB,IAAI,CAAC;QAC9DC,gBAAgB,EAAElB,cAAc,CAACkB,gBAAgB,IAAIC,SAAS;QAC9DC,MAAM,EAAE,IAAIC,sBAAU,CAACrB,cAAc,CAACoB,MAAM,EAAE;UAACE,cAAc,EAAE;QAAK,CAAC;MACvE,CAAC;IACH;IAEA,eAAeP,OAAOA,CAAC;MAACd,aAAa;MAAEE,mBAAmB;MAAEoB,mBAAmB;MAAEC,KAAK,GAAG;IAAC,CAAC,EAAE;MAC3F,MAAMC,eAAe,GAAG1B,UAAU,CAAE,kBAAiByB,KAAM,OAAM,CAAC;MAElE,IAAIrB,mBAAmB,EAAE;QAAE;QACzB,IAAI;UACF,MAAMW,MAAM,CAACb,aAAa,CAAC;UAC3B,MAAM,IAAIyB,KAAK,CAAC,mBAAmB,CAAC;QACtC,CAAC,CAAC,OAAOC,GAAG,EAAE;UACZxC,KAAK,CAAE,iBAAgBwC,GAAI,EAAC,CAAC;UAC7B,IAAApB,YAAM,EAACoB,GAAG,CAAC,CAACjB,EAAE,CAACkB,EAAE,CAACC,EAAE,CAAC,OAAO,CAAC;UAC7B,MAAMC,YAAY,GAAGH,GAAG,YAAYI,qBAAa,GAAGJ,GAAG,CAACK,OAAO,CAACC,OAAO,GAAGN,GAAG,CAACM,OAAO;UACrF,MAAMC,WAAW,GAAGP,GAAG,YAAYI,qBAAa,GAAGJ,GAAG,CAACQ,MAAM,GAAGhB,SAAS;UACzEhC,KAAK,CAAE,iBAAgB2C,YAAa,kBAAiBI,WAAY,EAAC,CAAC;UACnE,IAAA3B,YAAM,EAACuB,YAAY,CAAC,CAACpB,EAAE,CAAC0B,KAAK,CAAC,IAAIvB,MAAM,CAACV,mBAAmB,EAAE,GAAG,CAAC,CAAC;UAEnE,IAAIoB,mBAAmB,EAAE;YACvB,IAAAhB,YAAM,EAAC2B,WAAW,CAAC,CAACxB,EAAE,CAACkB,EAAE,CAACL,mBAAmB,CAAC;YAC9C;UACF;UACA;QACF;MACF;;MAEA;MACA,IAAI,CAACpB,mBAAmB,EAAE;QACxB,MAAMkC,OAAO,GAAG,MAAMvB,MAAM,CAACb,aAAa,CAAC;QAC3C,IAAAM,YAAM,EAAC+B,aAAa,CAACD,OAAO,CAAC,CAAC,CAAC3B,EAAE,CAAC6B,GAAG,CAACd,eAAe,CAAC;MACxD;MAEA,SAASa,aAAaA,CAACD,OAAO,EAAE;QAC9BlD,KAAK,CAACkD,OAAO,CAAC;QACd,OAAO;UACL,GAAGA,OAAO;UACVG,OAAO,EAAEH,OAAO,CAACG,OAAO,CAACC,GAAG,CAAC,CAAC;YAACrB,MAAM;YAAEsB;UAAE,CAAC,MAAM;YAACA,EAAE;YAAEtB,MAAM,EAAEA,MAAM,CAACuB,QAAQ,CAAC;UAAC,CAAC,CAAC;QAClF,CAAC;MACH;IAEF;EACF;AACF,CAAC,CAAC"}
+{"version":3,"file":"index.spec.js","names":["_chai","require","_fixura","_fixugenHttpClient","_interopRequireDefault","_marcRecord","_melindaCommons","_","_interopRequireWildcard","_debug","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","prototype","hasOwnProperty","call","i","set","obj","debug","createDebugLogger","describe","generateTests","callback","path","__dirname","recurse","fixura","reader","READERS","JSON","getFixture","factoryOptions","searchOptions","expectedFactoryError","expectedSearchError","enabled","url","isCandidateSearchError","expect","createSearchInterface","formatFactoryOptions","to","throw","CandidateSearchError","RegExp","search","iterate","stringify","maxRecordsPerRequest","maxServerResults","undefined","record","MarcRecord","subfieldValues","expectedErrorStatus","count","expectedResults","Error","err","be","an","errorMessage","MatchingError","payload","message","errorStatus","status","match","results","formatResults","eql","records","map","id","toObject"],"sources":["../../src/candidate-search/index.spec.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport {expect} from 'chai';\nimport {READERS} from '@natlibfi/fixura';\nimport generateTests from '@natlibfi/fixugen-http-client';\nimport {MarcRecord} from '@natlibfi/marc-record';\nimport {Error as MatchingError} from '@natlibfi/melinda-commons';\nimport createSearchInterface, {CandidateSearchError} from '.';\nimport createDebugLogger from 'debug';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:test');\n\ndescribe('candidate-search', () => {\n  generateTests({\n    callback,\n    path: [__dirname, '..', '..', 'test-fixtures', 'candidate-search', 'index'],\n    recurse: false,\n    fixura: {\n      reader: READERS.JSON\n    }\n  });\n\n  async function callback({getFixture, factoryOptions, searchOptions, expectedFactoryError = false, expectedSearchError = false, enabled = true}) {\n    const url = 'http://foo.bar';\n\n    if (!enabled) {\n      return;\n    }\n\n    if (expectedFactoryError) {\n      if (expectedFactoryError.isCandidateSearchError) {\n        expect(() => createSearchInterface({...formatFactoryOptions(), url})).to.throw(CandidateSearchError, new RegExp(expectedFactoryError, 'u'));\n        return;\n      }\n\n      expect(() => createSearchInterface({...formatFactoryOptions(), url})).to.throw(new RegExp(expectedFactoryError, 'u'));\n      return;\n    }\n\n    const search = createSearchInterface({...formatFactoryOptions(), url});\n    await iterate({searchOptions, expectedSearchError});\n\n    function formatFactoryOptions() {\n      debug(`Using factoryOptions: ${JSON.stringify(factoryOptions)}`);\n      return {\n        ...factoryOptions,\n        maxRecordsPerRequest: factoryOptions.maxRecordsPerRequest || 1,\n        maxServerResults: factoryOptions.maxServerResults || undefined,\n        record: new MarcRecord(factoryOptions.record, {subfieldValues: false})\n      };\n    }\n\n    async function iterate({searchOptions, expectedSearchError, expectedErrorStatus, count = 1}) {\n      const expectedResults = getFixture(`expectedResults${count}.json`);\n\n      if (expectedSearchError) { // eslint-disable-line functional/no-conditional-statements\n        try {\n          await search(searchOptions);\n          throw new Error('Expected an error');\n        } catch (err) {\n          debug(`Got an error: ${err}`);\n          expect(err).to.be.an('error');\n          const errorMessage = err instanceof MatchingError ? err.payload.message : err.message;\n          const errorStatus = err instanceof MatchingError ? err.status : undefined;\n          debug(`errorMessage: ${errorMessage}, errorStatus: ${errorStatus}`);\n          expect(errorMessage).to.match(new RegExp(expectedSearchError, 'u'));\n\n          if (expectedErrorStatus) {\n            expect(errorStatus).to.be(expectedErrorStatus);\n            return;\n          }\n          return;\n        }\n      }\n\n      // eslint-disable-next-line functional/no-conditional-statements\n      if (!expectedSearchError) {\n        const results = await search(searchOptions);\n        expect(formatResults(results)).to.eql(expectedResults);\n      }\n\n      function formatResults(results) {\n        debug(results);\n        return {\n          ...results,\n          records: results.records.map(({record, id}) => ({id, record: record.toObject()}))\n        };\n      }\n\n    }\n  }\n});\n"],"mappings":";;AA4BA,IAAAA,KAAA,GAAAC,OAAA;AACA,IAAAC,OAAA,GAAAD,OAAA;AACA,IAAAE,kBAAA,GAAAC,sBAAA,CAAAH,OAAA;AACA,IAAAI,WAAA,GAAAJ,OAAA;AACA,IAAAK,eAAA,GAAAL,OAAA;AACA,IAAAM,CAAA,GAAAC,uBAAA,CAAAP,OAAA;AACA,IAAAQ,MAAA,GAAAL,sBAAA,CAAAH,OAAA;AAAsC,SAAAS,yBAAAC,CAAA,6BAAAC,OAAA,mBAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,CAAA,WAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA,KAAAF,CAAA;AAAA,SAAAH,wBAAAG,CAAA,EAAAE,CAAA,SAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA,eAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,WAAAK,OAAA,EAAAL,CAAA,QAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA,OAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA,OAAAQ,CAAA,KAAAC,SAAA,UAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,IAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAjB,CAAA,EAAAc,CAAA,SAAAI,CAAA,GAAAR,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA,UAAAI,CAAA,KAAAA,CAAA,CAAAX,GAAA,IAAAW,CAAA,CAAAC,GAAA,IAAAR,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAI,CAAA,IAAAV,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA,YAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAgB,GAAA,CAAAnB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAAA,SAAAf,uBAAA2B,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAhB,UAAA,GAAAgB,GAAA,KAAAf,OAAA,EAAAe,GAAA;AAlCtC;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;;AAUA,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,yDAAyD,CAAC;AAE1FC,QAAQ,CAAC,kBAAkB,EAAE,MAAM;EACjC,IAAAC,0BAAa,EAAC;IACZC,QAAQ;IACRC,IAAI,EAAE,CAACC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,eAAe,EAAE,kBAAkB,EAAE,OAAO,CAAC;IAC3EC,OAAO,EAAE,KAAK;IACdC,MAAM,EAAE;MACNC,MAAM,EAAEC,eAAO,CAACC;IAClB;EACF,CAAC,CAAC;EAEF,eAAeP,QAAQA,CAAC;IAACQ,UAAU;IAAEC,cAAc;IAAEC,aAAa;IAAEC,oBAAoB,GAAG,KAAK;IAAEC,mBAAmB,GAAG,KAAK;IAAEC,OAAO,GAAG;EAAI,CAAC,EAAE;IAC9I,MAAMC,GAAG,GAAG,gBAAgB;IAE5B,IAAI,CAACD,OAAO,EAAE;MACZ;IACF;IAEA,IAAIF,oBAAoB,EAAE;MACxB,IAAIA,oBAAoB,CAACI,sBAAsB,EAAE;QAC/C,IAAAC,YAAM,EAAC,MAAM,IAAAC,SAAqB,EAAC;UAAC,GAAGC,oBAAoB,CAAC,CAAC;UAAEJ;QAAG,CAAC,CAAC,CAAC,CAACK,EAAE,CAACC,KAAK,CAACC,sBAAoB,EAAE,IAAIC,MAAM,CAACX,oBAAoB,EAAE,GAAG,CAAC,CAAC;QAC3I;MACF;MAEA,IAAAK,YAAM,EAAC,MAAM,IAAAC,SAAqB,EAAC;QAAC,GAAGC,oBAAoB,CAAC,CAAC;QAAEJ;MAAG,CAAC,CAAC,CAAC,CAACK,EAAE,CAACC,KAAK,CAAC,IAAIE,MAAM,CAACX,oBAAoB,EAAE,GAAG,CAAC,CAAC;MACrH;IACF;IAEA,MAAMY,MAAM,GAAG,IAAAN,SAAqB,EAAC;MAAC,GAAGC,oBAAoB,CAAC,CAAC;MAAEJ;IAAG,CAAC,CAAC;IACtE,MAAMU,OAAO,CAAC;MAACd,aAAa;MAAEE;IAAmB,CAAC,CAAC;IAEnD,SAASM,oBAAoBA,CAAA,EAAG;MAC9BtB,KAAK,CAAE,yBAAwBW,IAAI,CAACkB,SAAS,CAAChB,cAAc,CAAE,EAAC,CAAC;MAChE,OAAO;QACL,GAAGA,cAAc;QACjBiB,oBAAoB,EAAEjB,cAAc,CAACiB,oBAAoB,IAAI,CAAC;QAC9DC,gBAAgB,EAAElB,cAAc,CAACkB,gBAAgB,IAAIC,SAAS;QAC9DC,MAAM,EAAE,IAAIC,sBAAU,CAACrB,cAAc,CAACoB,MAAM,EAAE;UAACE,cAAc,EAAE;QAAK,CAAC;MACvE,CAAC;IACH;IAEA,eAAeP,OAAOA,CAAC;MAACd,aAAa;MAAEE,mBAAmB;MAAEoB,mBAAmB;MAAEC,KAAK,GAAG;IAAC,CAAC,EAAE;MAC3F,MAAMC,eAAe,GAAG1B,UAAU,CAAE,kBAAiByB,KAAM,OAAM,CAAC;MAElE,IAAIrB,mBAAmB,EAAE;QAAE;QACzB,IAAI;UACF,MAAMW,MAAM,CAACb,aAAa,CAAC;UAC3B,MAAM,IAAIyB,KAAK,CAAC,mBAAmB,CAAC;QACtC,CAAC,CAAC,OAAOC,GAAG,EAAE;UACZxC,KAAK,CAAE,iBAAgBwC,GAAI,EAAC,CAAC;UAC7B,IAAApB,YAAM,EAACoB,GAAG,CAAC,CAACjB,EAAE,CAACkB,EAAE,CAACC,EAAE,CAAC,OAAO,CAAC;UAC7B,MAAMC,YAAY,GAAGH,GAAG,YAAYI,qBAAa,GAAGJ,GAAG,CAACK,OAAO,CAACC,OAAO,GAAGN,GAAG,CAACM,OAAO;UACrF,MAAMC,WAAW,GAAGP,GAAG,YAAYI,qBAAa,GAAGJ,GAAG,CAACQ,MAAM,GAAGhB,SAAS;UACzEhC,KAAK,CAAE,iBAAgB2C,YAAa,kBAAiBI,WAAY,EAAC,CAAC;UACnE,IAAA3B,YAAM,EAACuB,YAAY,CAAC,CAACpB,EAAE,CAAC0B,KAAK,CAAC,IAAIvB,MAAM,CAACV,mBAAmB,EAAE,GAAG,CAAC,CAAC;UAEnE,IAAIoB,mBAAmB,EAAE;YACvB,IAAAhB,YAAM,EAAC2B,WAAW,CAAC,CAACxB,EAAE,CAACkB,EAAE,CAACL,mBAAmB,CAAC;YAC9C;UACF;UACA;QACF;MACF;;MAEA;MACA,IAAI,CAACpB,mBAAmB,EAAE;QACxB,MAAMkC,OAAO,GAAG,MAAMvB,MAAM,CAACb,aAAa,CAAC;QAC3C,IAAAM,YAAM,EAAC+B,aAAa,CAACD,OAAO,CAAC,CAAC,CAAC3B,EAAE,CAAC6B,GAAG,CAACd,eAAe,CAAC;MACxD;MAEA,SAASa,aAAaA,CAACD,OAAO,EAAE;QAC9BlD,KAAK,CAACkD,OAAO,CAAC;QACd,OAAO;UACL,GAAGA,OAAO;UACVG,OAAO,EAAEH,OAAO,CAACG,OAAO,CAACC,GAAG,CAAC,CAAC;YAACrB,MAAM;YAAEsB;UAAE,CAAC,MAAM;YAACA,EAAE;YAAEtB,MAAM,EAAEA,MAAM,CAACuB,QAAQ,CAAC;UAAC,CAAC,CAAC;QAClF,CAAC;MACH;IAEF;EACF;AACF,CAAC,CAAC"}

package/dist/candidate-search/query-list/bib.js

@@ -10,8 +10,6 @@ exports.bibPublishers = bibPublishers;
 exports.bibSourceIds = bibSourceIds;
 exports.bibStandardIdentifiers = bibStandardIdentifiers;
 exports.bibTitle = bibTitle;
-exports.bibTitleAuthor = bibTitleAuthor;
-exports.bibTitleAuthorPublisher = bibTitleAuthorPublisher;
 var _debug = _interopRequireDefault(require("debug"));
 var _candidateSearchUtils = require("../candidate-search-utils");
 var _matchingUtils = require("../../matching-utils");
@@ -166,24 +164,6 @@ function bibHostComponents(record) {
 // record is correctly catalogued using a filing indicator -> dc.title search won't match
 
 function bibTitle(record) {
-  // We get author/publisher only when formatted title is shorter than 5 chars
-  return bibTitleAuthorPublisher({
-    record,
-    onlyTitleLength: 5
-  });
-}
-function bibTitleAuthor(record) {
-  // We use onlyTitleLength that is longer than our formatted length to
-  // get an author or an publisher always
-  return bibTitleAuthorPublisher({
-    record,
-    onlyTitleLength: 100
-  });
-}
-function bibTitleAuthorPublisher({
-  record,
-  onlyTitleLength
-}) {
   const title = getTitle();
   const booleanStartWords = ['and', 'or', 'nor', 'not'];
   if ((0, _matchingUtils.testStringOrNumber)(title)) {
@@ -193,47 +173,29 @@ function bibTitleAuthorPublisher({
 
     // use word search for titles starting with a boolean
     const useWordSearch = booleanStartWords.some(word => formatted.toLowerCase().startsWith(word));
-    // Prevent too many matches / SRU crashing by having a minimum length
+    // Prevent too many matches by having a minimum length
     // Note that currently this fails matching if there are no matches from previous matchers
-    if (formatted.length >= onlyTitleLength) {
+    if (formatted.length >= 5) {
       return [`dc.title="${useWordSearch ? '' : '^'}${formatted}*"`];
     }
-    const queryIsOkAlone = formatted.length >= 5;
-
     // use word search without ending * also in combination searches to avoid SRU-server crashes [MRA-189]
-    const query = `dc.title="${useWordSearch || !queryIsOkAlone ? '' : '^'}${formatted}${queryIsOkAlone ? '*' : ''}"`;
-    return addAuthorsToSearch({
-      query,
-      queryIsOkAlone
-    });
+    return addAuthorsToSearch(`dc.title="${formatted}"`);
   }
   return [];
-  function addAuthorsToSearch({
-    query,
-    queryIsOkAlone = false
-  }) {
+  function addAuthorsToSearch(titleQuery) {
     const [authorQuery] = bibAuthors(record);
     if (authorQuery !== undefined) {
-      return [`${authorQuery} AND ${query}`];
+      return [`${authorQuery} AND ${titleQuery}`];
     }
-    return addPublisherToSearch({
-      query,
-      queryIsOkAlone
-    });
+    return addPublisherToSearch(titleQuery);
     //return [];
   }
 
-  function addPublisherToSearch({
-    query,
-    queryIsOkAlone = false
-  }) {
+  function addPublisherToSearch(query) {
     const [publisherQuery] = bibPublishers(record);
     if (publisherQuery !== undefined) {
       return [`${publisherQuery} AND ${query}`];
     }
-    if (queryIsOkAlone) {
-      return [`${query}`];
-    }
     return [];
   }
   function getTitle() {
@@ -275,6 +237,9 @@ function bibAuthors(record) {
     if (formatted.length >= 5) {
       return [`dc.author="${useWordSearch ? '' : '^'}${formatted}*"`];
     }
+    //if (formatted) {
+    //  return [`dc.author="${formatted}"`];
+    //}
     return [];
   }
   return [];

package/dist/candidate-search/query-list/bib.js.map

@@ -1 +1 @@
-{"version":3,"file":"bib.js","names":["_debug","_interopRequireDefault","require","_candidateSearchUtils","_matchingUtils","obj","__esModule","default","bibSourceIds","record","debug","createDebugLogger","debugData","extend","fSids","get","length","JSON","stringify","toSidQueries","sidStrings","getSidStrings","sidQueries","toQueries","map","toSidString","filter","nonEmptySid","field","validateSidFieldSubfieldCounts","createSidString","sfC","getSubfieldValues","sfB","cleanedSfC","removeSourcePrefix","normalizeSidSubfieldValue","cleanedSfB","concat","subfieldValue","sourcePrefixRegex","normalizedValue","testStringOrNumber","String","replace","normalizeAwayRegex","bibMelindaIds","melindaIds","getMelindaIdsF035","bibHostComponents","id","getHostId","value","subfields","find","code","test","bibTitle","bibTitleAuthorPublisher","onlyTitleLength","bibTitleAuthor","title","getTitle","booleanStartWords","formatted","trim","slice","useWordSearch","some","word","toLowerCase","startsWith","queryIsOkAlone","query","addAuthorsToSearch","authorQuery","bibAuthors","undefined","addPublisherToSearch","publisherQuery","bibPublishers","titleString","includes","join","author","getAuthor","authorString","publisher","getPublisher","publisherString","bibStandardIdentifiers","fields","identifiers","toIdentifiers","uniqueIdentifiers","Set","tag","issnIsbnReqExp","otherIdReqExp","sub"],"sources":["../../../src/candidate-search/query-list/bib.js"],"sourcesContent":["\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-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\nimport createDebugLogger from 'debug';\nimport {toQueries} from '../candidate-search-utils';\nimport {getMelindaIdsF035, validateSidFieldSubfieldCounts, getSubfieldValues, testStringOrNumber} from '../../matching-utils';\n\n\nexport function bibSourceIds(record) {\n\n  /* Melinda's SRU-index melinda.sourceid includes source IDs from SID fields in Melinda records\n     SID-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     SID__ $c /10024/508126 $ REPO_THESEUS\n\n    In melinda.sourceid -index case is kept, sourceprefixes in brackets and hyphens are normalized away:\n    Note: slashes are not normalized away, but a SRU-search-string including slashes needs to be quoted\n\n    1234567helka\n    1077305sata\n    VER999999FIKV\n    /10024/508126REPO_THESEUS\n\n    Note: 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\n   */\n\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:source-ids');\n  const debugData = debug.extend('data');\n  //const debugInfo = debug.extend('info');\n\n  debug(`Creating queries for sourceid's`);\n\n  const fSids = record.get('SID');\n  debugData(`SID-fields (${fSids.length}): ${JSON.stringify(fSids)}`);\n\n  return fSids.length > 0 ? toSidQueries(fSids) : [];\n\n  function toSidQueries(fSids) {\n    debug(`Creating actual queries for sourceid's`);\n\n    const sidStrings = getSidStrings(fSids);\n\n    if (sidStrings.length < 1) {\n      debug(`No identifiers found, no queries created.`);\n      return [];\n    }\n\n    const sidQueries = toQueries(sidStrings, 'melinda.sourceid');\n\n    return sidQueries;\n\n    function getSidStrings(fSids) {\n      debug(`Getting Sid strings from SID fields`);\n\n      // Map SID fields to valid sidStrings, filter out empty strings\n      const sidStrings = fSids.map(toSidString).filter(nonEmptySid => nonEmptySid);\n      return sidStrings;\n\n      function toSidString(field) {\n        debug(`Getting string from a field`);\n\n        return validateSidFieldSubfieldCounts(field) ? createSidString(field) : '';\n\n        function createSidString(field) {\n          debug(`Creating string from a field`);\n          const [sfC] = getSubfieldValues(field, 'c');\n          const [sfB] = getSubfieldValues(field, 'b');\n\n          const cleanedSfC = removeSourcePrefix(normalizeSidSubfieldValue(sfC));\n          const cleanedSfB = normalizeSidSubfieldValue(sfB);\n\n          debugData(`${JSON.stringify(sfC)} + ${JSON.stringify(sfB)}`);\n          return cleanedSfC.concat(cleanedSfB);\n        }\n\n        function removeSourcePrefix(subfieldValue) {\n          const sourcePrefixRegex = (/^(?<sourcePrefix>\\([A-Za-z0-9-]+\\))(?<id>.+)$/u);\n          const normalizedValue = testStringOrNumber(subfieldValue) ? String(subfieldValue).replace(sourcePrefixRegex, '$<id>') : '';\n          debugData(`Normalized ${subfieldValue} to ${normalizedValue}`);\n          return normalizedValue;\n        }\n\n        function normalizeSidSubfieldValue(subfieldValue) {\n          debugData(`Normalizing ${subfieldValue}`);\n          const normalizeAwayRegex = (/[- ]/u);\n          return testStringOrNumber(subfieldValue) ? String(subfieldValue).replace(normalizeAwayRegex, '') : '';\n        }\n\n      }\n    }\n  }\n}\n\nexport function bibMelindaIds(record) {\n  // Melinda's SRU-index melinda.melindaid includes f001 controlnumbers and old Melinda-IDs from f035z's for all non-deleted Melinda-records\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibMelindaIds');\n  const debugData = debug.extend('data');\n  debug(`Creating queries for MelindaIds`);\n\n  // Note: Melinda-ID's for search queries are created just from records f035a's and f035z's\n  // Both (FI-MELINDA)- and FCC-prefixed forms are found\n  // f001 controlnumber is not currently included, even if record's f003 is FI-MELINDA\n  const melindaIds = getMelindaIdsF035(record);\n\n  debugData(`Unique identifiers (${melindaIds.length}): ${JSON.stringify(melindaIds)}`);\n\n  if (melindaIds.length < 1) {\n    debug(`No identifiers found, no queries created.`);\n    return [];\n  }\n\n  return toQueries(melindaIds, 'melinda.melindaid');\n}\n\n\n// bibHostComponents returns host id from the first subfield $w of first field f773, see test-fixtures 04 and 05\n// bibHostComponents should search all 773 $ws for possible host id, but what should it do in case of multiple host ids?\nexport function bibHostComponents(record) {\n  const id = getHostId();\n  return testStringOrNumber(id) ? [`melinda.partsofhost=${id}`] : [];\n\n  function getHostId() {\n    const [field] = record.get(/^773$/u);\n\n    if (field) {\n      const {value} = field.subfields.find(({code}) => code === 'w') || {};\n\n      if (testStringOrNumber(value) && (/^\\(FI-MELINDA\\)/u).test(String(value))) {\n        return String(value).replace(/^\\(FI-MELINDA\\)/u, '');\n      }\n\n      if (testStringOrNumber(value) && (/^\\(FIN01\\)/u).test(String(value))) {\n        return String(value).replace(/^\\(FIN01\\)/u, '');\n      }\n\n      return false;\n    }\n    return false;\n  }\n}\n\n// SRU search dc.title with a search phrase starting with ^ maps currently in Melinda to\n// (probably) to *headings* index TIT\n// - Aleph cannot currently handle headings searches starting with a boolean - in these cases use word search\n\n// Headings index TIT drops articles etc. from the start of the title according to the filing indicator\n// Currently filing indicator is not implemented - if the title starts with an article and the Melinda\n// record is correctly catalogued using a filing indicator -> dc.title search won't match\n\nexport function bibTitle(record) {\n  // We get author/publisher only when formatted title is shorter than 5 chars\n  return bibTitleAuthorPublisher({record, onlyTitleLength: 5});\n}\n\nexport function bibTitleAuthor(record) {\n  // We use onlyTitleLength that is longer than our formatted length to\n  // get an author or an publisher always\n  return bibTitleAuthorPublisher({record, onlyTitleLength: 100});\n}\n\nexport function bibTitleAuthorPublisher({record, onlyTitleLength}) {\n  const title = getTitle();\n  const booleanStartWords = ['and', 'or', 'nor', 'not'];\n\n  if (testStringOrNumber(title)) {\n    const formatted = String(title)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    // use word search for titles starting with a boolean\n    const useWordSearch = booleanStartWords.some(word => formatted.toLowerCase().startsWith(word));\n    // Prevent too many matches / SRU crashing by having a minimum length\n    // Note that currently this fails matching if there are no matches from previous matchers\n    if (formatted.length >= onlyTitleLength) {\n      return [`dc.title=\"${useWordSearch ? '' : '^'}${formatted}*\"`];\n    }\n    const queryIsOkAlone = formatted.length >= 5;\n\n    // use word search without ending * also in combination searches to avoid SRU-server crashes [MRA-189]\n    const query = `dc.title=\"${useWordSearch || !queryIsOkAlone ? '' : '^'}${formatted}${queryIsOkAlone ? '*' : ''}\"`;\n\n    return addAuthorsToSearch({query, queryIsOkAlone});\n  }\n\n  return [];\n\n  function addAuthorsToSearch({query, queryIsOkAlone = false}) {\n    const [authorQuery] = bibAuthors(record);\n    if (authorQuery !== undefined) {\n      return [`${authorQuery} AND ${query}`];\n    }\n    return addPublisherToSearch({query, queryIsOkAlone});\n    //return [];\n  }\n\n  function addPublisherToSearch({query, queryIsOkAlone = false}) {\n    const [publisherQuery] = bibPublishers(record);\n    if (publisherQuery !== undefined) {\n      return [`${publisherQuery} AND ${query}`];\n    }\n    if (queryIsOkAlone) {\n      return [`${query}`];\n    }\n    return [];\n  }\n\n  function getTitle() {\n    const [field] = record.get(/^245$/u);\n\n    if (field) {\n      const titleString = field.subfields\n        //.filter(({code}) => ['a', 'b', 'n', 'p'].includes(code))\n        .filter(({code}) => ['a', 'b'].includes(code))\n        //.filter(({code}) => ['a'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return titleString;\n    }\n    return false;\n  }\n}\n\nexport function bibAuthors(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibAuthors');\n  const debugData = debug.extend('data');\n  debug(`Creating query for the first author`);\n  //debugData(record);\n\n  const author = getAuthor(record);\n  const booleanStartWords = ['and', 'or', 'nor', 'not'];\n\n\n  if (testStringOrNumber(author)) {\n    const formatted = String(author)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    // use word search for authors starting with a boolean\n    const useWordSearch = booleanStartWords.some(word => formatted.toLowerCase().startsWith(word));\n    // Prevent too many matches by having a minimum length\n    debugData(`Author string: ${formatted}`);\n    if (formatted.length >= 5) {\n      return [`dc.author=\"${useWordSearch ? '' : '^'}${formatted}*\"`];\n    }\n    return [];\n  }\n\n  return [];\n\n  function getAuthor(record) {\n    //debugData(record);\n    // eslint-disable-next-line prefer-named-capture-group\n    const [field] = record.get(/^(100)|(110)|(111)|(700)|(710)|(711)$/u);\n    //debugData(field);\n\n    if (field) {\n      const authorString = field.subfields\n        .filter(({code}) => ['a'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return authorString;\n    }\n    return false;\n  }\n}\n\nexport function bibPublishers(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibPublishers');\n  const debugData = debug.extend('data');\n  debug(`Creating query for the first publisher`);\n  //debugData(record);\n\n  const publisher = getPublisher(record);\n  if (testStringOrNumber(publisher)) {\n    const formatted = String(publisher)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    debugData(`Publisher string: ${formatted}`);\n    // use non-wildcard word search from dc.publisher\n    return [`dc.publisher=\"${formatted}\"`];\n  }\n\n  return [];\n\n  function getPublisher(record) {\n    //debugData(record);\n    const [field] = record.get(/^(?:260)|(?:264)$/u);\n    //debugData(field);\n\n    if (field) {\n      const publisherString = field.subfields\n        .filter(({code}) => ['b'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return publisherString;\n    }\n    return false;\n  }\n}\n\n\nexport function bibStandardIdentifiers(record) {\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibStandardIdentifiers');\n  const debugData = debug.extend('data');\n  debug(`Creating queries for standard identifiers`);\n\n  // DEVELOP: should we query also f015 and f028?\n\n  const fields = record.get(/^(?<def>020|022|024)$/u);\n  const identifiers = [].concat(...fields.map(toIdentifiers));\n  const uniqueIdentifiers = [...new Set(identifiers)];\n\n  debugData(`Standard identifier fields: ${JSON.stringify(fields)}`);\n  debugData(`Identifiers (${identifiers.length}): ${JSON.stringify(identifiers)}`);\n  debugData(`Unique identifiers (${uniqueIdentifiers.length}): ${JSON.stringify(uniqueIdentifiers)}`);\n\n  if (uniqueIdentifiers.length < 1) {\n    debug(`No identifiers found, no queries created.`);\n    return [];\n  }\n\n  return toQueries(uniqueIdentifiers, 'dc.identifier');\n\n  function toIdentifiers({tag, subfields}) {\n    const issnIsbnReqExp = (/^[A-Za-z0-9-]+$/u);\n    const otherIdReqExp = (/^[A-Za-z0-9-:]+$/u);\n\n    if (tag === '022') {\n      return subfields\n        .filter(sub => ['a', 'z', 'y'].includes(sub.code) && testStringOrNumber(sub.value) && issnIsbnReqExp.test(String(sub.value)))\n        .map(({value}) => String(value));\n    }\n\n    if (tag === '020') {\n      return subfields\n        .filter(sub => ['a', 'z'].includes(sub.code) && testStringOrNumber(sub.value) && issnIsbnReqExp.test(String(sub.value)))\n        .map(({value}) => String(value));\n    }\n\n    return subfields\n      .filter(sub => ['a', 'z'].includes(sub.code) && testStringOrNumber(sub.value) && otherIdReqExp.test(String(sub.value)))\n      .map(({value}) => String(value));\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;AA4BA,IAAAA,MAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,qBAAA,GAAAD,OAAA;AACA,IAAAE,cAAA,GAAAF,OAAA;AAA8H,SAAAD,uBAAAI,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AA7B9H;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;;AAMO,SAASG,YAAYA,CAACC,MAAM,EAAE;EAEnC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;EAQE,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,qEAAqE,CAAC;EACtG,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EACtC;;EAEAH,KAAK,CAAE,iCAAgC,CAAC;EAExC,MAAMI,KAAK,GAAGL,MAAM,CAACM,GAAG,CAAC,KAAK,CAAC;EAC/BH,SAAS,CAAE,eAAcE,KAAK,CAACE,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACJ,KAAK,CAAE,EAAC,CAAC;EAEnE,OAAOA,KAAK,CAACE,MAAM,GAAG,CAAC,GAAGG,YAAY,CAACL,KAAK,CAAC,GAAG,EAAE;EAElD,SAASK,YAAYA,CAACL,KAAK,EAAE;IAC3BJ,KAAK,CAAE,wCAAuC,CAAC;IAE/C,MAAMU,UAAU,GAAGC,aAAa,CAACP,KAAK,CAAC;IAEvC,IAAIM,UAAU,CAACJ,MAAM,GAAG,CAAC,EAAE;MACzBN,KAAK,CAAE,2CAA0C,CAAC;MAClD,OAAO,EAAE;IACX;IAEA,MAAMY,UAAU,GAAG,IAAAC,+BAAS,EAACH,UAAU,EAAE,kBAAkB,CAAC;IAE5D,OAAOE,UAAU;IAEjB,SAASD,aAAaA,CAACP,KAAK,EAAE;MAC5BJ,KAAK,CAAE,qCAAoC,CAAC;;MAE5C;MACA,MAAMU,UAAU,GAAGN,KAAK,CAACU,GAAG,CAACC,WAAW,CAAC,CAACC,MAAM,CAACC,WAAW,IAAIA,WAAW,CAAC;MAC5E,OAAOP,UAAU;MAEjB,SAASK,WAAWA,CAACG,KAAK,EAAE;QAC1BlB,KAAK,CAAE,6BAA4B,CAAC;QAEpC,OAAO,IAAAmB,6CAA8B,EAACD,KAAK,CAAC,GAAGE,eAAe,CAACF,KAAK,CAAC,GAAG,EAAE;QAE1E,SAASE,eAAeA,CAACF,KAAK,EAAE;UAC9BlB,KAAK,CAAE,8BAA6B,CAAC;UACrC,MAAM,CAACqB,GAAG,CAAC,GAAG,IAAAC,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAC3C,MAAM,CAACK,GAAG,CAAC,GAAG,IAAAD,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAE3C,MAAMM,UAAU,GAAGC,kBAAkB,CAACC,yBAAyB,CAACL,GAAG,CAAC,CAAC;UACrE,MAAMM,UAAU,GAAGD,yBAAyB,CAACH,GAAG,CAAC;UAEjDrB,SAAS,CAAE,GAAEK,IAAI,CAACC,SAAS,CAACa,GAAG,CAAE,MAAKd,IAAI,CAACC,SAAS,CAACe,GAAG,CAAE,EAAC,CAAC;UAC5D,OAAOC,UAAU,CAACI,MAAM,CAACD,UAAU,CAAC;QACtC;QAEA,SAASF,kBAAkBA,CAACI,aAAa,EAAE;UACzC,MAAMC,iBAAiB,GAAI,gDAAiD;UAC5E,MAAMC,eAAe,GAAG,IAAAC,iCAAkB,EAACH,aAAa,CAAC,GAAGI,MAAM,CAACJ,aAAa,CAAC,CAACK,OAAO,CAACJ,iBAAiB,EAAE,OAAO,CAAC,GAAG,EAAE;UAC1H5B,SAAS,CAAE,cAAa2B,aAAc,OAAME,eAAgB,EAAC,CAAC;UAC9D,OAAOA,eAAe;QACxB;QAEA,SAASL,yBAAyBA,CAACG,aAAa,EAAE;UAChD3B,SAAS,CAAE,eAAc2B,aAAc,EAAC,CAAC;UACzC,MAAMM,kBAAkB,GAAI,OAAQ;UACpC,OAAO,IAAAH,iCAAkB,EAACH,aAAa,CAAC,GAAGI,MAAM,CAACJ,aAAa,CAAC,CAACK,OAAO,CAACC,kBAAkB,EAAE,EAAE,CAAC,GAAG,EAAE;QACvG;MAEF;IACF;EACF;AACF;AAEO,SAASC,aAAaA,CAACrC,MAAM,EAAE;EACpC;;EAEA,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,wEAAwE,CAAC;EACzG,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EACtCH,KAAK,CAAE,iCAAgC,CAAC;;EAExC;EACA;EACA;EACA,MAAMqC,UAAU,GAAG,IAAAC,gCAAiB,EAACvC,MAAM,CAAC;EAE5CG,SAAS,CAAE,uBAAsBmC,UAAU,CAAC/B,MAAO,MAAKC,IAAI,CAACC,SAAS,CAAC6B,UAAU,CAAE,EAAC,CAAC;EAErF,IAAIA,UAAU,CAAC/B,MAAM,GAAG,CAAC,EAAE;IACzBN,KAAK,CAAE,2CAA0C,CAAC;IAClD,OAAO,EAAE;EACX;EAEA,OAAO,IAAAa,+BAAS,EAACwB,UAAU,EAAE,mBAAmB,CAAC;AACnD;;AAGA;AACA;AACO,SAASE,iBAAiBA,CAACxC,MAAM,EAAE;EACxC,MAAMyC,EAAE,GAAGC,SAAS,CAAC,CAAC;EACtB,OAAO,IAAAT,iCAAkB,EAACQ,EAAE,CAAC,GAAG,CAAE,uBAAsBA,EAAG,EAAC,CAAC,GAAG,EAAE;EAElE,SAASC,SAASA,CAAA,EAAG;IACnB,MAAM,CAACvB,KAAK,CAAC,GAAGnB,MAAM,CAACM,GAAG,CAAC,QAAQ,CAAC;IAEpC,IAAIa,KAAK,EAAE;MACT,MAAM;QAACwB;MAAK,CAAC,GAAGxB,KAAK,CAACyB,SAAS,CAACC,IAAI,CAAC,CAAC;QAACC;MAAI,CAAC,KAAKA,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;MAEpE,IAAI,IAAAb,iCAAkB,EAACU,KAAK,CAAC,IAAK,kBAAkB,CAAEI,IAAI,CAACb,MAAM,CAACS,KAAK,CAAC,CAAC,EAAE;QACzE,OAAOT,MAAM,CAACS,KAAK,CAAC,CAACR,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;MACtD;MAEA,IAAI,IAAAF,iCAAkB,EAACU,KAAK,CAAC,IAAK,aAAa,CAAEI,IAAI,CAACb,MAAM,CAACS,KAAK,CAAC,CAAC,EAAE;QACpE,OAAOT,MAAM,CAACS,KAAK,CAAC,CAACR,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC;MACjD;MAEA,OAAO,KAAK;IACd;IACA,OAAO,KAAK;EACd;AACF;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEO,SAASa,QAAQA,CAAChD,MAAM,EAAE;EAC/B;EACA,OAAOiD,uBAAuB,CAAC;IAACjD,MAAM;IAAEkD,eAAe,EAAE;EAAC,CAAC,CAAC;AAC9D;AAEO,SAASC,cAAcA,CAACnD,MAAM,EAAE;EACrC;EACA;EACA,OAAOiD,uBAAuB,CAAC;IAACjD,MAAM;IAAEkD,eAAe,EAAE;EAAG,CAAC,CAAC;AAChE;AAEO,SAASD,uBAAuBA,CAAC;EAACjD,MAAM;EAAEkD;AAAe,CAAC,EAAE;EACjE,MAAME,KAAK,GAAGC,QAAQ,CAAC,CAAC;EACxB,MAAMC,iBAAiB,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;EAErD,IAAI,IAAArB,iCAAkB,EAACmB,KAAK,CAAC,EAAE;IAC7B,MAAMG,SAAS,GAAGrB,MAAM,CAACkB,KAAK,CAAC,CAC5BjB,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpBqB,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;;IAET;IACA,MAAME,aAAa,GAAGJ,iBAAiB,CAACK,IAAI,CAACC,IAAI,IAAIL,SAAS,CAACM,WAAW,CAAC,CAAC,CAACC,UAAU,CAACF,IAAI,CAAC,CAAC;IAC9F;IACA;IACA,IAAIL,SAAS,CAAChD,MAAM,IAAI2C,eAAe,EAAE;MACvC,OAAO,CAAE,aAAYQ,aAAa,GAAG,EAAE,GAAG,GAAI,GAAEH,SAAU,IAAG,CAAC;IAChE;IACA,MAAMQ,cAAc,GAAGR,SAAS,CAAChD,MAAM,IAAI,CAAC;;IAE5C;IACA,MAAMyD,KAAK,GAAI,aAAYN,aAAa,IAAI,CAACK,cAAc,GAAG,EAAE,GAAG,GAAI,GAAER,SAAU,GAAEQ,cAAc,GAAG,GAAG,GAAG,EAAG,GAAE;IAEjH,OAAOE,kBAAkB,CAAC;MAACD,KAAK;MAAED;IAAc,CAAC,CAAC;EACpD;EAEA,OAAO,EAAE;EAET,SAASE,kBAAkBA,CAAC;IAACD,KAAK;IAAED,cAAc,GAAG;EAAK,CAAC,EAAE;IAC3D,MAAM,CAACG,WAAW,CAAC,GAAGC,UAAU,CAACnE,MAAM,CAAC;IACxC,IAAIkE,WAAW,KAAKE,SAAS,EAAE;MAC7B,OAAO,CAAE,GAAEF,WAAY,QAAOF,KAAM,EAAC,CAAC;IACxC;IACA,OAAOK,oBAAoB,CAAC;MAACL,KAAK;MAAED;IAAc,CAAC,CAAC;IACpD;EACF;;EAEA,SAASM,oBAAoBA,CAAC;IAACL,KAAK;IAAED,cAAc,GAAG;EAAK,CAAC,EAAE;IAC7D,MAAM,CAACO,cAAc,CAAC,GAAGC,aAAa,CAACvE,MAAM,CAAC;IAC9C,IAAIsE,cAAc,KAAKF,SAAS,EAAE;MAChC,OAAO,CAAE,GAAEE,cAAe,QAAON,KAAM,EAAC,CAAC;IAC3C;IACA,IAAID,cAAc,EAAE;MAClB,OAAO,CAAE,GAAEC,KAAM,EAAC,CAAC;IACrB;IACA,OAAO,EAAE;EACX;EAEA,SAASX,QAAQA,CAAA,EAAG;IAClB,MAAM,CAAClC,KAAK,CAAC,GAAGnB,MAAM,CAACM,GAAG,CAAC,QAAQ,CAAC;IAEpC,IAAIa,KAAK,EAAE;MACT,MAAMqD,WAAW,GAAGrD,KAAK,CAACyB;MACxB;MAAA,CACC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC2B,QAAQ,CAAC3B,IAAI,CAAC;MAC7C;MAAA,CACC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC+B,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOF,WAAW;IACpB;IACA,OAAO,KAAK;EACd;AACF;AAEO,SAASL,UAAUA,CAACnE,MAAM,EAAE;EACjC,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,qEAAqE,CAAC;EACtG,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EACtCH,KAAK,CAAE,qCAAoC,CAAC;EAC5C;;EAEA,MAAM0E,MAAM,GAAGC,SAAS,CAAC5E,MAAM,CAAC;EAChC,MAAMsD,iBAAiB,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;EAGrD,IAAI,IAAArB,iCAAkB,EAAC0C,MAAM,CAAC,EAAE;IAC9B,MAAMpB,SAAS,GAAGrB,MAAM,CAACyC,MAAM,CAAC,CAC7BxC,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpBqB,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;;IAET;IACA,MAAME,aAAa,GAAGJ,iBAAiB,CAACK,IAAI,CAACC,IAAI,IAAIL,SAAS,CAACM,WAAW,CAAC,CAAC,CAACC,UAAU,CAACF,IAAI,CAAC,CAAC;IAC9F;IACAzD,SAAS,CAAE,kBAAiBoD,SAAU,EAAC,CAAC;IACxC,IAAIA,SAAS,CAAChD,MAAM,IAAI,CAAC,EAAE;MACzB,OAAO,CAAE,cAAamD,aAAa,GAAG,EAAE,GAAG,GAAI,GAAEH,SAAU,IAAG,CAAC;IACjE;IACA,OAAO,EAAE;EACX;EAEA,OAAO,EAAE;EAET,SAASqB,SAASA,CAAC5E,MAAM,EAAE;IACzB;IACA;IACA,MAAM,CAACmB,KAAK,CAAC,GAAGnB,MAAM,CAACM,GAAG,CAAC,wCAAwC,CAAC;IACpE;;IAEA,IAAIa,KAAK,EAAE;MACT,MAAM0D,YAAY,GAAG1D,KAAK,CAACyB,SAAS,CACjC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC2B,QAAQ,CAAC3B,IAAI,CAAC,CAAC,CACxC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC+B,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOG,YAAY;IACrB;IACA,OAAO,KAAK;EACd;AACF;AAEO,SAASN,aAAaA,CAACvE,MAAM,EAAE;EACpC,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,wEAAwE,CAAC;EACzG,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EACtCH,KAAK,CAAE,wCAAuC,CAAC;EAC/C;;EAEA,MAAM6E,SAAS,GAAGC,YAAY,CAAC/E,MAAM,CAAC;EACtC,IAAI,IAAAiC,iCAAkB,EAAC6C,SAAS,CAAC,EAAE;IACjC,MAAMvB,SAAS,GAAGrB,MAAM,CAAC4C,SAAS,CAAC,CAChC3C,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpBqB,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;IAETrD,SAAS,CAAE,qBAAoBoD,SAAU,EAAC,CAAC;IAC3C;IACA,OAAO,CAAE,iBAAgBA,SAAU,GAAE,CAAC;EACxC;EAEA,OAAO,EAAE;EAET,SAASwB,YAAYA,CAAC/E,MAAM,EAAE;IAC5B;IACA,MAAM,CAACmB,KAAK,CAAC,GAAGnB,MAAM,CAACM,GAAG,CAAC,oBAAoB,CAAC;IAChD;;IAEA,IAAIa,KAAK,EAAE;MACT,MAAM6D,eAAe,GAAG7D,KAAK,CAACyB,SAAS,CACpC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC2B,QAAQ,CAAC3B,IAAI,CAAC,CAAC,CACxC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC+B,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOM,eAAe;IACxB;IACA,OAAO,KAAK;EACd;AACF;AAGO,SAASC,sBAAsBA,CAACjF,MAAM,EAAE;EAE7C,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,iFAAiF,CAAC;EAClH,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EACtCH,KAAK,CAAE,2CAA0C,CAAC;;EAElD;;EAEA,MAAMiF,MAAM,GAAGlF,MAAM,CAACM,GAAG,CAAC,wBAAwB,CAAC;EACnD,MAAM6E,WAAW,GAAG,EAAE,CAACtD,MAAM,CAAC,GAAGqD,MAAM,CAACnE,GAAG,CAACqE,aAAa,CAAC,CAAC;EAC3D,MAAMC,iBAAiB,GAAG,CAAC,GAAG,IAAIC,GAAG,CAACH,WAAW,CAAC,CAAC;EAEnDhF,SAAS,CAAE,+BAA8BK,IAAI,CAACC,SAAS,CAACyE,MAAM,CAAE,EAAC,CAAC;EAClE/E,SAAS,CAAE,gBAAegF,WAAW,CAAC5E,MAAO,MAAKC,IAAI,CAACC,SAAS,CAAC0E,WAAW,CAAE,EAAC,CAAC;EAChFhF,SAAS,CAAE,uBAAsBkF,iBAAiB,CAAC9E,MAAO,MAAKC,IAAI,CAACC,SAAS,CAAC4E,iBAAiB,CAAE,EAAC,CAAC;EAEnG,IAAIA,iBAAiB,CAAC9E,MAAM,GAAG,CAAC,EAAE;IAChCN,KAAK,CAAE,2CAA0C,CAAC;IAClD,OAAO,EAAE;EACX;EAEA,OAAO,IAAAa,+BAAS,EAACuE,iBAAiB,EAAE,eAAe,CAAC;EAEpD,SAASD,aAAaA,CAAC;IAACG,GAAG;IAAE3C;EAAS,CAAC,EAAE;IACvC,MAAM4C,cAAc,GAAI,kBAAmB;IAC3C,MAAMC,aAAa,GAAI,mBAAoB;IAE3C,IAAIF,GAAG,KAAK,KAAK,EAAE;MACjB,OAAO3C,SAAS,CACb3B,MAAM,CAACyE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAACjB,QAAQ,CAACiB,GAAG,CAAC5C,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAACyD,GAAG,CAAC/C,KAAK,CAAC,IAAI6C,cAAc,CAACzC,IAAI,CAACb,MAAM,CAACwD,GAAG,CAAC/C,KAAK,CAAC,CAAC,CAAC,CAC5H5B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;IACpC;IAEA,IAAI4C,GAAG,KAAK,KAAK,EAAE;MACjB,OAAO3C,SAAS,CACb3B,MAAM,CAACyE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAACjB,QAAQ,CAACiB,GAAG,CAAC5C,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAACyD,GAAG,CAAC/C,KAAK,CAAC,IAAI6C,cAAc,CAACzC,IAAI,CAACb,MAAM,CAACwD,GAAG,CAAC/C,KAAK,CAAC,CAAC,CAAC,CACvH5B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;IACpC;IAEA,OAAOC,SAAS,CACb3B,MAAM,CAACyE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAACjB,QAAQ,CAACiB,GAAG,CAAC5C,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAACyD,GAAG,CAAC/C,KAAK,CAAC,IAAI8C,aAAa,CAAC1C,IAAI,CAACb,MAAM,CAACwD,GAAG,CAAC/C,KAAK,CAAC,CAAC,CAAC,CACtH5B,GAAG,CAAC,CAAC;MAAC4B;IAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;EACpC;AACF"}
+{"version":3,"file":"bib.js","names":["_debug","_interopRequireDefault","require","_candidateSearchUtils","_matchingUtils","obj","__esModule","default","bibSourceIds","record","debug","createDebugLogger","debugData","extend","fSids","get","length","JSON","stringify","toSidQueries","sidStrings","getSidStrings","sidQueries","toQueries","map","toSidString","filter","nonEmptySid","field","validateSidFieldSubfieldCounts","createSidString","sfC","getSubfieldValues","sfB","cleanedSfC","removeSourcePrefix","normalizeSidSubfieldValue","cleanedSfB","concat","subfieldValue","sourcePrefixRegex","normalizedValue","testStringOrNumber","String","replace","normalizeAwayRegex","bibMelindaIds","melindaIds","getMelindaIdsF035","bibHostComponents","id","getHostId","value","subfields","find","code","test","bibTitle","title","getTitle","booleanStartWords","formatted","trim","slice","useWordSearch","some","word","toLowerCase","startsWith","addAuthorsToSearch","titleQuery","authorQuery","bibAuthors","undefined","addPublisherToSearch","query","publisherQuery","bibPublishers","titleString","includes","join","author","getAuthor","authorString","publisher","getPublisher","publisherString","bibStandardIdentifiers","fields","identifiers","toIdentifiers","uniqueIdentifiers","Set","tag","issnIsbnReqExp","otherIdReqExp","sub"],"sources":["../../../src/candidate-search/query-list/bib.js"],"sourcesContent":["\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-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\nimport createDebugLogger from 'debug';\nimport {toQueries} from '../candidate-search-utils';\nimport {getMelindaIdsF035, validateSidFieldSubfieldCounts, getSubfieldValues, testStringOrNumber} from '../../matching-utils';\n\n\nexport function bibSourceIds(record) {\n\n  /* Melinda's SRU-index melinda.sourceid includes source IDs from SID fields in Melinda records\n     SID-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     SID__ $c /10024/508126 $ REPO_THESEUS\n\n    In melinda.sourceid -index case is kept, sourceprefixes in brackets and hyphens are normalized away:\n    Note: slashes are not normalized away, but a SRU-search-string including slashes needs to be quoted\n\n    1234567helka\n    1077305sata\n    VER999999FIKV\n    /10024/508126REPO_THESEUS\n\n    Note: 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\n   */\n\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:source-ids');\n  const debugData = debug.extend('data');\n  //const debugInfo = debug.extend('info');\n\n  debug(`Creating queries for sourceid's`);\n\n  const fSids = record.get('SID');\n  debugData(`SID-fields (${fSids.length}): ${JSON.stringify(fSids)}`);\n\n  return fSids.length > 0 ? toSidQueries(fSids) : [];\n\n  function toSidQueries(fSids) {\n    debug(`Creating actual queries for sourceid's`);\n\n    const sidStrings = getSidStrings(fSids);\n\n    if (sidStrings.length < 1) {\n      debug(`No identifiers found, no queries created.`);\n      return [];\n    }\n\n    const sidQueries = toQueries(sidStrings, 'melinda.sourceid');\n\n    return sidQueries;\n\n    function getSidStrings(fSids) {\n      debug(`Getting Sid strings from SID fields`);\n\n      // Map SID fields to valid sidStrings, filter out empty strings\n      const sidStrings = fSids.map(toSidString).filter(nonEmptySid => nonEmptySid);\n      return sidStrings;\n\n      function toSidString(field) {\n        debug(`Getting string from a field`);\n\n        return validateSidFieldSubfieldCounts(field) ? createSidString(field) : '';\n\n        function createSidString(field) {\n          debug(`Creating string from a field`);\n          const [sfC] = getSubfieldValues(field, 'c');\n          const [sfB] = getSubfieldValues(field, 'b');\n\n          const cleanedSfC = removeSourcePrefix(normalizeSidSubfieldValue(sfC));\n          const cleanedSfB = normalizeSidSubfieldValue(sfB);\n\n          debugData(`${JSON.stringify(sfC)} + ${JSON.stringify(sfB)}`);\n          return cleanedSfC.concat(cleanedSfB);\n        }\n\n        function removeSourcePrefix(subfieldValue) {\n          const sourcePrefixRegex = (/^(?<sourcePrefix>\\([A-Za-z0-9-]+\\))(?<id>.+)$/u);\n          const normalizedValue = testStringOrNumber(subfieldValue) ? String(subfieldValue).replace(sourcePrefixRegex, '$<id>') : '';\n          debugData(`Normalized ${subfieldValue} to ${normalizedValue}`);\n          return normalizedValue;\n        }\n\n        function normalizeSidSubfieldValue(subfieldValue) {\n          debugData(`Normalizing ${subfieldValue}`);\n          const normalizeAwayRegex = (/[- ]/u);\n          return testStringOrNumber(subfieldValue) ? String(subfieldValue).replace(normalizeAwayRegex, '') : '';\n        }\n\n      }\n    }\n  }\n}\n\nexport function bibMelindaIds(record) {\n  // Melinda's SRU-index melinda.melindaid includes f001 controlnumbers and old Melinda-IDs from f035z's for all non-deleted Melinda-records\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibMelindaIds');\n  const debugData = debug.extend('data');\n  debug(`Creating queries for MelindaIds`);\n\n  // Note: Melinda-ID's for search queries are created just from records f035a's and f035z's\n  // Both (FI-MELINDA)- and FCC-prefixed forms are found\n  // f001 controlnumber is not currently included, even if record's f003 is FI-MELINDA\n  const melindaIds = getMelindaIdsF035(record);\n\n  debugData(`Unique identifiers (${melindaIds.length}): ${JSON.stringify(melindaIds)}`);\n\n  if (melindaIds.length < 1) {\n    debug(`No identifiers found, no queries created.`);\n    return [];\n  }\n\n  return toQueries(melindaIds, 'melinda.melindaid');\n}\n\n\n// bibHostComponents returns host id from the first subfield $w of first field f773, see test-fixtures 04 and 05\n// bibHostComponents should search all 773 $ws for possible host id, but what should it do in case of multiple host ids?\nexport function bibHostComponents(record) {\n  const id = getHostId();\n  return testStringOrNumber(id) ? [`melinda.partsofhost=${id}`] : [];\n\n  function getHostId() {\n    const [field] = record.get(/^773$/u);\n\n    if (field) {\n      const {value} = field.subfields.find(({code}) => code === 'w') || {};\n\n      if (testStringOrNumber(value) && (/^\\(FI-MELINDA\\)/u).test(String(value))) {\n        return String(value).replace(/^\\(FI-MELINDA\\)/u, '');\n      }\n\n      if (testStringOrNumber(value) && (/^\\(FIN01\\)/u).test(String(value))) {\n        return String(value).replace(/^\\(FIN01\\)/u, '');\n      }\n\n      return false;\n    }\n    return false;\n  }\n}\n\n// SRU search dc.title with a search phrase starting with ^ maps currently in Melinda to\n// (probably) to *headings* index TIT\n// - Aleph cannot currently handle headings searches starting with a boolean - in these cases use word search\n\n// Headings index TIT drops articles etc. from the start of the title according to the filing indicator\n// Currently filing indicator is not implemented - if the title starts with an article and the Melinda\n// record is correctly catalogued using a filing indicator -> dc.title search won't match\n\nexport function bibTitle(record) {\n  const title = getTitle();\n  const booleanStartWords = ['and', 'or', 'nor', 'not'];\n\n  if (testStringOrNumber(title)) {\n    const formatted = String(title)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    // use word search for titles starting with a boolean\n    const useWordSearch = booleanStartWords.some(word => formatted.toLowerCase().startsWith(word));\n    // Prevent too many matches by having a minimum length\n    // Note that currently this fails matching if there are no matches from previous matchers\n    if (formatted.length >= 5) {\n      return [`dc.title=\"${useWordSearch ? '' : '^'}${formatted}*\"`];\n    }\n    // use word search without ending * also in combination searches to avoid SRU-server crashes [MRA-189]\n    return addAuthorsToSearch(`dc.title=\"${formatted}\"`);\n  }\n\n  return [];\n\n  function addAuthorsToSearch(titleQuery) {\n    const [authorQuery] = bibAuthors(record);\n    if (authorQuery !== undefined) {\n      return [`${authorQuery} AND ${titleQuery}`];\n    }\n    return addPublisherToSearch(titleQuery);\n    //return [];\n  }\n\n  function addPublisherToSearch(query) {\n    const [publisherQuery] = bibPublishers(record);\n    if (publisherQuery !== undefined) {\n      return [`${publisherQuery} AND ${query}`];\n    }\n    return [];\n  }\n\n  function getTitle() {\n    const [field] = record.get(/^245$/u);\n\n    if (field) {\n      const titleString = field.subfields\n        //.filter(({code}) => ['a', 'b', 'n', 'p'].includes(code))\n        .filter(({code}) => ['a', 'b'].includes(code))\n        //.filter(({code}) => ['a'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return titleString;\n    }\n    return false;\n  }\n}\n\nexport function bibAuthors(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibAuthors');\n  const debugData = debug.extend('data');\n  debug(`Creating query for the first author`);\n  //debugData(record);\n\n  const author = getAuthor(record);\n  const booleanStartWords = ['and', 'or', 'nor', 'not'];\n\n\n  if (testStringOrNumber(author)) {\n    const formatted = String(author)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    // use word search for authors starting with a boolean\n    const useWordSearch = booleanStartWords.some(word => formatted.toLowerCase().startsWith(word));\n    // Prevent too many matches by having a minimum length\n    debugData(`Author string: ${formatted}`);\n    if (formatted.length >= 5) {\n      return [`dc.author=\"${useWordSearch ? '' : '^'}${formatted}*\"`];\n    }\n    //if (formatted) {\n    //  return [`dc.author=\"${formatted}\"`];\n    //}\n    return [];\n  }\n\n  return [];\n\n  function getAuthor(record) {\n    //debugData(record);\n    // eslint-disable-next-line prefer-named-capture-group\n    const [field] = record.get(/^(100)|(110)|(111)|(700)|(710)|(711)$/u);\n    //debugData(field);\n\n    if (field) {\n      const authorString = field.subfields\n        .filter(({code}) => ['a'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return authorString;\n    }\n    return false;\n  }\n}\n\nexport function bibPublishers(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibPublishers');\n  const debugData = debug.extend('data');\n  debug(`Creating query for the first publisher`);\n  //debugData(record);\n\n  const publisher = getPublisher(record);\n  if (testStringOrNumber(publisher)) {\n    const formatted = String(publisher)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    debugData(`Publisher string: ${formatted}`);\n    // use non-wildcard word search from dc.publisher\n    return [`dc.publisher=\"${formatted}\"`];\n  }\n\n  return [];\n\n  function getPublisher(record) {\n    //debugData(record);\n    const [field] = record.get(/^(?:260)|(?:264)$/u);\n    //debugData(field);\n\n    if (field) {\n      const publisherString = field.subfields\n        .filter(({code}) => ['b'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return publisherString;\n    }\n    return false;\n  }\n}\n\n\nexport function bibStandardIdentifiers(record) {\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibStandardIdentifiers');\n  const debugData = debug.extend('data');\n  debug(`Creating queries for standard identifiers`);\n\n  // DEVELOP: should we query also f015 and f028?\n\n  const fields = record.get(/^(?<def>020|022|024)$/u);\n  const identifiers = [].concat(...fields.map(toIdentifiers));\n  const uniqueIdentifiers = [...new Set(identifiers)];\n\n  debugData(`Standard identifier fields: ${JSON.stringify(fields)}`);\n  debugData(`Identifiers (${identifiers.length}): ${JSON.stringify(identifiers)}`);\n  debugData(`Unique identifiers (${uniqueIdentifiers.length}): ${JSON.stringify(uniqueIdentifiers)}`);\n\n  if (uniqueIdentifiers.length < 1) {\n    debug(`No identifiers found, no queries created.`);\n    return [];\n  }\n\n  return toQueries(uniqueIdentifiers, 'dc.identifier');\n\n  function toIdentifiers({tag, subfields}) {\n    const issnIsbnReqExp = (/^[A-Za-z0-9-]+$/u);\n    const otherIdReqExp = (/^[A-Za-z0-9-:]+$/u);\n\n    if (tag === '022') {\n      return subfields\n        .filter(sub => ['a', 'z', 'y'].includes(sub.code) && testStringOrNumber(sub.value) && issnIsbnReqExp.test(String(sub.value)))\n        .map(({value}) => String(value));\n    }\n\n    if (tag === '020') {\n      return subfields\n        .filter(sub => ['a', 'z'].includes(sub.code) && testStringOrNumber(sub.value) && issnIsbnReqExp.test(String(sub.value)))\n        .map(({value}) => String(value));\n    }\n\n    return subfields\n      .filter(sub => ['a', 'z'].includes(sub.code) && testStringOrNumber(sub.value) && otherIdReqExp.test(String(sub.value)))\n      .map(({value}) => String(value));\n  }\n}\n"],"mappings":";;;;;;;;;;;;AA4BA,IAAAA,MAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,qBAAA,GAAAD,OAAA;AACA,IAAAE,cAAA,GAAAF,OAAA;AAA8H,SAAAD,uBAAAI,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AA7B9H;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;;AAMO,SAASG,YAAYA,CAACC,MAAM,EAAE;EAEnC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;EAQE,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,qEAAqE,CAAC;EACtG,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EACtC;;EAEAH,KAAK,CAAE,iCAAgC,CAAC;EAExC,MAAMI,KAAK,GAAGL,MAAM,CAACM,GAAG,CAAC,KAAK,CAAC;EAC/BH,SAAS,CAAE,eAAcE,KAAK,CAACE,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACJ,KAAK,CAAE,EAAC,CAAC;EAEnE,OAAOA,KAAK,CAACE,MAAM,GAAG,CAAC,GAAGG,YAAY,CAACL,KAAK,CAAC,GAAG,EAAE;EAElD,SAASK,YAAYA,CAACL,KAAK,EAAE;IAC3BJ,KAAK,CAAE,wCAAuC,CAAC;IAE/C,MAAMU,UAAU,GAAGC,aAAa,CAACP,KAAK,CAAC;IAEvC,IAAIM,UAAU,CAACJ,MAAM,GAAG,CAAC,EAAE;MACzBN,KAAK,CAAE,2CAA0C,CAAC;MAClD,OAAO,EAAE;IACX;IAEA,MAAMY,UAAU,GAAG,IAAAC,+BAAS,EAACH,UAAU,EAAE,kBAAkB,CAAC;IAE5D,OAAOE,UAAU;IAEjB,SAASD,aAAaA,CAACP,KAAK,EAAE;MAC5BJ,KAAK,CAAE,qCAAoC,CAAC;;MAE5C;MACA,MAAMU,UAAU,GAAGN,KAAK,CAACU,GAAG,CAACC,WAAW,CAAC,CAACC,MAAM,CAACC,WAAW,IAAIA,WAAW,CAAC;MAC5E,OAAOP,UAAU;MAEjB,SAASK,WAAWA,CAACG,KAAK,EAAE;QAC1BlB,KAAK,CAAE,6BAA4B,CAAC;QAEpC,OAAO,IAAAmB,6CAA8B,EAACD,KAAK,CAAC,GAAGE,eAAe,CAACF,KAAK,CAAC,GAAG,EAAE;QAE1E,SAASE,eAAeA,CAACF,KAAK,EAAE;UAC9BlB,KAAK,CAAE,8BAA6B,CAAC;UACrC,MAAM,CAACqB,GAAG,CAAC,GAAG,IAAAC,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAC3C,MAAM,CAACK,GAAG,CAAC,GAAG,IAAAD,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAE3C,MAAMM,UAAU,GAAGC,kBAAkB,CAACC,yBAAyB,CAACL,GAAG,CAAC,CAAC;UACrE,MAAMM,UAAU,GAAGD,yBAAyB,CAACH,GAAG,CAAC;UAEjDrB,SAAS,CAAE,GAAEK,IAAI,CAACC,SAAS,CAACa,GAAG,CAAE,MAAKd,IAAI,CAACC,SAAS,CAACe,GAAG,CAAE,EAAC,CAAC;UAC5D,OAAOC,UAAU,CAACI,MAAM,CAACD,UAAU,CAAC;QACtC;QAEA,SAASF,kBAAkBA,CAACI,aAAa,EAAE;UACzC,MAAMC,iBAAiB,GAAI,gDAAiD;UAC5E,MAAMC,eAAe,GAAG,IAAAC,iCAAkB,EAACH,aAAa,CAAC,GAAGI,MAAM,CAACJ,aAAa,CAAC,CAACK,OAAO,CAACJ,iBAAiB,EAAE,OAAO,CAAC,GAAG,EAAE;UAC1H5B,SAAS,CAAE,cAAa2B,aAAc,OAAME,eAAgB,EAAC,CAAC;UAC9D,OAAOA,eAAe;QACxB;QAEA,SAASL,yBAAyBA,CAACG,aAAa,EAAE;UAChD3B,SAAS,CAAE,eAAc2B,aAAc,EAAC,CAAC;UACzC,MAAMM,kBAAkB,GAAI,OAAQ;UACpC,OAAO,IAAAH,iCAAkB,EAACH,aAAa,CAAC,GAAGI,MAAM,CAACJ,aAAa,CAAC,CAACK,OAAO,CAACC,kBAAkB,EAAE,EAAE,CAAC,GAAG,EAAE;QACvG;MAEF;IACF;EACF;AACF;AAEO,SAASC,aAAaA,CAACrC,MAAM,EAAE;EACpC;;EAEA,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,wEAAwE,CAAC;EACzG,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EACtCH,KAAK,CAAE,iCAAgC,CAAC;;EAExC;EACA;EACA;EACA,MAAMqC,UAAU,GAAG,IAAAC,gCAAiB,EAACvC,MAAM,CAAC;EAE5CG,SAAS,CAAE,uBAAsBmC,UAAU,CAAC/B,MAAO,MAAKC,IAAI,CAACC,SAAS,CAAC6B,UAAU,CAAE,EAAC,CAAC;EAErF,IAAIA,UAAU,CAAC/B,MAAM,GAAG,CAAC,EAAE;IACzBN,KAAK,CAAE,2CAA0C,CAAC;IAClD,OAAO,EAAE;EACX;EAEA,OAAO,IAAAa,+BAAS,EAACwB,UAAU,EAAE,mBAAmB,CAAC;AACnD;;AAGA;AACA;AACO,SAASE,iBAAiBA,CAACxC,MAAM,EAAE;EACxC,MAAMyC,EAAE,GAAGC,SAAS,CAAC,CAAC;EACtB,OAAO,IAAAT,iCAAkB,EAACQ,EAAE,CAAC,GAAG,CAAE,uBAAsBA,EAAG,EAAC,CAAC,GAAG,EAAE;EAElE,SAASC,SAASA,CAAA,EAAG;IACnB,MAAM,CAACvB,KAAK,CAAC,GAAGnB,MAAM,CAACM,GAAG,CAAC,QAAQ,CAAC;IAEpC,IAAIa,KAAK,EAAE;MACT,MAAM;QAACwB;MAAK,CAAC,GAAGxB,KAAK,CAACyB,SAAS,CAACC,IAAI,CAAC,CAAC;QAACC;MAAI,CAAC,KAAKA,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;MAEpE,IAAI,IAAAb,iCAAkB,EAACU,KAAK,CAAC,IAAK,kBAAkB,CAAEI,IAAI,CAACb,MAAM,CAACS,KAAK,CAAC,CAAC,EAAE;QACzE,OAAOT,MAAM,CAACS,KAAK,CAAC,CAACR,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;MACtD;MAEA,IAAI,IAAAF,iCAAkB,EAACU,KAAK,CAAC,IAAK,aAAa,CAAEI,IAAI,CAACb,MAAM,CAACS,KAAK,CAAC,CAAC,EAAE;QACpE,OAAOT,MAAM,CAACS,KAAK,CAAC,CAACR,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC;MACjD;MAEA,OAAO,KAAK;IACd;IACA,OAAO,KAAK;EACd;AACF;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEO,SAASa,QAAQA,CAAChD,MAAM,EAAE;EAC/B,MAAMiD,KAAK,GAAGC,QAAQ,CAAC,CAAC;EACxB,MAAMC,iBAAiB,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;EAErD,IAAI,IAAAlB,iCAAkB,EAACgB,KAAK,CAAC,EAAE;IAC7B,MAAMG,SAAS,GAAGlB,MAAM,CAACe,KAAK,CAAC,CAC5Bd,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpBkB,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;;IAET;IACA,MAAME,aAAa,GAAGJ,iBAAiB,CAACK,IAAI,CAACC,IAAI,IAAIL,SAAS,CAACM,WAAW,CAAC,CAAC,CAACC,UAAU,CAACF,IAAI,CAAC,CAAC;IAC9F;IACA;IACA,IAAIL,SAAS,CAAC7C,MAAM,IAAI,CAAC,EAAE;MACzB,OAAO,CAAE,aAAYgD,aAAa,GAAG,EAAE,GAAG,GAAI,GAAEH,SAAU,IAAG,CAAC;IAChE;IACA;IACA,OAAOQ,kBAAkB,CAAE,aAAYR,SAAU,GAAE,CAAC;EACtD;EAEA,OAAO,EAAE;EAET,SAASQ,kBAAkBA,CAACC,UAAU,EAAE;IACtC,MAAM,CAACC,WAAW,CAAC,GAAGC,UAAU,CAAC/D,MAAM,CAAC;IACxC,IAAI8D,WAAW,KAAKE,SAAS,EAAE;MAC7B,OAAO,CAAE,GAAEF,WAAY,QAAOD,UAAW,EAAC,CAAC;IAC7C;IACA,OAAOI,oBAAoB,CAACJ,UAAU,CAAC;IACvC;EACF;;EAEA,SAASI,oBAAoBA,CAACC,KAAK,EAAE;IACnC,MAAM,CAACC,cAAc,CAAC,GAAGC,aAAa,CAACpE,MAAM,CAAC;IAC9C,IAAImE,cAAc,KAAKH,SAAS,EAAE;MAChC,OAAO,CAAE,GAAEG,cAAe,QAAOD,KAAM,EAAC,CAAC;IAC3C;IACA,OAAO,EAAE;EACX;EAEA,SAAShB,QAAQA,CAAA,EAAG;IAClB,MAAM,CAAC/B,KAAK,CAAC,GAAGnB,MAAM,CAACM,GAAG,CAAC,QAAQ,CAAC;IAEpC,IAAIa,KAAK,EAAE;MACT,MAAMkD,WAAW,GAAGlD,KAAK,CAACyB;MACxB;MAAA,CACC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAACwB,QAAQ,CAACxB,IAAI,CAAC;MAC7C;MAAA,CACC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC4B,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOF,WAAW;IACpB;IACA,OAAO,KAAK;EACd;AACF;AAEO,SAASN,UAAUA,CAAC/D,MAAM,EAAE;EACjC,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,qEAAqE,CAAC;EACtG,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EACtCH,KAAK,CAAE,qCAAoC,CAAC;EAC5C;;EAEA,MAAMuE,MAAM,GAAGC,SAAS,CAACzE,MAAM,CAAC;EAChC,MAAMmD,iBAAiB,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;EAGrD,IAAI,IAAAlB,iCAAkB,EAACuC,MAAM,CAAC,EAAE;IAC9B,MAAMpB,SAAS,GAAGlB,MAAM,CAACsC,MAAM,CAAC,CAC7BrC,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpBkB,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;;IAET;IACA,MAAME,aAAa,GAAGJ,iBAAiB,CAACK,IAAI,CAACC,IAAI,IAAIL,SAAS,CAACM,WAAW,CAAC,CAAC,CAACC,UAAU,CAACF,IAAI,CAAC,CAAC;IAC9F;IACAtD,SAAS,CAAE,kBAAiBiD,SAAU,EAAC,CAAC;IACxC,IAAIA,SAAS,CAAC7C,MAAM,IAAI,CAAC,EAAE;MACzB,OAAO,CAAE,cAAagD,aAAa,GAAG,EAAE,GAAG,GAAI,GAAEH,SAAU,IAAG,CAAC;IACjE;IACA;IACA;IACA;IACA,OAAO,EAAE;EACX;EAEA,OAAO,EAAE;EAET,SAASqB,SAASA,CAACzE,MAAM,EAAE;IACzB;IACA;IACA,MAAM,CAACmB,KAAK,CAAC,GAAGnB,MAAM,CAACM,GAAG,CAAC,wCAAwC,CAAC;IACpE;;IAEA,IAAIa,KAAK,EAAE;MACT,MAAMuD,YAAY,GAAGvD,KAAK,CAACyB,SAAS,CACjC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAACwB,QAAQ,CAACxB,IAAI,CAAC,CAAC,CACxC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC4B,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOG,YAAY;IACrB;IACA,OAAO,KAAK;EACd;AACF;AAEO,SAASN,aAAaA,CAACpE,MAAM,EAAE;EACpC,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,wEAAwE,CAAC;EACzG,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EACtCH,KAAK,CAAE,wCAAuC,CAAC;EAC/C;;EAEA,MAAM0E,SAAS,GAAGC,YAAY,CAAC5E,MAAM,CAAC;EACtC,IAAI,IAAAiC,iCAAkB,EAAC0C,SAAS,CAAC,EAAE;IACjC,MAAMvB,SAAS,GAAGlB,MAAM,CAACyC,SAAS,CAAC,CAChCxC,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpBkB,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;IAETlD,SAAS,CAAE,qBAAoBiD,SAAU,EAAC,CAAC;IAC3C;IACA,OAAO,CAAE,iBAAgBA,SAAU,GAAE,CAAC;EACxC;EAEA,OAAO,EAAE;EAET,SAASwB,YAAYA,CAAC5E,MAAM,EAAE;IAC5B;IACA,MAAM,CAACmB,KAAK,CAAC,GAAGnB,MAAM,CAACM,GAAG,CAAC,oBAAoB,CAAC;IAChD;;IAEA,IAAIa,KAAK,EAAE;MACT,MAAM0D,eAAe,GAAG1D,KAAK,CAACyB,SAAS,CACpC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAACwB,QAAQ,CAACxB,IAAI,CAAC,CAAC,CACxC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC4B,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOM,eAAe;IACxB;IACA,OAAO,KAAK;EACd;AACF;AAGO,SAASC,sBAAsBA,CAAC9E,MAAM,EAAE;EAE7C,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,iFAAiF,CAAC;EAClH,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EACtCH,KAAK,CAAE,2CAA0C,CAAC;;EAElD;;EAEA,MAAM8E,MAAM,GAAG/E,MAAM,CAACM,GAAG,CAAC,wBAAwB,CAAC;EACnD,MAAM0E,WAAW,GAAG,EAAE,CAACnD,MAAM,CAAC,GAAGkD,MAAM,CAAChE,GAAG,CAACkE,aAAa,CAAC,CAAC;EAC3D,MAAMC,iBAAiB,GAAG,CAAC,GAAG,IAAIC,GAAG,CAACH,WAAW,CAAC,CAAC;EAEnD7E,SAAS,CAAE,+BAA8BK,IAAI,CAACC,SAAS,CAACsE,MAAM,CAAE,EAAC,CAAC;EAClE5E,SAAS,CAAE,gBAAe6E,WAAW,CAACzE,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACuE,WAAW,CAAE,EAAC,CAAC;EAChF7E,SAAS,CAAE,uBAAsB+E,iBAAiB,CAAC3E,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACyE,iBAAiB,CAAE,EAAC,CAAC;EAEnG,IAAIA,iBAAiB,CAAC3E,MAAM,GAAG,CAAC,EAAE;IAChCN,KAAK,CAAE,2CAA0C,CAAC;IAClD,OAAO,EAAE;EACX;EAEA,OAAO,IAAAa,+BAAS,EAACoE,iBAAiB,EAAE,eAAe,CAAC;EAEpD,SAASD,aAAaA,CAAC;IAACG,GAAG;IAAExC;EAAS,CAAC,EAAE;IACvC,MAAMyC,cAAc,GAAI,kBAAmB;IAC3C,MAAMC,aAAa,GAAI,mBAAoB;IAE3C,IAAIF,GAAG,KAAK,KAAK,EAAE;MACjB,OAAOxC,SAAS,CACb3B,MAAM,CAACsE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAACjB,QAAQ,CAACiB,GAAG,CAACzC,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAACsD,GAAG,CAAC5C,KAAK,CAAC,IAAI0C,cAAc,CAACtC,IAAI,CAACb,MAAM,CAACqD,GAAG,CAAC5C,KAAK,CAAC,CAAC,CAAC,CAC5H5B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;IACpC;IAEA,IAAIyC,GAAG,KAAK,KAAK,EAAE;MACjB,OAAOxC,SAAS,CACb3B,MAAM,CAACsE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAACjB,QAAQ,CAACiB,GAAG,CAACzC,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAACsD,GAAG,CAAC5C,KAAK,CAAC,IAAI0C,cAAc,CAACtC,IAAI,CAACb,MAAM,CAACqD,GAAG,CAAC5C,KAAK,CAAC,CAAC,CAAC,CACvH5B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;IACpC;IAEA,OAAOC,SAAS,CACb3B,MAAM,CAACsE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAACjB,QAAQ,CAACiB,GAAG,CAACzC,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAACsD,GAAG,CAAC5C,KAAK,CAAC,IAAI2C,aAAa,CAACvC,IAAI,CAACb,MAAM,CAACqD,GAAG,CAAC5C,KAAK,CAAC,CAAC,CAAC,CACtH5B,GAAG,CAAC,CAAC;MAAC4B;IAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;EACpC;AACF"}

package/dist/candidate-search/query-list/bib.spec.js

@@ -5,8 +5,8 @@ var _fixura = require("@natlibfi/fixura");
 var _chai = require("chai");
 var _marcRecord = require("@natlibfi/marc-record");
 var generators = _interopRequireWildcard(require("./bib"));
-function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
-function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function (e) { return e ? t : r; })(e); }
+function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != typeof e && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
 function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
 /**
 *

package/dist/candidate-search/query-list/bib.spec.js.map

@@ -1 +1 @@
-{"version":3,"file":"bib.spec.js","names":["_fixugen","_interopRequireDefault","require","_fixura","_chai","_marcRecord","generators","_interopRequireWildcard","_getRequireWildcardCache","nodeInterop","WeakMap","cacheBabelInterop","cacheNodeInterop","obj","__esModule","default","cache","has","get","newObj","hasPropertyDescriptor","Object","defineProperty","getOwnPropertyDescriptor","key","prototype","hasOwnProperty","call","desc","set","describe","generateTests","path","__dirname","useMetadataFile","fixura","reader","READERS","JSON","callback","type","inputRecord","expectedQuery","enabled","generate","record","MarcRecord","subfieldValues","expect","to","eql"],"sources":["../../../src/candidate-search/query-list/bib.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 generators from './bib';\n\ndescribe('candidate-search/query-list/bib/', () => {\n  generateTests({\n    path: [__dirname, '..', '..', '..', 'test-fixtures', 'candidate-search', 'query-list', 'bib'],\n    useMetadataFile: true,\n    fixura: {\n      reader: READERS.JSON\n    },\n    callback: ({type, inputRecord, expectedQuery, enabled = true}) => {\n      const generate = generators[type];\n      const record = new MarcRecord(inputRecord, {subfieldValues: false});\n\n      if (!enabled) {\n        return;\n      }\n\n      expect(generate(record)).to.eql(expectedQuery);\n    }\n  });\n});\n"],"mappings":";;AA4BA,IAAAA,QAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,OAAA,GAAAD,OAAA;AACA,IAAAE,KAAA,GAAAF,OAAA;AACA,IAAAG,WAAA,GAAAH,OAAA;AACA,IAAAI,UAAA,GAAAC,uBAAA,CAAAL,OAAA;AAAoC,SAAAM,yBAAAC,WAAA,eAAAC,OAAA,kCAAAC,iBAAA,OAAAD,OAAA,QAAAE,gBAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,WAAA,WAAAA,WAAA,GAAAG,gBAAA,GAAAD,iBAAA,KAAAF,WAAA;AAAA,SAAAF,wBAAAM,GAAA,EAAAJ,WAAA,SAAAA,WAAA,IAAAI,GAAA,IAAAA,GAAA,CAAAC,UAAA,WAAAD,GAAA,QAAAA,GAAA,oBAAAA,GAAA,wBAAAA,GAAA,4BAAAE,OAAA,EAAAF,GAAA,UAAAG,KAAA,GAAAR,wBAAA,CAAAC,WAAA,OAAAO,KAAA,IAAAA,KAAA,CAAAC,GAAA,CAAAJ,GAAA,YAAAG,KAAA,CAAAE,GAAA,CAAAL,GAAA,SAAAM,MAAA,WAAAC,qBAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,GAAA,IAAAX,GAAA,QAAAW,GAAA,kBAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAd,GAAA,EAAAW,GAAA,SAAAI,IAAA,GAAAR,qBAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAV,GAAA,EAAAW,GAAA,cAAAI,IAAA,KAAAA,IAAA,CAAAV,GAAA,IAAAU,IAAA,CAAAC,GAAA,KAAAR,MAAA,CAAAC,cAAA,CAAAH,MAAA,EAAAK,GAAA,EAAAI,IAAA,YAAAT,MAAA,CAAAK,GAAA,IAAAX,GAAA,CAAAW,GAAA,SAAAL,MAAA,CAAAJ,OAAA,GAAAF,GAAA,MAAAG,KAAA,IAAAA,KAAA,CAAAa,GAAA,CAAAhB,GAAA,EAAAM,MAAA,YAAAA,MAAA;AAAA,SAAAlB,uBAAAY,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AAhCpC;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;;AAQAiB,QAAQ,CAAC,kCAAkC,EAAE,MAAM;EACjD,IAAAC,gBAAa,EAAC;IACZC,IAAI,EAAE,CAACC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,eAAe,EAAE,kBAAkB,EAAE,YAAY,EAAE,KAAK,CAAC;IAC7FC,eAAe,EAAE,IAAI;IACrBC,MAAM,EAAE;MACNC,MAAM,EAAEC,eAAO,CAACC;IAClB,CAAC;IACDC,QAAQ,EAAEA,CAAC;MAACC,IAAI;MAAEC,WAAW;MAAEC,aAAa;MAAEC,OAAO,GAAG;IAAI,CAAC,KAAK;MAChE,MAAMC,QAAQ,GAAGtC,UAAU,CAACkC,IAAI,CAAC;MACjC,MAAMK,MAAM,GAAG,IAAIC,sBAAU,CAACL,WAAW,EAAE;QAACM,cAAc,EAAE;MAAK,CAAC,CAAC;MAEnE,IAAI,CAACJ,OAAO,EAAE;QACZ;MACF;MAEA,IAAAK,YAAM,EAACJ,QAAQ,CAACC,MAAM,CAAC,CAAC,CAACI,EAAE,CAACC,GAAG,CAACR,aAAa,CAAC;IAChD;EACF,CAAC,CAAC;AACJ,CAAC,CAAC"}
+{"version":3,"file":"bib.spec.js","names":["_fixugen","_interopRequireDefault","require","_fixura","_chai","_marcRecord","generators","_interopRequireWildcard","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","prototype","hasOwnProperty","call","i","set","obj","describe","generateTests","path","__dirname","useMetadataFile","fixura","reader","READERS","JSON","callback","type","inputRecord","expectedQuery","enabled","generate","record","MarcRecord","subfieldValues","expect","to","eql"],"sources":["../../../src/candidate-search/query-list/bib.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 generators from './bib';\n\ndescribe('candidate-search/query-list/bib/', () => {\n  generateTests({\n    path: [__dirname, '..', '..', '..', 'test-fixtures', 'candidate-search', 'query-list', 'bib'],\n    useMetadataFile: true,\n    fixura: {\n      reader: READERS.JSON\n    },\n    callback: ({type, inputRecord, expectedQuery, enabled = true}) => {\n      const generate = generators[type];\n      const record = new MarcRecord(inputRecord, {subfieldValues: false});\n\n      if (!enabled) {\n        return;\n      }\n\n      expect(generate(record)).to.eql(expectedQuery);\n    }\n  });\n});\n"],"mappings":";;AA4BA,IAAAA,QAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,OAAA,GAAAD,OAAA;AACA,IAAAE,KAAA,GAAAF,OAAA;AACA,IAAAG,WAAA,GAAAH,OAAA;AACA,IAAAI,UAAA,GAAAC,uBAAA,CAAAL,OAAA;AAAoC,SAAAM,yBAAAC,CAAA,6BAAAC,OAAA,mBAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,CAAA,WAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA,KAAAF,CAAA;AAAA,SAAAF,wBAAAE,CAAA,EAAAE,CAAA,SAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA,eAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,WAAAK,OAAA,EAAAL,CAAA,QAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA,OAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA,OAAAQ,CAAA,KAAAC,SAAA,UAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,IAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAjB,CAAA,EAAAc,CAAA,SAAAI,CAAA,GAAAR,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA,UAAAI,CAAA,KAAAA,CAAA,CAAAX,GAAA,IAAAW,CAAA,CAAAC,GAAA,IAAAR,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAI,CAAA,IAAAV,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA,YAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAgB,GAAA,CAAAnB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAAA,SAAAhB,uBAAA4B,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAhB,UAAA,GAAAgB,GAAA,KAAAf,OAAA,EAAAe,GAAA;AAhCpC;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;;AAQAC,QAAQ,CAAC,kCAAkC,EAAE,MAAM;EACjD,IAAAC,gBAAa,EAAC;IACZC,IAAI,EAAE,CAACC,SAAS,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,eAAe,EAAE,kBAAkB,EAAE,YAAY,EAAE,KAAK,CAAC;IAC7FC,eAAe,EAAE,IAAI;IACrBC,MAAM,EAAE;MACNC,MAAM,EAAEC,eAAO,CAACC;IAClB,CAAC;IACDC,QAAQ,EAAEA,CAAC;MAACC,IAAI;MAAEC,WAAW;MAAEC,aAAa;MAAEC,OAAO,GAAG;IAAI,CAAC,KAAK;MAChE,MAAMC,QAAQ,GAAGtC,UAAU,CAACkC,IAAI,CAAC;MACjC,MAAMK,MAAM,GAAG,IAAIC,sBAAU,CAACL,WAAW,EAAE;QAACM,cAAc,EAAE;MAAK,CAAC,CAAC;MAEnE,IAAI,CAACJ,OAAO,EAAE;QACZ;MACF;MAEA,IAAAK,YAAM,EAACJ,QAAQ,CAACC,MAAM,CAAC,CAAC,CAACI,EAAE,CAACC,GAAG,CAACR,aAAa,CAAC;IAChD;EACF,CAAC,CAAC;AACJ,CAAC,CAAC"}

package/dist/candidate-search/query-list/index.js

@@ -5,8 +5,8 @@ Object.defineProperty(exports, "__esModule", {
 });
 exports.searchTypes = exports.default = void 0;
 var bib = _interopRequireWildcard(require("./bib"));
-function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
-function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+function _getRequireWildcardCache(e) { if ("function" != typeof WeakMap) return null; var r = new WeakMap(), t = new WeakMap(); return (_getRequireWildcardCache = function (e) { return e ? t : r; })(e); }
+function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e; if (null === e || "object" != typeof e && "function" != typeof e) return { default: e }; var t = _getRequireWildcardCache(r); if (t && t.has(e)) return t.get(e); var n = { __proto__: null }, a = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) { var i = a ? Object.getOwnPropertyDescriptor(e, u) : null; i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u]; } return n.default = e, t && t.set(e, n), n; }
 /**
 *
 * @licstart  The following is the entire license notice for the JavaScript code in this file.
@@ -35,19 +35,15 @@ function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj &&
 *
 */
 
-const searchTypes = {
+const searchTypes = exports.searchTypes = {
   bib: {
     standardIdentifiers: 'bibStandardIdentifiers',
     hostComponents: 'bibHostComponents',
     title: 'bibTitle',
-    // title ( + first author + first publisher if needed)
-    titleAuthor: 'bibTitleAuthor',
-    // title + first author (or first publisher if no author)
     melindaId: 'bibMelindaIds',
     sourceIds: 'bibSourceIds'
   }
 };
-exports.searchTypes = searchTypes;
 var _default = (record, searchSpec) => {
   const extractors = {
     ...bib