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

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":["detection","detectionOptions","search","searchOptions","maxMatches","maxCandidates","returnStrategy","returnQuery","returnNonMatches","returnFailures","debug","createDebugLogger","debugData","extend","JSON","stringify","detect","createDetectionInterface","record","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","detectionResult","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 => {\n    const search = createSearchInterface({...searchOptions, record, maxCandidates});\n    return iterate({});\n\n    // candidateCount : amount of candidate records retrived from SRU for matching, NOT including current record set\n    // matches : candidates that have been detected as matches by current matcher job\n    // nonMatches : candidates that have been detected as non-matches by current matcher job (only if returnNonMatches is 'true')\n    // duplicateCount : amount of candidate records that were retrieved from the SRU but not handled further because they were already found in the matches/nonMatches\n\n    // state.totalRecords : amount of candidate records available to the current query (undefined, if there was no queries left)\n    // state.query : current query (undefined if there was no queries left)\n    // state.searchCounter : sequence for current search for current query (undefined, if there we no queries left)\n    // state.queryCandidateCounter: amount of candidate records retrieved from SRU for matching for current query, including the current record set (undefined if there were no queries left)\n    // state.queriesLeft : amount of queries left\n    // state.queryCounter : sequence for current query\n    // state.maxedQueries : queries that resulted in more than serverMaxResults hits\n\n    async function iterate({initialState = {}, matches = [], candidateCount = 0, nonMatches = [], duplicateCount = 0, nonMatchCount = 0, 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-statement\n        if (returnNonMatches) {\n          debugData(`- Amount of new nonMatches from record set: ${matchResult.nonMatches.length}`);\n        }\n\n        const newMatches = matches.concat(returnQuery ? addQuery(matchResult.matches) : matchResult.matches);\n        const newNonMatches = returnNonMatches ? nonMatches.concat(returnQuery ? addQuery(matchResult.nonMatches) : matchResult.nonMatches) : [];\n        const newMatchErrors = matchErrors.concat(matchResult.matchErrors);\n\n        debugData(`- Total amount of matches: ${newMatches.length}`);\n        // eslint-disable-next-line functional/no-conditional-statement\n        if (returnNonMatches) {\n          debugData(`- Total amount of nonMatches: ${newNonMatches.length}`);\n        }\n\n        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} : {matches, matchStatus};\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    // eslint-disable-next-line max-statements\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      debug(`${JSON.stringify(result)}`);\n      */\n\n      if (candidate) {\n\n        // eslint-disable-next-line functional/no-conditional-statement\n        if (candidateNotInMatches(matches.concat(nonMatches), candidate)) {\n          const {record: candidateRecord, id: candidateId} = candidate;\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(record, candidateRecord);\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-statement\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;;AACA;;;;AACA;;;;;;;;;;AA9BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAKA;eAIe,CAAC;EAACA,SAAS,EAAEC,gBAAZ;EAA8BC,MAAM,EAAEC,aAAtC;EAAqDC,UAAU,GAAG,CAAlE;EAAqEC,aAAa,GAAG,EAArF;EAAyFC,cAAc,GAAG,KAA1G;EAAiHC,WAAW,GAAG,KAA/H;EAAsIC,gBAAgB,GAAG,KAAzJ;EAAgKC,cAAc,GAAG;AAAjL,CAAD,KAA6L;EAC1M,MAAMC,KAAK,GAAG,IAAAC,cAAA,EAAkB,yCAAlB,CAAd;EACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;EAEAD,SAAS,CAAE,qBAAoBE,IAAI,CAACC,SAAL,CAAed,gBAAf,CAAiC,EAAvD,CAAT;EACAW,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAL,CAAeZ,aAAf,CAA8B,EAAjD,CAAT;EACAS,SAAS,CAAE,eAAcE,IAAI,CAACC,SAAL,CAAeX,UAAf,CAA2B,EAA3C,CAAT;EACAQ,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAL,CAAeV,aAAf,CAA8B,EAAjD,CAAT;EACAO,SAAS,CAAE,mBAAkBE,IAAI,CAACC,SAAL,CAAeT,cAAf,CAA+B,EAAnD,CAAT;EACAM,SAAS,CAAE,gBAAeE,IAAI,CAACC,SAAL,CAAeR,WAAf,CAA4B,EAA7C,CAAT;EACAK,SAAS,CAAE,qBAAoBE,IAAI,CAACC,SAAL,CAAeP,gBAAf,CAAiC,EAAvD,CAAT;EACAI,SAAS,CAAE,mBAAkBE,IAAI,CAACC,SAAL,CAAeN,cAAf,CAA+B,EAAnD,CAAT;EAGA,MAAMO,MAAM,GAAG,IAAAC,sBAAA,EAAyBhB,gBAAzB,EAA2CK,cAA3C,CAAf;EAEA,OAAOY,MAAM,IAAI;IACf,MAAMhB,MAAM,GAAG,IAAAiB,uBAAA,EAAsB,EAAC,GAAGhB,aAAJ;MAAmBe,MAAnB;MAA2Bb;IAA3B,CAAtB,CAAf;IACA,OAAOe,OAAO,CAAC,EAAD,CAAd,CAFe,CAIf;IACA;IACA;IACA;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;;IAEA,eAAeA,OAAf,CAAuB;MAACC,YAAY,GAAG,EAAhB;MAAoBC,OAAO,GAAG,EAA9B;MAAkCC,cAAc,GAAG,CAAnD;MAAsDC,UAAU,GAAG,EAAnE;MAAuEC,cAAc,GAAG,CAAxF;MAA2FC,aAAa,GAAG,CAA3G;MAA8GC,kBAAkB,GAAG,EAAnI;MAAuIC,WAAW,GAAG;IAArJ,CAAvB,EAAiL;MAC/KhB,SAAS,CAAE,kCAAF,CAAT;MACA,MAAM;QAACiB,OAAD;QAAUC,QAAV;QAAoB,GAAGC;MAAvB,IAAgC,MAAM7B,MAAM,CAACmB,YAAD,CAAlD;MAEAT,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAL,CAAegB,KAAf,CAAsB,cAAaT,OAAO,CAACU,MAAO,qBAAoBT,cAAe,iBAAgBC,UAAU,CAACQ,MAAO,oBAAmBN,aAAc,yBAAwBC,kBAAmB,kBAAiBC,WAAW,CAACI,MAAO,EAA1P,CAAT;MACA,MAAMC,aAAa,GAAGJ,OAAO,CAACG,MAA9B;MACA,MAAME,cAAc,GAAGJ,QAAQ,CAACE,MAAhC;MACA,MAAMG,iBAAiB,GAAGZ,cAAc,GAAGU,aAAjB,GAAiCC,cAA3D;MAEA,MAAME,qBAAqB,GAAGT,kBAAkB,CAACU,MAAnB,CAA0BP,QAA1B,CAA9B;MACAlB,SAAS,CAAE,aAAYkB,QAAQ,CAACE,MAAO,yBAAwBL,kBAAkB,CAACK,MAAO,4BAA2BI,qBAAqB,CAACJ,MAAO,EAAxI,CAAT;;MAEA,IAAIC,aAAa,GAAG,CAApB,EAAuB;QACrB,OAAOK,eAAe,EAAtB;MACD;;MAED,IAAIP,KAAK,CAACQ,WAAN,GAAoB,CAAxB,EAA2B;QACzB7B,KAAK,CAAE,oBAAmBqB,KAAK,CAACS,aAAc,QAAOT,KAAK,CAACU,KAAM,mBAAkBV,KAAK,CAACQ,WAAY,eAAhG,CAAL;QACA,OAAOnB,OAAO,CAAC;UAACC,YAAY,EAAEU,KAAf;UAAsBT,OAAtB;UAA+BC,cAAc,EAAEY,iBAA/C;UAAkEX,UAAlE;UAA8EE,aAA9E;UAA6FD,cAA7F;UAA6GE,kBAAkB,EAAES,qBAAjI;UAAwJR;QAAxJ,CAAD,CAAd;MACD;;MAEDlB,KAAK,CAAE,wEAAuEY,OAAO,CAACU,MAAO,EAAxF,CAAL;MACA,OAAOU,YAAY,CAAC;QAACpB,OAAD;QAAUS,KAAV;QAAiBY,UAAU,EAAE,EAA7B;QAAiCnB,UAAjC;QAA6CE,aAA7C;QAA4DH,cAAc,EAAEY,iBAA5E;QAA+FV,cAA/F;QAA+GE,kBAAkB,EAAES,qBAAnI;QAA0JR;MAA1J,CAAD,CAAnB;;MAEA,SAASU,eAAT,GAA2B;QACzB5B,KAAK,CAAE,0BAAyBuB,aAAc,qDAAoDF,KAAK,CAACS,aAAc,eAAcT,KAAK,CAACU,KAAM,EAA3I,CAAL;QAEA,MAAMG,WAAW,GAAGC,cAAc,CAAC;UAAChB,OAAD;UAAUI,aAAV;UAAyB7B,UAAzB;UAAqCkB,OAArC;UAA8CE,UAA9C;UAA0DE;QAA1D,CAAD,CAAlC;QAEA,MAAMoB,iBAAiB,GAAGrB,cAAc,GAAGmB,WAAW,CAACnB,cAAvD;QACA,MAAMsB,gBAAgB,GAAGrB,aAAa,GAAGkB,WAAW,CAAClB,aAArD;QACA,MAAM;UAACsB,UAAD;UAAaC,aAAb;UAA4BC;QAA5B,IAA8CC,iBAAiB,CAACP,WAAD,EAActB,OAAd,EAAuBE,UAAvB,EAAmCI,WAAnC,CAArE;;QAEA,IAAIwB,eAAe,CAAC;UAAC9B,OAAO,EAAE0B,UAAV;UAAsB5C;QAAtB,CAAD,CAAnB,EAAwD;UACtD,OAAOsC,YAAY,CAAC;YAACpB,OAAO,EAAE0B,UAAV;YAAsBjB,KAAtB;YAA6BY,UAAU,EAAE,YAAzC;YAAuDnB,UAAU,EAAEyB,aAAnE;YAAkFxB,cAAc,EAAEqB,iBAAlG;YAAqHvB,cAAc,EAAEY,iBAArI;YAAwJT,aAAa,EAAEqB,gBAAvK;YAAyLpB,kBAAkB,EAAES,qBAA7M;YAAoOR,WAAW,EAAEsB;UAAjP,CAAD,CAAnB;QACD;;QAED,IAAIG,sBAAsB,CAAClB,iBAAD,EAAoB9B,aAApB,CAA1B,EAA8D;UAC5D,OAAOqC,YAAY,CAAC;YAACpB,OAAO,EAAE0B,UAAV;YAAsBjB,KAAtB;YAA6BY,UAAU,EAAE,eAAzC;YAA0DnB,UAAU,EAAEyB,aAAtE;YAAqFxB,cAAc,EAAEqB,iBAArG;YAAwHvB,cAAc,EAAEY,iBAAxI;YAA2JT,aAAa,EAAEqB,gBAA1K;YAA4LpB,kBAAkB,EAAES,qBAAhN;YAAuOR,WAAW,EAAEsB;UAApP,CAAD,CAAnB;QACD;;QAED,OAAO9B,OAAO,CAAC;UAACC,YAAY,EAAEU,KAAf;UAAsBT,OAAO,EAAE0B,UAA/B;UAA2CzB,cAAc,EAAEY,iBAA3D;UAA8EX,UAAU,EAAEyB,aAA1F;UAAyGxB,cAAc,EAAEqB,iBAAzH;UAA4IpB,aAAa,EAAEqB,gBAA3J;UAA6KpB,kBAAkB,EAAES,qBAAjM;UAAwNR,WAAW,EAAEsB;QAArO,CAAD,CAAd;MACD;;MAED,SAASC,iBAAT,CAA2BP,WAA3B,EAAwCtB,OAAxC,EAAiDE,UAAjD,EAA6DI,WAA7D,EAA0E;QACxEhB,SAAS,CAAE,4CAA2CgC,WAAW,CAACtB,OAAZ,CAAoBU,MAAO,EAAxE,CAAT,CADwE,CAExE;;QACA,IAAIxB,gBAAJ,EAAsB;UACpBI,SAAS,CAAE,+CAA8CgC,WAAW,CAACpB,UAAZ,CAAuBQ,MAAO,EAA9E,CAAT;QACD;;QAED,MAAMgB,UAAU,GAAG1B,OAAO,CAACe,MAAR,CAAe9B,WAAW,GAAG+C,QAAQ,CAACV,WAAW,CAACtB,OAAb,CAAX,GAAmCsB,WAAW,CAACtB,OAAzE,CAAnB;QACA,MAAM2B,aAAa,GAAGzC,gBAAgB,GAAGgB,UAAU,CAACa,MAAX,CAAkB9B,WAAW,GAAG+C,QAAQ,CAACV,WAAW,CAACpB,UAAb,CAAX,GAAsCoB,WAAW,CAACpB,UAA/E,CAAH,GAAgG,EAAtI;QACA,MAAM0B,cAAc,GAAGtB,WAAW,CAACS,MAAZ,CAAmBO,WAAW,CAAChB,WAA/B,CAAvB;QAEAhB,SAAS,CAAE,8BAA6BoC,UAAU,CAAChB,MAAO,EAAjD,CAAT,CAXwE,CAYxE;;QACA,IAAIxB,gBAAJ,EAAsB;UACpBI,SAAS,CAAE,iCAAgCqC,aAAa,CAACjB,MAAO,EAAvD,CAAT;QACD;;QAEDpB,SAAS,CAAE,gBAAeE,IAAI,CAACC,SAAL,CAAe6B,WAAf,CAA4B,EAA7C,CAAT;QACAhC,SAAS,CAAE,oBAAmBE,IAAI,CAACC,SAAL,CAAea,WAAf,CAA4B,mCAAkCd,IAAI,CAACC,SAAL,CAAe6B,WAAW,CAAChB,WAA3B,CAAwC,sBAAqBd,IAAI,CAACC,SAAL,CAAemC,cAAf,CAA+B,EAA/K,CAAT;QAEAtC,SAAS,CAAE,kCAAiCsC,cAAc,CAAClB,MAAO,EAAzD,CAAT;QAEA,OAAO;UAACgB,UAAD;UAAaC,aAAb;UAA4BC;QAA5B,CAAP;MACD;;MAED,SAASI,QAAT,CAAkBhC,OAAlB,EAA2B;QACzBV,SAAS,CAAE,gBAAemB,KAAK,CAACU,KAAM,aAA7B,CAAT;QACA,OAAOnB,OAAO,CAACiC,GAAR,CAAaC,KAAD,KAAY,EAAC,GAAGA,KAAJ;UAAWC,UAAU,EAAE1B,KAAK,CAACU;QAA7B,CAAZ,CAAZ,CAAP;MACD;;MAED,SAASY,sBAAT,CAAgC9B,cAAhC,EAAgDlB,aAAhD,EAA+D;QAC7DO,SAAS,CAAE,gDAA+CuB,iBAAkB,UAAS9B,aAAc,GAA1F,CAAT;;QACA,IAAIA,aAAa,IAAIkB,cAAc,IAAIlB,aAAvC,EAAsD;UACpDK,KAAK,CAAE,gEAA+Da,cAAe,MAAKlB,aAAc,sBAAnG,CAAL;UACA,OAAO,IAAP;QACD;MACF;IACF,CAlGc,CAoGf;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IAEA;IAEA;IACA;IACA;IACA;;;IAEA,SAASqC,YAAT,CAAsB;MAACpB,OAAD;MAAUS,KAAV;MAAiBY,UAAjB;MAA6BnB,UAA7B;MAAyCC,cAAzC;MAAyDF,cAAzD;MAAyEG,aAAzE;MAAwFC,kBAAxF;MAA4GC;IAA5G,CAAtB,EAAgJ;MAC9I,MAAM8B,sBAAsB,GAAG/B,kBAAkB,CAACK,MAAlD;MACA,MAAM2B,eAAe,GAAG/B,WAAW,CAACI,MAApC;MACA4B,WAAW,CAAC;QAACtC,OAAD;QAAUE,UAAV;QAAsBD,cAAtB;QAAsCE,cAAtC;QAAsDC,aAAtD;QAAqEgC,sBAArE;QAA6FC;MAA7F,CAAD,CAAX;MACA,MAAME,WAAW,GAAGC,aAAa,CAAC/B,KAAD,EAAQY,UAAR,EAAoBe,sBAApB,EAA4CC,eAA5C,CAAjC,CAJ8I,CAK9I;;MACA,MAAMI,aAAa,GAAGvD,gBAAgB,GAAG;QAACc,OAAD;QAAUuC,WAAV;QAAuBrC;MAAvB,CAAH,GAAwC;QAACF,OAAD;QAAUuC;MAAV,CAA9E;MACA,MAAM/B,QAAQ,GAAG,CAAC,GAAGH,kBAAJ,EAAwB,GAAGC,WAA3B,CAAjB;MACA,MAAMoC,MAAM,GAAGvD,cAAc,GAAG,EAAC,GAAGsD,aAAJ;QAAmBpC,kBAAkB,EAAEG;MAAvC,CAAH,GAAsDiC,aAAnF;MACAnD,SAAS,CAAE,kBAAiBH,cAAe,EAAlC,CAAT;MACAG,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAL,CAAeiD,MAAf,CAAuB,EAA3B,CAAT;MACA,OAAOA,MAAP,CAX8I,CAa9I;;MAEA,SAASJ,WAAT,CAAqB;QAACtC,OAAD;QAAUE,UAAV;QAAsBD,cAAtB;QAAsCE,cAAtC;QAAsDC,aAAtD;QAAqEgC,sBAArE;QAA6FC;MAA7F,CAArB,EAAoI;QAClI,MAAMM,UAAU,GAAG3C,OAAO,CAACU,MAA3B;QACApB,SAAS,CAAE,sBAAqBJ,gBAAiB,EAAxC,CAAT;QACA,MAAM0D,mBAAmB,GAAG1D,gBAAgB,GAAGgB,UAAU,CAACQ,MAAd,GAAuBN,aAAnE;QACA,MAAMyC,YAAY,GAAGF,UAAU,GAAGC,mBAAb,GAAmCzC,cAAxD;QACAf,KAAK,CAAE,mBAAkBa,cAAe,cAAa0C,UAAW,iBAAgBC,mBAAoB,qBAAoBzC,cAAe,6BAA4BiC,sBAAuB,sBAAqBC,eAAgB,EAA1N,CAAL;QACAjD,KAAK,CAAE,qBAAoByD,YAAa,MAAK5C,cAAe,uBAAvD,CAAL;;QACA,IAAI4C,YAAY,KAAK5C,cAArB,EAAqC;UACnCb,KAAK,CAAE,gCAA+Ba,cAAc,GAAG4C,YAAa,aAA/D,CAAL;UACA;QACD;;QACD;MACD,CA3B6I,CA6B9I;;;MACA,SAASL,aAAT,CAAuB/B,KAAvB,EAA8BY,UAA9B,EAA0CyB,uBAA1C,EAAmET,eAAnE,EAAoF;QAClF/C,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAL,CAAegB,KAAf,CAAsB,EAA1B,CAAT;QACArB,KAAK,CAAE,UAAS0D,uBAAwB,oDAAnC,CAAL;QACA1D,KAAK,CAAE,UAASiD,eAAgB,uDAA3B,CAAL;QACAjD,KAAK,CAAE,gBAAeqB,KAAK,CAACQ,WAAY,sCAAqCR,KAAK,CAACsC,eAAN,IAAyBtC,KAAK,CAACsC,eAAN,IAAyBtC,KAAK,CAACuC,YAAa,4BAA2BvC,KAAK,CAACuC,YAAN,GAAqBvC,KAAK,CAACwC,qBAAsB,mBAAkBxC,KAAK,CAACyC,YAAN,CAAmBxC,MAAO,MAAKD,KAAK,CAACyC,YAAa,EAA7R,CAAL;QAEA5D,SAAS,CAAE,gBAAe+B,UAAW,GAA5B,CAAT;QAEA,MAAM8B,YAAY,GAAG1C,KAAK,CAACsC,eAAN,IAAyBtC,KAAK,CAACsC,eAAN,IAAyBtC,KAAK,CAACuC,YAA7E;QACA,MAAMI,YAAY,GAAGD,YAAY,GAAG1C,KAAK,CAACuC,YAAN,GAAqBvC,KAAK,CAACwC,qBAA9B,GAAsD,CAAvF;QACA3D,SAAS,CAAE,iBAAgB8D,YAAa,EAA/B,CAAT,CAVkF,CAYlF;QACA;;QAEA,IAAI3C,KAAK,CAACQ,WAAN,GAAoB,CAApB,IAAyBmC,YAAY,GAAG,CAAxC,IAA6C3C,KAAK,CAACyC,YAAN,CAAmBxC,MAAnB,GAA4B,CAAzE,IAA8E0B,sBAAsB,GAAG,CAAvG,IAA4GC,eAAe,GAAG,CAAlI,EAAqI;UACnI,MAAMgB,sBAAsB,GAAG5C,KAAK,CAACyC,YAAN,CAAmBxC,MAAnB,GAA4B,CAA5B,GAAgC,cAAhC,GAAiD4C,SAAhF;UACA,MAAMC,4BAA4B,GAAGnB,sBAAsB,GAAG,CAAzB,GAA6B,oBAA7B,GAAoDkB,SAAzF;UACA,MAAME,qBAAqB,GAAGnB,eAAe,GAAG,CAAlB,GAAsB,aAAtB,GAAsCiB,SAApE;UACA,MAAMG,aAAa,GAAGpC,UAAU,KAAK,EAAf,IAAqBA,UAAU,KAAKiC,SAApC,GAAgDD,sBAAsB,IAAIE,4BAA1B,IAA0DC,qBAA1G,GAAkInC,UAAxJ;UACA/B,SAAS,CAAE,4BAA2B+D,sBAAuB,GAApD,CAAT;UACA/D,SAAS,CAAE,gCAA+BiE,4BAA6B,GAA9D,CAAT;UACAjE,SAAS,CAAE,0BAAyBkE,qBAAsB,GAAjD,CAAT;UACAlE,SAAS,CAAE,mBAAkBmE,aAAc,GAAlC,CAAT;UACArE,KAAK,CAAE,qBAAF,CAAL;UACA,OAAO;YAACsE,MAAM,EAAE,KAAT;YAAgBrC,UAAU,EAAEoC;UAA5B,CAAP;QACD;;QAEDrE,KAAK,CAAE,oBAAF,CAAL;QACA,OAAO;UAACsE,MAAM,EAAE,IAAT;UAAerC;QAAf,CAAP;MACD;IACF,CAlLc,CAoLf;IACA;IACA;IACA;IAEA;;;IACA,SAASE,cAAT,CAAwB;MAAChB,OAAD;MAAUI,aAAV;MAAyB7B,UAAzB;MAAqCkB,OAAO,GAAG,EAA/C;MAAmDE,UAAU,GAAG,EAAhE;MAAoEyD,aAAa,GAAG,EAApF;MAAwFC,gBAAgB,GAAG,EAA3G;MAA+GC,WAAW,GAAG,CAA7H;MAAgIC,oBAAoB,GAAG,CAAvJ;MAA0JC,mBAAmB,GAAG,CAAhL;MAAmLC,iBAAiB,GAAG;IAAvM,CAAxB,EAAoO;MAElO;MACA;MACA;MACA;MACA;MAEA;MACA;MACA;MACA;MACA;MAEA,MAAM,CAACC,SAAD,IAAc1D,OAApB;MACA,MAAM2D,cAAc,GAAGD,SAAS,GAAGJ,WAAW,GAAG,CAAjB,GAAqBA,WAArD,CAfkO,CAiBlO;MACA;MACA;MACA;;MAEA;AACN;AACA;AACA;AACA;AACA;AACA;;MAEM,IAAII,SAAJ,EAAe;QAEb;QACA,IAAIE,qBAAqB,CAACnE,OAAO,CAACe,MAAR,CAAeb,UAAf,CAAD,EAA6B+D,SAA7B,CAAzB,EAAkE;UAChE,MAAM;YAACrE,MAAM,EAAEwE,eAAT;YAA0BC,EAAE,EAAEC;UAA9B,IAA6CL,SAAnD;;UACA,IAAI;YACF7E,KAAK,CAAE,qCAAoCkF,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,GAAtF,CAAL,CADE,CAEF;;YACA,MAAM4D,eAAe,GAAG7E,MAAM,CAACE,MAAD,EAASwE,eAAT,CAA9B;YAEA,OAAOI,qBAAqB,CAACD,eAAD,EAAkBD,WAAlB,EAA+BF,eAA/B,CAA5B;UACD,CAND,CAME,OAAOK,KAAP,EAAc;YACdrF,KAAK,CAAE,2CAA0CkF,WAAY,KAAIG,KAAM,EAAlE,CAAL;YAEA,MAAMC,UAAU,GAAG;cAAChB,MAAM,EAAE,GAAT;cAAciB,OAAO,EAAE;gBAACC,OAAO,EAAG,wCAAuCN,WAAY,KAAIG,KAAK,CAACG,OAAQ,GAAhF;gBAAoFP,EAAE,EAAEC;cAAxF;YAAvB,CAAnB;YACA,MAAMO,oBAAoB,GAAGb,iBAAiB,CAACjD,MAAlB,CAAyB2D,UAAzB,CAA7B;YACA,OAAOnD,cAAc,CAAC;cAAChB,OAAO,EAAEA,OAAO,CAACuE,KAAR,CAAc,CAAd,CAAV;cAA4BnE,aAA5B;cAA2C7B,UAA3C;cAAuDkB,OAAvD;cAAgE2D,aAAhE;cAA+EE,WAAW,EAAEK,cAA5F;cAA4GN,gBAA5G;cAA8HE,oBAA9H;cAAoJC,mBAApJ;cAAyKC,iBAAiB,EAAEa;YAA5L,CAAD,CAArB;UACD;QACF;;QAED,OAAOtD,cAAc,CAAC;UAAChB,OAAO,EAAEA,OAAO,CAACuE,KAAR,CAAc,CAAd,CAAV;UAA4BnE,aAA5B;UAA2C7B,UAA3C;UAAuDkB,OAAvD;UAAgE2D,aAAhE;UAA+EE,WAAW,EAAEK,cAA5F;UAA4GN,gBAA5G;UAA8HE,oBAAoB,EAAEA,oBAAoB,GAAG,CAA3K;UAA8KC,mBAA9K;UAAmMC;QAAnM,CAAD,CAArB;MACD;;MAED5E,KAAK,CAAE,mCAAkCyE,WAAY,IAAGlD,aAAc,WAAUgD,aAAa,CAACjD,MAAO,mBAAkBoD,oBAAqB,gCAA+B5E,gBAAgB,GAAI,GAAE0E,gBAAgB,CAAClD,MAAO,EAA9B,GAAmC,GAAEqD,mBAAoB,EAAE,oBAAjP,CAAL;MACA,OAAO;QAAC/D,OAAO,EAAE2D,aAAV;QAAyBzD,UAAU,EAAEhB,gBAAgB,GAAG0E,gBAAH,GAAsB,EAA3E;QAA+EzD,cAAc,EAAE2D,oBAA/F;QAAqH1D,aAAa,EAAE2D,mBAApI;QAAyJzD,WAAW,EAAE0D;MAAtK,CAAP;;MAEA,SAASQ,qBAAT,CAA+BD,eAA/B,EAAgDD,WAAhD,EAA6DF,eAA7D,EAA8E;QAC5E9E,SAAS,CAAE,8BAA6BgF,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,MAAKnB,IAAI,CAACC,SAAL,CAAe8E,eAAf,CAAgC,EAApH,CAAT;;QAEA,IAAIA,eAAe,CAACrC,KAAhB,IAAyBhD,gBAA7B,EAA+C;UAC7CE,KAAK,CAAE,GAAEmF,eAAe,CAACrC,KAAhB,GAAyB,UAASoC,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,eAAlF,GAAoG,UAAS2D,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,mBAAmB,EAApL,CAAL;UACArB,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAL,CAAe8E,eAAe,CAACQ,QAA/B,CAAyC,eAAcvF,IAAI,CAACC,SAAL,CAAe8E,eAAe,CAACS,QAA/B,CAAyC,EAA9G,CAAT;UAEA,MAAM1D,WAAW,GAAG;YAClB2D,WAAW,EAAEV,eAAe,CAACU,WADX;YAElBhB,SAAS,EAAE;cACTI,EAAE,EAAEC,WADK;cAET1E,MAAM,EAAEwE;YAFC;UAFO,CAApB;UAOA,MAAMc,cAAc,GAAG;YACrBH,QAAQ,EAAER,eAAe,CAACQ,QADL;YAErBC,QAAQ,EAAET,eAAe,CAACS;UAFL,CAAvB;UAIA,MAAMG,QAAQ,GAAGnG,cAAc,GAAG,EAAC,GAAGsC,WAAJ;YAAiB,GAAG4D;UAApB,CAAH,GAAyC,EAAC,GAAG5D;UAAJ,CAAxE;UAEAhC,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAL,CAAe0F,QAAf,CAAyB,EAA7B,CAAT;UAEA,OAAOC,iBAAiB,CAACb,eAAe,CAACrC,KAAjB,EAAwBiD,QAAxB,CAAxB;QACD;;QAED,MAAME,sBAAsB,GAAGtB,mBAAmB,GAAG,CAArD;QACAzE,SAAS,CAAE,4CAA2C+F,sBAAuB,EAApE,CAAT;QAEA,OAAO9D,cAAc,CAAC;UAAChB,OAAO,EAAEA,OAAO,CAACuE,KAAR,CAAc,CAAd,CAAV;UAA4BnE,aAA5B;UAA2C7B,UAA3C;UAAuDkB,OAAvD;UAAgE2D,aAAhE;UAA+EE,WAAW,EAAEK,cAA5F;UAA4GN,gBAA5G;UAA8HE,oBAA9H;UAAoJC,mBAAmB,EAAEsB,sBAAzK;UAAiMrB;QAAjM,CAAD,CAArB;MACD;;MAED,SAASoB,iBAAT,CAA2BE,OAA3B,EAAoCH,QAApC,EAA8C;QAC5C,MAAMI,gBAAgB,GAAGD,OAAO,GAAG3B,aAAa,CAAC5C,MAAd,CAAqBoE,QAArB,CAAH,GAAoCxB,aAApE;QACA,MAAM6B,mBAAmB,GAAGF,OAAO,GAAG1B,gBAAH,GAAsBA,gBAAgB,CAAC7C,MAAjB,CAAwBoE,QAAxB,CAAzD;QACA,MAAME,sBAAsB,GAAGC,OAAO,GAAGvB,mBAAH,GAAyBA,mBAAmB,GAAG,CAArF;QAEAzE,SAAS,CAAE,yCAAwCU,OAAO,CAACe,MAAR,CAAewE,gBAAf,EAAiC7E,MAAO,UAAS5B,UAAW,GAAtG,CAAT,CAL4C,CAO5C;;QACA,IAAII,gBAAJ,EAAsB;UACpBI,SAAS,CAAE,4CAA2CY,UAAU,CAACa,MAAX,CAAkByE,mBAAlB,EAAuC9E,MAAO,EAA3F,CAAT;QACD;;QACDpB,SAAS,CAAE,+CAA8CyE,mBAAoB,EAApE,CAAT;;QAEA,IAAIjC,eAAe,CAAC;UAAC9B,OAAO,EAAEA,OAAO,CAACe,MAAR,CAAewE,gBAAf,CAAV;UAA4CzG;QAA5C,CAAD,CAAnB,EAA8E;UAC5EM,KAAK,CAAE,eAAcN,UAAW,gDAA+CoF,cAAe,yCAAwCvD,aAAa,GAAGuD,cAAe,EAAhK,CAAL;UACA,OAAO;YAAClE,OAAO,EAAEuF,gBAAV;YAA4BrF,UAAU,EAAEhB,gBAAgB,GAAGsG,mBAAH,GAAyB,EAAjF;YAAqFrF,cAAc,EAAE2D,oBAArG;YAA2H1D,aAAa,EAAEiF,sBAA1I;YAAkK/E,WAAW,EAAE0D;UAA/K,CAAP;QACD;;QAED,OAAOzC,cAAc,CAAC;UAAChB,OAAO,EAAEA,OAAO,CAACuE,KAAR,CAAc,CAAd,CAAV;UAA4BnE,aAA5B;UAA2C7B,UAA3C;UAAuDkB,OAAvD;UAAgE2D,aAAa,EAAE4B,gBAA/E;UAAiG1B,WAAW,EAAEK,cAA9G;UAA8HN,gBAAgB,EAAE1E,gBAAgB,GAAGsG,mBAAH,GAAyB,EAAzL;UAA6LrF,cAAc,EAAE2D,oBAA7M;UAAmOC,mBAAmB,EAAEsB,sBAAxP;UAAgR/E,WAAW,EAAE0D;QAA7R,CAAD,CAArB;MACD;;MAED,SAASG,qBAAT,CAA+BnE,OAA/B,EAAwCiE,SAAxC,EAAmD;QACjD7E,KAAK,CAAE,wBAAuB6E,SAAS,CAACI,EAAG,+BAA8BrE,OAAO,CAACU,MAAO,qBAAnF,CAAL;QACA,MAAM+E,cAAc,GAAGxB,SAAS,CAACI,EAAjC;QACA/E,SAAS,CAAE,mBAAkBmG,cAAe,EAAnC,CAAT;QACA,MAAM/C,MAAM,GAAG1C,OAAO,CAAC0F,IAAR,CAAa,CAAC;UAACzB;QAAD,CAAD,KAAiBA,SAAS,CAACI,EAAV,KAAiBoB,cAA/C,CAAf;QACAnG,SAAS,CAAE,WAAUoD,MAAO,EAAnB,CAAT;;QACA,IAAIA,MAAJ,EAAY;UACVtD,KAAK,CAAE,GAAE6E,SAAS,CAACI,EAAG,uBAAjB,CAAL;UACA,OAAO,KAAP;QACD;;QACDjF,KAAK,CAAE,GAAE6E,SAAS,CAACI,EAAG,kCAAjB,CAAL;QACA,OAAO,IAAP;MACD;IACF;;IAED,SAASvC,eAAT,CAAyB;MAAC9B,OAAD;MAAUlB;IAAV,CAAzB,EAAgD;MAC9C,IAAIA,UAAU,IAAIkB,OAAO,CAACU,MAAR,IAAkB5B,UAApC,EAAgD;QAC9CM,KAAK,CAAE,6CAA4CN,UAAW,0BAAzD,CAAL;QACA,OAAO,IAAP;MACD;IACF;EACF,CA3TD;AA4TD,C"}

package/dist/index.spec.js

@@ -0,0 +1,133 @@
+"use strict";
+
+var _chai = require("chai");
+
+var _fixura = require("@natlibfi/fixura");
+
+var _fixugenHttpClient = _interopRequireDefault(require("@natlibfi/fixugen-http-client"));
+
+var _marcRecord = require("@natlibfi/marc-record");
+
+var _ = _interopRequireWildcard(require("."));
+
+var _debug = _interopRequireDefault(require("debug"));
+
+function _getRequireWildcardCache(nodeInterop) { if (typeof WeakMap !== "function") return null; var cacheBabelInterop = new WeakMap(); var cacheNodeInterop = new WeakMap(); return (_getRequireWildcardCache = function (nodeInterop) { return nodeInterop ? cacheNodeInterop : cacheBabelInterop; })(nodeInterop); }
+
+function _interopRequireWildcard(obj, nodeInterop) { if (!nodeInterop && obj && obj.__esModule) { return obj; } if (obj === null || typeof obj !== "object" && typeof obj !== "function") { return { default: obj }; } var cache = _getRequireWildcardCache(nodeInterop); if (cache && cache.has(obj)) { return cache.get(obj); } var newObj = {}; var hasPropertyDescriptor = Object.defineProperty && Object.getOwnPropertyDescriptor; for (var key in obj) { if (key !== "default" && Object.prototype.hasOwnProperty.call(obj, key)) { var desc = hasPropertyDescriptor ? Object.getOwnPropertyDescriptor(obj, key) : null; if (desc && (desc.get || desc.set)) { Object.defineProperty(newObj, key, desc); } else { newObj[key] = obj[key]; } } } newObj.default = obj; if (cache) { cache.set(obj, newObj); } return newObj; }
+
+function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)
+*
+* This file is part of melinda-record-matching-js
+*
+* melinda-record-matching-js program is free software: you can redistribute it and/or modify
+* it under the terms of the GNU Lesser General Public License as
+* published by the Free Software Foundation, either version 3 of the
+* License, or (at your option) any later version.
+*
+* melinda-record-matching-js is distributed in the hope that it will be useful,
+* but WITHOUT ANY WARRANTY; without even the implied warranty of
+* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+* GNU Lesser General Public License for more details.
+*
+* You should have received a copy of the GNU Affero General Public License
+* along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*
+* @licend  The above is the entire license notice
+* for the JavaScript code in this file.
+*
+*/
+const debug = (0, _debug.default)('@natlibfi/melinda-record-matching:index:test');
+const debugData = debug.extend('data');
+describe('INDEX', () => {
+  (0, _fixugenHttpClient.default)({
+    callback,
+    path: [__dirname, '..', 'test-fixtures', 'index'],
+    recurse: false,
+    fixura: {
+      reader: _fixura.READERS.JSON
+    }
+  });
+
+  async function callback({
+    getFixture,
+    options,
+    enabled = true,
+    expectedMatchStatus,
+    expectedStopReason,
+    expectedFailures
+  }) {
+    if (!enabled) {
+      debug(`Disabled test!`);
+      return;
+    }
+
+    const record = new _marcRecord.MarcRecord(getFixture('inputRecord.json'), {
+      subfieldValues: false
+    });
+    const expectedMatches = getFixture('expectedMatches.json');
+    const expectedNonMatches = getFixture('expectedNonMatches.json') || [];
+    const match = (0, _.default)(formatOptions());
+    const {
+      matches,
+      matchStatus,
+      nonMatches,
+      conversionFailures
+    } = await match(record);
+    debugData(`Matches: ${matches.length}, Status: ${matchStatus.status}/${matchStatus.stopReason}, NonMatches: ${nonMatches ? nonMatches.length : 'not returned'}, ConversionFailures: ${conversionFailures ? conversionFailures.length : 'not returned'}`);
+    (0, _chai.expect)(matchStatus.status).to.eql(expectedMatchStatus);
+    (0, _chai.expect)(matchStatus.stopReason).to.eql(expectedStopReason);
+    const formattedMatchResult = formatRecordResults(matches);
+    (0, _chai.expect)(formattedMatchResult).to.eql(expectedMatches);
+    const formattedNonMatchResult = formatRecordResults(nonMatches);
+    (0, _chai.expect)(formattedNonMatchResult).to.eql(expectedNonMatches); // eslint-disable-next-line functional/no-conditional-statement
+
+    if (expectedFailures) {
+      (0, _chai.expect)(conversionFailures).to.eql(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(matches) {
+      if (matches) {
+        debugData(JSON.stringify(matches));
+        return matches.map(match => ({ ...match,
+          candidate: formatCandidate(match.candidate)
+        }));
+      }
+
+      return [];
+    } // Format candidate to remove validationOptions from record
+
+
+    function formatCandidate({
+      id,
+      record
+    }) {
+      const newId = id;
+      const newRecord = record;
+      return {
+        id: newId,
+        record: newRecord.toObject()
+      };
+    }
+  }
+});
+//# sourceMappingURL=index.spec.js.map

package/dist/index.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.spec.js","names":["debug","createDebugLogger","debugData","extend","describe","generateTests","callback","path","__dirname","recurse","fixura","reader","READERS","JSON","getFixture","options","enabled","expectedMatchStatus","expectedStopReason","expectedFailures","record","MarcRecord","subfieldValues","expectedMatches","expectedNonMatches","match","createMatchInterface","formatOptions","matches","matchStatus","nonMatches","conversionFailures","length","status","stopReason","expect","to","eql","formattedMatchResult","formatRecordResults","formattedNonMatchResult","contextFeatures","matchDetection","features","detection","strategy","type","search","detect","map","v","stringify","candidate","formatCandidate","id","newId","newRecord","toObject"],"sources":["../src/index.spec.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2022 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport {expect} from 'chai';\nimport {READERS} from '@natlibfi/fixura';\nimport generateTests from '@natlibfi/fixugen-http-client';\nimport {MarcRecord} from '@natlibfi/marc-record';\nimport createMatchInterface, {matchDetection} from '.';\nimport createDebugLogger from 'debug';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:index:test');\nconst debugData = debug.extend('data');\n\ndescribe('INDEX', () => {\n  generateTests({\n    callback,\n    path: [__dirname, '..', 'test-fixtures', 'index'],\n    recurse: false,\n    fixura: {\n      reader: READERS.JSON\n    }\n  });\n\n  async function callback({getFixture, options, enabled = true, expectedMatchStatus, expectedStopReason, expectedFailures}) {\n\n    if (!enabled) {\n      debug(`Disabled test!`);\n      return;\n    }\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} = 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    expect(matchStatus.status).to.eql(expectedMatchStatus);\n    expect(matchStatus.stopReason).to.eql(expectedStopReason);\n\n    const formattedMatchResult = formatRecordResults(matches);\n    expect(formattedMatchResult).to.eql(expectedMatches);\n\n    const formattedNonMatchResult = formatRecordResults(nonMatches);\n    expect(formattedNonMatchResult).to.eql(expectedNonMatches);\n\n    // eslint-disable-next-line functional/no-conditional-statement\n    if (expectedFailures) {\n      expect(conversionFailures).to.eql(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  }\n\n});\n"],"mappings":";;AA4BA;;AACA;;AACA;;AACA;;AACA;;AACA;;;;;;;;AAjCA;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;AASA,MAAMA,KAAK,GAAG,IAAAC,cAAA,EAAkB,8CAAlB,CAAd;AACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;AAEAC,QAAQ,CAAC,OAAD,EAAU,MAAM;EACtB,IAAAC,0BAAA,EAAc;IACZC,QADY;IAEZC,IAAI,EAAE,CAACC,SAAD,EAAY,IAAZ,EAAkB,eAAlB,EAAmC,OAAnC,CAFM;IAGZC,OAAO,EAAE,KAHG;IAIZC,MAAM,EAAE;MACNC,MAAM,EAAEC,eAAA,CAAQC;IADV;EAJI,CAAd;;EASA,eAAeP,QAAf,CAAwB;IAACQ,UAAD;IAAaC,OAAb;IAAsBC,OAAO,GAAG,IAAhC;IAAsCC,mBAAtC;IAA2DC,kBAA3D;IAA+EC;EAA/E,CAAxB,EAA0H;IAExH,IAAI,CAACH,OAAL,EAAc;MACZhB,KAAK,CAAE,gBAAF,CAAL;MACA;IACD;;IAED,MAAMoB,MAAM,GAAG,IAAIC,sBAAJ,CAAeP,UAAU,CAAC,kBAAD,CAAzB,EAA+C;MAACQ,cAAc,EAAE;IAAjB,CAA/C,CAAf;IACA,MAAMC,eAAe,GAAGT,UAAU,CAAC,sBAAD,CAAlC;IACA,MAAMU,kBAAkB,GAAGV,UAAU,CAAC,yBAAD,CAAV,IAAyC,EAApE;IAGA,MAAMW,KAAK,GAAG,IAAAC,SAAA,EAAqBC,aAAa,EAAlC,CAAd;IACA,MAAM;MAACC,OAAD;MAAUC,WAAV;MAAuBC,UAAvB;MAAmCC;IAAnC,IAAyD,MAAMN,KAAK,CAACL,MAAD,CAA1E;IACAlB,SAAS,CAAE,YAAW0B,OAAO,CAACI,MAAO,aAAYH,WAAW,CAACI,MAAO,IAAGJ,WAAW,CAACK,UAAW,iBAAgBJ,UAAU,GAAGA,UAAU,CAACE,MAAd,GAAuB,cAAe,yBAAwBD,kBAAkB,GAAGA,kBAAkB,CAACC,MAAtB,GAA+B,cAAe,EAA7O,CAAT;IAEA,IAAAG,YAAA,EAAON,WAAW,CAACI,MAAnB,EAA2BG,EAA3B,CAA8BC,GAA9B,CAAkCpB,mBAAlC;IACA,IAAAkB,YAAA,EAAON,WAAW,CAACK,UAAnB,EAA+BE,EAA/B,CAAkCC,GAAlC,CAAsCnB,kBAAtC;IAEA,MAAMoB,oBAAoB,GAAGC,mBAAmB,CAACX,OAAD,CAAhD;IACA,IAAAO,YAAA,EAAOG,oBAAP,EAA6BF,EAA7B,CAAgCC,GAAhC,CAAoCd,eAApC;IAEA,MAAMiB,uBAAuB,GAAGD,mBAAmB,CAACT,UAAD,CAAnD;IACA,IAAAK,YAAA,EAAOK,uBAAP,EAAgCJ,EAAhC,CAAmCC,GAAnC,CAAuCb,kBAAvC,EAvBwH,CAyBxH;;IACA,IAAIL,gBAAJ,EAAsB;MACpB,IAAAgB,YAAA,EAAOJ,kBAAP,EAA2BK,EAA3B,CAA8BC,GAA9B,CAAkClB,gBAAlC;IACD;;IAED,SAASQ,aAAT,GAAyB;MACvB,MAAMc,eAAe,GAAGC,gBAAA,CAAeC,QAAf,CAAwB5B,OAAO,CAAC6B,SAAR,CAAkBC,QAAlB,CAA2BC,IAAnD,CAAxB;MAEA,OAAO,EACL,GAAG/B,OADE;QAELgC,MAAM,EAAE,EACN,GAAGhC,OAAO,CAACgC;QADL,CAFH;QAKLH,SAAS,EAAE,EACT,GAAG7B,OAAO,CAACiC,MADF;UAETH,QAAQ,EAAE9B,OAAO,CAAC6B,SAAR,CAAkBC,QAAlB,CAA2BF,QAA3B,CAAoCM,GAApC,CAAwCC,CAAC,IAAIT,eAAe,CAACS,CAAD,CAAf,EAA7C;QAFD;MALN,CAAP;IAUD;;IAED,SAASX,mBAAT,CAA6BX,OAA7B,EAAsC;MACpC,IAAIA,OAAJ,EAAa;QACX1B,SAAS,CAACW,IAAI,CAACsC,SAAL,CAAevB,OAAf,CAAD,CAAT;QACA,OAAOA,OAAO,CAACqB,GAAR,CAAaxB,KAAD,KAAY,EAC7B,GAAGA,KAD0B;UAE7B2B,SAAS,EAAEC,eAAe,CAAC5B,KAAK,CAAC2B,SAAP;QAFG,CAAZ,CAAZ,CAAP;MAID;;MACD,OAAO,EAAP;IACD,CAtDuH,CAwDxH;;;IACA,SAASC,eAAT,CAAyB;MAACC,EAAD;MAAKlC;IAAL,CAAzB,EAAuC;MACrC,MAAMmC,KAAK,GAAGD,EAAd;MACA,MAAME,SAAS,GAAGpC,MAAlB;MACA,OAAO;QACLkC,EAAE,EAAEC,KADC;QAELnC,MAAM,EAAEoC,SAAS,CAACC,QAAV;MAFH,CAAP;IAID;EAGF;AAEF,CA/EO,CAAR"}

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

@@ -0,0 +1,122 @@
+"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 }; }
+
+/* eslint-disable max-statements */
+
+/**
+*
+* @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 => {
+    debug(`Creating match detection features for all local source id's`);
+    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) {
+      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;
+
+      function toSidFeature(field) {
+        debug(`Getting feature from a field`);
+        return (0, _matchingUtils.validateSidFieldSubfieldCounts)(field) ? createSidFeature(field) : '';
+
+        function createSidFeature(field) {
+          debug(`Creating feature from a field`);
+          const [sfC] = (0, _matchingUtils.getSubfieldValues)(field, 'c');
+          const [sfB] = (0, _matchingUtils.getSubfieldValues)(field, 'b');
+          debugData(`${JSON.stringify(sfC)} + ${JSON.stringify(sfB)}`);
+          debugData(`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));
+    debugData(`Matches (${matches.length}): ${JSON.stringify(matches)}`);
+    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

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

@@ -0,0 +1 @@
+{"version":3,"file":"all-source-ids.js","names":["debug","createDebugLogger","debugData","extend","name","extract","record","fSids","get","length","JSON","stringify","sidFeatures","getSidFeatures","map","toSidFeature","filter","nonEmptySid","field","validateSidFieldSubfieldCounts","createSidFeature","sfC","getSubfieldValues","sfB","compare","a","b","matches","sidA","some","sidB","sourceDb","sourceId","mismatches"],"sources":["../../../../src/match-detection/features/bib/all-source-ids.js"],"sourcesContent":["/* eslint-disable max-statements */\n/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nimport createDebugLogger from 'debug';\nimport {validateSidFieldSubfieldCounts, getSubfieldValues} from '../../../matching-utils';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:match-detection:features:all-source-ids');\nconst debugData = debug.extend('data');\n\n/*\n\nSID-fields in Melinda have sf $c with local id and sf $b with a code for the local db:\n\n SID__ $c 123457 $b helka\n SID__ $c (ANDL100020)1077305 $b sata\n SID__ $c VER999999 $ FI-KV\n\nallSourceIds matching feature is formatted as [{sourceDb: \"helka\", sourceId: \"123457\"}, {sourceDb: \"sata\", sourceId: \"(ANDL100020)1077305\"}, {sourceDb: \"FI-KV\", sourceId: \"VER999999\"}]\n- no normalization / prefix deletions etc. in the feature\n\nNote: All Melinda records that have a matching records in a local db do NOT have SID for that local records,\n      existence of a SID field depends on how the record has been added to Melinda and how it has been handled\n      afterwards. SIDs are also not reliably maintained. A record might or might not have a SID for a local db\n      after the matching record is removed from the local db.\n\nRecords with mismatching local ids for matching local db are a strong mismatch.\nRecords with matching local ids for matching local db are a very good match.\n\n*/\n\nexport default () => ({\n  name: 'All source IDs',\n  extract: record => {\n    debug(`Creating match detection features for all local source id's`);\n\n    const fSids = record.get('SID');\n    debugData(`SID-fields (${fSids.length}): ${JSON.stringify(fSids)}`);\n\n    const sidFeatures = getSidFeatures(fSids);\n    debugData(`SID-features (${sidFeatures.length}): ${JSON.stringify(sidFeatures)}`);\n\n    return sidFeatures;\n\n    function getSidFeatures(fSids) {\n      debug(`Getting Sid strings from SID fields`);\n\n      // Map SID fields to sidFeatures, filter out empty strings\n      const sidFeatures = fSids.map(toSidFeature).filter(nonEmptySid => nonEmptySid);\n      return sidFeatures;\n\n      function toSidFeature(field) {\n        debug(`Getting feature from a field`);\n\n        return validateSidFieldSubfieldCounts(field) ? createSidFeature(field) : '';\n\n        function createSidFeature(field) {\n          debug(`Creating feature from a field`);\n          const [sfC] = getSubfieldValues(field, 'c');\n          const [sfB] = getSubfieldValues(field, 'b');\n\n          debugData(`${JSON.stringify(sfC)} + ${JSON.stringify(sfB)}`);\n          debugData(`sourceDb: ${sfB}, sourceId: ${sfC}`);\n          return {'sourceDb': sfB, 'sourceId': sfC};\n        }\n      }\n\n    }\n\n  },\n  compare: (a, b) => {\n\n    debugData(`Comparing ${JSON.stringify(a)} and ${JSON.stringify(b)}`);\n\n    const matches = a.filter(sidA => b.some(sidB => sidA.sourceDb === sidB.sourceDb &&\n            sidA.sourceId === sidB.sourceId));\n    debugData(`Matches (${matches.length}): ${JSON.stringify(matches)}`);\n\n    const mismatches = a.filter(sidA => b.some(sidB => sidA.sourceDb === sidB.sourceDb &&\n      sidA.sourceId !== sidB.sourceId));\n    debugData(`Mismatches (${mismatches.length}): ${JSON.stringify(mismatches)}`);\n\n    // If there's at least one mismatching source ID from matching source db\n    if (mismatches.length > 0) {\n      return -1;\n    }\n\n    // If there's at least one matching source ID from matching source db\n    if (matches.length > 0) {\n      return 1;\n    }\n\n    // If there are no source IDs with matching sources\n    return 0;\n\n  }\n});\n"],"mappings":";;;;;;;AA6BA;;AACA;;;;AA9BA;;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAKA,MAAMA,KAAK,GAAG,IAAAC,cAAA,EAAkB,2EAAlB,CAAd;AACA,MAAMC,SAAS,GAAGF,KAAK,CAACG,MAAN,CAAa,MAAb,CAAlB;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;eAEe,OAAO;EACpBC,IAAI,EAAE,gBADc;EAEpBC,OAAO,EAAEC,MAAM,IAAI;IACjBN,KAAK,CAAE,6DAAF,CAAL;IAEA,MAAMO,KAAK,GAAGD,MAAM,CAACE,GAAP,CAAW,KAAX,CAAd;IACAN,SAAS,CAAE,eAAcK,KAAK,CAACE,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAeJ,KAAf,CAAsB,EAAxD,CAAT;IAEA,MAAMK,WAAW,GAAGC,cAAc,CAACN,KAAD,CAAlC;IACAL,SAAS,CAAE,iBAAgBU,WAAW,CAACH,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAeC,WAAf,CAA4B,EAAtE,CAAT;IAEA,OAAOA,WAAP;;IAEA,SAASC,cAAT,CAAwBN,KAAxB,EAA+B;MAC7BP,KAAK,CAAE,qCAAF,CAAL,CAD6B,CAG7B;;MACA,MAAMY,WAAW,GAAGL,KAAK,CAACO,GAAN,CAAUC,YAAV,EAAwBC,MAAxB,CAA+BC,WAAW,IAAIA,WAA9C,CAApB;MACA,OAAOL,WAAP;;MAEA,SAASG,YAAT,CAAsBG,KAAtB,EAA6B;QAC3BlB,KAAK,CAAE,8BAAF,CAAL;QAEA,OAAO,IAAAmB,6CAAA,EAA+BD,KAA/B,IAAwCE,gBAAgB,CAACF,KAAD,CAAxD,GAAkE,EAAzE;;QAEA,SAASE,gBAAT,CAA0BF,KAA1B,EAAiC;UAC/BlB,KAAK,CAAE,+BAAF,CAAL;UACA,MAAM,CAACqB,GAAD,IAAQ,IAAAC,gCAAA,EAAkBJ,KAAlB,EAAyB,GAAzB,CAAd;UACA,MAAM,CAACK,GAAD,IAAQ,IAAAD,gCAAA,EAAkBJ,KAAlB,EAAyB,GAAzB,CAAd;UAEAhB,SAAS,CAAE,GAAEQ,IAAI,CAACC,SAAL,CAAeU,GAAf,CAAoB,MAAKX,IAAI,CAACC,SAAL,CAAeY,GAAf,CAAoB,EAAjD,CAAT;UACArB,SAAS,CAAE,aAAYqB,GAAI,eAAcF,GAAI,EAApC,CAAT;UACA,OAAO;YAAC,YAAYE,GAAb;YAAkB,YAAYF;UAA9B,CAAP;QACD;MACF;IAEF;EAEF,CAtCmB;EAuCpBG,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;IAEjBxB,SAAS,CAAE,aAAYQ,IAAI,CAACC,SAAL,CAAec,CAAf,CAAkB,QAAOf,IAAI,CAACC,SAAL,CAAee,CAAf,CAAkB,EAAzD,CAAT;IAEA,MAAMC,OAAO,GAAGF,CAAC,CAACT,MAAF,CAASY,IAAI,IAAIF,CAAC,CAACG,IAAF,CAAOC,IAAI,IAAIF,IAAI,CAACG,QAAL,KAAkBD,IAAI,CAACC,QAAvB,IACxCH,IAAI,CAACI,QAAL,KAAkBF,IAAI,CAACE,QADE,CAAjB,CAAhB;IAEA9B,SAAS,CAAE,YAAWyB,OAAO,CAAClB,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAegB,OAAf,CAAwB,EAAzD,CAAT;IAEA,MAAMM,UAAU,GAAGR,CAAC,CAACT,MAAF,CAASY,IAAI,IAAIF,CAAC,CAACG,IAAF,CAAOC,IAAI,IAAIF,IAAI,CAACG,QAAL,KAAkBD,IAAI,CAACC,QAAvB,IACjDH,IAAI,CAACI,QAAL,KAAkBF,IAAI,CAACE,QADW,CAAjB,CAAnB;IAEA9B,SAAS,CAAE,eAAc+B,UAAU,CAACxB,MAAO,MAAKC,IAAI,CAACC,SAAL,CAAesB,UAAf,CAA2B,EAAlE,CAAT,CAViB,CAYjB;;IACA,IAAIA,UAAU,CAACxB,MAAX,GAAoB,CAAxB,EAA2B;MACzB,OAAO,CAAC,CAAR;IACD,CAfgB,CAiBjB;;;IACA,IAAIkB,OAAO,CAAClB,MAAR,GAAiB,CAArB,EAAwB;MACtB,OAAO,CAAP;IACD,CApBgB,CAsBjB;;;IACA,OAAO,CAAP;EAED;AAhEmB,CAAP,C"}

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

@@ -0,0 +1,120 @@
+"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 => 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() : ''
+        };
+      }
+
+      return {
+        id: value
+      };
+    }
+  }),
+  compare: (a, b) => {
+    const maxAuthors = a.length > b.length ? a.length : b.length;
+    const matchingIds = findMatchingIds();
+
+    if (maxAuthors >= 3 && matchingIds >= 3) {
+      return 0.3;
+    }
+
+    const matchingNames = findMatchingNames();
+    const idPoints = matchingIds / maxAuthors * 0.3;
+    const namePoints = matchingNames / maxAuthors * 0.2;
+    const totalPoints = idPoints + namePoints;
+    return totalPoints <= 0.2 ? totalPoints : 0.2;
+
+    function findMatchingIds() {
+      return findMatches('id', (a, b) => a === b);
+    }
+
+    function findMatchingNames() {
+      return findMatches('name', (a, b) => {
+        const distance = (0, _natural.LevenshteinDistance)(a, b);
+
+        if (distance === 0) {
+          return true;
+        }
+
+        const maxLength = getMaxLength();
+        const percentage = distance / maxLength * 100;
+        return percentage <= nameTreshold;
+
+        function getMaxLength() {
+          return a.length > b.length ? a.length : b.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 allValues = valuesA.concat(valuesB);
+      return allValues.reduce((acc, value) => {
+        const occurrance = allValues.filter(otherValue => cb(value, otherValue)).length;
+        return occurrance >= 2 ? acc + 1 : acc;
+      }, 0);
+    }
+  }
+});
+
+exports.default = _default;
+//# sourceMappingURL=authors.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"authors.js","names":["nameTreshold","name","extract","record","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"],"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 => 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  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;;AACA;;AA7BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AAKA;eAEe,CAAC;EAACA,YAAY,GAAG;AAAhB,IAAsB,EAAvB,MAA+B;EAC5CC,IAAI,EAAE,SADsC;EAE5CC,OAAO,EAAEC,MAAM,IAAIA,MAAM,CAACC,GAAP,CAAW,oBAAX,EAChBC,GADgB,CACZ,CAAC;IAACC;EAAD,CAAD,KAAiB;IACpB,OAAOA,SAAS,CACbC,MADI,CACG,CAAC;MAACC,IAAD;MAAOC;IAAP,CAAD,KAAmBD,IAAI,IAAIC,KAD9B,EAEJF,MAFI,CAEG,CAAC;MAACC;IAAD,CAAD,KAAY,CAAC,GAAD,EAAM,GAAN,EAAWE,QAAX,CAAoBF,IAApB,CAFf,EAGJH,GAHI,CAGAM,KAHA,EAIJC,MAJI,CAIG,CAACC,GAAD,EAAMC,CAAN,MAAa,EAAC,GAAGD,GAAJ;MAAS,GAAGC;IAAZ,CAAb,CAJH,EAIiC,EAJjC,CAAP;;IAMA,SAASH,KAAT,CAAe;MAACH,IAAD;MAAOC;IAAP,CAAf,EAA8B;MAC5B,IAAID,IAAI,KAAK,GAAb,EAAkB;QAChB,OAAO;UAACP,IAAI,EAAE,IAAAc,iCAAA,EAAmBN,KAAnB,IAA4BO,MAAM,CAACP,KAAD,CAAN,CAAcQ,OAAd,CAAsB,2BAAtB,EAAmD,EAAnD,EAAuDC,WAAvD,EAA5B,GAAmG;QAA1G,CAAP;MACD;;MAED,OAAO;QAACC,EAAE,EAAEV;MAAL,CAAP;IACD;EACF,CAfgB,CAFyB;EAkB5CW,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAU;IACjB,MAAMC,UAAU,GAAGF,CAAC,CAACG,MAAF,GAAWF,CAAC,CAACE,MAAb,GAAsBH,CAAC,CAACG,MAAxB,GAAiCF,CAAC,CAACE,MAAtD;IACA,MAAMC,WAAW,GAAGC,eAAe,EAAnC;;IAEA,IAAIH,UAAU,IAAI,CAAd,IAAmBE,WAAW,IAAI,CAAtC,EAAyC;MACvC,OAAO,GAAP;IACD;;IAED,MAAME,aAAa,GAAGC,iBAAiB,EAAvC;IACA,MAAMC,QAAQ,GAAGJ,WAAW,GAAGF,UAAd,GAA2B,GAA5C;IACA,MAAMO,UAAU,GAAGH,aAAa,GAAGJ,UAAhB,GAA6B,GAAhD;IACA,MAAMQ,WAAW,GAAGF,QAAQ,GAAGC,UAA/B;IAEA,OAAOC,WAAW,IAAI,GAAf,GAAqBA,WAArB,GAAmC,GAA1C;;IAEA,SAASL,eAAT,GAA2B;MACzB,OAAOM,WAAW,CAAC,IAAD,EAAO,CAACX,CAAD,EAAIC,CAAJ,KAAUD,CAAC,KAAKC,CAAvB,CAAlB;IACD;;IAED,SAASM,iBAAT,GAA6B;MAC3B,OAAOI,WAAW,CAAC,MAAD,EAAS,CAACX,CAAD,EAAIC,CAAJ,KAAU;QACnC,MAAMW,QAAQ,GAAG,IAAAC,4BAAA,EAAMb,CAAN,EAASC,CAAT,CAAjB;;QAEA,IAAIW,QAAQ,KAAK,CAAjB,EAAoB;UAClB,OAAO,IAAP;QACD;;QAED,MAAME,SAAS,GAAGC,YAAY,EAA9B;QACA,MAAMC,UAAU,GAAGJ,QAAQ,GAAGE,SAAX,GAAuB,GAA1C;QAEA,OAAOE,UAAU,IAAIrC,YAArB;;QAEA,SAASoC,YAAT,GAAwB;UACtB,OAAOf,CAAC,CAACG,MAAF,GAAWF,CAAC,CAACE,MAAb,GAAsBH,CAAC,CAACG,MAAxB,GAAiCF,CAAC,CAACE,MAA1C;QACD;MACF,CAfiB,CAAlB;IAgBD;;IAED,SAASQ,WAAT,CAAqBM,GAArB,EAA0BC,EAA1B,EAA8B;MAC5B,MAAMC,OAAO,GAAGnB,CAAC,CAACd,MAAF,CAASkC,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAf,EAAsBjC,GAAtB,CAA0BoC,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAhC,CAAhB;MACA,MAAMI,OAAO,GAAGpB,CAAC,CAACf,MAAF,CAASkC,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAf,EAAsBjC,GAAtB,CAA0BoC,CAAC,IAAIA,CAAC,CAACH,GAAD,CAAhC,CAAhB;MACA,MAAMK,SAAS,GAAGH,OAAO,CAACI,MAAR,CAAeF,OAAf,CAAlB;MAEA,OAAOC,SAAS,CAAC/B,MAAV,CAAiB,CAACC,GAAD,EAAMJ,KAAN,KAAgB;QACtC,MAAMoC,UAAU,GAAGF,SAAS,CAACpC,MAAV,CAAiBuC,UAAU,IAAIP,EAAE,CAAC9B,KAAD,EAAQqC,UAAR,CAAjC,EAAsDtB,MAAzE;QACA,OAAOqB,UAAU,IAAI,CAAd,GAAkBhC,GAAG,GAAG,CAAxB,GAA4BA,GAAnC;MACD,CAHM,EAGJ,CAHI,CAAP;IAID;EACF;AAlE2C,CAA/B,C"}

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

@@ -0,0 +1,42 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+/**
+*
+* @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.
+*
+*/
+var _default = () => ({
+  name: 'Bibliographic level',
+  extract: r => r.leader[7] ? [r.leader[7]] : [],
+  compare: (a, b) => a[0] === b[0] ? 0.1 : -0.2
+});
+
+exports.default = _default;
+//# sourceMappingURL=bibliographic-level.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"bibliographic-level.js","names":["name","extract","r","leader","compare","a","b"],"sources":["../../../../src/match-detection/features/bib/bibliographic-level.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nexport default () => ({\n  name: 'Bibliographic level',\n  extract: r => r.leader[7] ? [r.leader[7]] : [],\n  compare: (a, b) => a[0] === b[0] ? 0.1 : -0.2\n});\n"],"mappings":";;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;eAEe,OAAO;EACpBA,IAAI,EAAE,qBADc;EAEpBC,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,MAAF,CAAS,CAAT,IAAc,CAACD,CAAC,CAACC,MAAF,CAAS,CAAT,CAAD,CAAd,GAA8B,EAFxB;EAGpBC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AAHtB,CAAP,C"}

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

@@ -0,0 +1,42 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+
+/**
+*
+* @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.
+*
+*/
+var _default = () => ({
+  name: 'Host/Component record',
+  extract: r => r.get(/^773$/u).length > 0 ? ['component'] : ['host'],
+  compare: (a, b) => a[0] === b[0] ? 0.0 : -1.0
+});
+
+exports.default = _default;
+//# sourceMappingURL=host-component.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"host-component.js","names":["name","extract","r","get","length","compare","a","b"],"sources":["../../../../src/match-detection/features/bib/host-component.js"],"sourcesContent":["/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\n\nexport default () => ({\n  name: 'Host/Component record',\n  extract: r => r.get(/^773$/u).length > 0 ? ['component'] : ['host'],\n  compare: (a, b) => a[0] === b[0] ? 0.0 : -1.0\n});\n"],"mappings":";;;;;;;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;eAEe,OAAO;EACpBA,IAAI,EAAE,uBADc;EAEpBC,OAAO,EAAEC,CAAC,IAAIA,CAAC,CAACC,GAAF,CAAM,QAAN,EAAgBC,MAAhB,GAAyB,CAAzB,GAA6B,CAAC,WAAD,CAA7B,GAA6C,CAAC,MAAD,CAFvC;EAGpBC,OAAO,EAAE,CAACC,CAAD,EAAIC,CAAJ,KAAUD,CAAC,CAAC,CAAD,CAAD,KAASC,CAAC,CAAC,CAAD,CAAV,GAAgB,GAAhB,GAAsB,CAAC;AAHtB,CAAP,C"}