@natlibfi/marc-record-validators-melinda 12.0.0-alpha.4 → 12.0.0-alpha.6

package/dist/removeInferiorDataFields.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/removeInferiorDataFields.js"],
-  "sourcesContent": ["import createDebugLogger from 'debug';\nimport {fieldToChain, sameField} from './removeDuplicateDataFields.js';\nimport {fieldGetOccurrenceNumberPairs, fieldHasValidSubfield6, fieldSevenToOneOccurrenceNumber, fieldsToNormalizedString} from './subfield6Utils.js';\nimport {fieldHasSubfield, fieldsToString, fieldToString, nvdebug, uniqArray} from './utils.js';\nimport {fieldHasValidSubfield8} from './subfield8Utils.js';\nimport {encodingLevelIsBetterThanPrepublication, fieldRefersToKoneellisestiTuotettuTietue, getEncodingLevel} from './prepublicationUtils.js';\nimport {cloneAndNormalizeFieldForComparison} from './normalizeFieldForComparison.js';\nimport {fixComposition, precomposeFinnishLetters} from './normalize-utf8-diacritics.js';\n\n// Relocated from melinda-marc-record-merge-reducers (and renamed)\n\n// NB! This validator handles only full fields, and does not support subfield $8 removal.\n// Also, having multiple $8 subfields in same fields is not supported.\n// If this functionality is needed, see removeDuplicateDatafields.js for examples of subfield-only stuff.\nconst debug = createDebugLogger('@natlibfi/marc-record-validators-melinda:removeInferiorDataFields');\n\nexport default function () {\n  return {\n    description: 'Remove subset data fields. Certain exceptions apply, mainly too complicated for chained fields',\n    validate, fix\n  };\n\n  function fix(record) {\n    nvdebug('Fix record: remove inferior (eg. subset) data fields', debug);\n    const res = {message: [], fix: [], valid: true};\n    removeInferiorDatafields(record, true);\n    // This can not really fail...\n    return res;\n  }\n\n  function validate(record) {\n    // Check max, and check number of different indexes\n    nvdebug('Validate record: remove inferior (eg. subset) data fields', debug);\n\n    const duplicates = removeInferiorDatafields(record, false);\n\n    const res = {message: duplicates};\n\n    res.valid = res.message.length < 1;\n    return res;\n  }\n}\n\n\nfunction deriveInferiorChains(fields, record) {\n  //nvdebug(`======= GOT ${fields.length} FIELDS TO CHAINIFY`);\n  const hash = {};\n\n  fields.forEach(f => fieldToChainToDeletables(f));\n\n  return hash;\n\n  //nvdebug(`WP1: GOT ${todoList.length} CHAINS`);\n\n\n  // here we map deletableStringObject[str] => field. The idea is to help debugging. We don't actually need the field object...\n  //return deriveChainDeletables(todoList);\n\n  function fieldToChainToDeletables(field) {\n    const chain = fieldToChain(field, record);\n    if (chain.length < 2) {\n      return;\n    }\n    const chainAsString = fieldsToNormalizedString(chain, 0, true, true);\n    const arr = deriveChainDeletables([chainAsString]);\n    //nvdebug(`GOT ${arr.length} DELETABLES FOR ${chainAsString}`);\n    arr.forEach(val => {\n      if (!(val in hash)) {\n        hash[val] = field;\n      }\n    });\n  }\n\n  function deriveChainDeletables(todoList, deletables = []) {\n    const [chainAsString, ...stillToDo] = todoList;\n    if (chainAsString === undefined) {\n      return deletables;\n    }\n\n    // Fix MRA-476 (part 1): one $6 value can be worse than the other\n    const withoutScriptIdentificationCode = chainAsString.replace(/( \u20216 [0-9X][0-9][0-9]-(?:XX|[0-9]+))\\/[^ ]+/u, '$1');\n\n    // Remove keepless versions:\n    const keepless = chainAsString.replace(/ \u20219 [A-Z]+<KEEP>/u, '');\n\n    // MRA-433: 490 ind1=1 vs ind1=0: remove latter (luckily no 2nd indicator etc)\n    const linked490Ind1 = chainAsString.replace(/^490 1/u, '490 0').replace(/\\t880 1/ug, '\\t880 0');\n    const arr = [withoutScriptIdentificationCode, keepless, linked490Ind1].filter(val => val !== chainAsString);\n    if (arr.length > 0) {\n      return deriveChainDeletables([...stillToDo, ...arr], [...deletables, ...arr]);\n    }\n\n    return deriveChainDeletables(stillToDo, deletables);\n  }\n\n}\n\nfunction isRelevantChain6(field, record) {\n  //Can't be a chain:\n  if (!fieldHasValidSubfield6(field) && !fieldHasValidSubfield8(field)) {\n    return false;\n  }\n  // Too short to be a chain:\n  const chain = fieldToChain(field, record);\n  if (chain.length < 2) {\n    return false;\n  }\n  // No field can contains no more than one subfield $6\n  if (chain.some(f => f.subfields.filter(sf => sf.code === '6').length > 1)) {\n    return false;\n  }\n\n  // Check whether our field is the head of a chain:\n  return sameField(field, chain[0]);\n}\n\nexport function removeInferiorChains(record, fix = true) {\n  const fields = record.fields.filter(f => isRelevantChain6(f, record));\n  //nvdebug(`WP2.0: GOT ${fields.length} chain(s)`);\n\n  const deletableChainsAsKeys = deriveInferiorChains(fields, record);\n  const nChains = Object.keys(deletableChainsAsKeys).length;\n  //nvdebug(`WP2: GOT ${nChains} chain(s)`);\n  if (nChains === 0) {\n    return [];\n  }\n\n  //nvdebug(`removeInferiorChains() has ${fields.length} fields-in-chain(s), and a list of ${nChains} deletable(s)`);\n\n  return innerRemoveInferiorChains(fields);\n\n  function innerRemoveInferiorChains(fields, deletedStringsArray = []) {\n    const [currField, ...remainingFields] = fields;\n\n    if (currField === undefined) {\n      return deletedStringsArray;\n    }\n\n    const chain = fieldToChain(currField, record);\n    if (chain.length === 0 || !sameField(currField, chain[0])) {\n      return innerRemoveInferiorChains(remainingFields, deletedStringsArray);\n    }\n\n    const chainAsString = fieldsToNormalizedString(chain, 0, true, true);\n    if (!(chainAsString in deletableChainsAsKeys)) {\n      return innerRemoveInferiorChains(remainingFields, deletedStringsArray);\n    }\n\n    const triggeringField = deletableChainsAsKeys[chainAsString];\n    const triggeringChain = fieldToChain(triggeringField, record);\n\n    // If the inferior (deletable) chain is 1XX-based, convert the triggering better chain from 7XX to 1XX:\n    if (chainContains1XX(chain)) {\n      triggeringChain.forEach(f => sevenToOne(f, triggeringChain));\n    }\n    //nvdebug(`iRIS6C: ${chainAsString}`);\n    const deletedString = fieldsToString(chain);\n    const message = `DEL: '${deletedString}'  REASON: '${fieldsToString(triggeringChain)}'`;\n    if (fix) {\n      //nvdebug(`INFERIOR $6 CHAIN REMOVAL: ${message}}`, debug);\n      chain.forEach(field => record.removeField(field));\n    }\n    return innerRemoveInferiorChains(remainingFields, [...deletedStringsArray, message]);\n  }\n\n  function chainContains1XX(chain) {\n    return chain.some(f => f.tag.substring(0, 1) === '1');\n  }\n\n  function sevenToOne(field, chain) { // Change 7XX field to 1XX field. Also handle the corresponding 880$6 7XX-NN subfields\n    // NB! This function should be called only if the original 1XX gets deleted!\n    if (!['700', '710', '711', '730'].includes(field.tag)) {\n      return;\n    }\n    // Retag field 7XX as 1XX and fix corresponding occurrence numbers as well:\n    const pairs = fieldGetOccurrenceNumberPairs(field, chain);\n    field.tag = `1${field.tag.substring(1)}`;\n    // There should always be one pair, but I'm not sanity-checking this\n    pairs.forEach(pairedField => fieldSevenToOneOccurrenceNumber(pairedField));\n  }\n\n}\n\n\nfunction getIdentifierlessAndKeeplessSubsets(fieldAsString) {\n  // The rules below are not perfect (in complex cases they don't catch all permutations), but good enough:\n  // Remove identifier(s) (MELKEHITYS-2383-ish):\n\n  const identifierlessString = fieldAsString.replace(/ \u2021[01] [^\u2021]+($| \u2021)/u, '$1');\n  const keeplessString = fieldAsString.replace(/ \u20219 [A-Z]+<KEEP>/u, '');\n\n  return [identifierlessString, keeplessString].filter(val => val !== fieldAsString);\n}\n\nfunction deriveIndividualDeletables490(todoList, deletables = []) {\n  const [fieldAsString, ...stillToDo] = todoList;\n  if (fieldAsString === undefined) {\n    return deletables;\n  }\n  //nvdebug(`PROCESS ${fieldAsString}`);\n  if (!fieldAsString.match(/^490/u)) {\n    return deriveIndividualDeletables490(stillToDo, deletables);\n  }\n\n  // $6-less version (keep this first)\n  const sixless = fieldAsString.replace(/ \u20216 [^\u2021]+ \u2021/u, ' \u2021');\n\n  // Without final $v or $x:\n  const withoutFinalVOrX = fieldAsString.replace(/ *[;,] \u2021[vx] [^\u2021]+$/u, '');\n  // Add intermediate $x-less version\n  const xless = fieldAsString.replace(/, \u2021x [^\u2021]+(, \u2021x| ; \u2021v)/u, '$1');\n\n  // Add $xv-less version (handled by recursion?)\n  const xvless = fieldAsString.replace(/, \u2021x [^\u2021]+ \u2021v [^\u2021]+$/u, '');\n\n  // MRA-433-ish (non-chain): 490 ind1=1 vs ind1=0: remove latter\n  const modifiedInd2 = fieldAsString.match(/^490 1/u) ? `490 0${fieldAsString.substring(5)}` : fieldAsString;\n\n  const arr = [sixless, withoutFinalVOrX, xless, xvless, modifiedInd2].filter(val => val !== fieldAsString);\n\n  /*\n  if (arr.length) {\n    nvdebug(`${arr.length} derivation(s) for ${fieldAsString}`);\n    nvdebug(arr.join('\\n'));\n  }\n  */\n  return arr;\n}\n\nfunction deriveIndividualDeletables(record) {\n  const todoList = record.fields.map(f => fieldToString(f));\n  //const finishedRecord = encodingLevelIsBetterThanPrepublication(getEncodingLevel(record));\n\n  const deletableStringsArray = processTodoList(todoList);\n\n  const inferiorTerms = getInferiorTerms(record);\n\n  return uniqArray([...deletableStringsArray, ...inferiorTerms]);\n\n  function getInferiorTerms(record) {\n    const inputFields = record.fields.filter(f => ['648', '650', '651'].includes(f.tag) && f.subfields);\n    const result = inputFields.flatMap(f => fieldToInferiorFields(f));\n\n    // console.log(result.join('\\n')); // eslint-disable-line no-console\n    return result;\n  }\n\n  function fieldToInferiorFields(field) {\n    const aArray = field.subfields.filter(sf => sf.code === 'a');\n    if (field.tag === '650') {\n      return aArray.flatMap(sf => [`653 ## \u2021a ${sf.value}`, `653 #0 \u2021a ${sf.value}`]);\n    }\n    return aArray.map(sf => `653 ## \u2021a ${sf.value}`);\n  }\n\n  function processTodoList(thingsToDo, deletables = []) {\n    const [currString, ...stillToDo] = thingsToDo;\n\n    if (currString === undefined) {\n      return deletables;\n    }\n\n    const accentless = getAccentlessVersion(currString);\n    const d490 = deriveIndividualDeletables490([currString]);\n    const subsets = getIdentifierlessAndKeeplessSubsets(currString);\n    const moreToDo = [...accentless, ...d490, ...subsets];\n\n\n    if (currString.match(/^[1678]00/u)) {\n      // Proof-of-concept rule. Should be improved eventually...\n      if (currString.match(/, \u2021e [^\u2021]+\\.$/u)) {\n        const tmp = currString.replace(/, \u2021e [^\u2021]+\\.$/u, '.');\n        return processTodoList([tmp, ...stillToDo, ...moreToDo], [...deletables, tmp]);\n      }\n    }\n\n    if (currString.match(/^500 ## \u2021a Lis\u00E4painokset: Lis\u00E4painos /u)) { // MET-569\n      const tmp1 = currString.replace(' Lis\u00E4painos ', ' [Lis\u00E4painos] ');\n      const tmp2 = currString.replace(' Lis\u00E4painos ', ' ');\n      if (tmp1 !== currString && tmp2 !== currString) {\n        return processTodoList([...stillToDo, ...moreToDo], [...deletables, tmp1, tmp2]);\n      }\n    }\n\n    if (currString.match(/^500 ## \u2021a Lis\u00E4painokset: \\[Lis\u00E4painos\\] /u)) { // MET-569\n      const tmp = currString.replace(' [Lis\u00E4painos] ', ' ');\n      if (tmp !== currString) {\n        return processTodoList([...stillToDo, ...moreToDo], [...deletables, tmp]);\n      }\n    }\n\n    if (currString.match(/^500 ## \u2021a Ei vastaanotettu\\.$/u)) { // MELKEHITYS-3147\n      return processTodoList([...stillToDo, ...moreToDo], [...deletables, '500 ## \u2021a EI VASTAANOTETTU.']);\n    }\n    if (currString.match(/^500 ## \u2021a Ei ilmesty\\.$/u)) { // MELKEHITYS-3147\n      return processTodoList([...stillToDo, ...moreToDo], [...deletables, '500 ## \u2021a EI ILMESTY.']);\n    }\n\n    if (currString.match(/^505 .0.*-- \u2021t/u)) { // MRA-413-ish\n      const tmp = currString.replace(/ -- \u2021t /gu, ' -- '). // remove non-initial $t subfields\n        replace(/ \u2021[rg] /gu, ' '). // remove $r and $g subfields\n        replace(/ \u2021t /u, ' \u2021a '). // change first $t to $a\n        // ind2: '1' => '#':\n        replace(/^505 (.)0/u, '505 $1#');\n      if (tmp !== currString) {\n        return processTodoList([tmp, ...stillToDo, ...moreToDo], [...deletables, tmp]);\n      }\n      //nvdebug(`505 ORIGINAL: '${fieldAsString}'`)\n      //nvdebug(`505 DERIVATE: '${tmp}'`)\n    }\n\n    if (currString.match(/^594 ## \u2021a Ei vastaanotettu \u20215 FENNI$/u)) { // MELKEHITYS-3147\n      return processTodoList([...stillToDo, ...moreToDo], [...deletables, '594 ## \u2021a EI VASTAANOTETTU \u20215 FENNI']);\n    }\n    if (currString.match(/^594 ## \u2021a Ei ilmesty \u20215 FENNI$/u)) { // MELKEHITYS-3147\n      return processTodoList([...stillToDo, ...moreToDo], [...deletables, '594 ## \u2021a EI ILMESTY \u20215 FENNI']);\n    }\n\n    // MET-381: remove occurence number TAG-00, if TAG-NN existists\n    if (currString.match(/^880.* \u20216 [0-9][0-9][0-9]-(?:[1-9][0-9]|0[1-9])/u)) {\n      const tmp = currString.replace(/( \u20216 [0-9][0-9][0-9])-[0-9]+/u, '$1-00');\n      //nvdebug(`MET-381: ADD TO DELETABLES: '${tmp}'`);\n      //deletableStringsArray.push(tmp);\n      if (tmp.match(/ \u20216 [0-9][0-9][0-9]-00\\/[^ ]+ /u)) {\n        const tmp2 = tmp.replace(/( \u20216 [0-9][0-9][0-9]-00)[^ ]+/u, '$1');\n        //nvdebug(`MET-381: ADD TO DELETABLES: '${tmp2}'`);\n        return processTodoList([...stillToDo, ...moreToDo], [...deletables, tmp, tmp2]);\n      }\n      return processTodoList([...stillToDo, ...moreToDo], [...deletables, tmp]);\n    }\n\n    // MET-575 (merge: applies in postprocessing)\n    const inferiorTerms = getPrepublicationTerms(currString);\n\n    const newDeletables = [...deletables, ...subsets, ...accentless, ...d490, ...inferiorTerms];\n\n    if (subsets.length) {\n      return processTodoList([...stillToDo, ...moreToDo], newDeletables);\n    }\n\n    return processTodoList([...stillToDo, ...moreToDo], newDeletables);\n  }\n\n  function getAccentlessVersion(string) { // MET-527\n    //nvdebug(`START: '${string}`);\n    // This is a sanity check: if precomposition does something, there's something wrong, and we don't want to proceed..\n    if (string !== precomposeFinnishLetters(string)) {\n      return [];\n    }\n    const accentless = String(fixComposition(string)).replace(/\\p{Diacritic}/gu, '');\n    //nvdebug(`FROM '${string}'\\n  TO '${accentless}'`);\n    if (accentless === string) { // Don't self-destruct\n      return [];\n    }\n    return [accentless];\n  }\n\n  function getPrepublicationTerms(fieldAsString) {\n    if (fieldAsString.match(/^653./u)) {\n      // MET-528 (extented by MET-575)\n      return [`${fieldAsString} \u2021g ENNAKKOTIETO`, `${fieldAsString} \u2021g Ennakkotieto`, `${fieldAsString} \u2021g ennakkotieto`, `${fieldAsString} \u2021g ENNAKKOTIETO.`, `${fieldAsString} \u2021g Ennakkotieto.`, `${fieldAsString} \u2021g ennakkotieto.`];\n    }\n\n    return [];\n  }\n\n}\n\nfunction fieldToNormalizedString(field) {\n  const normalizedField = cloneAndNormalizeFieldForComparison(field);\n  return fieldToString(normalizedField);\n}\n\nfunction deriveIndividualNormalizedDeletables(record) { //  MET-461:\n  const encodingLevel = getEncodingLevel(record);\n  const recordIsFinished = encodingLevelIsBetterThanPrepublication(encodingLevel);\n  const met495 = encodingLevel === '2' && record.fields.some(f => f.tag === '500' && fieldRefersToKoneellisestiTuotettuTietue(f));\n  if (!recordIsFinished || met495) {\n    return [];\n  }\n  const relevantFields = record.fields.filter(f => ['245', '246'].includes(f.tag) && fieldHasSubfield(f, 'a'));\n\n  return deriveDeletable946s(relevantFields);\n\n  function deriveDeletable946s(fields, results = []) {\n    const [currField, ...remainingFields] = fields;\n    if (currField === undefined) {\n      return results;\n    }\n\n    const fieldAsNormalizedString = fieldToNormalizedString(currField);\n    const tmp = fieldAsNormalizedString.replace(/^(?:...) ../u, '946 ##'). // <= Change tag to 946 and indicators to '##'\n      replace(' \u2021a ', ' \u2021i nimeke onixissa \u2021a '). // Add $i before $a. NB! This is added in the normalized lower-cased form!\n      replace(/(?: \\/)? \u2021c[^\u2021]+$/u, ''); // Remove $c. (Can $c be non-last?)\n    const candArray = [tmp, `${tmp} \u20215 MELINDA`].filter(val => val !== fieldAsNormalizedString);\n    if (candArray.length) {\n      return deriveDeletable946s(remainingFields, [...results, ...candArray]);\n    }\n    return deriveDeletable946s(remainingFields, results);\n  }\n}\n\nexport function removeIndividualInferiorDatafields(record, fix = true) { // No $6 nor $8 in field\n  const deletableFieldsAsStrings = deriveIndividualDeletables(record);\n  const deletableFieldsAsNormalizedStrings = deriveIndividualNormalizedDeletables(record);\n\n  // nvdebug(`Deletables:\\n ${deletableFieldsAsStrings.join('\\n ')}`);\n  // nvdebug(`Normalized deletables:\\n ${deletableFieldsAsNormalizedStrings.join('\\n ')}`);\n\n  const hits = record.fields.filter(field => isDeletableField(field));\n\n  const deletedFieldsAsStrings = hits.map(f => fieldToString(f));\n\n  if (fix) {\n    hits.forEach(field => {\n      //nvdebug(`Remove inferior field: ${fieldToString(field)}`, debug);\n      record.removeField(field);\n    });\n  }\n\n  return deletedFieldsAsStrings;\n\n  function isDeletableField(field) {\n    const fieldAsString = fieldToString(field);\n    if (deletableFieldsAsStrings.includes(fieldAsString)) {\n      return true;\n    }\n    const fieldAsNormalizedString = fieldToNormalizedString(field);\n    if (deletableFieldsAsNormalizedStrings.includes(fieldAsNormalizedString)) {\n      return true;\n    }\n\n    return false;\n  }\n}\n\n\nexport function removeInferiorDatafields(record, fix = true) {\n  const removables = removeIndividualInferiorDatafields(record, fix); // Lone fields\n  //const removables8 = removeDuplicateSubfield8Chains(record, fix); // Lone subfield $8 chains\n  const removables6 = removeInferiorChains(record, fix); // Lone subfield $6 chains\n  // HOW TO HANDLE $6+$8 combos? Skipping is relatively OK.\n\n  nvdebug(`REMOVABLES:\\n  ${removables.join('\\n  ')}`, debug);\n  nvdebug(`REMOVABLES 6:\\n  ${removables6.join('\\n  ')}`, debug);\n\n  const removablesAll = removables.concat(removables6); //.concat(removables8);\n\n  return removablesAll;\n}\n"],
-  "mappings": "AAAA,OAAO,uBAAuB;AAC9B,SAAQ,cAAc,iBAAgB;AACtC,SAAQ,+BAA+B,wBAAwB,iCAAiC,gCAA+B;AAC/H,SAAQ,kBAAkB,gBAAgB,eAAe,SAAS,iBAAgB;AAClF,SAAQ,8BAA6B;AACrC,SAAQ,yCAAyC,0CAA0C,wBAAuB;AAClH,SAAQ,2CAA0C;AAClD,SAAQ,gBAAgB,gCAA+B;AAOvD,MAAM,QAAQ,kBAAkB,mEAAmE;AAEnG,0BAA2B;AACzB,SAAO;AAAA,IACL,aAAa;AAAA,IACb;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,IAAI,QAAQ;AACnB,YAAQ,wDAAwD,KAAK;AACrE,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAC9C,6BAAyB,QAAQ,IAAI;AAErC,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ;AAExB,YAAQ,6DAA6D,KAAK;AAE1E,UAAM,aAAa,yBAAyB,QAAQ,KAAK;AAEzD,UAAM,MAAM,EAAC,SAAS,WAAU;AAEhC,QAAI,QAAQ,IAAI,QAAQ,SAAS;AACjC,WAAO;AAAA,EACT;AACF;AAGA,SAAS,qBAAqB,QAAQ,QAAQ;AAE5C,QAAM,OAAO,CAAC;AAEd,SAAO,QAAQ,OAAK,yBAAyB,CAAC,CAAC;AAE/C,SAAO;AAQP,WAAS,yBAAyB,OAAO;AACvC,UAAM,QAAQ,aAAa,OAAO,MAAM;AACxC,QAAI,MAAM,SAAS,GAAG;AACpB;AAAA,IACF;AACA,UAAM,gBAAgB,yBAAyB,OAAO,GAAG,MAAM,IAAI;AACnE,UAAM,MAAM,sBAAsB,CAAC,aAAa,CAAC;AAEjD,QAAI,QAAQ,SAAO;AACjB,UAAI,EAAE,OAAO,OAAO;AAClB,aAAK,GAAG,IAAI;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,sBAAsB,UAAU,aAAa,CAAC,GAAG;AACxD,UAAM,CAAC,eAAe,GAAG,SAAS,IAAI;AACtC,QAAI,kBAAkB,QAAW;AAC/B,aAAO;AAAA,IACT;AAGA,UAAM,kCAAkC,cAAc,QAAQ,gDAAgD,IAAI;AAGlH,UAAM,WAAW,cAAc,QAAQ,qBAAqB,EAAE;AAG9D,UAAM,gBAAgB,cAAc,QAAQ,WAAW,OAAO,EAAE,QAAQ,aAAa,QAAS;AAC9F,UAAM,MAAM,CAAC,iCAAiC,UAAU,aAAa,EAAE,OAAO,SAAO,QAAQ,aAAa;AAC1G,QAAI,IAAI,SAAS,GAAG;AAClB,aAAO,sBAAsB,CAAC,GAAG,WAAW,GAAG,GAAG,GAAG,CAAC,GAAG,YAAY,GAAG,GAAG,CAAC;AAAA,IAC9E;AAEA,WAAO,sBAAsB,WAAW,UAAU;AAAA,EACpD;AAEF;AAEA,SAAS,iBAAiB,OAAO,QAAQ;AAEvC,MAAI,CAAC,uBAAuB,KAAK,KAAK,CAAC,uBAAuB,KAAK,GAAG;AACpE,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,aAAa,OAAO,MAAM;AACxC,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,KAAK,OAAK,EAAE,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG,EAAE,SAAS,CAAC,GAAG;AACzE,WAAO;AAAA,EACT;AAGA,SAAO,UAAU,OAAO,MAAM,CAAC,CAAC;AAClC;AAEO,gBAAS,qBAAqB,QAAQ,MAAM,MAAM;AACvD,QAAM,SAAS,OAAO,OAAO,OAAO,OAAK,iBAAiB,GAAG,MAAM,CAAC;AAGpE,QAAM,wBAAwB,qBAAqB,QAAQ,MAAM;AACjE,QAAM,UAAU,OAAO,KAAK,qBAAqB,EAAE;AAEnD,MAAI,YAAY,GAAG;AACjB,WAAO,CAAC;AAAA,EACV;AAIA,SAAO,0BAA0B,MAAM;AAEvC,WAAS,0BAA0BA,SAAQ,sBAAsB,CAAC,GAAG;AACnE,UAAM,CAAC,WAAW,GAAG,eAAe,IAAIA;AAExC,QAAI,cAAc,QAAW;AAC3B,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ,aAAa,WAAW,MAAM;AAC5C,QAAI,MAAM,WAAW,KAAK,CAAC,UAAU,WAAW,MAAM,CAAC,CAAC,GAAG;AACzD,aAAO,0BAA0B,iBAAiB,mBAAmB;AAAA,IACvE;AAEA,UAAM,gBAAgB,yBAAyB,OAAO,GAAG,MAAM,IAAI;AACnE,QAAI,EAAE,iBAAiB,wBAAwB;AAC7C,aAAO,0BAA0B,iBAAiB,mBAAmB;AAAA,IACvE;AAEA,UAAM,kBAAkB,sBAAsB,aAAa;AAC3D,UAAM,kBAAkB,aAAa,iBAAiB,MAAM;AAG5D,QAAI,iBAAiB,KAAK,GAAG;AAC3B,sBAAgB,QAAQ,OAAK,WAAW,GAAG,eAAe,CAAC;AAAA,IAC7D;AAEA,UAAM,gBAAgB,eAAe,KAAK;AAC1C,UAAM,UAAU,SAAS,aAAa,eAAe,eAAe,eAAe,CAAC;AACpF,QAAI,KAAK;AAEP,YAAM,QAAQ,WAAS,OAAO,YAAY,KAAK,CAAC;AAAA,IAClD;AACA,WAAO,0BAA0B,iBAAiB,CAAC,GAAG,qBAAqB,OAAO,CAAC;AAAA,EACrF;AAEA,WAAS,iBAAiB,OAAO;AAC/B,WAAO,MAAM,KAAK,OAAK,EAAE,IAAI,UAAU,GAAG,CAAC,MAAM,GAAG;AAAA,EACtD;AAEA,WAAS,WAAW,OAAO,OAAO;AAEhC,QAAI,CAAC,CAAC,OAAO,OAAO,OAAO,KAAK,EAAE,SAAS,MAAM,GAAG,GAAG;AACrD;AAAA,IACF;AAEA,UAAM,QAAQ,8BAA8B,OAAO,KAAK;AACxD,UAAM,MAAM,IAAI,MAAM,IAAI,UAAU,CAAC,CAAC;AAEtC,UAAM,QAAQ,iBAAe,gCAAgC,WAAW,CAAC;AAAA,EAC3E;AAEF;AAGA,SAAS,oCAAoC,eAAe;AAI1D,QAAM,uBAAuB,cAAc,QAAQ,uBAAuB,IAAI;AAC9E,QAAM,iBAAiB,cAAc,QAAQ,qBAAqB,EAAE;AAEpE,SAAO,CAAC,sBAAsB,cAAc,EAAE,OAAO,SAAO,QAAQ,aAAa;AACnF;AAEA,SAAS,8BAA8B,UAAU,aAAa,CAAC,GAAG;AAChE,QAAM,CAAC,eAAe,GAAG,SAAS,IAAI;AACtC,MAAI,kBAAkB,QAAW;AAC/B,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,cAAc,MAAM,OAAO,GAAG;AACjC,WAAO,8BAA8B,WAAW,UAAU;AAAA,EAC5D;AAGA,QAAM,UAAU,cAAc,QAAQ,gBAAgB,SAAI;AAG1D,QAAM,mBAAmB,cAAc,QAAQ,wBAAwB,EAAE;AAEzE,QAAM,QAAQ,cAAc,QAAQ,2BAA2B,IAAI;AAGnE,QAAM,SAAS,cAAc,QAAQ,yBAAyB,EAAE;AAGhE,QAAM,eAAe,cAAc,MAAM,SAAS,IAAI,QAAQ,cAAc,UAAU,CAAC,CAAC,KAAK;AAE7F,QAAM,MAAM,CAAC,SAAS,kBAAkB,OAAO,QAAQ,YAAY,EAAE,OAAO,SAAO,QAAQ,aAAa;AAQxG,SAAO;AACT;AAEA,SAAS,2BAA2B,QAAQ;AAC1C,QAAM,WAAW,OAAO,OAAO,IAAI,OAAK,cAAc,CAAC,CAAC;AAGxD,QAAM,wBAAwB,gBAAgB,QAAQ;AAEtD,QAAM,gBAAgB,iBAAiB,MAAM;AAE7C,SAAO,UAAU,CAAC,GAAG,uBAAuB,GAAG,aAAa,CAAC;AAE7D,WAAS,iBAAiBC,SAAQ;AAChC,UAAM,cAAcA,QAAO,OAAO,OAAO,OAAK,CAAC,OAAO,OAAO,KAAK,EAAE,SAAS,EAAE,GAAG,KAAK,EAAE,SAAS;AAClG,UAAM,SAAS,YAAY,QAAQ,OAAK,sBAAsB,CAAC,CAAC;AAGhE,WAAO;AAAA,EACT;AAEA,WAAS,sBAAsB,OAAO;AACpC,UAAM,SAAS,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AAC3D,QAAI,MAAM,QAAQ,OAAO;AACvB,aAAO,OAAO,QAAQ,QAAM,CAAC,kBAAa,GAAG,KAAK,IAAI,kBAAa,GAAG,KAAK,EAAE,CAAC;AAAA,IAChF;AACA,WAAO,OAAO,IAAI,QAAM,kBAAa,GAAG,KAAK,EAAE;AAAA,EACjD;AAEA,WAAS,gBAAgB,YAAY,aAAa,CAAC,GAAG;AACpD,UAAM,CAAC,YAAY,GAAG,SAAS,IAAI;AAEnC,QAAI,eAAe,QAAW;AAC5B,aAAO;AAAA,IACT;AAEA,UAAM,aAAa,qBAAqB,UAAU;AAClD,UAAM,OAAO,8BAA8B,CAAC,UAAU,CAAC;AACvD,UAAM,UAAU,oCAAoC,UAAU;AAC9D,UAAM,WAAW,CAAC,GAAG,YAAY,GAAG,MAAM,GAAG,OAAO;AAGpD,QAAI,WAAW,MAAM,YAAY,GAAG;AAElC,UAAI,WAAW,MAAM,gBAAgB,GAAG;AACtC,cAAM,MAAM,WAAW,QAAQ,kBAAkB,GAAG;AACpD,eAAO,gBAAgB,CAAC,KAAK,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC;AAAA,MAC/E;AAAA,IACF;AAEA,QAAI,WAAW,MAAM,wCAAwC,GAAG;AAC9D,YAAM,OAAO,WAAW,QAAQ,mBAAgB,mBAAgB;AAChE,YAAM,OAAO,WAAW,QAAQ,mBAAgB,GAAG;AACnD,UAAI,SAAS,cAAc,SAAS,YAAY;AAC9C,eAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,MAAM,IAAI,CAAC;AAAA,MACjF;AAAA,IACF;AAEA,QAAI,WAAW,MAAM,4CAA4C,GAAG;AAClE,YAAM,MAAM,WAAW,QAAQ,qBAAkB,GAAG;AACpD,UAAI,QAAQ,YAAY;AACtB,eAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC;AAAA,MAC1E;AAAA,IACF;AAEA,QAAI,WAAW,MAAM,iCAAiC,GAAG;AACvD,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,kCAA6B,CAAC;AAAA,IACpG;AACA,QAAI,WAAW,MAAM,2BAA2B,GAAG;AACjD,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,4BAAuB,CAAC;AAAA,IAC9F;AAEA,QAAI,WAAW,MAAM,iBAAiB,GAAG;AACvC,YAAM,MAAM,WAAW,QAAQ,aAAa,MAAM,EAChD,QAAQ,aAAa,GAAG,EACxB,QAAQ,SAAS,WAAM,EAEvB,QAAQ,cAAc,SAAS;AACjC,UAAI,QAAQ,YAAY;AACtB,eAAO,gBAAgB,CAAC,KAAK,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC;AAAA,MAC/E;AAAA,IAGF;AAEA,QAAI,WAAW,MAAM,wCAAwC,GAAG;AAC9D,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,+CAAqC,CAAC;AAAA,IAC5G;AACA,QAAI,WAAW,MAAM,kCAAkC,GAAG;AACxD,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,yCAA+B,CAAC;AAAA,IACtG;AAGA,QAAI,WAAW,MAAM,kDAAkD,GAAG;AACxE,YAAM,MAAM,WAAW,QAAQ,iCAAiC,OAAO;AAGvE,UAAI,IAAI,MAAM,iCAAiC,GAAG;AAChD,cAAM,OAAO,IAAI,QAAQ,kCAAkC,IAAI;AAE/D,eAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,KAAK,IAAI,CAAC;AAAA,MAChF;AACA,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC;AAAA,IAC1E;AAGA,UAAMC,iBAAgB,uBAAuB,UAAU;AAEvD,UAAM,gBAAgB,CAAC,GAAG,YAAY,GAAG,SAAS,GAAG,YAAY,GAAG,MAAM,GAAGA,cAAa;AAE1F,QAAI,QAAQ,QAAQ;AAClB,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,aAAa;AAAA,IACnE;AAEA,WAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,aAAa;AAAA,EACnE;AAEA,WAAS,qBAAqB,QAAQ;AAGpC,QAAI,WAAW,yBAAyB,MAAM,GAAG;AAC/C,aAAO,CAAC;AAAA,IACV;AACA,UAAM,aAAa,OAAO,eAAe,MAAM,CAAC,EAAE,QAAQ,mBAAmB,EAAE;AAE/E,QAAI,eAAe,QAAQ;AACzB,aAAO,CAAC;AAAA,IACV;AACA,WAAO,CAAC,UAAU;AAAA,EACpB;AAEA,WAAS,uBAAuB,eAAe;AAC7C,QAAI,cAAc,MAAM,QAAQ,GAAG;AAEjC,aAAO,CAAC,GAAG,aAAa,yBAAoB,GAAG,aAAa,yBAAoB,GAAG,aAAa,yBAAoB,GAAG,aAAa,0BAAqB,GAAG,aAAa,0BAAqB,GAAG,aAAa,wBAAmB;AAAA,IACnO;AAEA,WAAO,CAAC;AAAA,EACV;AAEF;AAEA,SAAS,wBAAwB,OAAO;AACtC,QAAM,kBAAkB,oCAAoC,KAAK;AACjE,SAAO,cAAc,eAAe;AACtC;AAEA,SAAS,qCAAqC,QAAQ;AACpD,QAAM,gBAAgB,iBAAiB,MAAM;AAC7C,QAAM,mBAAmB,wCAAwC,aAAa;AAC9E,QAAM,SAAS,kBAAkB,OAAO,OAAO,OAAO,KAAK,OAAK,EAAE,QAAQ,SAAS,yCAAyC,CAAC,CAAC;AAC9H,MAAI,CAAC,oBAAoB,QAAQ;AAC/B,WAAO,CAAC;AAAA,EACV;AACA,QAAM,iBAAiB,OAAO,OAAO,OAAO,OAAK,CAAC,OAAO,KAAK,EAAE,SAAS,EAAE,GAAG,KAAK,iBAAiB,GAAG,GAAG,CAAC;AAE3G,SAAO,oBAAoB,cAAc;AAEzC,WAAS,oBAAoB,QAAQ,UAAU,CAAC,GAAG;AACjD,UAAM,CAAC,WAAW,GAAG,eAAe,IAAI;AACxC,QAAI,cAAc,QAAW;AAC3B,aAAO;AAAA,IACT;AAEA,UAAM,0BAA0B,wBAAwB,SAAS;AACjE,UAAM,MAAM,wBAAwB,QAAQ,gBAAgB,QAAQ,EAClE,QAAQ,aAAQ,mCAAyB,EACzC,QAAQ,sBAAsB,EAAE;AAClC,UAAM,YAAY,CAAC,KAAK,GAAG,GAAG,kBAAa,EAAE,OAAO,SAAO,QAAQ,uBAAuB;AAC1F,QAAI,UAAU,QAAQ;AACpB,aAAO,oBAAoB,iBAAiB,CAAC,GAAG,SAAS,GAAG,SAAS,CAAC;AAAA,IACxE;AACA,WAAO,oBAAoB,iBAAiB,OAAO;AAAA,EACrD;AACF;AAEO,gBAAS,mCAAmC,QAAQ,MAAM,MAAM;AACrE,QAAM,2BAA2B,2BAA2B,MAAM;AAClE,QAAM,qCAAqC,qCAAqC,MAAM;AAKtF,QAAM,OAAO,OAAO,OAAO,OAAO,WAAS,iBAAiB,KAAK,CAAC;AAElE,QAAM,yBAAyB,KAAK,IAAI,OAAK,cAAc,CAAC,CAAC;AAE7D,MAAI,KAAK;AACP,SAAK,QAAQ,WAAS;AAEpB,aAAO,YAAY,KAAK;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,SAAO;AAEP,WAAS,iBAAiB,OAAO;AAC/B,UAAM,gBAAgB,cAAc,KAAK;AACzC,QAAI,yBAAyB,SAAS,aAAa,GAAG;AACpD,aAAO;AAAA,IACT;AACA,UAAM,0BAA0B,wBAAwB,KAAK;AAC7D,QAAI,mCAAmC,SAAS,uBAAuB,GAAG;AACxE,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AACF;AAGO,gBAAS,yBAAyB,QAAQ,MAAM,MAAM;AAC3D,QAAM,aAAa,mCAAmC,QAAQ,GAAG;AAEjE,QAAM,cAAc,qBAAqB,QAAQ,GAAG;AAGpD,UAAQ;AAAA,IAAkB,WAAW,KAAK,MAAM,CAAC,IAAI,KAAK;AAC1D,UAAQ;AAAA,IAAoB,YAAY,KAAK,MAAM,CAAC,IAAI,KAAK;AAE7D,QAAM,gBAAgB,WAAW,OAAO,WAAW;AAEnD,SAAO;AACT;",
+  "sourcesContent": ["import createDebugLogger from 'debug';\nimport {fieldToChain, sameField} from './removeDuplicateDataFields.js';\nimport {fieldGetOccurrenceNumberPairs, fieldHasValidSubfield6, fieldSevenToOneOccurrenceNumber, fieldsToNormalizedString} from './subfield6Utils.js';\nimport {fieldHasSubfield, fieldsToString, fieldToString, nvdebug, uniqArray} from './utils.js';\nimport {fieldHasValidSubfield8} from './subfield8Utils.js';\nimport {encodingLevelIsBetterThanPrepublication, fieldRefersToKoneellisestiTuotettuTietue, getEncodingLevel} from './prepublicationUtils.js';\nimport {cloneAndNormalizeFieldForComparison} from './normalizeFieldForComparison.js';\nimport {fixComposition, precomposeFinnishLetters} from './normalize-utf8-diacritics.js';\n\n// Relocated from melinda-marc-record-merge-reducers (and renamed)\n\n// NB! This validator handles only full fields, and does not support subfield $8 removal.\n// Also, having multiple $8 subfields in same fields is not supported.\n// If this functionality is needed, see removeDuplicateDatafields.js for examples of subfield-only stuff.\nconst debug = createDebugLogger('@natlibfi/marc-record-validators-melinda:removeInferiorDataFields');\n\nexport default function () {\n  return {\n    description: 'Remove subset data fields. Certain exceptions apply, mainly too complicated for chained fields',\n    validate, fix\n  };\n\n  function fix(record) {\n    nvdebug('Fix record: remove inferior (eg. subset) data fields', debug);\n    const res = {message: [], fix: [], valid: true};\n    removeInferiorDatafields(record, true);\n    // This can not really fail...\n    return res;\n  }\n\n  function validate(record) {\n    // Check max, and check number of different indexes\n    nvdebug('Validate record: remove inferior (eg. subset) data fields', debug);\n\n    const duplicates = removeInferiorDatafields(record, false);\n\n    const res = {message: duplicates};\n\n    res.valid = res.message.length < 1;\n    return res;\n  }\n}\n\n\nfunction deriveInferiorChains(fields, record) {\n  //nvdebug(`======= GOT ${fields.length} FIELDS TO CHAINIFY`);\n  const hash = {};\n\n  fields.forEach(f => fieldToChainToDeletables(f));\n\n  return hash;\n\n  //nvdebug(`WP1: GOT ${todoList.length} CHAINS`);\n\n\n  // here we map deletableStringObject[str] => field. The idea is to help debugging. We don't actually need the field object...\n  //return deriveChainDeletables(todoList);\n\n  function fieldToChainToDeletables(field) {\n    const chain = fieldToChain(field, record);\n    if (chain.length < 2) {\n      return;\n    }\n    const chainAsString = fieldsToNormalizedString(chain, 0, true, true);\n    const arr = deriveChainDeletables([chainAsString]);\n    //nvdebug(`GOT ${arr.length} DELETABLES FOR ${chainAsString}`);\n    arr.forEach(val => {\n      if (!(val in hash)) {\n        hash[val] = field;\n      }\n    });\n  }\n\n  function deriveChainDeletables(todoList, deletables = []) {\n    const [chainAsString, ...stillToDo] = todoList;\n    if (chainAsString === undefined) {\n      return deletables;\n    }\n\n    // Fix MRA-476 (part 1): one $6 value can be worse than the other\n    const withoutScriptIdentificationCode = chainAsString.replace(/( \u20216 [0-9X][0-9][0-9]-(?:XX|[0-9]+))\\/[^ ]+/u, '$1');\n\n    // Remove keepless versions:\n    const keepless = chainAsString.replace(/ \u20219 [A-Z]+<KEEP>/u, '');\n\n    // MRA-433: 490 ind1=1 vs ind1=0: remove latter (luckily no 2nd indicator etc)\n    const linked490Ind1 = chainAsString.replace(/^490 1/u, '490 0').replace(/\\t880 1/ug, '\\t880 0');\n    const arr = [withoutScriptIdentificationCode, keepless, linked490Ind1].filter(val => val !== chainAsString);\n    if (arr.length > 0) {\n      return deriveChainDeletables([...stillToDo, ...arr], [...deletables, ...arr]);\n    }\n\n    return deriveChainDeletables(stillToDo, deletables);\n  }\n\n}\n\nfunction isRelevantChain6(field, record) {\n  //Can't be a chain:\n  if (!fieldHasValidSubfield6(field) && !fieldHasValidSubfield8(field)) {\n    return false;\n  }\n  // Too short to be a chain:\n  const chain = fieldToChain(field, record);\n  if (chain.length < 2) {\n    return false;\n  }\n  // No field can contains no more than one subfield $6\n  if (chain.some(f => f.subfields.filter(sf => sf.code === '6').length > 1)) {\n    return false;\n  }\n\n  // Check whether our field is the head of a chain:\n  return sameField(field, chain[0]);\n}\n\nexport function removeInferiorChains(record, fix = true) {\n  const fields = record.fields.filter(f => isRelevantChain6(f, record));\n  //nvdebug(`WP2.0: GOT ${fields.length} chain(s)`);\n\n  const deletableChainsAsKeys = deriveInferiorChains(fields, record);\n  const nChains = Object.keys(deletableChainsAsKeys).length;\n  //nvdebug(`WP2: GOT ${nChains} chain(s)`);\n  if (nChains === 0) {\n    return [];\n  }\n\n  //nvdebug(`removeInferiorChains() has ${fields.length} fields-in-chain(s), and a list of ${nChains} deletable(s)`);\n\n  return innerRemoveInferiorChains(fields);\n\n  function innerRemoveInferiorChains(fields, deletedStringsArray = []) {\n    const [currField, ...remainingFields] = fields;\n\n    if (currField === undefined) {\n      return deletedStringsArray;\n    }\n\n    const chain = fieldToChain(currField, record);\n    if (chain.length === 0 || !sameField(currField, chain[0])) {\n      return innerRemoveInferiorChains(remainingFields, deletedStringsArray);\n    }\n\n    const chainAsString = fieldsToNormalizedString(chain, 0, true, true);\n    if (!(chainAsString in deletableChainsAsKeys)) {\n      return innerRemoveInferiorChains(remainingFields, deletedStringsArray);\n    }\n\n    const triggeringField = deletableChainsAsKeys[chainAsString];\n    const triggeringChain = fieldToChain(triggeringField, record);\n\n    // If the inferior (deletable) chain is 1XX-based, convert the triggering better chain from 7XX to 1XX:\n    if (chainContains1XX(chain)) {\n      triggeringChain.forEach(f => sevenToOne(f, triggeringChain));\n    }\n    //nvdebug(`iRIS6C: ${chainAsString}`);\n    const deletedString = fieldsToString(chain);\n    const message = `DEL: '${deletedString}'  REASON: '${fieldsToString(triggeringChain)}'`;\n    if (fix) {\n      //nvdebug(`INFERIOR $6 CHAIN REMOVAL: ${message}}`, debug);\n      chain.forEach(field => record.removeField(field));\n    }\n    return innerRemoveInferiorChains(remainingFields, [...deletedStringsArray, message]);\n  }\n\n  function chainContains1XX(chain) {\n    return chain.some(f => f.tag.substring(0, 1) === '1');\n  }\n\n  function sevenToOne(field, chain) { // Change 7XX field to 1XX field. Also handle the corresponding 880$6 7XX-NN subfields\n    // NB! This function should be called only if the original 1XX gets deleted!\n    if (!['700', '710', '711', '730'].includes(field.tag)) {\n      return;\n    }\n    // Retag field 7XX as 1XX and fix corresponding occurrence numbers as well:\n    const pairs = fieldGetOccurrenceNumberPairs(field, chain);\n    field.tag = `1${field.tag.substring(1)}`;\n    // There should always be one pair, but I'm not sanity-checking this\n    pairs.forEach(pairedField => fieldSevenToOneOccurrenceNumber(pairedField));\n  }\n\n}\n\n\nfunction getIdentifierlessAndKeeplessSubsets(fieldAsString) {\n  // The rules below are not perfect (in complex cases they don't catch all permutations), but good enough:\n  // Remove identifier(s) (MELKEHITYS-2383-ish):\n\n  const identifierlessString = fieldAsString.replace(/ \u2021[01] [^\u2021]+($| \u2021)/u, '$1');\n  const keeplessString = fieldAsString.replace(/ \u20219 [A-Z]+<KEEP>/u, '');\n\n  return [identifierlessString, keeplessString].filter(val => val !== fieldAsString);\n}\n\nfunction deriveIndividualDeletables490(todoList, deletables = []) {\n  const [fieldAsString, ...stillToDo] = todoList;\n  if (fieldAsString === undefined) {\n    return deletables;\n  }\n  //nvdebug(`PROCESS ${fieldAsString}`);\n  if (!fieldAsString.match(/^490/u)) {\n    return deriveIndividualDeletables490(stillToDo, deletables);\n  }\n\n  // $6-less version (keep this first)\n  const sixless = fieldAsString.replace(/ \u20216 [^\u2021]+ \u2021/u, ' \u2021');\n\n  // Without final $v or $x:\n  const withoutFinalVOrX = fieldAsString.replace(/ *[;,] \u2021[vx] [^\u2021]+$/u, '');\n  // Add intermediate $x-less version\n  const xless = fieldAsString.replace(/, \u2021x [^\u2021]+(, \u2021x| ; \u2021v)/u, '$1');\n\n  // Add $xv-less version (handled by recursion?)\n  const xvless = fieldAsString.replace(/, \u2021x [^\u2021]+ \u2021v [^\u2021]+$/u, '');\n\n  // MRA-433-ish (non-chain): 490 ind1=1 vs ind1=0: remove latter\n  const modifiedInd2 = fieldAsString.match(/^490 1/u) ? `490 0${fieldAsString.substring(5)}` : fieldAsString;\n\n  const arr = [sixless, withoutFinalVOrX, xless, xvless, modifiedInd2].filter(val => val !== fieldAsString);\n\n  /*\n  if (arr.length) {\n    nvdebug(`${arr.length} derivation(s) for ${fieldAsString}`);\n    nvdebug(arr.join('\\n'));\n  }\n  */\n  return arr;\n}\n\nfunction deriveIndividualDeletables(record) {\n  const todoList = record.fields.map(f => fieldToString(f));\n  //const finishedRecord = encodingLevelIsBetterThanPrepublication(getEncodingLevel(record));\n\n  const deletableStringsArray = processTodoList(todoList);\n\n  const inferiorTerms = getInferiorTerms(record);\n\n  return uniqArray([...deletableStringsArray, ...inferiorTerms]);\n\n  function getInferiorTerms(record) {\n    const inputFields = record.fields.filter(f => ['648', '650', '651'].includes(f.tag) && f.subfields);\n    const result = inputFields.flatMap(f => fieldToInferiorFields(f));\n\n    // console.log(result.join('\\n')); // eslint-disable-line no-console\n    return result;\n  }\n\n  function fieldToInferiorFields(field) {\n    const aArray = field.subfields.filter(sf => sf.code === 'a');\n    if (field.tag === '650') {\n      return aArray.flatMap(sf => [`653 ## \u2021a ${sf.value}`, `653 #0 \u2021a ${sf.value}`]);\n    }\n    return aArray.map(sf => `653 ## \u2021a ${sf.value}`);\n  }\n\n  function processTodoList(thingsToDo, deletables = []) {\n    const [currString, ...stillToDo] = thingsToDo;\n\n    if (currString === undefined) {\n      return deletables;\n    }\n\n    const accentless = getAccentlessVersion(currString);\n    const d490 = deriveIndividualDeletables490([currString]);\n    const subsets = getIdentifierlessAndKeeplessSubsets(currString);\n    const moreToDo = [...accentless, ...d490, ...subsets];\n\n\n    if (currString.match(/^[1678]00/u)) {\n      // Proof-of-concept rule. Should be improved eventually...\n      if (currString.match(/, \u2021e [^\u2021]+\\.$/u)) {\n        const tmp = currString.replace(/, \u2021e [^\u2021]+\\.$/u, '.');\n        return processTodoList([tmp, ...stillToDo, ...moreToDo], [...deletables, tmp]);\n      }\n    }\n\n    if (currString.match(/^500 ## \u2021a Lis\u00E4painokset: Lis\u00E4painos /u)) { // MET-569\n      const tmp1 = currString.replace(' Lis\u00E4painos ', ' [Lis\u00E4painos] ');\n      const tmp2 = currString.replace(' Lis\u00E4painos ', ' ');\n      if (tmp1 !== currString && tmp2 !== currString) {\n        return processTodoList([...stillToDo, ...moreToDo], [...deletables, tmp1, tmp2]);\n      }\n    }\n\n    if (currString.match(/^500 ## \u2021a Lis\u00E4painokset: \\[Lis\u00E4painos\\] /u)) { // MET-569\n      const tmp = currString.replace(' [Lis\u00E4painos] ', ' ');\n      if (tmp !== currString) {\n        return processTodoList([...stillToDo, ...moreToDo], [...deletables, tmp]);\n      }\n    }\n\n    if (currString.match(/^500 ## \u2021a Ei vastaanotettu\\.$/u)) { // MELKEHITYS-3147\n      return processTodoList([...stillToDo, ...moreToDo], [...deletables, '500 ## \u2021a EI VASTAANOTETTU.']);\n    }\n    if (currString.match(/^500 ## \u2021a Ei ilmesty\\.$/u)) { // MELKEHITYS-3147\n      return processTodoList([...stillToDo, ...moreToDo], [...deletables, '500 ## \u2021a EI ILMESTY.']);\n    }\n\n    if (currString.match(/^505 .0.*-- \u2021t/u)) { // MRA-413-ish\n      const tmp = currString.replace(/ -- \u2021t /gu, ' -- '). // remove non-initial $t subfields\n        replace(/ \u2021[rg] /gu, ' '). // remove $r and $g subfields\n        replace(/ \u2021t /u, ' \u2021a '). // change first $t to $a\n        // ind2: '1' => '#':\n        replace(/^505 (.)0/u, '505 $1#');\n      if (tmp !== currString) {\n        return processTodoList([tmp, ...stillToDo, ...moreToDo], [...deletables, tmp]);\n      }\n      //nvdebug(`505 ORIGINAL: '${fieldAsString}'`)\n      //nvdebug(`505 DERIVATE: '${tmp}'`)\n    }\n\n    if (currString.match(/^594 ## \u2021a Ei vastaanotettu \u20215 FENNI$/u)) { // MELKEHITYS-3147\n      return processTodoList([...stillToDo, ...moreToDo], [...deletables, '594 ## \u2021a EI VASTAANOTETTU \u20215 FENNI']);\n    }\n    if (currString.match(/^594 ## \u2021a Ei ilmesty \u20215 FENNI$/u)) { // MELKEHITYS-3147\n      return processTodoList([...stillToDo, ...moreToDo], [...deletables, '594 ## \u2021a EI ILMESTY \u20215 FENNI']);\n    }\n\n    // MET-381: remove occurence number TAG-00, if TAG-NN existists\n    if (currString.match(/^880.* \u20216 [0-9][0-9][0-9]-(?:[1-9][0-9]|0[1-9])/u)) {\n      const tmp = currString.replace(/( \u20216 [0-9][0-9][0-9])-[0-9]+/u, '$1-00');\n      //nvdebug(`MET-381: ADD TO DELETABLES: '${tmp}'`);\n      //deletableStringsArray.push(tmp);\n      if (tmp.match(/ \u20216 [0-9][0-9][0-9]-00\\/[^ ]+ /u)) {\n        const tmp2 = tmp.replace(/( \u20216 [0-9][0-9][0-9]-00)[^ ]+/u, '$1');\n        //nvdebug(`MET-381: ADD TO DELETABLES: '${tmp2}'`);\n        return processTodoList([...stillToDo, ...moreToDo], [...deletables, tmp, tmp2]);\n      }\n      return processTodoList([...stillToDo, ...moreToDo], [...deletables, tmp]);\n    }\n\n    // MET-575 (merge: applies in postprocessing)\n    const inferiorTerms = getPrepublicationTerms(currString);\n\n    // MELKEHITYS-3277-ish: non-AI is better than AI (a rare case where longer version is inferior):\n    const aiBased = `${currString} \u20217 (dpenmw)AI`;\n\n    const newDeletables = [...deletables, ...subsets, ...accentless, ...d490, ...inferiorTerms, aiBased];\n\n    if (subsets.length) {\n      return processTodoList([...stillToDo, ...moreToDo], newDeletables);\n    }\n\n    return processTodoList([...stillToDo, ...moreToDo], newDeletables);\n  }\n\n  function getAccentlessVersion(string) { // MET-527\n    //nvdebug(`START: '${string}`);\n    // This is a sanity check: if precomposition does something, there's something wrong, and we don't want to proceed..\n    if (string !== precomposeFinnishLetters(string)) {\n      return [];\n    }\n    const accentless = String(fixComposition(string)).replace(/\\p{Diacritic}/gu, '');\n    //nvdebug(`FROM '${string}'\\n  TO '${accentless}'`);\n    if (accentless === string) { // Don't self-destruct\n      return [];\n    }\n    return [accentless];\n  }\n\n  function getPrepublicationTerms(fieldAsString) {\n    if (fieldAsString.match(/^653./u)) {\n      // MET-528 (extented by MET-575)\n      return [`${fieldAsString} \u2021g ENNAKKOTIETO`, `${fieldAsString} \u2021g Ennakkotieto`, `${fieldAsString} \u2021g ennakkotieto`, `${fieldAsString} \u2021g ENNAKKOTIETO.`, `${fieldAsString} \u2021g Ennakkotieto.`, `${fieldAsString} \u2021g ennakkotieto.`];\n    }\n\n    return [];\n  }\n\n}\n\nfunction fieldToNormalizedString(field) {\n  const normalizedField = cloneAndNormalizeFieldForComparison(field);\n  return fieldToString(normalizedField);\n}\n\nfunction deriveIndividualNormalizedDeletables(record) { //  MET-461:\n  const encodingLevel = getEncodingLevel(record);\n  const recordIsFinished = encodingLevelIsBetterThanPrepublication(encodingLevel);\n  const met495 = encodingLevel === '2' && record.fields.some(f => f.tag === '500' && fieldRefersToKoneellisestiTuotettuTietue(f));\n  if (!recordIsFinished || met495) {\n    return [];\n  }\n  const relevantFields = record.fields.filter(f => ['245', '246'].includes(f.tag) && fieldHasSubfield(f, 'a'));\n\n  return deriveDeletable946s(relevantFields);\n\n  function deriveDeletable946s(fields, results = []) {\n    const [currField, ...remainingFields] = fields;\n    if (currField === undefined) {\n      return results;\n    }\n\n    const fieldAsNormalizedString = fieldToNormalizedString(currField);\n    const tmp = fieldAsNormalizedString.replace(/^(?:...) ../u, '946 ##'). // <= Change tag to 946 and indicators to '##'\n      replace(' \u2021a ', ' \u2021i nimeke onixissa \u2021a '). // Add $i before $a. NB! This is added in the normalized lower-cased form!\n      replace(/(?: \\/)? \u2021c[^\u2021]+$/u, ''); // Remove $c. (Can $c be non-last?)\n    const candArray = [tmp, `${tmp} \u20215 MELINDA`].filter(val => val !== fieldAsNormalizedString);\n    if (candArray.length) {\n      return deriveDeletable946s(remainingFields, [...results, ...candArray]);\n    }\n    return deriveDeletable946s(remainingFields, results);\n  }\n}\n\nexport function removeIndividualInferiorDatafields(record, fix = true) { // No $6 nor $8 in field\n  const deletableFieldsAsStrings = deriveIndividualDeletables(record);\n  const deletableFieldsAsNormalizedStrings = deriveIndividualNormalizedDeletables(record);\n\n  // nvdebug(`Deletables:\\n ${deletableFieldsAsStrings.join('\\n ')}`);\n  // nvdebug(`Normalized deletables:\\n ${deletableFieldsAsNormalizedStrings.join('\\n ')}`);\n\n  const hits = record.fields.filter(field => isDeletableField(field));\n\n  const deletedFieldsAsStrings = hits.map(f => fieldToString(f));\n\n  if (fix) {\n    hits.forEach(field => {\n      //nvdebug(`Remove inferior field: ${fieldToString(field)}`, debug);\n      record.removeField(field);\n    });\n  }\n\n  return deletedFieldsAsStrings;\n\n  function isDeletableField(field) {\n    const fieldAsString = fieldToString(field);\n    if (deletableFieldsAsStrings.includes(fieldAsString)) {\n      return true;\n    }\n    const fieldAsNormalizedString = fieldToNormalizedString(field);\n    if (deletableFieldsAsNormalizedStrings.includes(fieldAsNormalizedString)) {\n      return true;\n    }\n\n    return false;\n  }\n}\n\n\nexport function removeInferiorDatafields(record, fix = true) {\n  const removables = removeIndividualInferiorDatafields(record, fix); // Lone fields\n  //const removables8 = removeDuplicateSubfield8Chains(record, fix); // Lone subfield $8 chains\n  const removables6 = removeInferiorChains(record, fix); // Lone subfield $6 chains\n  // HOW TO HANDLE $6+$8 combos? Skipping is relatively OK.\n\n  nvdebug(`REMOVABLES:\\n  ${removables.join('\\n  ')}`, debug);\n  nvdebug(`REMOVABLES 6:\\n  ${removables6.join('\\n  ')}`, debug);\n\n  const removablesAll = removables.concat(removables6); //.concat(removables8);\n\n  return removablesAll;\n}\n"],
+  "mappings": "AAAA,OAAO,uBAAuB;AAC9B,SAAQ,cAAc,iBAAgB;AACtC,SAAQ,+BAA+B,wBAAwB,iCAAiC,gCAA+B;AAC/H,SAAQ,kBAAkB,gBAAgB,eAAe,SAAS,iBAAgB;AAClF,SAAQ,8BAA6B;AACrC,SAAQ,yCAAyC,0CAA0C,wBAAuB;AAClH,SAAQ,2CAA0C;AAClD,SAAQ,gBAAgB,gCAA+B;AAOvD,MAAM,QAAQ,kBAAkB,mEAAmE;AAEnG,0BAA2B;AACzB,SAAO;AAAA,IACL,aAAa;AAAA,IACb;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,IAAI,QAAQ;AACnB,YAAQ,wDAAwD,KAAK;AACrE,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAC9C,6BAAyB,QAAQ,IAAI;AAErC,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ;AAExB,YAAQ,6DAA6D,KAAK;AAE1E,UAAM,aAAa,yBAAyB,QAAQ,KAAK;AAEzD,UAAM,MAAM,EAAC,SAAS,WAAU;AAEhC,QAAI,QAAQ,IAAI,QAAQ,SAAS;AACjC,WAAO;AAAA,EACT;AACF;AAGA,SAAS,qBAAqB,QAAQ,QAAQ;AAE5C,QAAM,OAAO,CAAC;AAEd,SAAO,QAAQ,OAAK,yBAAyB,CAAC,CAAC;AAE/C,SAAO;AAQP,WAAS,yBAAyB,OAAO;AACvC,UAAM,QAAQ,aAAa,OAAO,MAAM;AACxC,QAAI,MAAM,SAAS,GAAG;AACpB;AAAA,IACF;AACA,UAAM,gBAAgB,yBAAyB,OAAO,GAAG,MAAM,IAAI;AACnE,UAAM,MAAM,sBAAsB,CAAC,aAAa,CAAC;AAEjD,QAAI,QAAQ,SAAO;AACjB,UAAI,EAAE,OAAO,OAAO;AAClB,aAAK,GAAG,IAAI;AAAA,MACd;AAAA,IACF,CAAC;AAAA,EACH;AAEA,WAAS,sBAAsB,UAAU,aAAa,CAAC,GAAG;AACxD,UAAM,CAAC,eAAe,GAAG,SAAS,IAAI;AACtC,QAAI,kBAAkB,QAAW;AAC/B,aAAO;AAAA,IACT;AAGA,UAAM,kCAAkC,cAAc,QAAQ,gDAAgD,IAAI;AAGlH,UAAM,WAAW,cAAc,QAAQ,qBAAqB,EAAE;AAG9D,UAAM,gBAAgB,cAAc,QAAQ,WAAW,OAAO,EAAE,QAAQ,aAAa,QAAS;AAC9F,UAAM,MAAM,CAAC,iCAAiC,UAAU,aAAa,EAAE,OAAO,SAAO,QAAQ,aAAa;AAC1G,QAAI,IAAI,SAAS,GAAG;AAClB,aAAO,sBAAsB,CAAC,GAAG,WAAW,GAAG,GAAG,GAAG,CAAC,GAAG,YAAY,GAAG,GAAG,CAAC;AAAA,IAC9E;AAEA,WAAO,sBAAsB,WAAW,UAAU;AAAA,EACpD;AAEF;AAEA,SAAS,iBAAiB,OAAO,QAAQ;AAEvC,MAAI,CAAC,uBAAuB,KAAK,KAAK,CAAC,uBAAuB,KAAK,GAAG;AACpE,WAAO;AAAA,EACT;AAEA,QAAM,QAAQ,aAAa,OAAO,MAAM;AACxC,MAAI,MAAM,SAAS,GAAG;AACpB,WAAO;AAAA,EACT;AAEA,MAAI,MAAM,KAAK,OAAK,EAAE,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG,EAAE,SAAS,CAAC,GAAG;AACzE,WAAO;AAAA,EACT;AAGA,SAAO,UAAU,OAAO,MAAM,CAAC,CAAC;AAClC;AAEO,gBAAS,qBAAqB,QAAQ,MAAM,MAAM;AACvD,QAAM,SAAS,OAAO,OAAO,OAAO,OAAK,iBAAiB,GAAG,MAAM,CAAC;AAGpE,QAAM,wBAAwB,qBAAqB,QAAQ,MAAM;AACjE,QAAM,UAAU,OAAO,KAAK,qBAAqB,EAAE;AAEnD,MAAI,YAAY,GAAG;AACjB,WAAO,CAAC;AAAA,EACV;AAIA,SAAO,0BAA0B,MAAM;AAEvC,WAAS,0BAA0BA,SAAQ,sBAAsB,CAAC,GAAG;AACnE,UAAM,CAAC,WAAW,GAAG,eAAe,IAAIA;AAExC,QAAI,cAAc,QAAW;AAC3B,aAAO;AAAA,IACT;AAEA,UAAM,QAAQ,aAAa,WAAW,MAAM;AAC5C,QAAI,MAAM,WAAW,KAAK,CAAC,UAAU,WAAW,MAAM,CAAC,CAAC,GAAG;AACzD,aAAO,0BAA0B,iBAAiB,mBAAmB;AAAA,IACvE;AAEA,UAAM,gBAAgB,yBAAyB,OAAO,GAAG,MAAM,IAAI;AACnE,QAAI,EAAE,iBAAiB,wBAAwB;AAC7C,aAAO,0BAA0B,iBAAiB,mBAAmB;AAAA,IACvE;AAEA,UAAM,kBAAkB,sBAAsB,aAAa;AAC3D,UAAM,kBAAkB,aAAa,iBAAiB,MAAM;AAG5D,QAAI,iBAAiB,KAAK,GAAG;AAC3B,sBAAgB,QAAQ,OAAK,WAAW,GAAG,eAAe,CAAC;AAAA,IAC7D;AAEA,UAAM,gBAAgB,eAAe,KAAK;AAC1C,UAAM,UAAU,SAAS,aAAa,eAAe,eAAe,eAAe,CAAC;AACpF,QAAI,KAAK;AAEP,YAAM,QAAQ,WAAS,OAAO,YAAY,KAAK,CAAC;AAAA,IAClD;AACA,WAAO,0BAA0B,iBAAiB,CAAC,GAAG,qBAAqB,OAAO,CAAC;AAAA,EACrF;AAEA,WAAS,iBAAiB,OAAO;AAC/B,WAAO,MAAM,KAAK,OAAK,EAAE,IAAI,UAAU,GAAG,CAAC,MAAM,GAAG;AAAA,EACtD;AAEA,WAAS,WAAW,OAAO,OAAO;AAEhC,QAAI,CAAC,CAAC,OAAO,OAAO,OAAO,KAAK,EAAE,SAAS,MAAM,GAAG,GAAG;AACrD;AAAA,IACF;AAEA,UAAM,QAAQ,8BAA8B,OAAO,KAAK;AACxD,UAAM,MAAM,IAAI,MAAM,IAAI,UAAU,CAAC,CAAC;AAEtC,UAAM,QAAQ,iBAAe,gCAAgC,WAAW,CAAC;AAAA,EAC3E;AAEF;AAGA,SAAS,oCAAoC,eAAe;AAI1D,QAAM,uBAAuB,cAAc,QAAQ,uBAAuB,IAAI;AAC9E,QAAM,iBAAiB,cAAc,QAAQ,qBAAqB,EAAE;AAEpE,SAAO,CAAC,sBAAsB,cAAc,EAAE,OAAO,SAAO,QAAQ,aAAa;AACnF;AAEA,SAAS,8BAA8B,UAAU,aAAa,CAAC,GAAG;AAChE,QAAM,CAAC,eAAe,GAAG,SAAS,IAAI;AACtC,MAAI,kBAAkB,QAAW;AAC/B,WAAO;AAAA,EACT;AAEA,MAAI,CAAC,cAAc,MAAM,OAAO,GAAG;AACjC,WAAO,8BAA8B,WAAW,UAAU;AAAA,EAC5D;AAGA,QAAM,UAAU,cAAc,QAAQ,gBAAgB,SAAI;AAG1D,QAAM,mBAAmB,cAAc,QAAQ,wBAAwB,EAAE;AAEzE,QAAM,QAAQ,cAAc,QAAQ,2BAA2B,IAAI;AAGnE,QAAM,SAAS,cAAc,QAAQ,yBAAyB,EAAE;AAGhE,QAAM,eAAe,cAAc,MAAM,SAAS,IAAI,QAAQ,cAAc,UAAU,CAAC,CAAC,KAAK;AAE7F,QAAM,MAAM,CAAC,SAAS,kBAAkB,OAAO,QAAQ,YAAY,EAAE,OAAO,SAAO,QAAQ,aAAa;AAQxG,SAAO;AACT;AAEA,SAAS,2BAA2B,QAAQ;AAC1C,QAAM,WAAW,OAAO,OAAO,IAAI,OAAK,cAAc,CAAC,CAAC;AAGxD,QAAM,wBAAwB,gBAAgB,QAAQ;AAEtD,QAAM,gBAAgB,iBAAiB,MAAM;AAE7C,SAAO,UAAU,CAAC,GAAG,uBAAuB,GAAG,aAAa,CAAC;AAE7D,WAAS,iBAAiBC,SAAQ;AAChC,UAAM,cAAcA,QAAO,OAAO,OAAO,OAAK,CAAC,OAAO,OAAO,KAAK,EAAE,SAAS,EAAE,GAAG,KAAK,EAAE,SAAS;AAClG,UAAM,SAAS,YAAY,QAAQ,OAAK,sBAAsB,CAAC,CAAC;AAGhE,WAAO;AAAA,EACT;AAEA,WAAS,sBAAsB,OAAO;AACpC,UAAM,SAAS,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AAC3D,QAAI,MAAM,QAAQ,OAAO;AACvB,aAAO,OAAO,QAAQ,QAAM,CAAC,kBAAa,GAAG,KAAK,IAAI,kBAAa,GAAG,KAAK,EAAE,CAAC;AAAA,IAChF;AACA,WAAO,OAAO,IAAI,QAAM,kBAAa,GAAG,KAAK,EAAE;AAAA,EACjD;AAEA,WAAS,gBAAgB,YAAY,aAAa,CAAC,GAAG;AACpD,UAAM,CAAC,YAAY,GAAG,SAAS,IAAI;AAEnC,QAAI,eAAe,QAAW;AAC5B,aAAO;AAAA,IACT;AAEA,UAAM,aAAa,qBAAqB,UAAU;AAClD,UAAM,OAAO,8BAA8B,CAAC,UAAU,CAAC;AACvD,UAAM,UAAU,oCAAoC,UAAU;AAC9D,UAAM,WAAW,CAAC,GAAG,YAAY,GAAG,MAAM,GAAG,OAAO;AAGpD,QAAI,WAAW,MAAM,YAAY,GAAG;AAElC,UAAI,WAAW,MAAM,gBAAgB,GAAG;AACtC,cAAM,MAAM,WAAW,QAAQ,kBAAkB,GAAG;AACpD,eAAO,gBAAgB,CAAC,KAAK,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC;AAAA,MAC/E;AAAA,IACF;AAEA,QAAI,WAAW,MAAM,wCAAwC,GAAG;AAC9D,YAAM,OAAO,WAAW,QAAQ,mBAAgB,mBAAgB;AAChE,YAAM,OAAO,WAAW,QAAQ,mBAAgB,GAAG;AACnD,UAAI,SAAS,cAAc,SAAS,YAAY;AAC9C,eAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,MAAM,IAAI,CAAC;AAAA,MACjF;AAAA,IACF;AAEA,QAAI,WAAW,MAAM,4CAA4C,GAAG;AAClE,YAAM,MAAM,WAAW,QAAQ,qBAAkB,GAAG;AACpD,UAAI,QAAQ,YAAY;AACtB,eAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC;AAAA,MAC1E;AAAA,IACF;AAEA,QAAI,WAAW,MAAM,iCAAiC,GAAG;AACvD,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,kCAA6B,CAAC;AAAA,IACpG;AACA,QAAI,WAAW,MAAM,2BAA2B,GAAG;AACjD,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,4BAAuB,CAAC;AAAA,IAC9F;AAEA,QAAI,WAAW,MAAM,iBAAiB,GAAG;AACvC,YAAM,MAAM,WAAW,QAAQ,aAAa,MAAM,EAChD,QAAQ,aAAa,GAAG,EACxB,QAAQ,SAAS,WAAM,EAEvB,QAAQ,cAAc,SAAS;AACjC,UAAI,QAAQ,YAAY;AACtB,eAAO,gBAAgB,CAAC,KAAK,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC;AAAA,MAC/E;AAAA,IAGF;AAEA,QAAI,WAAW,MAAM,wCAAwC,GAAG;AAC9D,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,+CAAqC,CAAC;AAAA,IAC5G;AACA,QAAI,WAAW,MAAM,kCAAkC,GAAG;AACxD,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,yCAA+B,CAAC;AAAA,IACtG;AAGA,QAAI,WAAW,MAAM,kDAAkD,GAAG;AACxE,YAAM,MAAM,WAAW,QAAQ,iCAAiC,OAAO;AAGvE,UAAI,IAAI,MAAM,iCAAiC,GAAG;AAChD,cAAM,OAAO,IAAI,QAAQ,kCAAkC,IAAI;AAE/D,eAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,KAAK,IAAI,CAAC;AAAA,MAChF;AACA,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,CAAC,GAAG,YAAY,GAAG,CAAC;AAAA,IAC1E;AAGA,UAAMC,iBAAgB,uBAAuB,UAAU;AAGvD,UAAM,UAAU,GAAG,UAAU;AAE7B,UAAM,gBAAgB,CAAC,GAAG,YAAY,GAAG,SAAS,GAAG,YAAY,GAAG,MAAM,GAAGA,gBAAe,OAAO;AAEnG,QAAI,QAAQ,QAAQ;AAClB,aAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,aAAa;AAAA,IACnE;AAEA,WAAO,gBAAgB,CAAC,GAAG,WAAW,GAAG,QAAQ,GAAG,aAAa;AAAA,EACnE;AAEA,WAAS,qBAAqB,QAAQ;AAGpC,QAAI,WAAW,yBAAyB,MAAM,GAAG;AAC/C,aAAO,CAAC;AAAA,IACV;AACA,UAAM,aAAa,OAAO,eAAe,MAAM,CAAC,EAAE,QAAQ,mBAAmB,EAAE;AAE/E,QAAI,eAAe,QAAQ;AACzB,aAAO,CAAC;AAAA,IACV;AACA,WAAO,CAAC,UAAU;AAAA,EACpB;AAEA,WAAS,uBAAuB,eAAe;AAC7C,QAAI,cAAc,MAAM,QAAQ,GAAG;AAEjC,aAAO,CAAC,GAAG,aAAa,yBAAoB,GAAG,aAAa,yBAAoB,GAAG,aAAa,yBAAoB,GAAG,aAAa,0BAAqB,GAAG,aAAa,0BAAqB,GAAG,aAAa,wBAAmB;AAAA,IACnO;AAEA,WAAO,CAAC;AAAA,EACV;AAEF;AAEA,SAAS,wBAAwB,OAAO;AACtC,QAAM,kBAAkB,oCAAoC,KAAK;AACjE,SAAO,cAAc,eAAe;AACtC;AAEA,SAAS,qCAAqC,QAAQ;AACpD,QAAM,gBAAgB,iBAAiB,MAAM;AAC7C,QAAM,mBAAmB,wCAAwC,aAAa;AAC9E,QAAM,SAAS,kBAAkB,OAAO,OAAO,OAAO,KAAK,OAAK,EAAE,QAAQ,SAAS,yCAAyC,CAAC,CAAC;AAC9H,MAAI,CAAC,oBAAoB,QAAQ;AAC/B,WAAO,CAAC;AAAA,EACV;AACA,QAAM,iBAAiB,OAAO,OAAO,OAAO,OAAK,CAAC,OAAO,KAAK,EAAE,SAAS,EAAE,GAAG,KAAK,iBAAiB,GAAG,GAAG,CAAC;AAE3G,SAAO,oBAAoB,cAAc;AAEzC,WAAS,oBAAoB,QAAQ,UAAU,CAAC,GAAG;AACjD,UAAM,CAAC,WAAW,GAAG,eAAe,IAAI;AACxC,QAAI,cAAc,QAAW;AAC3B,aAAO;AAAA,IACT;AAEA,UAAM,0BAA0B,wBAAwB,SAAS;AACjE,UAAM,MAAM,wBAAwB,QAAQ,gBAAgB,QAAQ,EAClE,QAAQ,aAAQ,mCAAyB,EACzC,QAAQ,sBAAsB,EAAE;AAClC,UAAM,YAAY,CAAC,KAAK,GAAG,GAAG,kBAAa,EAAE,OAAO,SAAO,QAAQ,uBAAuB;AAC1F,QAAI,UAAU,QAAQ;AACpB,aAAO,oBAAoB,iBAAiB,CAAC,GAAG,SAAS,GAAG,SAAS,CAAC;AAAA,IACxE;AACA,WAAO,oBAAoB,iBAAiB,OAAO;AAAA,EACrD;AACF;AAEO,gBAAS,mCAAmC,QAAQ,MAAM,MAAM;AACrE,QAAM,2BAA2B,2BAA2B,MAAM;AAClE,QAAM,qCAAqC,qCAAqC,MAAM;AAKtF,QAAM,OAAO,OAAO,OAAO,OAAO,WAAS,iBAAiB,KAAK,CAAC;AAElE,QAAM,yBAAyB,KAAK,IAAI,OAAK,cAAc,CAAC,CAAC;AAE7D,MAAI,KAAK;AACP,SAAK,QAAQ,WAAS;AAEpB,aAAO,YAAY,KAAK;AAAA,IAC1B,CAAC;AAAA,EACH;AAEA,SAAO;AAEP,WAAS,iBAAiB,OAAO;AAC/B,UAAM,gBAAgB,cAAc,KAAK;AACzC,QAAI,yBAAyB,SAAS,aAAa,GAAG;AACpD,aAAO;AAAA,IACT;AACA,UAAM,0BAA0B,wBAAwB,KAAK;AAC7D,QAAI,mCAAmC,SAAS,uBAAuB,GAAG;AACxE,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT;AACF;AAGO,gBAAS,yBAAyB,QAAQ,MAAM,MAAM;AAC3D,QAAM,aAAa,mCAAmC,QAAQ,GAAG;AAEjE,QAAM,cAAc,qBAAqB,QAAQ,GAAG;AAGpD,UAAQ;AAAA,IAAkB,WAAW,KAAK,MAAM,CAAC,IAAI,KAAK;AAC1D,UAAQ;AAAA,IAAoB,YAAY,KAAK,MAAM,CAAC,IAAI,KAAK;AAE7D,QAAM,gBAAgB,WAAW,OAAO,WAAW;AAEnD,SAAO;AACT;",
   "names": ["fields", "record", "inferiorTerms"]
 }

package/dist/sortSubfields.js

@@ -45,9 +45,9 @@ export default function(defaultTagPattern) {
     return res;
   }
 }
-const sortOrderForX00 = ["i", "a", "b", "q", "c", "d", "e", "t", "u", "l", "f", "x", "y", "z", "0", "5", "9"];
-const sortOrderForX10 = ["i", "a", "b", "t", "n", "c", "e", "v", "w", "x", "y", "z", "0", "5", "9"];
-const sortOrderForX11 = ["a", "n", "d", "c", "e", "g", "j", "0", "5", "9"];
+const sortOrderForX00 = ["i", "a", "b", "q", "c", "d", "e", "t", "u", "l", "f", "x", "y", "z", "0", "1", "5", "9"];
+const sortOrderForX10 = ["i", "a", "b", "t", "n", "c", "e", "v", "w", "x", "y", "z", "0", "1", "5", "9"];
+const sortOrderForX11 = ["a", "n", "d", "c", "e", "g", "j", "0", "1", "5", "9"];
 const sortOrderFor7XX = ["8", "7", "i", "a", "s", "t", "b", "c", "d", "m", "h", "k", "o", "x", "z", "g", "q", "w"];
 const sortOrderFor246 = ["i", "a", "b", "n", "p", "f", "5", "9"];
 const subfieldSortOrder = [
@@ -67,7 +67,7 @@ const subfieldSortOrder = [
   { "tag": "245", "sortOrder": ["a", "b", "n", "p", "k", "f", "c"] },
   { "tag": "246", "sortOrder": sortOrderFor246 },
   { "tag": "382", "sortOrder": ["a"] },
-  { "tag": "385", "sortOrder": ["8", "m", "n", "a", "2", "0"] },
+  { "tag": "385", "sortOrder": ["8", "m", "n", "a", "2", "0", "1"] },
   { "tag": "386", "sortOrder": ["8", "m", "n", "a"] },
   { "tag": "490", "sortOrder": ["a", "x", "y", "v", "l"] },
   { "tag": "505", "sortOrder": ["a"] },
@@ -169,7 +169,7 @@ export function sortAdjacentSubfields(field, externalSortOrder = []) {
   }
   moveSubfield6ToTheFront(field);
   const finnishWay = twoBeforeZero(field);
-  const controlSubfieldOrder = finnishWay ? ["8", "7", "3", "a", "4", "2", "0", "1", "5", "9"] : ["8", "7", "3", "a", "4", "0", "2", "1", "5", "9"];
+  const controlSubfieldOrder = finnishWay ? ["8", "3", "a", "4", "2", "0", "1", "7", "5", "9"] : ["8", "7", "3", "a", "4", "0", "1", "2", "7", "5", "9"];
   swapSubfields(field, controlSubfieldOrder);
   const sortOrderForField = externalSortOrder.length > 0 ? externalSortOrder : getSubfieldSortOrder(field);
   const defaultSortOrder = finnishWay ? defaultSortOrderFinns : defaultSortOrderOthers;

package/dist/sortSubfields.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/sortSubfields.js"],
-  "sourcesContent": ["// Author(s): Nicholas Volk\n\nimport clone from 'clone';\nimport createDebugLogger from 'debug';\nimport {fieldToString, nvdebug} from './utils.js';\n\nconst debug = createDebugLogger('@natlibfi/marc-record-validators-melinda:sortSubfields');\n//const debugData = debug.extend('data');\nconst debugDev = debug.extend('dev');\n\nconst defaultSortOrderStringFinns = '8673abcdefghijklmnopqrstuvwxyz420159'; // NB! We Finns like $2 before $0 in 6XX...\nconst defaultSortOrderStringOthers = '8673abcdefghijklmnopqrstuvwxyz402159';\n\nconst defaultSortOrderFinns = defaultSortOrderStringFinns.split('');\nconst defaultSortOrderOthers = defaultSortOrderStringOthers.split('');\n\n\nexport default function (defaultTagPattern) {\n\n  return {\n    description: 'Swap adjacent subfields',\n    validate, fix\n  };\n\n  function getRelevantFields(record, tagPattern) {\n    const datafields = record.fields.filter(f => f.subfields);\n    if (!tagPattern) {\n      return datafields;\n    }\n\n    const regexp = new RegExp(tagPattern, 'u');\n    return datafields.filter(f => regexp.test(f.tag));\n  }\n\n  function fix(record, tagPattern = defaultTagPattern) {\n    const res = {message: [], fix: [], valid: true};\n\n    const relevantFields = getRelevantFields(record, tagPattern);\n\n    relevantFields.forEach(field => {\n      sortAdjacentSubfields(field);\n    });\n\n    return res;\n  }\n\n  function validate(record, tagPattern = defaultTagPattern) {\n    const res = {message: []};\n\n    const relevantFields = getRelevantFields(record, tagPattern);\n\n    relevantFields.forEach(field => {\n      const clonedField = clone(field);\n      sortAdjacentSubfields(clonedField);\n      const clonedFieldAsString = fieldToString(clonedField);\n      const fieldAsString = fieldToString(field);\n      if (fieldAsString !== clonedFieldAsString) {\n        res.message.push(clonedFieldAsString);\n      }\n    });\n\n    res.valid = !(res.message.length >= 1);\n    return res;\n  }\n}\n\n\n// X00, X10, X11 and X130 could also for their own sets...\n// (ouch! sometimes $c comes after $d...): LoC: 100 0# \u2021a Black Foot, \u2021c Chief, \u2021d d. 1877 \u2021c (Spirit)\nconst sortOrderForX00 = ['i', 'a', 'b', 'q', 'c', 'd', 'e', 't', 'u', 'l', 'f', 'x', 'y', 'z', '0', '5', '9']; // skip $g. Can't remember why, though...\nconst sortOrderForX10 = ['i', 'a', 'b', 't', 'n', 'c', 'e', 'v', 'w', 'x', 'y', 'z', '0', '5', '9']; // somewhat iffy\nconst sortOrderForX11 = ['a', 'n', 'd', 'c', 'e', 'g', 'j', '0', '5', '9'];\nconst sortOrderFor7XX = ['8', '7', 'i', 'a', 's', 't', 'b', 'c', 'd', 'm', 'h', 'k', 'o', 'x', 'z', 'g', 'q', 'w'];\nconst sortOrderFor246 = ['i', 'a', 'b', 'n', 'p', 'f', '5', '9']; // Used by field 946 as well\n\n// List *only* exceptional order here. Otherwise default order is used.\nconst subfieldSortOrder = [\n  {'tag': '017', 'sortOrder': ['i', 'a', 'b', 'd']},\n  {'tag': '028', 'sortOrder': ['b', 'a', 'q']}, // National convention\n  //{'tag': '031', 'sortOrder': ['a', 'b', 'c', 'm', 'e', 'd']}, // utter guesswork\n  {'tag': '040', 'sortOrder': ['8', 'a', 'b', 'e', 'c', 'd', 'x']},\n  {'tag': '041', 'sortOrder': ['8', 'a', 'd', 'j', 'p', 'h', 'e', 'g', 'm']}, // guesswork\n  {'tag': '048', 'sortOrder': ['8', 'b', 'a']},\n  {'tag': '100', 'sortOrder': sortOrderForX00},\n  {'tag': '110', 'sortOrder': sortOrderForX10},\n  {'tag': '111', 'sortOrder': sortOrderForX11},\n  {'tag': '130', 'sortOrder': ['a', 'n', 'p', 'k', 'l']},\n  {'tag': '240', 'sortOrder': ['a', 'm', 'n', 'p', 's', 'l', '2', '0', '1', '5', '9']},\n  {'tag': '245', 'sortOrder': ['a', 'b', 'n', 'p', 'k', 'f', 'c']},\n  {'tag': '246', 'sortOrder': sortOrderFor246},\n  {'tag': '382', 'sortOrder': ['a']},\n  {'tag': '385', 'sortOrder': ['8', 'm', 'n', 'a', '2', '0']},\n  {'tag': '386', 'sortOrder': ['8', 'm', 'n', 'a']},\n  {'tag': '490', 'sortOrder': ['a', 'x', 'y', 'v', 'l']},\n  {'tag': '505', 'sortOrder': ['a']},\n  {'tag': '526', 'sortOrder': ['i', 'a', 'b', 'x', 'z']},\n  {'tag': '534', 'sortOrder': ['3', 'p', 'a', 't', 'l', 'c', 'f', 'b', 'e', 'o', 'x', 'z']},\n  {'tag': '540', 'sortOrder': ['a', 'b', 'c', 'd', 'f', '2', 'u']},\n  {'tag': '600', 'sortOrder': sortOrderForX00},\n  {'tag': '610', 'sortOrder': sortOrderForX10},\n  {'tag': '611', 'sortOrder': sortOrderForX11},\n  {'tag': '650', 'sortOrder': ['a', 'x', 'y', 'z']},\n  {'tag': '700', 'sortOrder': sortOrderForX00},\n  {'tag': '710', 'sortOrder': sortOrderForX10},\n  {'tag': '711', 'sortOrder': sortOrderForX11},\n  {'tag': '760', 'sortOrder': sortOrderFor7XX},\n  {'tag': '762', 'sortOrder': sortOrderFor7XX},\n  {'tag': '765', 'sortOrder': sortOrderFor7XX},\n  {'tag': '767', 'sortOrder': sortOrderFor7XX},\n  {'tag': '770', 'sortOrder': sortOrderFor7XX},\n  {'tag': '772', 'sortOrder': sortOrderFor7XX},\n  {'tag': '773', 'sortOrder': sortOrderFor7XX},\n  {'tag': '774', 'sortOrder': sortOrderFor7XX},\n  {'tag': '775', 'sortOrder': sortOrderFor7XX},\n  {'tag': '776', 'sortOrder': sortOrderFor7XX},\n  {'tag': '777', 'sortOrder': sortOrderFor7XX},\n  {'tag': '780', 'sortOrder': sortOrderFor7XX},\n  {'tag': '785', 'sortOrder': sortOrderFor7XX},\n  {'tag': '786', 'sortOrder': sortOrderFor7XX},\n  {'tag': '787', 'sortOrder': sortOrderFor7XX},\n  {'tag': '788', 'sortOrder': sortOrderFor7XX},\n  {'tag': '800', 'sortOrder': sortOrderForX00},\n  {'tag': '810', 'sortOrder': sortOrderForX10},\n  {'tag': '811', 'sortOrder': sortOrderForX11},\n  {'tag': '830', 'sortOrder': ['a', 'n', 'x', 'v']}, // INCOMPLETE, SAME AS 490? APPARENTLY NOT...\n  {'tag': '856', 'sortOrder': ['3', 'u', 'q', 'x', 'y', 'z', '5']}, // incomplete, LoC examples are inconclusive\n  {'tag': '880', 'sortOrder': ['a']},\n  {'tag': '946', 'sortOrder': sortOrderFor246},\n  {'tag': 'LOW', 'sortOrder': ['a', 'b', 'c', 'l', 'h']},\n  {'tag': 'SID', 'sortOrder': ['c', 'b']} // Hack, so that default order is not used\n];\n\nfunction getSubfieldSortOrder(field) {\n  const entry = subfieldSortOrder.filter(currEntry => field.tag === currEntry.tag);\n  if (entry.length > 0 && 'sortOrder' in entry[0]) {\n    debugDev(`sort order for ${field.tag}: ${entry[0].sortOrder}`);\n    return entry[0].sortOrder;\n  }\n  nvdebug(`WARNING!\\tNo subfield order found for ${field.tag}.`);\n  return [];\n}\n\n\nfunction swapSubfields(field, sortOrder) {\n  if (!field.subfields) {\n    return;\n  }\n\n  const loopAgain = field.subfields.some((sf, index) => {\n    if (index === 0) {\n      return false;\n    }\n    const currPos = getPosition(sf, sortOrder);\n    const prevPos = getPosition(field.subfields[index - 1], sortOrder);\n    if (currPos === -1 || prevPos === -1 || currPos >= prevPos) {\n      return false;\n    }\n    // Swap:\n    const tmp = field.subfields[index - 1];\n    field.subfields[index - 1] = sf;\n    field.subfields[index] = tmp;\n    return true;\n  });\n\n  if (loopAgain) {\n    return swapSubfields(field, sortOrder);\n  }\n\n  return;\n\n  function getPosition(subfield, sortOrder) {\n    // Magic exception that *always* comes first, used by Aleph in linking overlong fields\n    if (sortOrder.indexOf('9') > -1 && subfield.code === '9' && ['^', '^^'].includes(subfield.value)) {\n      return -0.5; // normal \"best value\" is 0, and \"worst value\" is N\n    }\n    return sortOrder.indexOf(subfield.code);\n  }\n}\n\n\nfunction twoBeforeZero(field) {\n  const sf2 = field.subfields.filter(sf => sf.code === '2');\n  if (sf2.length !== 1) {\n    return true; // both true and false are ok here\n  }\n  // MRA-465: gcipplatform (field 753)\n  // rdasco (344), creatorbio (353), gbd (668), lsch (eg. 385)\n  if (['creatorbio', 'gbd', 'gcipplatform', 'lscsh', 'rdasco'].includes(sf2[0].value)) {\n    return false;\n  }\n  return true;\n}\n\nfunction moveSubfield6ToTheFront(field) {\n  // https://www.loc.gov/marc/bibliographic/ecbdcntf.html says \"Subfield $6 is always the first subfield in the field.\"\n  const sf6s = field.subfields.filter(sf => sf.code === '6');\n  const others = field.subfields.filter(sf => sf.code !== '6');\n  field.subfields = [...sf6s, ...others];\n}\n\nexport function sortAdjacentSubfields(field, externalSortOrder = []) {\n  if (!field.subfields) {\n    return field;\n  }\n\n  moveSubfield6ToTheFront(field); // specs: \"Subfield $6 is always the first subfield in the field.\"\n\n  // Features:\n  // - Swap only sort adjacent pairs.\n  // - No sorting over unlisted subfield codes. Thus a given subfield can not shift to wrong side of 700$t...\n\n  // Implement: 880 field should use values from $6...\n\n  // Should we support multiple sort orders per field?\n\n  // Try to handle control subfield order. This is not 100% fool proof. Control subfields are pretty stable, though.\n  // However, there are exceptions (eg. $9 ^^ comes first and $2 $0 is a Finnish convention...)\n\n\n  const finnishWay = twoBeforeZero(field);\n  const controlSubfieldOrder = finnishWay ? ['8', '7', '3', 'a', '4', '2', '0', '1', '5', '9'] : ['8', '7', '3', 'a', '4', '0', '2', '1', '5', '9'];\n  swapSubfields(field, controlSubfieldOrder);\n\n  const sortOrderForField = externalSortOrder.length > 0 ? externalSortOrder : getSubfieldSortOrder(field);\n  //nvdebug(`INTERMEDIATE SUBFIELD ORDER FOR ${field.tag}: ${sortOrderForField.join(', ')}`);\n\n  const defaultSortOrder = finnishWay ? defaultSortOrderFinns : defaultSortOrderOthers; // $2 vs $0\n  const subfieldOrder = sortOrderForField.length > 0 ? sortOrderForField : defaultSortOrder;\n  //nvdebug(`FINAL SUBFIELD ORDER (FINNISH=${finnishWay}) FOR ${field.tag}: ${subfieldOrder.join(', ')}`);\n  //if (sortOrder === null) { return field; } //// Currently always sort..\n  //nvdebug(`IN:  ${fieldToString(field)}`);\n  swapSubfields(field, subfieldOrder);\n  //nvdebug(`OUT: ${fieldToString(field)}`);\n\n  return field;\n}\n\n"],
-  "mappings": "AAEA,OAAO,WAAW;AAClB,OAAO,uBAAuB;AAC9B,SAAQ,eAAe,eAAc;AAErC,MAAM,QAAQ,kBAAkB,wDAAwD;AAExF,MAAM,WAAW,MAAM,OAAO,KAAK;AAEnC,MAAM,8BAA8B;AACpC,MAAM,+BAA+B;AAErC,MAAM,wBAAwB,4BAA4B,MAAM,EAAE;AAClE,MAAM,yBAAyB,6BAA6B,MAAM,EAAE;AAGpE,wBAAyB,mBAAmB;AAE1C,SAAO;AAAA,IACL,aAAa;AAAA,IACb;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,kBAAkB,QAAQ,YAAY;AAC7C,UAAM,aAAa,OAAO,OAAO,OAAO,OAAK,EAAE,SAAS;AACxD,QAAI,CAAC,YAAY;AACf,aAAO;AAAA,IACT;AAEA,UAAM,SAAS,IAAI,OAAO,YAAY,GAAG;AACzC,WAAO,WAAW,OAAO,OAAK,OAAO,KAAK,EAAE,GAAG,CAAC;AAAA,EAClD;AAEA,WAAS,IAAI,QAAQ,aAAa,mBAAmB;AACnD,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAE9C,UAAM,iBAAiB,kBAAkB,QAAQ,UAAU;AAE3D,mBAAe,QAAQ,WAAS;AAC9B,4BAAsB,KAAK;AAAA,IAC7B,CAAC;AAED,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ,aAAa,mBAAmB;AACxD,UAAM,MAAM,EAAC,SAAS,CAAC,EAAC;AAExB,UAAM,iBAAiB,kBAAkB,QAAQ,UAAU;AAE3D,mBAAe,QAAQ,WAAS;AAC9B,YAAM,cAAc,MAAM,KAAK;AAC/B,4BAAsB,WAAW;AACjC,YAAM,sBAAsB,cAAc,WAAW;AACrD,YAAM,gBAAgB,cAAc,KAAK;AACzC,UAAI,kBAAkB,qBAAqB;AACzC,YAAI,QAAQ,KAAK,mBAAmB;AAAA,MACtC;AAAA,IACF,CAAC;AAED,QAAI,QAAQ,EAAE,IAAI,QAAQ,UAAU;AACpC,WAAO;AAAA,EACT;AACF;AAKA,MAAM,kBAAkB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAC5G,MAAM,kBAAkB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAClG,MAAM,kBAAkB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACzE,MAAM,kBAAkB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACjH,MAAM,kBAAkB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAG/D,MAAM,oBAAoB;AAAA,EACxB,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAChD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,GAAG,EAAC;AAAA;AAAA;AAAA,EAE3C,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAC/D,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA;AAAA,EACzE,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,GAAG,EAAC;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACrD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACnF,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAC/D,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,CAAC,GAAG,EAAC;AAAA,EACjC,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAC1D,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAChD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACrD,EAAC,OAAO,OAAO,aAAa,CAAC,GAAG,EAAC;AAAA,EACjC,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACrD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACxF,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAC/D,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAChD,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA;AAAA,EAChD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA;AAAA,EAC/D,EAAC,OAAO,OAAO,aAAa,CAAC,GAAG,EAAC;AAAA,EACjC,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACrD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,GAAG,EAAC;AAAA;AACxC;AAEA,SAAS,qBAAqB,OAAO;AACnC,QAAM,QAAQ,kBAAkB,OAAO,eAAa,MAAM,QAAQ,UAAU,GAAG;AAC/E,MAAI,MAAM,SAAS,KAAK,eAAe,MAAM,CAAC,GAAG;AAC/C,aAAS,kBAAkB,MAAM,GAAG,KAAK,MAAM,CAAC,EAAE,SAAS,EAAE;AAC7D,WAAO,MAAM,CAAC,EAAE;AAAA,EAClB;AACA,UAAQ,wCAAyC,MAAM,GAAG,GAAG;AAC7D,SAAO,CAAC;AACV;AAGA,SAAS,cAAc,OAAO,WAAW;AACvC,MAAI,CAAC,MAAM,WAAW;AACpB;AAAA,EACF;AAEA,QAAM,YAAY,MAAM,UAAU,KAAK,CAAC,IAAI,UAAU;AACpD,QAAI,UAAU,GAAG;AACf,aAAO;AAAA,IACT;AACA,UAAM,UAAU,YAAY,IAAI,SAAS;AACzC,UAAM,UAAU,YAAY,MAAM,UAAU,QAAQ,CAAC,GAAG,SAAS;AACjE,QAAI,YAAY,MAAM,YAAY,MAAM,WAAW,SAAS;AAC1D,aAAO;AAAA,IACT;AAEA,UAAM,MAAM,MAAM,UAAU,QAAQ,CAAC;AACrC,UAAM,UAAU,QAAQ,CAAC,IAAI;AAC7B,UAAM,UAAU,KAAK,IAAI;AACzB,WAAO;AAAA,EACT,CAAC;AAED,MAAI,WAAW;AACb,WAAO,cAAc,OAAO,SAAS;AAAA,EACvC;AAEA;AAEA,WAAS,YAAY,UAAUA,YAAW;AAExC,QAAIA,WAAU,QAAQ,GAAG,IAAI,MAAM,SAAS,SAAS,OAAO,CAAC,KAAK,IAAI,EAAE,SAAS,SAAS,KAAK,GAAG;AAChG,aAAO;AAAA,IACT;AACA,WAAOA,WAAU,QAAQ,SAAS,IAAI;AAAA,EACxC;AACF;AAGA,SAAS,cAAc,OAAO;AAC5B,QAAM,MAAM,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AACxD,MAAI,IAAI,WAAW,GAAG;AACpB,WAAO;AAAA,EACT;AAGA,MAAI,CAAC,cAAc,OAAO,gBAAgB,SAAS,QAAQ,EAAE,SAAS,IAAI,CAAC,EAAE,KAAK,GAAG;AACnF,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,wBAAwB,OAAO;AAEtC,QAAM,OAAO,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AACzD,QAAM,SAAS,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AAC3D,QAAM,YAAY,CAAC,GAAG,MAAM,GAAG,MAAM;AACvC;AAEO,gBAAS,sBAAsB,OAAO,oBAAoB,CAAC,GAAG;AACnE,MAAI,CAAC,MAAM,WAAW;AACpB,WAAO;AAAA,EACT;AAEA,0BAAwB,KAAK;AAc7B,QAAM,aAAa,cAAc,KAAK;AACtC,QAAM,uBAAuB,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAChJ,gBAAc,OAAO,oBAAoB;AAEzC,QAAM,oBAAoB,kBAAkB,SAAS,IAAI,oBAAoB,qBAAqB,KAAK;AAGvG,QAAM,mBAAmB,aAAa,wBAAwB;AAC9D,QAAM,gBAAgB,kBAAkB,SAAS,IAAI,oBAAoB;AAIzE,gBAAc,OAAO,aAAa;AAGlC,SAAO;AACT;",
+  "sourcesContent": ["// Author(s): Nicholas Volk\n\nimport clone from 'clone';\nimport createDebugLogger from 'debug';\nimport {fieldToString, nvdebug} from './utils.js';\n\nconst debug = createDebugLogger('@natlibfi/marc-record-validators-melinda:sortSubfields');\n//const debugData = debug.extend('data');\nconst debugDev = debug.extend('dev');\n\nconst defaultSortOrderStringFinns = '8673abcdefghijklmnopqrstuvwxyz420159'; // NB! We Finns like $2 before $0 in 6XX...\nconst defaultSortOrderStringOthers = '8673abcdefghijklmnopqrstuvwxyz402159';\n\nconst defaultSortOrderFinns = defaultSortOrderStringFinns.split('');\nconst defaultSortOrderOthers = defaultSortOrderStringOthers.split('');\n\n\nexport default function (defaultTagPattern) {\n\n  return {\n    description: 'Swap adjacent subfields',\n    validate, fix\n  };\n\n  function getRelevantFields(record, tagPattern) {\n    const datafields = record.fields.filter(f => f.subfields);\n    if (!tagPattern) {\n      return datafields;\n    }\n\n    const regexp = new RegExp(tagPattern, 'u');\n    return datafields.filter(f => regexp.test(f.tag));\n  }\n\n  function fix(record, tagPattern = defaultTagPattern) {\n    const res = {message: [], fix: [], valid: true};\n\n    const relevantFields = getRelevantFields(record, tagPattern);\n\n    relevantFields.forEach(field => {\n      sortAdjacentSubfields(field);\n    });\n\n    return res;\n  }\n\n  function validate(record, tagPattern = defaultTagPattern) {\n    const res = {message: []};\n\n    const relevantFields = getRelevantFields(record, tagPattern);\n\n    relevantFields.forEach(field => {\n      const clonedField = clone(field);\n      sortAdjacentSubfields(clonedField);\n      const clonedFieldAsString = fieldToString(clonedField);\n      const fieldAsString = fieldToString(field);\n      if (fieldAsString !== clonedFieldAsString) {\n        res.message.push(clonedFieldAsString);\n      }\n    });\n\n    res.valid = !(res.message.length >= 1);\n    return res;\n  }\n}\n\n\n// X00, X10, X11 and X130 could also for their own sets...\n// (ouch! sometimes $c comes after $d...): LoC: 100 0# \u2021a Black Foot, \u2021c Chief, \u2021d d. 1877 \u2021c (Spirit)\nconst sortOrderForX00 = ['i', 'a', 'b', 'q', 'c', 'd', 'e', 't', 'u', 'l', 'f', 'x', 'y', 'z', '0', '1', '5', '9']; // skip $g. Can't remember why, though...\nconst sortOrderForX10 = ['i', 'a', 'b', 't', 'n', 'c', 'e', 'v', 'w', 'x', 'y', 'z', '0', '1', '5', '9']; // somewhat iffy\nconst sortOrderForX11 = ['a', 'n', 'd', 'c', 'e', 'g', 'j', '0', '1', '5', '9'];\nconst sortOrderFor7XX = ['8', '7', 'i', 'a', 's', 't', 'b', 'c', 'd', 'm', 'h', 'k', 'o', 'x', 'z', 'g', 'q', 'w'];\nconst sortOrderFor246 = ['i', 'a', 'b', 'n', 'p', 'f', '5', '9']; // Used by field 946 as well\n\n// List *only* exceptional order here. Otherwise default order is used.\nconst subfieldSortOrder = [\n  {'tag': '017', 'sortOrder': ['i', 'a', 'b', 'd']},\n  {'tag': '028', 'sortOrder': ['b', 'a', 'q']}, // National convention\n  //{'tag': '031', 'sortOrder': ['a', 'b', 'c', 'm', 'e', 'd']}, // utter guesswork\n  {'tag': '040', 'sortOrder': ['8', 'a', 'b', 'e', 'c', 'd', 'x']},\n  {'tag': '041', 'sortOrder': ['8', 'a', 'd', 'j', 'p', 'h', 'e', 'g', 'm']}, // guesswork\n  {'tag': '048', 'sortOrder': ['8', 'b', 'a']},\n  {'tag': '100', 'sortOrder': sortOrderForX00},\n  {'tag': '110', 'sortOrder': sortOrderForX10},\n  {'tag': '111', 'sortOrder': sortOrderForX11},\n  {'tag': '130', 'sortOrder': ['a', 'n', 'p', 'k', 'l']},\n  {'tag': '240', 'sortOrder': ['a', 'm', 'n', 'p', 's', 'l', '2', '0', '1', '5', '9']},\n  {'tag': '245', 'sortOrder': ['a', 'b', 'n', 'p', 'k', 'f', 'c']},\n  {'tag': '246', 'sortOrder': sortOrderFor246},\n  {'tag': '382', 'sortOrder': ['a']},\n  {'tag': '385', 'sortOrder': ['8', 'm', 'n', 'a', '2', '0', '1']},\n  {'tag': '386', 'sortOrder': ['8', 'm', 'n', 'a']},\n  {'tag': '490', 'sortOrder': ['a', 'x', 'y', 'v', 'l']},\n  {'tag': '505', 'sortOrder': ['a']},\n  {'tag': '526', 'sortOrder': ['i', 'a', 'b', 'x', 'z']},\n  {'tag': '534', 'sortOrder': ['3', 'p', 'a', 't', 'l', 'c', 'f', 'b', 'e', 'o', 'x', 'z']},\n  {'tag': '540', 'sortOrder': ['a', 'b', 'c', 'd', 'f', '2', 'u']},\n  {'tag': '600', 'sortOrder': sortOrderForX00},\n  {'tag': '610', 'sortOrder': sortOrderForX10},\n  {'tag': '611', 'sortOrder': sortOrderForX11},\n  {'tag': '650', 'sortOrder': ['a', 'x', 'y', 'z']},\n  {'tag': '700', 'sortOrder': sortOrderForX00},\n  {'tag': '710', 'sortOrder': sortOrderForX10},\n  {'tag': '711', 'sortOrder': sortOrderForX11},\n  {'tag': '760', 'sortOrder': sortOrderFor7XX},\n  {'tag': '762', 'sortOrder': sortOrderFor7XX},\n  {'tag': '765', 'sortOrder': sortOrderFor7XX},\n  {'tag': '767', 'sortOrder': sortOrderFor7XX},\n  {'tag': '770', 'sortOrder': sortOrderFor7XX},\n  {'tag': '772', 'sortOrder': sortOrderFor7XX},\n  {'tag': '773', 'sortOrder': sortOrderFor7XX},\n  {'tag': '774', 'sortOrder': sortOrderFor7XX},\n  {'tag': '775', 'sortOrder': sortOrderFor7XX},\n  {'tag': '776', 'sortOrder': sortOrderFor7XX},\n  {'tag': '777', 'sortOrder': sortOrderFor7XX},\n  {'tag': '780', 'sortOrder': sortOrderFor7XX},\n  {'tag': '785', 'sortOrder': sortOrderFor7XX},\n  {'tag': '786', 'sortOrder': sortOrderFor7XX},\n  {'tag': '787', 'sortOrder': sortOrderFor7XX},\n  {'tag': '788', 'sortOrder': sortOrderFor7XX},\n  {'tag': '800', 'sortOrder': sortOrderForX00},\n  {'tag': '810', 'sortOrder': sortOrderForX10},\n  {'tag': '811', 'sortOrder': sortOrderForX11},\n  {'tag': '830', 'sortOrder': ['a', 'n', 'x', 'v']}, // INCOMPLETE, SAME AS 490? APPARENTLY NOT...\n  {'tag': '856', 'sortOrder': ['3', 'u', 'q', 'x', 'y', 'z', '5']}, // incomplete, LoC examples are inconclusive\n  {'tag': '880', 'sortOrder': ['a']},\n  {'tag': '946', 'sortOrder': sortOrderFor246},\n  {'tag': 'LOW', 'sortOrder': ['a', 'b', 'c', 'l', 'h']},\n  {'tag': 'SID', 'sortOrder': ['c', 'b']} // Hack, so that default order is not used\n];\n\nfunction getSubfieldSortOrder(field) {\n  const entry = subfieldSortOrder.filter(currEntry => field.tag === currEntry.tag);\n  if (entry.length > 0 && 'sortOrder' in entry[0]) {\n    debugDev(`sort order for ${field.tag}: ${entry[0].sortOrder}`);\n    return entry[0].sortOrder;\n  }\n  nvdebug(`WARNING!\\tNo subfield order found for ${field.tag}.`);\n  return [];\n}\n\n\nfunction swapSubfields(field, sortOrder) {\n  if (!field.subfields) {\n    return;\n  }\n\n  const loopAgain = field.subfields.some((sf, index) => {\n    if (index === 0) {\n      return false;\n    }\n    const currPos = getPosition(sf, sortOrder);\n    const prevPos = getPosition(field.subfields[index - 1], sortOrder);\n    if (currPos === -1 || prevPos === -1 || currPos >= prevPos) {\n      return false;\n    }\n    // Swap:\n    const tmp = field.subfields[index - 1];\n    field.subfields[index - 1] = sf;\n    field.subfields[index] = tmp;\n    return true;\n  });\n\n  if (loopAgain) {\n    return swapSubfields(field, sortOrder);\n  }\n\n  return;\n\n  function getPosition(subfield, sortOrder) {\n    // Magic exception that *always* comes first, used by Aleph in linking overlong fields\n    if (sortOrder.indexOf('9') > -1 && subfield.code === '9' && ['^', '^^'].includes(subfield.value)) {\n      return -0.5; // normal \"best value\" is 0, and \"worst value\" is N\n    }\n    return sortOrder.indexOf(subfield.code);\n  }\n}\n\n\nfunction twoBeforeZero(field) {\n  const sf2 = field.subfields.filter(sf => sf.code === '2');\n  if (sf2.length !== 1) {\n    return true; // both true and false are ok here\n  }\n  // MRA-465: gcipplatform (field 753)\n  // rdasco (344), creatorbio (353), gbd (668), lsch (eg. 385)\n  if (['creatorbio', 'gbd', 'gcipplatform', 'lscsh', 'rdasco'].includes(sf2[0].value)) {\n    return false;\n  }\n  return true;\n}\n\nfunction moveSubfield6ToTheFront(field) {\n  // https://www.loc.gov/marc/bibliographic/ecbdcntf.html says \"Subfield $6 is always the first subfield in the field.\"\n  const sf6s = field.subfields.filter(sf => sf.code === '6');\n  const others = field.subfields.filter(sf => sf.code !== '6');\n  field.subfields = [...sf6s, ...others];\n}\n\nexport function sortAdjacentSubfields(field, externalSortOrder = []) {\n  if (!field.subfields) {\n    return field;\n  }\n\n  moveSubfield6ToTheFront(field); // specs: \"Subfield $6 is always the first subfield in the field.\"\n\n  // Features:\n  // - Swap only sort adjacent pairs.\n  // - No sorting over unlisted subfield codes. Thus a given subfield can not shift to wrong side of 700$t...\n\n  // Implement: 880 field should use values from $6...\n\n  // Should we support multiple sort orders per field?\n\n  // Try to handle control subfield order. This is not 100% fool proof. Control subfields are pretty stable, though.\n  // However, there are exceptions (eg. $9 ^^ comes first and $2 $0 is a Finnish convention...)\n\n\n  const finnishWay = twoBeforeZero(field);\n\n  // Note: 760-789: '7' comes way earlier (after '6' and '8')\n  const controlSubfieldOrder = finnishWay ? ['8', '3', 'a', '4', '2', '0', '1', '7', '5', '9'] : ['8', '7', '3', 'a', '4', '0', '1', '2', '7', '5', '9'];\n  swapSubfields(field, controlSubfieldOrder);\n\n  const sortOrderForField = externalSortOrder.length > 0 ? externalSortOrder : getSubfieldSortOrder(field);\n  //nvdebug(`INTERMEDIATE SUBFIELD ORDER FOR ${field.tag}: ${sortOrderForField.join(', ')}`);\n\n  const defaultSortOrder = finnishWay ? defaultSortOrderFinns : defaultSortOrderOthers; // $2 vs $0\n  const subfieldOrder = sortOrderForField.length > 0 ? sortOrderForField : defaultSortOrder;\n  //nvdebug(`FINAL SUBFIELD ORDER (FINNISH=${finnishWay}) FOR ${field.tag}: ${subfieldOrder.join(', ')}`);\n  //if (sortOrder === null) { return field; } //// Currently always sort..\n  //nvdebug(`IN:  ${fieldToString(field)}`);\n  swapSubfields(field, subfieldOrder);\n  //nvdebug(`OUT: ${fieldToString(field)}`);\n\n  return field;\n}\n\n"],
+  "mappings": "AAEA,OAAO,WAAW;AAClB,OAAO,uBAAuB;AAC9B,SAAQ,eAAe,eAAc;AAErC,MAAM,QAAQ,kBAAkB,wDAAwD;AAExF,MAAM,WAAW,MAAM,OAAO,KAAK;AAEnC,MAAM,8BAA8B;AACpC,MAAM,+BAA+B;AAErC,MAAM,wBAAwB,4BAA4B,MAAM,EAAE;AAClE,MAAM,yBAAyB,6BAA6B,MAAM,EAAE;AAGpE,wBAAyB,mBAAmB;AAE1C,SAAO;AAAA,IACL,aAAa;AAAA,IACb;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,kBAAkB,QAAQ,YAAY;AAC7C,UAAM,aAAa,OAAO,OAAO,OAAO,OAAK,EAAE,SAAS;AACxD,QAAI,CAAC,YAAY;AACf,aAAO;AAAA,IACT;AAEA,UAAM,SAAS,IAAI,OAAO,YAAY,GAAG;AACzC,WAAO,WAAW,OAAO,OAAK,OAAO,KAAK,EAAE,GAAG,CAAC;AAAA,EAClD;AAEA,WAAS,IAAI,QAAQ,aAAa,mBAAmB;AACnD,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAE9C,UAAM,iBAAiB,kBAAkB,QAAQ,UAAU;AAE3D,mBAAe,QAAQ,WAAS;AAC9B,4BAAsB,KAAK;AAAA,IAC7B,CAAC;AAED,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ,aAAa,mBAAmB;AACxD,UAAM,MAAM,EAAC,SAAS,CAAC,EAAC;AAExB,UAAM,iBAAiB,kBAAkB,QAAQ,UAAU;AAE3D,mBAAe,QAAQ,WAAS;AAC9B,YAAM,cAAc,MAAM,KAAK;AAC/B,4BAAsB,WAAW;AACjC,YAAM,sBAAsB,cAAc,WAAW;AACrD,YAAM,gBAAgB,cAAc,KAAK;AACzC,UAAI,kBAAkB,qBAAqB;AACzC,YAAI,QAAQ,KAAK,mBAAmB;AAAA,MACtC;AAAA,IACF,CAAC;AAED,QAAI,QAAQ,EAAE,IAAI,QAAQ,UAAU;AACpC,WAAO;AAAA,EACT;AACF;AAKA,MAAM,kBAAkB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACjH,MAAM,kBAAkB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACvG,MAAM,kBAAkB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAC9E,MAAM,kBAAkB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACjH,MAAM,kBAAkB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AAG/D,MAAM,oBAAoB;AAAA,EACxB,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAChD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,GAAG,EAAC;AAAA;AAAA;AAAA,EAE3C,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAC/D,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA;AAAA,EACzE,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,GAAG,EAAC;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACrD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACnF,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAC/D,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,CAAC,GAAG,EAAC;AAAA,EACjC,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAC/D,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAChD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACrD,EAAC,OAAO,OAAO,aAAa,CAAC,GAAG,EAAC;AAAA,EACjC,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACrD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACxF,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAC/D,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EAChD,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA;AAAA,EAChD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA;AAAA,EAC/D,EAAC,OAAO,OAAO,aAAa,CAAC,GAAG,EAAC;AAAA,EACjC,EAAC,OAAO,OAAO,aAAa,gBAAe;AAAA,EAC3C,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA,EACrD,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,GAAG,EAAC;AAAA;AACxC;AAEA,SAAS,qBAAqB,OAAO;AACnC,QAAM,QAAQ,kBAAkB,OAAO,eAAa,MAAM,QAAQ,UAAU,GAAG;AAC/E,MAAI,MAAM,SAAS,KAAK,eAAe,MAAM,CAAC,GAAG;AAC/C,aAAS,kBAAkB,MAAM,GAAG,KAAK,MAAM,CAAC,EAAE,SAAS,EAAE;AAC7D,WAAO,MAAM,CAAC,EAAE;AAAA,EAClB;AACA,UAAQ,wCAAyC,MAAM,GAAG,GAAG;AAC7D,SAAO,CAAC;AACV;AAGA,SAAS,cAAc,OAAO,WAAW;AACvC,MAAI,CAAC,MAAM,WAAW;AACpB;AAAA,EACF;AAEA,QAAM,YAAY,MAAM,UAAU,KAAK,CAAC,IAAI,UAAU;AACpD,QAAI,UAAU,GAAG;AACf,aAAO;AAAA,IACT;AACA,UAAM,UAAU,YAAY,IAAI,SAAS;AACzC,UAAM,UAAU,YAAY,MAAM,UAAU,QAAQ,CAAC,GAAG,SAAS;AACjE,QAAI,YAAY,MAAM,YAAY,MAAM,WAAW,SAAS;AAC1D,aAAO;AAAA,IACT;AAEA,UAAM,MAAM,MAAM,UAAU,QAAQ,CAAC;AACrC,UAAM,UAAU,QAAQ,CAAC,IAAI;AAC7B,UAAM,UAAU,KAAK,IAAI;AACzB,WAAO;AAAA,EACT,CAAC;AAED,MAAI,WAAW;AACb,WAAO,cAAc,OAAO,SAAS;AAAA,EACvC;AAEA;AAEA,WAAS,YAAY,UAAUA,YAAW;AAExC,QAAIA,WAAU,QAAQ,GAAG,IAAI,MAAM,SAAS,SAAS,OAAO,CAAC,KAAK,IAAI,EAAE,SAAS,SAAS,KAAK,GAAG;AAChG,aAAO;AAAA,IACT;AACA,WAAOA,WAAU,QAAQ,SAAS,IAAI;AAAA,EACxC;AACF;AAGA,SAAS,cAAc,OAAO;AAC5B,QAAM,MAAM,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AACxD,MAAI,IAAI,WAAW,GAAG;AACpB,WAAO;AAAA,EACT;AAGA,MAAI,CAAC,cAAc,OAAO,gBAAgB,SAAS,QAAQ,EAAE,SAAS,IAAI,CAAC,EAAE,KAAK,GAAG;AACnF,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,wBAAwB,OAAO;AAEtC,QAAM,OAAO,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AACzD,QAAM,SAAS,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AAC3D,QAAM,YAAY,CAAC,GAAG,MAAM,GAAG,MAAM;AACvC;AAEO,gBAAS,sBAAsB,OAAO,oBAAoB,CAAC,GAAG;AACnE,MAAI,CAAC,MAAM,WAAW;AACpB,WAAO;AAAA,EACT;AAEA,0BAAwB,KAAK;AAc7B,QAAM,aAAa,cAAc,KAAK;AAGtC,QAAM,uBAAuB,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,IAAI,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACrJ,gBAAc,OAAO,oBAAoB;AAEzC,QAAM,oBAAoB,kBAAkB,SAAS,IAAI,oBAAoB,qBAAqB,KAAK;AAGvG,QAAM,mBAAmB,aAAa,wBAAwB;AAC9D,QAAM,gBAAgB,kBAAkB,SAAS,IAAI,oBAAoB;AAIzE,gBAAc,OAAO,aAAa;AAGlC,SAAO;AACT;",
   "names": ["sortOrder"]
 }

package/dist/utils.js

@@ -171,4 +171,10 @@ export function hasCopyright(value) {
   const modValue = removeCopyright(value);
   return value !== modValue;
 }
+export function subfieldArraysContainSameData(arr1, arr2) {
+  if (!arr1.every((sf) => arr2.some((sf2) => subfieldsAreIdentical(sf, sf2)))) {
+    return false;
+  }
+  return arr2.every((sf2) => arr1.some((sf) => subfieldsAreIdentical(sf, sf2)));
+}
 //# sourceMappingURL=utils.js.map

package/dist/utils.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/utils.js"],
-  "sourcesContent": ["import createDebugLogger from 'debug';\n\n//import fs from 'fs';\n//import path from 'path';\n\nconst debug = createDebugLogger('@natlibfi/melinda-marc-record-merge-reducers:utils');\n//const debugData = debug.extend('data');\nconst debugDev = debug.extend('dev');\n\nimport {melindaFieldSpecs} from './melindaCustomMergeFields.js';\n\n//JSON.parse(fs.readFileSync(path.join(__dirname, '..', 'src', 'melindaCustomMergeFields.json'), 'utf8'));\n\nexport function isElectronicMaterial(record) {\n  const f337s = record.get('337');\n\n  return f337s.length > 0 && f337s.some(f => fieldHasSubfield(f, 'b', 'c') && fieldHasSubfield(f, '2', 'rdamedia'));\n}\n\nexport function nvdebug(message, func = undefined) {\n  if (func) {\n    func(message);\n  }\n  //console.info(message); // eslint-disable-line no-console\n}\n\nexport function fieldHasSubfield(field, subfieldCode, subfieldValue = null) {\n  if (!field.subfields) {\n    return false;\n  }\n  if (subfieldValue === null) {\n    return field.subfields.some(sf => sf.code === subfieldCode);\n  }\n  return field.subfields.some(sf => sf.code === subfieldCode && subfieldValue === sf.value);\n}\n\nexport function subfieldToString(sf) {\n  if (!sf.value) {\n    return `\u2021${sf.code}`;\n  }\n  return `\u2021${sf.code} ${sf.value}`;\n}\n\nfunction normalizeIndicatorValue(val) {\n  if (val === ' ') {\n    return '#';\n  }\n  return val;\n}\n\nexport function recordToString(record) {\n  const ldr = `LDR   ${record.leader}`;\n  const fields = record.fields.map(f => fieldToString(f));\n  return `${ldr}\\n${fields.join('\\n')}`;\n}\n\nexport function removeSubfield(record, tag, subfieldCode) {\n  record.fields = record.fields.map(field => {\n    if (field.tag !== tag || !field.subfields) { // Don't procss irrelevant fields\n      return field;\n    }\n    field.subfields = field.subfields.filter(sf => sf.code !== subfieldCode);\n    if (field.subfields.length === 0) {\n      return false;\n    }\n    return field;\n  }).filter(field => field);\n}\n\nexport function recordRemoveValuelessSubfields(record) {\n  record.fields = record.fields.map(field => {\n    if (!field.subfields) { // Keep control fields\n      return field;\n    }\n    // Remove empty subfields from datafields:\n    field.subfields = field.subfields.filter(sf => sf.value);\n\n    if (field.subfields && field.subfields.length === 0) {\n      return false; // Return false instead of a field if field has no subfields left. These will soon be filtered out.\n    }\n\n    return field; //if field has subfields return it\n  }).filter(field => field); // Filter those falses out\n}\n\nexport function fieldToString(f) {\n  if ('subfields' in f) {\n    return `${f.tag} ${normalizeIndicatorValue(f.ind1)}${normalizeIndicatorValue(f.ind2)}${formatSubfields(f)}`;\n  }\n  return `${f.tag}    ${f.value}`;\n\n  function formatSubfields(field) {\n    return field.subfields.map(sf => ` ${subfieldToString(sf)}`).join('');\n  }\n}\n\nexport function fieldsToString(fields) {\n  return fields.map(f => fieldToString(f)).join('\\t__SEPARATOR__\\t');\n}\n\nexport function nvdebugFieldArray(fields, prefix = '  ', func = undefined) {\n  fields.forEach(field => nvdebug(`${prefix}${fieldToString(field)}`, func));\n}\n\nexport function isControlSubfieldCode(subfieldCode) {\n  if (['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'w'].includes(subfieldCode)) {\n    return true;\n  }\n  return false;\n}\n\nexport function getCatalogingLanguage(record, defaultCatalogingLanguage = undefined) {\n  const [field040] = record.get(/^040$/u);\n  if (!field040) {\n    return defaultCatalogingLanguage;\n  }\n  const [b] = field040.subfields.filter(sf => sf.code === 'b');\n  if (!b) {\n    return defaultCatalogingLanguage;\n  }\n  return b.value;\n}\n\n\nexport function uniqArray(arr) {\n  return arr.filter((val, i) => arr.indexOf(val) === i);\n}\n\nexport function fieldsAreIdentical(field1, field2) {\n  if (field1.tag !== field2.tag) { // NB! We are skipping normalizations here on purpose! They should be done beforehand...\n    return false;\n  }\n  return fieldToString(field1) === fieldToString(field2);\n\n  // The order of subfields is relevant! Bloody JS idiotisms make people use conditions such as:\n  // return field1.subfields.every(sf => field2.subfields.some(sf2 => sf.code === sf2.code && sf.value === sf2.value));\n}\n\nexport function fieldHasNSubfields(field, subfieldCode/*, subfieldValue = null*/) {\n  const relevantSubfields = field.subfields.filter(sf => sf.code === subfieldCode);\n  //if (subfieldValue === null) {\n  return relevantSubfields.length;\n  //}\n  //const subset = relevantSubfields.filter(value => value === subfieldValue);\n  //return subset.length;\n}\n\nexport function removeCopyright(value) {\n  return value.replace(/^(?:c|p|\u00A9|\u2117|Cop\\. ?) ?((?:1[0-9][0-9][0-9]|20[012][0-9])\\.?)$/ui, '$1');\n}\n\nfunction isNonStandardNonrepeatableSubfield(tag, subfieldCode) {\n  // Put these into config or so...\n  if (tag === '264') {\n    return ['a', 'b', 'c'].includes(subfieldCode);\n  }\n\n  if (['336', '337', '338'].includes(tag)) {\n    return ['a', 'b', '2'].includes(subfieldCode);\n  }\n\n  return false;\n}\n\n\nexport function subfieldIsRepeatable(tag, subfieldCode) {\n\n  if (isNonStandardNonrepeatableSubfield(tag, subfieldCode)) {\n    return false;\n  }\n\n  // These we know or \"know\":\n  // NB! $5 is (according to MARC21 format) non-repeatable, and not usable in all fields, but Melinda has a local exception to this, see MET-300\n  if ('0159'.indexOf(subfieldCode) > -1) {\n    // Uh, can $0 appear on any field?\n    return true;\n  }\n\n  const fieldSpecs = melindaFieldSpecs.fields.filter(field => field.tag === tag);\n  if (fieldSpecs.length !== 1) {\n    nvdebug(` WARNING! Getting field ${tag} data failed! ${fieldSpecs.length} hits. Default value true is used for'${subfieldCode}' .`, debugDev);\n    return true;\n  }\n\n  const subfieldSpecs = fieldSpecs[0].subfields.filter(subfield => subfield.code === subfieldCode);\n  // Currently we don't support multiple $6 fields due to re-indexing limitations...\n  // Well, $6 is non-repeatable, isn't it?!?\n  // (This might actually already be fixed... Marginal issue, but check eventually.)\n  if (subfieldSpecs.length !== 1 || subfieldCode === '6') {\n    return false; // repeatable if not specified, I guess. Maybe add log or warn?\n  }\n  return subfieldSpecs[0].repeatable;\n}\n\nfunction marc21GetTagsLegalIndicators(tag) {\n  const fieldSpecs = melindaFieldSpecs.fields.filter(field => field.tag === tag);\n  if (fieldSpecs.length === 0) {\n    return undefined;\n  }\n  return fieldSpecs[0].indicators;\n}\n\nexport function marc21GetTagsLegalInd1Value(tag) {\n  const indicator = marc21GetTagsLegalIndicators(tag);\n  if (indicator === undefined) {\n    return undefined;\n  }\n  return indicator.ind1;\n}\n\nexport function marc21GetTagsLegalInd2Value(tag) {\n  const indicator = marc21GetTagsLegalIndicators(tag);\n  if (indicator === undefined) {\n    return undefined;\n  }\n  return indicator.ind2;\n}\n\nexport function nvdebugSubfieldArray(subfields, prefix = '  ', func = undefined) {\n  subfields.forEach(subfield => nvdebug(`${prefix}${subfieldToString(subfield)}`, func));\n}\n\nexport function subfieldsAreIdentical(subfieldA, subfieldB) {\n  return subfieldA.code === subfieldB.code && subfieldA.value === subfieldB.value;\n}\n\nexport function fieldHasMultipleSubfields(field, subfieldCode/*, subfieldValue = null*/) {\n  return fieldHasNSubfields(field, subfieldCode) > 1;\n}\n\nexport function hasCopyright(value) {\n  const modValue = removeCopyright(value);\n  return value !== modValue;\n}\n"],
-  "mappings": "AAAA,OAAO,uBAAuB;AAK9B,MAAM,QAAQ,kBAAkB,oDAAoD;AAEpF,MAAM,WAAW,MAAM,OAAO,KAAK;AAEnC,SAAQ,yBAAwB;AAIzB,gBAAS,qBAAqB,QAAQ;AAC3C,QAAM,QAAQ,OAAO,IAAI,KAAK;AAE9B,SAAO,MAAM,SAAS,KAAK,MAAM,KAAK,OAAK,iBAAiB,GAAG,KAAK,GAAG,KAAK,iBAAiB,GAAG,KAAK,UAAU,CAAC;AAClH;AAEO,gBAAS,QAAQ,SAAS,OAAO,QAAW;AACjD,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EACd;AAEF;AAEO,gBAAS,iBAAiB,OAAO,cAAc,gBAAgB,MAAM;AAC1E,MAAI,CAAC,MAAM,WAAW;AACpB,WAAO;AAAA,EACT;AACA,MAAI,kBAAkB,MAAM;AAC1B,WAAO,MAAM,UAAU,KAAK,QAAM,GAAG,SAAS,YAAY;AAAA,EAC5D;AACA,SAAO,MAAM,UAAU,KAAK,QAAM,GAAG,SAAS,gBAAgB,kBAAkB,GAAG,KAAK;AAC1F;AAEO,gBAAS,iBAAiB,IAAI;AACnC,MAAI,CAAC,GAAG,OAAO;AACb,WAAO,SAAI,GAAG,IAAI;AAAA,EACpB;AACA,SAAO,SAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAChC;AAEA,SAAS,wBAAwB,KAAK;AACpC,MAAI,QAAQ,KAAK;AACf,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEO,gBAAS,eAAe,QAAQ;AACrC,QAAM,MAAM,SAAS,OAAO,MAAM;AAClC,QAAM,SAAS,OAAO,OAAO,IAAI,OAAK,cAAc,CAAC,CAAC;AACtD,SAAO,GAAG,GAAG;AAAA,EAAK,OAAO,KAAK,IAAI,CAAC;AACrC;AAEO,gBAAS,eAAe,QAAQ,KAAK,cAAc;AACxD,SAAO,SAAS,OAAO,OAAO,IAAI,WAAS;AACzC,QAAI,MAAM,QAAQ,OAAO,CAAC,MAAM,WAAW;AACzC,aAAO;AAAA,IACT;AACA,UAAM,YAAY,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,YAAY;AACvE,QAAI,MAAM,UAAU,WAAW,GAAG;AAChC,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT,CAAC,EAAE,OAAO,WAAS,KAAK;AAC1B;AAEO,gBAAS,+BAA+B,QAAQ;AACrD,SAAO,SAAS,OAAO,OAAO,IAAI,WAAS;AACzC,QAAI,CAAC,MAAM,WAAW;AACpB,aAAO;AAAA,IACT;AAEA,UAAM,YAAY,MAAM,UAAU,OAAO,QAAM,GAAG,KAAK;AAEvD,QAAI,MAAM,aAAa,MAAM,UAAU,WAAW,GAAG;AACnD,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT,CAAC,EAAE,OAAO,WAAS,KAAK;AAC1B;AAEO,gBAAS,cAAc,GAAG;AAC/B,MAAI,eAAe,GAAG;AACpB,WAAO,GAAG,EAAE,GAAG,IAAI,wBAAwB,EAAE,IAAI,CAAC,GAAG,wBAAwB,EAAE,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC;AAAA,EAC3G;AACA,SAAO,GAAG,EAAE,GAAG,OAAO,EAAE,KAAK;AAE7B,WAAS,gBAAgB,OAAO;AAC9B,WAAO,MAAM,UAAU,IAAI,QAAM,IAAI,iBAAiB,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE;AAAA,EACtE;AACF;AAEO,gBAAS,eAAe,QAAQ;AACrC,SAAO,OAAO,IAAI,OAAK,cAAc,CAAC,CAAC,EAAE,KAAK,iBAAmB;AACnE;AAEO,gBAAS,kBAAkB,QAAQ,SAAS,MAAM,OAAO,QAAW;AACzE,SAAO,QAAQ,WAAS,QAAQ,GAAG,MAAM,GAAG,cAAc,KAAK,CAAC,IAAI,IAAI,CAAC;AAC3E;AAEO,gBAAS,sBAAsB,cAAc;AAClD,MAAI,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAE,SAAS,YAAY,GAAG;AAClF,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEO,gBAAS,sBAAsB,QAAQ,4BAA4B,QAAW;AACnF,QAAM,CAAC,QAAQ,IAAI,OAAO,IAAI,QAAQ;AACtC,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,EACT;AACA,QAAM,CAAC,CAAC,IAAI,SAAS,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AAC3D,MAAI,CAAC,GAAG;AACN,WAAO;AAAA,EACT;AACA,SAAO,EAAE;AACX;AAGO,gBAAS,UAAU,KAAK;AAC7B,SAAO,IAAI,OAAO,CAAC,KAAK,MAAM,IAAI,QAAQ,GAAG,MAAM,CAAC;AACtD;AAEO,gBAAS,mBAAmB,QAAQ,QAAQ;AACjD,MAAI,OAAO,QAAQ,OAAO,KAAK;AAC7B,WAAO;AAAA,EACT;AACA,SAAO,cAAc,MAAM,MAAM,cAAc,MAAM;AAIvD;AAEO,gBAAS,mBAAmB,OAAO,cAAwC;AAChF,QAAM,oBAAoB,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,YAAY;AAE/E,SAAO,kBAAkB;AAI3B;AAEO,gBAAS,gBAAgB,OAAO;AACrC,SAAO,MAAM,QAAQ,mEAAmE,IAAI;AAC9F;AAEA,SAAS,mCAAmC,KAAK,cAAc;AAE7D,MAAI,QAAQ,OAAO;AACjB,WAAO,CAAC,KAAK,KAAK,GAAG,EAAE,SAAS,YAAY;AAAA,EAC9C;AAEA,MAAI,CAAC,OAAO,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG;AACvC,WAAO,CAAC,KAAK,KAAK,GAAG,EAAE,SAAS,YAAY;AAAA,EAC9C;AAEA,SAAO;AACT;AAGO,gBAAS,qBAAqB,KAAK,cAAc;AAEtD,MAAI,mCAAmC,KAAK,YAAY,GAAG;AACzD,WAAO;AAAA,EACT;AAIA,MAAI,OAAO,QAAQ,YAAY,IAAI,IAAI;AAErC,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,kBAAkB,OAAO,OAAO,WAAS,MAAM,QAAQ,GAAG;AAC7E,MAAI,WAAW,WAAW,GAAG;AAC3B,YAAQ,2BAA2B,GAAG,iBAAiB,WAAW,MAAM,yCAAyC,YAAY,OAAO,QAAQ;AAC5I,WAAO;AAAA,EACT;AAEA,QAAM,gBAAgB,WAAW,CAAC,EAAE,UAAU,OAAO,cAAY,SAAS,SAAS,YAAY;AAI/F,MAAI,cAAc,WAAW,KAAK,iBAAiB,KAAK;AACtD,WAAO;AAAA,EACT;AACA,SAAO,cAAc,CAAC,EAAE;AAC1B;AAEA,SAAS,6BAA6B,KAAK;AACzC,QAAM,aAAa,kBAAkB,OAAO,OAAO,WAAS,MAAM,QAAQ,GAAG;AAC7E,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;AAAA,EACT;AACA,SAAO,WAAW,CAAC,EAAE;AACvB;AAEO,gBAAS,4BAA4B,KAAK;AAC/C,QAAM,YAAY,6BAA6B,GAAG;AAClD,MAAI,cAAc,QAAW;AAC3B,WAAO;AAAA,EACT;AACA,SAAO,UAAU;AACnB;AAEO,gBAAS,4BAA4B,KAAK;AAC/C,QAAM,YAAY,6BAA6B,GAAG;AAClD,MAAI,cAAc,QAAW;AAC3B,WAAO;AAAA,EACT;AACA,SAAO,UAAU;AACnB;AAEO,gBAAS,qBAAqB,WAAW,SAAS,MAAM,OAAO,QAAW;AAC/E,YAAU,QAAQ,cAAY,QAAQ,GAAG,MAAM,GAAG,iBAAiB,QAAQ,CAAC,IAAI,IAAI,CAAC;AACvF;AAEO,gBAAS,sBAAsB,WAAW,WAAW;AAC1D,SAAO,UAAU,SAAS,UAAU,QAAQ,UAAU,UAAU,UAAU;AAC5E;AAEO,gBAAS,0BAA0B,OAAO,cAAwC;AACvF,SAAO,mBAAmB,OAAO,YAAY,IAAI;AACnD;AAEO,gBAAS,aAAa,OAAO;AAClC,QAAM,WAAW,gBAAgB,KAAK;AACtC,SAAO,UAAU;AACnB;",
+  "sourcesContent": ["import createDebugLogger from 'debug';\n\n//import fs from 'fs';\n//import path from 'path';\n\nconst debug = createDebugLogger('@natlibfi/melinda-marc-record-merge-reducers:utils');\n//const debugData = debug.extend('data');\nconst debugDev = debug.extend('dev');\n\nimport {melindaFieldSpecs} from './melindaCustomMergeFields.js';\n\n//JSON.parse(fs.readFileSync(path.join(__dirname, '..', 'src', 'melindaCustomMergeFields.json'), 'utf8'));\n\nexport function isElectronicMaterial(record) {\n  const f337s = record.get('337');\n\n  return f337s.length > 0 && f337s.some(f => fieldHasSubfield(f, 'b', 'c') && fieldHasSubfield(f, '2', 'rdamedia'));\n}\n\nexport function nvdebug(message, func = undefined) {\n  if (func) {\n    func(message);\n  }\n  //console.info(message); // eslint-disable-line no-console\n}\n\nexport function fieldHasSubfield(field, subfieldCode, subfieldValue = null) {\n  if (!field.subfields) {\n    return false;\n  }\n  if (subfieldValue === null) {\n    return field.subfields.some(sf => sf.code === subfieldCode);\n  }\n  return field.subfields.some(sf => sf.code === subfieldCode && subfieldValue === sf.value);\n}\n\nexport function subfieldToString(sf) {\n  if (!sf.value) {\n    return `\u2021${sf.code}`;\n  }\n  return `\u2021${sf.code} ${sf.value}`;\n}\n\nfunction normalizeIndicatorValue(val) {\n  if (val === ' ') {\n    return '#';\n  }\n  return val;\n}\n\nexport function recordToString(record) {\n  const ldr = `LDR   ${record.leader}`;\n  const fields = record.fields.map(f => fieldToString(f));\n  return `${ldr}\\n${fields.join('\\n')}`;\n}\n\nexport function removeSubfield(record, tag, subfieldCode) {\n  record.fields = record.fields.map(field => {\n    if (field.tag !== tag || !field.subfields) { // Don't procss irrelevant fields\n      return field;\n    }\n    field.subfields = field.subfields.filter(sf => sf.code !== subfieldCode);\n    if (field.subfields.length === 0) {\n      return false;\n    }\n    return field;\n  }).filter(field => field);\n}\n\nexport function recordRemoveValuelessSubfields(record) {\n  record.fields = record.fields.map(field => {\n    if (!field.subfields) { // Keep control fields\n      return field;\n    }\n    // Remove empty subfields from datafields:\n    field.subfields = field.subfields.filter(sf => sf.value);\n\n    if (field.subfields && field.subfields.length === 0) {\n      return false; // Return false instead of a field if field has no subfields left. These will soon be filtered out.\n    }\n\n    return field; //if field has subfields return it\n  }).filter(field => field); // Filter those falses out\n}\n\nexport function fieldToString(f) {\n  if ('subfields' in f) {\n    return `${f.tag} ${normalizeIndicatorValue(f.ind1)}${normalizeIndicatorValue(f.ind2)}${formatSubfields(f)}`;\n  }\n  return `${f.tag}    ${f.value}`;\n\n  function formatSubfields(field) {\n    return field.subfields.map(sf => ` ${subfieldToString(sf)}`).join('');\n  }\n}\n\nexport function fieldsToString(fields) {\n  return fields.map(f => fieldToString(f)).join('\\t__SEPARATOR__\\t');\n}\n\nexport function nvdebugFieldArray(fields, prefix = '  ', func = undefined) {\n  fields.forEach(field => nvdebug(`${prefix}${fieldToString(field)}`, func));\n}\n\nexport function isControlSubfieldCode(subfieldCode) {\n  if (['0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'w'].includes(subfieldCode)) {\n    return true;\n  }\n  return false;\n}\n\nexport function getCatalogingLanguage(record, defaultCatalogingLanguage = undefined) {\n  const [field040] = record.get(/^040$/u);\n  if (!field040) {\n    return defaultCatalogingLanguage;\n  }\n  const [b] = field040.subfields.filter(sf => sf.code === 'b');\n  if (!b) {\n    return defaultCatalogingLanguage;\n  }\n  return b.value;\n}\n\n\nexport function uniqArray(arr) {\n  return arr.filter((val, i) => arr.indexOf(val) === i);\n}\n\nexport function fieldsAreIdentical(field1, field2) {\n  if (field1.tag !== field2.tag) { // NB! We are skipping normalizations here on purpose! They should be done beforehand...\n    return false;\n  }\n  return fieldToString(field1) === fieldToString(field2);\n\n  // The order of subfields is relevant! Bloody JS idiotisms make people use conditions such as:\n  // return field1.subfields.every(sf => field2.subfields.some(sf2 => sf.code === sf2.code && sf.value === sf2.value));\n}\n\nexport function fieldHasNSubfields(field, subfieldCode/*, subfieldValue = null*/) {\n  const relevantSubfields = field.subfields.filter(sf => sf.code === subfieldCode);\n  //if (subfieldValue === null) {\n  return relevantSubfields.length;\n  //}\n  //const subset = relevantSubfields.filter(value => value === subfieldValue);\n  //return subset.length;\n}\n\nexport function removeCopyright(value) {\n  return value.replace(/^(?:c|p|\u00A9|\u2117|Cop\\. ?) ?((?:1[0-9][0-9][0-9]|20[012][0-9])\\.?)$/ui, '$1');\n}\n\nfunction isNonStandardNonrepeatableSubfield(tag, subfieldCode) {\n  // Put these into config or so...\n  if (tag === '264') {\n    return ['a', 'b', 'c'].includes(subfieldCode);\n  }\n\n  if (['336', '337', '338'].includes(tag)) {\n    return ['a', 'b', '2'].includes(subfieldCode);\n  }\n\n  return false;\n}\n\n\nexport function subfieldIsRepeatable(tag, subfieldCode) {\n\n  if (isNonStandardNonrepeatableSubfield(tag, subfieldCode)) {\n    return false;\n  }\n\n  // These we know or \"know\":\n  // NB! $5 is (according to MARC21 format) non-repeatable, and not usable in all fields, but Melinda has a local exception to this, see MET-300\n  if ('0159'.indexOf(subfieldCode) > -1) {\n    // Uh, can $0 appear on any field?\n    return true;\n  }\n\n  const fieldSpecs = melindaFieldSpecs.fields.filter(field => field.tag === tag);\n  if (fieldSpecs.length !== 1) {\n    nvdebug(` WARNING! Getting field ${tag} data failed! ${fieldSpecs.length} hits. Default value true is used for'${subfieldCode}' .`, debugDev);\n    return true;\n  }\n\n  const subfieldSpecs = fieldSpecs[0].subfields.filter(subfield => subfield.code === subfieldCode);\n  // Currently we don't support multiple $6 fields due to re-indexing limitations...\n  // Well, $6 is non-repeatable, isn't it?!?\n  // (This might actually already be fixed... Marginal issue, but check eventually.)\n  if (subfieldSpecs.length !== 1 || subfieldCode === '6') {\n    return false; // repeatable if not specified, I guess. Maybe add log or warn?\n  }\n  return subfieldSpecs[0].repeatable;\n}\n\nfunction marc21GetTagsLegalIndicators(tag) {\n  const fieldSpecs = melindaFieldSpecs.fields.filter(field => field.tag === tag);\n  if (fieldSpecs.length === 0) {\n    return undefined;\n  }\n  return fieldSpecs[0].indicators;\n}\n\nexport function marc21GetTagsLegalInd1Value(tag) {\n  const indicator = marc21GetTagsLegalIndicators(tag);\n  if (indicator === undefined) {\n    return undefined;\n  }\n  return indicator.ind1;\n}\n\nexport function marc21GetTagsLegalInd2Value(tag) {\n  const indicator = marc21GetTagsLegalIndicators(tag);\n  if (indicator === undefined) {\n    return undefined;\n  }\n  return indicator.ind2;\n}\n\nexport function nvdebugSubfieldArray(subfields, prefix = '  ', func = undefined) {\n  subfields.forEach(subfield => nvdebug(`${prefix}${subfieldToString(subfield)}`, func));\n}\n\nexport function subfieldsAreIdentical(subfieldA, subfieldB) {\n  return subfieldA.code === subfieldB.code && subfieldA.value === subfieldB.value;\n}\n\nexport function fieldHasMultipleSubfields(field, subfieldCode/*, subfieldValue = null*/) {\n  return fieldHasNSubfields(field, subfieldCode) > 1;\n}\n\nexport function hasCopyright(value) {\n  const modValue = removeCopyright(value);\n  return value !== modValue;\n}\n\n\n\nexport function subfieldArraysContainSameData(arr1, arr2) {\n  if ( !arr1.every(sf => arr2.some(sf2 => subfieldsAreIdentical(sf, sf2))) ) {\n    return false;\n  }\n\n  return arr2.every(sf2 => arr1.some(sf => subfieldsAreIdentical(sf, sf2)));\n}"],
+  "mappings": "AAAA,OAAO,uBAAuB;AAK9B,MAAM,QAAQ,kBAAkB,oDAAoD;AAEpF,MAAM,WAAW,MAAM,OAAO,KAAK;AAEnC,SAAQ,yBAAwB;AAIzB,gBAAS,qBAAqB,QAAQ;AAC3C,QAAM,QAAQ,OAAO,IAAI,KAAK;AAE9B,SAAO,MAAM,SAAS,KAAK,MAAM,KAAK,OAAK,iBAAiB,GAAG,KAAK,GAAG,KAAK,iBAAiB,GAAG,KAAK,UAAU,CAAC;AAClH;AAEO,gBAAS,QAAQ,SAAS,OAAO,QAAW;AACjD,MAAI,MAAM;AACR,SAAK,OAAO;AAAA,EACd;AAEF;AAEO,gBAAS,iBAAiB,OAAO,cAAc,gBAAgB,MAAM;AAC1E,MAAI,CAAC,MAAM,WAAW;AACpB,WAAO;AAAA,EACT;AACA,MAAI,kBAAkB,MAAM;AAC1B,WAAO,MAAM,UAAU,KAAK,QAAM,GAAG,SAAS,YAAY;AAAA,EAC5D;AACA,SAAO,MAAM,UAAU,KAAK,QAAM,GAAG,SAAS,gBAAgB,kBAAkB,GAAG,KAAK;AAC1F;AAEO,gBAAS,iBAAiB,IAAI;AACnC,MAAI,CAAC,GAAG,OAAO;AACb,WAAO,SAAI,GAAG,IAAI;AAAA,EACpB;AACA,SAAO,SAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAChC;AAEA,SAAS,wBAAwB,KAAK;AACpC,MAAI,QAAQ,KAAK;AACf,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEO,gBAAS,eAAe,QAAQ;AACrC,QAAM,MAAM,SAAS,OAAO,MAAM;AAClC,QAAM,SAAS,OAAO,OAAO,IAAI,OAAK,cAAc,CAAC,CAAC;AACtD,SAAO,GAAG,GAAG;AAAA,EAAK,OAAO,KAAK,IAAI,CAAC;AACrC;AAEO,gBAAS,eAAe,QAAQ,KAAK,cAAc;AACxD,SAAO,SAAS,OAAO,OAAO,IAAI,WAAS;AACzC,QAAI,MAAM,QAAQ,OAAO,CAAC,MAAM,WAAW;AACzC,aAAO;AAAA,IACT;AACA,UAAM,YAAY,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,YAAY;AACvE,QAAI,MAAM,UAAU,WAAW,GAAG;AAChC,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT,CAAC,EAAE,OAAO,WAAS,KAAK;AAC1B;AAEO,gBAAS,+BAA+B,QAAQ;AACrD,SAAO,SAAS,OAAO,OAAO,IAAI,WAAS;AACzC,QAAI,CAAC,MAAM,WAAW;AACpB,aAAO;AAAA,IACT;AAEA,UAAM,YAAY,MAAM,UAAU,OAAO,QAAM,GAAG,KAAK;AAEvD,QAAI,MAAM,aAAa,MAAM,UAAU,WAAW,GAAG;AACnD,aAAO;AAAA,IACT;AAEA,WAAO;AAAA,EACT,CAAC,EAAE,OAAO,WAAS,KAAK;AAC1B;AAEO,gBAAS,cAAc,GAAG;AAC/B,MAAI,eAAe,GAAG;AACpB,WAAO,GAAG,EAAE,GAAG,IAAI,wBAAwB,EAAE,IAAI,CAAC,GAAG,wBAAwB,EAAE,IAAI,CAAC,GAAG,gBAAgB,CAAC,CAAC;AAAA,EAC3G;AACA,SAAO,GAAG,EAAE,GAAG,OAAO,EAAE,KAAK;AAE7B,WAAS,gBAAgB,OAAO;AAC9B,WAAO,MAAM,UAAU,IAAI,QAAM,IAAI,iBAAiB,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE;AAAA,EACtE;AACF;AAEO,gBAAS,eAAe,QAAQ;AACrC,SAAO,OAAO,IAAI,OAAK,cAAc,CAAC,CAAC,EAAE,KAAK,iBAAmB;AACnE;AAEO,gBAAS,kBAAkB,QAAQ,SAAS,MAAM,OAAO,QAAW;AACzE,SAAO,QAAQ,WAAS,QAAQ,GAAG,MAAM,GAAG,cAAc,KAAK,CAAC,IAAI,IAAI,CAAC;AAC3E;AAEO,gBAAS,sBAAsB,cAAc;AAClD,MAAI,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAE,SAAS,YAAY,GAAG;AAClF,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEO,gBAAS,sBAAsB,QAAQ,4BAA4B,QAAW;AACnF,QAAM,CAAC,QAAQ,IAAI,OAAO,IAAI,QAAQ;AACtC,MAAI,CAAC,UAAU;AACb,WAAO;AAAA,EACT;AACA,QAAM,CAAC,CAAC,IAAI,SAAS,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AAC3D,MAAI,CAAC,GAAG;AACN,WAAO;AAAA,EACT;AACA,SAAO,EAAE;AACX;AAGO,gBAAS,UAAU,KAAK;AAC7B,SAAO,IAAI,OAAO,CAAC,KAAK,MAAM,IAAI,QAAQ,GAAG,MAAM,CAAC;AACtD;AAEO,gBAAS,mBAAmB,QAAQ,QAAQ;AACjD,MAAI,OAAO,QAAQ,OAAO,KAAK;AAC7B,WAAO;AAAA,EACT;AACA,SAAO,cAAc,MAAM,MAAM,cAAc,MAAM;AAIvD;AAEO,gBAAS,mBAAmB,OAAO,cAAwC;AAChF,QAAM,oBAAoB,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,YAAY;AAE/E,SAAO,kBAAkB;AAI3B;AAEO,gBAAS,gBAAgB,OAAO;AACrC,SAAO,MAAM,QAAQ,mEAAmE,IAAI;AAC9F;AAEA,SAAS,mCAAmC,KAAK,cAAc;AAE7D,MAAI,QAAQ,OAAO;AACjB,WAAO,CAAC,KAAK,KAAK,GAAG,EAAE,SAAS,YAAY;AAAA,EAC9C;AAEA,MAAI,CAAC,OAAO,OAAO,KAAK,EAAE,SAAS,GAAG,GAAG;AACvC,WAAO,CAAC,KAAK,KAAK,GAAG,EAAE,SAAS,YAAY;AAAA,EAC9C;AAEA,SAAO;AACT;AAGO,gBAAS,qBAAqB,KAAK,cAAc;AAEtD,MAAI,mCAAmC,KAAK,YAAY,GAAG;AACzD,WAAO;AAAA,EACT;AAIA,MAAI,OAAO,QAAQ,YAAY,IAAI,IAAI;AAErC,WAAO;AAAA,EACT;AAEA,QAAM,aAAa,kBAAkB,OAAO,OAAO,WAAS,MAAM,QAAQ,GAAG;AAC7E,MAAI,WAAW,WAAW,GAAG;AAC3B,YAAQ,2BAA2B,GAAG,iBAAiB,WAAW,MAAM,yCAAyC,YAAY,OAAO,QAAQ;AAC5I,WAAO;AAAA,EACT;AAEA,QAAM,gBAAgB,WAAW,CAAC,EAAE,UAAU,OAAO,cAAY,SAAS,SAAS,YAAY;AAI/F,MAAI,cAAc,WAAW,KAAK,iBAAiB,KAAK;AACtD,WAAO;AAAA,EACT;AACA,SAAO,cAAc,CAAC,EAAE;AAC1B;AAEA,SAAS,6BAA6B,KAAK;AACzC,QAAM,aAAa,kBAAkB,OAAO,OAAO,WAAS,MAAM,QAAQ,GAAG;AAC7E,MAAI,WAAW,WAAW,GAAG;AAC3B,WAAO;AAAA,EACT;AACA,SAAO,WAAW,CAAC,EAAE;AACvB;AAEO,gBAAS,4BAA4B,KAAK;AAC/C,QAAM,YAAY,6BAA6B,GAAG;AAClD,MAAI,cAAc,QAAW;AAC3B,WAAO;AAAA,EACT;AACA,SAAO,UAAU;AACnB;AAEO,gBAAS,4BAA4B,KAAK;AAC/C,QAAM,YAAY,6BAA6B,GAAG;AAClD,MAAI,cAAc,QAAW;AAC3B,WAAO;AAAA,EACT;AACA,SAAO,UAAU;AACnB;AAEO,gBAAS,qBAAqB,WAAW,SAAS,MAAM,OAAO,QAAW;AAC/E,YAAU,QAAQ,cAAY,QAAQ,GAAG,MAAM,GAAG,iBAAiB,QAAQ,CAAC,IAAI,IAAI,CAAC;AACvF;AAEO,gBAAS,sBAAsB,WAAW,WAAW;AAC1D,SAAO,UAAU,SAAS,UAAU,QAAQ,UAAU,UAAU,UAAU;AAC5E;AAEO,gBAAS,0BAA0B,OAAO,cAAwC;AACvF,SAAO,mBAAmB,OAAO,YAAY,IAAI;AACnD;AAEO,gBAAS,aAAa,OAAO;AAClC,QAAM,WAAW,gBAAgB,KAAK;AACtC,SAAO,UAAU;AACnB;AAIO,gBAAS,8BAA8B,MAAM,MAAM;AACxD,MAAK,CAAC,KAAK,MAAM,QAAM,KAAK,KAAK,SAAO,sBAAsB,IAAI,GAAG,CAAC,CAAC,GAAI;AACzE,WAAO;AAAA,EACT;AAEA,SAAO,KAAK,MAAM,SAAO,KAAK,KAAK,QAAM,sBAAsB,IAAI,GAAG,CAAC,CAAC;AAC1E;",
   "names": []
 }

package/package.json

@@ -6,16 +6,15 @@
     "name": "The National Library of Finland"
   },
   "keywords": [],
-  "homepage": "https://github.com/natlibfi/marc-record-validators-melinda",
+  "homepage": "https://www.npmjs.com/package/@natlibfi/marc-record-validators-melinda",
   "bugs": {
     "url": "https://github.com/natlibfi/marc-record-validators-melinda/issues"
   },
   "repository": {
-    "type": "git",
-    "url": "git@github.com:natlibfi/marc-record-validators-melinda.git"
+    "url": "https://github.com/NatLibFi/marc-record-validators-melinda"
   },
   "license": "MIT",
-  "version": "12.0.0-alpha.4",
+  "version": "12.0.0-alpha.6",
   "main": "./dist/index.js",
   "publishConfig": {
     "access": "public"
@@ -35,27 +34,27 @@
   },
   "dependencies": {
     "@natlibfi/issn-verify": "^1.0.6",
-    "@natlibfi/marc-record": "^10.0.0-alpha.1",
-    "@natlibfi/marc-record-serializers": "^11.0.0-alpha.2",
-    "@natlibfi/marc-record-validate": "^9.0.0-alpha.1",
-    "@natlibfi/melinda-commons": "^14.0.0-alpha.3",
-    "@natlibfi/sfs-4900": "^2.0.0-alpha.3",
-    "@natlibfi/iso9-1995": "^1.0.0-alpha.2",
-    "@natlibfi/sru-client": "^7.0.0-alpha.3",
+    "@natlibfi/marc-record": "next",
+    "@natlibfi/marc-record-serializers": "next",
+    "@natlibfi/marc-record-validate": "next",
+    "@natlibfi/melinda-commons": "next",
+    "@natlibfi/sfs-4900": "next",
+    "@natlibfi/iso9-1995": "next",
+    "@natlibfi/sru-client": "next",
     "cld3-asm": "^4.0.0",
     "clone": "^2.1.2",
     "debug": "^4.4.3",
-    "isbn3": "^1.2.13",
+    "isbn3": "^1.2.15",
     "langs": "^2.0.0",
     "xml2js": "^0.6.2",
     "xregexp": "^5.1.2"
   },
   "peerDependencies": {
-    "@natlibfi/marc-record-validate": "^9.0.0-alpha.1"
+    "@natlibfi/marc-record-validate": "next"
   },
   "devDependencies": {
-    "@natlibfi/fixugen": "^3.0.0-alpha.6",
-    "@natlibfi/fixura": "^4.0.0-alpha.13",
+    "@natlibfi/fixugen": "next",
+    "@natlibfi/fixura": "next",
     "cross-env": "^10.0.0",
     "esbuild": "^0.25.10",
     "eslint": "^9.36.0",

package/src/merge-fields/counterpartField.js

@@ -11,6 +11,7 @@ import {controlSubfieldsPermitMerge} from './controlSubfields.js';
 import {mergableIndicator1, mergableIndicator2} from './mergableIndicator.js';
 import {partsAgree} from '../normalizeSubfieldValueForComparison.js';
 import {normalizeForSamenessCheck, valueCarriesMeaning} from './worldKnowledge.js';
+import { provenanceSubfieldsPermitMerge } from './dataProvenance.js';
 
 const debug = createDebugLogger('@natlibfi/marc-record-validators-melinda:mergeField:counterpart');
 //const debugData = debug.extend('data');
@@ -375,6 +376,11 @@ function syntacticallyMergablePair(baseField, sourceField, config) {
     return false;
   }
 
+  if (!provenanceSubfieldsPermitMerge(baseField, sourceField)) {
+    nvdebug('non-mergable (reason: data provenance subfield)', debugDev);
+    return false;
+  }
+
   // NB! field1.tag and field2.tag might differ (1XX vs 7XX). Therefore required subfields might theoretically differ as well.
   // Note: Theoretically 260 $efg vs 264 with IND2=3 has already been handled by the preprocessor.
   // Thus check both:

package/src/merge-fields/dataProvenance.js

@@ -0,0 +1,41 @@
+// See https://www.loc.gov/marc/bibliographic/bdapndxj.html for details
+
+import {subfieldArraysContainSameData} from "../utils.js";
+
+function tagToDataProvenanceSubfieldCode(tag) {
+    if ( ['533', '800', '810', '811', '830'].includes(tag)) {
+        return 'y';
+    }
+    if ( tag === '856' || tag === '857' ) {
+        return 'e';
+    }
+
+    if ( tag.match(/^7[678]/u) ) {
+        return 'l'
+    }
+
+    if ( tag.match(/^00/u)) {
+        return undefined;
+    }
+    return '7';
+}
+
+
+export function provenanceSubfieldsPermitMerge(baseField, sourceField) {
+    const provinanceSubfieldCode = tagToDataProvenanceSubfieldCode(baseField.tag);
+    if (!baseField.subfields) {
+        return true;
+    }
+    if (provinanceSubfieldCode === undefined) {
+        return false;
+    }
+
+    const baseProvinanceSubfields = baseField.subfields.filter(sf => sf.code === provinanceSubfieldCode);
+    const sourceProvinanceSubfields = sourceField.subfields.filter(sf => sf.code === provinanceSubfieldCode);
+
+    // Currently we just compare two arrays. Later on we might do something more sophisticated with specific $7 data provenance category/relationship codes,
+    // or actual values.
+
+    return subfieldArraysContainSameData(baseProvinanceSubfields, sourceProvinanceSubfields);
+
+}

package/src/merge-fields/index.js

@@ -18,16 +18,25 @@ import {mergeConfig as defaultConfig} from './mergeConfig.js';
 
 //const defaultConfig = JSON.parse(fs.readFileSync(path.join(__dirname, '..', '..', 'src', 'merge-fields', 'config.json'), 'utf8'));
 
-export default function () {
+export default function (defaultTagPattern = undefined) {
 
   return {
     description, validate, fix
   };
 
+  function getTagPattern(config) {
+    if (config && config.tagPattern) {
+      return config.tagPattern;
+    }
+    if (defaultTagPattern) { // Used by tests
+      return defaultTagPattern;
+    }
+    return '^[1678](?:00|10|11|30)$';
+  }
 
   function mergeFieldsWithinRecord(record, config) {
     //const candFields = record.fields.toReversed(); // Node 20+ only! Filter via config?
-    const fields = config && config.tagPattern ? record.get(config.tagPattern) : record.get(/^[1678](?:00|10|11|30)$/u);
+    const fields = record.get(getTagPattern(config)); // config && config.tagPattern ? record.get(config.tagPattern) : record.get(/^[1678](?:00|10|11|30)$/u);
 
     fields.reverse();
     const mergedField = fields.find(f => mergeField(record, record, f, config));

package/src/merge-fields/mergeField.js

@@ -106,8 +106,8 @@ function skipMergeField(baseRecord, sourceField, config) {
     return true;
   }
 
-  // Skip duplicate field:
-  if (baseRecord.fields.some(baseField => !baseField.mergeCandidate && fieldsAreIdentical(sourceField, baseField))) {
+  // Skip duplicate field when merging two records (NB! internal merge merges/removes the duplicate field):
+  if (!baseRecord.internalMerge && baseRecord.fields.some(baseField => !baseField.mergeCandidate && fieldsAreIdentical(sourceField, baseField))) {
     nvdebug(`skipMergeField(): field '${fieldToString(sourceField)}' already exists! No merge required!`, debugDev);
     sourceField.deleted = 1;
     return true;

package/src/merge-fields.test.js

@@ -4,6 +4,7 @@ import validatorFactory from './merge-fields/index.js';
 import {READERS} from '@natlibfi/fixura';
 import generateTests from '@natlibfi/fixugen';
 import createDebugLogger from 'debug';
+import { nvdebug } from './utils.js';
 
 generateTests({
   callback,
@@ -29,17 +30,20 @@ async function testValidatorFactory() {
   assert.equal(typeof validator.validate, 'function');
 }
 
-async function callback({getFixture, enabled = true, fix = false}) {
+async function callback({getFixture, enabled = true, fix = false, tagPattern = false}) {
   if (enabled === false) {
     debug('TEST SKIPPED!');
     return;
   }
 
-  const validator = await validatorFactory();
+  nvdebug(`TAG PATTERN: ${tagPattern}`);
+
+  const validator = await validatorFactory(tagPattern);
   const record = new MarcRecord(getFixture('record.json'));
   const expectedResult = getFixture('expectedResult.json');
   // console.log(expectedResult); // eslint-disable-line
 
+  // NB! This validator will only use tags matching /^[1678](?:00|10|11|30)$/ unless tagPattern is specified!
   if (!fix) {
     const result = await validator.validate(record);
     assert.deepEqual(result, expectedResult);

package/src/removeInferiorDataFields.js

@@ -332,7 +332,10 @@ function deriveIndividualDeletables(record) {
     // MET-575 (merge: applies in postprocessing)
     const inferiorTerms = getPrepublicationTerms(currString);
 
-    const newDeletables = [...deletables, ...subsets, ...accentless, ...d490, ...inferiorTerms];
+    // MELKEHITYS-3277-ish: non-AI is better than AI (a rare case where longer version is inferior):
+    const aiBased = `${currString} ‡7 (dpenmw)AI`;
+
+    const newDeletables = [...deletables, ...subsets, ...accentless, ...d490, ...inferiorTerms, aiBased];
 
     if (subsets.length) {
       return processTodoList([...stillToDo, ...moreToDo], newDeletables);

package/src/sortSubfields.js

@@ -67,9 +67,9 @@ export default function (defaultTagPattern) {
 
 // X00, X10, X11 and X130 could also for their own sets...
 // (ouch! sometimes $c comes after $d...): LoC: 100 0# ‡a Black Foot, ‡c Chief, ‡d d. 1877 ‡c (Spirit)
-const sortOrderForX00 = ['i', 'a', 'b', 'q', 'c', 'd', 'e', 't', 'u', 'l', 'f', 'x', 'y', 'z', '0', '5', '9']; // skip $g. Can't remember why, though...
-const sortOrderForX10 = ['i', 'a', 'b', 't', 'n', 'c', 'e', 'v', 'w', 'x', 'y', 'z', '0', '5', '9']; // somewhat iffy
-const sortOrderForX11 = ['a', 'n', 'd', 'c', 'e', 'g', 'j', '0', '5', '9'];
+const sortOrderForX00 = ['i', 'a', 'b', 'q', 'c', 'd', 'e', 't', 'u', 'l', 'f', 'x', 'y', 'z', '0', '1', '5', '9']; // skip $g. Can't remember why, though...
+const sortOrderForX10 = ['i', 'a', 'b', 't', 'n', 'c', 'e', 'v', 'w', 'x', 'y', 'z', '0', '1', '5', '9']; // somewhat iffy
+const sortOrderForX11 = ['a', 'n', 'd', 'c', 'e', 'g', 'j', '0', '1', '5', '9'];
 const sortOrderFor7XX = ['8', '7', 'i', 'a', 's', 't', 'b', 'c', 'd', 'm', 'h', 'k', 'o', 'x', 'z', 'g', 'q', 'w'];
 const sortOrderFor246 = ['i', 'a', 'b', 'n', 'p', 'f', '5', '9']; // Used by field 946 as well
 
@@ -89,7 +89,7 @@ const subfieldSortOrder = [
   {'tag': '245', 'sortOrder': ['a', 'b', 'n', 'p', 'k', 'f', 'c']},
   {'tag': '246', 'sortOrder': sortOrderFor246},
   {'tag': '382', 'sortOrder': ['a']},
-  {'tag': '385', 'sortOrder': ['8', 'm', 'n', 'a', '2', '0']},
+  {'tag': '385', 'sortOrder': ['8', 'm', 'n', 'a', '2', '0', '1']},
   {'tag': '386', 'sortOrder': ['8', 'm', 'n', 'a']},
   {'tag': '490', 'sortOrder': ['a', 'x', 'y', 'v', 'l']},
   {'tag': '505', 'sortOrder': ['a']},
@@ -218,7 +218,9 @@ export function sortAdjacentSubfields(field, externalSortOrder = []) {
 
 
   const finnishWay = twoBeforeZero(field);
-  const controlSubfieldOrder = finnishWay ? ['8', '7', '3', 'a', '4', '2', '0', '1', '5', '9'] : ['8', '7', '3', 'a', '4', '0', '2', '1', '5', '9'];
+
+  // Note: 760-789: '7' comes way earlier (after '6' and '8')
+  const controlSubfieldOrder = finnishWay ? ['8', '3', 'a', '4', '2', '0', '1', '7', '5', '9'] : ['8', '7', '3', 'a', '4', '0', '1', '2', '7', '5', '9'];
   swapSubfields(field, controlSubfieldOrder);
 
   const sortOrderForField = externalSortOrder.length > 0 ? externalSortOrder : getSubfieldSortOrder(field);