@natlibfi/melinda-record-matching 2.0.0 → 2.1.0-alpha.2

package/dist/index.js

@@ -27,7 +27,7 @@ function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { de
 *
 * Melinda record matching modules for Javascript
 *
-* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)
+* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)
 *
 * This file is part of melinda-record-matching-js
 *
@@ -52,74 +52,423 @@ var _default = ({
   detection: detectionOptions,
   search: searchOptions,
   maxMatches = 1,
-  maxCandidates = 25
+  maxCandidates = 25,
+  returnStrategy = false,
+  returnQuery = false,
+  returnNonMatches = false
 }) => {
   const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:index');
-  const detect = (0, matchDetection.default)(detectionOptions);
+  const debugData = debug.extend('data');
+  debugData(`DetectionOptions: ${JSON.stringify(detectionOptions)}`);
+  debugData(`SearchOptions: ${JSON.stringify(searchOptions)}`);
+  debugData(`MaxMatches: ${JSON.stringify(maxMatches)}`);
+  debugData(`MaxCandidates: ${JSON.stringify(maxCandidates)}`);
+  debugData(`ReturnStrategy: ${JSON.stringify(returnStrategy)}`);
+  debugData(`ReturnQuery: ${JSON.stringify(returnQuery)}`);
+  debugData(`ReturnNonMatches: ${JSON.stringify(returnNonMatches)}`);
+  const detect = (0, matchDetection.default)(detectionOptions, returnStrategy);
   return record => {
     const search = (0, candidateSearch.default)({ ...searchOptions,
-      record
+      record,
+      maxCandidates
     });
-    return iterate(); // eslint-disable-next-line max-statements
+    return iterate({}); // candidateCount : amount of candidate records retrived from SRU for matching, NOT including current record set
+    // matches : candidates that have been detected as matches by current matcher job
+    // nonMatches : candidates that have been detected as non-matches by current matcher job (only if returnNonMatches is 'true')
+    // duplicateCount : amount of candidate records that were retrieved from the SRU but not handled further because they were already found in the matches/nonMatches
+    // 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 candidate records retrieved from SRU for matching for current query, including the current record 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
 
-    async function iterate(initialState = {}, matches = [], candidateCount = 0) {
+    async function iterate({
+      initialState = {},
+      matches = [],
+      candidateCount = 0,
+      nonMatches = [],
+      duplicateCount = 0,
+      nonMatchCount = 0
+    }) {
+      debugData(`Starting next matcher iteration.`);
       const {
         records,
         ...state
       } = await search(initialState);
+      debugData(`Current state: ${JSON.stringify(state)}, matches: ${matches.length}, candidateCount: ${candidateCount}, nonMatches: ${nonMatches.length}`);
+      const recordSetSize = records.length;
+      const newCandidateCount = candidateCount + recordSetSize;
 
-      if (records.length > 0 || state.queriesLeft > 0) {
-        debug(`Checking ${records.length} candidates for matches`);
-        const matchResult = iterateRecords(records);
+      if (recordSetSize > 0) {
+        return handleRecordSet();
+      }
+
+      if (state.queriesLeft > 0) {
+        debug(`Empty record set ${state.searchCounter} for ${state.query}, but there are ${state.queriesLeft} queries left`);
+        return iterate({
+          initialState: state,
+          matches,
+          candidateCount: newCandidateCount,
+          nonMatches,
+          duplicateCount
+        });
+      }
+
+      debug(`No (more) candidate records to check, no more queries left, matches: ${matches.length}`);
+      return returnResult({
+        matches,
+        state,
+        stopReason: '',
+        nonMatches,
+        candidateCount: newCandidateCount,
+        duplicateCount
+      });
+
+      function handleRecordSet() {
+        debug(`Checking record set of ${recordSetSize} candidate records for possible matches, found by ${state.searchCounter} search for ${state.query}`);
+        const matchResult = iterateRecords({
+          records,
+          recordSetSize,
+          maxMatches,
+          matches,
+          nonMatches
+        });
+        const newDuplicateCount = duplicateCount + matchResult.duplicateCount;
+        const newNonMatchCount = nonMatchCount + matchResult.nonMatchCount;
+        const {
+          newMatches,
+          newNonMatches
+        } = handleMatchResult(matchResult, matches, nonMatches);
+
+        if (maxMatchesFound({
+          matches: newMatches,
+          maxMatches
+        })) {
+          return returnResult({
+            matches: newMatches,
+            state,
+            stopReason: 'maxMatches',
+            nonMatches: newNonMatches,
+            duplicateCount: newDuplicateCount,
+            candidateCount: newCandidateCount,
+            nonMatchCount: newNonMatchCount
+          });
+        }
 
-        if (matchResult) {
-          const newMatches = matches.concat(matchResult);
+        if (maxCandidatesRetrieved(newCandidateCount, maxCandidates)) {
+          return returnResult({
+            matches: newMatches,
+            state,
+            stopReason: 'maxCandidates',
+            nonMatches: newNonMatches,
+            duplicateCount: newDuplicateCount,
+            candidateCount: newCandidateCount,
+            nonMatchCount: newNonMatchCount
+          });
+        }
+
+        return iterate({
+          initialState: state,
+          matches: newMatches,
+          candidateCount: newCandidateCount,
+          nonMatches: newNonMatches,
+          duplicateCount: newDuplicateCount,
+          nonMatchCount: newNonMatchCount
+        });
+      }
+
+      function handleMatchResult(matchResult, matches, nonMatches) {
+        debugData(`- Amount of new matches from record set: ${matchResult.matches.length}`); // eslint-disable-next-line functional/no-conditional-statement
+
+        if (returnNonMatches) {
+          debugData(`- Amount of new nonMatches from record set: ${matchResult.nonMatches.length}`);
+        }
 
-          if (newMatches.length === maxMatches) {
-            return newMatches;
-          }
+        const newMatches = matches.concat(returnQuery ? addQuery(matchResult.matches) : matchResult.matches);
+        const newNonMatches = returnNonMatches ? nonMatches.concat(returnQuery ? addQuery(matchResult.nonMatches) : matchResult.nonMatches) : [];
+        debugData(`- Total amount of matches: ${newMatches.length}`); // eslint-disable-next-line functional/no-conditional-statement
 
-          return maxCandidatesRetrieved() ? newMatches : iterate(state, newMatches, candidateCount + records.length);
+        if (returnNonMatches) {
+          debugData(`- Total amount of nonMatches: ${newNonMatches.length}`);
         }
 
-        return maxCandidatesRetrieved() ? matches : iterate(state, matches, candidateCount + records.length);
+        return {
+          newMatches,
+          newNonMatches
+        };
       }
 
-      debug(`No (more) candidate records to check, matches: ${matches.length}`);
-      return matches;
+      function addQuery(matches) {
+        debugData(`Adding query ${state.query} to matches`);
+        return matches.map(match => ({ ...match,
+          matchQuery: state.query
+        }));
+      }
+
+      function maxCandidatesRetrieved(candidateCount, maxCandidates) {
+        debugData(`Total amount of candidate records retrieved: ${newCandidateCount} (max: ${maxCandidates})`);
 
-      function maxCandidatesRetrieved() {
-        if (candidateCount + records.length > maxCandidates) {
-          debug(`Stopped searching because maximum number of candidates have been retrieved`);
+        if (maxCandidates && candidateCount >= maxCandidates) {
+          debug(`Stopped matching because maximum number of candidate records ${candidateCount} / ${maxCandidates} have been retrieved`);
           return true;
         }
       }
+    } // matches : array of matching candidate records
+    // nonMatches : array of nonMatching candidate records (if returnNonMatches option is true, otherwise empty array)
+    // - candidate.id
+    // - candidate.record
+    // - probability
+    // - strategy (if returnStrategy option is true)
+    // - treshold (if returnStrategy option is true)
+    // - matchQuery (if returnQuery option is true)
+    // we could have here also returnRecords/returnMatchRecords/returnNonMatchRecord options that could be turned false for not to return actual record data
+    // matchStatus.status: boolean, true if matcher retrieved and handled all found candidate records, false if it did not
+    // matchStatus.stopReason: string ('maxMatches','maxCandidates','maxedQueries',empty string/undefined), reason for stopping retrieving or handling the candidate records
+    // - only one stopReason is returned (if there would be several possible stopReasons, stopReason is picked in the above order)
+    // - currently stopReason can be non-empty also in cases where status is true, if matcher hit the stop reason when handling the last available candidate record
+
+
+    function returnResult({
+      matches,
+      state,
+      stopReason,
+      nonMatches,
+      duplicateCount,
+      candidateCount,
+      nonMatchCount
+    }) {
+      checkCounts({
+        matches,
+        nonMatches,
+        candidateCount,
+        duplicateCount,
+        nonMatchCount
+      });
+      const matchStatus = getMatchState(state, stopReason); // add nonMatches to result only if returnNonMatches is 'true', otherwise nonMatches have not been gathered
+
+      const result = returnNonMatches ? {
+        matches,
+        matchStatus,
+        nonMatches
+      } : {
+        matches,
+        matchStatus
+      };
+      debugData(`${JSON.stringify(result)}`);
+      return result; // note that in cases where the matching has been stopped because of maxMatches checkCounts won't (in most cases) match
+
+      function checkCounts({
+        matches,
+        nonMatches,
+        candidateCount,
+        duplicateCount,
+        nonMatchCount
+      }) {
+        const matchCount = matches.length;
+        debugData(`Return nonMatches: ${returnNonMatches}`);
+        const chosenNonMatchCount = returnNonMatches ? nonMatches.length : nonMatchCount;
+        const totalHandled = matchCount + nonMatchCount + duplicateCount;
+        debug(`candidateCount: ${candidateCount}, matches: ${matchCount}, nonMatches: ${chosenNonMatchCount}, duplicateCount: ${duplicateCount}`);
+        debug(`We got result for ${totalHandled} / ${candidateCount} retrieved candidates`);
+
+        if (totalHandled !== candidateCount) {
+          debug(`WARNING: Missing results for ${candidateCount - totalHandled} candidates`);
+          return;
+        }
+
+        return;
+      }
+
+      function getMatchState(state, stopReason) {
+        debugData(`${JSON.stringify(state)}`);
+        debug(`Queries left ${state.queriesLeft}, Searches for current query left: ${state.resultSetOffset && state.resultSetOffset <= state.totalRecords}, non-retrieved records: ${state.totalRecords - state.queryCandidateCounter}, maxedQueries (${state.maxedQueries.length}): ${state.maxedQueries}`);
+        debugData(`StopReason: <${stopReason}>`);
+        const searchesLeft = state.resultSetOffset && state.resultSetOffset <= state.totalRecords;
+        const nonRetrieved = searchesLeft ? state.totalRecords - state.queryCandidateCounter : 0;
+        debugData(`nonRetrieved: ${nonRetrieved}`);
+
+        if (state.queriesLeft > 0 || nonRetrieved > 0 || state.maxedQueries.length > 0) {
+          const maxedQueriesStopReason = state.maxedQueries.length > 0 ? 'maxedQueries' : '';
+          const newStopReason = stopReason === '' ? maxedQueriesStopReason : stopReason;
+          debugData(`MaxedQueriesStopReason: <${maxedQueriesStopReason}>`);
+          debugData(`NewStopReason: <${newStopReason}>`);
+          debug(`Match status: false`);
+          return {
+            status: false,
+            stopReason: newStopReason
+          };
+        }
+
+        debug(`Match status: true`);
+        return {
+          status: true,
+          stopReason
+        };
+      }
+    }
 
-      function iterateRecords(records) {
-        const [candidate] = records;
+    function iterateRecords({
+      records,
+      recordSetSize,
+      maxMatches,
+      matches = [],
+      nonMatches = [],
+      recordMatches = [],
+      recordNonMatches = [],
+      recordCount = 0,
+      recordDuplicateCount = 0,
+      recordNonMatchCount = 0
+    }) {
+      // recordSetSize : total amount of records in the current record set
+      // recordCount : amount of records from the current record set that have been handled
+      // maxMatches : setting for maximum amount found by current matcher job before the matcher job is stopped
+      // recordDuplicateCount : amount of records from the current record set that are already included in matches/nonMatches results
+      // recordNonMatchCount: amount of records from the current record set that are nonMatches (only is returnNonMatches setting is false)
+      // records : non-handled records in the current record set
+      // matches : found matches in the current matcher job
+      // recordMatches : found matches in the current record set
+      // recordNonMatches : found nonMatches in the current record set (only if returnNonMatches setting is true)
+      const [candidate] = records;
+      const newRecordCount = candidate ? recordCount + 1 : recordCount; // The matcher uses same matchDetection strategy for candidates from all candidate-searches -> matchDetection result for the same candidate is always same
+      // Exceptions would happen if the candidate would have been updated in the database between candidate searches
+      // Note that if returnNonMatches is false, matcher won't remember candidates that didn't match, so they will be matched again everytime they are retrieved by
+      // different candidate search queries. Same candidate search query won't have duplicate records.
 
-        if (candidate) {
+      if (candidate) {
+        if (candidateNotInMatches(matches.concat(nonMatches), candidate)) {
           const {
             record: candidateRecord,
             id: candidateId
           } = candidate;
-          const {
-            match,
-            probability
-          } = detect(record, candidateRecord);
-
-          if (match) {
-            return {
-              probability,
-              candidate: {
-                id: candidateId,
-                record: candidateRecord
-              }
-            };
-          }
-
-          return iterateRecords(records.slice(1));
+          debug(`Running matchDetection for record ${candidateId} (${newRecordCount}/${recordSetSize})`);
+          const detectionResult = detect(record, candidateRecord);
+          return handleDetectionResult(detectionResult, candidateId, candidateRecord);
+        }
+
+        return iterateRecords({
+          records: records.slice(1),
+          recordSetSize,
+          maxMatches,
+          matches,
+          recordMatches,
+          recordCount: newRecordCount,
+          recordNonMatches,
+          recordDuplicateCount: recordDuplicateCount + 1,
+          recordNonMatchCount
+        });
+      }
+
+      debug(`No more candidates, record set (${recordCount}/${recordSetSize}) done, ${recordMatches.length} matches found, ${recordDuplicateCount} candidates already handled, ${returnNonMatches ? `${recordNonMatches.length}` : `${recordNonMatchCount}`} nonMatches found.`);
+      return {
+        matches: recordMatches,
+        nonMatches: returnNonMatches ? recordNonMatches : [],
+        duplicateCount: recordDuplicateCount,
+        nonMatchCount: recordNonMatchCount
+      };
+
+      function handleDetectionResult(detectionResult, candidateId, candidateRecord) {
+        debugData(`MatchDetection results for ${candidateId} (${newRecordCount}/${recordSetSize}): ${JSON.stringify(detectionResult)}`);
+
+        if (detectionResult.match || returnNonMatches) {
+          debug(`${detectionResult.match ? `Record ${candidateId} (${newRecordCount}/${recordSetSize}) is a match!` : `Record ${candidateId} (${newRecordCount}/${recordSetSize}) is NOT a match!`}`);
+          debugData(`Strategy: ${JSON.stringify(detectionResult.strategy)}, Treshold: ${JSON.stringify(detectionResult.treshold)}`);
+          const matchResult = {
+            probability: detectionResult.probability,
+            candidate: {
+              id: candidateId,
+              record: candidateRecord
+            }
+          };
+          const strategyResult = {
+            strategy: detectionResult.strategy,
+            treshold: detectionResult.treshold
+          };
+          const newMatch = returnStrategy ? { ...matchResult,
+            ...strategyResult
+          } : { ...matchResult
+          };
+          debugData(`${JSON.stringify(newMatch)}`);
+          return handleRecordMatch(detectionResult.match, newMatch);
+        }
+
+        const newRecordNonMatchCount = recordNonMatchCount + 1;
+        debugData(`- Total nonMatches after this detection: ${newRecordNonMatchCount}`);
+        return iterateRecords({
+          records: records.slice(1),
+          recordSetSize,
+          maxMatches,
+          matches,
+          recordMatches,
+          recordCount: newRecordCount,
+          recordNonMatches,
+          recordDuplicateCount,
+          recordNonMatchCount: newRecordNonMatchCount
+        });
+      }
+
+      function handleRecordMatch(isMatch, newMatch) {
+        const newRecordMatches = isMatch ? recordMatches.concat(newMatch) : recordMatches;
+        const newRecordNonMatches = isMatch ? recordNonMatches : recordNonMatches.concat(newMatch);
+        debugData(`- Total matches after this detection: ${matches.concat(newRecordMatches).length} (max: ${maxMatches})`); // eslint-disable-next-line functional/no-conditional-statement
+
+        if (returnNonMatches) {
+          debugData(`- Total nonMatches after this detection: ${nonMatches.concat(newRecordNonMatches).length}`);
+        }
+
+        if (maxMatchesFound({
+          matches: matches.concat(newRecordMatches),
+          maxMatches
+        })) {
+          debug(`MaxMatches (${maxMatches}) reached, handled candidates in record set: ${newRecordCount} non-handled candidates in record set ${recordSetSize - newRecordCount}`);
+          return {
+            matches: newRecordMatches,
+            nonMatches: returnNonMatches ? newRecordNonMatches : [],
+            duplicateCount: recordDuplicateCount,
+            nonMatchCount: recordNonMatchCount
+          };
         }
+
+        return iterateRecords({
+          records: records.slice(1),
+          recordSetSize,
+          maxMatches,
+          matches,
+          recordMatches: newRecordMatches,
+          recordCount: newRecordCount,
+          recordNonMatches: returnNonMatches ? newRecordNonMatches : [],
+          duplicateCount: recordDuplicateCount,
+          recordNonMatchCount
+        });
+      }
+
+      function candidateNotInMatches(matches, candidate) {
+        debug(`Checking that record ${candidate.id} is not already included in ${matches.length} matches/nonMatches`);
+        const newCandidateId = candidate.id;
+        debugData(`newCandidateId: ${newCandidateId}`);
+        const result = matches.find(({
+          candidate
+        }) => candidate.id === newCandidateId);
+        debugData(`Result: ${result}`);
+
+        if (result) {
+          debug(`${candidate.id} was already handled.`);
+          return false;
+        }
+
+        debug(`${candidate.id} not found in matches/nonMatches`);
+        return true;
+      }
+    }
+
+    function maxMatchesFound({
+      matches,
+      maxMatches
+    }) {
+      if (maxMatches && matches.length >= maxMatches) {
+        debug(`Stopping recordSet iteration: maxMatches (${maxMatches}) for matcher job found.`);
+        return true;
       }
     }
   };

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../src/index.js"],"names":["detection","detectionOptions","search","searchOptions","maxMatches","maxCandidates","debug","detect","record","iterate","initialState","matches","candidateCount","records","state","length","queriesLeft","matchResult","iterateRecords","newMatches","concat","maxCandidatesRetrieved","candidate","candidateRecord","id","candidateId","match","probability","slice"],"mappings":";;;;;;;AA4BA;;AACA;;;;AACA;;;;;;;;;;AA9BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;eAQe,CAAC;AAACA,EAAAA,SAAS,EAAEC,gBAAZ;AAA8BC,EAAAA,MAAM,EAAEC,aAAtC;AAAqDC,EAAAA,UAAU,GAAG,CAAlE;AAAqEC,EAAAA,aAAa,GAAG;AAArF,CAAD,KAA8F;AAC3G,QAAMC,KAAK,GAAG,oBAAkB,yCAAlB,CAAd;AACA,QAAMC,MAAM,GAAG,4BAAyBN,gBAAzB,CAAf;AAEA,SAAOO,MAAM,IAAI;AACf,UAAMN,MAAM,GAAG,6BAAsB,EAAC,GAAGC,aAAJ;AAAmBK,MAAAA;AAAnB,KAAtB,CAAf;AACA,WAAOC,OAAO,EAAd,CAFe,CAIf;;AACA,mBAAeA,OAAf,CAAuBC,YAAY,GAAG,EAAtC,EAA0CC,OAAO,GAAG,EAApD,EAAwDC,cAAc,GAAG,CAAzE,EAA4E;AAC1E,YAAM;AAACC,QAAAA,OAAD;AAAU,WAAGC;AAAb,UAAsB,MAAMZ,MAAM,CAACQ,YAAD,CAAxC;;AAEA,UAAIG,OAAO,CAACE,MAAR,GAAiB,CAAjB,IAAsBD,KAAK,CAACE,WAAN,GAAoB,CAA9C,EAAiD;AAC/CV,QAAAA,KAAK,CAAE,YAAWO,OAAO,CAACE,MAAO,yBAA5B,CAAL;AAEA,cAAME,WAAW,GAAGC,cAAc,CAACL,OAAD,CAAlC;;AAEA,YAAII,WAAJ,EAAiB;AACf,gBAAME,UAAU,GAAGR,OAAO,CAACS,MAAR,CAAeH,WAAf,CAAnB;;AAEA,cAAIE,UAAU,CAACJ,MAAX,KAAsBX,UAA1B,EAAsC;AACpC,mBAAOe,UAAP;AACD;;AAED,iBAAOE,sBAAsB,KAAKF,UAAL,GAAkBV,OAAO,CAACK,KAAD,EAAQK,UAAR,EAAoBP,cAAc,GAAGC,OAAO,CAACE,MAA7C,CAAtD;AACD;;AAED,eAAOM,sBAAsB,KAAKV,OAAL,GAAeF,OAAO,CAACK,KAAD,EAAQH,OAAR,EAAiBC,cAAc,GAAGC,OAAO,CAACE,MAA1C,CAAnD;AACD;;AAEDT,MAAAA,KAAK,CAAE,kDAAiDK,OAAO,CAACI,MAAO,EAAlE,CAAL;AACA,aAAOJ,OAAP;;AAEA,eAASU,sBAAT,GAAkC;AAChC,YAAIT,cAAc,GAAGC,OAAO,CAACE,MAAzB,GAAkCV,aAAtC,EAAqD;AACnDC,UAAAA,KAAK,CAAE,4EAAF,CAAL;AACA,iBAAO,IAAP;AACD;AACF;;AAED,eAASY,cAAT,CAAwBL,OAAxB,EAAiC;AAC/B,cAAM,CAACS,SAAD,IAAcT,OAApB;;AAEA,YAAIS,SAAJ,EAAe;AACb,gBAAM;AAACd,YAAAA,MAAM,EAAEe,eAAT;AAA0BC,YAAAA,EAAE,EAAEC;AAA9B,cAA6CH,SAAnD;AACA,gBAAM;AAACI,YAAAA,KAAD;AAAQC,YAAAA;AAAR,cAAuBpB,MAAM,CAACC,MAAD,EAASe,eAAT,CAAnC;;AAEA,cAAIG,KAAJ,EAAW;AACT,mBAAO;AACLC,cAAAA,WADK;AAELL,cAAAA,SAAS,EAAE;AACTE,gBAAAA,EAAE,EAAEC,WADK;AAETjB,gBAAAA,MAAM,EAAEe;AAFC;AAFN,aAAP;AAOD;;AAED,iBAAOL,cAAc,CAACL,OAAO,CAACe,KAAR,CAAc,CAAd,CAAD,CAArB;AACD;AACF;AACF;AACF,GAzDD;AA0DD,C","sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport createSearchInterface, * as candidateSearch from './candidate-search';\nimport createDetectionInterface, * as matchDetection from './match-detection';\n\nexport {candidateSearch, matchDetection};\n\nexport default ({detection: detectionOptions, search: searchOptions, maxMatches = 1, maxCandidates = 25}) => {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:index');\n  const detect = createDetectionInterface(detectionOptions);\n\n  return record => {\n    const search = createSearchInterface({...searchOptions, record});\n    return iterate();\n\n    // eslint-disable-next-line max-statements\n    async function iterate(initialState = {}, matches = [], candidateCount = 0) {\n      const {records, ...state} = await search(initialState);\n\n      if (records.length > 0 || state.queriesLeft > 0) {\n        debug(`Checking ${records.length} candidates for matches`);\n\n        const matchResult = iterateRecords(records);\n\n        if (matchResult) {\n          const newMatches = matches.concat(matchResult);\n\n          if (newMatches.length === maxMatches) {\n            return newMatches;\n          }\n\n          return maxCandidatesRetrieved() ? newMatches : iterate(state, newMatches, candidateCount + records.length);\n        }\n\n        return maxCandidatesRetrieved() ? matches : iterate(state, matches, candidateCount + records.length);\n      }\n\n      debug(`No (more) candidate records to check, matches: ${matches.length}`);\n      return matches;\n\n      function maxCandidatesRetrieved() {\n        if (candidateCount + records.length > maxCandidates) {\n          debug(`Stopped searching because maximum number of candidates have been retrieved`);\n          return true;\n        }\n      }\n\n      function iterateRecords(records) {\n        const [candidate] = records;\n\n        if (candidate) {\n          const {record: candidateRecord, id: candidateId} = candidate;\n          const {match, probability} = detect(record, candidateRecord);\n\n          if (match) {\n            return {\n              probability,\n              candidate: {\n                id: candidateId,\n                record: candidateRecord\n              }\n            };\n          }\n\n          return iterateRecords(records.slice(1));\n        }\n      }\n    }\n  };\n};\n"],"file":"index.js"}
+{"version":3,"sources":["../src/index.js"],"names":["detection","detectionOptions","search","searchOptions","maxMatches","maxCandidates","returnStrategy","returnQuery","returnNonMatches","debug","debugData","extend","JSON","stringify","detect","record","iterate","initialState","matches","candidateCount","nonMatches","duplicateCount","nonMatchCount","records","state","length","recordSetSize","newCandidateCount","handleRecordSet","queriesLeft","searchCounter","query","returnResult","stopReason","matchResult","iterateRecords","newDuplicateCount","newNonMatchCount","newMatches","newNonMatches","handleMatchResult","maxMatchesFound","maxCandidatesRetrieved","concat","addQuery","map","match","matchQuery","checkCounts","matchStatus","getMatchState","result","matchCount","chosenNonMatchCount","totalHandled","resultSetOffset","totalRecords","queryCandidateCounter","maxedQueries","searchesLeft","nonRetrieved","maxedQueriesStopReason","newStopReason","status","recordMatches","recordNonMatches","recordCount","recordDuplicateCount","recordNonMatchCount","candidate","newRecordCount","candidateNotInMatches","candidateRecord","id","candidateId","detectionResult","handleDetectionResult","slice","strategy","treshold","probability","strategyResult","newMatch","handleRecordMatch","newRecordNonMatchCount","isMatch","newRecordMatches","newRecordNonMatches","newCandidateId","find"],"mappings":";;;;;;;AA4BA;;AACA;;;;AACA;;;;;;;;;;AA9BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;eAQe,CAAC;AAACA,EAAAA,SAAS,EAAEC,gBAAZ;AAA8BC,EAAAA,MAAM,EAAEC,aAAtC;AAAqDC,EAAAA,UAAU,GAAG,CAAlE;AAAqEC,EAAAA,aAAa,GAAG,EAArF;AAAyFC,EAAAA,cAAc,GAAG,KAA1G;AAAiHC,EAAAA,WAAW,GAAG,KAA/H;AAAsIC,EAAAA,gBAAgB,GAAG;AAAzJ,CAAD,KAAqK;AAClL,QAAMC,KAAK,GAAG,oBAAkB,yCAAlB,CAAd;AACA,QAAMC,SAAS,GAAGD,KAAK,CAACE,MAAN,CAAa,MAAb,CAAlB;AAEAD,EAAAA,SAAS,CAAE,qBAAoBE,IAAI,CAACC,SAAL,CAAeZ,gBAAf,CAAiC,EAAvD,CAAT;AACAS,EAAAA,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAL,CAAeV,aAAf,CAA8B,EAAjD,CAAT;AACAO,EAAAA,SAAS,CAAE,eAAcE,IAAI,CAACC,SAAL,CAAeT,UAAf,CAA2B,EAA3C,CAAT;AACAM,EAAAA,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAL,CAAeR,aAAf,CAA8B,EAAjD,CAAT;AACAK,EAAAA,SAAS,CAAE,mBAAkBE,IAAI,CAACC,SAAL,CAAeP,cAAf,CAA+B,EAAnD,CAAT;AACAI,EAAAA,SAAS,CAAE,gBAAeE,IAAI,CAACC,SAAL,CAAeN,WAAf,CAA4B,EAA7C,CAAT;AACAG,EAAAA,SAAS,CAAE,qBAAoBE,IAAI,CAACC,SAAL,CAAeL,gBAAf,CAAiC,EAAvD,CAAT;AAEA,QAAMM,MAAM,GAAG,4BAAyBb,gBAAzB,EAA2CK,cAA3C,CAAf;AAEA,SAAOS,MAAM,IAAI;AACf,UAAMb,MAAM,GAAG,6BAAsB,EAAC,GAAGC,aAAJ;AAAmBY,MAAAA,MAAnB;AAA2BV,MAAAA;AAA3B,KAAtB,CAAf;AACA,WAAOW,OAAO,CAAC,EAAD,CAAd,CAFe,CAIf;AACA;AACA;AACA;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,mBAAeA,OAAf,CAAuB;AAACC,MAAAA,YAAY,GAAG,EAAhB;AAAoBC,MAAAA,OAAO,GAAG,EAA9B;AAAkCC,MAAAA,cAAc,GAAG,CAAnD;AAAsDC,MAAAA,UAAU,GAAG,EAAnE;AAAuEC,MAAAA,cAAc,GAAG,CAAxF;AAA2FC,MAAAA,aAAa,GAAG;AAA3G,KAAvB,EAAsI;AACpIZ,MAAAA,SAAS,CAAE,kCAAF,CAAT;AACA,YAAM;AAACa,QAAAA,OAAD;AAAU,WAAGC;AAAb,UAAsB,MAAMtB,MAAM,CAACe,YAAD,CAAxC;AAEAP,MAAAA,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAL,CAAeW,KAAf,CAAsB,cAAaN,OAAO,CAACO,MAAO,qBAAoBN,cAAe,iBAAgBC,UAAU,CAACK,MAAO,EAA1I,CAAT;AACA,YAAMC,aAAa,GAAGH,OAAO,CAACE,MAA9B;AACA,YAAME,iBAAiB,GAAGR,cAAc,GAAGO,aAA3C;;AAEA,UAAIA,aAAa,GAAG,CAApB,EAAuB;AACrB,eAAOE,eAAe,EAAtB;AACD;;AAED,UAAIJ,KAAK,CAACK,WAAN,GAAoB,CAAxB,EAA2B;AACzBpB,QAAAA,KAAK,CAAE,oBAAmBe,KAAK,CAACM,aAAc,QAAON,KAAK,CAACO,KAAM,mBAAkBP,KAAK,CAACK,WAAY,eAAhG,CAAL;AACA,eAAOb,OAAO,CAAC;AAACC,UAAAA,YAAY,EAAEO,KAAf;AAAsBN,UAAAA,OAAtB;AAA+BC,UAAAA,cAAc,EAAEQ,iBAA/C;AAAkEP,UAAAA,UAAlE;AAA8EC,UAAAA;AAA9E,SAAD,CAAd;AACD;;AAEDZ,MAAAA,KAAK,CAAE,wEAAuES,OAAO,CAACO,MAAO,EAAxF,CAAL;AACA,aAAOO,YAAY,CAAC;AAACd,QAAAA,OAAD;AAAUM,QAAAA,KAAV;AAAiBS,QAAAA,UAAU,EAAE,EAA7B;AAAiCb,QAAAA,UAAjC;AAA6CD,QAAAA,cAAc,EAAEQ,iBAA7D;AAAgFN,QAAAA;AAAhF,OAAD,CAAnB;;AAEA,eAASO,eAAT,GAA2B;AACzBnB,QAAAA,KAAK,CAAE,0BAAyBiB,aAAc,qDAAoDF,KAAK,CAACM,aAAc,eAAcN,KAAK,CAACO,KAAM,EAA3I,CAAL;AAEA,cAAMG,WAAW,GAAGC,cAAc,CAAC;AAACZ,UAAAA,OAAD;AAAUG,UAAAA,aAAV;AAAyBtB,UAAAA,UAAzB;AAAqCc,UAAAA,OAArC;AAA8CE,UAAAA;AAA9C,SAAD,CAAlC;AACA,cAAMgB,iBAAiB,GAAGf,cAAc,GAAGa,WAAW,CAACb,cAAvD;AACA,cAAMgB,gBAAgB,GAAGf,aAAa,GAAGY,WAAW,CAACZ,aAArD;AACA,cAAM;AAACgB,UAAAA,UAAD;AAAaC,UAAAA;AAAb,YAA8BC,iBAAiB,CAACN,WAAD,EAAchB,OAAd,EAAuBE,UAAvB,CAArD;;AAEA,YAAIqB,eAAe,CAAC;AAACvB,UAAAA,OAAO,EAAEoB,UAAV;AAAsBlC,UAAAA;AAAtB,SAAD,CAAnB,EAAwD;AACtD,iBAAO4B,YAAY,CAAC;AAACd,YAAAA,OAAO,EAAEoB,UAAV;AAAsBd,YAAAA,KAAtB;AAA6BS,YAAAA,UAAU,EAAE,YAAzC;AAAuDb,YAAAA,UAAU,EAAEmB,aAAnE;AAAkFlB,YAAAA,cAAc,EAAEe,iBAAlG;AAAqHjB,YAAAA,cAAc,EAAEQ,iBAArI;AAAwJL,YAAAA,aAAa,EAAEe;AAAvK,WAAD,CAAnB;AACD;;AAED,YAAIK,sBAAsB,CAACf,iBAAD,EAAoBtB,aAApB,CAA1B,EAA8D;AAC5D,iBAAO2B,YAAY,CAAC;AAACd,YAAAA,OAAO,EAAEoB,UAAV;AAAsBd,YAAAA,KAAtB;AAA6BS,YAAAA,UAAU,EAAE,eAAzC;AAA0Db,YAAAA,UAAU,EAAEmB,aAAtE;AAAqFlB,YAAAA,cAAc,EAAEe,iBAArG;AAAwHjB,YAAAA,cAAc,EAAEQ,iBAAxI;AAA2JL,YAAAA,aAAa,EAAEe;AAA1K,WAAD,CAAnB;AACD;;AAED,eAAOrB,OAAO,CAAC;AAACC,UAAAA,YAAY,EAAEO,KAAf;AAAsBN,UAAAA,OAAO,EAAEoB,UAA/B;AAA2CnB,UAAAA,cAAc,EAAEQ,iBAA3D;AAA8EP,UAAAA,UAAU,EAAEmB,aAA1F;AAAyGlB,UAAAA,cAAc,EAAEe,iBAAzH;AAA4Id,UAAAA,aAAa,EAAEe;AAA3J,SAAD,CAAd;AACD;;AAED,eAASG,iBAAT,CAA2BN,WAA3B,EAAwChB,OAAxC,EAAiDE,UAAjD,EAA6D;AAC3DV,QAAAA,SAAS,CAAE,4CAA2CwB,WAAW,CAAChB,OAAZ,CAAoBO,MAAO,EAAxE,CAAT,CAD2D,CAE3D;;AACA,YAAIjB,gBAAJ,EAAsB;AACpBE,UAAAA,SAAS,CAAE,+CAA8CwB,WAAW,CAACd,UAAZ,CAAuBK,MAAO,EAA9E,CAAT;AACD;;AAED,cAAMa,UAAU,GAAGpB,OAAO,CAACyB,MAAR,CAAepC,WAAW,GAAGqC,QAAQ,CAACV,WAAW,CAAChB,OAAb,CAAX,GAAmCgB,WAAW,CAAChB,OAAzE,CAAnB;AACA,cAAMqB,aAAa,GAAG/B,gBAAgB,GAAGY,UAAU,CAACuB,MAAX,CAAkBpC,WAAW,GAAGqC,QAAQ,CAACV,WAAW,CAACd,UAAb,CAAX,GAAsCc,WAAW,CAACd,UAA/E,CAAH,GAAgG,EAAtI;AAEAV,QAAAA,SAAS,CAAE,8BAA6B4B,UAAU,CAACb,MAAO,EAAjD,CAAT,CAV2D,CAW3D;;AACA,YAAIjB,gBAAJ,EAAsB;AACpBE,UAAAA,SAAS,CAAE,iCAAgC6B,aAAa,CAACd,MAAO,EAAvD,CAAT;AACD;;AAED,eAAO;AAACa,UAAAA,UAAD;AAAaC,UAAAA;AAAb,SAAP;AACD;;AAED,eAASK,QAAT,CAAkB1B,OAAlB,EAA2B;AACzBR,QAAAA,SAAS,CAAE,gBAAec,KAAK,CAACO,KAAM,aAA7B,CAAT;AACA,eAAOb,OAAO,CAAC2B,GAAR,CAAaC,KAAD,KAAY,EAAC,GAAGA,KAAJ;AAAWC,UAAAA,UAAU,EAAEvB,KAAK,CAACO;AAA7B,SAAZ,CAAZ,CAAP;AACD;;AAED,eAASW,sBAAT,CAAgCvB,cAAhC,EAAgDd,aAAhD,EAA+D;AAC7DK,QAAAA,SAAS,CAAE,gDAA+CiB,iBAAkB,UAAStB,aAAc,GAA1F,CAAT;;AACA,YAAIA,aAAa,IAAIc,cAAc,IAAId,aAAvC,EAAsD;AACpDI,UAAAA,KAAK,CAAE,gEAA+DU,cAAe,MAAKd,aAAc,sBAAnG,CAAL;AACA,iBAAO,IAAP;AACD;AACF;AACF,KAvFc,CAyFf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAEA;AAEA;AACA;AACA;AACA;;;AAEA,aAAS2B,YAAT,CAAsB;AAACd,MAAAA,OAAD;AAAUM,MAAAA,KAAV;AAAiBS,MAAAA,UAAjB;AAA6Bb,MAAAA,UAA7B;AAAyCC,MAAAA,cAAzC;AAAyDF,MAAAA,cAAzD;AAAyEG,MAAAA;AAAzE,KAAtB,EAA+G;AAC7G0B,MAAAA,WAAW,CAAC;AAAC9B,QAAAA,OAAD;AAAUE,QAAAA,UAAV;AAAsBD,QAAAA,cAAtB;AAAsCE,QAAAA,cAAtC;AAAsDC,QAAAA;AAAtD,OAAD,CAAX;AACA,YAAM2B,WAAW,GAAGC,aAAa,CAAC1B,KAAD,EAAQS,UAAR,CAAjC,CAF6G,CAG7G;;AACA,YAAMkB,MAAM,GAAG3C,gBAAgB,GAAG;AAACU,QAAAA,OAAD;AAAU+B,QAAAA,WAAV;AAAuB7B,QAAAA;AAAvB,OAAH,GAAwC;AAACF,QAAAA,OAAD;AAAU+B,QAAAA;AAAV,OAAvE;AACAvC,MAAAA,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAL,CAAesC,MAAf,CAAuB,EAA3B,CAAT;AACA,aAAOA,MAAP,CAN6G,CAQ7G;;AAEA,eAASH,WAAT,CAAqB;AAAC9B,QAAAA,OAAD;AAAUE,QAAAA,UAAV;AAAsBD,QAAAA,cAAtB;AAAsCE,QAAAA,cAAtC;AAAsDC,QAAAA;AAAtD,OAArB,EAA2F;AACzF,cAAM8B,UAAU,GAAGlC,OAAO,CAACO,MAA3B;AACAf,QAAAA,SAAS,CAAE,sBAAqBF,gBAAiB,EAAxC,CAAT;AACA,cAAM6C,mBAAmB,GAAG7C,gBAAgB,GAAGY,UAAU,CAACK,MAAd,GAAuBH,aAAnE;AACA,cAAMgC,YAAY,GAAGF,UAAU,GAAG9B,aAAb,GAA6BD,cAAlD;AACAZ,QAAAA,KAAK,CAAE,mBAAkBU,cAAe,cAAaiC,UAAW,iBAAgBC,mBAAoB,qBAAoBhC,cAAe,EAAlI,CAAL;AACAZ,QAAAA,KAAK,CAAE,qBAAoB6C,YAAa,MAAKnC,cAAe,uBAAvD,CAAL;;AACA,YAAImC,YAAY,KAAKnC,cAArB,EAAqC;AACnCV,UAAAA,KAAK,CAAE,gCAA+BU,cAAc,GAAGmC,YAAa,aAA/D,CAAL;AACA;AACD;;AACD;AACD;;AAED,eAASJ,aAAT,CAAuB1B,KAAvB,EAA8BS,UAA9B,EAA0C;AACxCvB,QAAAA,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAL,CAAeW,KAAf,CAAsB,EAA1B,CAAT;AACAf,QAAAA,KAAK,CAAE,gBAAee,KAAK,CAACK,WAAY,sCAAqCL,KAAK,CAAC+B,eAAN,IAAyB/B,KAAK,CAAC+B,eAAN,IAAyB/B,KAAK,CAACgC,YAAa,4BAA2BhC,KAAK,CAACgC,YAAN,GAAqBhC,KAAK,CAACiC,qBAAsB,mBAAkBjC,KAAK,CAACkC,YAAN,CAAmBjC,MAAO,MAAKD,KAAK,CAACkC,YAAa,EAA7R,CAAL;AAEAhD,QAAAA,SAAS,CAAE,gBAAeuB,UAAW,GAA5B,CAAT;AAEA,cAAM0B,YAAY,GAAGnC,KAAK,CAAC+B,eAAN,IAAyB/B,KAAK,CAAC+B,eAAN,IAAyB/B,KAAK,CAACgC,YAA7E;AACA,cAAMI,YAAY,GAAGD,YAAY,GAAGnC,KAAK,CAACgC,YAAN,GAAqBhC,KAAK,CAACiC,qBAA9B,GAAsD,CAAvF;AACA/C,QAAAA,SAAS,CAAE,iBAAgBkD,YAAa,EAA/B,CAAT;;AAEA,YAAIpC,KAAK,CAACK,WAAN,GAAoB,CAApB,IAAyB+B,YAAY,GAAG,CAAxC,IAA6CpC,KAAK,CAACkC,YAAN,CAAmBjC,MAAnB,GAA4B,CAA7E,EAAgF;AAC9E,gBAAMoC,sBAAsB,GAAGrC,KAAK,CAACkC,YAAN,CAAmBjC,MAAnB,GAA4B,CAA5B,GAAgC,cAAhC,GAAiD,EAAhF;AACA,gBAAMqC,aAAa,GAAG7B,UAAU,KAAK,EAAf,GAAoB4B,sBAApB,GAA6C5B,UAAnE;AACAvB,UAAAA,SAAS,CAAE,4BAA2BmD,sBAAuB,GAApD,CAAT;AACAnD,UAAAA,SAAS,CAAE,mBAAkBoD,aAAc,GAAlC,CAAT;AACArD,UAAAA,KAAK,CAAE,qBAAF,CAAL;AACA,iBAAO;AAACsD,YAAAA,MAAM,EAAE,KAAT;AAAgB9B,YAAAA,UAAU,EAAE6B;AAA5B,WAAP;AACD;;AAEDrD,QAAAA,KAAK,CAAE,oBAAF,CAAL;AACA,eAAO;AAACsD,UAAAA,MAAM,EAAE,IAAT;AAAe9B,UAAAA;AAAf,SAAP;AACD;AACF;;AAED,aAASE,cAAT,CAAwB;AAACZ,MAAAA,OAAD;AAAUG,MAAAA,aAAV;AAAyBtB,MAAAA,UAAzB;AAAqCc,MAAAA,OAAO,GAAG,EAA/C;AAAmDE,MAAAA,UAAU,GAAG,EAAhE;AAAoE4C,MAAAA,aAAa,GAAG,EAApF;AAAwFC,MAAAA,gBAAgB,GAAG,EAA3G;AAA+GC,MAAAA,WAAW,GAAG,CAA7H;AAAgIC,MAAAA,oBAAoB,GAAG,CAAvJ;AAA0JC,MAAAA,mBAAmB,GAAG;AAAhL,KAAxB,EAA4M;AAE1M;AACA;AACA;AACA;AACA;AAEA;AACA;AACA;AACA;AAEA,YAAM,CAACC,SAAD,IAAc9C,OAApB;AACA,YAAM+C,cAAc,GAAGD,SAAS,GAAGH,WAAW,GAAG,CAAjB,GAAqBA,WAArD,CAd0M,CAgB1M;AACA;AACA;AACA;;AAEA,UAAIG,SAAJ,EAAe;AAEb,YAAIE,qBAAqB,CAACrD,OAAO,CAACyB,MAAR,CAAevB,UAAf,CAAD,EAA6BiD,SAA7B,CAAzB,EAAkE;AAChE,gBAAM;AAACtD,YAAAA,MAAM,EAAEyD,eAAT;AAA0BC,YAAAA,EAAE,EAAEC;AAA9B,cAA6CL,SAAnD;AACA5D,UAAAA,KAAK,CAAE,qCAAoCiE,WAAY,KAAIJ,cAAe,IAAG5C,aAAc,GAAtF,CAAL;AACA,gBAAMiD,eAAe,GAAG7D,MAAM,CAACC,MAAD,EAASyD,eAAT,CAA9B;AACA,iBAAOI,qBAAqB,CAACD,eAAD,EAAkBD,WAAlB,EAA+BF,eAA/B,CAA5B;AACD;;AACD,eAAOrC,cAAc,CAAC;AAACZ,UAAAA,OAAO,EAAEA,OAAO,CAACsD,KAAR,CAAc,CAAd,CAAV;AAA4BnD,UAAAA,aAA5B;AAA2CtB,UAAAA,UAA3C;AAAuDc,UAAAA,OAAvD;AAAgE8C,UAAAA,aAAhE;AAA+EE,UAAAA,WAAW,EAAEI,cAA5F;AAA4GL,UAAAA,gBAA5G;AAA8HE,UAAAA,oBAAoB,EAAEA,oBAAoB,GAAG,CAA3K;AAA8KC,UAAAA;AAA9K,SAAD,CAArB;AACD;;AAED3D,MAAAA,KAAK,CAAE,mCAAkCyD,WAAY,IAAGxC,aAAc,WAAUsC,aAAa,CAACvC,MAAO,mBAAkB0C,oBAAqB,gCAA+B3D,gBAAgB,GAAI,GAAEyD,gBAAgB,CAACxC,MAAO,EAA9B,GAAmC,GAAE2C,mBAAoB,EAAE,oBAAjP,CAAL;AACA,aAAO;AAAClD,QAAAA,OAAO,EAAE8C,aAAV;AAAyB5C,QAAAA,UAAU,EAAEZ,gBAAgB,GAAGyD,gBAAH,GAAsB,EAA3E;AAA+E5C,QAAAA,cAAc,EAAE8C,oBAA/F;AAAqH7C,QAAAA,aAAa,EAAE8C;AAApI,OAAP;;AAEA,eAASQ,qBAAT,CAA+BD,eAA/B,EAAgDD,WAAhD,EAA6DF,eAA7D,EAA8E;AAC5E9D,QAAAA,SAAS,CAAE,8BAA6BgE,WAAY,KAAIJ,cAAe,IAAG5C,aAAc,MAAKd,IAAI,CAACC,SAAL,CAAe8D,eAAf,CAAgC,EAApH,CAAT;;AAEA,YAAIA,eAAe,CAAC7B,KAAhB,IAAyBtC,gBAA7B,EAA+C;AAC7CC,UAAAA,KAAK,CAAE,GAAEkE,eAAe,CAAC7B,KAAhB,GAAyB,UAAS4B,WAAY,KAAIJ,cAAe,IAAG5C,aAAc,eAAlF,GAAoG,UAASgD,WAAY,KAAIJ,cAAe,IAAG5C,aAAc,mBAAmB,EAApL,CAAL;AACAhB,UAAAA,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAL,CAAe8D,eAAe,CAACG,QAA/B,CAAyC,eAAclE,IAAI,CAACC,SAAL,CAAe8D,eAAe,CAACI,QAA/B,CAAyC,EAA9G,CAAT;AAEA,gBAAM7C,WAAW,GAAG;AAClB8C,YAAAA,WAAW,EAAEL,eAAe,CAACK,WADX;AAElBX,YAAAA,SAAS,EAAE;AACTI,cAAAA,EAAE,EAAEC,WADK;AAET3D,cAAAA,MAAM,EAAEyD;AAFC;AAFO,WAApB;AAOA,gBAAMS,cAAc,GAAG;AACrBH,YAAAA,QAAQ,EAAEH,eAAe,CAACG,QADL;AAErBC,YAAAA,QAAQ,EAAEJ,eAAe,CAACI;AAFL,WAAvB;AAIA,gBAAMG,QAAQ,GAAG5E,cAAc,GAAG,EAAC,GAAG4B,WAAJ;AAAiB,eAAG+C;AAApB,WAAH,GAAyC,EAAC,GAAG/C;AAAJ,WAAxE;AAEAxB,UAAAA,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAL,CAAeqE,QAAf,CAAyB,EAA7B,CAAT;AAEA,iBAAOC,iBAAiB,CAACR,eAAe,CAAC7B,KAAjB,EAAwBoC,QAAxB,CAAxB;AACD;;AAED,cAAME,sBAAsB,GAAGhB,mBAAmB,GAAG,CAArD;AACA1D,QAAAA,SAAS,CAAE,4CAA2C0E,sBAAuB,EAApE,CAAT;AAEA,eAAOjD,cAAc,CAAC;AAACZ,UAAAA,OAAO,EAAEA,OAAO,CAACsD,KAAR,CAAc,CAAd,CAAV;AAA4BnD,UAAAA,aAA5B;AAA2CtB,UAAAA,UAA3C;AAAuDc,UAAAA,OAAvD;AAAgE8C,UAAAA,aAAhE;AAA+EE,UAAAA,WAAW,EAAEI,cAA5F;AAA4GL,UAAAA,gBAA5G;AAA8HE,UAAAA,oBAA9H;AAAoJC,UAAAA,mBAAmB,EAAEgB;AAAzK,SAAD,CAArB;AACD;;AAED,eAASD,iBAAT,CAA2BE,OAA3B,EAAoCH,QAApC,EAA8C;AAC5C,cAAMI,gBAAgB,GAAGD,OAAO,GAAGrB,aAAa,CAACrB,MAAd,CAAqBuC,QAArB,CAAH,GAAoClB,aAApE;AACA,cAAMuB,mBAAmB,GAAGF,OAAO,GAAGpB,gBAAH,GAAsBA,gBAAgB,CAACtB,MAAjB,CAAwBuC,QAAxB,CAAzD;AAEAxE,QAAAA,SAAS,CAAE,yCAAwCQ,OAAO,CAACyB,MAAR,CAAe2C,gBAAf,EAAiC7D,MAAO,UAASrB,UAAW,GAAtG,CAAT,CAJ4C,CAM5C;;AACA,YAAII,gBAAJ,EAAsB;AACpBE,UAAAA,SAAS,CAAE,4CAA2CU,UAAU,CAACuB,MAAX,CAAkB4C,mBAAlB,EAAuC9D,MAAO,EAA3F,CAAT;AACD;;AAED,YAAIgB,eAAe,CAAC;AAACvB,UAAAA,OAAO,EAAEA,OAAO,CAACyB,MAAR,CAAe2C,gBAAf,CAAV;AAA4ClF,UAAAA;AAA5C,SAAD,CAAnB,EAA8E;AAC5EK,UAAAA,KAAK,CAAE,eAAcL,UAAW,gDAA+CkE,cAAe,yCAAwC5C,aAAa,GAAG4C,cAAe,EAAhK,CAAL;AACA,iBAAO;AAACpD,YAAAA,OAAO,EAAEoE,gBAAV;AAA4BlE,YAAAA,UAAU,EAAEZ,gBAAgB,GAAG+E,mBAAH,GAAyB,EAAjF;AAAqFlE,YAAAA,cAAc,EAAE8C,oBAArG;AAA2H7C,YAAAA,aAAa,EAAE8C;AAA1I,WAAP;AACD;;AAED,eAAOjC,cAAc,CAAC;AAACZ,UAAAA,OAAO,EAAEA,OAAO,CAACsD,KAAR,CAAc,CAAd,CAAV;AAA4BnD,UAAAA,aAA5B;AAA2CtB,UAAAA,UAA3C;AAAuDc,UAAAA,OAAvD;AAAgE8C,UAAAA,aAAa,EAAEsB,gBAA/E;AAAiGpB,UAAAA,WAAW,EAAEI,cAA9G;AAA8HL,UAAAA,gBAAgB,EAAEzD,gBAAgB,GAAG+E,mBAAH,GAAyB,EAAzL;AAA6LlE,UAAAA,cAAc,EAAE8C,oBAA7M;AAAmOC,UAAAA;AAAnO,SAAD,CAArB;AACD;;AAED,eAASG,qBAAT,CAA+BrD,OAA/B,EAAwCmD,SAAxC,EAAmD;AACjD5D,QAAAA,KAAK,CAAE,wBAAuB4D,SAAS,CAACI,EAAG,+BAA8BvD,OAAO,CAACO,MAAO,qBAAnF,CAAL;AACA,cAAM+D,cAAc,GAAGnB,SAAS,CAACI,EAAjC;AACA/D,QAAAA,SAAS,CAAE,mBAAkB8E,cAAe,EAAnC,CAAT;AACA,cAAMrC,MAAM,GAAGjC,OAAO,CAACuE,IAAR,CAAa,CAAC;AAACpB,UAAAA;AAAD,SAAD,KAAiBA,SAAS,CAACI,EAAV,KAAiBe,cAA/C,CAAf;AACA9E,QAAAA,SAAS,CAAE,WAAUyC,MAAO,EAAnB,CAAT;;AACA,YAAIA,MAAJ,EAAY;AACV1C,UAAAA,KAAK,CAAE,GAAE4D,SAAS,CAACI,EAAG,uBAAjB,CAAL;AACA,iBAAO,KAAP;AACD;;AACDhE,QAAAA,KAAK,CAAE,GAAE4D,SAAS,CAACI,EAAG,kCAAjB,CAAL;AACA,eAAO,IAAP;AACD;AACF;;AAED,aAAShC,eAAT,CAAyB;AAACvB,MAAAA,OAAD;AAAUd,MAAAA;AAAV,KAAzB,EAAgD;AAC9C,UAAIA,UAAU,IAAIc,OAAO,CAACO,MAAR,IAAkBrB,UAApC,EAAgD;AAC9CK,QAAAA,KAAK,CAAE,6CAA4CL,UAAW,0BAAzD,CAAL;AACA,eAAO,IAAP;AACD;AACF;AACF,GAnQD;AAoQD,C","sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-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 createSearchInterface, * as candidateSearch from './candidate-search';\nimport createDetectionInterface, * as matchDetection from './match-detection';\n\nexport {candidateSearch, matchDetection};\n\nexport default ({detection: detectionOptions, search: searchOptions, maxMatches = 1, maxCandidates = 25, returnStrategy = false, returnQuery = false, returnNonMatches = false}) => {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:index');\n  const debugData = debug.extend('data');\n\n  debugData(`DetectionOptions: ${JSON.stringify(detectionOptions)}`);\n  debugData(`SearchOptions: ${JSON.stringify(searchOptions)}`);\n  debugData(`MaxMatches: ${JSON.stringify(maxMatches)}`);\n  debugData(`MaxCandidates: ${JSON.stringify(maxCandidates)}`);\n  debugData(`ReturnStrategy: ${JSON.stringify(returnStrategy)}`);\n  debugData(`ReturnQuery: ${JSON.stringify(returnQuery)}`);\n  debugData(`ReturnNonMatches: ${JSON.stringify(returnNonMatches)}`);\n\n  const detect = createDetectionInterface(detectionOptions, returnStrategy);\n\n  return record => {\n    const search = createSearchInterface({...searchOptions, record, maxCandidates});\n    return iterate({});\n\n    // candidateCount : amount of candidate records retrived from SRU for matching, NOT including current record set\n    // matches : candidates that have been detected as matches by current matcher job\n    // nonMatches : candidates that have been detected as non-matches by current matcher job (only if returnNonMatches is 'true')\n    // duplicateCount : amount of candidate records that were retrieved from the SRU but not handled further because they were already found in the matches/nonMatches\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 candidate records retrieved from SRU for matching for current query, including the current record 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    async function iterate({initialState = {}, matches = [], candidateCount = 0, nonMatches = [], duplicateCount = 0, nonMatchCount = 0}) {\n      debugData(`Starting next matcher iteration.`);\n      const {records, ...state} = await search(initialState);\n\n      debugData(`Current state: ${JSON.stringify(state)}, matches: ${matches.length}, candidateCount: ${candidateCount}, nonMatches: ${nonMatches.length}`);\n      const recordSetSize = records.length;\n      const newCandidateCount = candidateCount + recordSetSize;\n\n      if (recordSetSize > 0) {\n        return handleRecordSet();\n      }\n\n      if (state.queriesLeft > 0) {\n        debug(`Empty record set ${state.searchCounter} for ${state.query}, but there are ${state.queriesLeft} queries left`);\n        return iterate({initialState: state, matches, candidateCount: newCandidateCount, nonMatches, duplicateCount});\n      }\n\n      debug(`No (more) candidate records to check, no more queries left, matches: ${matches.length}`);\n      return returnResult({matches, state, stopReason: '', nonMatches, candidateCount: newCandidateCount, duplicateCount});\n\n      function handleRecordSet() {\n        debug(`Checking record set of ${recordSetSize} candidate records for possible matches, found by ${state.searchCounter} search for ${state.query}`);\n\n        const matchResult = iterateRecords({records, recordSetSize, maxMatches, matches, nonMatches});\n        const newDuplicateCount = duplicateCount + matchResult.duplicateCount;\n        const newNonMatchCount = nonMatchCount + matchResult.nonMatchCount;\n        const {newMatches, newNonMatches} = handleMatchResult(matchResult, matches, nonMatches);\n\n        if (maxMatchesFound({matches: newMatches, maxMatches})) {\n          return returnResult({matches: newMatches, state, stopReason: 'maxMatches', nonMatches: newNonMatches, duplicateCount: newDuplicateCount, candidateCount: newCandidateCount, nonMatchCount: newNonMatchCount});\n        }\n\n        if (maxCandidatesRetrieved(newCandidateCount, maxCandidates)) {\n          return returnResult({matches: newMatches, state, stopReason: 'maxCandidates', nonMatches: newNonMatches, duplicateCount: newDuplicateCount, candidateCount: newCandidateCount, nonMatchCount: newNonMatchCount});\n        }\n\n        return iterate({initialState: state, matches: newMatches, candidateCount: newCandidateCount, nonMatches: newNonMatches, duplicateCount: newDuplicateCount, nonMatchCount: newNonMatchCount});\n      }\n\n      function handleMatchResult(matchResult, matches, nonMatches) {\n        debugData(`- Amount of new matches from record set: ${matchResult.matches.length}`);\n        // eslint-disable-next-line functional/no-conditional-statement\n        if (returnNonMatches) {\n          debugData(`- Amount of new nonMatches from record set: ${matchResult.nonMatches.length}`);\n        }\n\n        const newMatches = matches.concat(returnQuery ? addQuery(matchResult.matches) : matchResult.matches);\n        const newNonMatches = returnNonMatches ? nonMatches.concat(returnQuery ? addQuery(matchResult.nonMatches) : matchResult.nonMatches) : [];\n\n        debugData(`- Total amount of matches: ${newMatches.length}`);\n        // eslint-disable-next-line functional/no-conditional-statement\n        if (returnNonMatches) {\n          debugData(`- Total amount of nonMatches: ${newNonMatches.length}`);\n        }\n\n        return {newMatches, newNonMatches};\n      }\n\n      function addQuery(matches) {\n        debugData(`Adding query ${state.query} to matches`);\n        return matches.map((match) => ({...match, matchQuery: state.query}));\n      }\n\n      function maxCandidatesRetrieved(candidateCount, maxCandidates) {\n        debugData(`Total amount of candidate records retrieved: ${newCandidateCount} (max: ${maxCandidates})`);\n        if (maxCandidates && candidateCount >= maxCandidates) {\n          debug(`Stopped matching because maximum number of candidate records ${candidateCount} / ${maxCandidates} have been retrieved`);\n          return true;\n        }\n      }\n    }\n\n    // matches : array of matching candidate records\n    // nonMatches : array of nonMatching candidate records (if returnNonMatches option is true, otherwise empty array)\n    // - candidate.id\n    // - candidate.record\n    // - probability\n    // - strategy (if returnStrategy option is true)\n    // - treshold (if returnStrategy option is true)\n    // - matchQuery (if returnQuery option is true)\n\n    // we could have here also returnRecords/returnMatchRecords/returnNonMatchRecord options that could be turned false for not to return actual record data\n\n    // matchStatus.status: boolean, true if matcher retrieved and handled all found candidate records, false if it did not\n    // matchStatus.stopReason: string ('maxMatches','maxCandidates','maxedQueries',empty string/undefined), reason for stopping retrieving or handling the candidate records\n    // - only one stopReason is returned (if there would be several possible stopReasons, stopReason is picked in the above order)\n    // - currently stopReason can be non-empty also in cases where status is true, if matcher hit the stop reason when handling the last available candidate record\n\n    function returnResult({matches, state, stopReason, nonMatches, duplicateCount, candidateCount, nonMatchCount}) {\n      checkCounts({matches, nonMatches, candidateCount, duplicateCount, nonMatchCount});\n      const matchStatus = getMatchState(state, stopReason);\n      // add nonMatches to result only if returnNonMatches is 'true', otherwise nonMatches have not been gathered\n      const result = returnNonMatches ? {matches, matchStatus, nonMatches} : {matches, matchStatus};\n      debugData(`${JSON.stringify(result)}`);\n      return result;\n\n      // note that in cases where the matching has been stopped because of maxMatches checkCounts won't (in most cases) match\n\n      function checkCounts({matches, nonMatches, candidateCount, duplicateCount, nonMatchCount}) {\n        const matchCount = matches.length;\n        debugData(`Return nonMatches: ${returnNonMatches}`);\n        const chosenNonMatchCount = returnNonMatches ? nonMatches.length : nonMatchCount;\n        const totalHandled = matchCount + nonMatchCount + duplicateCount;\n        debug(`candidateCount: ${candidateCount}, matches: ${matchCount}, nonMatches: ${chosenNonMatchCount}, duplicateCount: ${duplicateCount}`);\n        debug(`We got result for ${totalHandled} / ${candidateCount} retrieved candidates`);\n        if (totalHandled !== candidateCount) {\n          debug(`WARNING: Missing results for ${candidateCount - totalHandled} candidates`);\n          return;\n        }\n        return;\n      }\n\n      function getMatchState(state, stopReason) {\n        debugData(`${JSON.stringify(state)}`);\n        debug(`Queries left ${state.queriesLeft}, Searches for current query left: ${state.resultSetOffset && state.resultSetOffset <= state.totalRecords}, non-retrieved records: ${state.totalRecords - state.queryCandidateCounter}, maxedQueries (${state.maxedQueries.length}): ${state.maxedQueries}`);\n\n        debugData(`StopReason: <${stopReason}>`);\n\n        const searchesLeft = state.resultSetOffset && state.resultSetOffset <= state.totalRecords;\n        const nonRetrieved = searchesLeft ? state.totalRecords - state.queryCandidateCounter : 0;\n        debugData(`nonRetrieved: ${nonRetrieved}`);\n\n        if (state.queriesLeft > 0 || nonRetrieved > 0 || state.maxedQueries.length > 0) {\n          const maxedQueriesStopReason = state.maxedQueries.length > 0 ? 'maxedQueries' : '';\n          const newStopReason = stopReason === '' ? maxedQueriesStopReason : stopReason;\n          debugData(`MaxedQueriesStopReason: <${maxedQueriesStopReason}>`);\n          debugData(`NewStopReason: <${newStopReason}>`);\n          debug(`Match status: false`);\n          return {status: false, stopReason: newStopReason};\n        }\n\n        debug(`Match status: true`);\n        return {status: true, stopReason};\n      }\n    }\n\n    function iterateRecords({records, recordSetSize, maxMatches, matches = [], nonMatches = [], recordMatches = [], recordNonMatches = [], recordCount = 0, recordDuplicateCount = 0, recordNonMatchCount = 0}) {\n\n      // recordSetSize : total amount of records in the current record set\n      // recordCount : amount of records from the current record set that have been handled\n      // maxMatches : setting for maximum amount found by current matcher job before the matcher job is stopped\n      // recordDuplicateCount : amount of records from the current record set that are already included in matches/nonMatches results\n      // recordNonMatchCount: amount of records from the current record set that are nonMatches (only is returnNonMatches setting is false)\n\n      // records : non-handled records in the current record set\n      // matches : found matches in the current matcher job\n      // recordMatches : found matches in the current record set\n      // recordNonMatches : found nonMatches in the current record set (only if returnNonMatches setting is true)\n\n      const [candidate] = records;\n      const newRecordCount = candidate ? recordCount + 1 : recordCount;\n\n      // The matcher uses same matchDetection strategy for candidates from all candidate-searches -> matchDetection result for the same candidate is always same\n      // Exceptions would happen if the candidate would have been updated in the database between candidate searches\n      // Note that if returnNonMatches is false, matcher won't remember candidates that didn't match, so they will be matched again everytime they are retrieved by\n      // different candidate search queries. Same candidate search query won't have duplicate records.\n\n      if (candidate) {\n\n        if (candidateNotInMatches(matches.concat(nonMatches), candidate)) {\n          const {record: candidateRecord, id: candidateId} = candidate;\n          debug(`Running matchDetection for record ${candidateId} (${newRecordCount}/${recordSetSize})`);\n          const detectionResult = detect(record, candidateRecord);\n          return handleDetectionResult(detectionResult, candidateId, candidateRecord);\n        }\n        return iterateRecords({records: records.slice(1), recordSetSize, maxMatches, matches, recordMatches, recordCount: newRecordCount, recordNonMatches, recordDuplicateCount: recordDuplicateCount + 1, recordNonMatchCount});\n      }\n\n      debug(`No more candidates, record set (${recordCount}/${recordSetSize}) done, ${recordMatches.length} matches found, ${recordDuplicateCount} candidates already handled, ${returnNonMatches ? `${recordNonMatches.length}` : `${recordNonMatchCount}`} nonMatches found.`);\n      return {matches: recordMatches, nonMatches: returnNonMatches ? recordNonMatches : [], duplicateCount: recordDuplicateCount, nonMatchCount: recordNonMatchCount};\n\n      function handleDetectionResult(detectionResult, candidateId, candidateRecord) {\n        debugData(`MatchDetection results for ${candidateId} (${newRecordCount}/${recordSetSize}): ${JSON.stringify(detectionResult)}`);\n\n        if (detectionResult.match || returnNonMatches) {\n          debug(`${detectionResult.match ? `Record ${candidateId} (${newRecordCount}/${recordSetSize}) is a match!` : `Record ${candidateId} (${newRecordCount}/${recordSetSize}) is NOT a match!`}`);\n          debugData(`Strategy: ${JSON.stringify(detectionResult.strategy)}, Treshold: ${JSON.stringify(detectionResult.treshold)}`);\n\n          const matchResult = {\n            probability: detectionResult.probability,\n            candidate: {\n              id: candidateId,\n              record: candidateRecord\n            }\n          };\n          const strategyResult = {\n            strategy: detectionResult.strategy,\n            treshold: detectionResult.treshold\n          };\n          const newMatch = returnStrategy ? {...matchResult, ...strategyResult} : {...matchResult};\n\n          debugData(`${JSON.stringify(newMatch)}`);\n\n          return handleRecordMatch(detectionResult.match, newMatch);\n        }\n\n        const newRecordNonMatchCount = recordNonMatchCount + 1;\n        debugData(`- Total nonMatches after this detection: ${newRecordNonMatchCount}`);\n\n        return iterateRecords({records: records.slice(1), recordSetSize, maxMatches, matches, recordMatches, recordCount: newRecordCount, recordNonMatches, recordDuplicateCount, recordNonMatchCount: newRecordNonMatchCount});\n      }\n\n      function handleRecordMatch(isMatch, newMatch) {\n        const newRecordMatches = isMatch ? recordMatches.concat(newMatch) : recordMatches;\n        const newRecordNonMatches = isMatch ? recordNonMatches : recordNonMatches.concat(newMatch);\n\n        debugData(`- Total matches after this detection: ${matches.concat(newRecordMatches).length} (max: ${maxMatches})`);\n\n        // eslint-disable-next-line functional/no-conditional-statement\n        if (returnNonMatches) {\n          debugData(`- Total nonMatches after this detection: ${nonMatches.concat(newRecordNonMatches).length}`);\n        }\n\n        if (maxMatchesFound({matches: matches.concat(newRecordMatches), maxMatches})) {\n          debug(`MaxMatches (${maxMatches}) reached, handled candidates in record set: ${newRecordCount} non-handled candidates in record set ${recordSetSize - newRecordCount}`);\n          return {matches: newRecordMatches, nonMatches: returnNonMatches ? newRecordNonMatches : [], duplicateCount: recordDuplicateCount, nonMatchCount: recordNonMatchCount};\n        }\n\n        return iterateRecords({records: records.slice(1), recordSetSize, maxMatches, matches, recordMatches: newRecordMatches, recordCount: newRecordCount, recordNonMatches: returnNonMatches ? newRecordNonMatches : [], duplicateCount: recordDuplicateCount, recordNonMatchCount});\n      }\n\n      function candidateNotInMatches(matches, candidate) {\n        debug(`Checking that record ${candidate.id} is not already included in ${matches.length} matches/nonMatches`);\n        const newCandidateId = candidate.id;\n        debugData(`newCandidateId: ${newCandidateId}`);\n        const result = matches.find(({candidate}) => candidate.id === newCandidateId);\n        debugData(`Result: ${result}`);\n        if (result) {\n          debug(`${candidate.id} was already handled.`);\n          return false;\n        }\n        debug(`${candidate.id} not found in matches/nonMatches`);\n        return true;\n      }\n    }\n\n    function maxMatchesFound({matches, maxMatches}) {\n      if (maxMatches && matches.length >= maxMatches) {\n        debug(`Stopping recordSet iteration: maxMatches (${maxMatches}) for matcher job found.`);\n        return true;\n      }\n    }\n  };\n};\n"],"file":"index.js"}