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

package/dist/candidate-search/candidate-search-utils.js

@@ -0,0 +1,55 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toQueries = toQueries;
+var _debug = _interopRequireDefault(require("debug"));
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js is distributed in the hope that it will be useful,
+* but WITHOUT ANY WARRANTY; without even the implied warranty of
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+* GNU Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+
+function toQueries(identifiers, queryString) {
+  const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:toQueries');
+  const debugData = debug.extend('data');
+  const quotedIdentifiers = identifiers.map(identifier => identifier.match(/\//u) ? `"${identifier}"` : `${identifier}`);
+
+  // Aleph supports only two queries with or -operator (This is not actually true)
+  const pairs = toPairs(quotedIdentifiers);
+  const queries = pairs.map(([a, b]) => b ? `${queryString}=${a} or ${queryString}=${b}` : `${queryString}=${a}`);
+  debugData(`Pairs (${pairs.length}): ${JSON.stringify(pairs)}`);
+  debugData(`Queries (${queries.length}): ${JSON.stringify(queries)}`);
+  return queries;
+}
+function toPairs(array) {
+  if (array.length === 0) {
+    return [];
+  }
+  return [array.slice(0, 2)].concat(toPairs(array.slice(2), 2));
+}
+//# sourceMappingURL=candidate-search-utils.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"candidate-search-utils.js","names":["toQueries","identifiers","queryString","debug","createDebugLogger","debugData","extend","quotedIdentifiers","map","identifier","match","pairs","toPairs","queries","a","b","length","JSON","stringify","array","slice","concat"],"sources":["../../src/candidate-search/candidate-search-utils.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\n\nexport function toQueries(identifiers, queryString) {\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:toQueries');\n  const debugData = debug.extend('data');\n\n  const quotedIdentifiers = identifiers.map(identifier => identifier.match(/\\//u) ? `\"${identifier}\"` : `${identifier}`);\n\n  // Aleph supports only two queries with or -operator (This is not actually true)\n  const pairs = toPairs(quotedIdentifiers);\n  const queries = pairs.map(([a, b]) => b ? `${queryString}=${a} or ${queryString}=${b}` : `${queryString}=${a}`);\n\n  debugData(`Pairs (${pairs.length}): ${JSON.stringify(pairs)}`);\n  debugData(`Queries (${queries.length}): ${JSON.stringify(queries)}`);\n\n  return queries;\n}\n\nfunction toPairs(array) {\n  if (array.length === 0) {\n    return [];\n  }\n  return [array.slice(0, 2)].concat(toPairs(array.slice(2), 2));\n}\n"],"mappings":";;;;;;AA4BA;AAAsC;AA5BtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAIO,SAASA,SAAS,CAACC,WAAW,EAAEC,WAAW,EAAE;EAElD,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,6CAA6C,CAAC;EAC9E,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EAEtC,MAAMC,iBAAiB,GAAGN,WAAW,CAACO,GAAG,CAACC,UAAU,IAAIA,UAAU,CAACC,KAAK,CAAC,KAAK,CAAC,GAAI,IAAGD,UAAW,GAAE,GAAI,GAAEA,UAAW,EAAC,CAAC;;EAEtH;EACA,MAAME,KAAK,GAAGC,OAAO,CAACL,iBAAiB,CAAC;EACxC,MAAMM,OAAO,GAAGF,KAAK,CAACH,GAAG,CAAC,CAAC,CAACM,CAAC,EAAEC,CAAC,CAAC,KAAKA,CAAC,GAAI,GAAEb,WAAY,IAAGY,CAAE,OAAMZ,WAAY,IAAGa,CAAE,EAAC,GAAI,GAAEb,WAAY,IAAGY,CAAE,EAAC,CAAC;EAE/GT,SAAS,CAAE,UAASM,KAAK,CAACK,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACP,KAAK,CAAE,EAAC,CAAC;EAC9DN,SAAS,CAAE,YAAWQ,OAAO,CAACG,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACL,OAAO,CAAE,EAAC,CAAC;EAEpE,OAAOA,OAAO;AAChB;AAEA,SAASD,OAAO,CAACO,KAAK,EAAE;EACtB,IAAIA,KAAK,CAACH,MAAM,KAAK,CAAC,EAAE;IACtB,OAAO,EAAE;EACX;EACA,OAAO,CAACG,KAAK,CAACC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAACC,MAAM,CAACT,OAAO,CAACO,KAAK,CAACC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC/D"}

package/dist/candidate-search/index.js

@@ -0,0 +1,258 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = exports.CandidateSearchError = void 0;
+Object.defineProperty(exports, "searchTypes", {
+  enumerable: true,
+  get: function () {
+    return _queryList.searchTypes;
+  }
+});
+var _debug = _interopRequireDefault(require("debug"));
+var _sruClient = _interopRequireWildcard(require("@natlibfi/sru-client"));
+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 _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js is distributed in the hope that it will be useful,
+* but WITHOUT ANY WARRANTY; without even the implied warranty of
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+* GNU Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+
+class CandidateSearchError extends Error {}
+
+// serverMaxResults : maximum size of total search result available from the server, defaults to Aleph's 20000
+
+// eslint-disable-next-line max-statements
+exports.CandidateSearchError = CandidateSearchError;
+var _default = ({
+  record,
+  searchSpec,
+  url,
+  maxCandidates,
+  maxRecordsPerRequest = 50,
+  serverMaxResult = 20000
+}) => {
+  _marcRecord.MarcRecord.setValidationOptions({
+    subfieldValues: false
+  });
+  const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:candidate-search');
+  const debugData = debug.extend('data');
+  debugData(`SearchSpec: ${JSON.stringify(searchSpec)}`);
+  debugData(`Url: ${url}`);
+  debugData(`MaxRecordsPerRequest ${maxRecordsPerRequest}`);
+  debugData(`ServerMaxResult: ${serverMaxResult}`);
+  debugData(`MaxCandidates: ${maxCandidates}`);
+
+  // Do not retrieve more candidates than defined in maxCandidates
+  const adjustedMaxRecordsPerRequest = maxRecordsPerRequest >= maxCandidates ? maxCandidates : maxRecordsPerRequest;
+  const inputRecordId = getRecordId(record);
+  const queryList = (0, _queryList.default)(record, searchSpec);
+  const client = (0, _sruClient.default)({
+    url,
+    maxRecordsPerRequest: adjustedMaxRecordsPerRequest,
+    version: '2.0',
+    retrieveAll: false
+  });
+  debug(`Searching matches for ${inputRecordId}`);
+  debug(`Generated queryList ${JSON.stringify(queryList)}`);
+
+  // if generateQueryList errored we should throw 422
+
+  if (queryList.length === 0) {
+    // eslint-disable-line functional/no-conditional-statement
+    throw new CandidateSearchError(`Generated query list contains no queries`);
+  }
+
+  // state.totalRecords : amount of candidate records available to the current query (undefined, if there was no queries left)
+  // state.query : current query (undefined if there was no queries left)
+  // state.searchCounter : sequence for current search for current query (undefined, if there we no queries left)
+  // 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)
+  // state.queriesLeft : amount of queries left
+  // state.queryCounter : sequence for current query
+  // state.maxedQueries : queries that resulted in more than serverMaxResults hits
+
+  return async ({
+    queryOffset = 0,
+    resultSetOffset = 1,
+    totalRecords = 0,
+    searchCounter = 0,
+    queryCandidateCounter = 0,
+    queryCounter = 0,
+    maxedQueries = []
+  }) => {
+    const query = queryList[queryOffset];
+    if (query) {
+      const {
+        records,
+        failures,
+        nextOffset,
+        total
+      } = await retrieveRecords();
+
+      // If resultSetOffset === 1 this is the first search for the current query
+      debugData(`ResultSetOffset: ${resultSetOffset}`);
+      const newTotalRecords = resultSetOffset === 1 ? total : totalRecords;
+      const newQueryCounter = resultSetOffset === 1 ? queryCounter + 1 : queryCounter;
+      const newSearchCounter = resultSetOffset === 1 ? 1 : searchCounter + 1;
+      const newQueryCandidateCounter = resultSetOffset === 1 ? records.length + failures.length : queryCandidateCounter + records.length + failures.length;
+      const maxedQuery = resultSetOffset === 1 ? checkMaxedQuery(query, total, serverMaxResult) : undefined;
+      const newMaxedQueries = maxedQuery ? maxedQueries.concat(maxedQuery) : maxedQueries;
+      if (typeof nextOffset === 'number') {
+        debug(`Next search will be for query ${queryOffset} ${query}, starting from record ${nextOffset}`);
+        return {
+          records,
+          failures,
+          queryOffset,
+          resultSetOffset: nextOffset,
+          queriesLeft: queryList.length - (queryOffset + 1),
+          totalRecords: newTotalRecords,
+          query,
+          searchCounter: newSearchCounter,
+          queryCandidateCounter: newQueryCandidateCounter,
+          queryCounter: newQueryCounter,
+          maxedQueries: newMaxedQueries
+        };
+      }
+      debug(`Query ${queryOffset} ${query} done.`);
+      debug(`There are (${queryList.length - (queryOffset + 1)} queries left)`);
+      return {
+        records,
+        failures,
+        queryOffset: queryOffset + 1,
+        queriesLeft: queryList.length - (queryOffset + 1),
+        totalRecords: newTotalRecords,
+        query,
+        searchCounter: newSearchCounter,
+        queryCandidateCounter: newQueryCandidateCounter,
+        queryCounter: newQueryCounter,
+        maxedQueries: newMaxedQueries
+      };
+    }
+    debug(`All ${queryList.length} queries done, there's no query for ${queryOffset}`);
+    return {
+      records: [],
+      failures: [],
+      queriesLeft: 0,
+      queryCounter,
+      maxedQueries
+    };
+    function retrieveRecords() {
+      return new Promise((resolve, reject) => {
+        const promises = [];
+        // eslint-disable-next-line functional/no-let
+        let totalRecords = 0;
+        debug(`Searching for candidates with query: ${query} (Offset ${resultSetOffset})`);
+        client.searchRetrieve(query, {
+          startRecord: resultSetOffset
+        }).on('error', err => {
+          // eslint-disable-next-line functional/no-conditional-statement
+          if (err instanceof _sruClient.SruSearchError) {
+            debug(`SRU SruSearchError for query: ${query}: ${err}`);
+            reject(new CandidateSearchError(`SRU SruSearchError for query: ${query}: ${err}`));
+          }
+          debug(`SRU error for query: ${query}: ${err}`);
+          reject(new CandidateSearchError(`SRU error for query: ${query}: ${err}`));
+        }).on('total', total => {
+          debug(`Got total: ${total}`);
+          totalRecords += total;
+        }).on('end', async nextOffset => {
+          try {
+            const recordPromises = await Promise.allSettled(promises);
+            debug(`All recordPromises: ${JSON.stringify(recordPromises)}`);
+            const filtered = recordPromises.filter(r => r.status === 'fulfilled').map(r => r.value);
+            const failures = recordPromises.filter(r => r.status === 'rejected').map(r => ({
+              status: r.reason.status,
+              payload: r.reason.payload
+            }));
+            debug(`Found ${JSON.stringify(recordPromises)} records`);
+            debug(`Found ${filtered.length} convertable candidates`);
+            debug(`Found ${failures.length} NON-convertable candidates`);
+            debug(`Converted: ${JSON.stringify(filtered)}.`);
+            debug(`Not converted: ${JSON.stringify(failures)}.`);
+            resolve({
+              nextOffset,
+              records: filtered,
+              failures,
+              total: totalRecords
+            });
+          } catch (err) {
+            debug(`Error caught on END`);
+            reject(err);
+          }
+        }).on('record', recordXML => {
+          promises.push(handleRecord()); // eslint-disable-line functional/immutable-data
+
+          async function handleRecord() {
+            try {
+              const recordMarc = await _marcRecordSerializers.MARCXML.from(recordXML, {
+                subfieldValues: false
+              });
+              const recordId = getRecordId(recordMarc);
+              return {
+                record: recordMarc,
+                id: recordId
+              };
+            } catch (err) {
+              // What should this do?
+              const idFromXML = getRecordIdFromXML(recordXML);
+              debugData(`Failed converting record: ${err.message}, id: ${idFromXML}, data: ${recordXML}`);
+              //return {message: `Failed converting record: ${err.message}`, id: idFromXML, data: recordXML};
+              throw new _melindaCommons.Error(422, {
+                message: `Failed converting record: ${err.message}`,
+                id: idFromXML || '000000000',
+                data: recordXML
+              });
+            }
+          }
+        });
+      });
+    }
+  };
+  function checkMaxedQuery(query, total, serverMaxResult) {
+    // eslint-disable-next-line functional/no-conditional-statement
+    if (total >= serverMaxResult) {
+      debug(`WARNING: Query ${query} resulted in ${total} hits which meets the serverMaxResult (${serverMaxResult}) `);
+      return query;
+    }
+  }
+  function getRecordId(record) {
+    const [field] = record.get(/^001$/u);
+    return field ? field.value : '';
+  }
+  function getRecordIdFromXML(recordXML) {
+    //<controlfield tag=\"001\">015376846</controlfield
+    debug(`Cannot yet find possible database record id from recordXML (length ${recordXML.length})`);
+    return undefined;
+  }
+};
+exports.default = _default;
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":["CandidateSearchError","Error","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","get"],"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\n// eslint-disable-next-line max-statements\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) { // eslint-disable-line functional/no-conditional-statement\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-statement\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              debug(`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 ${JSON.stringify(recordPromises)} records`);\n              debug(`Found ${filtered.length} convertable candidates`);\n              debug(`Found ${failures.length} NON-convertable candidates`);\n              debug(`Converted: ${JSON.stringify(filtered)}.`);\n              debug(`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    // eslint-disable-next-line functional/no-conditional-statement\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;AACA;AACA;AACA;AACA;AACA;AAAiE;AAAA;AAAA;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,MAAMA,oBAAoB,SAASC,KAAK,CAAC;;AAEhD;;AAEA;AAAA;AAAA,eACe,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;IAAE;IAC5B,MAAM,IAAI1B,oBAAoB,CAAE,0CAAyC,CAAC;EAC5E;;EAEA;EACA;EACA;EACA;EACA;EACA;EACA;;EAGA,OAAO,OAAO;IAAC2B,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,EAAE;;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,eAAe,GAAG;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,IAAIpD,oBAAoB,CAAE,iCAAgCkC,KAAM,KAAIuB,GAAI,EAAC,CAAC,CAAC;UACpF;UACA9C,KAAK,CAAE,wBAAuBuB,KAAM,KAAIuB,GAAI,EAAC,CAAC;UAC9CL,MAAM,CAAC,IAAIpD,oBAAoB,CAAE,wBAAuBkC,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;YACzD1C,KAAK,CAAE,uBAAsBI,IAAI,CAACC,SAAS,CAAC2C,cAAc,CAAE,EAAC,CAAC;YAC9D,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,SAAQI,IAAI,CAACC,SAAS,CAAC2C,cAAc,CAAE,UAAS,CAAC;YACxDhD,KAAK,CAAE,SAAQkD,QAAQ,CAACnC,MAAO,yBAAwB,CAAC;YACxDf,KAAK,CAAE,SAAQyB,QAAQ,CAACV,MAAO,6BAA4B,CAAC;YAC5Df,KAAK,CAAE,cAAaI,IAAI,CAACC,SAAS,CAAC6C,QAAQ,CAAE,GAAE,CAAC;YAChDlD,KAAK,CAAE,kBAAiBI,IAAI,CAACC,SAAS,CAACoB,QAAQ,CAAE,GAAE,CAAC;YAGpDe,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,EAAE,CAAC,CAAC,CAAC;;UAE/B,eAAeA,YAAY,GAAG;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,eAAe,CAACX,KAAK,EAAEI,KAAK,EAAE/B,eAAe,EAAE;IACtD;IACA,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,WAAW,CAACjB,MAAM,EAAE;IAC3B,MAAM,CAACgF,KAAK,CAAC,GAAGhF,MAAM,CAACiF,GAAG,CAAC,QAAQ,CAAC;IACpC,OAAOD,KAAK,GAAGA,KAAK,CAAChB,KAAK,GAAG,EAAE;EACjC;EAEA,SAASY,kBAAkB,CAACT,SAAS,EAAE;IACrC;IACA1D,KAAK,CAAE,sEAAqE0D,SAAS,CAAC3C,MAAO,GAAE,CAAC;IAChG,OAAOoB,SAAS;EAClB;AAEF,CAAC;AAAA"}

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

@@ -0,0 +1,148 @@
+"use strict";
+
+var _chai = require("chai");
+var _fixura = require("@natlibfi/fixura");
+var _fixugenHttpClient = _interopRequireDefault(require("@natlibfi/fixugen-http-client"));
+var _marcRecord = require("@natlibfi/marc-record");
+var _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 _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js is distributed in the hope that it will be useful,
+* but WITHOUT ANY WARRANTY; without even the implied warranty of
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+* GNU Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+
+const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:candidate-search:test');
+describe('candidate-search', () => {
+  (0, _fixugenHttpClient.default)({
+    callback,
+    path: [__dirname, '..', '..', 'test-fixtures', 'candidate-search', 'index'],
+    recurse: false,
+    fixura: {
+      reader: _fixura.READERS.JSON
+    }
+  });
+
+  // eslint-disable-next-line max-statements
+  async function callback({
+    getFixture,
+    factoryOptions,
+    searchOptions,
+    expectedFactoryError = false,
+    expectedSearchError = false,
+    enabled = true
+  }) {
+    const url = 'http://foo.bar';
+    if (!enabled) {
+      return;
+    }
+    if (expectedFactoryError) {
+      if (expectedFactoryError.isCandidateSearchError) {
+        (0, _chai.expect)(() => (0, _.default)({
+          ...formatFactoryOptions(),
+          url
+        })).to.throw(_.CandidateSearchError, new RegExp(expectedFactoryError, 'u'));
+        return;
+      }
+      (0, _chai.expect)(() => (0, _.default)({
+        ...formatFactoryOptions(),
+        url
+      })).to.throw(new RegExp(expectedFactoryError, 'u'));
+      return;
+    }
+    const search = (0, _.default)({
+      ...formatFactoryOptions(),
+      url
+    });
+    await iterate({
+      searchOptions,
+      expectedSearchError
+    });
+    function formatFactoryOptions() {
+      debug(`Using factoryOptions: ${JSON.stringify(factoryOptions)}`);
+      return {
+        ...factoryOptions,
+        maxRecordsPerRequest: factoryOptions.maxRecordsPerRequest || 1,
+        maxServerResults: factoryOptions.maxServerResults || undefined,
+        record: new _marcRecord.MarcRecord(factoryOptions.record, {
+          subfieldValues: false
+        })
+      };
+    }
+
+    // eslint-disable-next-line max-statements
+    async function iterate({
+      searchOptions,
+      expectedSearchError,
+      expectedErrorStatus,
+      count = 1
+    }) {
+      const expectedResults = getFixture(`expectedResults${count}.json`);
+      if (expectedSearchError) {
+        // eslint-disable-line functional/no-conditional-statement
+        try {
+          await search(searchOptions);
+          throw new Error('Expected an error');
+        } catch (err) {
+          debug(`Got an error: ${err}`);
+          (0, _chai.expect)(err).to.be.an('error');
+          const errorMessage = err instanceof _melindaCommons.Error ? err.payload.message : err.message;
+          const errorStatus = err instanceof _melindaCommons.Error ? err.status : undefined;
+          debug(`errorMessage: ${errorMessage}, errorStatus: ${errorStatus}`);
+          (0, _chai.expect)(errorMessage).to.match(new RegExp(expectedSearchError, 'u'));
+          if (expectedErrorStatus) {
+            (0, _chai.expect)(errorStatus).to.be(expectedErrorStatus);
+            return;
+          }
+          return;
+        }
+      }
+
+      // eslint-disable-next-line functional/no-conditional-statement
+      if (!expectedSearchError) {
+        const results = await search(searchOptions);
+        (0, _chai.expect)(formatResults(results)).to.eql(expectedResults);
+      }
+      function formatResults(results) {
+        debug(results); //eslint-disable-line
+        return {
+          ...results,
+          records: results.records.map(({
+            record,
+            id
+          }) => ({
+            id,
+            record: record.toObject()
+          }))
+        };
+      }
+    }
+  }
+});
+//# sourceMappingURL=index.spec.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.spec.js","names":["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  // eslint-disable-next-line max-statements\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    // eslint-disable-next-line max-statements\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-statement\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-statement\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); //eslint-disable-line\n        return {\n          ...results,\n          records: results.records.map(({record, id}) => ({id, record: record.toObject()}))\n        };\n      }\n\n    }\n  }\n});\n"],"mappings":";;AA4BA;AACA;AACA;AACA;AACA;AACA;AACA;AAAsC;AAAA;AAAA;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,MAAMA,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;EACA,eAAeP,QAAQ,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,EAAE;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,EAAE;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,EAAE;MAAEJ;IAAG,CAAC,CAAC;IACtE,MAAMU,OAAO,CAAC;MAACd,aAAa;MAAEE;IAAmB,CAAC,CAAC;IAEnD,SAASM,oBAAoB,GAAG;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;IACA,eAAeP,OAAO,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,aAAa,CAACD,OAAO,EAAE;QAC9BlD,KAAK,CAACkD,OAAO,CAAC,CAAC,CAAC;QAChB,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;UAAE,CAAC,CAAC;QAClF,CAAC;MACH;IAEF;EACF;AACF,CAAC,CAAC"}