@natlibfi/melinda-record-matching 4.4.0-alpha.1 → 5.0.0-alpha.2

package/dist/index.js.map

@@ -1 +1,7 @@
-{"version":3,"file":"index.js","names":["_debug","_interopRequireDefault","require","_candidateSearch","_interopRequireWildcard","candidateSearch","exports","_matchDetection","matchDetection","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","prototype","hasOwnProperty","call","i","set","obj","_default","detection","detectionOptions","search","searchOptions","maxMatches","maxCandidates","returnStrategy","returnQuery","returnNonMatches","returnFailures","debug","createDebugLogger","debugData","extend","JSON","stringify","detect","createDetectionInterface","record","recordExternal","recordSource","label","createSearchInterface","iterate","initialState","matches","candidateCount","nonMatches","duplicateCount","nonMatchCount","conversionFailures","matchErrors","records","failures","state","length","recordSetSize","failureSetSize","newCandidateCount","newConversionFailures","concat","handleRecordSet","queriesLeft","searchCounter","query","returnResult","stopReason","matchResult","iterateRecords","newDuplicateCount","newNonMatchCount","newMatches","newNonMatches","newMatchErrors","handleMatchResult","maxMatchesFound","maxCandidatesRetrieved","addQuery","map","match","matchQuery","conversionFailureCount","matchErrorCount","checkCounts","matchStatus","getMatchState","matchesResult","result","matchCount","chosenNonMatchCount","totalHandled","conversionFailuresCount","resultSetOffset","totalRecords","queryCandidateCounter","maxedQueries","searchesLeft","nonRetrieved","maxedQueriesStopReason","undefined","conversionFailuresStopReason","matchErrorsStopReason","newStopReason","status","recordMatches","recordNonMatches","recordCount","recordDuplicateCount","recordNonMatchCount","recordMatchErrors","candidate","newRecordCount","candidateNotInMatches","candidateRecord","id","candidateId","recordBExternal","detectionResult","recordA","recordB","recordAExternal","handleDetectionResult","error","matchError","payload","message","newRecordMatchErrors","slice","strategy","treshold","probability","strategyResult","newMatch","handleRecordMatch","newRecordNonMatchCount","isMatch","newRecordMatches","newRecordNonMatches","newCandidateId","find"],"sources":["../src/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 createSearchInterface, * as candidateSearch from './candidate-search';\nimport createDetectionInterface, * as matchDetection from './match-detection';\n//import inspect from 'util';\n\nexport {candidateSearch, matchDetection};\n\nexport default ({detection: detectionOptions, search: searchOptions, maxMatches = 1, maxCandidates = 25, returnStrategy = false, returnQuery = false, returnNonMatches = false, returnFailures = 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  debugData(`ReturnFailures: ${JSON.stringify(returnFailures)}`);\n\n\n  const detect = createDetectionInterface(detectionOptions, returnStrategy);\n\n  return ({record, recordExternal = {recordSource: 'incomingRecord', label: 'ic'}}) => {\n\n    const search = createSearchInterface({...searchOptions, record, maxCandidates, recordExternal});\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, conversionFailures = [], matchErrors = []}) {\n      debugData(`Starting next matcher iteration.`);\n      const {records, failures, ...state} = await search(initialState);\n\n      debugData(`Current state: ${JSON.stringify(state)}, matches: ${matches.length}, candidateCount: ${candidateCount}, nonMatches: ${nonMatches.length}, nonMatchCount: ${nonMatchCount}, conversionFailures: ${conversionFailures}, matchErrors: ${matchErrors.length}`);\n      const recordSetSize = records.length;\n      const failureSetSize = failures.length;\n      const newCandidateCount = candidateCount + recordSetSize + failureSetSize;\n\n      const newConversionFailures = conversionFailures.concat(failures);\n      debugData(`Failures: ${failures.length}, ConversionFailures: ${conversionFailures.length}, NewConversionFailures: ${newConversionFailures.length}`);\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, nonMatchCount, duplicateCount, conversionFailures: newConversionFailures, matchErrors});\n      }\n\n      debug(`No (more) candidate records to check, no more queries left, matches: ${matches.length}`);\n      return returnResult({matches, state, stopReason: '', nonMatches, nonMatchCount, candidateCount: newCandidateCount, duplicateCount, conversionFailures: newConversionFailures, matchErrors});\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, nonMatchCount});\n\n        const newDuplicateCount = duplicateCount + matchResult.duplicateCount;\n        const newNonMatchCount = nonMatchCount + matchResult.nonMatchCount;\n        const {newMatches, newNonMatches, newMatchErrors} = handleMatchResult(matchResult, matches, nonMatches, matchErrors);\n\n        if (maxMatchesFound({matches: newMatches, maxMatches})) {\n          return returnResult({matches: newMatches, state, stopReason: 'maxMatches', nonMatches: newNonMatches, duplicateCount: newDuplicateCount, candidateCount: newCandidateCount, nonMatchCount: newNonMatchCount, conversionFailures: newConversionFailures, matchErrors: newMatchErrors});\n        }\n\n        if (maxCandidatesRetrieved(newCandidateCount, maxCandidates)) {\n          return returnResult({matches: newMatches, state, stopReason: 'maxCandidates', nonMatches: newNonMatches, duplicateCount: newDuplicateCount, candidateCount: newCandidateCount, nonMatchCount: newNonMatchCount, conversionFailures: newConversionFailures, matchErrors: newMatchErrors});\n        }\n\n        return iterate({initialState: state, matches: newMatches, candidateCount: newCandidateCount, nonMatches: newNonMatches, duplicateCount: newDuplicateCount, nonMatchCount: newNonMatchCount, conversionFailures: newConversionFailures, matchErrors: newMatchErrors});\n      }\n\n      function handleMatchResult(matchResult, matches, nonMatches, matchErrors) {\n        debugData(`- Amount of new matches from record set: ${matchResult.matches.length}`);\n        // eslint-disable-next-line functional/no-conditional-statements\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        const newMatchErrors = matchErrors.concat(matchResult.matchErrors);\n\n        debugData(`- Total amount of matches: ${newMatches.length}`);\n        // eslint-disable-next-line functional/no-conditional-statements\n        if (returnNonMatches) {\n          debugData(`- Total amount of nonMatches: ${newNonMatches.length}`);\n        }\n\n        debugData(`MatchResult: ${JSON.stringify(matchResult)}`);\n        debugData(`Old matchErrors: ${JSON.stringify(matchErrors)}, matchErrors from matchResult: ${JSON.stringify(matchResult.matchErrors)}, New matchErrors: ${JSON.stringify(newMatchErrors)}`);\n\n        debugData(`- Total amount of matchErrors: ${newMatchErrors.length}`);\n\n        return {newMatches, newNonMatches, newMatchErrors};\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    // failures: array of conversionFailures from candidate-search and matchErrors from matchDetection in error format {status, payload: {message, id}} if returnFailures 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','conversionFailures', 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, conversionFailures, matchErrors}) {\n      const conversionFailureCount = conversionFailures.length;\n      const matchErrorCount = matchErrors.length;\n      checkCounts({matches, nonMatches, candidateCount, duplicateCount, nonMatchCount, conversionFailureCount, matchErrorCount});\n      const matchStatus = getMatchState(state, stopReason, conversionFailureCount, matchErrorCount);\n      // add nonMatches to result only if returnNonMatches is 'true', otherwise nonMatches have not been gathered\n      const matchesResult = returnNonMatches ? {matches, matchStatus, nonMatches, candidateCount} : {matches, matchStatus, candidateCount};\n      const failures = [...conversionFailures, ...matchErrors];\n      const result = returnFailures ? {...matchesResult, conversionFailures: failures} : matchesResult;\n      debugData(`ReturnFailures ${returnFailures}`);\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, conversionFailureCount, matchErrorCount}) {\n        const matchCount = matches.length;\n        debugData(`Return nonMatches: ${returnNonMatches}`);\n        const chosenNonMatchCount = returnNonMatches ? nonMatches.length : nonMatchCount;\n        const totalHandled = matchCount + chosenNonMatchCount + duplicateCount;\n        debug(`candidateCount: ${candidateCount}, matches: ${matchCount}, nonMatches: ${chosenNonMatchCount}, duplicateCount: ${duplicateCount}, conversionFailureCount: ${conversionFailureCount}, matchErrorCount: ${matchErrorCount}`);\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      // eslint-disable-next-line max-statements\n      function getMatchState(state, stopReason, conversionFailuresCount, matchErrorCount) {\n        debugData(`${JSON.stringify(state)}`);\n        debug(`We had ${conversionFailuresCount} retrieved candidates that could not be converted.`);\n        debug(`We had ${matchErrorCount} retrieved candidates that errored in matchDetection.`);\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        // matchStatus.stopReason: string ('maxMatches','maxCandidates','maxedQueries','conversionFailures', empty string/undefined), reason for stopping retrieving or handling the candidate records\n        // 'maxMatches' and 'maxCandidates' are in stopReason, 'maxedQueries', 'conversionFailures' and 'matchErrors' are created here\n\n        if (state.queriesLeft > 0 || nonRetrieved > 0 || state.maxedQueries.length > 0 || conversionFailureCount > 0 || matchErrorCount > 0) {\n          const maxedQueriesStopReason = state.maxedQueries.length > 0 ? 'maxedQueries' : undefined;\n          const conversionFailuresStopReason = conversionFailureCount > 0 ? 'conversionFailures' : undefined;\n          const matchErrorsStopReason = matchErrorCount > 0 ? 'matchErrors' : undefined;\n          const newStopReason = stopReason === '' || stopReason === undefined ? maxedQueriesStopReason || conversionFailuresStopReason || matchErrorsStopReason : stopReason;\n          debugData(`MaxedQueriesStopReason: <${maxedQueriesStopReason}>`);\n          debugData(`ConversionFailureStopReason <${conversionFailuresStopReason}>`);\n          debugData(`MatchErrorsStopReason <${matchErrorsStopReason}>`);\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    // NOTES:\n    // - we could optimize by creating the featureSet for the incoming record once and using it for all database/candidateRecords\n    // - if creating the featureSet for the incoming record fails we have an unprocessable entity\n    // - if creating the featureSet for a candidate record fails we could skip that candidate - but list the case as a detectionFailure, same as conversionFailures\n\n    function iterateRecords({records, recordSetSize, maxMatches, matches = [], nonMatches = [], recordMatches = [], recordNonMatches = [], recordCount = 0, recordDuplicateCount = 0, recordNonMatchCount = 0, recordMatchErrors = []}) {\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      // recordMatchErrors: errored matchDetection in the current record set\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      /* We could optimize and detect all retrieved candidates at once\n      const candidateRecords = records.map(record => record.record);\n      const recordsIsArray = Array.isArray(candidateRecords);\n      debug(`records is an array: ${recordsIsArray}`);\n      const result = detect(record, candidateRecords);\n      debugData(`${JSON.stringify(result)}`);\n      */\n\n      if (candidate) {\n\n        // eslint-disable-next-line functional/no-conditional-statements\n        if (candidateNotInMatches(matches.concat(nonMatches), candidate)) {\n          const {record: candidateRecord, id: candidateId} = candidate;\n          const recordBExternal = {id: candidate.id, recordSource: 'databaseRecord', label: `db-${candidate.id}`};\n          try {\n            debug(`Running matchDetection for record ${candidateId} (${newRecordCount}/${recordSetSize})`);\n            // we should handle errors from detection somehow - ie. cases where either record or candidateRecord errors\n            const detectionResult = detect({recordA: record, recordB: candidateRecord, recordAExternal: recordExternal, recordBExternal});\n\n            return handleDetectionResult(detectionResult, candidateId, candidateRecord);\n          } catch (error) {\n            debug(`MatchDetection errored: database record ${candidateId}: ${error}`);\n\n            const matchError = {status: 422, payload: {message: `Matching errored for database record ${candidateId}. ${error.message}.`, id: candidateId}};\n            const newRecordMatchErrors = recordMatchErrors.concat(matchError);\n            return iterateRecords({records: records.slice(1), recordSetSize, maxMatches, matches, recordMatches, recordCount: newRecordCount, recordNonMatches, recordDuplicateCount, recordNonMatchCount, recordMatchErrors: newRecordMatchErrors});\n          }\n        }\n\n        return iterateRecords({records: records.slice(1), recordSetSize, maxMatches, matches, recordMatches, recordCount: newRecordCount, recordNonMatches, recordDuplicateCount: recordDuplicateCount + 1, recordNonMatchCount, recordMatchErrors});\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, matchErrors: recordMatchErrors};\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, recordMatchErrors});\n      }\n\n      function handleRecordMatch(isMatch, newMatch) {\n        const newRecordMatches = isMatch ? recordMatches.concat(newMatch) : recordMatches;\n        const newRecordNonMatches = isMatch ? recordNonMatches : recordNonMatches.concat(newMatch);\n        const newRecordNonMatchCount = isMatch ? recordNonMatchCount : recordNonMatchCount + 1;\n\n        debugData(`- Total matches after this detection: ${matches.concat(newRecordMatches).length} (max: ${maxMatches})`);\n\n        // eslint-disable-next-line functional/no-conditional-statements\n        if (returnNonMatches) {\n          debugData(`- Total nonMatches after this detection: ${nonMatches.concat(newRecordNonMatches).length}`);\n        }\n        debugData(`- Total nonMatchCount after this detection: ${recordNonMatchCount}`);\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: newRecordNonMatchCount, matchErrors: recordMatchErrors};\n        }\n\n        return iterateRecords({records: records.slice(1), recordSetSize, maxMatches, matches, recordMatches: newRecordMatches, recordCount: newRecordCount, recordNonMatches: returnNonMatches ? newRecordNonMatches : [], duplicateCount: recordDuplicateCount, recordNonMatchCount: newRecordNonMatchCount, matchErrors: recordMatchErrors});\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"],"mappings":";;;;;;AA4BA,IAAAA,MAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,gBAAA,GAAAC,uBAAA,CAAAF,OAAA;AAA6E,IAAAG,eAAA,GAAAF,gBAAA;AAAAG,OAAA,CAAAD,eAAA,GAAAF,gBAAA;AAC7E,IAAAI,eAAA,GAAAH,uBAAA,CAAAF,OAAA;AAA8E,IAAAM,cAAA,GAAAD,eAAA;AAAAD,OAAA,CAAAE,cAAA,GAAAD,eAAA;AAAA,SAAAE,yBAAAC,CAAA,6BAAAC,OAAA,mBAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,CAAA,WAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA,KAAAF,CAAA;AAAA,SAAAN,wBAAAM,CAAA,EAAAE,CAAA,SAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA,eAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,WAAAK,OAAA,EAAAL,CAAA,QAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA,OAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA,OAAAQ,CAAA,KAAAC,SAAA,UAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,IAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAjB,CAAA,EAAAc,CAAA,SAAAI,CAAA,GAAAR,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA,UAAAI,CAAA,KAAAA,CAAA,CAAAX,GAAA,IAAAW,CAAA,CAAAC,GAAA,IAAAR,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAI,CAAA,IAAAV,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA,YAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAgB,GAAA,CAAAnB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAAA,SAAAjB,uBAAA6B,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAhB,UAAA,GAAAgB,GAAA,KAAAf,OAAA,EAAAe,GAAA;AA9B9E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAKA;AAAA,IAAAC,QAAA,GAIeA,CAAC;EAACC,SAAS,EAAEC,gBAAgB;EAAEC,MAAM,EAAEC,aAAa;EAAEC,UAAU,GAAG,CAAC;EAAEC,aAAa,GAAG,EAAE;EAAEC,cAAc,GAAG,KAAK;EAAEC,WAAW,GAAG,KAAK;EAAEC,gBAAgB,GAAG,KAAK;EAAEC,cAAc,GAAG;AAAK,CAAC,KAAK;EAC1M,MAAMC,KAAK,GAAG,IAAAC,cAAiB,EAAC,yCAAyC,CAAC;EAC1E,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;EAEtCD,SAAS,CAAE,qBAAoBE,IAAI,CAACC,SAAS,CAACd,gBAAgB,CAAE,EAAC,CAAC;EAClEW,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAS,CAACZ,aAAa,CAAE,EAAC,CAAC;EAC5DS,SAAS,CAAE,eAAcE,IAAI,CAACC,SAAS,CAACX,UAAU,CAAE,EAAC,CAAC;EACtDQ,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAS,CAACV,aAAa,CAAE,EAAC,CAAC;EAC5DO,SAAS,CAAE,mBAAkBE,IAAI,CAACC,SAAS,CAACT,cAAc,CAAE,EAAC,CAAC;EAC9DM,SAAS,CAAE,gBAAeE,IAAI,CAACC,SAAS,CAACR,WAAW,CAAE,EAAC,CAAC;EACxDK,SAAS,CAAE,qBAAoBE,IAAI,CAACC,SAAS,CAACP,gBAAgB,CAAE,EAAC,CAAC;EAClEI,SAAS,CAAE,mBAAkBE,IAAI,CAACC,SAAS,CAACN,cAAc,CAAE,EAAC,CAAC;EAG9D,MAAMO,MAAM,GAAG,IAAAC,uBAAwB,EAAChB,gBAAgB,EAAEK,cAAc,CAAC;EAEzE,OAAO,CAAC;IAACY,MAAM;IAAEC,cAAc,GAAG;MAACC,YAAY,EAAE,gBAAgB;MAAEC,KAAK,EAAE;IAAI;EAAC,CAAC,KAAK;IAEnF,MAAMnB,MAAM,GAAG,IAAAoB,wBAAqB,EAAC;MAAC,GAAGnB,aAAa;MAAEe,MAAM;MAAEb,aAAa;MAAEc;IAAc,CAAC,CAAC;IAC/F,OAAOI,OAAO,CAAC,CAAC,CAAC,CAAC;;IAElB;IACA;IACA;IACA;;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;;IAEA,eAAeA,OAAOA,CAAC;MAACC,YAAY,GAAG,CAAC,CAAC;MAAEC,OAAO,GAAG,EAAE;MAAEC,cAAc,GAAG,CAAC;MAAEC,UAAU,GAAG,EAAE;MAAEC,cAAc,GAAG,CAAC;MAAEC,aAAa,GAAG,CAAC;MAAEC,kBAAkB,GAAG,EAAE;MAAEC,WAAW,GAAG;IAAE,CAAC,EAAE;MAC/KnB,SAAS,CAAE,kCAAiC,CAAC;MAC7C,MAAM;QAACoB,OAAO;QAAEC,QAAQ;QAAE,GAAGC;MAAK,CAAC,GAAG,MAAMhC,MAAM,CAACsB,YAAY,CAAC;MAEhEZ,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAS,CAACmB,KAAK,CAAE,cAAaT,OAAO,CAACU,MAAO,qBAAoBT,cAAe,iBAAgBC,UAAU,CAACQ,MAAO,oBAAmBN,aAAc,yBAAwBC,kBAAmB,kBAAiBC,WAAW,CAACI,MAAO,EAAC,CAAC;MACrQ,MAAMC,aAAa,GAAGJ,OAAO,CAACG,MAAM;MACpC,MAAME,cAAc,GAAGJ,QAAQ,CAACE,MAAM;MACtC,MAAMG,iBAAiB,GAAGZ,cAAc,GAAGU,aAAa,GAAGC,cAAc;MAEzE,MAAME,qBAAqB,GAAGT,kBAAkB,CAACU,MAAM,CAACP,QAAQ,CAAC;MACjErB,SAAS,CAAE,aAAYqB,QAAQ,CAACE,MAAO,yBAAwBL,kBAAkB,CAACK,MAAO,4BAA2BI,qBAAqB,CAACJ,MAAO,EAAC,CAAC;MAEnJ,IAAIC,aAAa,GAAG,CAAC,EAAE;QACrB,OAAOK,eAAe,CAAC,CAAC;MAC1B;MAEA,IAAIP,KAAK,CAACQ,WAAW,GAAG,CAAC,EAAE;QACzBhC,KAAK,CAAE,oBAAmBwB,KAAK,CAACS,aAAc,QAAOT,KAAK,CAACU,KAAM,mBAAkBV,KAAK,CAACQ,WAAY,eAAc,CAAC;QACpH,OAAOnB,OAAO,CAAC;UAACC,YAAY,EAAEU,KAAK;UAAET,OAAO;UAAEC,cAAc,EAAEY,iBAAiB;UAAEX,UAAU;UAAEE,aAAa;UAAED,cAAc;UAAEE,kBAAkB,EAAES,qBAAqB;UAAER;QAAW,CAAC,CAAC;MACtL;MAEArB,KAAK,CAAE,wEAAuEe,OAAO,CAACU,MAAO,EAAC,CAAC;MAC/F,OAAOU,YAAY,CAAC;QAACpB,OAAO;QAAES,KAAK;QAAEY,UAAU,EAAE,EAAE;QAAEnB,UAAU;QAAEE,aAAa;QAAEH,cAAc,EAAEY,iBAAiB;QAAEV,cAAc;QAAEE,kBAAkB,EAAES,qBAAqB;QAAER;MAAW,CAAC,CAAC;MAE3L,SAASU,eAAeA,CAAA,EAAG;QACzB/B,KAAK,CAAE,0BAAyB0B,aAAc,qDAAoDF,KAAK,CAACS,aAAc,eAAcT,KAAK,CAACU,KAAM,EAAC,CAAC;QAElJ,MAAMG,WAAW,GAAGC,cAAc,CAAC;UAAChB,OAAO;UAAEI,aAAa;UAAEhC,UAAU;UAAEqB,OAAO;UAAEE,UAAU;UAAEE;QAAa,CAAC,CAAC;QAE5G,MAAMoB,iBAAiB,GAAGrB,cAAc,GAAGmB,WAAW,CAACnB,cAAc;QACrE,MAAMsB,gBAAgB,GAAGrB,aAAa,GAAGkB,WAAW,CAAClB,aAAa;QAClE,MAAM;UAACsB,UAAU;UAAEC,aAAa;UAAEC;QAAc,CAAC,GAAGC,iBAAiB,CAACP,WAAW,EAAEtB,OAAO,EAAEE,UAAU,EAAEI,WAAW,CAAC;QAEpH,IAAIwB,eAAe,CAAC;UAAC9B,OAAO,EAAE0B,UAAU;UAAE/C;QAAU,CAAC,CAAC,EAAE;UACtD,OAAOyC,YAAY,CAAC;YAACpB,OAAO,EAAE0B,UAAU;YAAEjB,KAAK;YAAEY,UAAU,EAAE,YAAY;YAAEnB,UAAU,EAAEyB,aAAa;YAAExB,cAAc,EAAEqB,iBAAiB;YAAEvB,cAAc,EAAEY,iBAAiB;YAAET,aAAa,EAAEqB,gBAAgB;YAAEpB,kBAAkB,EAAES,qBAAqB;YAAER,WAAW,EAAEsB;UAAc,CAAC,CAAC;QACvR;QAEA,IAAIG,sBAAsB,CAAClB,iBAAiB,EAAEjC,aAAa,CAAC,EAAE;UAC5D,OAAOwC,YAAY,CAAC;YAACpB,OAAO,EAAE0B,UAAU;YAAEjB,KAAK;YAAEY,UAAU,EAAE,eAAe;YAAEnB,UAAU,EAAEyB,aAAa;YAAExB,cAAc,EAAEqB,iBAAiB;YAAEvB,cAAc,EAAEY,iBAAiB;YAAET,aAAa,EAAEqB,gBAAgB;YAAEpB,kBAAkB,EAAES,qBAAqB;YAAER,WAAW,EAAEsB;UAAc,CAAC,CAAC;QAC1R;QAEA,OAAO9B,OAAO,CAAC;UAACC,YAAY,EAAEU,KAAK;UAAET,OAAO,EAAE0B,UAAU;UAAEzB,cAAc,EAAEY,iBAAiB;UAAEX,UAAU,EAAEyB,aAAa;UAAExB,cAAc,EAAEqB,iBAAiB;UAAEpB,aAAa,EAAEqB,gBAAgB;UAAEpB,kBAAkB,EAAES,qBAAqB;UAAER,WAAW,EAAEsB;QAAc,CAAC,CAAC;MACtQ;MAEA,SAASC,iBAAiBA,CAACP,WAAW,EAAEtB,OAAO,EAAEE,UAAU,EAAEI,WAAW,EAAE;QACxEnB,SAAS,CAAE,4CAA2CmC,WAAW,CAACtB,OAAO,CAACU,MAAO,EAAC,CAAC;QACnF;QACA,IAAI3B,gBAAgB,EAAE;UACpBI,SAAS,CAAE,+CAA8CmC,WAAW,CAACpB,UAAU,CAACQ,MAAO,EAAC,CAAC;QAC3F;QAEA,MAAMgB,UAAU,GAAG1B,OAAO,CAACe,MAAM,CAACjC,WAAW,GAAGkD,QAAQ,CAACV,WAAW,CAACtB,OAAO,CAAC,GAAGsB,WAAW,CAACtB,OAAO,CAAC;QACpG,MAAM2B,aAAa,GAAG5C,gBAAgB,GAAGmB,UAAU,CAACa,MAAM,CAACjC,WAAW,GAAGkD,QAAQ,CAACV,WAAW,CAACpB,UAAU,CAAC,GAAGoB,WAAW,CAACpB,UAAU,CAAC,GAAG,EAAE;QACxI,MAAM0B,cAAc,GAAGtB,WAAW,CAACS,MAAM,CAACO,WAAW,CAAChB,WAAW,CAAC;QAElEnB,SAAS,CAAE,8BAA6BuC,UAAU,CAAChB,MAAO,EAAC,CAAC;QAC5D;QACA,IAAI3B,gBAAgB,EAAE;UACpBI,SAAS,CAAE,iCAAgCwC,aAAa,CAACjB,MAAO,EAAC,CAAC;QACpE;QAEAvB,SAAS,CAAE,gBAAeE,IAAI,CAACC,SAAS,CAACgC,WAAW,CAAE,EAAC,CAAC;QACxDnC,SAAS,CAAE,oBAAmBE,IAAI,CAACC,SAAS,CAACgB,WAAW,CAAE,mCAAkCjB,IAAI,CAACC,SAAS,CAACgC,WAAW,CAAChB,WAAW,CAAE,sBAAqBjB,IAAI,CAACC,SAAS,CAACsC,cAAc,CAAE,EAAC,CAAC;QAE1LzC,SAAS,CAAE,kCAAiCyC,cAAc,CAAClB,MAAO,EAAC,CAAC;QAEpE,OAAO;UAACgB,UAAU;UAAEC,aAAa;UAAEC;QAAc,CAAC;MACpD;MAEA,SAASI,QAAQA,CAAChC,OAAO,EAAE;QACzBb,SAAS,CAAE,gBAAesB,KAAK,CAACU,KAAM,aAAY,CAAC;QACnD,OAAOnB,OAAO,CAACiC,GAAG,CAAEC,KAAK,KAAM;UAAC,GAAGA,KAAK;UAAEC,UAAU,EAAE1B,KAAK,CAACU;QAAK,CAAC,CAAC,CAAC;MACtE;MAEA,SAASY,sBAAsBA,CAAC9B,cAAc,EAAErB,aAAa,EAAE;QAC7DO,SAAS,CAAE,gDAA+C0B,iBAAkB,UAASjC,aAAc,GAAE,CAAC;QACtG,IAAIA,aAAa,IAAIqB,cAAc,IAAIrB,aAAa,EAAE;UACpDK,KAAK,CAAE,gEAA+DgB,cAAe,MAAKrB,aAAc,sBAAqB,CAAC;UAC9H,OAAO,IAAI;QACb;MACF;IACF;;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;;IAEA;;IAEA;IACA;IACA;IACA;;IAEA,SAASwC,YAAYA,CAAC;MAACpB,OAAO;MAAES,KAAK;MAAEY,UAAU;MAAEnB,UAAU;MAAEC,cAAc;MAAEF,cAAc;MAAEG,aAAa;MAAEC,kBAAkB;MAAEC;IAAW,CAAC,EAAE;MAC9I,MAAM8B,sBAAsB,GAAG/B,kBAAkB,CAACK,MAAM;MACxD,MAAM2B,eAAe,GAAG/B,WAAW,CAACI,MAAM;MAC1C4B,WAAW,CAAC;QAACtC,OAAO;QAAEE,UAAU;QAAED,cAAc;QAAEE,cAAc;QAAEC,aAAa;QAAEgC,sBAAsB;QAAEC;MAAe,CAAC,CAAC;MAC1H,MAAME,WAAW,GAAGC,aAAa,CAAC/B,KAAK,EAAEY,UAAU,EAAEe,sBAAsB,EAAEC,eAAe,CAAC;MAC7F;MACA,MAAMI,aAAa,GAAG1D,gBAAgB,GAAG;QAACiB,OAAO;QAAEuC,WAAW;QAAErC,UAAU;QAAED;MAAc,CAAC,GAAG;QAACD,OAAO;QAAEuC,WAAW;QAAEtC;MAAc,CAAC;MACpI,MAAMO,QAAQ,GAAG,CAAC,GAAGH,kBAAkB,EAAE,GAAGC,WAAW,CAAC;MACxD,MAAMoC,MAAM,GAAG1D,cAAc,GAAG;QAAC,GAAGyD,aAAa;QAAEpC,kBAAkB,EAAEG;MAAQ,CAAC,GAAGiC,aAAa;MAChGtD,SAAS,CAAE,kBAAiBH,cAAe,EAAC,CAAC;MAC7CG,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAS,CAACoD,MAAM,CAAE,EAAC,CAAC;MACtC,OAAOA,MAAM;;MAEb;;MAEA,SAASJ,WAAWA,CAAC;QAACtC,OAAO;QAAEE,UAAU;QAAED,cAAc;QAAEE,cAAc;QAAEC,aAAa;QAAEgC,sBAAsB;QAAEC;MAAe,CAAC,EAAE;QAClI,MAAMM,UAAU,GAAG3C,OAAO,CAACU,MAAM;QACjCvB,SAAS,CAAE,sBAAqBJ,gBAAiB,EAAC,CAAC;QACnD,MAAM6D,mBAAmB,GAAG7D,gBAAgB,GAAGmB,UAAU,CAACQ,MAAM,GAAGN,aAAa;QAChF,MAAMyC,YAAY,GAAGF,UAAU,GAAGC,mBAAmB,GAAGzC,cAAc;QACtElB,KAAK,CAAE,mBAAkBgB,cAAe,cAAa0C,UAAW,iBAAgBC,mBAAoB,qBAAoBzC,cAAe,6BAA4BiC,sBAAuB,sBAAqBC,eAAgB,EAAC,CAAC;QACjOpD,KAAK,CAAE,qBAAoB4D,YAAa,MAAK5C,cAAe,uBAAsB,CAAC;QACnF,IAAI4C,YAAY,KAAK5C,cAAc,EAAE;UACnChB,KAAK,CAAE,gCAA+BgB,cAAc,GAAG4C,YAAa,aAAY,CAAC;UACjF;QACF;QACA;MACF;;MAEA;MACA,SAASL,aAAaA,CAAC/B,KAAK,EAAEY,UAAU,EAAEyB,uBAAuB,EAAET,eAAe,EAAE;QAClFlD,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAS,CAACmB,KAAK,CAAE,EAAC,CAAC;QACrCxB,KAAK,CAAE,UAAS6D,uBAAwB,oDAAmD,CAAC;QAC5F7D,KAAK,CAAE,UAASoD,eAAgB,uDAAsD,CAAC;QACvFpD,KAAK,CAAE,gBAAewB,KAAK,CAACQ,WAAY,sCAAqCR,KAAK,CAACsC,eAAe,IAAItC,KAAK,CAACsC,eAAe,IAAItC,KAAK,CAACuC,YAAa,4BAA2BvC,KAAK,CAACuC,YAAY,GAAGvC,KAAK,CAACwC,qBAAsB,mBAAkBxC,KAAK,CAACyC,YAAY,CAACxC,MAAO,MAAKD,KAAK,CAACyC,YAAa,EAAC,CAAC;QAEpS/D,SAAS,CAAE,gBAAekC,UAAW,GAAE,CAAC;QAExC,MAAM8B,YAAY,GAAG1C,KAAK,CAACsC,eAAe,IAAItC,KAAK,CAACsC,eAAe,IAAItC,KAAK,CAACuC,YAAY;QACzF,MAAMI,YAAY,GAAGD,YAAY,GAAG1C,KAAK,CAACuC,YAAY,GAAGvC,KAAK,CAACwC,qBAAqB,GAAG,CAAC;QACxF9D,SAAS,CAAE,iBAAgBiE,YAAa,EAAC,CAAC;;QAE1C;QACA;;QAEA,IAAI3C,KAAK,CAACQ,WAAW,GAAG,CAAC,IAAImC,YAAY,GAAG,CAAC,IAAI3C,KAAK,CAACyC,YAAY,CAACxC,MAAM,GAAG,CAAC,IAAI0B,sBAAsB,GAAG,CAAC,IAAIC,eAAe,GAAG,CAAC,EAAE;UACnI,MAAMgB,sBAAsB,GAAG5C,KAAK,CAACyC,YAAY,CAACxC,MAAM,GAAG,CAAC,GAAG,cAAc,GAAG4C,SAAS;UACzF,MAAMC,4BAA4B,GAAGnB,sBAAsB,GAAG,CAAC,GAAG,oBAAoB,GAAGkB,SAAS;UAClG,MAAME,qBAAqB,GAAGnB,eAAe,GAAG,CAAC,GAAG,aAAa,GAAGiB,SAAS;UAC7E,MAAMG,aAAa,GAAGpC,UAAU,KAAK,EAAE,IAAIA,UAAU,KAAKiC,SAAS,GAAGD,sBAAsB,IAAIE,4BAA4B,IAAIC,qBAAqB,GAAGnC,UAAU;UAClKlC,SAAS,CAAE,4BAA2BkE,sBAAuB,GAAE,CAAC;UAChElE,SAAS,CAAE,gCAA+BoE,4BAA6B,GAAE,CAAC;UAC1EpE,SAAS,CAAE,0BAAyBqE,qBAAsB,GAAE,CAAC;UAC7DrE,SAAS,CAAE,mBAAkBsE,aAAc,GAAE,CAAC;UAC9CxE,KAAK,CAAE,qBAAoB,CAAC;UAC5B,OAAO;YAACyE,MAAM,EAAE,KAAK;YAAErC,UAAU,EAAEoC;UAAa,CAAC;QACnD;QAEAxE,KAAK,CAAE,oBAAmB,CAAC;QAC3B,OAAO;UAACyE,MAAM,EAAE,IAAI;UAAErC;QAAU,CAAC;MACnC;IACF;;IAEA;IACA;IACA;IACA;;IAEA,SAASE,cAAcA,CAAC;MAAChB,OAAO;MAAEI,aAAa;MAAEhC,UAAU;MAAEqB,OAAO,GAAG,EAAE;MAAEE,UAAU,GAAG,EAAE;MAAEyD,aAAa,GAAG,EAAE;MAAEC,gBAAgB,GAAG,EAAE;MAAEC,WAAW,GAAG,CAAC;MAAEC,oBAAoB,GAAG,CAAC;MAAEC,mBAAmB,GAAG,CAAC;MAAEC,iBAAiB,GAAG;IAAE,CAAC,EAAE;MAElO;MACA;MACA;MACA;MACA;;MAEA;MACA;MACA;MACA;MACA;;MAEA,MAAM,CAACC,SAAS,CAAC,GAAG1D,OAAO;MAC3B,MAAM2D,cAAc,GAAGD,SAAS,GAAGJ,WAAW,GAAG,CAAC,GAAGA,WAAW;;MAEhE;MACA;MACA;MACA;;MAEA;AACN;AACA;AACA;AACA;AACA;AACA;;MAEM,IAAII,SAAS,EAAE;QAEb;QACA,IAAIE,qBAAqB,CAACnE,OAAO,CAACe,MAAM,CAACb,UAAU,CAAC,EAAE+D,SAAS,CAAC,EAAE;UAChE,MAAM;YAACxE,MAAM,EAAE2E,eAAe;YAAEC,EAAE,EAAEC;UAAW,CAAC,GAAGL,SAAS;UAC5D,MAAMM,eAAe,GAAG;YAACF,EAAE,EAAEJ,SAAS,CAACI,EAAE;YAAE1E,YAAY,EAAE,gBAAgB;YAAEC,KAAK,EAAG,MAAKqE,SAAS,CAACI,EAAG;UAAC,CAAC;UACvG,IAAI;YACFpF,KAAK,CAAE,qCAAoCqF,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,GAAE,CAAC;YAC9F;YACA,MAAM6D,eAAe,GAAGjF,MAAM,CAAC;cAACkF,OAAO,EAAEhF,MAAM;cAAEiF,OAAO,EAAEN,eAAe;cAAEO,eAAe,EAAEjF,cAAc;cAAE6E;YAAe,CAAC,CAAC;YAE7H,OAAOK,qBAAqB,CAACJ,eAAe,EAAEF,WAAW,EAAEF,eAAe,CAAC;UAC7E,CAAC,CAAC,OAAOS,KAAK,EAAE;YACd5F,KAAK,CAAE,2CAA0CqF,WAAY,KAAIO,KAAM,EAAC,CAAC;YAEzE,MAAMC,UAAU,GAAG;cAACpB,MAAM,EAAE,GAAG;cAAEqB,OAAO,EAAE;gBAACC,OAAO,EAAG,wCAAuCV,WAAY,KAAIO,KAAK,CAACG,OAAQ,GAAE;gBAAEX,EAAE,EAAEC;cAAW;YAAC,CAAC;YAC/I,MAAMW,oBAAoB,GAAGjB,iBAAiB,CAACjD,MAAM,CAAC+D,UAAU,CAAC;YACjE,OAAOvD,cAAc,CAAC;cAAChB,OAAO,EAAEA,OAAO,CAAC2E,KAAK,CAAC,CAAC,CAAC;cAAEvE,aAAa;cAAEhC,UAAU;cAAEqB,OAAO;cAAE2D,aAAa;cAAEE,WAAW,EAAEK,cAAc;cAAEN,gBAAgB;cAAEE,oBAAoB;cAAEC,mBAAmB;cAAEC,iBAAiB,EAAEiB;YAAoB,CAAC,CAAC;UAC1O;QACF;QAEA,OAAO1D,cAAc,CAAC;UAAChB,OAAO,EAAEA,OAAO,CAAC2E,KAAK,CAAC,CAAC,CAAC;UAAEvE,aAAa;UAAEhC,UAAU;UAAEqB,OAAO;UAAE2D,aAAa;UAAEE,WAAW,EAAEK,cAAc;UAAEN,gBAAgB;UAAEE,oBAAoB,EAAEA,oBAAoB,GAAG,CAAC;UAAEC,mBAAmB;UAAEC;QAAiB,CAAC,CAAC;MAC9O;MAEA/E,KAAK,CAAE,mCAAkC4E,WAAY,IAAGlD,aAAc,WAAUgD,aAAa,CAACjD,MAAO,mBAAkBoD,oBAAqB,gCAA+B/E,gBAAgB,GAAI,GAAE6E,gBAAgB,CAAClD,MAAO,EAAC,GAAI,GAAEqD,mBAAoB,EAAE,oBAAmB,CAAC;MAC1Q,OAAO;QAAC/D,OAAO,EAAE2D,aAAa;QAAEzD,UAAU,EAAEnB,gBAAgB,GAAG6E,gBAAgB,GAAG,EAAE;QAAEzD,cAAc,EAAE2D,oBAAoB;QAAE1D,aAAa,EAAE2D,mBAAmB;QAAEzD,WAAW,EAAE0D;MAAiB,CAAC;MAE/L,SAASY,qBAAqBA,CAACJ,eAAe,EAAEF,WAAW,EAAEF,eAAe,EAAE;QAC5EjF,SAAS,CAAE,8BAA6BmF,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,MAAKtB,IAAI,CAACC,SAAS,CAACkF,eAAe,CAAE,EAAC,CAAC;QAE/H,IAAIA,eAAe,CAACtC,KAAK,IAAInD,gBAAgB,EAAE;UAC7CE,KAAK,CAAE,GAAEuF,eAAe,CAACtC,KAAK,GAAI,UAASoC,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,eAAc,GAAI,UAAS2D,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,mBAAmB,EAAC,CAAC;UAC3LxB,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAS,CAACkF,eAAe,CAACW,QAAQ,CAAE,eAAc9F,IAAI,CAACC,SAAS,CAACkF,eAAe,CAACY,QAAQ,CAAE,EAAC,CAAC;UAEzH,MAAM9D,WAAW,GAAG;YAClB+D,WAAW,EAAEb,eAAe,CAACa,WAAW;YACxCpB,SAAS,EAAE;cACTI,EAAE,EAAEC,WAAW;cACf7E,MAAM,EAAE2E;YACV;UACF,CAAC;UACD,MAAMkB,cAAc,GAAG;YACrBH,QAAQ,EAAEX,eAAe,CAACW,QAAQ;YAClCC,QAAQ,EAAEZ,eAAe,CAACY;UAC5B,CAAC;UACD,MAAMG,QAAQ,GAAG1G,cAAc,GAAG;YAAC,GAAGyC,WAAW;YAAE,GAAGgE;UAAc,CAAC,GAAG;YAAC,GAAGhE;UAAW,CAAC;UAExFnC,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAS,CAACiG,QAAQ,CAAE,EAAC,CAAC;UAExC,OAAOC,iBAAiB,CAAChB,eAAe,CAACtC,KAAK,EAAEqD,QAAQ,CAAC;QAC3D;QAEA,MAAME,sBAAsB,GAAG1B,mBAAmB,GAAG,CAAC;QACtD5E,SAAS,CAAE,4CAA2CsG,sBAAuB,EAAC,CAAC;QAE/E,OAAOlE,cAAc,CAAC;UAAChB,OAAO,EAAEA,OAAO,CAAC2E,KAAK,CAAC,CAAC,CAAC;UAAEvE,aAAa;UAAEhC,UAAU;UAAEqB,OAAO;UAAE2D,aAAa;UAAEE,WAAW,EAAEK,cAAc;UAAEN,gBAAgB;UAAEE,oBAAoB;UAAEC,mBAAmB,EAAE0B,sBAAsB;UAAEzB;QAAiB,CAAC,CAAC;MAC5O;MAEA,SAASwB,iBAAiBA,CAACE,OAAO,EAAEH,QAAQ,EAAE;QAC5C,MAAMI,gBAAgB,GAAGD,OAAO,GAAG/B,aAAa,CAAC5C,MAAM,CAACwE,QAAQ,CAAC,GAAG5B,aAAa;QACjF,MAAMiC,mBAAmB,GAAGF,OAAO,GAAG9B,gBAAgB,GAAGA,gBAAgB,CAAC7C,MAAM,CAACwE,QAAQ,CAAC;QAC1F,MAAME,sBAAsB,GAAGC,OAAO,GAAG3B,mBAAmB,GAAGA,mBAAmB,GAAG,CAAC;QAEtF5E,SAAS,CAAE,yCAAwCa,OAAO,CAACe,MAAM,CAAC4E,gBAAgB,CAAC,CAACjF,MAAO,UAAS/B,UAAW,GAAE,CAAC;;QAElH;QACA,IAAII,gBAAgB,EAAE;UACpBI,SAAS,CAAE,4CAA2Ce,UAAU,CAACa,MAAM,CAAC6E,mBAAmB,CAAC,CAAClF,MAAO,EAAC,CAAC;QACxG;QACAvB,SAAS,CAAE,+CAA8C4E,mBAAoB,EAAC,CAAC;QAE/E,IAAIjC,eAAe,CAAC;UAAC9B,OAAO,EAAEA,OAAO,CAACe,MAAM,CAAC4E,gBAAgB,CAAC;UAAEhH;QAAU,CAAC,CAAC,EAAE;UAC5EM,KAAK,CAAE,eAAcN,UAAW,gDAA+CuF,cAAe,yCAAwCvD,aAAa,GAAGuD,cAAe,EAAC,CAAC;UACvK,OAAO;YAAClE,OAAO,EAAE2F,gBAAgB;YAAEzF,UAAU,EAAEnB,gBAAgB,GAAG6G,mBAAmB,GAAG,EAAE;YAAEzF,cAAc,EAAE2D,oBAAoB;YAAE1D,aAAa,EAAEqF,sBAAsB;YAAEnF,WAAW,EAAE0D;UAAiB,CAAC;QAC1M;QAEA,OAAOzC,cAAc,CAAC;UAAChB,OAAO,EAAEA,OAAO,CAAC2E,KAAK,CAAC,CAAC,CAAC;UAAEvE,aAAa;UAAEhC,UAAU;UAAEqB,OAAO;UAAE2D,aAAa,EAAEgC,gBAAgB;UAAE9B,WAAW,EAAEK,cAAc;UAAEN,gBAAgB,EAAE7E,gBAAgB,GAAG6G,mBAAmB,GAAG,EAAE;UAAEzF,cAAc,EAAE2D,oBAAoB;UAAEC,mBAAmB,EAAE0B,sBAAsB;UAAEnF,WAAW,EAAE0D;QAAiB,CAAC,CAAC;MACxU;MAEA,SAASG,qBAAqBA,CAACnE,OAAO,EAAEiE,SAAS,EAAE;QACjDhF,KAAK,CAAE,wBAAuBgF,SAAS,CAACI,EAAG,+BAA8BrE,OAAO,CAACU,MAAO,qBAAoB,CAAC;QAC7G,MAAMmF,cAAc,GAAG5B,SAAS,CAACI,EAAE;QACnClF,SAAS,CAAE,mBAAkB0G,cAAe,EAAC,CAAC;QAC9C,MAAMnD,MAAM,GAAG1C,OAAO,CAAC8F,IAAI,CAAC,CAAC;UAAC7B;QAAS,CAAC,KAAKA,SAAS,CAACI,EAAE,KAAKwB,cAAc,CAAC;QAC7E1G,SAAS,CAAE,WAAUuD,MAAO,EAAC,CAAC;QAC9B,IAAIA,MAAM,EAAE;UACVzD,KAAK,CAAE,GAAEgF,SAAS,CAACI,EAAG,uBAAsB,CAAC;UAC7C,OAAO,KAAK;QACd;QACApF,KAAK,CAAE,GAAEgF,SAAS,CAACI,EAAG,kCAAiC,CAAC;QACxD,OAAO,IAAI;MACb;IACF;IAEA,SAASvC,eAAeA,CAAC;MAAC9B,OAAO;MAAErB;IAAU,CAAC,EAAE;MAC9C,IAAIA,UAAU,IAAIqB,OAAO,CAACU,MAAM,IAAI/B,UAAU,EAAE;QAC9CM,KAAK,CAAE,6CAA4CN,UAAW,0BAAyB,CAAC;QACxF,OAAO,IAAI;MACb;IACF;EACF,CAAC;AACH,CAAC;AAAA9B,OAAA,CAAAS,OAAA,GAAAgB,QAAA"}
+{
+  "version": 3,
+  "sources": ["../src/index.js"],
+  "sourcesContent": ["import createDebugLogger from 'debug';\nimport createSearchInterface, * as candidateSearch from './candidate-search/index.js';\nimport createDetectionInterface, * as matchDetection from './match-detection/index.js';\n//import inspect from 'util';\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\n  const detect = createDetectionInterface(detectionOptions, returnStrategy);\n\n  return prepareSearch;\n\n  async function prepareSearch({record, recordExternal = {recordSource: 'incomingRecord', label: 'ic'}}) {\n\n    const {search} = await createSearchInterface({...searchOptions, record, maxCandidates, recordExternal});\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, matchErrors = []}) {\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}, nonMatchCount: ${nonMatchCount}, matchErrors: ${matchErrors.length}`);\n      const recordSetSize = records.length;\n      const newCandidateCount = candidateCount + recordSetSize;\n\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, nonMatchCount, duplicateCount, matchErrors});\n      }\n\n      debug(`No (more) candidate records to check, no more queries left, matches: ${matches.length}`);\n      return returnResult({matches, state, stopReason: '', nonMatches, nonMatchCount, candidateCount: newCandidateCount, duplicateCount, matchErrors});\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, nonMatchCount});\n\n        const newDuplicateCount = duplicateCount + matchResult.duplicateCount;\n        const newNonMatchCount = nonMatchCount + matchResult.nonMatchCount;\n        const {newMatches, newNonMatches, newMatchErrors} = handleMatchResult(matchResult, matches, nonMatches, matchErrors);\n\n        if (maxMatchesFound({matches: newMatches, maxMatches})) {\n          return returnResult({matches: newMatches, state, stopReason: 'maxMatches', nonMatches: newNonMatches, duplicateCount: newDuplicateCount, candidateCount: newCandidateCount, nonMatchCount: newNonMatchCount, matchErrors: newMatchErrors});\n        }\n\n        if (maxCandidatesRetrieved(newCandidateCount, maxCandidates)) {\n          return returnResult({matches: newMatches, state, stopReason: 'maxCandidates', nonMatches: newNonMatches, duplicateCount: newDuplicateCount, candidateCount: newCandidateCount, nonMatchCount: newNonMatchCount, matchErrors: newMatchErrors});\n        }\n\n        return iterate({initialState: state, matches: newMatches, candidateCount: newCandidateCount, nonMatches: newNonMatches, duplicateCount: newDuplicateCount, nonMatchCount: newNonMatchCount, matchErrors: newMatchErrors});\n      }\n\n      function handleMatchResult(matchResult, matches, nonMatches, matchErrors) {\n        debugData(`- Amount of new matches from record set: ${matchResult.matches.length}`);\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        const newMatchErrors = matchErrors.concat(matchResult.matchErrors);\n\n        debugData(`- Total amount of matches: ${newMatches.length}`);\n        if (returnNonMatches) {\n          debugData(`- Total amount of nonMatches: ${newNonMatches.length}`);\n        }\n\n        debugData(`MatchResult: ${JSON.stringify(matchResult)}`);\n        debugData(`Old matchErrors: ${JSON.stringify(matchErrors)}, matchErrors from matchResult: ${JSON.stringify(matchResult.matchErrors)}, New matchErrors: ${JSON.stringify(newMatchErrors)}`);\n\n        debugData(`- Total amount of matchErrors: ${newMatchErrors.length}`);\n\n        return {newMatches, newNonMatches, newMatchErrors};\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    // failures: array of conversionFailures from candidate-search and matchErrors from matchDetection in error format {status, payload: {message, id}} if returnFailures 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','conversionFailures', 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, matchErrors}) {\n      const matchErrorCount = matchErrors.length;\n      checkCounts({matches, nonMatches, candidateCount, duplicateCount, nonMatchCount, matchErrorCount});\n      const matchStatus = getMatchState(state, stopReason, matchErrorCount);\n      // add nonMatches to result only if returnNonMatches is 'true', otherwise nonMatches have not been gathered\n      const matchesResult = returnNonMatches ? {matches, matchStatus, nonMatches, candidateCount} : {matches, matchStatus, candidateCount};\n      const result = matchesResult;\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, matchErrorCount}) {\n        const matchCount = matches.length;\n        debugData(`Return nonMatches: ${returnNonMatches}`);\n        const chosenNonMatchCount = returnNonMatches ? nonMatches.length : nonMatchCount;\n        const totalHandled = matchCount + chosenNonMatchCount + duplicateCount;\n        debug(`candidateCount: ${candidateCount}, matches: ${matchCount}, nonMatches: ${chosenNonMatchCount}, duplicateCount: ${duplicateCount}, matchErrorCount: ${matchErrorCount}`);\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      // eslint-disable-next-line max-statements\n      function getMatchState(state, stopReason, matchErrorCount) {\n        debugData(`${JSON.stringify(state)}`);\n        debug(`We had ${matchErrorCount} retrieved candidates that errored in matchDetection.`);\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        // matchStatus.stopReason: string ('maxMatches','maxCandidates','maxedQueries', empty string/undefined), reason for stopping retrieving or handling the candidate records\n        // 'maxMatches' and 'maxCandidates' are in stopReason, 'maxedQueries', 'conversionFailures' and 'matchErrors' are created here\n\n        if (state.queriesLeft > 0 || nonRetrieved > 0 || state.maxedQueries.length > 0 || matchErrorCount > 0) {\n          const maxedQueriesStopReason = state.maxedQueries.length > 0 ? 'maxedQueries' : undefined;\n          const matchErrorsStopReason = matchErrorCount > 0 ? 'matchErrors' : undefined;\n          const newStopReason = stopReason === '' || stopReason === undefined ? maxedQueriesStopReason || matchErrorsStopReason : stopReason;\n          debugData(`MaxedQueriesStopReason: <${maxedQueriesStopReason}>`);\n          debugData(`MatchErrorsStopReason <${matchErrorsStopReason}>`);\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    // NOTES:\n    // - we could optimize by creating the featureSet for the incoming record once and using it for all database/candidateRecords\n    // - if creating the featureSet for the incoming record fails we have an unprocessable entity\n    // - if creating the featureSet for a candidate record fails we could skip that candidate - but list the case as a detectionFailure, same as conversionFailures\n\n    function iterateRecords({records, recordSetSize, maxMatches, matches = [], nonMatches = [], recordMatches = [], recordNonMatches = [], recordCount = 0, recordDuplicateCount = 0, recordNonMatchCount = 0, recordMatchErrors = []}) {\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      // recordMatchErrors: errored matchDetection in the current record set\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      /* We could optimize and detect all retrieved candidates at once\n      const candidateRecords = records.map(record => record.record);\n      const recordsIsArray = Array.isArray(candidateRecords);\n      debug(`records is an array: ${recordsIsArray}`);\n      const result = detect(record, candidateRecords);\n      debugData(`${JSON.stringify(result)}`);\n      */\n\n      if (candidate) {\n        if (candidateNotInMatches(matches.concat(nonMatches), candidate)) {\n          const {record: candidateRecord, id: candidateId} = candidate;\n          const recordBExternal = {id: candidate.id, recordSource: 'databaseRecord', label: `db-${candidate.id}`};\n          try {\n            debug(`Running matchDetection for record ${candidateId} (${newRecordCount}/${recordSetSize})`);\n            // we should handle errors from detection somehow - ie. cases where either record or candidateRecord errors\n            const detectionResult = detect({recordA: record, recordB: candidateRecord, recordAExternal: recordExternal, recordBExternal});\n\n            return handleDetectionResult(detectionResult, candidateId, candidateRecord);\n          } catch (error) {\n            debug(`MatchDetection errored: database record ${candidateId}: ${error}`);\n\n            const matchError = {status: 422, payload: {message: `Matching errored for database record ${candidateId}. ${error.message}.`, id: candidateId}};\n            const newRecordMatchErrors = recordMatchErrors.concat(matchError);\n            return iterateRecords({records: records.slice(1), recordSetSize, maxMatches, matches, recordMatches, recordCount: newRecordCount, recordNonMatches, recordDuplicateCount, recordNonMatchCount, recordMatchErrors: newRecordMatchErrors});\n          }\n        }\n\n        return iterateRecords({records: records.slice(1), recordSetSize, maxMatches, matches, recordMatches, recordCount: newRecordCount, recordNonMatches, recordDuplicateCount: recordDuplicateCount + 1, recordNonMatchCount, recordMatchErrors});\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, matchErrors: recordMatchErrors};\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, recordMatchErrors});\n      }\n\n      function handleRecordMatch(isMatch, newMatch) {\n        const newRecordMatches = isMatch ? recordMatches.concat(newMatch) : recordMatches;\n        const newRecordNonMatches = isMatch ? recordNonMatches : recordNonMatches.concat(newMatch);\n        const newRecordNonMatchCount = isMatch ? recordNonMatchCount : recordNonMatchCount + 1;\n\n        debugData(`- Total matches after this detection: ${matches.concat(newRecordMatches).length} (max: ${maxMatches})`);\n\n        if (returnNonMatches) {\n          debugData(`- Total nonMatches after this detection: ${nonMatches.concat(newRecordNonMatches).length}`);\n        }\n        debugData(`- Total nonMatchCount after this detection: ${recordNonMatchCount}`);\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: newRecordNonMatchCount, matchErrors: recordMatchErrors};\n        }\n\n        return iterateRecords({records: records.slice(1), recordSetSize, maxMatches, matches, recordMatches: newRecordMatches, recordCount: newRecordCount, recordNonMatches: returnNonMatches ? newRecordNonMatches : [], duplicateCount: recordDuplicateCount, recordNonMatchCount: newRecordNonMatchCount, matchErrors: recordMatchErrors});\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"],
+  "mappings": "AAAA,OAAO,uBAAuB;AAC9B,OAAO,4BAA4B,qBAAqB;AACxD,OAAO,+BAA+B,oBAAoB;AAG1D,SAAQ,iBAAiB;AAEzB,eAAe,CAAC,EAAC,WAAW,kBAAkB,QAAQ,eAAe,aAAa,GAAG,gBAAgB,IAAI,iBAAiB,OAAO,cAAc,OAAO,mBAAmB,MAAK,MAAM;AAClL,QAAM,QAAQ,kBAAkB,yCAAyC;AACzE,QAAM,YAAY,MAAM,OAAO,MAAM;AAErC,YAAU,qBAAqB,KAAK,UAAU,gBAAgB,CAAC,EAAE;AACjE,YAAU,kBAAkB,KAAK,UAAU,aAAa,CAAC,EAAE;AAC3D,YAAU,eAAe,KAAK,UAAU,UAAU,CAAC,EAAE;AACrD,YAAU,kBAAkB,KAAK,UAAU,aAAa,CAAC,EAAE;AAC3D,YAAU,mBAAmB,KAAK,UAAU,cAAc,CAAC,EAAE;AAC7D,YAAU,gBAAgB,KAAK,UAAU,WAAW,CAAC,EAAE;AACvD,YAAU,qBAAqB,KAAK,UAAU,gBAAgB,CAAC,EAAE;AAGjE,QAAM,SAAS,yBAAyB,kBAAkB,cAAc;AAExE,SAAO;AAEP,iBAAe,cAAc,EAAC,QAAQ,iBAAiB,EAAC,cAAc,kBAAkB,OAAO,KAAI,EAAC,GAAG;AAErG,UAAM,EAAC,OAAM,IAAI,MAAM,sBAAsB,EAAC,GAAG,eAAe,QAAQ,eAAe,eAAc,CAAC;AACtG,WAAO,QAAQ,CAAC,CAAC;AAejB,mBAAe,QAAQ,EAAC,eAAe,CAAC,GAAG,UAAU,CAAC,GAAG,iBAAiB,GAAG,aAAa,CAAC,GAAG,iBAAiB,GAAG,gBAAgB,GAAG,cAAc,CAAC,EAAC,GAAG;AACtJ,gBAAU,kCAAkC;AAC5C,YAAM,EAAC,SAAS,GAAG,MAAK,IAAI,MAAM,OAAO,YAAY;AAErD,gBAAU,kBAAkB,KAAK,UAAU,KAAK,CAAC,cAAc,QAAQ,MAAM,qBAAqB,cAAc,iBAAiB,WAAW,MAAM,oBAAoB,aAAa,kBAAkB,YAAY,MAAM,EAAE;AACzN,YAAM,gBAAgB,QAAQ;AAC9B,YAAM,oBAAoB,iBAAiB;AAG3C,UAAI,gBAAgB,GAAG;AACrB,eAAO,gBAAgB;AAAA,MACzB;AAEA,UAAI,MAAM,cAAc,GAAG;AACzB,cAAM,oBAAoB,MAAM,aAAa,QAAQ,MAAM,KAAK,mBAAmB,MAAM,WAAW,eAAe;AACnH,eAAO,QAAQ,EAAC,cAAc,OAAO,SAAS,gBAAgB,mBAAmB,YAAY,eAAe,gBAAgB,YAAW,CAAC;AAAA,MAC1I;AAEA,YAAM,wEAAwE,QAAQ,MAAM,EAAE;AAC9F,aAAO,aAAa,EAAC,SAAS,OAAO,YAAY,IAAI,YAAY,eAAe,gBAAgB,mBAAmB,gBAAgB,YAAW,CAAC;AAE/I,eAAS,kBAAkB;AACzB,cAAM,0BAA0B,aAAa,qDAAqD,MAAM,aAAa,eAAe,MAAM,KAAK,EAAE;AAEjJ,cAAM,cAAc,eAAe,EAAC,SAAS,eAAe,YAAY,SAAS,YAAY,cAAa,CAAC;AAE3G,cAAM,oBAAoB,iBAAiB,YAAY;AACvD,cAAM,mBAAmB,gBAAgB,YAAY;AACrD,cAAM,EAAC,YAAY,eAAe,eAAc,IAAI,kBAAkB,aAAa,SAAS,YAAY,WAAW;AAEnH,YAAI,gBAAgB,EAAC,SAAS,YAAY,WAAU,CAAC,GAAG;AACtD,iBAAO,aAAa,EAAC,SAAS,YAAY,OAAO,YAAY,cAAc,YAAY,eAAe,gBAAgB,mBAAmB,gBAAgB,mBAAmB,eAAe,kBAAkB,aAAa,eAAc,CAAC;AAAA,QAC3O;AAEA,YAAI,uBAAuB,mBAAmB,aAAa,GAAG;AAC5D,iBAAO,aAAa,EAAC,SAAS,YAAY,OAAO,YAAY,iBAAiB,YAAY,eAAe,gBAAgB,mBAAmB,gBAAgB,mBAAmB,eAAe,kBAAkB,aAAa,eAAc,CAAC;AAAA,QAC9O;AAEA,eAAO,QAAQ,EAAC,cAAc,OAAO,SAAS,YAAY,gBAAgB,mBAAmB,YAAY,eAAe,gBAAgB,mBAAmB,eAAe,kBAAkB,aAAa,eAAc,CAAC;AAAA,MAC1N;AAEA,eAAS,kBAAkB,aAAaA,UAASC,aAAYC,cAAa;AACxE,kBAAU,4CAA4C,YAAY,QAAQ,MAAM,EAAE;AAClF,YAAI,kBAAkB;AACpB,oBAAU,+CAA+C,YAAY,WAAW,MAAM,EAAE;AAAA,QAC1F;AAEA,cAAM,aAAaF,SAAQ,OAAO,cAAc,SAAS,YAAY,OAAO,IAAI,YAAY,OAAO;AACnG,cAAM,gBAAgB,mBAAmBC,YAAW,OAAO,cAAc,SAAS,YAAY,UAAU,IAAI,YAAY,UAAU,IAAI,CAAC;AACvI,cAAM,iBAAiBC,aAAY,OAAO,YAAY,WAAW;AAEjE,kBAAU,8BAA8B,WAAW,MAAM,EAAE;AAC3D,YAAI,kBAAkB;AACpB,oBAAU,iCAAiC,cAAc,MAAM,EAAE;AAAA,QACnE;AAEA,kBAAU,gBAAgB,KAAK,UAAU,WAAW,CAAC,EAAE;AACvD,kBAAU,oBAAoB,KAAK,UAAUA,YAAW,CAAC,mCAAmC,KAAK,UAAU,YAAY,WAAW,CAAC,sBAAsB,KAAK,UAAU,cAAc,CAAC,EAAE;AAEzL,kBAAU,kCAAkC,eAAe,MAAM,EAAE;AAEnE,eAAO,EAAC,YAAY,eAAe,eAAc;AAAA,MACnD;AAEA,eAAS,SAASF,UAAS;AACzB,kBAAU,gBAAgB,MAAM,KAAK,aAAa;AAClD,eAAOA,SAAQ,IAAI,CAAC,WAAW,EAAC,GAAG,OAAO,YAAY,MAAM,MAAK,EAAE;AAAA,MACrE;AAEA,eAAS,uBAAuBG,iBAAgBC,gBAAe;AAC7D,kBAAU,gDAAgD,iBAAiB,UAAUA,cAAa,GAAG;AACrG,YAAIA,kBAAiBD,mBAAkBC,gBAAe;AACpD,gBAAM,gEAAgED,eAAc,MAAMC,cAAa,sBAAsB;AAC7H,iBAAO;AAAA,QACT;AAAA,MACF;AAAA,IACF;AAmBA,aAAS,aAAa,EAAC,SAAS,OAAO,YAAY,YAAY,gBAAgB,gBAAgB,eAAe,YAAW,GAAG;AAC1H,YAAM,kBAAkB,YAAY;AACpC,kBAAY,EAAC,SAAS,YAAY,gBAAgB,gBAAgB,eAAe,gBAAe,CAAC;AACjG,YAAM,cAAc,cAAc,OAAO,YAAY,eAAe;AAEpE,YAAM,gBAAgB,mBAAmB,EAAC,SAAS,aAAa,YAAY,eAAc,IAAI,EAAC,SAAS,aAAa,eAAc;AACnI,YAAM,SAAS;AACf,gBAAU,GAAG,KAAK,UAAU,MAAM,CAAC,EAAE;AACrC,aAAO;AAIP,eAAS,YAAY,EAAC,SAAAJ,UAAS,YAAAC,aAAY,gBAAAE,iBAAgB,gBAAAE,iBAAgB,eAAAC,gBAAe,iBAAAC,iBAAe,GAAG;AAC1G,cAAM,aAAaP,SAAQ;AAC3B,kBAAU,sBAAsB,gBAAgB,EAAE;AAClD,cAAM,sBAAsB,mBAAmBC,YAAW,SAASK;AACnE,cAAM,eAAe,aAAa,sBAAsBD;AACxD,cAAM,mBAAmBF,eAAc,cAAc,UAAU,iBAAiB,mBAAmB,qBAAqBE,eAAc,sBAAsBE,gBAAe,EAAE;AAC7K,cAAM,qBAAqB,YAAY,MAAMJ,eAAc,uBAAuB;AAClF,YAAI,iBAAiBA,iBAAgB;AACnC,gBAAM,gCAAgCA,kBAAiB,YAAY,aAAa;AAChF;AAAA,QACF;AACA;AAAA,MACF;AAGA,eAAS,cAAcK,QAAOC,aAAYF,kBAAiB;AACzD,kBAAU,GAAG,KAAK,UAAUC,MAAK,CAAC,EAAE;AACpC,cAAM,UAAUD,gBAAe,uDAAuD;AACtF,cAAM,gBAAgBC,OAAM,WAAW,sCAAsCA,OAAM,mBAAmBA,OAAM,mBAAmBA,OAAM,YAAY,4BAA4BA,OAAM,eAAeA,OAAM,qBAAqB,mBAAmBA,OAAM,aAAa,MAAM,MAAMA,OAAM,YAAY,EAAE;AAEnS,kBAAU,gBAAgBC,WAAU,GAAG;AAEvC,cAAM,eAAeD,OAAM,mBAAmBA,OAAM,mBAAmBA,OAAM;AAC7E,cAAM,eAAe,eAAeA,OAAM,eAAeA,OAAM,wBAAwB;AACvF,kBAAU,iBAAiB,YAAY,EAAE;AAKzC,YAAIA,OAAM,cAAc,KAAK,eAAe,KAAKA,OAAM,aAAa,SAAS,KAAKD,mBAAkB,GAAG;AACrG,gBAAM,yBAAyBC,OAAM,aAAa,SAAS,IAAI,iBAAiB;AAChF,gBAAM,wBAAwBD,mBAAkB,IAAI,gBAAgB;AACpE,gBAAM,gBAAgBE,gBAAe,MAAMA,gBAAe,SAAY,0BAA0B,wBAAwBA;AACxH,oBAAU,4BAA4B,sBAAsB,GAAG;AAC/D,oBAAU,0BAA0B,qBAAqB,GAAG;AAC5D,oBAAU,mBAAmB,aAAa,GAAG;AAC7C,gBAAM,qBAAqB;AAC3B,iBAAO,EAAC,QAAQ,OAAO,YAAY,cAAa;AAAA,QAClD;AAEA,cAAM,oBAAoB;AAC1B,eAAO,EAAC,QAAQ,MAAM,YAAAA,YAAU;AAAA,MAClC;AAAA,IACF;AAOA,aAAS,eAAe,EAAC,SAAS,eAAe,YAAAC,aAAY,UAAU,CAAC,GAAG,aAAa,CAAC,GAAG,gBAAgB,CAAC,GAAG,mBAAmB,CAAC,GAAG,cAAc,GAAG,uBAAuB,GAAG,sBAAsB,GAAG,oBAAoB,CAAC,EAAC,GAAG;AAclO,YAAM,CAAC,SAAS,IAAI;AACpB,YAAM,iBAAiB,YAAY,cAAc,IAAI;AAerD,UAAI,WAAW;AACb,YAAI,sBAAsB,QAAQ,OAAO,UAAU,GAAG,SAAS,GAAG;AAChE,gBAAM,EAAC,QAAQ,iBAAiB,IAAI,YAAW,IAAI;AACnD,gBAAM,kBAAkB,EAAC,IAAI,UAAU,IAAI,cAAc,kBAAkB,OAAO,MAAM,UAAU,EAAE,GAAE;AACtG,cAAI;AACF,kBAAM,qCAAqC,WAAW,KAAK,cAAc,IAAI,aAAa,GAAG;AAE7F,kBAAM,kBAAkB,OAAO,EAAC,SAAS,QAAQ,SAAS,iBAAiB,iBAAiB,gBAAgB,gBAAe,CAAC;AAE5H,mBAAO,sBAAsB,iBAAiB,aAAa,eAAe;AAAA,UAC5E,SAAS,OAAO;AACd,kBAAM,2CAA2C,WAAW,KAAK,KAAK,EAAE;AAExE,kBAAM,aAAa,EAAC,QAAQ,KAAK,SAAS,EAAC,SAAS,wCAAwC,WAAW,KAAK,MAAM,OAAO,KAAK,IAAI,YAAW,EAAC;AAC9I,kBAAM,uBAAuB,kBAAkB,OAAO,UAAU;AAChE,mBAAO,eAAe,EAAC,SAAS,QAAQ,MAAM,CAAC,GAAG,eAAe,YAAAA,aAAY,SAAS,eAAe,aAAa,gBAAgB,kBAAkB,sBAAsB,qBAAqB,mBAAmB,qBAAoB,CAAC;AAAA,UACzO;AAAA,QACF;AAEA,eAAO,eAAe,EAAC,SAAS,QAAQ,MAAM,CAAC,GAAG,eAAe,YAAAA,aAAY,SAAS,eAAe,aAAa,gBAAgB,kBAAkB,sBAAsB,uBAAuB,GAAG,qBAAqB,kBAAiB,CAAC;AAAA,MAC7O;AAEA,YAAM,mCAAmC,WAAW,IAAI,aAAa,WAAW,cAAc,MAAM,mBAAmB,oBAAoB,gCAAgC,mBAAmB,GAAG,iBAAiB,MAAM,KAAK,GAAG,mBAAmB,EAAE,oBAAoB;AACzQ,aAAO,EAAC,SAAS,eAAe,YAAY,mBAAmB,mBAAmB,CAAC,GAAG,gBAAgB,sBAAsB,eAAe,qBAAqB,aAAa,kBAAiB;AAE9L,eAAS,sBAAsB,iBAAiB,aAAa,iBAAiB;AAC5E,kBAAU,8BAA8B,WAAW,KAAK,cAAc,IAAI,aAAa,MAAM,KAAK,UAAU,eAAe,CAAC,EAAE;AAE9H,YAAI,gBAAgB,SAAS,kBAAkB;AAC7C,gBAAM,GAAG,gBAAgB,QAAQ,UAAU,WAAW,KAAK,cAAc,IAAI,aAAa,kBAAkB,UAAU,WAAW,KAAK,cAAc,IAAI,aAAa,mBAAmB,EAAE;AAC1L,oBAAU,aAAa,KAAK,UAAU,gBAAgB,QAAQ,CAAC,eAAe,KAAK,UAAU,gBAAgB,QAAQ,CAAC,EAAE;AAExH,gBAAM,cAAc;AAAA,YAClB,aAAa,gBAAgB;AAAA,YAC7B,WAAW;AAAA,cACT,IAAI;AAAA,cACJ,QAAQ;AAAA,YACV;AAAA,UACF;AACA,gBAAM,iBAAiB;AAAA,YACrB,UAAU,gBAAgB;AAAA,YAC1B,UAAU,gBAAgB;AAAA,UAC5B;AACA,gBAAM,WAAW,iBAAiB,EAAC,GAAG,aAAa,GAAG,eAAc,IAAI,EAAC,GAAG,YAAW;AAEvF,oBAAU,GAAG,KAAK,UAAU,QAAQ,CAAC,EAAE;AAEvC,iBAAO,kBAAkB,gBAAgB,OAAO,QAAQ;AAAA,QAC1D;AAEA,cAAM,yBAAyB,sBAAsB;AACrD,kBAAU,4CAA4C,sBAAsB,EAAE;AAE9E,eAAO,eAAe,EAAC,SAAS,QAAQ,MAAM,CAAC,GAAG,eAAe,YAAAA,aAAY,SAAS,eAAe,aAAa,gBAAgB,kBAAkB,sBAAsB,qBAAqB,wBAAwB,kBAAiB,CAAC;AAAA,MAC3O;AAEA,eAAS,kBAAkB,SAAS,UAAU;AAC5C,cAAM,mBAAmB,UAAU,cAAc,OAAO,QAAQ,IAAI;AACpE,cAAM,sBAAsB,UAAU,mBAAmB,iBAAiB,OAAO,QAAQ;AACzF,cAAM,yBAAyB,UAAU,sBAAsB,sBAAsB;AAErF,kBAAU,yCAAyC,QAAQ,OAAO,gBAAgB,EAAE,MAAM,UAAUA,WAAU,GAAG;AAEjH,YAAI,kBAAkB;AACpB,oBAAU,4CAA4C,WAAW,OAAO,mBAAmB,EAAE,MAAM,EAAE;AAAA,QACvG;AACA,kBAAU,+CAA+C,mBAAmB,EAAE;AAE9E,YAAI,gBAAgB,EAAC,SAAS,QAAQ,OAAO,gBAAgB,GAAG,YAAAA,YAAU,CAAC,GAAG;AAC5E,gBAAM,eAAeA,WAAU,gDAAgD,cAAc,yCAAyC,gBAAgB,cAAc,EAAE;AACtK,iBAAO,EAAC,SAAS,kBAAkB,YAAY,mBAAmB,sBAAsB,CAAC,GAAG,gBAAgB,sBAAsB,eAAe,wBAAwB,aAAa,kBAAiB;AAAA,QACzM;AAEA,eAAO,eAAe,EAAC,SAAS,QAAQ,MAAM,CAAC,GAAG,eAAe,YAAAA,aAAY,SAAS,eAAe,kBAAkB,aAAa,gBAAgB,kBAAkB,mBAAmB,sBAAsB,CAAC,GAAG,gBAAgB,sBAAsB,qBAAqB,wBAAwB,aAAa,kBAAiB,CAAC;AAAA,MACvU;AAEA,eAAS,sBAAsBV,UAASW,YAAW;AACjD,cAAM,wBAAwBA,WAAU,EAAE,+BAA+BX,SAAQ,MAAM,qBAAqB;AAC5G,cAAM,iBAAiBW,WAAU;AACjC,kBAAU,mBAAmB,cAAc,EAAE;AAC7C,cAAM,SAASX,SAAQ,KAAK,CAAC,EAAC,WAAAW,WAAS,MAAMA,WAAU,OAAO,cAAc;AAC5E,kBAAU,WAAW,MAAM,EAAE;AAC7B,YAAI,QAAQ;AACV,gBAAM,GAAGA,WAAU,EAAE,uBAAuB;AAC5C,iBAAO;AAAA,QACT;AACA,cAAM,GAAGA,WAAU,EAAE,kCAAkC;AACvD,eAAO;AAAA,MACT;AAAA,IACF;AAEA,aAAS,gBAAgB,EAAC,SAAS,YAAAD,YAAU,GAAG;AAC9C,UAAIA,eAAc,QAAQ,UAAUA,aAAY;AAC9C,cAAM,6CAA6CA,WAAU,0BAA0B;AACvF,eAAO;AAAA,MACT;AAAA,IACF;AAAA,EACF;AACF;",
+  "names": ["matches", "nonMatches", "matchErrors", "candidateCount", "maxCandidates", "duplicateCount", "nonMatchCount", "matchErrorCount", "state", "stopReason", "maxMatches", "candidate"]
+}

package/dist/index.test.js

@@ -0,0 +1,69 @@
+import assert from "node:assert";
+import { describe } from "node:test";
+import createDebugLogger from "debug";
+import { READERS } from "@natlibfi/fixura";
+import generateTests from "@natlibfi/fixugen-http-client";
+import { MarcRecord } from "@natlibfi/marc-record";
+import createMatchInterface, { matchDetection } from "./index.js";
+const debug = createDebugLogger("@natlibfi/melinda-record-matching:index:test");
+const debugData = debug.extend("data");
+describe("INDEX", () => {
+  generateTests({
+    callback,
+    path: [import.meta.dirname, "..", "test-fixtures", "index"],
+    recurse: false,
+    fixura: {
+      reader: READERS.JSON
+    }
+  });
+  async function callback({ getFixture, options, expectedMatchStatus, expectedStopReason, expectedFailures, expectedCandidateCount }) {
+    const record = new MarcRecord(getFixture("inputRecord.json"), { subfieldValues: false });
+    const expectedMatches = getFixture("expectedMatches.json");
+    const expectedNonMatches = getFixture("expectedNonMatches.json") || [];
+    const match = createMatchInterface(formatOptions());
+    const { matches, matchStatus, nonMatches, conversionFailures, candidateCount } = await match({ record });
+    debugData(`Matches: ${matches.length}, Status: ${matchStatus.status}/${matchStatus.stopReason}, NonMatches: ${nonMatches ? nonMatches.length : "not returned"}, ConversionFailures: ${conversionFailures ? conversionFailures.length : "not returned"}`);
+    assert.equal(matchStatus.status, expectedMatchStatus);
+    assert.equal(matchStatus.stopReason, expectedStopReason);
+    assert.equal(candidateCount, expectedCandidateCount);
+    const formattedMatchResult = formatRecordResults(matches);
+    assert.deepStrictEqual(formattedMatchResult, expectedMatches);
+    const formattedNonMatchResult = formatRecordResults(nonMatches);
+    assert.deepStrictEqual(formattedNonMatchResult, expectedNonMatches);
+    if (expectedFailures) {
+      assert.deepStrictEqual(conversionFailures, expectedFailures);
+    }
+    function formatOptions() {
+      const contextFeatures = matchDetection.features[options.detection.strategy.type];
+      return {
+        ...options,
+        search: {
+          ...options.search
+        },
+        detection: {
+          ...options.detect,
+          strategy: options.detection.strategy.features.map((v) => contextFeatures[v]())
+        }
+      };
+    }
+    function formatRecordResults(matches2) {
+      if (matches2) {
+        debugData(JSON.stringify(matches2));
+        return matches2.map((match2) => ({
+          ...match2,
+          candidate: formatCandidate(match2.candidate)
+        }));
+      }
+      return [];
+    }
+    function formatCandidate({ id, record: record2 }) {
+      const newId = id;
+      const newRecord = record2;
+      return {
+        id: newId,
+        record: newRecord.toObject()
+      };
+    }
+  }
+});
+//# sourceMappingURL=index.test.js.map

package/dist/index.test.js.map

@@ -0,0 +1,7 @@
+{
+  "version": 3,
+  "sources": ["../src/index.test.js"],
+  "sourcesContent": ["import assert from 'node:assert';\nimport {describe} from 'node:test';\nimport createDebugLogger from 'debug';\nimport {READERS} from '@natlibfi/fixura';\nimport generateTests from '@natlibfi/fixugen-http-client';\nimport {MarcRecord} from '@natlibfi/marc-record';\nimport createMatchInterface, {matchDetection} from './index.js';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:index:test');\nconst debugData = debug.extend('data');\n\ndescribe('INDEX', () => {\n  generateTests({\n    callback,\n    path: [import.meta.dirname, '..', 'test-fixtures', '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, options, expectedMatchStatus, expectedStopReason, expectedFailures, expectedCandidateCount}) {\n\n    const record = new MarcRecord(getFixture('inputRecord.json'), {subfieldValues: false});\n    const expectedMatches = getFixture('expectedMatches.json');\n    const expectedNonMatches = getFixture('expectedNonMatches.json') || [];\n\n\n    const match = createMatchInterface(formatOptions());\n    const {matches, matchStatus, nonMatches, conversionFailures, candidateCount} = await match({record});\n    debugData(`Matches: ${matches.length}, Status: ${matchStatus.status}/${matchStatus.stopReason}, NonMatches: ${nonMatches ? nonMatches.length : 'not returned'}, ConversionFailures: ${conversionFailures ? conversionFailures.length : 'not returned'}`);\n\n    assert.equal(matchStatus.status, expectedMatchStatus);\n    assert.equal(matchStatus.stopReason, expectedStopReason);\n    assert.equal(candidateCount, expectedCandidateCount);\n\n    const formattedMatchResult = formatRecordResults(matches);\n    assert.deepStrictEqual(formattedMatchResult, expectedMatches);\n\n    const formattedNonMatchResult = formatRecordResults(nonMatches);\n    assert.deepStrictEqual(formattedNonMatchResult, expectedNonMatches);\n\n    if (expectedFailures) {\n      assert.deepStrictEqual(conversionFailures, expectedFailures);\n    }\n\n    function formatOptions() {\n      const contextFeatures = matchDetection.features[options.detection.strategy.type];\n\n      return {\n        ...options,\n        search: {\n          ...options.search\n        },\n        detection: {\n          ...options.detect,\n          strategy: options.detection.strategy.features.map(v => contextFeatures[v]())\n        }\n      };\n    }\n\n    function formatRecordResults(matches) {\n      if (matches) {\n        debugData(JSON.stringify(matches));\n        return matches.map((match) => ({\n          ...match,\n          candidate: formatCandidate(match.candidate)\n        }));\n      }\n      return [];\n    }\n\n    // Format candidate to remove validationOptions from record\n    function formatCandidate({id, record}) {\n      const newId = id;\n      const newRecord = record;\n      return {\n        id: newId,\n        record: newRecord.toObject()\n      };\n    }\n  }\n});\n"],
+  "mappings": "AAAA,OAAO,YAAY;AACnB,SAAQ,gBAAe;AACvB,OAAO,uBAAuB;AAC9B,SAAQ,eAAc;AACtB,OAAO,mBAAmB;AAC1B,SAAQ,kBAAiB;AACzB,OAAO,wBAAuB,sBAAqB;AAEnD,MAAM,QAAQ,kBAAkB,8CAA8C;AAC9E,MAAM,YAAY,MAAM,OAAO,MAAM;AAErC,SAAS,SAAS,MAAM;AACtB,gBAAc;AAAA,IACZ;AAAA,IACA,MAAM,CAAC,YAAY,SAAS,MAAM,iBAAiB,OAAO;AAAA,IAC1D,SAAS;AAAA,IACT,QAAQ;AAAA,MACN,QAAQ,QAAQ;AAAA,IAClB;AAAA,EACF,CAAC;AAGD,iBAAe,SAAS,EAAC,YAAY,SAAS,qBAAqB,oBAAoB,kBAAkB,uBAAsB,GAAG;AAEhI,UAAM,SAAS,IAAI,WAAW,WAAW,kBAAkB,GAAG,EAAC,gBAAgB,MAAK,CAAC;AACrF,UAAM,kBAAkB,WAAW,sBAAsB;AACzD,UAAM,qBAAqB,WAAW,yBAAyB,KAAK,CAAC;AAGrE,UAAM,QAAQ,qBAAqB,cAAc,CAAC;AAClD,UAAM,EAAC,SAAS,aAAa,YAAY,oBAAoB,eAAc,IAAI,MAAM,MAAM,EAAC,OAAM,CAAC;AACnG,cAAU,YAAY,QAAQ,MAAM,aAAa,YAAY,MAAM,IAAI,YAAY,UAAU,iBAAiB,aAAa,WAAW,SAAS,cAAc,yBAAyB,qBAAqB,mBAAmB,SAAS,cAAc,EAAE;AAEvP,WAAO,MAAM,YAAY,QAAQ,mBAAmB;AACpD,WAAO,MAAM,YAAY,YAAY,kBAAkB;AACvD,WAAO,MAAM,gBAAgB,sBAAsB;AAEnD,UAAM,uBAAuB,oBAAoB,OAAO;AACxD,WAAO,gBAAgB,sBAAsB,eAAe;AAE5D,UAAM,0BAA0B,oBAAoB,UAAU;AAC9D,WAAO,gBAAgB,yBAAyB,kBAAkB;AAElE,QAAI,kBAAkB;AACpB,aAAO,gBAAgB,oBAAoB,gBAAgB;AAAA,IAC7D;AAEA,aAAS,gBAAgB;AACvB,YAAM,kBAAkB,eAAe,SAAS,QAAQ,UAAU,SAAS,IAAI;AAE/E,aAAO;AAAA,QACL,GAAG;AAAA,QACH,QAAQ;AAAA,UACN,GAAG,QAAQ;AAAA,QACb;AAAA,QACA,WAAW;AAAA,UACT,GAAG,QAAQ;AAAA,UACX,UAAU,QAAQ,UAAU,SAAS,SAAS,IAAI,OAAK,gBAAgB,CAAC,EAAE,CAAC;AAAA,QAC7E;AAAA,MACF;AAAA,IACF;AAEA,aAAS,oBAAoBA,UAAS;AACpC,UAAIA,UAAS;AACX,kBAAU,KAAK,UAAUA,QAAO,CAAC;AACjC,eAAOA,SAAQ,IAAI,CAACC,YAAW;AAAA,UAC7B,GAAGA;AAAA,UACH,WAAW,gBAAgBA,OAAM,SAAS;AAAA,QAC5C,EAAE;AAAA,MACJ;AACA,aAAO,CAAC;AAAA,IACV;AAGA,aAAS,gBAAgB,EAAC,IAAI,QAAAC,QAAM,GAAG;AACrC,YAAM,QAAQ;AACd,YAAM,YAAYA;AAClB,aAAO;AAAA,QACL,IAAI;AAAA,QACJ,QAAQ,UAAU,SAAS;AAAA,MAC7B;AAAA,IACF;AAAA,EACF;AACF,CAAC;",
+  "names": ["matches", "match", "record"]
+}

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

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

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

@@ -1 +1,7 @@
-{"version":3,"file":"all-source-ids.js","names":["_debug","_interopRequireDefault","require","_matchingUtils","obj","__esModule","default","debug","createDebugLogger","debugData","extend","_default","name","extract","record","recordExternal","label","fSids","get","length","JSON","stringify","sidFeatures","getSidFeatures","map","toSidFeature","filter","nonEmptySid","field","validateSidFieldSubfieldCounts","createSidFeature","sfC","getSubfieldValues","sfB","compare","a","b","matches","sidA","some","sidB","sourceDb","sourceId","mismatches","exports"],"sources":["../../../../src/match-detection/features/bib/all-source-ids.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport {validateSidFieldSubfieldCounts, getSubfieldValues} from '../../../matching-utils';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features:all-source-ids');\nconst debugData = debug.extend('data');\n\n/*\n\nSID-fields in Melinda have sf $c with local id and sf $b with a code for the local db:\n\n SID__ $c 123457 $b helka\n SID__ $c (ANDL100020)1077305 $b sata\n SID__ $c VER999999 $ FI-KV\n\nallSourceIds matching feature is formatted as [{sourceDb: \"helka\", sourceId: \"123457\"}, {sourceDb: \"sata\", sourceId: \"(ANDL100020)1077305\"}, {sourceDb: \"FI-KV\", sourceId: \"VER999999\"}]\n- no normalization / prefix deletions etc. in the feature\n\nNote: All Melinda records that have a matching records in a local db do NOT have SID for that local records,\n      existence of a SID field depends on how the record has been added to Melinda and how it has been handled\n      afterwards. SIDs are also not reliably maintained. A record might or might not have a SID for a local db\n      after the matching record is removed from the local db.\n\nRecords with mismatching local ids for matching local db are a strong mismatch.\nRecords with matching local ids for matching local db are a very good match.\n\n*/\n\nexport default () => ({\n  name: 'All source IDs',\n  extract: ({record, recordExternal}) => {\n    const label = recordExternal && recordExternal.label ? recordExternal.label : 'record';\n    debug(`Creating match detection features for all local source id's for ${label}`);\n\n    const fSids = record.get('SID');\n    debugData(`SID-fields (${fSids.length}): ${JSON.stringify(fSids)}`);\n\n    const sidFeatures = getSidFeatures(fSids);\n    debugData(`SID-features (${sidFeatures.length}): ${JSON.stringify(sidFeatures)}`);\n\n    return sidFeatures;\n\n    function getSidFeatures(fSids) {\n      debug(`Getting Sid strings from SID fields`);\n\n      // Map SID fields to sidFeatures, filter out empty strings\n      const sidFeatures = fSids.map(toSidFeature).filter(nonEmptySid => nonEmptySid);\n      return sidFeatures;\n\n      function toSidFeature(field) {\n        debug(`Getting feature from a field`);\n\n        return validateSidFieldSubfieldCounts(field) ? createSidFeature(field) : '';\n\n        function createSidFeature(field) {\n          debug(`Creating feature from a field`);\n          const [sfC] = getSubfieldValues(field, 'c');\n          const [sfB] = getSubfieldValues(field, 'b');\n\n          debugData(`${JSON.stringify(sfC)} + ${JSON.stringify(sfB)}`);\n          debugData(`sourceDb: ${sfB}, sourceId: ${sfC}`);\n          return {'sourceDb': sfB, 'sourceId': sfC};\n        }\n      }\n\n    }\n\n  },\n  compare: (a, b) => {\n\n    debugData(`Comparing ${JSON.stringify(a)} and ${JSON.stringify(b)}`);\n\n    const matches = a.filter(sidA => b.some(sidB => sidA.sourceDb === sidB.sourceDb &&\n            sidA.sourceId === sidB.sourceId));\n    debugData(`Matches (${matches.length}): ${JSON.stringify(matches)}`);\n\n    const mismatches = a.filter(sidA => b.some(sidB => sidA.sourceDb === sidB.sourceDb &&\n      sidA.sourceId !== sidB.sourceId));\n    debugData(`Mismatches (${mismatches.length}): ${JSON.stringify(mismatches)}`);\n\n    // If there's at least one mismatching source ID from matching source db\n    if (mismatches.length > 0) {\n      return -1;\n    }\n\n    // If there's at least one matching source ID from matching source db\n    if (matches.length > 0) {\n      return 1;\n    }\n\n    // If there are no source IDs with matching sources\n    return 0;\n\n  }\n});\n"],"mappings":";;;;;;AA4BA,IAAAA,MAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,cAAA,GAAAD,OAAA;AAA0F,SAAAD,uBAAAG,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AA7B1F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAKA,MAAMG,KAAK,GAAG,IAAAC,cAAiB,EAAC,2EAA2E,CAAC;AAC5G,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAM,CAAC,MAAM,CAAC;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAnBA,IAAAC,QAAA,GAqBeA,CAAA,MAAO;EACpBC,IAAI,EAAE,gBAAgB;EACtBC,OAAO,EAAEA,CAAC;IAACC,MAAM;IAAEC;EAAc,CAAC,KAAK;IACrC,MAAMC,KAAK,GAAGD,cAAc,IAAIA,cAAc,CAACC,KAAK,GAAGD,cAAc,CAACC,KAAK,GAAG,QAAQ;IACtFT,KAAK,CAAE,mEAAkES,KAAM,EAAC,CAAC;IAEjF,MAAMC,KAAK,GAAGH,MAAM,CAACI,GAAG,CAAC,KAAK,CAAC;IAC/BT,SAAS,CAAE,eAAcQ,KAAK,CAACE,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACJ,KAAK,CAAE,EAAC,CAAC;IAEnE,MAAMK,WAAW,GAAGC,cAAc,CAACN,KAAK,CAAC;IACzCR,SAAS,CAAE,iBAAgBa,WAAW,CAACH,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACC,WAAW,CAAE,EAAC,CAAC;IAEjF,OAAOA,WAAW;IAElB,SAASC,cAAcA,CAACN,KAAK,EAAE;MAC7BV,KAAK,CAAE,qCAAoC,CAAC;;MAE5C;MACA,MAAMe,WAAW,GAAGL,KAAK,CAACO,GAAG,CAACC,YAAY,CAAC,CAACC,MAAM,CAACC,WAAW,IAAIA,WAAW,CAAC;MAC9E,OAAOL,WAAW;MAElB,SAASG,YAAYA,CAACG,KAAK,EAAE;QAC3BrB,KAAK,CAAE,8BAA6B,CAAC;QAErC,OAAO,IAAAsB,6CAA8B,EAACD,KAAK,CAAC,GAAGE,gBAAgB,CAACF,KAAK,CAAC,GAAG,EAAE;QAE3E,SAASE,gBAAgBA,CAACF,KAAK,EAAE;UAC/BrB,KAAK,CAAE,+BAA8B,CAAC;UACtC,MAAM,CAACwB,GAAG,CAAC,GAAG,IAAAC,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAC3C,MAAM,CAACK,GAAG,CAAC,GAAG,IAAAD,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAE3CnB,SAAS,CAAE,GAAEW,IAAI,CAACC,SAAS,CAACU,GAAG,CAAE,MAAKX,IAAI,CAACC,SAAS,CAACY,GAAG,CAAE,EAAC,CAAC;UAC5DxB,SAAS,CAAE,aAAYwB,GAAI,eAAcF,GAAI,EAAC,CAAC;UAC/C,OAAO;YAAC,UAAU,EAAEE,GAAG;YAAE,UAAU,EAAEF;UAAG,CAAC;QAC3C;MACF;IAEF;EAEF,CAAC;EACDG,OAAO,EAAEA,CAACC,CAAC,EAAEC,CAAC,KAAK;IAEjB3B,SAAS,CAAE,aAAYW,IAAI,CAACC,SAAS,CAACc,CAAC,CAAE,QAAOf,IAAI,CAACC,SAAS,CAACe,CAAC,CAAE,EAAC,CAAC;IAEpE,MAAMC,OAAO,GAAGF,CAAC,CAACT,MAAM,CAACY,IAAI,IAAIF,CAAC,CAACG,IAAI,CAACC,IAAI,IAAIF,IAAI,CAACG,QAAQ,KAAKD,IAAI,CAACC,QAAQ,IACvEH,IAAI,CAACI,QAAQ,KAAKF,IAAI,CAACE,QAAQ,CAAC,CAAC;IACzCjC,SAAS,CAAE,YAAW4B,OAAO,CAAClB,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACgB,OAAO,CAAE,EAAC,CAAC;IAEpE,MAAMM,UAAU,GAAGR,CAAC,CAACT,MAAM,CAACY,IAAI,IAAIF,CAAC,CAACG,IAAI,CAACC,IAAI,IAAIF,IAAI,CAACG,QAAQ,KAAKD,IAAI,CAACC,QAAQ,IAChFH,IAAI,CAACI,QAAQ,KAAKF,IAAI,CAACE,QAAQ,CAAC,CAAC;IACnCjC,SAAS,CAAE,eAAckC,UAAU,CAACxB,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACsB,UAAU,CAAE,EAAC,CAAC;;IAE7E;IACA,IAAIA,UAAU,CAACxB,MAAM,GAAG,CAAC,EAAE;MACzB,OAAO,CAAC,CAAC;IACX;;IAEA;IACA,IAAIkB,OAAO,CAAClB,MAAM,GAAG,CAAC,EAAE;MACtB,OAAO,CAAC;IACV;;IAEA;IACA,OAAO,CAAC;EAEV;AACF,CAAC,CAAC;AAAAyB,OAAA,CAAAtC,OAAA,GAAAK,QAAA"}
+{
+  "version": 3,
+  "sources": ["../../../../src/match-detection/features/bib/all-source-ids.js"],
+  "sourcesContent": ["\nimport createDebugLogger from 'debug';\nimport {validateSidFieldSubfieldCounts, getSubfieldValues} from '../../../matching-utils.js';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features:all-source-ids');\nconst debugData = debug.extend('data');\n\n/*\n\nSID-fields in Melinda have sf $c with local id and sf $b with a code for the local db:\n\n SID__ $c 123457 $b helka\n SID__ $c (ANDL100020)1077305 $b sata\n SID__ $c VER999999 $ FI-KV\n\nallSourceIds matching feature is formatted as [{sourceDb: \"helka\", sourceId: \"123457\"}, {sourceDb: \"sata\", sourceId: \"(ANDL100020)1077305\"}, {sourceDb: \"FI-KV\", sourceId: \"VER999999\"}]\n- no normalization / prefix deletions etc. in the feature\n\nNote: All Melinda records that have a matching records in a local db do NOT have SID for that local records,\n      existence of a SID field depends on how the record has been added to Melinda and how it has been handled\n      afterwards. SIDs are also not reliably maintained. A record might or might not have a SID for a local db\n      after the matching record is removed from the local db.\n\nRecords with mismatching local ids for matching local db are a strong mismatch.\nRecords with matching local ids for matching local db are a very good match.\n\n*/\n\nexport default () => ({\n  name: 'All source IDs',\n  extract: ({record, recordExternal}) => {\n    const label = recordExternal && recordExternal.label ? recordExternal.label : 'record';\n    debug(`Creating match detection features for all local source id's for ${label}`);\n\n    const fSids = record.get('SID');\n    debugData(`SID-fields (${fSids.length}): ${JSON.stringify(fSids)}`);\n\n    const sidFeatures = getSidFeatures(fSids);\n    debugData(`SID-features (${sidFeatures.length}): ${JSON.stringify(sidFeatures)}`);\n\n    return sidFeatures;\n\n    function getSidFeatures(fSids) {\n      debug(`Getting Sid strings from SID fields`);\n\n      // Map SID fields to sidFeatures, filter out empty strings\n      const sidFeatures = fSids.map(toSidFeature).filter(nonEmptySid => nonEmptySid);\n      return sidFeatures;\n\n      function toSidFeature(field) {\n        debug(`Getting feature from a field`);\n\n        return validateSidFieldSubfieldCounts(field) ? createSidFeature(field) : '';\n\n        function createSidFeature(field) {\n          debug(`Creating feature from a field`);\n          const [sfC] = getSubfieldValues(field, 'c');\n          const [sfB] = getSubfieldValues(field, 'b');\n\n          debugData(`${JSON.stringify(sfC)} + ${JSON.stringify(sfB)}`);\n          debugData(`sourceDb: ${sfB}, sourceId: ${sfC}`);\n          return {'sourceDb': sfB, 'sourceId': sfC};\n        }\n      }\n\n    }\n\n  },\n  compare: (a, b) => {\n\n    debugData(`Comparing ${JSON.stringify(a)} and ${JSON.stringify(b)}`);\n\n    const matches = a.filter(sidA => b.some(sidB => sidA.sourceDb === sidB.sourceDb &&\n      sidA.sourceId === sidB.sourceId));\n    debugData(`Matches (${matches.length}): ${JSON.stringify(matches)}`);\n\n    const mismatches = a.filter(sidA => b.some(sidB => sidA.sourceDb === sidB.sourceDb &&\n      sidA.sourceId !== sidB.sourceId));\n    debugData(`Mismatches (${mismatches.length}): ${JSON.stringify(mismatches)}`);\n\n    // If there's at least one mismatching source ID from matching source db\n    if (mismatches.length > 0) {\n      return -1;\n    }\n\n    // If there's at least one matching source ID from matching source db\n    if (matches.length > 0) {\n      return 1;\n    }\n\n    // If there are no source IDs with matching sources\n    return 0;\n\n  }\n});\n"],
+  "mappings": "AACA,OAAO,uBAAuB;AAC9B,SAAQ,gCAAgC,yBAAwB;AAEhE,MAAM,QAAQ,kBAAkB,2EAA2E;AAC3G,MAAM,YAAY,MAAM,OAAO,MAAM;AAuBrC,eAAe,OAAO;AAAA,EACpB,MAAM;AAAA,EACN,SAAS,CAAC,EAAC,QAAQ,eAAc,MAAM;AACrC,UAAM,QAAQ,kBAAkB,eAAe,QAAQ,eAAe,QAAQ;AAC9E,UAAM,mEAAmE,KAAK,EAAE;AAEhF,UAAM,QAAQ,OAAO,IAAI,KAAK;AAC9B,cAAU,eAAe,MAAM,MAAM,MAAM,KAAK,UAAU,KAAK,CAAC,EAAE;AAElE,UAAM,cAAc,eAAe,KAAK;AACxC,cAAU,iBAAiB,YAAY,MAAM,MAAM,KAAK,UAAU,WAAW,CAAC,EAAE;AAEhF,WAAO;AAEP,aAAS,eAAeA,QAAO;AAC7B,YAAM,qCAAqC;AAG3C,YAAMC,eAAcD,OAAM,IAAI,YAAY,EAAE,OAAO,iBAAe,WAAW;AAC7E,aAAOC;AAEP,eAAS,aAAa,OAAO;AAC3B,cAAM,8BAA8B;AAEpC,eAAO,+BAA+B,KAAK,IAAI,iBAAiB,KAAK,IAAI;AAEzE,iBAAS,iBAAiBC,QAAO;AAC/B,gBAAM,+BAA+B;AACrC,gBAAM,CAAC,GAAG,IAAI,kBAAkBA,QAAO,GAAG;AAC1C,gBAAM,CAAC,GAAG,IAAI,kBAAkBA,QAAO,GAAG;AAE1C,oBAAU,GAAG,KAAK,UAAU,GAAG,CAAC,MAAM,KAAK,UAAU,GAAG,CAAC,EAAE;AAC3D,oBAAU,aAAa,GAAG,eAAe,GAAG,EAAE;AAC9C,iBAAO,EAAC,YAAY,KAAK,YAAY,IAAG;AAAA,QAC1C;AAAA,MACF;AAAA,IAEF;AAAA,EAEF;AAAA,EACA,SAAS,CAAC,GAAG,MAAM;AAEjB,cAAU,aAAa,KAAK,UAAU,CAAC,CAAC,QAAQ,KAAK,UAAU,CAAC,CAAC,EAAE;AAEnE,UAAM,UAAU,EAAE,OAAO,UAAQ,EAAE,KAAK,UAAQ,KAAK,aAAa,KAAK,YACrE,KAAK,aAAa,KAAK,QAAQ,CAAC;AAClC,cAAU,YAAY,QAAQ,MAAM,MAAM,KAAK,UAAU,OAAO,CAAC,EAAE;AAEnE,UAAM,aAAa,EAAE,OAAO,UAAQ,EAAE,KAAK,UAAQ,KAAK,aAAa,KAAK,YACxE,KAAK,aAAa,KAAK,QAAQ,CAAC;AAClC,cAAU,eAAe,WAAW,MAAM,MAAM,KAAK,UAAU,UAAU,CAAC,EAAE;AAG5E,QAAI,WAAW,SAAS,GAAG;AACzB,aAAO;AAAA,IACT;AAGA,QAAI,QAAQ,SAAS,GAAG;AACtB,aAAO;AAAA,IACT;AAGA,WAAO;AAAA,EAET;AACF;",
+  "names": ["fSids", "sidFeatures", "field"]
+}

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

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

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

@@ -1 +1,7 @@
-{"version":3,"file":"authors.js","names":["_natural","require","_matchingUtils","_default","nameTreshold","name","extract","record","authors","get","map","subfields","filter","code","value","includes","toObj","reduce","acc","v","testStringOrNumber","String","replace","toLowerCase","id","compare","a","b","maxAuthors","length","matchingIds","findMatchingIds","matchingNames","findMatchingNames","idPoints","namePoints","totalPoints","findMatches","distance","leven","maxLength","getMaxLength","percentage","key","cb","valuesA","o","valuesB","allValues","concat","occurrance","otherValue","exports","default"],"sources":["../../../../src/match-detection/features/bib/authors.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport {LevenshteinDistance as leven} from 'natural';\nimport {testStringOrNumber} from '../../../matching-utils';\n\n// We should extract also organisational authors (110/710)\n\nexport default ({nameTreshold = 10} = {}) => ({\n  name: 'Authors',\n  extract: ({record}) => {\n    //const label = recordExternal && recordExternal.label ? recordExternal.label : 'record';\n    const authors = record.get(/^(?<def>100|700)$/u)\n      .map(({subfields}) => {\n        return subfields\n          .filter(({code, value}) => code && value)\n          .filter(({code}) => ['a', '0'].includes(code))\n          .map(toObj)\n          .reduce((acc, v) => ({...acc, ...v}), {});\n\n        function toObj({code, value}) {\n          if (code === 'a') {\n            return {name: testStringOrNumber(value) ? String(value).replace(/[^\\p{Letter}\\p{Number}]/gu, '').toLowerCase() : ''};\n          }\n\n          return {id: value};\n        }\n      });\n    return authors;\n  },\n  compare: (a, b) => {\n    const maxAuthors = a.length > b.length ? a.length : b.length;\n    const matchingIds = findMatchingIds();\n\n    if (maxAuthors >= 3 && matchingIds >= 3) {\n      return 0.3;\n    }\n\n    const matchingNames = findMatchingNames();\n    const idPoints = matchingIds / maxAuthors * 0.3;\n    const namePoints = matchingNames / maxAuthors * 0.2;\n    const totalPoints = idPoints + namePoints;\n\n    return totalPoints <= 0.2 ? totalPoints : 0.2;\n\n    function findMatchingIds() {\n      return findMatches('id', (a, b) => a === b);\n    }\n\n    function findMatchingNames() {\n      return findMatches('name', (a, b) => {\n        const distance = leven(a, b);\n\n        if (distance === 0) {\n          return true;\n        }\n\n        const maxLength = getMaxLength();\n        const percentage = distance / maxLength * 100;\n\n        return percentage <= nameTreshold;\n\n        function getMaxLength() {\n          return a.length > b.length ? a.length : b.length;\n        }\n      });\n    }\n\n    function findMatches(key, cb) {\n      const valuesA = a.filter(o => o[key]).map(o => o[key]);\n      const valuesB = b.filter(o => o[key]).map(o => o[key]);\n      const allValues = valuesA.concat(valuesB);\n\n      return allValues.reduce((acc, value) => {\n        const occurrance = allValues.filter(otherValue => cb(value, otherValue)).length;\n        return occurrance >= 2 ? acc + 1 : acc;\n      }, 0);\n    }\n  }\n});\n"],"mappings":";;;;;;AA4BA,IAAAA,QAAA,GAAAC,OAAA;AACA,IAAAC,cAAA,GAAAD,OAAA;AA7BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAKA;AAAA,IAAAE,QAAA,GAEeA,CAAC;EAACC,YAAY,GAAG;AAAE,CAAC,GAAG,CAAC,CAAC,MAAM;EAC5CC,IAAI,EAAE,SAAS;EACfC,OAAO,EAAEA,CAAC;IAACC;EAAM,CAAC,KAAK;IACrB;IACA,MAAMC,OAAO,GAAGD,MAAM,CAACE,GAAG,CAAC,oBAAoB,CAAC,CAC7CC,GAAG,CAAC,CAAC;MAACC;IAAS,CAAC,KAAK;MACpB,OAAOA,SAAS,CACbC,MAAM,CAAC,CAAC;QAACC,IAAI;QAAEC;MAAK,CAAC,KAAKD,IAAI,IAAIC,KAAK,CAAC,CACxCF,MAAM,CAAC,CAAC;QAACC;MAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAACE,QAAQ,CAACF,IAAI,CAAC,CAAC,CAC7CH,GAAG,CAACM,KAAK,CAAC,CACVC,MAAM,CAAC,CAACC,GAAG,EAAEC,CAAC,MAAM;QAAC,GAAGD,GAAG;QAAE,GAAGC;MAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;MAE3C,SAASH,KAAKA,CAAC;QAACH,IAAI;QAAEC;MAAK,CAAC,EAAE;QAC5B,IAAID,IAAI,KAAK,GAAG,EAAE;UAChB,OAAO;YAACR,IAAI,EAAE,IAAAe,iCAAkB,EAACN,KAAK,CAAC,GAAGO,MAAM,CAACP,KAAK,CAAC,CAACQ,OAAO,CAAC,2BAA2B,EAAE,EAAE,CAAC,CAACC,WAAW,CAAC,CAAC,GAAG;UAAE,CAAC;QACtH;QAEA,OAAO;UAACC,EAAE,EAAEV;QAAK,CAAC;MACpB;IACF,CAAC,CAAC;IACJ,OAAON,OAAO;EAChB,CAAC;EACDiB,OAAO,EAAEA,CAACC,CAAC,EAAEC,CAAC,KAAK;IACjB,MAAMC,UAAU,GAAGF,CAAC,CAACG,MAAM,GAAGF,CAAC,CAACE,MAAM,GAAGH,CAAC,CAACG,MAAM,GAAGF,CAAC,CAACE,MAAM;IAC5D,MAAMC,WAAW,GAAGC,eAAe,CAAC,CAAC;IAErC,IAAIH,UAAU,IAAI,CAAC,IAAIE,WAAW,IAAI,CAAC,EAAE;MACvC,OAAO,GAAG;IACZ;IAEA,MAAME,aAAa,GAAGC,iBAAiB,CAAC,CAAC;IACzC,MAAMC,QAAQ,GAAGJ,WAAW,GAAGF,UAAU,GAAG,GAAG;IAC/C,MAAMO,UAAU,GAAGH,aAAa,GAAGJ,UAAU,GAAG,GAAG;IACnD,MAAMQ,WAAW,GAAGF,QAAQ,GAAGC,UAAU;IAEzC,OAAOC,WAAW,IAAI,GAAG,GAAGA,WAAW,GAAG,GAAG;IAE7C,SAASL,eAAeA,CAAA,EAAG;MACzB,OAAOM,WAAW,CAAC,IAAI,EAAE,CAACX,CAAC,EAAEC,CAAC,KAAKD,CAAC,KAAKC,CAAC,CAAC;IAC7C;IAEA,SAASM,iBAAiBA,CAAA,EAAG;MAC3B,OAAOI,WAAW,CAAC,MAAM,EAAE,CAACX,CAAC,EAAEC,CAAC,KAAK;QACnC,MAAMW,QAAQ,GAAG,IAAAC,4BAAK,EAACb,CAAC,EAAEC,CAAC,CAAC;QAE5B,IAAIW,QAAQ,KAAK,CAAC,EAAE;UAClB,OAAO,IAAI;QACb;QAEA,MAAME,SAAS,GAAGC,YAAY,CAAC,CAAC;QAChC,MAAMC,UAAU,GAAGJ,QAAQ,GAAGE,SAAS,GAAG,GAAG;QAE7C,OAAOE,UAAU,IAAItC,YAAY;QAEjC,SAASqC,YAAYA,CAAA,EAAG;UACtB,OAAOf,CAAC,CAACG,MAAM,GAAGF,CAAC,CAACE,MAAM,GAAGH,CAAC,CAACG,MAAM,GAAGF,CAAC,CAACE,MAAM;QAClD;MACF,CAAC,CAAC;IACJ;IAEA,SAASQ,WAAWA,CAACM,GAAG,EAAEC,EAAE,EAAE;MAC5B,MAAMC,OAAO,GAAGnB,CAAC,CAACd,MAAM,CAACkC,CAAC,IAAIA,CAAC,CAACH,GAAG,CAAC,CAAC,CAACjC,GAAG,CAACoC,CAAC,IAAIA,CAAC,CAACH,GAAG,CAAC,CAAC;MACtD,MAAMI,OAAO,GAAGpB,CAAC,CAACf,MAAM,CAACkC,CAAC,IAAIA,CAAC,CAACH,GAAG,CAAC,CAAC,CAACjC,GAAG,CAACoC,CAAC,IAAIA,CAAC,CAACH,GAAG,CAAC,CAAC;MACtD,MAAMK,SAAS,GAAGH,OAAO,CAACI,MAAM,CAACF,OAAO,CAAC;MAEzC,OAAOC,SAAS,CAAC/B,MAAM,CAAC,CAACC,GAAG,EAAEJ,KAAK,KAAK;QACtC,MAAMoC,UAAU,GAAGF,SAAS,CAACpC,MAAM,CAACuC,UAAU,IAAIP,EAAE,CAAC9B,KAAK,EAAEqC,UAAU,CAAC,CAAC,CAACtB,MAAM;QAC/E,OAAOqB,UAAU,IAAI,CAAC,GAAGhC,GAAG,GAAG,CAAC,GAAGA,GAAG;MACxC,CAAC,EAAE,CAAC,CAAC;IACP;EACF;AACF,CAAC,CAAC;AAAAkC,OAAA,CAAAC,OAAA,GAAAlD,QAAA"}
+{
+  "version": 3,
+  "sources": ["../../../../src/match-detection/features/bib/authors.js"],
+  "sourcesContent": ["\n\nimport naturalPkg from 'natural';\nconst {LevenshteinDistance: leven} = naturalPkg;\nimport {testStringOrNumber} from '../../../matching-utils.js';\n\n// We should extract also organisational authors (110/710)\n\nexport default ({nameTreshold = 10} = {}) => ({\n  name: 'Authors',\n  extract: ({record}) => {\n    //const label = recordExternal && recordExternal.label ? recordExternal.label : 'record';\n    const authors = record.get(/^(?<def>100|700)$/u)\n      .map(({subfields}) => {\n        return subfields\n          .filter(({code, value}) => code && value)\n          .filter(({code}) => ['a', '0'].includes(code))\n          .map(toObj)\n          .reduce((acc, v) => ({...acc, ...v}), {});\n\n        function toObj({code, value}) {\n          if (code === 'a') {\n            return {name: testStringOrNumber(value) ? String(value).replace(/[^\\p{Letter}\\p{Number}]/gu, '').toLowerCase() : ''};\n          }\n\n          return {id: value};\n        }\n      });\n    return authors;\n  },\n  compare: (a, b) => {\n    const maxAuthors = a.length > b.length ? a.length : b.length;\n    const matchingIds = findMatchingIds();\n\n    if (maxAuthors >= 3 && matchingIds >= 3) {\n      return 0.3;\n    }\n\n    const matchingNames = findMatchingNames();\n    const idPoints = matchingIds / maxAuthors * 0.3;\n    const namePoints = matchingNames / maxAuthors * 0.2;\n    const totalPoints = idPoints + namePoints;\n\n    return totalPoints <= 0.2 ? totalPoints : 0.2;\n\n    function findMatchingIds() {\n      return findMatches('id', (a, b) => a === b);\n    }\n\n    function findMatchingNames() {\n      return findMatches('name', (a, b) => {\n        const distance = leven(a, b);\n\n        if (distance === 0) {\n          return true;\n        }\n\n        const maxLength = getMaxLength();\n        const percentage = distance / maxLength * 100;\n\n        return percentage <= nameTreshold;\n\n        function getMaxLength() {\n          return a.length > b.length ? a.length : b.length;\n        }\n      });\n    }\n\n    function findMatches(key, cb) {\n      const valuesA = a.filter(o => o[key]).map(o => o[key]);\n      const valuesB = b.filter(o => o[key]).map(o => o[key]);\n      const allValues = valuesA.concat(valuesB);\n\n      return allValues.reduce((acc, value) => {\n        const occurrance = allValues.filter(otherValue => cb(value, otherValue)).length;\n        return occurrance >= 2 ? acc + 1 : acc;\n      }, 0);\n    }\n  }\n});\n"],
+  "mappings": "AAEA,OAAO,gBAAgB;AACvB,MAAM,EAAC,qBAAqB,MAAK,IAAI;AACrC,SAAQ,0BAAyB;AAIjC,eAAe,CAAC,EAAC,eAAe,GAAE,IAAI,CAAC,OAAO;AAAA,EAC5C,MAAM;AAAA,EACN,SAAS,CAAC,EAAC,OAAM,MAAM;AAErB,UAAM,UAAU,OAAO,IAAI,oBAAoB,EAC5C,IAAI,CAAC,EAAC,UAAS,MAAM;AACpB,aAAO,UACJ,OAAO,CAAC,EAAC,MAAM,MAAK,MAAM,QAAQ,KAAK,EACvC,OAAO,CAAC,EAAC,KAAI,MAAM,CAAC,KAAK,GAAG,EAAE,SAAS,IAAI,CAAC,EAC5C,IAAI,KAAK,EACT,OAAO,CAAC,KAAK,OAAO,EAAC,GAAG,KAAK,GAAG,EAAC,IAAI,CAAC,CAAC;AAE1C,eAAS,MAAM,EAAC,MAAM,MAAK,GAAG;AAC5B,YAAI,SAAS,KAAK;AAChB,iBAAO,EAAC,MAAM,mBAAmB,KAAK,IAAI,OAAO,KAAK,EAAE,QAAQ,6BAA6B,EAAE,EAAE,YAAY,IAAI,GAAE;AAAA,QACrH;AAEA,eAAO,EAAC,IAAI,MAAK;AAAA,MACnB;AAAA,IACF,CAAC;AACH,WAAO;AAAA,EACT;AAAA,EACA,SAAS,CAAC,GAAG,MAAM;AACjB,UAAM,aAAa,EAAE,SAAS,EAAE,SAAS,EAAE,SAAS,EAAE;AACtD,UAAM,cAAc,gBAAgB;AAEpC,QAAI,cAAc,KAAK,eAAe,GAAG;AACvC,aAAO;AAAA,IACT;AAEA,UAAM,gBAAgB,kBAAkB;AACxC,UAAM,WAAW,cAAc,aAAa;AAC5C,UAAM,aAAa,gBAAgB,aAAa;AAChD,UAAM,cAAc,WAAW;AAE/B,WAAO,eAAe,MAAM,cAAc;AAE1C,aAAS,kBAAkB;AACzB,aAAO,YAAY,MAAM,CAACA,IAAGC,OAAMD,OAAMC,EAAC;AAAA,IAC5C;AAEA,aAAS,oBAAoB;AAC3B,aAAO,YAAY,QAAQ,CAACD,IAAGC,OAAM;AACnC,cAAM,WAAW,MAAMD,IAAGC,EAAC;AAE3B,YAAI,aAAa,GAAG;AAClB,iBAAO;AAAA,QACT;AAEA,cAAM,YAAY,aAAa;AAC/B,cAAM,aAAa,WAAW,YAAY;AAE1C,eAAO,cAAc;AAErB,iBAAS,eAAe;AACtB,iBAAOD,GAAE,SAASC,GAAE,SAASD,GAAE,SAASC,GAAE;AAAA,QAC5C;AAAA,MACF,CAAC;AAAA,IACH;AAEA,aAAS,YAAY,KAAK,IAAI;AAC5B,YAAM,UAAU,EAAE,OAAO,OAAK,EAAE,GAAG,CAAC,EAAE,IAAI,OAAK,EAAE,GAAG,CAAC;AACrD,YAAM,UAAU,EAAE,OAAO,OAAK,EAAE,GAAG,CAAC,EAAE,IAAI,OAAK,EAAE,GAAG,CAAC;AACrD,YAAM,YAAY,QAAQ,OAAO,OAAO;AAExC,aAAO,UAAU,OAAO,CAAC,KAAK,UAAU;AACtC,cAAM,aAAa,UAAU,OAAO,gBAAc,GAAG,OAAO,UAAU,CAAC,EAAE;AACzE,eAAO,cAAc,IAAI,MAAM,IAAI;AAAA,MACrC,GAAG,CAAC;AAAA,IACN;AAAA,EACF;AACF;",
+  "names": ["a", "b"]
+}