@natlibfi/melinda-record-matching 4.3.2-alpha.2 → 4.3.2-alpha.4

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

@@ -1 +1 @@
-{"version":3,"file":"bib.js","names":["_debug","_interopRequireDefault","require","_candidateSearchUtils","_matchingUtils","obj","__esModule","default","debug","createDebugLogger","bibSourceIds","record","debugData","extend","fSids","get","length","JSON","stringify","toSidQueries","sidStrings","getSidStrings","sidQueries","toQueries","map","toSidString","filter","nonEmptySid","field","validateSidFieldSubfieldCounts","createSidString","sfC","getSubfieldValues","sfB","cleanedSfC","removeSourcePrefix","normalizeSidSubfieldValue","cleanedSfB","concat","subfieldValue","sourcePrefixRegex","normalizedValue","testStringOrNumber","String","replace","normalizeAwayRegex","bibMelindaIds","melindaIds","getMelindaIdsF035","bibHostComponents","id","getHostId","value","subfields","find","code","test","bibTitle","bibTitleAuthorPublisher","onlyTitleLength","bibTitleAuthor","bibTitleAuthorYear","addYear","bibTitleAuthorYearAlternates","queryList","alternates","alternateQueries","queryListType","title","getTitle","booleanStartWords","formatted","trim","slice","useWordSearch","some","word","toLowerCase","startsWith","queryIsOkAlone","query","newAlternateQueries","addAuthorsToSearch","authorQuery","bibAuthors","undefined","addYearToSearch","addPublisherToSearch","publisherQuery","bibPublishers","yearQuery","bibYear","titleString","includes","join","author","getAuthor","authorString","publisher","getPublisher","publisherString","year","getYear","bibStandardIdentifiers","fields","identifiers","toIdentifiers","uniqueIdentifiers","Set","tag","issnIsbnReqExp","otherIdReqExp","sub"],"sources":["../../../src/candidate-search/query-list/bib.js"],"sourcesContent":["\n/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2023 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\nimport createDebugLogger from 'debug';\nimport {toQueries} from '../candidate-search-utils';\nimport {getMelindaIdsF035, validateSidFieldSubfieldCounts, getSubfieldValues, testStringOrNumber} from '../../matching-utils';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query');\n\nexport function bibSourceIds(record) {\n\n  /* Melinda's SRU-index melinda.sourceid includes source IDs from SID fields in Melinda records\n     SID-fields in Melinda have sf $c with local id and sf $b with a code for the local db:\n\n     SID__ $c 123457 $b helka\n     SID__ $c (ANDL100020)1077305 $b sata\n     SID__ $c VER999999 $ FI-KV\n     SID__ $c /10024/508126 $ REPO_THESEUS\n\n    In melinda.sourceid -index case is kept, sourceprefixes in brackets and hyphens are normalized away:\n    Note: slashes are not normalized away, but a SRU-search-string including slashes needs to be quoted\n\n    1234567helka\n    1077305sata\n    VER999999FIKV\n    /10024/508126REPO_THESEUS\n\n    Note: All Melinda records that have a matching records in a local db do NOT have SID for that local records,\n          existence of a SID field depends on how the record has been added to Melinda and how it has been handled\n          afterwards. SIDs are also not reliably maintained. A record might or might not have a SID for a local db\n          after the matching record is removed from the local db.\n\n   */\n\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:source-ids');\n  const debugData = debug.extend('data');\n  //const debugInfo = debug.extend('info');\n\n  debug(`Creating queries for sourceid's`);\n\n  const fSids = record.get('SID');\n  debugData(`SID-fields (${fSids.length}): ${JSON.stringify(fSids)}`);\n\n  return fSids.length > 0 ? toSidQueries(fSids) : [];\n\n  function toSidQueries(fSids) {\n    debug(`Creating actual queries for sourceid's`);\n\n    const sidStrings = getSidStrings(fSids);\n\n    if (sidStrings.length < 1) {\n      debug(`No identifiers found, no queries created.`);\n      return [];\n    }\n\n    const sidQueries = toQueries(sidStrings, 'melinda.sourceid');\n\n    return sidQueries;\n\n    function getSidStrings(fSids) {\n      debug(`Getting Sid strings from SID fields`);\n\n      // Map SID fields to valid sidStrings, filter out empty strings\n      const sidStrings = fSids.map(toSidString).filter(nonEmptySid => nonEmptySid);\n      return sidStrings;\n\n      function toSidString(field) {\n        debug(`Getting string from a field`);\n\n        return validateSidFieldSubfieldCounts(field) ? createSidString(field) : '';\n\n        function createSidString(field) {\n          debug(`Creating string from a field`);\n          const [sfC] = getSubfieldValues(field, 'c');\n          const [sfB] = getSubfieldValues(field, 'b');\n\n          const cleanedSfC = removeSourcePrefix(normalizeSidSubfieldValue(sfC));\n          const cleanedSfB = normalizeSidSubfieldValue(sfB);\n\n          debugData(`${JSON.stringify(sfC)} + ${JSON.stringify(sfB)}`);\n          return cleanedSfC.concat(cleanedSfB);\n        }\n\n        function removeSourcePrefix(subfieldValue) {\n          const sourcePrefixRegex = (/^(?<sourcePrefix>\\([A-Za-z0-9-]+\\))(?<id>.+)$/u);\n          const normalizedValue = testStringOrNumber(subfieldValue) ? String(subfieldValue).replace(sourcePrefixRegex, '$<id>') : '';\n          debugData(`Normalized ${subfieldValue} to ${normalizedValue}`);\n          return normalizedValue;\n        }\n\n        function normalizeSidSubfieldValue(subfieldValue) {\n          debugData(`Normalizing ${subfieldValue}`);\n          const normalizeAwayRegex = (/[- ]/u);\n          return testStringOrNumber(subfieldValue) ? String(subfieldValue).replace(normalizeAwayRegex, '') : '';\n        }\n\n      }\n    }\n  }\n}\n\nexport function bibMelindaIds(record) {\n  // Melinda's SRU-index melinda.melindaid includes f001 controlnumbers and old Melinda-IDs from f035z's for all non-deleted Melinda-records\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibMelindaIds');\n  const debugData = debug.extend('data');\n  debug(`Creating queries for MelindaIds`);\n\n  // Note: Melinda-ID's for search queries are created just from records f035a's and f035z's\n  // Both (FI-MELINDA)- and FCC-prefixed forms are found\n  // f001 controlnumber is not currently included, even if record's f003 is FI-MELINDA\n  const melindaIds = getMelindaIdsF035(record);\n\n  debugData(`Unique identifiers (${melindaIds.length}): ${JSON.stringify(melindaIds)}`);\n\n  if (melindaIds.length < 1) {\n    debug(`No identifiers found, no queries created.`);\n    return [];\n  }\n\n  return toQueries(melindaIds, 'melinda.melindaid');\n}\n\n\n// bibHostComponents returns host id from the first subfield $w of first field f773, see test-fixtures 04 and 05\n// bibHostComponents should search all 773 $ws for possible host id, but what should it do in case of multiple host ids?\nexport function bibHostComponents(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibHostComponents');\n  const debugData = debug.extend('data');\n  debug(`Creating queries for hostIds`);\n\n  const id = getHostId();\n  debugData(`Found id: ${JSON.stringify(id)}`);\n\n  return testStringOrNumber(id) ? [`melinda.partsofhost=${id}`] : [];\n\n  function getHostId() {\n    const [field] = record.get(/^773$/u);\n\n    if (field) {\n      const {value} = field.subfields.find(({code}) => code === 'w') || {};\n\n      if (testStringOrNumber(value) && (/^\\(FI-MELINDA\\)/u).test(String(value))) {\n        return String(value).replace(/^\\(FI-MELINDA\\)/u, '');\n      }\n\n      if (testStringOrNumber(value) && (/^\\(FIN01\\)/u).test(String(value))) {\n        return String(value).replace(/^\\(FIN01\\)/u, '');\n      }\n\n      return false;\n    }\n    return false;\n  }\n}\n\n// SRU search dc.title with a search phrase starting with ^ maps currently in Melinda to\n// (probably) to *headings* index TIT\n// - Aleph cannot currently handle headings searches starting with a boolean - in these cases use word search\n\n// Headings index TIT drops articles etc. from the start of the title according to the filing indicator\n// Currently filing indicator is not implemented - if the title starts with an article and the Melinda\n// record is correctly catalogued using a filing indicator -> dc.title search won't match\n\nexport function bibTitle(record) {\n  // We get author/publisher only when formatted title is shorter than 5 chars\n  return bibTitleAuthorPublisher({record, onlyTitleLength: 5});\n}\n\nexport function bibTitleAuthor(record) {\n  debug('bibTitleAuthor');\n  // We use onlyTitleLength that is longer than our formatted length to\n  // get an author or an publisher always\n  return bibTitleAuthorPublisher({record, onlyTitleLength: 100});\n}\n\nexport function bibTitleAuthorYear(record) {\n  debug('bibTitleAuthorYearAlternates');\n  // We use onlyTitleLength that is longer than our formatted length to\n  // get an author or an publisher always\n\n  return bibTitleAuthorPublisher({record, onlyTitleLength: 100, addYear: true});\n}\n\nexport function bibTitleAuthorYearAlternates(record) {\n  debug('bibTitleAuthorYearAlternates');\n  // We use onlyTitleLength that is longer than our formatted length to\n  // get an author or an publisher always\n\n  return {queryList: bibTitleAuthorPublisher({record, onlyTitleLength: 100, addYear: true, alternates: true, alternateQueries: []}), queryListType: 'alternates'};\n}\n\nexport function bibTitleAuthorPublisher({record, onlyTitleLength, addYear = false, alternates = false, alternateQueries = []}) {\n  debug(`bibTitleAuthorPublisher, onlyTitleLength: ${onlyTitleLength}, addYear: ${addYear}, alternates: ${alternates}`);\n  const title = getTitle();\n  const booleanStartWords = ['and', 'or', 'nor', 'not'];\n\n  if (testStringOrNumber(title)) {\n    const formatted = String(title)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    // use word search for titles starting with a boolean\n    const useWordSearch = booleanStartWords.some(word => formatted.toLowerCase().startsWith(word));\n    // Prevent too many matches / SRU crashing by having a minimum length\n    // Note that currently this fails matching if there are no matches from previous matchers\n    if (formatted.length >= onlyTitleLength && !alternates) {\n      return [`dc.title=\"${useWordSearch ? '' : '^'}${formatted}*\"`];\n    }\n    const queryIsOkAlone = formatted.length >= 5;\n\n    // use word search without ending * also in combination searches to avoid SRU-server crashes [MRA-189]\n    const query = `dc.title=\"${useWordSearch || !queryIsOkAlone ? '' : '^'}${formatted}${queryIsOkAlone ? '*' : ''}\"`;\n    debug(`query: ${query}`);\n    const newAlternateQueries = alternates ? [...alternateQueries, query] : alternateQueries;\n\n    return addAuthorsToSearch({query, queryIsOkAlone, addYear, alternates, alternateQueries: newAlternateQueries});\n  }\n\n  return [];\n\n  function addAuthorsToSearch({query, queryIsOkAlone = false, addYear = false, alternates = false, alternateQueries = []}) {\n    debug('addAuthorsToSearch');\n    const [authorQuery] = bibAuthors(record);\n    if (authorQuery !== undefined) {\n      if (addYear) {\n        const newAlternateQueries = alternates ? [...alternateQueries, `${authorQuery} AND ${query}`] : alternateQueries;\n        return addYearToSearch({query: `${authorQuery} AND ${query}`, queryIsOkAlone: true, alternates, alternateQueries: newAlternateQueries});\n      }\n      return alternates ? alternateQueries : [`${authorQuery} AND ${query}`];\n    }\n    return addPublisherToSearch({query, queryIsOkAlone, addYear, alternates, alternateQueries});\n    //return [];\n  }\n\n  function addPublisherToSearch({query, queryIsOkAlone = false, addYear = false, alternates = false, alternateQueries = []}) {\n    const [publisherQuery] = bibPublishers(record);\n    if (publisherQuery !== undefined) {\n      if (addYear) {\n        const newAlternateQueries = alternates ? [...alternateQueries, `${publisherQuery} AND ${query}`] : alternateQueries;\n        return addYearToSearch({query: `${publisherQuery} AND ${query}`, queryIsOkAlone: true, alternates, alternateQueries: newAlternateQueries});\n      }\n      return alternates ? alternateQueries : [`${publisherQuery} AND ${query}`];\n    }\n    if (queryIsOkAlone && !addYear) {\n      return alternates ? alternateQueries : [`${query}`];\n    }\n    return addYearToSearch({query, queryIsOkAlone, alternates, alternateQueries});\n  }\n\n  function addYearToSearch({query, queryIsOkAlone = false, alternates = false, alternateQueries = []}) {\n    const [yearQuery] = bibYear(record);\n    if (yearQuery !== undefined) {\n      const newAlternateQueries = alternates ? [...alternateQueries, `${yearQuery} AND ${query}`] : alternateQueries;\n      return alternates ? newAlternateQueries : [`${yearQuery} AND ${query}`];\n    }\n    if (queryIsOkAlone) {\n      return alternates ? alternateQueries : [`${query}`];\n    }\n    return [];\n  }\n\n  function getTitle() {\n    const [field] = record.get(/^245$/u);\n\n    if (field) {\n      const titleString = field.subfields\n        //.filter(({code}) => ['a', 'b', 'n', 'p'].includes(code))\n        .filter(({code}) => ['a', 'b'].includes(code))\n        //.filter(({code}) => ['a'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return titleString;\n    }\n    return false;\n  }\n}\n\nexport function bibAuthors(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibAuthors');\n  const debugData = debug.extend('data');\n  debug(`Creating query for the first author`);\n  //debugData(record);\n\n  const author = getAuthor(record);\n  const booleanStartWords = ['and', 'or', 'nor', 'not'];\n\n\n  if (testStringOrNumber(author)) {\n    const formatted = String(author)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    // use word search for authors starting with a boolean\n    const useWordSearch = booleanStartWords.some(word => formatted.toLowerCase().startsWith(word));\n    // Prevent too many matches by having a minimum length\n    debugData(`Author string: ${formatted}`);\n    if (formatted.length >= 5) {\n      return [`dc.author=\"${useWordSearch ? '' : '^'}${formatted}*\"`];\n    }\n    return [];\n  }\n\n  return [];\n\n  function getAuthor(record) {\n    //debugData(record);\n    // eslint-disable-next-line prefer-named-capture-group\n    const [field] = record.get(/^(100)|(110)|(111)|(700)|(710)|(711)$/u);\n    //debugData(field);\n\n    if (field) {\n      const authorString = field.subfields\n        .filter(({code}) => ['a'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return authorString;\n    }\n    return false;\n  }\n}\n\nexport function bibPublishers(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibPublishers');\n  const debugData = debug.extend('data');\n  debug(`Creating query for the first publisher`);\n  //debugData(record);\n\n  const publisher = getPublisher(record);\n  if (testStringOrNumber(publisher)) {\n    const formatted = String(publisher)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    debugData(`Publisher string: ${formatted}`);\n    // use non-wildcard word search from dc.publisher\n    return [`dc.publisher=\"${formatted}\"`];\n  }\n\n  return [];\n\n  function getPublisher(record) {\n    //debugData(record);\n    const [field] = record.get(/^(?:260)|(?:264)$/u);\n    //debugData(field);\n\n    if (field) {\n      const publisherString = field.subfields\n        .filter(({code}) => ['b'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return publisherString;\n    }\n    return false;\n  }\n}\n\nexport function bibYear(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibYear');\n  const debugData = debug.extend('data');\n  debug(`Creating query for the publishing year`);\n  debugData(record);\n\n  const year = getYear(record);\n  if (year) {\n    return [`dc.date=\"${year}\"`];\n  }\n  return [];\n\n  function getYear(record) {\n    const value = record.get(/^008$/u)?.[0]?.value || undefined;\n    return testStringOrNumber(value) ? String(value).slice(7, 11) : undefined;\n  }\n}\n\n\nexport function bibStandardIdentifiers(record) {\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibStandardIdentifiers');\n  const debugData = debug.extend('data');\n  debug(`Creating queries for standard identifiers`);\n\n  // DEVELOP: should we query also f015 and f028?\n\n  const fields = record.get(/^(?<def>020|022|024)$/u);\n  const identifiers = [].concat(...fields.map(toIdentifiers));\n  const uniqueIdentifiers = [...new Set(identifiers)];\n\n  debugData(`Standard identifier fields: ${JSON.stringify(fields)}`);\n  debugData(`Identifiers (${identifiers.length}): ${JSON.stringify(identifiers)}`);\n  debugData(`Unique identifiers (${uniqueIdentifiers.length}): ${JSON.stringify(uniqueIdentifiers)}`);\n\n  if (uniqueIdentifiers.length < 1) {\n    debug(`No identifiers found, no queries created.`);\n    return [];\n  }\n\n  return toQueries(uniqueIdentifiers, 'dc.identifier');\n\n  function toIdentifiers({tag, subfields}) {\n    const issnIsbnReqExp = (/^[A-Za-z0-9-]+$/u);\n    const otherIdReqExp = (/^[A-Za-z0-9-:]+$/u);\n\n    if (tag === '022') {\n      return subfields\n        .filter(sub => ['a', 'z', 'y'].includes(sub.code) && testStringOrNumber(sub.value) && issnIsbnReqExp.test(String(sub.value)))\n        .map(({value}) => String(value));\n    }\n\n    if (tag === '020') {\n      return subfields\n        .filter(sub => ['a', 'z'].includes(sub.code) && testStringOrNumber(sub.value) && issnIsbnReqExp.test(String(sub.value)))\n        .map(({value}) => String(value));\n    }\n\n    return subfields\n      .filter(sub => ['a', 'z'].includes(sub.code) && testStringOrNumber(sub.value) && otherIdReqExp.test(String(sub.value)))\n      .map(({value}) => String(value));\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AA4BA,IAAAA,MAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,qBAAA,GAAAD,OAAA;AACA,IAAAE,cAAA,GAAAF,OAAA;AAA8H,SAAAD,uBAAAI,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AA7B9H;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAKA,MAAMG,KAAK,GAAG,IAAAC,cAAiB,EAAC,0DAA0D,CAAC;AAEpF,SAASC,YAAYA,CAACC,MAAM,EAAE;EAEnC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;EAQE,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,qEAAqE,CAAC;EACtG,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtC;;EAEAL,KAAK,CAAE,iCAAgC,CAAC;EAExC,MAAMM,KAAK,GAAGH,MAAM,CAACI,GAAG,CAAC,KAAK,CAAC;EAC/BH,SAAS,CAAE,eAAcE,KAAK,CAACE,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACJ,KAAK,CAAE,EAAC,CAAC;EAEnE,OAAOA,KAAK,CAACE,MAAM,GAAG,CAAC,GAAGG,YAAY,CAACL,KAAK,CAAC,GAAG,EAAE;EAElD,SAASK,YAAYA,CAACL,KAAK,EAAE;IAC3BN,KAAK,CAAE,wCAAuC,CAAC;IAE/C,MAAMY,UAAU,GAAGC,aAAa,CAACP,KAAK,CAAC;IAEvC,IAAIM,UAAU,CAACJ,MAAM,GAAG,CAAC,EAAE;MACzBR,KAAK,CAAE,2CAA0C,CAAC;MAClD,OAAO,EAAE;IACX;IAEA,MAAMc,UAAU,GAAG,IAAAC,+BAAS,EAACH,UAAU,EAAE,kBAAkB,CAAC;IAE5D,OAAOE,UAAU;IAEjB,SAASD,aAAaA,CAACP,KAAK,EAAE;MAC5BN,KAAK,CAAE,qCAAoC,CAAC;;MAE5C;MACA,MAAMY,UAAU,GAAGN,KAAK,CAACU,GAAG,CAACC,WAAW,CAAC,CAACC,MAAM,CAACC,WAAW,IAAIA,WAAW,CAAC;MAC5E,OAAOP,UAAU;MAEjB,SAASK,WAAWA,CAACG,KAAK,EAAE;QAC1BpB,KAAK,CAAE,6BAA4B,CAAC;QAEpC,OAAO,IAAAqB,6CAA8B,EAACD,KAAK,CAAC,GAAGE,eAAe,CAACF,KAAK,CAAC,GAAG,EAAE;QAE1E,SAASE,eAAeA,CAACF,KAAK,EAAE;UAC9BpB,KAAK,CAAE,8BAA6B,CAAC;UACrC,MAAM,CAACuB,GAAG,CAAC,GAAG,IAAAC,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAC3C,MAAM,CAACK,GAAG,CAAC,GAAG,IAAAD,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAE3C,MAAMM,UAAU,GAAGC,kBAAkB,CAACC,yBAAyB,CAACL,GAAG,CAAC,CAAC;UACrE,MAAMM,UAAU,GAAGD,yBAAyB,CAACH,GAAG,CAAC;UAEjDrB,SAAS,CAAE,GAAEK,IAAI,CAACC,SAAS,CAACa,GAAG,CAAE,MAAKd,IAAI,CAACC,SAAS,CAACe,GAAG,CAAE,EAAC,CAAC;UAC5D,OAAOC,UAAU,CAACI,MAAM,CAACD,UAAU,CAAC;QACtC;QAEA,SAASF,kBAAkBA,CAACI,aAAa,EAAE;UACzC,MAAMC,iBAAiB,GAAI,gDAAiD;UAC5E,MAAMC,eAAe,GAAG,IAAAC,iCAAkB,EAACH,aAAa,CAAC,GAAGI,MAAM,CAACJ,aAAa,CAAC,CAACK,OAAO,CAACJ,iBAAiB,EAAE,OAAO,CAAC,GAAG,EAAE;UAC1H5B,SAAS,CAAE,cAAa2B,aAAc,OAAME,eAAgB,EAAC,CAAC;UAC9D,OAAOA,eAAe;QACxB;QAEA,SAASL,yBAAyBA,CAACG,aAAa,EAAE;UAChD3B,SAAS,CAAE,eAAc2B,aAAc,EAAC,CAAC;UACzC,MAAMM,kBAAkB,GAAI,OAAQ;UACpC,OAAO,IAAAH,iCAAkB,EAACH,aAAa,CAAC,GAAGI,MAAM,CAACJ,aAAa,CAAC,CAACK,OAAO,CAACC,kBAAkB,EAAE,EAAE,CAAC,GAAG,EAAE;QACvG;MAEF;IACF;EACF;AACF;AAEO,SAASC,aAAaA,CAACnC,MAAM,EAAE;EACpC;;EAEA,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,wEAAwE,CAAC;EACzG,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,iCAAgC,CAAC;;EAExC;EACA;EACA;EACA,MAAMuC,UAAU,GAAG,IAAAC,gCAAiB,EAACrC,MAAM,CAAC;EAE5CC,SAAS,CAAE,uBAAsBmC,UAAU,CAAC/B,MAAO,MAAKC,IAAI,CAACC,SAAS,CAAC6B,UAAU,CAAE,EAAC,CAAC;EAErF,IAAIA,UAAU,CAAC/B,MAAM,GAAG,CAAC,EAAE;IACzBR,KAAK,CAAE,2CAA0C,CAAC;IAClD,OAAO,EAAE;EACX;EAEA,OAAO,IAAAe,+BAAS,EAACwB,UAAU,EAAE,mBAAmB,CAAC;AACnD;;AAGA;AACA;AACO,SAASE,iBAAiBA,CAACtC,MAAM,EAAE;EACxC,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,4EAA4E,CAAC;EAC7G,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,8BAA6B,CAAC;EAErC,MAAM0C,EAAE,GAAGC,SAAS,CAAC,CAAC;EACtBvC,SAAS,CAAE,aAAYK,IAAI,CAACC,SAAS,CAACgC,EAAE,CAAE,EAAC,CAAC;EAE5C,OAAO,IAAAR,iCAAkB,EAACQ,EAAE,CAAC,GAAG,CAAE,uBAAsBA,EAAG,EAAC,CAAC,GAAG,EAAE;EAElE,SAASC,SAASA,CAAA,EAAG;IACnB,MAAM,CAACvB,KAAK,CAAC,GAAGjB,MAAM,CAACI,GAAG,CAAC,QAAQ,CAAC;IAEpC,IAAIa,KAAK,EAAE;MACT,MAAM;QAACwB;MAAK,CAAC,GAAGxB,KAAK,CAACyB,SAAS,CAACC,IAAI,CAAC,CAAC;QAACC;MAAI,CAAC,KAAKA,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;MAEpE,IAAI,IAAAb,iCAAkB,EAACU,KAAK,CAAC,IAAK,kBAAkB,CAAEI,IAAI,CAACb,MAAM,CAACS,KAAK,CAAC,CAAC,EAAE;QACzE,OAAOT,MAAM,CAACS,KAAK,CAAC,CAACR,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;MACtD;MAEA,IAAI,IAAAF,iCAAkB,EAACU,KAAK,CAAC,IAAK,aAAa,CAAEI,IAAI,CAACb,MAAM,CAACS,KAAK,CAAC,CAAC,EAAE;QACpE,OAAOT,MAAM,CAACS,KAAK,CAAC,CAACR,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC;MACjD;MAEA,OAAO,KAAK;IACd;IACA,OAAO,KAAK;EACd;AACF;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEO,SAASa,QAAQA,CAAC9C,MAAM,EAAE;EAC/B;EACA,OAAO+C,uBAAuB,CAAC;IAAC/C,MAAM;IAAEgD,eAAe,EAAE;EAAC,CAAC,CAAC;AAC9D;AAEO,SAASC,cAAcA,CAACjD,MAAM,EAAE;EACrCH,KAAK,CAAC,gBAAgB,CAAC;EACvB;EACA;EACA,OAAOkD,uBAAuB,CAAC;IAAC/C,MAAM;IAAEgD,eAAe,EAAE;EAAG,CAAC,CAAC;AAChE;AAEO,SAASE,kBAAkBA,CAAClD,MAAM,EAAE;EACzCH,KAAK,CAAC,8BAA8B,CAAC;EACrC;EACA;;EAEA,OAAOkD,uBAAuB,CAAC;IAAC/C,MAAM;IAAEgD,eAAe,EAAE,GAAG;IAAEG,OAAO,EAAE;EAAI,CAAC,CAAC;AAC/E;AAEO,SAASC,4BAA4BA,CAACpD,MAAM,EAAE;EACnDH,KAAK,CAAC,8BAA8B,CAAC;EACrC;EACA;;EAEA,OAAO;IAACwD,SAAS,EAAEN,uBAAuB,CAAC;MAAC/C,MAAM;MAAEgD,eAAe,EAAE,GAAG;MAAEG,OAAO,EAAE,IAAI;MAAEG,UAAU,EAAE,IAAI;MAAEC,gBAAgB,EAAE;IAAE,CAAC,CAAC;IAAEC,aAAa,EAAE;EAAY,CAAC;AACjK;AAEO,SAAST,uBAAuBA,CAAC;EAAC/C,MAAM;EAAEgD,eAAe;EAAEG,OAAO,GAAG,KAAK;EAAEG,UAAU,GAAG,KAAK;EAAEC,gBAAgB,GAAG;AAAE,CAAC,EAAE;EAC7H1D,KAAK,CAAE,6CAA4CmD,eAAgB,cAAaG,OAAQ,iBAAgBG,UAAW,EAAC,CAAC;EACrH,MAAMG,KAAK,GAAGC,QAAQ,CAAC,CAAC;EACxB,MAAMC,iBAAiB,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;EAErD,IAAI,IAAA5B,iCAAkB,EAAC0B,KAAK,CAAC,EAAE;IAC7B,MAAMG,SAAS,GAAG5B,MAAM,CAACyB,KAAK,CAAC,CAC5BxB,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpB4B,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;;IAET;IACA,MAAME,aAAa,GAAGJ,iBAAiB,CAACK,IAAI,CAACC,IAAI,IAAIL,SAAS,CAACM,WAAW,CAAC,CAAC,CAACC,UAAU,CAACF,IAAI,CAAC,CAAC;IAC9F;IACA;IACA,IAAIL,SAAS,CAACvD,MAAM,IAAI2C,eAAe,IAAI,CAACM,UAAU,EAAE;MACtD,OAAO,CAAE,aAAYS,aAAa,GAAG,EAAE,GAAG,GAAI,GAAEH,SAAU,IAAG,CAAC;IAChE;IACA,MAAMQ,cAAc,GAAGR,SAAS,CAACvD,MAAM,IAAI,CAAC;;IAE5C;IACA,MAAMgE,KAAK,GAAI,aAAYN,aAAa,IAAI,CAACK,cAAc,GAAG,EAAE,GAAG,GAAI,GAAER,SAAU,GAAEQ,cAAc,GAAG,GAAG,GAAG,EAAG,GAAE;IACjHvE,KAAK,CAAE,UAASwE,KAAM,EAAC,CAAC;IACxB,MAAMC,mBAAmB,GAAGhB,UAAU,GAAG,CAAC,GAAGC,gBAAgB,EAAEc,KAAK,CAAC,GAAGd,gBAAgB;IAExF,OAAOgB,kBAAkB,CAAC;MAACF,KAAK;MAAED,cAAc;MAAEjB,OAAO;MAAEG,UAAU;MAAEC,gBAAgB,EAAEe;IAAmB,CAAC,CAAC;EAChH;EAEA,OAAO,EAAE;EAET,SAASC,kBAAkBA,CAAC;IAACF,KAAK;IAAED,cAAc,GAAG,KAAK;IAAEjB,OAAO,GAAG,KAAK;IAAEG,UAAU,GAAG,KAAK;IAAEC,gBAAgB,GAAG;EAAE,CAAC,EAAE;IACvH1D,KAAK,CAAC,oBAAoB,CAAC;IAC3B,MAAM,CAAC2E,WAAW,CAAC,GAAGC,UAAU,CAACzE,MAAM,CAAC;IACxC,IAAIwE,WAAW,KAAKE,SAAS,EAAE;MAC7B,IAAIvB,OAAO,EAAE;QACX,MAAMmB,mBAAmB,GAAGhB,UAAU,GAAG,CAAC,GAAGC,gBAAgB,EAAG,GAAEiB,WAAY,QAAOH,KAAM,EAAC,CAAC,GAAGd,gBAAgB;QAChH,OAAOoB,eAAe,CAAC;UAACN,KAAK,EAAG,GAAEG,WAAY,QAAOH,KAAM,EAAC;UAAED,cAAc,EAAE,IAAI;UAAEd,UAAU;UAAEC,gBAAgB,EAAEe;QAAmB,CAAC,CAAC;MACzI;MACA,OAAOhB,UAAU,GAAGC,gBAAgB,GAAG,CAAE,GAAEiB,WAAY,QAAOH,KAAM,EAAC,CAAC;IACxE;IACA,OAAOO,oBAAoB,CAAC;MAACP,KAAK;MAAED,cAAc;MAAEjB,OAAO;MAAEG,UAAU;MAAEC;IAAgB,CAAC,CAAC;IAC3F;EACF;EAEA,SAASqB,oBAAoBA,CAAC;IAACP,KAAK;IAAED,cAAc,GAAG,KAAK;IAAEjB,OAAO,GAAG,KAAK;IAAEG,UAAU,GAAG,KAAK;IAAEC,gBAAgB,GAAG;EAAE,CAAC,EAAE;IACzH,MAAM,CAACsB,cAAc,CAAC,GAAGC,aAAa,CAAC9E,MAAM,CAAC;IAC9C,IAAI6E,cAAc,KAAKH,SAAS,EAAE;MAChC,IAAIvB,OAAO,EAAE;QACX,MAAMmB,mBAAmB,GAAGhB,UAAU,GAAG,CAAC,GAAGC,gBAAgB,EAAG,GAAEsB,cAAe,QAAOR,KAAM,EAAC,CAAC,GAAGd,gBAAgB;QACnH,OAAOoB,eAAe,CAAC;UAACN,KAAK,EAAG,GAAEQ,cAAe,QAAOR,KAAM,EAAC;UAAED,cAAc,EAAE,IAAI;UAAEd,UAAU;UAAEC,gBAAgB,EAAEe;QAAmB,CAAC,CAAC;MAC5I;MACA,OAAOhB,UAAU,GAAGC,gBAAgB,GAAG,CAAE,GAAEsB,cAAe,QAAOR,KAAM,EAAC,CAAC;IAC3E;IACA,IAAID,cAAc,IAAI,CAACjB,OAAO,EAAE;MAC9B,OAAOG,UAAU,GAAGC,gBAAgB,GAAG,CAAE,GAAEc,KAAM,EAAC,CAAC;IACrD;IACA,OAAOM,eAAe,CAAC;MAACN,KAAK;MAAED,cAAc;MAAEd,UAAU;MAAEC;IAAgB,CAAC,CAAC;EAC/E;EAEA,SAASoB,eAAeA,CAAC;IAACN,KAAK;IAAED,cAAc,GAAG,KAAK;IAAEd,UAAU,GAAG,KAAK;IAAEC,gBAAgB,GAAG;EAAE,CAAC,EAAE;IACnG,MAAM,CAACwB,SAAS,CAAC,GAAGC,OAAO,CAAChF,MAAM,CAAC;IACnC,IAAI+E,SAAS,KAAKL,SAAS,EAAE;MAC3B,MAAMJ,mBAAmB,GAAGhB,UAAU,GAAG,CAAC,GAAGC,gBAAgB,EAAG,GAAEwB,SAAU,QAAOV,KAAM,EAAC,CAAC,GAAGd,gBAAgB;MAC9G,OAAOD,UAAU,GAAGgB,mBAAmB,GAAG,CAAE,GAAES,SAAU,QAAOV,KAAM,EAAC,CAAC;IACzE;IACA,IAAID,cAAc,EAAE;MAClB,OAAOd,UAAU,GAAGC,gBAAgB,GAAG,CAAE,GAAEc,KAAM,EAAC,CAAC;IACrD;IACA,OAAO,EAAE;EACX;EAEA,SAASX,QAAQA,CAAA,EAAG;IAClB,MAAM,CAACzC,KAAK,CAAC,GAAGjB,MAAM,CAACI,GAAG,CAAC,QAAQ,CAAC;IAEpC,IAAIa,KAAK,EAAE;MACT,MAAMgE,WAAW,GAAGhE,KAAK,CAACyB;MACxB;MAAA,CACC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAACsC,QAAQ,CAACtC,IAAI,CAAC;MAC7C;MAAA,CACC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC0C,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOF,WAAW;IACpB;IACA,OAAO,KAAK;EACd;AACF;AAEO,SAASR,UAAUA,CAACzE,MAAM,EAAE;EACjC,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,qEAAqE,CAAC;EACtG,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,qCAAoC,CAAC;EAC5C;;EAEA,MAAMuF,MAAM,GAAGC,SAAS,CAACrF,MAAM,CAAC;EAChC,MAAM2D,iBAAiB,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;EAGrD,IAAI,IAAA5B,iCAAkB,EAACqD,MAAM,CAAC,EAAE;IAC9B,MAAMxB,SAAS,GAAG5B,MAAM,CAACoD,MAAM,CAAC,CAC7BnD,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpB4B,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;;IAET;IACA,MAAME,aAAa,GAAGJ,iBAAiB,CAACK,IAAI,CAACC,IAAI,IAAIL,SAAS,CAACM,WAAW,CAAC,CAAC,CAACC,UAAU,CAACF,IAAI,CAAC,CAAC;IAC9F;IACAhE,SAAS,CAAE,kBAAiB2D,SAAU,EAAC,CAAC;IACxC,IAAIA,SAAS,CAACvD,MAAM,IAAI,CAAC,EAAE;MACzB,OAAO,CAAE,cAAa0D,aAAa,GAAG,EAAE,GAAG,GAAI,GAAEH,SAAU,IAAG,CAAC;IACjE;IACA,OAAO,EAAE;EACX;EAEA,OAAO,EAAE;EAET,SAASyB,SAASA,CAACrF,MAAM,EAAE;IACzB;IACA;IACA,MAAM,CAACiB,KAAK,CAAC,GAAGjB,MAAM,CAACI,GAAG,CAAC,wCAAwC,CAAC;IACpE;;IAEA,IAAIa,KAAK,EAAE;MACT,MAAMqE,YAAY,GAAGrE,KAAK,CAACyB,SAAS,CACjC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAACsC,QAAQ,CAACtC,IAAI,CAAC,CAAC,CACxC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC0C,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOG,YAAY;IACrB;IACA,OAAO,KAAK;EACd;AACF;AAEO,SAASR,aAAaA,CAAC9E,MAAM,EAAE;EACpC,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,wEAAwE,CAAC;EACzG,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,wCAAuC,CAAC;EAC/C;;EAEA,MAAM0F,SAAS,GAAGC,YAAY,CAACxF,MAAM,CAAC;EACtC,IAAI,IAAA+B,iCAAkB,EAACwD,SAAS,CAAC,EAAE;IACjC,MAAM3B,SAAS,GAAG5B,MAAM,CAACuD,SAAS,CAAC,CAChCtD,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpB4B,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;IAET5D,SAAS,CAAE,qBAAoB2D,SAAU,EAAC,CAAC;IAC3C;IACA,OAAO,CAAE,iBAAgBA,SAAU,GAAE,CAAC;EACxC;EAEA,OAAO,EAAE;EAET,SAAS4B,YAAYA,CAACxF,MAAM,EAAE;IAC5B;IACA,MAAM,CAACiB,KAAK,CAAC,GAAGjB,MAAM,CAACI,GAAG,CAAC,oBAAoB,CAAC;IAChD;;IAEA,IAAIa,KAAK,EAAE;MACT,MAAMwE,eAAe,GAAGxE,KAAK,CAACyB,SAAS,CACpC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAACsC,QAAQ,CAACtC,IAAI,CAAC,CAAC,CACxC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC0C,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOM,eAAe;IACxB;IACA,OAAO,KAAK;EACd;AACF;AAEO,SAAST,OAAOA,CAAChF,MAAM,EAAE;EAC9B,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,kEAAkE,CAAC;EACnG,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,wCAAuC,CAAC;EAC/CI,SAAS,CAACD,MAAM,CAAC;EAEjB,MAAM0F,IAAI,GAAGC,OAAO,CAAC3F,MAAM,CAAC;EAC5B,IAAI0F,IAAI,EAAE;IACR,OAAO,CAAE,YAAWA,IAAK,GAAE,CAAC;EAC9B;EACA,OAAO,EAAE;EAET,SAASC,OAAOA,CAAC3F,MAAM,EAAE;IACvB,MAAMyC,KAAK,GAAGzC,MAAM,CAACI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAEqC,KAAK,IAAIiC,SAAS;IAC3D,OAAO,IAAA3C,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,CAACqB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAGY,SAAS;EAC3E;AACF;AAGO,SAASkB,sBAAsBA,CAAC5F,MAAM,EAAE;EAE7C,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,iFAAiF,CAAC;EAClH,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,2CAA0C,CAAC;;EAElD;;EAEA,MAAMgG,MAAM,GAAG7F,MAAM,CAACI,GAAG,CAAC,wBAAwB,CAAC;EACnD,MAAM0F,WAAW,GAAG,EAAE,CAACnE,MAAM,CAAC,GAAGkE,MAAM,CAAChF,GAAG,CAACkF,aAAa,CAAC,CAAC;EAC3D,MAAMC,iBAAiB,GAAG,CAAC,GAAG,IAAIC,GAAG,CAACH,WAAW,CAAC,CAAC;EAEnD7F,SAAS,CAAE,+BAA8BK,IAAI,CAACC,SAAS,CAACsF,MAAM,CAAE,EAAC,CAAC;EAClE5F,SAAS,CAAE,gBAAe6F,WAAW,CAACzF,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACuF,WAAW,CAAE,EAAC,CAAC;EAChF7F,SAAS,CAAE,uBAAsB+F,iBAAiB,CAAC3F,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACyF,iBAAiB,CAAE,EAAC,CAAC;EAEnG,IAAIA,iBAAiB,CAAC3F,MAAM,GAAG,CAAC,EAAE;IAChCR,KAAK,CAAE,2CAA0C,CAAC;IAClD,OAAO,EAAE;EACX;EAEA,OAAO,IAAAe,+BAAS,EAACoF,iBAAiB,EAAE,eAAe,CAAC;EAEpD,SAASD,aAAaA,CAAC;IAACG,GAAG;IAAExD;EAAS,CAAC,EAAE;IACvC,MAAMyD,cAAc,GAAI,kBAAmB;IAC3C,MAAMC,aAAa,GAAI,mBAAoB;IAE3C,IAAIF,GAAG,KAAK,KAAK,EAAE;MACjB,OAAOxD,SAAS,CACb3B,MAAM,CAACsF,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAACnB,QAAQ,CAACmB,GAAG,CAACzD,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAACsE,GAAG,CAAC5D,KAAK,CAAC,IAAI0D,cAAc,CAACtD,IAAI,CAACb,MAAM,CAACqE,GAAG,CAAC5D,KAAK,CAAC,CAAC,CAAC,CAC5H5B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;IACpC;IAEA,IAAIyD,GAAG,KAAK,KAAK,EAAE;MACjB,OAAOxD,SAAS,CACb3B,MAAM,CAACsF,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAACnB,QAAQ,CAACmB,GAAG,CAACzD,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAACsE,GAAG,CAAC5D,KAAK,CAAC,IAAI0D,cAAc,CAACtD,IAAI,CAACb,MAAM,CAACqE,GAAG,CAAC5D,KAAK,CAAC,CAAC,CAAC,CACvH5B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;IACpC;IAEA,OAAOC,SAAS,CACb3B,MAAM,CAACsF,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAACnB,QAAQ,CAACmB,GAAG,CAACzD,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAACsE,GAAG,CAAC5D,KAAK,CAAC,IAAI2D,aAAa,CAACvD,IAAI,CAACb,MAAM,CAACqE,GAAG,CAAC5D,KAAK,CAAC,CAAC,CAAC,CACtH5B,GAAG,CAAC,CAAC;MAAC4B;IAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;EACpC;AACF"}
+{"version":3,"file":"bib.js","names":["_debug","_interopRequireDefault","require","_candidateSearchUtils","_matchingUtils","obj","__esModule","default","debug","createDebugLogger","bibSourceIds","record","debugData","extend","fSids","get","length","JSON","stringify","toSidQueries","sidStrings","getSidStrings","sidQueries","toQueries","map","toSidString","filter","nonEmptySid","field","validateSidFieldSubfieldCounts","createSidString","sfC","getSubfieldValues","sfB","cleanedSfC","removeSourcePrefix","normalizeSidSubfieldValue","cleanedSfB","concat","subfieldValue","sourcePrefixRegex","normalizedValue","testStringOrNumber","String","replace","normalizeAwayRegex","bibMelindaIds","melindaIds","getMelindaIdsF035","bibHostComponents","id","getHostId","value","subfields","find","code","test","bibTitle","bibTitleAuthorPublisher","onlyTitleLength","bibTitleAuthor","bibTitleAuthorYear","addYear","bibTitleAuthorYearAlternates","origQueryList","alternates","alternateQueries","queryList","Array","from","reverse","queryListType","title","getTitle","booleanStartWords","formatted","trim","slice","useWordSearch","some","word","toLowerCase","startsWith","queryIsOkAlone","query","newAlternateQueries","addAuthorsToSearch","authorQuery","bibAuthors","undefined","addYearToSearch","addPublisherToSearch","publisherQuery","bibPublishers","yearQuery","bibYear","titleString","includes","join","author","getAuthor","authorString","publisher","getPublisher","publisherString","year","getYear","bibStandardIdentifiers","fields","identifiers","toIdentifiers","uniqueIdentifiers","Set","tag","issnIsbnReqExp","otherIdReqExp","sub"],"sources":["../../../src/candidate-search/query-list/bib.js"],"sourcesContent":["\n/**\n*\n* @licstart  The following is the entire license notice for the JavaScript code in this file.\n*\n* Melinda record matching modules for Javascript\n*\n* Copyright (C) 2020-2023 University Of Helsinki (The National Library Of Finland)\n*\n* This file is part of melinda-record-matching-js\n*\n* melinda-record-matching-js program is free software: you can redistribute it and/or modify\n* it under the terms of the GNU Lesser General Public License as\n* published by the Free Software Foundation, either version 3 of the\n* License, or (at your option) any later version.\n*\n* melinda-record-matching-js is distributed in the hope that it will be useful,\n* but WITHOUT ANY WARRANTY; without even the implied warranty of\n* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n* GNU Lesser General Public License for more details.\n*\n* You should have received a copy of the GNU Affero General Public License\n* along with this program.  If not, see <http://www.gnu.org/licenses/>.\n*\n* @licend  The above is the entire license notice\n* for the JavaScript code in this file.\n*\n*/\nimport createDebugLogger from 'debug';\nimport {toQueries} from '../candidate-search-utils';\nimport {getMelindaIdsF035, validateSidFieldSubfieldCounts, getSubfieldValues, testStringOrNumber} from '../../matching-utils';\n\nconst debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query');\n\nexport function bibSourceIds(record) {\n\n  /* Melinda's SRU-index melinda.sourceid includes source IDs from SID fields in Melinda records\n     SID-fields in Melinda have sf $c with local id and sf $b with a code for the local db:\n\n     SID__ $c 123457 $b helka\n     SID__ $c (ANDL100020)1077305 $b sata\n     SID__ $c VER999999 $ FI-KV\n     SID__ $c /10024/508126 $ REPO_THESEUS\n\n    In melinda.sourceid -index case is kept, sourceprefixes in brackets and hyphens are normalized away:\n    Note: slashes are not normalized away, but a SRU-search-string including slashes needs to be quoted\n\n    1234567helka\n    1077305sata\n    VER999999FIKV\n    /10024/508126REPO_THESEUS\n\n    Note: All Melinda records that have a matching records in a local db do NOT have SID for that local records,\n          existence of a SID field depends on how the record has been added to Melinda and how it has been handled\n          afterwards. SIDs are also not reliably maintained. A record might or might not have a SID for a local db\n          after the matching record is removed from the local db.\n\n   */\n\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:source-ids');\n  const debugData = debug.extend('data');\n  //const debugInfo = debug.extend('info');\n\n  debug(`Creating queries for sourceid's`);\n\n  const fSids = record.get('SID');\n  debugData(`SID-fields (${fSids.length}): ${JSON.stringify(fSids)}`);\n\n  return fSids.length > 0 ? toSidQueries(fSids) : [];\n\n  function toSidQueries(fSids) {\n    debug(`Creating actual queries for sourceid's`);\n\n    const sidStrings = getSidStrings(fSids);\n\n    if (sidStrings.length < 1) {\n      debug(`No identifiers found, no queries created.`);\n      return [];\n    }\n\n    const sidQueries = toQueries(sidStrings, 'melinda.sourceid');\n\n    return sidQueries;\n\n    function getSidStrings(fSids) {\n      debug(`Getting Sid strings from SID fields`);\n\n      // Map SID fields to valid sidStrings, filter out empty strings\n      const sidStrings = fSids.map(toSidString).filter(nonEmptySid => nonEmptySid);\n      return sidStrings;\n\n      function toSidString(field) {\n        debug(`Getting string from a field`);\n\n        return validateSidFieldSubfieldCounts(field) ? createSidString(field) : '';\n\n        function createSidString(field) {\n          debug(`Creating string from a field`);\n          const [sfC] = getSubfieldValues(field, 'c');\n          const [sfB] = getSubfieldValues(field, 'b');\n\n          const cleanedSfC = removeSourcePrefix(normalizeSidSubfieldValue(sfC));\n          const cleanedSfB = normalizeSidSubfieldValue(sfB);\n\n          debugData(`${JSON.stringify(sfC)} + ${JSON.stringify(sfB)}`);\n          return cleanedSfC.concat(cleanedSfB);\n        }\n\n        function removeSourcePrefix(subfieldValue) {\n          const sourcePrefixRegex = (/^(?<sourcePrefix>\\([A-Za-z0-9-]+\\))(?<id>.+)$/u);\n          const normalizedValue = testStringOrNumber(subfieldValue) ? String(subfieldValue).replace(sourcePrefixRegex, '$<id>') : '';\n          debugData(`Normalized ${subfieldValue} to ${normalizedValue}`);\n          return normalizedValue;\n        }\n\n        function normalizeSidSubfieldValue(subfieldValue) {\n          debugData(`Normalizing ${subfieldValue}`);\n          const normalizeAwayRegex = (/[- ]/u);\n          return testStringOrNumber(subfieldValue) ? String(subfieldValue).replace(normalizeAwayRegex, '') : '';\n        }\n\n      }\n    }\n  }\n}\n\nexport function bibMelindaIds(record) {\n  // Melinda's SRU-index melinda.melindaid includes f001 controlnumbers and old Melinda-IDs from f035z's for all non-deleted Melinda-records\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibMelindaIds');\n  const debugData = debug.extend('data');\n  debug(`Creating queries for MelindaIds`);\n\n  // Note: Melinda-ID's for search queries are created just from records f035a's and f035z's\n  // Both (FI-MELINDA)- and FCC-prefixed forms are found\n  // f001 controlnumber is not currently included, even if record's f003 is FI-MELINDA\n  const melindaIds = getMelindaIdsF035(record);\n\n  debugData(`Unique identifiers (${melindaIds.length}): ${JSON.stringify(melindaIds)}`);\n\n  if (melindaIds.length < 1) {\n    debug(`No identifiers found, no queries created.`);\n    return [];\n  }\n\n  return toQueries(melindaIds, 'melinda.melindaid');\n}\n\n\n// bibHostComponents returns host id from the first subfield $w of first field f773, see test-fixtures 04 and 05\n// bibHostComponents should search all 773 $ws for possible host id, but what should it do in case of multiple host ids?\nexport function bibHostComponents(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibHostComponents');\n  const debugData = debug.extend('data');\n  debug(`Creating queries for hostIds`);\n\n  const id = getHostId();\n  debugData(`Found id: ${JSON.stringify(id)}`);\n\n  return testStringOrNumber(id) ? [`melinda.partsofhost=${id}`] : [];\n\n  function getHostId() {\n    const [field] = record.get(/^773$/u);\n\n    if (field) {\n      const {value} = field.subfields.find(({code}) => code === 'w') || {};\n\n      if (testStringOrNumber(value) && (/^\\(FI-MELINDA\\)/u).test(String(value))) {\n        return String(value).replace(/^\\(FI-MELINDA\\)/u, '');\n      }\n\n      if (testStringOrNumber(value) && (/^\\(FIN01\\)/u).test(String(value))) {\n        return String(value).replace(/^\\(FIN01\\)/u, '');\n      }\n\n      return false;\n    }\n    return false;\n  }\n}\n\n// SRU search dc.title with a search phrase starting with ^ maps currently in Melinda to\n// (probably) to *headings* index TIT\n// - Aleph cannot currently handle headings searches starting with a boolean - in these cases use word search\n\n// Headings index TIT drops articles etc. from the start of the title according to the filing indicator\n// Currently filing indicator is not implemented - if the title starts with an article and the Melinda\n// record is correctly catalogued using a filing indicator -> dc.title search won't match\n\nexport function bibTitle(record) {\n  // We get author/publisher only when formatted title is shorter than 5 chars\n  return bibTitleAuthorPublisher({record, onlyTitleLength: 5});\n}\n\nexport function bibTitleAuthor(record) {\n  debug('bibTitleAuthor');\n  // We use onlyTitleLength that is longer than our formatted length to\n  // get an author or an publisher always\n  return bibTitleAuthorPublisher({record, onlyTitleLength: 100});\n}\n\nexport function bibTitleAuthorYear(record) {\n  debug('bibTitleAuthorYearAlternates');\n  // We use onlyTitleLength that is longer than our formatted length to\n  // get an author or an publisher always\n\n  return bibTitleAuthorPublisher({record, onlyTitleLength: 100, addYear: true});\n}\n\nexport function bibTitleAuthorYearAlternates(record) {\n  debug('bibTitleAuthorYearAlternates');\n  // We use onlyTitleLength that is longer than our formatted length to\n  // get an author or an publisher always\n  const origQueryList = bibTitleAuthorPublisher({record, onlyTitleLength: 100, addYear: true, alternates: true, alternateQueries: []});\n  debug(`${JSON.stringify(origQueryList)}`);\n  return {queryList: Array.from(origQueryList).reverse(), queryListType: 'alternates'};\n}\n\nexport function bibTitleAuthorPublisher({record, onlyTitleLength, addYear = false, alternates = false, alternateQueries = []}) {\n  debug(`bibTitleAuthorPublisher, onlyTitleLength: ${onlyTitleLength}, addYear: ${addYear}, alternates: ${alternates}`);\n  const title = getTitle();\n  const booleanStartWords = ['and', 'or', 'nor', 'not'];\n\n  if (testStringOrNumber(title)) {\n    const formatted = String(title)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    // use word search for titles starting with a boolean\n    const useWordSearch = booleanStartWords.some(word => formatted.toLowerCase().startsWith(word));\n    // Prevent too many matches / SRU crashing by having a minimum length\n    // Note that currently this fails matching if there are no matches from previous matchers\n    if (formatted.length >= onlyTitleLength && !alternates) {\n      return [`dc.title=\"${useWordSearch ? '' : '^'}${formatted}*\"`];\n    }\n    const queryIsOkAlone = formatted.length >= 5;\n\n    // use word search without ending * also in combination searches to avoid SRU-server crashes [MRA-189]\n    const query = `dc.title=\"${useWordSearch || !queryIsOkAlone ? '' : '^'}${formatted}${queryIsOkAlone ? '*' : ''}\"`;\n    debug(`query: ${query}`);\n    const newAlternateQueries = alternates ? [...alternateQueries, query] : alternateQueries;\n\n    return addAuthorsToSearch({query, queryIsOkAlone, addYear, alternates, alternateQueries: newAlternateQueries});\n  }\n\n  return [];\n\n  function addAuthorsToSearch({query, queryIsOkAlone = false, addYear = false, alternates = false, alternateQueries = []}) {\n    debug('addAuthorsToSearch');\n    const [authorQuery] = bibAuthors(record);\n    if (authorQuery !== undefined) {\n      if (addYear) {\n        const newAlternateQueries = alternates ? [...alternateQueries, `${authorQuery} AND ${query}`] : alternateQueries;\n        return addYearToSearch({query: `${authorQuery} AND ${query}`, queryIsOkAlone: true, alternates, alternateQueries: newAlternateQueries});\n      }\n      return alternates ? alternateQueries : [`${authorQuery} AND ${query}`];\n    }\n    return addPublisherToSearch({query, queryIsOkAlone, addYear, alternates, alternateQueries});\n    //return [];\n  }\n\n  function addPublisherToSearch({query, queryIsOkAlone = false, addYear = false, alternates = false, alternateQueries = []}) {\n    const [publisherQuery] = bibPublishers(record);\n    if (publisherQuery !== undefined) {\n      if (addYear) {\n        const newAlternateQueries = alternates ? [...alternateQueries, `${publisherQuery} AND ${query}`] : alternateQueries;\n        return addYearToSearch({query: `${publisherQuery} AND ${query}`, queryIsOkAlone: true, alternates, alternateQueries: newAlternateQueries});\n      }\n      return alternates ? alternateQueries : [`${publisherQuery} AND ${query}`];\n    }\n    if (queryIsOkAlone && !addYear) {\n      return alternates ? alternateQueries : [`${query}`];\n    }\n    return addYearToSearch({query, queryIsOkAlone, alternates, alternateQueries});\n  }\n\n  function addYearToSearch({query, queryIsOkAlone = false, alternates = false, alternateQueries = []}) {\n    const [yearQuery] = bibYear(record);\n    if (yearQuery !== undefined) {\n      const newAlternateQueries = alternates ? [...alternateQueries, `${yearQuery} AND ${query}`] : alternateQueries;\n      return alternates ? newAlternateQueries : [`${yearQuery} AND ${query}`];\n    }\n    if (queryIsOkAlone) {\n      return alternates ? alternateQueries : [`${query}`];\n    }\n    return [];\n  }\n\n  function getTitle() {\n    const [field] = record.get(/^245$/u);\n\n    if (field) {\n      const titleString = field.subfields\n        //.filter(({code}) => ['a', 'b', 'n', 'p'].includes(code))\n        .filter(({code}) => ['a', 'b'].includes(code))\n        //.filter(({code}) => ['a'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return titleString;\n    }\n    return false;\n  }\n}\n\nexport function bibAuthors(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibAuthors');\n  const debugData = debug.extend('data');\n  debug(`Creating query for the first author`);\n  //debugData(record);\n\n  const author = getAuthor(record);\n  const booleanStartWords = ['and', 'or', 'nor', 'not'];\n\n\n  if (testStringOrNumber(author)) {\n    const formatted = String(author)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    // use word search for authors starting with a boolean\n    const useWordSearch = booleanStartWords.some(word => formatted.toLowerCase().startsWith(word));\n    // Prevent too many matches by having a minimum length\n    debugData(`Author string: ${formatted}`);\n    if (formatted.length >= 5) {\n      return [`dc.author=\"${useWordSearch ? '' : '^'}${formatted}*\"`];\n    }\n    return [];\n  }\n\n  return [];\n\n  function getAuthor(record) {\n    //debugData(record);\n    // eslint-disable-next-line prefer-named-capture-group\n    const [field] = record.get(/^(100)|(110)|(111)|(700)|(710)|(711)$/u);\n    //debugData(field);\n\n    if (field) {\n      const authorString = field.subfields\n        .filter(({code}) => ['a'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return authorString;\n    }\n    return false;\n  }\n}\n\nexport function bibPublishers(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibPublishers');\n  const debugData = debug.extend('data');\n  debug(`Creating query for the first publisher`);\n  //debugData(record);\n\n  const publisher = getPublisher(record);\n  if (testStringOrNumber(publisher)) {\n    const formatted = String(publisher)\n      .replace(/[^\\w\\s\\p{Alphabetic}]/gu, '')\n      // Clean up concurrent spaces from fe. subfield changes\n      .replace(/ +/gu, ' ')\n      .trim()\n      .slice(0, 30)\n      .trim();\n\n    debugData(`Publisher string: ${formatted}`);\n    // use non-wildcard word search from dc.publisher\n    return [`dc.publisher=\"${formatted}\"`];\n  }\n\n  return [];\n\n  function getPublisher(record) {\n    //debugData(record);\n    const [field] = record.get(/^(?:260)|(?:264)$/u);\n    //debugData(field);\n\n    if (field) {\n      const publisherString = field.subfields\n        .filter(({code}) => ['b'].includes(code))\n        .map(({value}) => testStringOrNumber(value) ? String(value) : '')\n        .filter(value => value)\n        // In Melinda's index subfield separators are indexed as ' '\n        .join(' ');\n      return publisherString;\n    }\n    return false;\n  }\n}\n\nexport function bibYear(record) {\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibYear');\n  const debugData = debug.extend('data');\n  debug(`Creating query for the publishing year`);\n  debugData(record);\n\n  const year = getYear(record);\n  if (year) {\n    return [`dc.date=\"${year}\"`];\n  }\n  return [];\n\n  function getYear(record) {\n    const value = record.get(/^008$/u)?.[0]?.value || undefined;\n    return testStringOrNumber(value) ? String(value).slice(7, 11) : undefined;\n  }\n}\n\n\nexport function bibStandardIdentifiers(record) {\n\n  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:query:bibStandardIdentifiers');\n  const debugData = debug.extend('data');\n  debug(`Creating queries for standard identifiers`);\n\n  // DEVELOP: should we query also f015 and f028?\n\n  const fields = record.get(/^(?<def>020|022|024)$/u);\n  const identifiers = [].concat(...fields.map(toIdentifiers));\n  const uniqueIdentifiers = [...new Set(identifiers)];\n\n  debugData(`Standard identifier fields: ${JSON.stringify(fields)}`);\n  debugData(`Identifiers (${identifiers.length}): ${JSON.stringify(identifiers)}`);\n  debugData(`Unique identifiers (${uniqueIdentifiers.length}): ${JSON.stringify(uniqueIdentifiers)}`);\n\n  if (uniqueIdentifiers.length < 1) {\n    debug(`No identifiers found, no queries created.`);\n    return [];\n  }\n\n  return toQueries(uniqueIdentifiers, 'dc.identifier');\n\n  function toIdentifiers({tag, subfields}) {\n    const issnIsbnReqExp = (/^[A-Za-z0-9-]+$/u);\n    const otherIdReqExp = (/^[A-Za-z0-9-:]+$/u);\n\n    if (tag === '022') {\n      return subfields\n        .filter(sub => ['a', 'z', 'y'].includes(sub.code) && testStringOrNumber(sub.value) && issnIsbnReqExp.test(String(sub.value)))\n        .map(({value}) => String(value));\n    }\n\n    if (tag === '020') {\n      return subfields\n        .filter(sub => ['a', 'z'].includes(sub.code) && testStringOrNumber(sub.value) && issnIsbnReqExp.test(String(sub.value)))\n        .map(({value}) => String(value));\n    }\n\n    return subfields\n      .filter(sub => ['a', 'z'].includes(sub.code) && testStringOrNumber(sub.value) && otherIdReqExp.test(String(sub.value)))\n      .map(({value}) => String(value));\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AA4BA,IAAAA,MAAA,GAAAC,sBAAA,CAAAC,OAAA;AACA,IAAAC,qBAAA,GAAAD,OAAA;AACA,IAAAE,cAAA,GAAAF,OAAA;AAA8H,SAAAD,uBAAAI,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AA7B9H;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAKA,MAAMG,KAAK,GAAG,IAAAC,cAAiB,EAAC,0DAA0D,CAAC;AAEpF,SAASC,YAAYA,CAACC,MAAM,EAAE;EAEnC;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;EAQE,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,qEAAqE,CAAC;EACtG,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtC;;EAEAL,KAAK,CAAE,iCAAgC,CAAC;EAExC,MAAMM,KAAK,GAAGH,MAAM,CAACI,GAAG,CAAC,KAAK,CAAC;EAC/BH,SAAS,CAAE,eAAcE,KAAK,CAACE,MAAO,MAAKC,IAAI,CAACC,SAAS,CAACJ,KAAK,CAAE,EAAC,CAAC;EAEnE,OAAOA,KAAK,CAACE,MAAM,GAAG,CAAC,GAAGG,YAAY,CAACL,KAAK,CAAC,GAAG,EAAE;EAElD,SAASK,YAAYA,CAACL,KAAK,EAAE;IAC3BN,KAAK,CAAE,wCAAuC,CAAC;IAE/C,MAAMY,UAAU,GAAGC,aAAa,CAACP,KAAK,CAAC;IAEvC,IAAIM,UAAU,CAACJ,MAAM,GAAG,CAAC,EAAE;MACzBR,KAAK,CAAE,2CAA0C,CAAC;MAClD,OAAO,EAAE;IACX;IAEA,MAAMc,UAAU,GAAG,IAAAC,+BAAS,EAACH,UAAU,EAAE,kBAAkB,CAAC;IAE5D,OAAOE,UAAU;IAEjB,SAASD,aAAaA,CAACP,KAAK,EAAE;MAC5BN,KAAK,CAAE,qCAAoC,CAAC;;MAE5C;MACA,MAAMY,UAAU,GAAGN,KAAK,CAACU,GAAG,CAACC,WAAW,CAAC,CAACC,MAAM,CAACC,WAAW,IAAIA,WAAW,CAAC;MAC5E,OAAOP,UAAU;MAEjB,SAASK,WAAWA,CAACG,KAAK,EAAE;QAC1BpB,KAAK,CAAE,6BAA4B,CAAC;QAEpC,OAAO,IAAAqB,6CAA8B,EAACD,KAAK,CAAC,GAAGE,eAAe,CAACF,KAAK,CAAC,GAAG,EAAE;QAE1E,SAASE,eAAeA,CAACF,KAAK,EAAE;UAC9BpB,KAAK,CAAE,8BAA6B,CAAC;UACrC,MAAM,CAACuB,GAAG,CAAC,GAAG,IAAAC,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAC3C,MAAM,CAACK,GAAG,CAAC,GAAG,IAAAD,gCAAiB,EAACJ,KAAK,EAAE,GAAG,CAAC;UAE3C,MAAMM,UAAU,GAAGC,kBAAkB,CAACC,yBAAyB,CAACL,GAAG,CAAC,CAAC;UACrE,MAAMM,UAAU,GAAGD,yBAAyB,CAACH,GAAG,CAAC;UAEjDrB,SAAS,CAAE,GAAEK,IAAI,CAACC,SAAS,CAACa,GAAG,CAAE,MAAKd,IAAI,CAACC,SAAS,CAACe,GAAG,CAAE,EAAC,CAAC;UAC5D,OAAOC,UAAU,CAACI,MAAM,CAACD,UAAU,CAAC;QACtC;QAEA,SAASF,kBAAkBA,CAACI,aAAa,EAAE;UACzC,MAAMC,iBAAiB,GAAI,gDAAiD;UAC5E,MAAMC,eAAe,GAAG,IAAAC,iCAAkB,EAACH,aAAa,CAAC,GAAGI,MAAM,CAACJ,aAAa,CAAC,CAACK,OAAO,CAACJ,iBAAiB,EAAE,OAAO,CAAC,GAAG,EAAE;UAC1H5B,SAAS,CAAE,cAAa2B,aAAc,OAAME,eAAgB,EAAC,CAAC;UAC9D,OAAOA,eAAe;QACxB;QAEA,SAASL,yBAAyBA,CAACG,aAAa,EAAE;UAChD3B,SAAS,CAAE,eAAc2B,aAAc,EAAC,CAAC;UACzC,MAAMM,kBAAkB,GAAI,OAAQ;UACpC,OAAO,IAAAH,iCAAkB,EAACH,aAAa,CAAC,GAAGI,MAAM,CAACJ,aAAa,CAAC,CAACK,OAAO,CAACC,kBAAkB,EAAE,EAAE,CAAC,GAAG,EAAE;QACvG;MAEF;IACF;EACF;AACF;AAEO,SAASC,aAAaA,CAACnC,MAAM,EAAE;EACpC;;EAEA,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,wEAAwE,CAAC;EACzG,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,iCAAgC,CAAC;;EAExC;EACA;EACA;EACA,MAAMuC,UAAU,GAAG,IAAAC,gCAAiB,EAACrC,MAAM,CAAC;EAE5CC,SAAS,CAAE,uBAAsBmC,UAAU,CAAC/B,MAAO,MAAKC,IAAI,CAACC,SAAS,CAAC6B,UAAU,CAAE,EAAC,CAAC;EAErF,IAAIA,UAAU,CAAC/B,MAAM,GAAG,CAAC,EAAE;IACzBR,KAAK,CAAE,2CAA0C,CAAC;IAClD,OAAO,EAAE;EACX;EAEA,OAAO,IAAAe,+BAAS,EAACwB,UAAU,EAAE,mBAAmB,CAAC;AACnD;;AAGA;AACA;AACO,SAASE,iBAAiBA,CAACtC,MAAM,EAAE;EACxC,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,4EAA4E,CAAC;EAC7G,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,8BAA6B,CAAC;EAErC,MAAM0C,EAAE,GAAGC,SAAS,CAAC,CAAC;EACtBvC,SAAS,CAAE,aAAYK,IAAI,CAACC,SAAS,CAACgC,EAAE,CAAE,EAAC,CAAC;EAE5C,OAAO,IAAAR,iCAAkB,EAACQ,EAAE,CAAC,GAAG,CAAE,uBAAsBA,EAAG,EAAC,CAAC,GAAG,EAAE;EAElE,SAASC,SAASA,CAAA,EAAG;IACnB,MAAM,CAACvB,KAAK,CAAC,GAAGjB,MAAM,CAACI,GAAG,CAAC,QAAQ,CAAC;IAEpC,IAAIa,KAAK,EAAE;MACT,MAAM;QAACwB;MAAK,CAAC,GAAGxB,KAAK,CAACyB,SAAS,CAACC,IAAI,CAAC,CAAC;QAACC;MAAI,CAAC,KAAKA,IAAI,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC;MAEpE,IAAI,IAAAb,iCAAkB,EAACU,KAAK,CAAC,IAAK,kBAAkB,CAAEI,IAAI,CAACb,MAAM,CAACS,KAAK,CAAC,CAAC,EAAE;QACzE,OAAOT,MAAM,CAACS,KAAK,CAAC,CAACR,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC;MACtD;MAEA,IAAI,IAAAF,iCAAkB,EAACU,KAAK,CAAC,IAAK,aAAa,CAAEI,IAAI,CAACb,MAAM,CAACS,KAAK,CAAC,CAAC,EAAE;QACpE,OAAOT,MAAM,CAACS,KAAK,CAAC,CAACR,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC;MACjD;MAEA,OAAO,KAAK;IACd;IACA,OAAO,KAAK;EACd;AACF;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEO,SAASa,QAAQA,CAAC9C,MAAM,EAAE;EAC/B;EACA,OAAO+C,uBAAuB,CAAC;IAAC/C,MAAM;IAAEgD,eAAe,EAAE;EAAC,CAAC,CAAC;AAC9D;AAEO,SAASC,cAAcA,CAACjD,MAAM,EAAE;EACrCH,KAAK,CAAC,gBAAgB,CAAC;EACvB;EACA;EACA,OAAOkD,uBAAuB,CAAC;IAAC/C,MAAM;IAAEgD,eAAe,EAAE;EAAG,CAAC,CAAC;AAChE;AAEO,SAASE,kBAAkBA,CAAClD,MAAM,EAAE;EACzCH,KAAK,CAAC,8BAA8B,CAAC;EACrC;EACA;;EAEA,OAAOkD,uBAAuB,CAAC;IAAC/C,MAAM;IAAEgD,eAAe,EAAE,GAAG;IAAEG,OAAO,EAAE;EAAI,CAAC,CAAC;AAC/E;AAEO,SAASC,4BAA4BA,CAACpD,MAAM,EAAE;EACnDH,KAAK,CAAC,8BAA8B,CAAC;EACrC;EACA;EACA,MAAMwD,aAAa,GAAGN,uBAAuB,CAAC;IAAC/C,MAAM;IAAEgD,eAAe,EAAE,GAAG;IAAEG,OAAO,EAAE,IAAI;IAAEG,UAAU,EAAE,IAAI;IAAEC,gBAAgB,EAAE;EAAE,CAAC,CAAC;EACpI1D,KAAK,CAAE,GAAES,IAAI,CAACC,SAAS,CAAC8C,aAAa,CAAE,EAAC,CAAC;EACzC,OAAO;IAACG,SAAS,EAAEC,KAAK,CAACC,IAAI,CAACL,aAAa,CAAC,CAACM,OAAO,CAAC,CAAC;IAAEC,aAAa,EAAE;EAAY,CAAC;AACtF;AAEO,SAASb,uBAAuBA,CAAC;EAAC/C,MAAM;EAAEgD,eAAe;EAAEG,OAAO,GAAG,KAAK;EAAEG,UAAU,GAAG,KAAK;EAAEC,gBAAgB,GAAG;AAAE,CAAC,EAAE;EAC7H1D,KAAK,CAAE,6CAA4CmD,eAAgB,cAAaG,OAAQ,iBAAgBG,UAAW,EAAC,CAAC;EACrH,MAAMO,KAAK,GAAGC,QAAQ,CAAC,CAAC;EACxB,MAAMC,iBAAiB,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;EAErD,IAAI,IAAAhC,iCAAkB,EAAC8B,KAAK,CAAC,EAAE;IAC7B,MAAMG,SAAS,GAAGhC,MAAM,CAAC6B,KAAK,CAAC,CAC5B5B,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpBgC,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;;IAET;IACA,MAAME,aAAa,GAAGJ,iBAAiB,CAACK,IAAI,CAACC,IAAI,IAAIL,SAAS,CAACM,WAAW,CAAC,CAAC,CAACC,UAAU,CAACF,IAAI,CAAC,CAAC;IAC9F;IACA;IACA,IAAIL,SAAS,CAAC3D,MAAM,IAAI2C,eAAe,IAAI,CAACM,UAAU,EAAE;MACtD,OAAO,CAAE,aAAYa,aAAa,GAAG,EAAE,GAAG,GAAI,GAAEH,SAAU,IAAG,CAAC;IAChE;IACA,MAAMQ,cAAc,GAAGR,SAAS,CAAC3D,MAAM,IAAI,CAAC;;IAE5C;IACA,MAAMoE,KAAK,GAAI,aAAYN,aAAa,IAAI,CAACK,cAAc,GAAG,EAAE,GAAG,GAAI,GAAER,SAAU,GAAEQ,cAAc,GAAG,GAAG,GAAG,EAAG,GAAE;IACjH3E,KAAK,CAAE,UAAS4E,KAAM,EAAC,CAAC;IACxB,MAAMC,mBAAmB,GAAGpB,UAAU,GAAG,CAAC,GAAGC,gBAAgB,EAAEkB,KAAK,CAAC,GAAGlB,gBAAgB;IAExF,OAAOoB,kBAAkB,CAAC;MAACF,KAAK;MAAED,cAAc;MAAErB,OAAO;MAAEG,UAAU;MAAEC,gBAAgB,EAAEmB;IAAmB,CAAC,CAAC;EAChH;EAEA,OAAO,EAAE;EAET,SAASC,kBAAkBA,CAAC;IAACF,KAAK;IAAED,cAAc,GAAG,KAAK;IAAErB,OAAO,GAAG,KAAK;IAAEG,UAAU,GAAG,KAAK;IAAEC,gBAAgB,GAAG;EAAE,CAAC,EAAE;IACvH1D,KAAK,CAAC,oBAAoB,CAAC;IAC3B,MAAM,CAAC+E,WAAW,CAAC,GAAGC,UAAU,CAAC7E,MAAM,CAAC;IACxC,IAAI4E,WAAW,KAAKE,SAAS,EAAE;MAC7B,IAAI3B,OAAO,EAAE;QACX,MAAMuB,mBAAmB,GAAGpB,UAAU,GAAG,CAAC,GAAGC,gBAAgB,EAAG,GAAEqB,WAAY,QAAOH,KAAM,EAAC,CAAC,GAAGlB,gBAAgB;QAChH,OAAOwB,eAAe,CAAC;UAACN,KAAK,EAAG,GAAEG,WAAY,QAAOH,KAAM,EAAC;UAAED,cAAc,EAAE,IAAI;UAAElB,UAAU;UAAEC,gBAAgB,EAAEmB;QAAmB,CAAC,CAAC;MACzI;MACA,OAAOpB,UAAU,GAAGC,gBAAgB,GAAG,CAAE,GAAEqB,WAAY,QAAOH,KAAM,EAAC,CAAC;IACxE;IACA,OAAOO,oBAAoB,CAAC;MAACP,KAAK;MAAED,cAAc;MAAErB,OAAO;MAAEG,UAAU;MAAEC;IAAgB,CAAC,CAAC;IAC3F;EACF;EAEA,SAASyB,oBAAoBA,CAAC;IAACP,KAAK;IAAED,cAAc,GAAG,KAAK;IAAErB,OAAO,GAAG,KAAK;IAAEG,UAAU,GAAG,KAAK;IAAEC,gBAAgB,GAAG;EAAE,CAAC,EAAE;IACzH,MAAM,CAAC0B,cAAc,CAAC,GAAGC,aAAa,CAAClF,MAAM,CAAC;IAC9C,IAAIiF,cAAc,KAAKH,SAAS,EAAE;MAChC,IAAI3B,OAAO,EAAE;QACX,MAAMuB,mBAAmB,GAAGpB,UAAU,GAAG,CAAC,GAAGC,gBAAgB,EAAG,GAAE0B,cAAe,QAAOR,KAAM,EAAC,CAAC,GAAGlB,gBAAgB;QACnH,OAAOwB,eAAe,CAAC;UAACN,KAAK,EAAG,GAAEQ,cAAe,QAAOR,KAAM,EAAC;UAAED,cAAc,EAAE,IAAI;UAAElB,UAAU;UAAEC,gBAAgB,EAAEmB;QAAmB,CAAC,CAAC;MAC5I;MACA,OAAOpB,UAAU,GAAGC,gBAAgB,GAAG,CAAE,GAAE0B,cAAe,QAAOR,KAAM,EAAC,CAAC;IAC3E;IACA,IAAID,cAAc,IAAI,CAACrB,OAAO,EAAE;MAC9B,OAAOG,UAAU,GAAGC,gBAAgB,GAAG,CAAE,GAAEkB,KAAM,EAAC,CAAC;IACrD;IACA,OAAOM,eAAe,CAAC;MAACN,KAAK;MAAED,cAAc;MAAElB,UAAU;MAAEC;IAAgB,CAAC,CAAC;EAC/E;EAEA,SAASwB,eAAeA,CAAC;IAACN,KAAK;IAAED,cAAc,GAAG,KAAK;IAAElB,UAAU,GAAG,KAAK;IAAEC,gBAAgB,GAAG;EAAE,CAAC,EAAE;IACnG,MAAM,CAAC4B,SAAS,CAAC,GAAGC,OAAO,CAACpF,MAAM,CAAC;IACnC,IAAImF,SAAS,KAAKL,SAAS,EAAE;MAC3B,MAAMJ,mBAAmB,GAAGpB,UAAU,GAAG,CAAC,GAAGC,gBAAgB,EAAG,GAAE4B,SAAU,QAAOV,KAAM,EAAC,CAAC,GAAGlB,gBAAgB;MAC9G,OAAOD,UAAU,GAAGoB,mBAAmB,GAAG,CAAE,GAAES,SAAU,QAAOV,KAAM,EAAC,CAAC;IACzE;IACA,IAAID,cAAc,EAAE;MAClB,OAAOlB,UAAU,GAAGC,gBAAgB,GAAG,CAAE,GAAEkB,KAAM,EAAC,CAAC;IACrD;IACA,OAAO,EAAE;EACX;EAEA,SAASX,QAAQA,CAAA,EAAG;IAClB,MAAM,CAAC7C,KAAK,CAAC,GAAGjB,MAAM,CAACI,GAAG,CAAC,QAAQ,CAAC;IAEpC,IAAIa,KAAK,EAAE;MACT,MAAMoE,WAAW,GAAGpE,KAAK,CAACyB;MACxB;MAAA,CACC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC0C,QAAQ,CAAC1C,IAAI,CAAC;MAC7C;MAAA,CACC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC8C,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOF,WAAW;IACpB;IACA,OAAO,KAAK;EACd;AACF;AAEO,SAASR,UAAUA,CAAC7E,MAAM,EAAE;EACjC,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,qEAAqE,CAAC;EACtG,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,qCAAoC,CAAC;EAC5C;;EAEA,MAAM2F,MAAM,GAAGC,SAAS,CAACzF,MAAM,CAAC;EAChC,MAAM+D,iBAAiB,GAAG,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC;EAGrD,IAAI,IAAAhC,iCAAkB,EAACyD,MAAM,CAAC,EAAE;IAC9B,MAAMxB,SAAS,GAAGhC,MAAM,CAACwD,MAAM,CAAC,CAC7BvD,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpBgC,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;;IAET;IACA,MAAME,aAAa,GAAGJ,iBAAiB,CAACK,IAAI,CAACC,IAAI,IAAIL,SAAS,CAACM,WAAW,CAAC,CAAC,CAACC,UAAU,CAACF,IAAI,CAAC,CAAC;IAC9F;IACApE,SAAS,CAAE,kBAAiB+D,SAAU,EAAC,CAAC;IACxC,IAAIA,SAAS,CAAC3D,MAAM,IAAI,CAAC,EAAE;MACzB,OAAO,CAAE,cAAa8D,aAAa,GAAG,EAAE,GAAG,GAAI,GAAEH,SAAU,IAAG,CAAC;IACjE;IACA,OAAO,EAAE;EACX;EAEA,OAAO,EAAE;EAET,SAASyB,SAASA,CAACzF,MAAM,EAAE;IACzB;IACA;IACA,MAAM,CAACiB,KAAK,CAAC,GAAGjB,MAAM,CAACI,GAAG,CAAC,wCAAwC,CAAC;IACpE;;IAEA,IAAIa,KAAK,EAAE;MACT,MAAMyE,YAAY,GAAGzE,KAAK,CAACyB,SAAS,CACjC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC0C,QAAQ,CAAC1C,IAAI,CAAC,CAAC,CACxC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC8C,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOG,YAAY;IACrB;IACA,OAAO,KAAK;EACd;AACF;AAEO,SAASR,aAAaA,CAAClF,MAAM,EAAE;EACpC,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,wEAAwE,CAAC;EACzG,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,wCAAuC,CAAC;EAC/C;;EAEA,MAAM8F,SAAS,GAAGC,YAAY,CAAC5F,MAAM,CAAC;EACtC,IAAI,IAAA+B,iCAAkB,EAAC4D,SAAS,CAAC,EAAE;IACjC,MAAM3B,SAAS,GAAGhC,MAAM,CAAC2D,SAAS,CAAC,CAChC1D,OAAO,CAAC,yBAAyB,EAAE,EAAE;IACtC;IAAA,CACCA,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CACpBgC,IAAI,CAAC,CAAC,CACNC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CACZD,IAAI,CAAC,CAAC;IAEThE,SAAS,CAAE,qBAAoB+D,SAAU,EAAC,CAAC;IAC3C;IACA,OAAO,CAAE,iBAAgBA,SAAU,GAAE,CAAC;EACxC;EAEA,OAAO,EAAE;EAET,SAAS4B,YAAYA,CAAC5F,MAAM,EAAE;IAC5B;IACA,MAAM,CAACiB,KAAK,CAAC,GAAGjB,MAAM,CAACI,GAAG,CAAC,oBAAoB,CAAC;IAChD;;IAEA,IAAIa,KAAK,EAAE;MACT,MAAM4E,eAAe,GAAG5E,KAAK,CAACyB,SAAS,CACpC3B,MAAM,CAAC,CAAC;QAAC6B;MAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC0C,QAAQ,CAAC1C,IAAI,CAAC,CAAC,CACxC/B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAK,IAAAV,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,GAAG,EAAE,CAAC,CAChE1B,MAAM,CAAC0B,KAAK,IAAIA,KAAK;MACtB;MAAA,CACC8C,IAAI,CAAC,GAAG,CAAC;MACZ,OAAOM,eAAe;IACxB;IACA,OAAO,KAAK;EACd;AACF;AAEO,SAAST,OAAOA,CAACpF,MAAM,EAAE;EAC9B,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,kEAAkE,CAAC;EACnG,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,wCAAuC,CAAC;EAC/CI,SAAS,CAACD,MAAM,CAAC;EAEjB,MAAM8F,IAAI,GAAGC,OAAO,CAAC/F,MAAM,CAAC;EAC5B,IAAI8F,IAAI,EAAE;IACR,OAAO,CAAE,YAAWA,IAAK,GAAE,CAAC;EAC9B;EACA,OAAO,EAAE;EAET,SAASC,OAAOA,CAAC/F,MAAM,EAAE;IACvB,MAAMyC,KAAK,GAAGzC,MAAM,CAACI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAEqC,KAAK,IAAIqC,SAAS;IAC3D,OAAO,IAAA/C,iCAAkB,EAACU,KAAK,CAAC,GAAGT,MAAM,CAACS,KAAK,CAAC,CAACyB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAGY,SAAS;EAC3E;AACF;AAGO,SAASkB,sBAAsBA,CAAChG,MAAM,EAAE;EAE7C,MAAMH,KAAK,GAAG,IAAAC,cAAiB,EAAC,iFAAiF,CAAC;EAClH,MAAMG,SAAS,GAAGJ,KAAK,CAACK,MAAM,CAAC,MAAM,CAAC;EACtCL,KAAK,CAAE,2CAA0C,CAAC;;EAElD;;EAEA,MAAMoG,MAAM,GAAGjG,MAAM,CAACI,GAAG,CAAC,wBAAwB,CAAC;EACnD,MAAM8F,WAAW,GAAG,EAAE,CAACvE,MAAM,CAAC,GAAGsE,MAAM,CAACpF,GAAG,CAACsF,aAAa,CAAC,CAAC;EAC3D,MAAMC,iBAAiB,GAAG,CAAC,GAAG,IAAIC,GAAG,CAACH,WAAW,CAAC,CAAC;EAEnDjG,SAAS,CAAE,+BAA8BK,IAAI,CAACC,SAAS,CAAC0F,MAAM,CAAE,EAAC,CAAC;EAClEhG,SAAS,CAAE,gBAAeiG,WAAW,CAAC7F,MAAO,MAAKC,IAAI,CAACC,SAAS,CAAC2F,WAAW,CAAE,EAAC,CAAC;EAChFjG,SAAS,CAAE,uBAAsBmG,iBAAiB,CAAC/F,MAAO,MAAKC,IAAI,CAACC,SAAS,CAAC6F,iBAAiB,CAAE,EAAC,CAAC;EAEnG,IAAIA,iBAAiB,CAAC/F,MAAM,GAAG,CAAC,EAAE;IAChCR,KAAK,CAAE,2CAA0C,CAAC;IAClD,OAAO,EAAE;EACX;EAEA,OAAO,IAAAe,+BAAS,EAACwF,iBAAiB,EAAE,eAAe,CAAC;EAEpD,SAASD,aAAaA,CAAC;IAACG,GAAG;IAAE5D;EAAS,CAAC,EAAE;IACvC,MAAM6D,cAAc,GAAI,kBAAmB;IAC3C,MAAMC,aAAa,GAAI,mBAAoB;IAE3C,IAAIF,GAAG,KAAK,KAAK,EAAE;MACjB,OAAO5D,SAAS,CACb3B,MAAM,CAAC0F,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAACnB,QAAQ,CAACmB,GAAG,CAAC7D,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAAC0E,GAAG,CAAChE,KAAK,CAAC,IAAI8D,cAAc,CAAC1D,IAAI,CAACb,MAAM,CAACyE,GAAG,CAAChE,KAAK,CAAC,CAAC,CAAC,CAC5H5B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;IACpC;IAEA,IAAI6D,GAAG,KAAK,KAAK,EAAE;MACjB,OAAO5D,SAAS,CACb3B,MAAM,CAAC0F,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAACnB,QAAQ,CAACmB,GAAG,CAAC7D,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAAC0E,GAAG,CAAChE,KAAK,CAAC,IAAI8D,cAAc,CAAC1D,IAAI,CAACb,MAAM,CAACyE,GAAG,CAAChE,KAAK,CAAC,CAAC,CAAC,CACvH5B,GAAG,CAAC,CAAC;QAAC4B;MAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;IACpC;IAEA,OAAOC,SAAS,CACb3B,MAAM,CAAC0F,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAACnB,QAAQ,CAACmB,GAAG,CAAC7D,IAAI,CAAC,IAAI,IAAAb,iCAAkB,EAAC0E,GAAG,CAAChE,KAAK,CAAC,IAAI+D,aAAa,CAAC3D,IAAI,CAACb,MAAM,CAACyE,GAAG,CAAChE,KAAK,CAAC,CAAC,CAAC,CACtH5B,GAAG,CAAC,CAAC;MAAC4B;IAAK,CAAC,KAAKT,MAAM,CAACS,KAAK,CAAC,CAAC;EACpC;AACF"}

package/dist/index.js

@@ -63,14 +63,17 @@ var _default = ({
   debugData(`ReturnNonMatches: ${JSON.stringify(returnNonMatches)}`);
   debugData(`ReturnFailures: ${JSON.stringify(returnFailures)}`);
   const detect = (0, _matchDetection.default)(detectionOptions, returnStrategy);
-  return ({
+  return prepareSearch;
+  async function prepareSearch({
     record,
     recordExternal = {
       recordSource: 'incomingRecord',
       label: 'ic'
     }
-  }) => {
-    const search = (0, _candidateSearch.default)({
+  }) {
+    const {
+      search
+    } = await (0, _candidateSearch.default)({
       ...searchOptions,
       record,
       maxCandidates,
@@ -573,7 +576,7 @@ var _default = ({
         return true;
       }
     }
-  };
+  }
 };
 exports.default = _default;
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"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,"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","prepareSearch","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 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, 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,OAAOY,aAAa;EAEpB,eAAeA,aAAaA,CAAC;IAACC,MAAM;IAAEC,cAAc,GAAG;MAACC,YAAY,EAAE,gBAAgB;MAAEC,KAAK,EAAE;IAAI;EAAC,CAAC,EAAE;IAErG,MAAM;MAACpB;IAAM,CAAC,GAAG,MAAM,IAAAqB,wBAAqB,EAAC;MAAC,GAAGpB,aAAa;MAAEgB,MAAM;MAAEd,aAAa;MAAEe;IAAc,CAAC,CAAC;IACvG,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/KpB,SAAS,CAAE,kCAAiC,CAAC;MAC7C,MAAM;QAACqB,OAAO;QAAEC,QAAQ;QAAE,GAAGC;MAAK,CAAC,GAAG,MAAMjC,MAAM,CAACuB,YAAY,CAAC;MAEhEb,SAAS,CAAE,kBAAiBE,IAAI,CAACC,SAAS,CAACoB,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;MACjEtB,SAAS,CAAE,aAAYsB,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;QACzBjC,KAAK,CAAE,oBAAmByB,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;MAEAtB,KAAK,CAAE,wEAAuEgB,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;QACzBhC,KAAK,CAAE,0BAAyB2B,aAAc,qDAAoDF,KAAK,CAACS,aAAc,eAAcT,KAAK,CAACU,KAAM,EAAC,CAAC;QAElJ,MAAMG,WAAW,GAAGC,cAAc,CAAC;UAAChB,OAAO;UAAEI,aAAa;UAAEjC,UAAU;UAAEsB,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;UAAEhD;QAAU,CAAC,CAAC,EAAE;UACtD,OAAO0C,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,EAAElC,aAAa,CAAC,EAAE;UAC5D,OAAOyC,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;QACxEpB,SAAS,CAAE,4CAA2CoC,WAAW,CAACtB,OAAO,CAACU,MAAO,EAAC,CAAC;QACnF;QACA,IAAI5B,gBAAgB,EAAE;UACpBI,SAAS,CAAE,+CAA8CoC,WAAW,CAACpB,UAAU,CAACQ,MAAO,EAAC,CAAC;QAC3F;QAEA,MAAMgB,UAAU,GAAG1B,OAAO,CAACe,MAAM,CAAClC,WAAW,GAAGmD,QAAQ,CAACV,WAAW,CAACtB,OAAO,CAAC,GAAGsB,WAAW,CAACtB,OAAO,CAAC;QACpG,MAAM2B,aAAa,GAAG7C,gBAAgB,GAAGoB,UAAU,CAACa,MAAM,CAAClC,WAAW,GAAGmD,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;QAElEpB,SAAS,CAAE,8BAA6BwC,UAAU,CAAChB,MAAO,EAAC,CAAC;QAC5D;QACA,IAAI5B,gBAAgB,EAAE;UACpBI,SAAS,CAAE,iCAAgCyC,aAAa,CAACjB,MAAO,EAAC,CAAC;QACpE;QAEAxB,SAAS,CAAE,gBAAeE,IAAI,CAACC,SAAS,CAACiC,WAAW,CAAE,EAAC,CAAC;QACxDpC,SAAS,CAAE,oBAAmBE,IAAI,CAACC,SAAS,CAACiB,WAAW,CAAE,mCAAkClB,IAAI,CAACC,SAAS,CAACiC,WAAW,CAAChB,WAAW,CAAE,sBAAqBlB,IAAI,CAACC,SAAS,CAACuC,cAAc,CAAE,EAAC,CAAC;QAE1L1C,SAAS,CAAE,kCAAiC0C,cAAc,CAAClB,MAAO,EAAC,CAAC;QAEpE,OAAO;UAACgB,UAAU;UAAEC,aAAa;UAAEC;QAAc,CAAC;MACpD;MAEA,SAASI,QAAQA,CAAChC,OAAO,EAAE;QACzBd,SAAS,CAAE,gBAAeuB,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,EAAEtB,aAAa,EAAE;QAC7DO,SAAS,CAAE,gDAA+C2B,iBAAkB,UAASlC,aAAc,GAAE,CAAC;QACtG,IAAIA,aAAa,IAAIsB,cAAc,IAAItB,aAAa,EAAE;UACpDK,KAAK,CAAE,gEAA+DiB,cAAe,MAAKtB,aAAc,sBAAqB,CAAC;UAC9H,OAAO,IAAI;QACb;MACF;IACF;;IAEA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IACA;;IAEA;;IAEA;IACA;IACA;IACA;;IAEA,SAASyC,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,GAAG3D,gBAAgB,GAAG;QAACkB,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,GAAG3D,cAAc,GAAG;QAAC,GAAG0D,aAAa;QAAEpC,kBAAkB,EAAEG;MAAQ,CAAC,GAAGiC,aAAa;MAChGvD,SAAS,CAAE,kBAAiBH,cAAe,EAAC,CAAC;MAC7CG,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAS,CAACqD,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;QACjCxB,SAAS,CAAE,sBAAqBJ,gBAAiB,EAAC,CAAC;QACnD,MAAM8D,mBAAmB,GAAG9D,gBAAgB,GAAGoB,UAAU,CAACQ,MAAM,GAAGN,aAAa;QAChF,MAAMyC,YAAY,GAAGF,UAAU,GAAGC,mBAAmB,GAAGzC,cAAc;QACtEnB,KAAK,CAAE,mBAAkBiB,cAAe,cAAa0C,UAAW,iBAAgBC,mBAAoB,qBAAoBzC,cAAe,6BAA4BiC,sBAAuB,sBAAqBC,eAAgB,EAAC,CAAC;QACjOrD,KAAK,CAAE,qBAAoB6D,YAAa,MAAK5C,cAAe,uBAAsB,CAAC;QACnF,IAAI4C,YAAY,KAAK5C,cAAc,EAAE;UACnCjB,KAAK,CAAE,gCAA+BiB,cAAc,GAAG4C,YAAa,aAAY,CAAC;UACjF;QACF;QACA;MACF;;MAEA;MACA,SAASL,aAAaA,CAAC/B,KAAK,EAAEY,UAAU,EAAEyB,uBAAuB,EAAET,eAAe,EAAE;QAClFnD,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAS,CAACoB,KAAK,CAAE,EAAC,CAAC;QACrCzB,KAAK,CAAE,UAAS8D,uBAAwB,oDAAmD,CAAC;QAC5F9D,KAAK,CAAE,UAASqD,eAAgB,uDAAsD,CAAC;QACvFrD,KAAK,CAAE,gBAAeyB,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;QAEpShE,SAAS,CAAE,gBAAemC,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;QACxF/D,SAAS,CAAE,iBAAgBkE,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;UAClKnC,SAAS,CAAE,4BAA2BmE,sBAAuB,GAAE,CAAC;UAChEnE,SAAS,CAAE,gCAA+BqE,4BAA6B,GAAE,CAAC;UAC1ErE,SAAS,CAAE,0BAAyBsE,qBAAsB,GAAE,CAAC;UAC7DtE,SAAS,CAAE,mBAAkBuE,aAAc,GAAE,CAAC;UAC9CzE,KAAK,CAAE,qBAAoB,CAAC;UAC5B,OAAO;YAAC0E,MAAM,EAAE,KAAK;YAAErC,UAAU,EAAEoC;UAAa,CAAC;QACnD;QAEAzE,KAAK,CAAE,oBAAmB,CAAC;QAC3B,OAAO;UAAC0E,MAAM,EAAE,IAAI;UAAErC;QAAU,CAAC;MACnC;IACF;;IAEA;IACA;IACA;IACA;;IAEA,SAASE,cAAcA,CAAC;MAAChB,OAAO;MAAEI,aAAa;MAAEjC,UAAU;MAAEsB,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;YACFrF,KAAK,CAAE,qCAAoCsF,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,GAAE,CAAC;YAC9F;YACA,MAAM6D,eAAe,GAAGlF,MAAM,CAAC;cAACmF,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;YACd7F,KAAK,CAAE,2CAA0CsF,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;cAAEjC,UAAU;cAAEsB,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;UAAEjC,UAAU;UAAEsB,OAAO;UAAE2D,aAAa;UAAEE,WAAW,EAAEK,cAAc;UAAEN,gBAAgB;UAAEE,oBAAoB,EAAEA,oBAAoB,GAAG,CAAC;UAAEC,mBAAmB;UAAEC;QAAiB,CAAC,CAAC;MAC9O;MAEAhF,KAAK,CAAE,mCAAkC6E,WAAY,IAAGlD,aAAc,WAAUgD,aAAa,CAACjD,MAAO,mBAAkBoD,oBAAqB,gCAA+BhF,gBAAgB,GAAI,GAAE8E,gBAAgB,CAAClD,MAAO,EAAC,GAAI,GAAEqD,mBAAoB,EAAE,oBAAmB,CAAC;MAC1Q,OAAO;QAAC/D,OAAO,EAAE2D,aAAa;QAAEzD,UAAU,EAAEpB,gBAAgB,GAAG8E,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;QAC5ElF,SAAS,CAAE,8BAA6BoF,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,MAAKvB,IAAI,CAACC,SAAS,CAACmF,eAAe,CAAE,EAAC,CAAC;QAE/H,IAAIA,eAAe,CAACtC,KAAK,IAAIpD,gBAAgB,EAAE;UAC7CE,KAAK,CAAE,GAAEwF,eAAe,CAACtC,KAAK,GAAI,UAASoC,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,eAAc,GAAI,UAAS2D,WAAY,KAAIJ,cAAe,IAAGvD,aAAc,mBAAmB,EAAC,CAAC;UAC3LzB,SAAS,CAAE,aAAYE,IAAI,CAACC,SAAS,CAACmF,eAAe,CAACW,QAAQ,CAAE,eAAc/F,IAAI,CAACC,SAAS,CAACmF,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,GAAG3G,cAAc,GAAG;YAAC,GAAG0C,WAAW;YAAE,GAAGgE;UAAc,CAAC,GAAG;YAAC,GAAGhE;UAAW,CAAC;UAExFpC,SAAS,CAAE,GAAEE,IAAI,CAACC,SAAS,CAACkG,QAAQ,CAAE,EAAC,CAAC;UAExC,OAAOC,iBAAiB,CAAChB,eAAe,CAACtC,KAAK,EAAEqD,QAAQ,CAAC;QAC3D;QAEA,MAAME,sBAAsB,GAAG1B,mBAAmB,GAAG,CAAC;QACtD7E,SAAS,CAAE,4CAA2CuG,sBAAuB,EAAC,CAAC;QAE/E,OAAOlE,cAAc,CAAC;UAAChB,OAAO,EAAEA,OAAO,CAAC2E,KAAK,CAAC,CAAC,CAAC;UAAEvE,aAAa;UAAEjC,UAAU;UAAEsB,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;QAEtF7E,SAAS,CAAE,yCAAwCc,OAAO,CAACe,MAAM,CAAC4E,gBAAgB,CAAC,CAACjF,MAAO,UAAShC,UAAW,GAAE,CAAC;;QAElH;QACA,IAAII,gBAAgB,EAAE;UACpBI,SAAS,CAAE,4CAA2CgB,UAAU,CAACa,MAAM,CAAC6E,mBAAmB,CAAC,CAAClF,MAAO,EAAC,CAAC;QACxG;QACAxB,SAAS,CAAE,+CAA8C6E,mBAAoB,EAAC,CAAC;QAE/E,IAAIjC,eAAe,CAAC;UAAC9B,OAAO,EAAEA,OAAO,CAACe,MAAM,CAAC4E,gBAAgB,CAAC;UAAEjH;QAAU,CAAC,CAAC,EAAE;UAC5EM,KAAK,CAAE,eAAcN,UAAW,gDAA+CwF,cAAe,yCAAwCvD,aAAa,GAAGuD,cAAe,EAAC,CAAC;UACvK,OAAO;YAAClE,OAAO,EAAE2F,gBAAgB;YAAEzF,UAAU,EAAEpB,gBAAgB,GAAG8G,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;UAAEjC,UAAU;UAAEsB,OAAO;UAAE2D,aAAa,EAAEgC,gBAAgB;UAAE9B,WAAW,EAAEK,cAAc;UAAEN,gBAAgB,EAAE9E,gBAAgB,GAAG8G,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;QACjDjF,KAAK,CAAE,wBAAuBiF,SAAS,CAACI,EAAG,+BAA8BrE,OAAO,CAACU,MAAO,qBAAoB,CAAC;QAC7G,MAAMmF,cAAc,GAAG5B,SAAS,CAACI,EAAE;QACnCnF,SAAS,CAAE,mBAAkB2G,cAAe,EAAC,CAAC;QAC9C,MAAMnD,MAAM,GAAG1C,OAAO,CAAC8F,IAAI,CAAC,CAAC;UAAC7B;QAAS,CAAC,KAAKA,SAAS,CAACI,EAAE,KAAKwB,cAAc,CAAC;QAC7E3G,SAAS,CAAE,WAAUwD,MAAO,EAAC,CAAC;QAC9B,IAAIA,MAAM,EAAE;UACV1D,KAAK,CAAE,GAAEiF,SAAS,CAACI,EAAG,uBAAsB,CAAC;UAC7C,OAAO,KAAK;QACd;QACArF,KAAK,CAAE,GAAEiF,SAAS,CAACI,EAAG,kCAAiC,CAAC;QACxD,OAAO,IAAI;MACb;IACF;IAEA,SAASvC,eAAeA,CAAC;MAAC9B,OAAO;MAAEtB;IAAU,CAAC,EAAE;MAC9C,IAAIA,UAAU,IAAIsB,OAAO,CAACU,MAAM,IAAIhC,UAAU,EAAE;QAC9CM,KAAK,CAAE,6CAA4CN,UAAW,0BAAyB,CAAC;QACxF,OAAO,IAAI;MACb;IACF;EACF;AACF,CAAC;AAAA9B,OAAA,CAAAS,OAAA,GAAAgB,QAAA"}

package/package.json

@@ -14,7 +14,7 @@
 		"url": "git@github.com:natlibfi/melinda-record-matching-js.git"
 	},
 	"license": "LGPL-3.0+",
-	"version": "4.3.2-alpha.2",
+	"version": "4.3.2-alpha.4",
 	"main": "./dist/index.js",
 	"engines": {
 		"node": ">=18"

package/src/candidate-search/choose-queries.js

@@ -0,0 +1,123 @@
+/**
+*
+* @licstart  The following is the entire license notice for the JavaScript code in this file.
+*
+* Melinda record matching modules for Javascript
+*
+* Copyright (C) 2023 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.
+*
+*/
+
+import createDebugLogger from 'debug';
+import createClient, {SruSearchError} from '@natlibfi/sru-client';
+
+export class CandidateSearchError extends Error {}
+
+export default async function ({url, queryList, queryListType, maxCandidates = 50}) {
+
+  const debug = createDebugLogger('@natlibfi/melinda-record-matching:candidate-search:choose-queries');
+  const debugData = debug.extend('data');
+  const debugDev = debug.extend('dev');
+
+  debugData(`Url: ${url}`);
+  debugData(`QueryList: ${queryList}`);
+  debugData(`queryListType: ${queryListType}`);
+
+  const client = createClient({
+    url,
+    maxRecordsPerRequest: 0,
+    version: '2.0',
+    retrieveAll: false
+  });
+
+  debugDev(`QueryList (type: ${queryListType}) ${JSON.stringify(queryList)}`);
+  try {
+    const {queriesWithTotals} = await getQueryTotals({queryList, queryOffset: 0, queriesWithTotals: []});
+    debugDev(`QueryResult: ${JSON.stringify(queriesWithTotals)}`);
+    const filteredQueryResult = filterQueryResult({queriesWithTotals, maxCandidates});
+    debugDev(`filteredQueryResult: ${JSON.stringify(filteredQueryResult)}`);
+    return filteredQueryResult;
+  } catch (err) {
+    throw new CandidateSearchError(err);
+  }
+
+  async function getQueryTotals({queryList, queryOffset = 0, queriesWithTotals = []}) {
+
+    const query = queryList[queryOffset];
+    debug(`Running query ${JSON.stringify(query)} (${queryOffset}) for total`);
+
+    if (query) {
+      const {total} = await retrieveTotal();
+
+      const newQueriesWithTotals = [...queriesWithTotals, {query, total}];
+      debug(`Query ${queryOffset} ${query} done.`);
+      debug(`There are (${queryList.length - (queryOffset + 1)} queries left)`);
+      return getQueryTotals({queryList, queryOffset: queryOffset + 1, queriesWithTotals: newQueriesWithTotals});
+    }
+
+    debug(`All ${queryList.length} queries done, there's no query for ${queryOffset}`);
+    return {queriesWithTotals};
+
+    function retrieveTotal() {
+      return new Promise((resolve, reject) => {
+        // eslint-disable-next-line functional/no-let
+        let totalRecords = 0;
+
+        debug(`Searching total amount of candidates for query: ${query}`);
+
+        client.searchRetrieve(query)
+          .on('error', err => {
+            // eslint-disable-next-line functional/no-conditional-statements
+            if (err instanceof SruSearchError) {
+              debug(`SRU SruSearchError for query: ${query}: ${err}`);
+              reject(new CandidateSearchError(`SRU SruSearchError for query: ${query}: ${err}`));
+            }
+            debug(`SRU error for query: ${query}: ${err}`);
+            reject(new CandidateSearchError(`SRU error for query: ${query}: ${err}`));
+          })
+          .on('total', total => {
+            debug(`Got total: ${total}`);
+            totalRecords += total;
+          })
+          .on('end', () => {
+            try {
+              resolve({total: totalRecords});
+            } catch (err) {
+              debug(`Error caught on END`);
+              reject(err);
+            }
+          })
+          .on('record', () => {
+            debugDev(`RECORD: We should no get records here`);
+          });
+      });
+    }
+  }
+  function filterQueryResult({queriesWithTotals, maxCandidates}) {
+    debug(`Filtering queries (${queriesWithTotals.length}), maxCandidates: ${maxCandidates}`);
+    debugData(`${JSON.stringify(queriesWithTotals)}`);
+    // Drop queries where total result is 0 or greater than given maxCandidates
+    const filteredQueryResult = queriesWithTotals.filter((queryWithTotal) => queryWithTotal.total !== 0 && queryWithTotal.total < maxCandidates);
+    debugData(`${JSON.stringify(filteredQueryResult)}`);
+    return filteredQueryResult;
+  }
+
+}