@natlibfi/marc-record-validators-melinda 12.0.7 → 12.0.8

package/dist/removeDuplicateDataFields.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/removeDuplicateDataFields.js"],
-  "sourcesContent": ["import createDebugLogger from 'debug';\nimport {fieldToString, nvdebug} from './utils.js';\nimport {fieldHasValidSubfield6, fieldsGetOccurrenceNumbers, fieldsToNormalizedString, fieldToNormalizedString, get6s} from './subfield6Utils.js';\nimport {add8s, fieldHasLinkingNumber, fieldHasValidSubfield8, fieldsGetAllSubfield8LinkingNumbers, getSubfield8LinkingNumber, recordGetAllSubfield8LinkingNumbers, recordGetFieldsWithSubfield8LinkingNumber} from './subfield8Utils.js';\n\nconst LINK_ROOT = 4;\nconst LINKED_AND_PROCESSED = 2;\nconst LINKED_NOT_PROCESSED = 1;\n\n\n// Relocated from melinda-marc-record-merge-reducers (and renamed)\n\nconst debug = createDebugLogger('@natlibfi/marc-record-validators-melinda:removeDuplicateDataFields');\n\nexport default function () {\n  return {\n    description: 'Remove duplicate data fields. Certain exceptions apply, mainly too complited chained fields',\n    validate, fix\n  };\n\n  function fix(record) {\n    nvdebug('Remove duplicate data fields');\n    const res = {message: [], fix: [], valid: true};\n    removeDuplicateDatafields(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: duplicate data fields cause (t)error', debug);\n\n    const duplicates = removeDuplicateDatafields(record, false);\n\n    //const orphanedFields = getOrphanedFields(fieldsContainingSubfield6);\n\n    const res = {message: duplicates};\n\n    /*\n    if (orphanedFields.length > 0) {\n      res.message = [`${orphanedFields.length} orphaned occurrence number field(s) detected`];\n    }\n    */\n    res.valid = res.message.length < 1;\n    return res;\n  }\n}\n\n\n/*\nfunction numberOfLinkageSubfields(field) {\n  nvdebug(`N of Linkage Subs(${fieldToString(field)})`);\n  const subfields = field.subfields.filter(sf => sf.code === '6' || sf.code === '8');\n  return subfields.length;\n}\n*/\n\nfunction removeLinkNotes(record) {\n  record.fields.forEach(f => delete f.linkNote);\n}\n\n\nfunction newGetAllLinkedFields(field, record, useSixes = true, useEights = true) {\n  removeLinkNotes(record); // should be clear, but let's play safe\n\n  field.linkNote = LINK_ROOT;\n\n  let currField = field;\n\n  // Loop until all linked fields have been processed:\n  while (currField !== undefined) {\n    if (useSixes) {\n      const related6s = get6s(currField, record.fields)\n      related6s.forEach(f => linkField(f));\n    }\n    if (useEights) {\n      const related8s = add8s([currField], record);\n      related8s.forEach(f => linkField(f));\n    }\n    if (currField.linkNote !== LINK_ROOT) {\n      currField.linkNote = LINKED_AND_PROCESSED;\n    }\n    currField = record.fields.find(f => f.linkNote === LINKED_NOT_PROCESSED);\n  }\n\n  // Collect relevant fields:\n  const linkedFields = record.fields.filter(f => f.linkNote);\n\n  removeLinkNotes(record);\n\n  return linkedFields;\n\n  function linkField(f) {\n    if (!f.linkNote) {\n      f.linkNote = LINKED_NOT_PROCESSED;\n    }\n  }\n\n}\n\n\nfunction recordRemoveFieldOrSubfield8(record, field, currLinkingNumber) {\n  const eights = field.subfields.filter(sf => sf.code === '8');\n  if (eights.length < 2) {\n    record.removeField(field);\n    return;\n  }\n  const subfields = field.subfields.filter(sf => getSubfield8LinkingNumber(sf) === currLinkingNumber);\n  subfields.forEach(sf => record.removeSubfield(sf, field));\n}\n\nfunction newRecordRemoveFieldOrSubfield8(record, field, currLinkingNumber, fix) {\n  const eights = field.subfields.filter(sf => sf.code === '8');\n  if (eights.length < 2) {\n    field.deleted = 1;\n    return;\n  }\n  const subfields = field.subfields.filter(sf => getSubfield8LinkingNumber(sf) === currLinkingNumber);\n  subfields.forEach(sf => {\n    field.modified = 1;\n    if (fix) {\n      record.removeSubfield(sf, field);\n    }\n  });\n}\n\n\nexport function removeDuplicateSubfield8Chains(record, fix = true) {\n\n  // Seen $8 subsfields in various fields:\n  // 161 700\n  // 17 710\n  // 11 110\n  // 8 730\n  // 1 100\n  // Given these stats, there's no need to check for 1XX-vs-7XX removals\n\n  let seen = {};\n\n  let removables = []; // for validation\n\n  //nvdebug(\"CHAIN-8\");\n  const seenLinkingNumbers = recordGetAllSubfield8LinkingNumbers(record);\n  if (seenLinkingNumbers.length === 0) {\n    return removables;\n  }\n\n  //nvdebug(`seen linking numbers ($8): ${seenLinkingNumbers.join(', ')}`, debug);\n\n  seenLinkingNumbers.forEach(currLinkingNumber => {\n    const linkedFields = recordGetFieldsWithSubfield8LinkingNumber(record, currLinkingNumber) //getFieldsWithSubfield8Index(base, baseIndex);\n    // As/If there's just one occurrence number it should be fine to use normalizeOccurrenceNumber = true\n    const normalizeOccurrenceNumber = true;\n    const linkedFieldsAsString = fieldsToNormalizedString(linkedFields, currLinkingNumber, normalizeOccurrenceNumber, true);\n    //nvdebug(`Results for LINKING NUMBER ${currLinkingNumber}:`, debug);\n    //nvdebug(`${linkedFieldsAsString}`, debug);\n\n    if (linkedFieldsAsString in seen)  {\n      if (!removables.includes(linkedFieldsAsString)) {\n        removables.push(linkedFieldsAsString);\n      }\n\n      if (fix) {\n        //nvdebug(`$8 CHAIN FIX: REMOVE $8 GROUP: ${fieldsToString(linkedFields)}`, debug);\n        linkedFields.forEach(field => recordRemoveFieldOrSubfield8(record, field, currLinkingNumber));\n        return;\n      }\n\n      //nvdebug(`$8 VALIDATION: DUPLICATE DETECTED ${linkedFieldsAsString}`, debug);\n      return;\n    }\n    //nvdebug(`$8 DOUBLE REMOVAL OR VALIDATION: ADD2SEEN ${linkedFieldsAsString}`, debug);\n    seen[linkedFieldsAsString] = 1;\n    return;\n  });\n\n  return removables;\n}\n\n\nexport function handleDuplicateSubfield8Chains(record, fix) {\n\n  // Seen $8 subsfields in various fields:\n  // 161 700\n  // 17 710\n  // 11 110\n  // 8 730\n  // 1 100\n  // Given these stats, there's no need to check for 1XX-vs-7XX removals\n\n  let seen = {};\n\n  //nvdebug(\"CHAIN-8\");\n  const seenLinkingNumbers = recordGetAllSubfield8LinkingNumbers(record);\n  if (seenLinkingNumbers.length === 0) {\n    return;\n  }\n\n  //nvdebug(`seen linking numbers ($8): ${seenLinkingNumbers.join(', ')}`, debug);\n\n  seenLinkingNumbers.forEach(currLinkingNumber => {\n    const linkedFields = recordGetFieldsWithSubfield8LinkingNumber(record, currLinkingNumber) //getFieldsWithSubfield8Index(base, baseIndex);\n    // As/If there's just one occurrence number it should be fine to use normalizeOccurrenceNumber = true\n    const normalizeOccurrenceNumber = false; //true;\n    const linkedFieldsAsString = fieldsToNormalizedString(linkedFields, currLinkingNumber, normalizeOccurrenceNumber, true);\n    //nvdebug(`Results for LINKING NUMBER ${currLinkingNumber}:`, debug);\n    //nvdebug(`${linkedFieldsAsString}`, debug);\n\n    if (linkedFieldsAsString in seen)  {\n      //nvdebug(`$8 CHAIN FIX: REMOVE $8 GROUP: ${fieldsToString(linkedFields)}`, debug);\n      linkedFields.forEach(field => newRecordRemoveFieldOrSubfield8(record, field, currLinkingNumber, fix));\n      return;\n    }\n    //nvdebug(`$8 DOUBLE REMOVAL OR VALIDATION: ADD2SEEN ${linkedFieldsAsString}`, debug);\n    seen[linkedFieldsAsString] = 1;\n    return;\n  });\n\n}\n\nfunction markIdenticalSubfield6Chains(chain, record) {\n  const normalizeOccurrenceNumber = true;\n  const normalizeTag = chain.some(field => field.tag.substring(0, 1) === '1'); // 1XX can delete 7XX as well!\n  const chainAsString = fieldsToNormalizedString(chain, 0, normalizeOccurrenceNumber, normalizeTag);\n\n  //nvdebug(`markIdenticalSubfield6Chains: ${chainAsString}`);\n  record.fields.forEach(f => compareWithChain(f));\n\n\n  function compareWithChain(f) {\n    //nvdebug(`FIELD2CHAIN ${fieldToString(f)}`);\n    const otherChain = fieldToChain(f, record);\n    // Not a lone field or chain (head) or ... or is-same-chain\n    if (otherChain.length === 0 || sameField(chain[0], otherChain[0])) {\n      return;\n    }\n    const otherChainAsString = fieldsToNormalizedString(otherChain, 0, normalizeOccurrenceNumber, normalizeTag);\n\n    // Mark other chain as deleted:\n    if (chainAsString === otherChainAsString) {\n      otherChain.forEach(f => {\n        //nvdebug(` mark ${fieldToString(f)} as deleted ($6-chain)...`);\n        f.deleted = 1;\n      });\n      return;\n    }\n  }\n\n}\n\nfunction markIdenticalLoneFieldsAsDeletable(field, record) {\n  if (field.deleted) {\n    return;\n  }\n  // targetLinkingNumber = 0, normalizedOccurenceNumber = false, normalizeTag = true)\n  const normalizeTag = field.tag.substring(0, 1) === '1'; // 1XX can delete 7XX as well!\n  const fieldAsString = fieldToNormalizedString(field, 0, false, normalizeTag);\n\n  const identicalLoneFields = record.fields.filter(f => !sameField(f, field) && fieldToNormalizedString(f, 0, false, normalizeTag) === fieldAsString);\n\n  // Mark fields as deleted:\n  identicalLoneFields.forEach(f => {\n    //nvdebug(` mark ${fieldToString(f)} as deleted (lone field)...`);\n    f.deleted = 1;\n  });\n\n}\n\nfunction acceptFieldsWithSubfield6(fieldsWithSubfield6) {\n  // There can be only one non-880 field:\n  const non880 = fieldsWithSubfield6.filter(f => f.tag !== '880');\n  if (non880.length > 1) {\n    return false;\n  }\n\n  const occurrenceNumbers = fieldsGetOccurrenceNumbers(fieldsWithSubfield6);\n  // Chain can contain only single occurrence number:\n  if (occurrenceNumbers.length > 1) {\n    return false;\n  }\n\n  return true;\n}\n\n\nfunction isSingleTagLinkingNumber(linkingNumber, fields, tag) {\n  const relevantFields = fields.filter(f => fieldHasLinkingNumber(f, linkingNumber));\n  if (relevantFields.some(f => f.tag !== tag)) {\n    return false;\n  }\n  return true;\n}\n\nfunction acceptFieldsWithSubfield8(fieldsWithSubfield8, requireSingleTag = false) {\n  const linkingNumbers = fieldsGetAllSubfield8LinkingNumbers(fieldsWithSubfield8);\n  if (linkingNumbers.some(linkingNumber => anomaly8(linkingNumber))) {\n    return false;\n  }\n  return true;\n\n  // If linking number\n  function anomaly8(linkingNumber) {\n    //nvdebug(`  Looking for anomalies in linkin number ${linkingNumber}`);\n    const relevantFields = fieldsWithSubfield8.filter(f => fieldHasLinkingNumber(f, linkingNumber));\n    if (requireSingleTag) {\n      return !isSingleTagLinkingNumber(linkingNumber, relevantFields, relevantFields[0].tag);\n    }\n\n    const f880 = relevantFields.filter(f => f.tag === '880');\n    if (f880.length === 0 || f880.length === relevantFields.length) {\n      return false;\n    }\n    return true;\n  }\n}\n\n\nexport function sameField(field1, field2) {\n  field1.tmpMyId = 666;\n  const result = field2.tmpMyId === 666 ? true : false;\n  delete field1.tmpMyId;\n  return result;\n}\n\nexport function isChainHead(field, chain) {\n  return sameField(field, chain[0]);\n}\n\nexport function fieldToChain(field, record) {\n  if (field.deleted || !field.subfields) {\n    return [];\n  }\n  const chain = newGetAllLinkedFields(field, record, true, true);\n\n  // nvdebug(` Chain contains ${chain.length} field(s)`);\n  if (!isChainHead(field, chain)) { // newGetAllLinkedFields() marks relevant record.fields!\n    return [];\n  }\n\n  const fieldsWithSubfield6 = chain.filter(f => fieldHasValidSubfield6(f));\n  // Hack: multiple $6 fields, but either all are non-880 or all are 880: treat field as a single entry\n  if (fieldsWithSubfield6.length > 0) {\n    const non880 = fieldsWithSubfield6.filter(f => f.tag !== '880');\n    if (non880.length === 0 || non880.length === fieldsWithSubfield6.length) {\n      return [field];\n    }\n    if (non880.length !== 1) {\n      return [field];\n    }\n  }\n\n  if (!acceptFieldsWithSubfield6(fieldsWithSubfield6)) { // Check tag subfield $6s are legal(ish)\n    return [];\n  }\n  const fieldsWithSubfield8 = chain.filter(f => fieldHasValidSubfield8(f));\n  if (!acceptFieldsWithSubfield8(fieldsWithSubfield8, false)) {\n    return [];\n  }\n\n  //nvdebug(`Proceed with ${fieldsToString(chain)}`);\n\n\n  return chain;\n}\n\n\nfunction fieldHandleDuplicateDatafields(field, record) {\n  const chain = fieldToChain(field, record);\n  //nvdebug(` TRY TO HANDLE DUPLICATES OF '${fieldsToString(chain)}'`);\n\n  if (chain.length === 0) {\n    return;\n  }\n\n  const fieldsWithSubfield6 = chain.filter(f => fieldHasValidSubfield6(f));\n  const fieldsWithSubfield8 = chain.filter(f => fieldHasValidSubfield8(f));\n\n  // Lone fields:\n  if (chain.length === 1) {\n    markIdenticalLoneFieldsAsDeletable(chain[0], record);\n    return;\n  }\n  if (fieldsWithSubfield6.length === 0) {\n\n    if (fieldsWithSubfield8.length === 0) { // chain.length === 1?\n      //nvdebug(` Trying to find duplicates of single field '${fieldToString(chain[0])}'`);\n      markIdenticalLoneFieldsAsDeletable(chain[0], record);\n      return;\n    }\n    const linkingNumbers = fieldsGetAllSubfield8LinkingNumbers(fieldsWithSubfield8);\n    if (linkingNumbers.length < 2) {\n      markIdenticalSubfield6Chains(chain, record);\n      return;\n    }\n  }\n\n  if (fieldsWithSubfield6.length > 0 && acceptFieldsWithSubfield8(fieldsWithSubfield8, true)) { // Checks that non-880 tags are all same\n    // Chain is removable\n    markIdenticalSubfield6Chains(chain, record);\n    return;\n  }\n\n\n  //nvdebug(` NO HANDLER FOUND FOR '${fieldsToString(chain)}'`);\n  //nvdebug(`  N8s: ${fieldsWithSubfield6.length}`);\n\n}\n\n\nexport function removeDuplicateDatafields(record, fix = true) {\n  // Sometimes only $8 subfield (vs the whole field) is removed. Thus they are handled separately:\n  handleDuplicateSubfield8Chains(record, fix);\n\n  const dataFields = record.fields.filter(f => f.subfields !== undefined);\n\n  dataFields.forEach(f => fieldHandleDuplicateDatafields(f, record));\n\n  const deletableFields = dataFields.filter(f => f.deleted);\n  const modifiedFields = dataFields.filter(f => f.modified && !f.deleted);\n\n  const result = deletableFields.map(f => `DEL: ${fieldToString(f)}`);\n  if (modifiedFields.length) {\n    modifiedFields.forEach(f => delete f.modified);\n    result.push(modifiedFields.map(f => `MOD: ${fieldToString(f)}`));\n  }\n\n  if (fix) {\n    deletableFields.forEach(f => record.removeField(f));\n    return result;\n  }\n\n  deletableFields.forEach(f => delete f.deleted);\n  deletableFields.forEach(f => delete f.modified);\n\n\n  return result;\n}\n"],
-  "mappings": "AAAA,OAAO,uBAAuB;AAC9B,SAAQ,eAAe,eAAc;AACrC,SAAQ,wBAAwB,4BAA4B,0BAA0B,yBAAyB,aAAY;AAC3H,SAAQ,OAAO,uBAAuB,wBAAwB,qCAAqC,2BAA2B,qCAAqC,iDAAgD;AAEnN,MAAM,YAAY;AAClB,MAAM,uBAAuB;AAC7B,MAAM,uBAAuB;AAK7B,MAAM,QAAQ,kBAAkB,oEAAoE;AAEpG,0BAA2B;AACzB,SAAO;AAAA,IACL,aAAa;AAAA,IACb;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,IAAI,QAAQ;AACnB,YAAQ,8BAA8B;AACtC,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAC9C,8BAA0B,QAAQ,IAAI;AAEtC,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ;AAExB,YAAQ,yDAAyD,KAAK;AAEtE,UAAM,aAAa,0BAA0B,QAAQ,KAAK;AAI1D,UAAM,MAAM,EAAC,SAAS,WAAU;AAOhC,QAAI,QAAQ,IAAI,QAAQ,SAAS;AACjC,WAAO;AAAA,EACT;AACF;AAWA,SAAS,gBAAgB,QAAQ;AAC/B,SAAO,OAAO,QAAQ,OAAK,OAAO,EAAE,QAAQ;AAC9C;AAGA,SAAS,sBAAsB,OAAO,QAAQ,WAAW,MAAM,YAAY,MAAM;AAC/E,kBAAgB,MAAM;AAEtB,QAAM,WAAW;AAEjB,MAAI,YAAY;AAGhB,SAAO,cAAc,QAAW;AAC9B,QAAI,UAAU;AACZ,YAAM,YAAY,MAAM,WAAW,OAAO,MAAM;AAChD,gBAAU,QAAQ,OAAK,UAAU,CAAC,CAAC;AAAA,IACrC;AACA,QAAI,WAAW;AACb,YAAM,YAAY,MAAM,CAAC,SAAS,GAAG,MAAM;AAC3C,gBAAU,QAAQ,OAAK,UAAU,CAAC,CAAC;AAAA,IACrC;AACA,QAAI,UAAU,aAAa,WAAW;AACpC,gBAAU,WAAW;AAAA,IACvB;AACA,gBAAY,OAAO,OAAO,KAAK,OAAK,EAAE,aAAa,oBAAoB;AAAA,EACzE;AAGA,QAAM,eAAe,OAAO,OAAO,OAAO,OAAK,EAAE,QAAQ;AAEzD,kBAAgB,MAAM;AAEtB,SAAO;AAEP,WAAS,UAAU,GAAG;AACpB,QAAI,CAAC,EAAE,UAAU;AACf,QAAE,WAAW;AAAA,IACf;AAAA,EACF;AAEF;AAGA,SAAS,6BAA6B,QAAQ,OAAO,mBAAmB;AACtE,QAAM,SAAS,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AAC3D,MAAI,OAAO,SAAS,GAAG;AACrB,WAAO,YAAY,KAAK;AACxB;AAAA,EACF;AACA,QAAM,YAAY,MAAM,UAAU,OAAO,QAAM,0BAA0B,EAAE,MAAM,iBAAiB;AAClG,YAAU,QAAQ,QAAM,OAAO,eAAe,IAAI,KAAK,CAAC;AAC1D;AAEA,SAAS,gCAAgC,QAAQ,OAAO,mBAAmB,KAAK;AAC9E,QAAM,SAAS,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AAC3D,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,UAAU;AAChB;AAAA,EACF;AACA,QAAM,YAAY,MAAM,UAAU,OAAO,QAAM,0BAA0B,EAAE,MAAM,iBAAiB;AAClG,YAAU,QAAQ,QAAM;AACtB,UAAM,WAAW;AACjB,QAAI,KAAK;AACP,aAAO,eAAe,IAAI,KAAK;AAAA,IACjC;AAAA,EACF,CAAC;AACH;AAGO,gBAAS,+BAA+B,QAAQ,MAAM,MAAM;AAUjE,MAAI,OAAO,CAAC;AAEZ,MAAI,aAAa,CAAC;AAGlB,QAAM,qBAAqB,oCAAoC,MAAM;AACrE,MAAI,mBAAmB,WAAW,GAAG;AACnC,WAAO;AAAA,EACT;AAIA,qBAAmB,QAAQ,uBAAqB;AAC9C,UAAM,eAAe,0CAA0C,QAAQ,iBAAiB;AAExF,UAAM,4BAA4B;AAClC,UAAM,uBAAuB,yBAAyB,cAAc,mBAAmB,2BAA2B,IAAI;AAItH,QAAI,wBAAwB,MAAO;AACjC,UAAI,CAAC,WAAW,SAAS,oBAAoB,GAAG;AAC9C,mBAAW,KAAK,oBAAoB;AAAA,MACtC;AAEA,UAAI,KAAK;AAEP,qBAAa,QAAQ,WAAS,6BAA6B,QAAQ,OAAO,iBAAiB,CAAC;AAC5F;AAAA,MACF;AAGA;AAAA,IACF;AAEA,SAAK,oBAAoB,IAAI;AAC7B;AAAA,EACF,CAAC;AAED,SAAO;AACT;AAGO,gBAAS,+BAA+B,QAAQ,KAAK;AAU1D,MAAI,OAAO,CAAC;AAGZ,QAAM,qBAAqB,oCAAoC,MAAM;AACrE,MAAI,mBAAmB,WAAW,GAAG;AACnC;AAAA,EACF;AAIA,qBAAmB,QAAQ,uBAAqB;AAC9C,UAAM,eAAe,0CAA0C,QAAQ,iBAAiB;AAExF,UAAM,4BAA4B;AAClC,UAAM,uBAAuB,yBAAyB,cAAc,mBAAmB,2BAA2B,IAAI;AAItH,QAAI,wBAAwB,MAAO;AAEjC,mBAAa,QAAQ,WAAS,gCAAgC,QAAQ,OAAO,mBAAmB,GAAG,CAAC;AACpG;AAAA,IACF;AAEA,SAAK,oBAAoB,IAAI;AAC7B;AAAA,EACF,CAAC;AAEH;AAEA,SAAS,6BAA6B,OAAO,QAAQ;AACnD,QAAM,4BAA4B;AAClC,QAAM,eAAe,MAAM,KAAK,WAAS,MAAM,IAAI,UAAU,GAAG,CAAC,MAAM,GAAG;AAC1E,QAAM,gBAAgB,yBAAyB,OAAO,GAAG,2BAA2B,YAAY;AAGhG,SAAO,OAAO,QAAQ,OAAK,iBAAiB,CAAC,CAAC;AAG9C,WAAS,iBAAiB,GAAG;AAE3B,UAAM,aAAa,aAAa,GAAG,MAAM;AAEzC,QAAI,WAAW,WAAW,KAAK,UAAU,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,GAAG;AACjE;AAAA,IACF;AACA,UAAM,qBAAqB,yBAAyB,YAAY,GAAG,2BAA2B,YAAY;AAG1G,QAAI,kBAAkB,oBAAoB;AACxC,iBAAW,QAAQ,CAAAA,OAAK;AAEtB,QAAAA,GAAE,UAAU;AAAA,MACd,CAAC;AACD;AAAA,IACF;AAAA,EACF;AAEF;AAEA,SAAS,mCAAmC,OAAO,QAAQ;AACzD,MAAI,MAAM,SAAS;AACjB;AAAA,EACF;AAEA,QAAM,eAAe,MAAM,IAAI,UAAU,GAAG,CAAC,MAAM;AACnD,QAAM,gBAAgB,wBAAwB,OAAO,GAAG,OAAO,YAAY;AAE3E,QAAM,sBAAsB,OAAO,OAAO,OAAO,OAAK,CAAC,UAAU,GAAG,KAAK,KAAK,wBAAwB,GAAG,GAAG,OAAO,YAAY,MAAM,aAAa;AAGlJ,sBAAoB,QAAQ,OAAK;AAE/B,MAAE,UAAU;AAAA,EACd,CAAC;AAEH;AAEA,SAAS,0BAA0B,qBAAqB;AAEtD,QAAM,SAAS,oBAAoB,OAAO,OAAK,EAAE,QAAQ,KAAK;AAC9D,MAAI,OAAO,SAAS,GAAG;AACrB,WAAO;AAAA,EACT;AAEA,QAAM,oBAAoB,2BAA2B,mBAAmB;AAExE,MAAI,kBAAkB,SAAS,GAAG;AAChC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAGA,SAAS,yBAAyB,eAAe,QAAQ,KAAK;AAC5D,QAAM,iBAAiB,OAAO,OAAO,OAAK,sBAAsB,GAAG,aAAa,CAAC;AACjF,MAAI,eAAe,KAAK,OAAK,EAAE,QAAQ,GAAG,GAAG;AAC3C,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,0BAA0B,qBAAqB,mBAAmB,OAAO;AAChF,QAAM,iBAAiB,oCAAoC,mBAAmB;AAC9E,MAAI,eAAe,KAAK,mBAAiB,SAAS,aAAa,CAAC,GAAG;AACjE,WAAO;AAAA,EACT;AACA,SAAO;AAGP,WAAS,SAAS,eAAe;AAE/B,UAAM,iBAAiB,oBAAoB,OAAO,OAAK,sBAAsB,GAAG,aAAa,CAAC;AAC9F,QAAI,kBAAkB;AACpB,aAAO,CAAC,yBAAyB,eAAe,gBAAgB,eAAe,CAAC,EAAE,GAAG;AAAA,IACvF;AAEA,UAAM,OAAO,eAAe,OAAO,OAAK,EAAE,QAAQ,KAAK;AACvD,QAAI,KAAK,WAAW,KAAK,KAAK,WAAW,eAAe,QAAQ;AAC9D,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACF;AAGO,gBAAS,UAAU,QAAQ,QAAQ;AACxC,SAAO,UAAU;AACjB,QAAM,SAAS,OAAO,YAAY,MAAM,OAAO;AAC/C,SAAO,OAAO;AACd,SAAO;AACT;AAEO,gBAAS,YAAY,OAAO,OAAO;AACxC,SAAO,UAAU,OAAO,MAAM,CAAC,CAAC;AAClC;AAEO,gBAAS,aAAa,OAAO,QAAQ;AAC1C,MAAI,MAAM,WAAW,CAAC,MAAM,WAAW;AACrC,WAAO,CAAC;AAAA,EACV;AACA,QAAM,QAAQ,sBAAsB,OAAO,QAAQ,MAAM,IAAI;AAG7D,MAAI,CAAC,YAAY,OAAO,KAAK,GAAG;AAC9B,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,sBAAsB,MAAM,OAAO,OAAK,uBAAuB,CAAC,CAAC;AAEvE,MAAI,oBAAoB,SAAS,GAAG;AAClC,UAAM,SAAS,oBAAoB,OAAO,OAAK,EAAE,QAAQ,KAAK;AAC9D,QAAI,OAAO,WAAW,KAAK,OAAO,WAAW,oBAAoB,QAAQ;AACvE,aAAO,CAAC,KAAK;AAAA,IACf;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,CAAC,KAAK;AAAA,IACf;AAAA,EACF;AAEA,MAAI,CAAC,0BAA0B,mBAAmB,GAAG;AACnD,WAAO,CAAC;AAAA,EACV;AACA,QAAM,sBAAsB,MAAM,OAAO,OAAK,uBAAuB,CAAC,CAAC;AACvE,MAAI,CAAC,0BAA0B,qBAAqB,KAAK,GAAG;AAC1D,WAAO,CAAC;AAAA,EACV;AAKA,SAAO;AACT;AAGA,SAAS,+BAA+B,OAAO,QAAQ;AACrD,QAAM,QAAQ,aAAa,OAAO,MAAM;AAGxC,MAAI,MAAM,WAAW,GAAG;AACtB;AAAA,EACF;AAEA,QAAM,sBAAsB,MAAM,OAAO,OAAK,uBAAuB,CAAC,CAAC;AACvE,QAAM,sBAAsB,MAAM,OAAO,OAAK,uBAAuB,CAAC,CAAC;AAGvE,MAAI,MAAM,WAAW,GAAG;AACtB,uCAAmC,MAAM,CAAC,GAAG,MAAM;AACnD;AAAA,EACF;AACA,MAAI,oBAAoB,WAAW,GAAG;AAEpC,QAAI,oBAAoB,WAAW,GAAG;AAEpC,yCAAmC,MAAM,CAAC,GAAG,MAAM;AACnD;AAAA,IACF;AACA,UAAM,iBAAiB,oCAAoC,mBAAmB;AAC9E,QAAI,eAAe,SAAS,GAAG;AAC7B,mCAA6B,OAAO,MAAM;AAC1C;AAAA,IACF;AAAA,EACF;AAEA,MAAI,oBAAoB,SAAS,KAAK,0BAA0B,qBAAqB,IAAI,GAAG;AAE1F,iCAA6B,OAAO,MAAM;AAC1C;AAAA,EACF;AAMF;AAGO,gBAAS,0BAA0B,QAAQ,MAAM,MAAM;AAE5D,iCAA+B,QAAQ,GAAG;AAE1C,QAAM,aAAa,OAAO,OAAO,OAAO,OAAK,EAAE,cAAc,MAAS;AAEtE,aAAW,QAAQ,OAAK,+BAA+B,GAAG,MAAM,CAAC;AAEjE,QAAM,kBAAkB,WAAW,OAAO,OAAK,EAAE,OAAO;AACxD,QAAM,iBAAiB,WAAW,OAAO,OAAK,EAAE,YAAY,CAAC,EAAE,OAAO;AAEtE,QAAM,SAAS,gBAAgB,IAAI,OAAK,QAAQ,cAAc,CAAC,CAAC,EAAE;AAClE,MAAI,eAAe,QAAQ;AACzB,mBAAe,QAAQ,OAAK,OAAO,EAAE,QAAQ;AAC7C,WAAO,KAAK,eAAe,IAAI,OAAK,QAAQ,cAAc,CAAC,CAAC,EAAE,CAAC;AAAA,EACjE;AAEA,MAAI,KAAK;AACP,oBAAgB,QAAQ,OAAK,OAAO,YAAY,CAAC,CAAC;AAClD,WAAO;AAAA,EACT;AAEA,kBAAgB,QAAQ,OAAK,OAAO,EAAE,OAAO;AAC7C,kBAAgB,QAAQ,OAAK,OAAO,EAAE,QAAQ;AAG9C,SAAO;AACT;",
+  "sourcesContent": ["import createDebugLogger from 'debug';\nimport {fieldToString, nvdebug} from './utils.js';\nimport {fieldHasValidSubfield6, fieldsGetOccurrenceNumbers, fieldsToNormalizedString, fieldToNormalizedString, get6s} from './subfield6Utils.js';\nimport {add8s, fieldHasLinkingNumber, fieldHasValidSubfield8, fieldsGetAllSubfield8LinkingNumbers, getSubfield8LinkingNumber, recordGetAllSubfield8LinkingNumbers, recordGetFieldsWithSubfield8LinkingNumber} from './subfield8Utils.js';\n\nconst LINK_ROOT = 4;\nconst LINKED_AND_PROCESSED = 2;\nconst LINKED_NOT_PROCESSED = 1;\n\n\n// Relocated from melinda-marc-record-merge-reducers (and renamed)\n\nconst debug = createDebugLogger('@natlibfi/marc-record-validators-melinda:removeDuplicateDataFields');\n//const debugData = debug.extend('data');\nconst debugDev = debug.extend('dev');\n\nexport default function () {\n  return {\n    description: 'Remove duplicate data fields. Certain exceptions apply, mainly too complited chained fields',\n    validate, fix\n  };\n\n  function fix(record) {\n    nvdebug('Remove duplicate data fields', debugDev);\n    const res = {message: [], fix: [], valid: true};\n    removeDuplicateDatafields(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: duplicate data fields cause (t)error', debugDev);\n\n    const duplicates = removeDuplicateDatafields(record, false);\n\n    //const orphanedFields = getOrphanedFields(fieldsContainingSubfield6);\n\n    const res = {message: duplicates};\n\n    /*\n    if (orphanedFields.length > 0) {\n      res.message = [`${orphanedFields.length} orphaned occurrence number field(s) detected`];\n    }\n    */\n    res.valid = res.message.length < 1;\n    return res;\n  }\n}\n\n\n/*\nfunction numberOfLinkageSubfields(field) {\n  nvdebug(`N of Linkage Subs(${fieldToString(field)})`, debugDev);\n  const subfields = field.subfields.filter(sf => sf.code === '6' || sf.code === '8');\n  return subfields.length;\n}\n*/\n\nfunction removeLinkNotes(record) {\n  record.fields.forEach(f => delete f.linkNote);\n}\n\n\nfunction newGetAllLinkedFields(field, record, useSixes = true, useEights = true) {\n  removeLinkNotes(record); // should be clear, but let's play safe\n\n  field.linkNote = LINK_ROOT;\n\n  let currField = field;\n\n  // Loop until all linked fields have been processed:\n  while (currField !== undefined) {\n    if (useSixes) {\n      const related6s = get6s(currField, record.fields)\n      related6s.forEach(f => linkField(f));\n    }\n    if (useEights) {\n      const related8s = add8s([currField], record);\n      related8s.forEach(f => linkField(f));\n    }\n    if (currField.linkNote !== LINK_ROOT) {\n      currField.linkNote = LINKED_AND_PROCESSED;\n    }\n    currField = record.fields.find(f => f.linkNote === LINKED_NOT_PROCESSED);\n  }\n\n  // Collect relevant fields:\n  const linkedFields = record.fields.filter(f => f.linkNote);\n\n  removeLinkNotes(record);\n\n  return linkedFields;\n\n  function linkField(f) {\n    if (!f.linkNote) {\n      f.linkNote = LINKED_NOT_PROCESSED;\n    }\n  }\n\n}\n\n\nfunction recordRemoveFieldOrSubfield8(record, field, currLinkingNumber) {\n  const eights = field.subfields.filter(sf => sf.code === '8');\n  if (eights.length < 2) {\n    record.removeField(field);\n    return;\n  }\n  const subfields = field.subfields.filter(sf => getSubfield8LinkingNumber(sf) === currLinkingNumber);\n  subfields.forEach(sf => record.removeSubfield(sf, field));\n}\n\nfunction newRecordRemoveFieldOrSubfield8(record, field, currLinkingNumber, fix) {\n  const eights = field.subfields.filter(sf => sf.code === '8');\n  if (eights.length < 2) {\n    field.deleted = 1;\n    return;\n  }\n  const subfields = field.subfields.filter(sf => getSubfield8LinkingNumber(sf) === currLinkingNumber);\n  subfields.forEach(sf => {\n    field.modified = 1;\n    if (fix) {\n      record.removeSubfield(sf, field);\n    }\n  });\n}\n\n\nexport function removeDuplicateSubfield8Chains(record, fix = true) {\n\n  // Seen $8 subsfields in various fields:\n  // 161 700\n  // 17 710\n  // 11 110\n  // 8 730\n  // 1 100\n  // Given these stats, there's no need to check for 1XX-vs-7XX removals\n\n  let seen = {};\n\n  let removables = []; // for validation\n\n  //nvdebug(\"CHAIN-8\", debugDev);\n  const seenLinkingNumbers = recordGetAllSubfield8LinkingNumbers(record);\n  if (seenLinkingNumbers.length === 0) {\n    return removables;\n  }\n\n  //nvdebug(`seen linking numbers ($8): ${seenLinkingNumbers.join(', ')}`, debugDev);\n\n  seenLinkingNumbers.forEach(currLinkingNumber => {\n    const linkedFields = recordGetFieldsWithSubfield8LinkingNumber(record, currLinkingNumber) //getFieldsWithSubfield8Index(base, baseIndex);\n    // As/If there's just one occurrence number it should be fine to use normalizeOccurrenceNumber = true\n    const normalizeOccurrenceNumber = true;\n    const linkedFieldsAsString = fieldsToNormalizedString(linkedFields, currLinkingNumber, normalizeOccurrenceNumber, true);\n    //nvdebug(`Results for LINKING NUMBER ${currLinkingNumber}:`, debugDev);\n    //nvdebug(`${linkedFieldsAsString}`, debugDev);\n\n    if (linkedFieldsAsString in seen)  {\n      if (!removables.includes(linkedFieldsAsString)) {\n        removables.push(linkedFieldsAsString);\n      }\n\n      if (fix) {\n        //nvdebug(`$8 CHAIN FIX: REMOVE $8 GROUP: ${fieldsToString(linkedFields)}`, debugDev);\n        linkedFields.forEach(field => recordRemoveFieldOrSubfield8(record, field, currLinkingNumber));\n        return;\n      }\n\n      //nvdebug(`$8 VALIDATION: DUPLICATE DETECTED ${linkedFieldsAsString}`, debugDev);\n      return;\n    }\n    //nvdebug(`$8 DOUBLE REMOVAL OR VALIDATION: ADD2SEEN ${linkedFieldsAsString}`, debugDev);\n    seen[linkedFieldsAsString] = 1;\n    return;\n  });\n\n  return removables;\n}\n\n\nexport function handleDuplicateSubfield8Chains(record, fix) {\n\n  // Seen $8 subsfields in various fields:\n  // 161 700\n  // 17 710\n  // 11 110\n  // 8 730\n  // 1 100\n  // Given these stats, there's no need to check for 1XX-vs-7XX removals\n\n  let seen = {};\n\n  //nvdebug(\"CHAIN-8\", debugDev);\n  const seenLinkingNumbers = recordGetAllSubfield8LinkingNumbers(record);\n  if (seenLinkingNumbers.length === 0) {\n    return;\n  }\n\n  //nvdebug(`seen linking numbers ($8): ${seenLinkingNumbers.join(', ')}`, debugDev);\n\n  seenLinkingNumbers.forEach(currLinkingNumber => {\n    const linkedFields = recordGetFieldsWithSubfield8LinkingNumber(record, currLinkingNumber) //getFieldsWithSubfield8Index(base, baseIndex);\n    // As/If there's just one occurrence number it should be fine to use normalizeOccurrenceNumber = true\n    const normalizeOccurrenceNumber = false; //true;\n    const linkedFieldsAsString = fieldsToNormalizedString(linkedFields, currLinkingNumber, normalizeOccurrenceNumber, true);\n    //nvdebug(`Results for LINKING NUMBER ${currLinkingNumber}:`, debugDev);\n    //nvdebug(`${linkedFieldsAsString}`, debugDev);\n\n    if (linkedFieldsAsString in seen)  {\n      //nvdebug(`$8 CHAIN FIX: REMOVE $8 GROUP: ${fieldsToString(linkedFields)}`, debugDev);\n      linkedFields.forEach(field => newRecordRemoveFieldOrSubfield8(record, field, currLinkingNumber, fix));\n      return;\n    }\n    //nvdebug(`$8 DOUBLE REMOVAL OR VALIDATION: ADD2SEEN ${linkedFieldsAsString}`, debugDev);\n    seen[linkedFieldsAsString] = 1;\n    return;\n  });\n\n}\n\nfunction markIdenticalSubfield6Chains(chain, record) {\n  const normalizeOccurrenceNumber = true;\n  const normalizeTag = chain.some(field => field.tag.substring(0, 1) === '1'); // 1XX can delete 7XX as well!\n  const chainAsString = fieldsToNormalizedString(chain, 0, normalizeOccurrenceNumber, normalizeTag);\n\n  //nvdebug(`markIdenticalSubfield6Chains: ${chainAsString}`, debugDev);\n  record.fields.forEach(f => compareWithChain(f));\n\n\n  function compareWithChain(f) {\n    //nvdebug(`FIELD2CHAIN ${fieldToString(f)}`, debugDev);\n    const otherChain = fieldToChain(f, record);\n    // Not a lone field or chain (head) or ... or is-same-chain\n    if (otherChain.length === 0 || sameField(chain[0], otherChain[0])) {\n      return;\n    }\n    const otherChainAsString = fieldsToNormalizedString(otherChain, 0, normalizeOccurrenceNumber, normalizeTag);\n\n    // Mark other chain as deleted:\n    if (chainAsString === otherChainAsString) {\n      otherChain.forEach(f => {\n        //nvdebug(` mark ${fieldToString(f)} as deleted ($6-chain)...`, debugDev);\n        f.deleted = 1;\n      });\n      return;\n    }\n  }\n\n}\n\nfunction markIdenticalLoneFieldsAsDeletable(field, record) {\n  if (field.deleted) {\n    return;\n  }\n  // targetLinkingNumber = 0, normalizedOccurenceNumber = false, normalizeTag = true)\n  const normalizeTag = field.tag.substring(0, 1) === '1'; // 1XX can delete 7XX as well!\n  const fieldAsString = fieldToNormalizedString(field, 0, false, normalizeTag);\n\n  const identicalLoneFields = record.fields.filter(f => !sameField(f, field) && fieldToNormalizedString(f, 0, false, normalizeTag) === fieldAsString);\n\n  // Mark fields as deleted:\n  identicalLoneFields.forEach(f => {\n    //nvdebug(` mark ${fieldToString(f)} as deleted (lone field)...`, debugDev);\n    f.deleted = 1;\n  });\n\n}\n\nfunction acceptFieldsWithSubfield6(fieldsWithSubfield6) {\n  // There can be only one non-880 field:\n  const non880 = fieldsWithSubfield6.filter(f => f.tag !== '880');\n  if (non880.length > 1) {\n    return false;\n  }\n\n  const occurrenceNumbers = fieldsGetOccurrenceNumbers(fieldsWithSubfield6);\n  // Chain can contain only single occurrence number:\n  if (occurrenceNumbers.length > 1) {\n    return false;\n  }\n\n  return true;\n}\n\n\nfunction isSingleTagLinkingNumber(linkingNumber, fields, tag) {\n  const relevantFields = fields.filter(f => fieldHasLinkingNumber(f, linkingNumber));\n  if (relevantFields.some(f => f.tag !== tag)) {\n    return false;\n  }\n  return true;\n}\n\nfunction acceptFieldsWithSubfield8(fieldsWithSubfield8, requireSingleTag = false) {\n  const linkingNumbers = fieldsGetAllSubfield8LinkingNumbers(fieldsWithSubfield8);\n  if (linkingNumbers.some(linkingNumber => anomaly8(linkingNumber))) {\n    return false;\n  }\n  return true;\n\n  // If linking number\n  function anomaly8(linkingNumber) {\n    //nvdebug(`  Looking for anomalies in linkin number ${linkingNumber}`, debugDev);\n    const relevantFields = fieldsWithSubfield8.filter(f => fieldHasLinkingNumber(f, linkingNumber));\n    if (requireSingleTag) {\n      return !isSingleTagLinkingNumber(linkingNumber, relevantFields, relevantFields[0].tag);\n    }\n\n    const f880 = relevantFields.filter(f => f.tag === '880');\n    if (f880.length === 0 || f880.length === relevantFields.length) {\n      return false;\n    }\n    return true;\n  }\n}\n\n\nexport function sameField(field1, field2) {\n  field1.tmpMyId = 666;\n  const result = field2.tmpMyId === 666 ? true : false;\n  delete field1.tmpMyId;\n  return result;\n}\n\nexport function isChainHead(field, chain) {\n  return sameField(field, chain[0]);\n}\n\nexport function fieldToChain(field, record) {\n  if (field.deleted || !field.subfields) {\n    return [];\n  }\n  const chain = newGetAllLinkedFields(field, record, true, true);\n\n  // nvdebug(` Chain contains ${chain.length} field(s)`, debugDev);\n  if (!isChainHead(field, chain)) { // newGetAllLinkedFields() marks relevant record.fields!\n    return [];\n  }\n\n  const fieldsWithSubfield6 = chain.filter(f => fieldHasValidSubfield6(f));\n  // Hack: multiple $6 fields, but either all are non-880 or all are 880: treat field as a single entry\n  if (fieldsWithSubfield6.length > 0) {\n    const non880 = fieldsWithSubfield6.filter(f => f.tag !== '880');\n    if (non880.length === 0 || non880.length === fieldsWithSubfield6.length) {\n      return [field];\n    }\n    if (non880.length !== 1) {\n      return [field];\n    }\n  }\n\n  if (!acceptFieldsWithSubfield6(fieldsWithSubfield6)) { // Check tag subfield $6s are legal(ish)\n    return [];\n  }\n  const fieldsWithSubfield8 = chain.filter(f => fieldHasValidSubfield8(f));\n  if (!acceptFieldsWithSubfield8(fieldsWithSubfield8, false)) {\n    return [];\n  }\n\n  //nvdebug(`Proceed with ${fieldsToString(chain)}`, debugDev);\n\n\n  return chain;\n}\n\n\nfunction fieldHandleDuplicateDatafields(field, record) {\n  const chain = fieldToChain(field, record);\n  //nvdebug(` TRY TO HANDLE DUPLICATES OF '${fieldsToString(chain)}'`, debugDev);\n\n  if (chain.length === 0) {\n    return;\n  }\n\n  const fieldsWithSubfield6 = chain.filter(f => fieldHasValidSubfield6(f));\n  const fieldsWithSubfield8 = chain.filter(f => fieldHasValidSubfield8(f));\n\n  // Lone fields:\n  if (chain.length === 1) {\n    markIdenticalLoneFieldsAsDeletable(chain[0], record);\n    return;\n  }\n  if (fieldsWithSubfield6.length === 0) {\n\n    if (fieldsWithSubfield8.length === 0) { // chain.length === 1?\n      //nvdebug(` Trying to find duplicates of single field '${fieldToString(chain[0])}'`, debugDev);\n      markIdenticalLoneFieldsAsDeletable(chain[0], record);\n      return;\n    }\n    const linkingNumbers = fieldsGetAllSubfield8LinkingNumbers(fieldsWithSubfield8);\n    if (linkingNumbers.length < 2) {\n      markIdenticalSubfield6Chains(chain, record);\n      return;\n    }\n  }\n\n  if (fieldsWithSubfield6.length > 0 && acceptFieldsWithSubfield8(fieldsWithSubfield8, true)) { // Checks that non-880 tags are all same\n    // Chain is removable\n    markIdenticalSubfield6Chains(chain, record);\n    return;\n  }\n\n\n  //nvdebug(` NO HANDLER FOUND FOR '${fieldsToString(chain)}'`, debugDev);\n  //nvdebug(`  N8s: ${fieldsWithSubfield6.length}`, debugDev);\n\n}\n\n\nexport function removeDuplicateDatafields(record, fix = true) {\n  // Sometimes only $8 subfield (vs the whole field) is removed. Thus they are handled separately:\n  handleDuplicateSubfield8Chains(record, fix);\n\n  const dataFields = record.fields.filter(f => f.subfields !== undefined);\n\n  dataFields.forEach(f => fieldHandleDuplicateDatafields(f, record));\n\n  const deletableFields = dataFields.filter(f => f.deleted);\n  const modifiedFields = dataFields.filter(f => f.modified && !f.deleted);\n\n  const result = deletableFields.map(f => `DEL: ${fieldToString(f)}`);\n  if (modifiedFields.length) {\n    modifiedFields.forEach(f => delete f.modified);\n    result.push(modifiedFields.map(f => `MOD: ${fieldToString(f)}`));\n  }\n\n  if (fix) {\n    deletableFields.forEach(f => record.removeField(f));\n    return result;\n  }\n\n  deletableFields.forEach(f => delete f.deleted);\n  deletableFields.forEach(f => delete f.modified);\n\n\n  return result;\n}\n"],
+  "mappings": "AAAA,OAAO,uBAAuB;AAC9B,SAAQ,eAAe,eAAc;AACrC,SAAQ,wBAAwB,4BAA4B,0BAA0B,yBAAyB,aAAY;AAC3H,SAAQ,OAAO,uBAAuB,wBAAwB,qCAAqC,2BAA2B,qCAAqC,iDAAgD;AAEnN,MAAM,YAAY;AAClB,MAAM,uBAAuB;AAC7B,MAAM,uBAAuB;AAK7B,MAAM,QAAQ,kBAAkB,oEAAoE;AAEpG,MAAM,WAAW,MAAM,OAAO,KAAK;AAEnC,0BAA2B;AACzB,SAAO;AAAA,IACL,aAAa;AAAA,IACb;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,IAAI,QAAQ;AACnB,YAAQ,gCAAgC,QAAQ;AAChD,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAC9C,8BAA0B,QAAQ,IAAI;AAEtC,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ;AAExB,YAAQ,yDAAyD,QAAQ;AAEzE,UAAM,aAAa,0BAA0B,QAAQ,KAAK;AAI1D,UAAM,MAAM,EAAC,SAAS,WAAU;AAOhC,QAAI,QAAQ,IAAI,QAAQ,SAAS;AACjC,WAAO;AAAA,EACT;AACF;AAWA,SAAS,gBAAgB,QAAQ;AAC/B,SAAO,OAAO,QAAQ,OAAK,OAAO,EAAE,QAAQ;AAC9C;AAGA,SAAS,sBAAsB,OAAO,QAAQ,WAAW,MAAM,YAAY,MAAM;AAC/E,kBAAgB,MAAM;AAEtB,QAAM,WAAW;AAEjB,MAAI,YAAY;AAGhB,SAAO,cAAc,QAAW;AAC9B,QAAI,UAAU;AACZ,YAAM,YAAY,MAAM,WAAW,OAAO,MAAM;AAChD,gBAAU,QAAQ,OAAK,UAAU,CAAC,CAAC;AAAA,IACrC;AACA,QAAI,WAAW;AACb,YAAM,YAAY,MAAM,CAAC,SAAS,GAAG,MAAM;AAC3C,gBAAU,QAAQ,OAAK,UAAU,CAAC,CAAC;AAAA,IACrC;AACA,QAAI,UAAU,aAAa,WAAW;AACpC,gBAAU,WAAW;AAAA,IACvB;AACA,gBAAY,OAAO,OAAO,KAAK,OAAK,EAAE,aAAa,oBAAoB;AAAA,EACzE;AAGA,QAAM,eAAe,OAAO,OAAO,OAAO,OAAK,EAAE,QAAQ;AAEzD,kBAAgB,MAAM;AAEtB,SAAO;AAEP,WAAS,UAAU,GAAG;AACpB,QAAI,CAAC,EAAE,UAAU;AACf,QAAE,WAAW;AAAA,IACf;AAAA,EACF;AAEF;AAGA,SAAS,6BAA6B,QAAQ,OAAO,mBAAmB;AACtE,QAAM,SAAS,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AAC3D,MAAI,OAAO,SAAS,GAAG;AACrB,WAAO,YAAY,KAAK;AACxB;AAAA,EACF;AACA,QAAM,YAAY,MAAM,UAAU,OAAO,QAAM,0BAA0B,EAAE,MAAM,iBAAiB;AAClG,YAAU,QAAQ,QAAM,OAAO,eAAe,IAAI,KAAK,CAAC;AAC1D;AAEA,SAAS,gCAAgC,QAAQ,OAAO,mBAAmB,KAAK;AAC9E,QAAM,SAAS,MAAM,UAAU,OAAO,QAAM,GAAG,SAAS,GAAG;AAC3D,MAAI,OAAO,SAAS,GAAG;AACrB,UAAM,UAAU;AAChB;AAAA,EACF;AACA,QAAM,YAAY,MAAM,UAAU,OAAO,QAAM,0BAA0B,EAAE,MAAM,iBAAiB;AAClG,YAAU,QAAQ,QAAM;AACtB,UAAM,WAAW;AACjB,QAAI,KAAK;AACP,aAAO,eAAe,IAAI,KAAK;AAAA,IACjC;AAAA,EACF,CAAC;AACH;AAGO,gBAAS,+BAA+B,QAAQ,MAAM,MAAM;AAUjE,MAAI,OAAO,CAAC;AAEZ,MAAI,aAAa,CAAC;AAGlB,QAAM,qBAAqB,oCAAoC,MAAM;AACrE,MAAI,mBAAmB,WAAW,GAAG;AACnC,WAAO;AAAA,EACT;AAIA,qBAAmB,QAAQ,uBAAqB;AAC9C,UAAM,eAAe,0CAA0C,QAAQ,iBAAiB;AAExF,UAAM,4BAA4B;AAClC,UAAM,uBAAuB,yBAAyB,cAAc,mBAAmB,2BAA2B,IAAI;AAItH,QAAI,wBAAwB,MAAO;AACjC,UAAI,CAAC,WAAW,SAAS,oBAAoB,GAAG;AAC9C,mBAAW,KAAK,oBAAoB;AAAA,MACtC;AAEA,UAAI,KAAK;AAEP,qBAAa,QAAQ,WAAS,6BAA6B,QAAQ,OAAO,iBAAiB,CAAC;AAC5F;AAAA,MACF;AAGA;AAAA,IACF;AAEA,SAAK,oBAAoB,IAAI;AAC7B;AAAA,EACF,CAAC;AAED,SAAO;AACT;AAGO,gBAAS,+BAA+B,QAAQ,KAAK;AAU1D,MAAI,OAAO,CAAC;AAGZ,QAAM,qBAAqB,oCAAoC,MAAM;AACrE,MAAI,mBAAmB,WAAW,GAAG;AACnC;AAAA,EACF;AAIA,qBAAmB,QAAQ,uBAAqB;AAC9C,UAAM,eAAe,0CAA0C,QAAQ,iBAAiB;AAExF,UAAM,4BAA4B;AAClC,UAAM,uBAAuB,yBAAyB,cAAc,mBAAmB,2BAA2B,IAAI;AAItH,QAAI,wBAAwB,MAAO;AAEjC,mBAAa,QAAQ,WAAS,gCAAgC,QAAQ,OAAO,mBAAmB,GAAG,CAAC;AACpG;AAAA,IACF;AAEA,SAAK,oBAAoB,IAAI;AAC7B;AAAA,EACF,CAAC;AAEH;AAEA,SAAS,6BAA6B,OAAO,QAAQ;AACnD,QAAM,4BAA4B;AAClC,QAAM,eAAe,MAAM,KAAK,WAAS,MAAM,IAAI,UAAU,GAAG,CAAC,MAAM,GAAG;AAC1E,QAAM,gBAAgB,yBAAyB,OAAO,GAAG,2BAA2B,YAAY;AAGhG,SAAO,OAAO,QAAQ,OAAK,iBAAiB,CAAC,CAAC;AAG9C,WAAS,iBAAiB,GAAG;AAE3B,UAAM,aAAa,aAAa,GAAG,MAAM;AAEzC,QAAI,WAAW,WAAW,KAAK,UAAU,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,GAAG;AACjE;AAAA,IACF;AACA,UAAM,qBAAqB,yBAAyB,YAAY,GAAG,2BAA2B,YAAY;AAG1G,QAAI,kBAAkB,oBAAoB;AACxC,iBAAW,QAAQ,CAAAA,OAAK;AAEtB,QAAAA,GAAE,UAAU;AAAA,MACd,CAAC;AACD;AAAA,IACF;AAAA,EACF;AAEF;AAEA,SAAS,mCAAmC,OAAO,QAAQ;AACzD,MAAI,MAAM,SAAS;AACjB;AAAA,EACF;AAEA,QAAM,eAAe,MAAM,IAAI,UAAU,GAAG,CAAC,MAAM;AACnD,QAAM,gBAAgB,wBAAwB,OAAO,GAAG,OAAO,YAAY;AAE3E,QAAM,sBAAsB,OAAO,OAAO,OAAO,OAAK,CAAC,UAAU,GAAG,KAAK,KAAK,wBAAwB,GAAG,GAAG,OAAO,YAAY,MAAM,aAAa;AAGlJ,sBAAoB,QAAQ,OAAK;AAE/B,MAAE,UAAU;AAAA,EACd,CAAC;AAEH;AAEA,SAAS,0BAA0B,qBAAqB;AAEtD,QAAM,SAAS,oBAAoB,OAAO,OAAK,EAAE,QAAQ,KAAK;AAC9D,MAAI,OAAO,SAAS,GAAG;AACrB,WAAO;AAAA,EACT;AAEA,QAAM,oBAAoB,2BAA2B,mBAAmB;AAExE,MAAI,kBAAkB,SAAS,GAAG;AAChC,WAAO;AAAA,EACT;AAEA,SAAO;AACT;AAGA,SAAS,yBAAyB,eAAe,QAAQ,KAAK;AAC5D,QAAM,iBAAiB,OAAO,OAAO,OAAK,sBAAsB,GAAG,aAAa,CAAC;AACjF,MAAI,eAAe,KAAK,OAAK,EAAE,QAAQ,GAAG,GAAG;AAC3C,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAEA,SAAS,0BAA0B,qBAAqB,mBAAmB,OAAO;AAChF,QAAM,iBAAiB,oCAAoC,mBAAmB;AAC9E,MAAI,eAAe,KAAK,mBAAiB,SAAS,aAAa,CAAC,GAAG;AACjE,WAAO;AAAA,EACT;AACA,SAAO;AAGP,WAAS,SAAS,eAAe;AAE/B,UAAM,iBAAiB,oBAAoB,OAAO,OAAK,sBAAsB,GAAG,aAAa,CAAC;AAC9F,QAAI,kBAAkB;AACpB,aAAO,CAAC,yBAAyB,eAAe,gBAAgB,eAAe,CAAC,EAAE,GAAG;AAAA,IACvF;AAEA,UAAM,OAAO,eAAe,OAAO,OAAK,EAAE,QAAQ,KAAK;AACvD,QAAI,KAAK,WAAW,KAAK,KAAK,WAAW,eAAe,QAAQ;AAC9D,aAAO;AAAA,IACT;AACA,WAAO;AAAA,EACT;AACF;AAGO,gBAAS,UAAU,QAAQ,QAAQ;AACxC,SAAO,UAAU;AACjB,QAAM,SAAS,OAAO,YAAY,MAAM,OAAO;AAC/C,SAAO,OAAO;AACd,SAAO;AACT;AAEO,gBAAS,YAAY,OAAO,OAAO;AACxC,SAAO,UAAU,OAAO,MAAM,CAAC,CAAC;AAClC;AAEO,gBAAS,aAAa,OAAO,QAAQ;AAC1C,MAAI,MAAM,WAAW,CAAC,MAAM,WAAW;AACrC,WAAO,CAAC;AAAA,EACV;AACA,QAAM,QAAQ,sBAAsB,OAAO,QAAQ,MAAM,IAAI;AAG7D,MAAI,CAAC,YAAY,OAAO,KAAK,GAAG;AAC9B,WAAO,CAAC;AAAA,EACV;AAEA,QAAM,sBAAsB,MAAM,OAAO,OAAK,uBAAuB,CAAC,CAAC;AAEvE,MAAI,oBAAoB,SAAS,GAAG;AAClC,UAAM,SAAS,oBAAoB,OAAO,OAAK,EAAE,QAAQ,KAAK;AAC9D,QAAI,OAAO,WAAW,KAAK,OAAO,WAAW,oBAAoB,QAAQ;AACvE,aAAO,CAAC,KAAK;AAAA,IACf;AACA,QAAI,OAAO,WAAW,GAAG;AACvB,aAAO,CAAC,KAAK;AAAA,IACf;AAAA,EACF;AAEA,MAAI,CAAC,0BAA0B,mBAAmB,GAAG;AACnD,WAAO,CAAC;AAAA,EACV;AACA,QAAM,sBAAsB,MAAM,OAAO,OAAK,uBAAuB,CAAC,CAAC;AACvE,MAAI,CAAC,0BAA0B,qBAAqB,KAAK,GAAG;AAC1D,WAAO,CAAC;AAAA,EACV;AAKA,SAAO;AACT;AAGA,SAAS,+BAA+B,OAAO,QAAQ;AACrD,QAAM,QAAQ,aAAa,OAAO,MAAM;AAGxC,MAAI,MAAM,WAAW,GAAG;AACtB;AAAA,EACF;AAEA,QAAM,sBAAsB,MAAM,OAAO,OAAK,uBAAuB,CAAC,CAAC;AACvE,QAAM,sBAAsB,MAAM,OAAO,OAAK,uBAAuB,CAAC,CAAC;AAGvE,MAAI,MAAM,WAAW,GAAG;AACtB,uCAAmC,MAAM,CAAC,GAAG,MAAM;AACnD;AAAA,EACF;AACA,MAAI,oBAAoB,WAAW,GAAG;AAEpC,QAAI,oBAAoB,WAAW,GAAG;AAEpC,yCAAmC,MAAM,CAAC,GAAG,MAAM;AACnD;AAAA,IACF;AACA,UAAM,iBAAiB,oCAAoC,mBAAmB;AAC9E,QAAI,eAAe,SAAS,GAAG;AAC7B,mCAA6B,OAAO,MAAM;AAC1C;AAAA,IACF;AAAA,EACF;AAEA,MAAI,oBAAoB,SAAS,KAAK,0BAA0B,qBAAqB,IAAI,GAAG;AAE1F,iCAA6B,OAAO,MAAM;AAC1C;AAAA,EACF;AAMF;AAGO,gBAAS,0BAA0B,QAAQ,MAAM,MAAM;AAE5D,iCAA+B,QAAQ,GAAG;AAE1C,QAAM,aAAa,OAAO,OAAO,OAAO,OAAK,EAAE,cAAc,MAAS;AAEtE,aAAW,QAAQ,OAAK,+BAA+B,GAAG,MAAM,CAAC;AAEjE,QAAM,kBAAkB,WAAW,OAAO,OAAK,EAAE,OAAO;AACxD,QAAM,iBAAiB,WAAW,OAAO,OAAK,EAAE,YAAY,CAAC,EAAE,OAAO;AAEtE,QAAM,SAAS,gBAAgB,IAAI,OAAK,QAAQ,cAAc,CAAC,CAAC,EAAE;AAClE,MAAI,eAAe,QAAQ;AACzB,mBAAe,QAAQ,OAAK,OAAO,EAAE,QAAQ;AAC7C,WAAO,KAAK,eAAe,IAAI,OAAK,QAAQ,cAAc,CAAC,CAAC,EAAE,CAAC;AAAA,EACjE;AAEA,MAAI,KAAK;AACP,oBAAgB,QAAQ,OAAK,OAAO,YAAY,CAAC,CAAC;AAClD,WAAO;AAAA,EACT;AAEA,kBAAgB,QAAQ,OAAK,OAAO,EAAE,OAAO;AAC7C,kBAAgB,QAAQ,OAAK,OAAO,EAAE,QAAQ;AAG9C,SAAO;AACT;",
   "names": ["f"]
 }

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.\n// const 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    const subfield7Prepub = `${fieldAsString} \u20217 Ennakkotieto`\n    if (fieldAsString.match(/^653./u)) {\n      // MET-528 (extented by MET-575)\n      return [subfield7Prepub, `${fieldAsString} \u2021g ENNAKKOTIETO`, `${fieldAsString} \u2021g Ennakkotieto`, `${fieldAsString} \u2021g ennakkotieto`, `${fieldAsString} \u2021g ENNAKKOTIETO.`, `${fieldAsString} \u2021g Ennakkotieto.`, `${fieldAsString} \u2021g ennakkotieto.`];\n    }\n\n    return [subfield7Prepub];\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": "AACA,SAAQ,cAAc,iBAAgB;AACtC,SAAQ,+BAA+B,wBAAwB,iCAAiC,gCAA+B;AAC/H,SAAQ,kBAAkB,gBAAgB,eAA4B,iBAAgB;AACtF,SAAQ,8BAA6B;AACrC,SAAQ,yCAAyC,0CAA0C,wBAAuB;AAClH,SAAQ,2CAA0C;AAClD,SAAQ,gBAAgB,gCAA+B;AASvD,0BAA2B;AACzB,SAAO;AAAA,IACL,aAAa;AAAA,IACb;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,IAAI,QAAQ;AAEnB,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAC9C,6BAAyB,QAAQ,IAAI;AAErC,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ;AAIxB,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,UAAM,kBAAkB,GAAG,aAAa;AACxC,QAAI,cAAc,MAAM,QAAQ,GAAG;AAEjC,aAAO,CAAC,iBAAiB,GAAG,aAAa,yBAAoB,GAAG,aAAa,yBAAoB,GAAG,aAAa,yBAAoB,GAAG,aAAa,0BAAqB,GAAG,aAAa,0BAAqB,GAAG,aAAa,wBAAmB;AAAA,IACpP;AAEA,WAAO,CAAC,eAAe;AAAA,EACzB;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;AAMpD,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.\n\n// const debug = createDebugLogger('@natlibfi/marc-record-validators-melinda:removeInferiorDataFields');\n//const debugData = debug.extend('data');\n//const debugDev = debug.extend('dev');\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', debugDev);\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', debugDev);\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`, debugDev);\n  const hash = {};\n\n  fields.forEach(f => fieldToChainToDeletables(f));\n\n  return hash;\n\n  //nvdebug(`WP1: GOT ${todoList.length} CHAINS`, debugDev);\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}`, debugDev);\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)`, debugDev);\n\n  const deletableChainsAsKeys = deriveInferiorChains(fields, record);\n  const nChains = Object.keys(deletableChainsAsKeys).length;\n  //nvdebug(`WP2: GOT ${nChains} chain(s)`, debugDev);\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)`, debugDev);\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}`, debugDev);\n    const deletedString = fieldsToString(chain);\n    const message = `DEL: '${deletedString}'  REASON: '${fieldsToString(triggeringChain)}'`;\n    if (fix) {\n      //nvdebug(`INFERIOR $6 CHAIN REMOVAL: ${message}}`, debugDev);\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}`, debugDev);\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}`, debugDev);\n    nvdebug(arr.join('\\n'), debugDev);\n  }\n  */\n  return arr;\n}\n\n// eslint-disable-next-line max-lines-per-function\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}'`, debugDev)\n      //nvdebug(`505 DERIVATE: '${tmp}'`, debugDev)\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}'`, debugDev);\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}'`, debugDev);\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}`, debugDev);\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}'`, debugDev);\n    if (accentless === string) { // Don't self-destruct\n      return [];\n    }\n    return [accentless];\n  }\n\n  function getPrepublicationTerms(fieldAsString) {\n    const subfield7Prepub = `${fieldAsString} \u20217 Ennakkotieto`\n    if (fieldAsString.match(/^653./u)) {\n      // MET-528 (extented by MET-575)\n      return [subfield7Prepub, `${fieldAsString} \u2021g ENNAKKOTIETO`, `${fieldAsString} \u2021g Ennakkotieto`, `${fieldAsString} \u2021g ennakkotieto`, `${fieldAsString} \u2021g ENNAKKOTIETO.`, `${fieldAsString} \u2021g Ennakkotieto.`, `${fieldAsString} \u2021g ennakkotieto.`];\n    }\n\n    return [subfield7Prepub];\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 ')}`, debugDev);\n  // nvdebug(`Normalized deletables:\\n ${deletableFieldsAsNormalizedStrings.join('\\n ')}`, debugDev);\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)}`, debugDev);\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  ')}`, debugDev);\n  //nvdebug(`REMOVABLES 6:\\n  ${removables6.join('\\n  ')}`, debugDev);\n\n  const removablesAll = removables.concat(removables6); //.concat(removables8);\n\n  return removablesAll;\n}\n"],
+  "mappings": "AACA,SAAQ,cAAc,iBAAgB;AACtC,SAAQ,+BAA+B,wBAAwB,iCAAiC,gCAA+B;AAC/H,SAAQ,kBAAkB,gBAAgB,eAA4B,iBAAgB;AACtF,SAAQ,8BAA6B;AACrC,SAAQ,yCAAyC,0CAA0C,wBAAuB;AAClH,SAAQ,2CAA0C;AAClD,SAAQ,gBAAgB,gCAA+B;AAYvD,0BAA2B;AACzB,SAAO;AAAA,IACL,aAAa;AAAA,IACb;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,IAAI,QAAQ;AAEnB,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAC9C,6BAAyB,QAAQ,IAAI;AAErC,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ;AAIxB,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;AAGA,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,UAAM,kBAAkB,GAAG,aAAa;AACxC,QAAI,cAAc,MAAM,QAAQ,GAAG;AAEjC,aAAO,CAAC,iBAAiB,GAAG,aAAa,yBAAoB,GAAG,aAAa,yBAAoB,GAAG,aAAa,yBAAoB,GAAG,aAAa,0BAAqB,GAAG,aAAa,0BAAqB,GAAG,aAAa,wBAAmB;AAAA,IACpP;AAEA,WAAO,CAAC,eAAe;AAAA,EACzB;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;AAMpD,QAAM,gBAAgB,WAAW,OAAO,WAAW;AAEnD,SAAO;AACT;",
   "names": ["fields", "record", "inferiorTerms"]
 }

package/dist/resolveOrphanedSubfield6s.js

@@ -2,6 +2,7 @@ import createDebugLogger from "debug";
 import { fieldHasSubfield, fieldToString, nvdebug } from "./utils.js";
 import { fieldHasWantedTagAndOccurrenceNumber, isValidSubfield6, subfield6GetOccurrenceNumber, subfield6ResetOccurrenceNumber } from "./subfield6Utils.js";
 const debug = createDebugLogger("@natlibfi/marc-record-validators-melinda:resolveOrphanedSubfield6s");
+const debugDev = debug.extend("dev");
 export default function() {
   return {
     description: "Remove occurrence-number-orphaned $6 subfields. In field 880, occurrence number becomes 00",
@@ -9,13 +10,13 @@ export default function() {
     fix
   };
   function fix(record) {
-    nvdebug("Fix SF6 orphaned occurrence numbers");
+    nvdebug("Fix SF6 orphaned occurrence numbers", debugDev);
     const res = { message: [], fix: [], valid: true };
     recordFixSubfield6OccurrenceNumbers(record);
     return res;
   }
   function validate(record) {
-    nvdebug("Validate SF6 orphaned occurrence numbers", debug);
+    nvdebug("Validate SF6 orphaned occurrence numbers", debugDev);
     const fieldsContainingSubfield6 = record.fields.filter((field) => fieldHasSubfield(field, "6"));
     const orphanedFields = getOrphanedFields(fieldsContainingSubfield6);
     const res = { message: [] };

package/dist/resolveOrphanedSubfield6s.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/resolveOrphanedSubfield6s.js"],
-  "sourcesContent": ["import createDebugLogger from 'debug';\nimport {fieldHasSubfield, fieldToString, nvdebug /*, subfieldToString*/ } from './utils.js';\nimport {fieldHasWantedTagAndOccurrenceNumber, isValidSubfield6, subfield6GetOccurrenceNumber, subfield6ResetOccurrenceNumber} from './subfield6Utils.js';\n\n// Relocated from melinda-marc-record-merge-reducers (and renamed)\n\nconst debug = createDebugLogger('@natlibfi/marc-record-validators-melinda:resolveOrphanedSubfield6s');\n\nexport default function () {\n  return {\n    description: 'Remove occurrence-number-orphaned $6 subfields. In field 880, occurrence number becomes 00',\n    validate, fix\n  };\n\n  function fix(record) {\n    nvdebug('Fix SF6 orphaned occurrence numbers');\n    const res = {message: [], fix: [], valid: true};\n    //message.fix = [];\n\n    // This can not really fail...\n    recordFixSubfield6OccurrenceNumbers(record);\n\n    //message.valid = !(message.message.length >= 1);\n    return res;\n  }\n\n  function validate(record) {\n    // Check max, and check number of different indexes\n    nvdebug('Validate SF6 orphaned occurrence numbers', debug);\n    const fieldsContainingSubfield6 = record.fields.filter(field => fieldHasSubfield(field, '6'));\n\n    const orphanedFields = getOrphanedFields(fieldsContainingSubfield6);\n\n    const res = {message: []};\n\n    if (orphanedFields.length > 0) {\n      res.message = [`${orphanedFields.length} orphaned occurrence number field(s) detected`];\n    }\n    res.valid = res.message.length < 1;\n    return res;\n  }\n}\n\nfunction recordFixSubfield6OccurrenceNumbers(record) {\n  const fieldsContainingSubfield6 = record.fields.filter(field => fieldHasSubfield(field, '6'));\n  const orphanedFields = getOrphanedFields(fieldsContainingSubfield6);\n\n  orphanedFields.forEach(field => fieldFixOrphanedSubfields(field));\n\n  function fieldFixOrphanedSubfields(field) {\n    // Field 880: orphaned $6 subfields: occurrence number is changed to '00':\n    if (field.tag === '880') {\n      field.subfields.forEach(sf => field880FixOrphanedSubfield(sf));\n      return;\n    }\n    // Non-880 fields get their orphaned $6s removed:\n    const remainingSubfields = field.subfields.filter(sf => !isOrphanedSubfield(sf, field.tag, fieldsContainingSubfield6));\n    if (remainingSubfields.length === 0) {\n      record.removeField(field);\n      return;\n    }\n    field.subfields = remainingSubfields;\n  }\n\n  function field880FixOrphanedSubfield(subfield) {\n    if (!isOrphanedSubfield(subfield, '880', fieldsContainingSubfield6)) {\n      return;\n    }\n    // convert occurrence number to 00\n    subfield6ResetOccurrenceNumber(subfield, '00');\n  }\n}\n\n\nfunction findPairForSubfield6OccurrenceNumber(subfield6, myTag, candPairFields) {\n  // We keep the crap!\n  if (!isValidSubfield6(subfield6)) {\n    return undefined;\n  }\n  //nvdebug(`LOOKING FOR PAIR: ${myTag} ${subfieldToString(subfield6)}`);\n  candPairFields.forEach(field => fieldToString(field));\n\n  // Only valid $6 value that fails to map to another field is iffy...\n  const referredTag = subfield6.value.substring(0, 3);\n\n  const occurrenceNumber = subfield6GetOccurrenceNumber(subfield6);\n  if (occurrenceNumber === '00') {\n    return undefined;\n  }\n  const tagAndOccurrenceNumber = `${myTag}-${occurrenceNumber}`;\n  //nvdebug(`Try to find occurrence number ${tagAndOccurrenceNumber} in field ${referredTag}...`);\n  //const relevantFields = fields.filter(field => field.tag === referredTag && field.subfields.some(sf => subfield6GetOccurrenceNumber(sf) === occurrenceNumber));\n  const relevantFields = candPairFields.filter(field => field.tag === referredTag && fieldHasWantedTagAndOccurrenceNumber(field, tagAndOccurrenceNumber));\n  if (relevantFields.length === 0) {\n    return undefined;\n  }\n  // This should always return just one (not sanity checking this for now):\n  return relevantFields[0];\n}\n\nfunction isOrphanedSubfield(subfield, tag, pairCandidateFields) {\n  if (!isValidSubfield6(subfield) || subfield6GetOccurrenceNumber(subfield) === '00') {\n    return false;\n  }\n  return !findPairForSubfield6OccurrenceNumber(subfield, tag, pairCandidateFields);\n}\n\n\nfunction isOrphanedField(field, candidatePairFields) {\n  return field.subfields.some(sf => isOrphanedSubfield(sf, field.tag, candidatePairFields));\n}\n\nfunction getOrphanedFields(relevantFields) {\n  return relevantFields.filter(field => isOrphanedField(field, relevantFields));\n}\n"],
-  "mappings": "AAAA,OAAO,uBAAuB;AAC9B,SAAQ,kBAAkB,eAAe,eAAsC;AAC/E,SAAQ,sCAAsC,kBAAkB,8BAA8B,sCAAqC;AAInI,MAAM,QAAQ,kBAAkB,oEAAoE;AAEpG,0BAA2B;AACzB,SAAO;AAAA,IACL,aAAa;AAAA,IACb;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,IAAI,QAAQ;AACnB,YAAQ,qCAAqC;AAC7C,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAI9C,wCAAoC,MAAM;AAG1C,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ;AAExB,YAAQ,4CAA4C,KAAK;AACzD,UAAM,4BAA4B,OAAO,OAAO,OAAO,WAAS,iBAAiB,OAAO,GAAG,CAAC;AAE5F,UAAM,iBAAiB,kBAAkB,yBAAyB;AAElE,UAAM,MAAM,EAAC,SAAS,CAAC,EAAC;AAExB,QAAI,eAAe,SAAS,GAAG;AAC7B,UAAI,UAAU,CAAC,GAAG,eAAe,MAAM,+CAA+C;AAAA,IACxF;AACA,QAAI,QAAQ,IAAI,QAAQ,SAAS;AACjC,WAAO;AAAA,EACT;AACF;AAEA,SAAS,oCAAoC,QAAQ;AACnD,QAAM,4BAA4B,OAAO,OAAO,OAAO,WAAS,iBAAiB,OAAO,GAAG,CAAC;AAC5F,QAAM,iBAAiB,kBAAkB,yBAAyB;AAElE,iBAAe,QAAQ,WAAS,0BAA0B,KAAK,CAAC;AAEhE,WAAS,0BAA0B,OAAO;AAExC,QAAI,MAAM,QAAQ,OAAO;AACvB,YAAM,UAAU,QAAQ,QAAM,4BAA4B,EAAE,CAAC;AAC7D;AAAA,IACF;AAEA,UAAM,qBAAqB,MAAM,UAAU,OAAO,QAAM,CAAC,mBAAmB,IAAI,MAAM,KAAK,yBAAyB,CAAC;AACrH,QAAI,mBAAmB,WAAW,GAAG;AACnC,aAAO,YAAY,KAAK;AACxB;AAAA,IACF;AACA,UAAM,YAAY;AAAA,EACpB;AAEA,WAAS,4BAA4B,UAAU;AAC7C,QAAI,CAAC,mBAAmB,UAAU,OAAO,yBAAyB,GAAG;AACnE;AAAA,IACF;AAEA,mCAA+B,UAAU,IAAI;AAAA,EAC/C;AACF;AAGA,SAAS,qCAAqC,WAAW,OAAO,gBAAgB;AAE9E,MAAI,CAAC,iBAAiB,SAAS,GAAG;AAChC,WAAO;AAAA,EACT;AAEA,iBAAe,QAAQ,WAAS,cAAc,KAAK,CAAC;AAGpD,QAAM,cAAc,UAAU,MAAM,UAAU,GAAG,CAAC;AAElD,QAAM,mBAAmB,6BAA6B,SAAS;AAC/D,MAAI,qBAAqB,MAAM;AAC7B,WAAO;AAAA,EACT;AACA,QAAM,yBAAyB,GAAG,KAAK,IAAI,gBAAgB;AAG3D,QAAM,iBAAiB,eAAe,OAAO,WAAS,MAAM,QAAQ,eAAe,qCAAqC,OAAO,sBAAsB,CAAC;AACtJ,MAAI,eAAe,WAAW,GAAG;AAC/B,WAAO;AAAA,EACT;AAEA,SAAO,eAAe,CAAC;AACzB;AAEA,SAAS,mBAAmB,UAAU,KAAK,qBAAqB;AAC9D,MAAI,CAAC,iBAAiB,QAAQ,KAAK,6BAA6B,QAAQ,MAAM,MAAM;AAClF,WAAO;AAAA,EACT;AACA,SAAO,CAAC,qCAAqC,UAAU,KAAK,mBAAmB;AACjF;AAGA,SAAS,gBAAgB,OAAO,qBAAqB;AACnD,SAAO,MAAM,UAAU,KAAK,QAAM,mBAAmB,IAAI,MAAM,KAAK,mBAAmB,CAAC;AAC1F;AAEA,SAAS,kBAAkB,gBAAgB;AACzC,SAAO,eAAe,OAAO,WAAS,gBAAgB,OAAO,cAAc,CAAC;AAC9E;",
+  "sourcesContent": ["import createDebugLogger from 'debug';\nimport {fieldHasSubfield, fieldToString, nvdebug /*, subfieldToString*/ } from './utils.js';\nimport {fieldHasWantedTagAndOccurrenceNumber, isValidSubfield6, subfield6GetOccurrenceNumber, subfield6ResetOccurrenceNumber} from './subfield6Utils.js';\n\n// Relocated from melinda-marc-record-merge-reducers (and renamed)\n\nconst debug = createDebugLogger('@natlibfi/marc-record-validators-melinda:resolveOrphanedSubfield6s');\n//const debugData = debug.extend('data');\nconst debugDev = debug.extend('dev');\n\nexport default function () {\n  return {\n    description: 'Remove occurrence-number-orphaned $6 subfields. In field 880, occurrence number becomes 00',\n    validate, fix\n  };\n\n  function fix(record) {\n    nvdebug('Fix SF6 orphaned occurrence numbers', debugDev);\n    const res = {message: [], fix: [], valid: true};\n    //message.fix = [];\n\n    // This can not really fail...\n    recordFixSubfield6OccurrenceNumbers(record);\n\n    //message.valid = !(message.message.length >= 1);\n    return res;\n  }\n\n  function validate(record) {\n    // Check max, and check number of different indexes\n    nvdebug('Validate SF6 orphaned occurrence numbers', debugDev);\n    const fieldsContainingSubfield6 = record.fields.filter(field => fieldHasSubfield(field, '6'));\n\n    const orphanedFields = getOrphanedFields(fieldsContainingSubfield6);\n\n    const res = {message: []};\n\n    if (orphanedFields.length > 0) {\n      res.message = [`${orphanedFields.length} orphaned occurrence number field(s) detected`];\n    }\n    res.valid = res.message.length < 1;\n    return res;\n  }\n}\n\nfunction recordFixSubfield6OccurrenceNumbers(record) {\n  const fieldsContainingSubfield6 = record.fields.filter(field => fieldHasSubfield(field, '6'));\n  const orphanedFields = getOrphanedFields(fieldsContainingSubfield6);\n\n  orphanedFields.forEach(field => fieldFixOrphanedSubfields(field));\n\n  function fieldFixOrphanedSubfields(field) {\n    // Field 880: orphaned $6 subfields: occurrence number is changed to '00':\n    if (field.tag === '880') {\n      field.subfields.forEach(sf => field880FixOrphanedSubfield(sf));\n      return;\n    }\n    // Non-880 fields get their orphaned $6s removed:\n    const remainingSubfields = field.subfields.filter(sf => !isOrphanedSubfield(sf, field.tag, fieldsContainingSubfield6));\n    if (remainingSubfields.length === 0) {\n      record.removeField(field);\n      return;\n    }\n    field.subfields = remainingSubfields;\n  }\n\n  function field880FixOrphanedSubfield(subfield) {\n    if (!isOrphanedSubfield(subfield, '880', fieldsContainingSubfield6)) {\n      return;\n    }\n    // convert occurrence number to 00\n    subfield6ResetOccurrenceNumber(subfield, '00');\n  }\n}\n\n\nfunction findPairForSubfield6OccurrenceNumber(subfield6, myTag, candPairFields) {\n  // We keep the crap!\n  if (!isValidSubfield6(subfield6)) {\n    return undefined;\n  }\n  //nvdebug(`LOOKING FOR PAIR: ${myTag} ${subfieldToString(subfield6)}`, debugDev);\n  candPairFields.forEach(field => fieldToString(field));\n\n  // Only valid $6 value that fails to map to another field is iffy...\n  const referredTag = subfield6.value.substring(0, 3);\n\n  const occurrenceNumber = subfield6GetOccurrenceNumber(subfield6);\n  if (occurrenceNumber === '00') {\n    return undefined;\n  }\n  const tagAndOccurrenceNumber = `${myTag}-${occurrenceNumber}`;\n  //nvdebug(`Try to find occurrence number ${tagAndOccurrenceNumber} in field ${referredTag}...`, debugDev);\n  //const relevantFields = fields.filter(field => field.tag === referredTag && field.subfields.some(sf => subfield6GetOccurrenceNumber(sf) === occurrenceNumber));\n  const relevantFields = candPairFields.filter(field => field.tag === referredTag && fieldHasWantedTagAndOccurrenceNumber(field, tagAndOccurrenceNumber));\n  if (relevantFields.length === 0) {\n    return undefined;\n  }\n  // This should always return just one (not sanity checking this for now):\n  return relevantFields[0];\n}\n\nfunction isOrphanedSubfield(subfield, tag, pairCandidateFields) {\n  if (!isValidSubfield6(subfield) || subfield6GetOccurrenceNumber(subfield) === '00') {\n    return false;\n  }\n  return !findPairForSubfield6OccurrenceNumber(subfield, tag, pairCandidateFields);\n}\n\n\nfunction isOrphanedField(field, candidatePairFields) {\n  return field.subfields.some(sf => isOrphanedSubfield(sf, field.tag, candidatePairFields));\n}\n\nfunction getOrphanedFields(relevantFields) {\n  return relevantFields.filter(field => isOrphanedField(field, relevantFields));\n}\n"],
+  "mappings": "AAAA,OAAO,uBAAuB;AAC9B,SAAQ,kBAAkB,eAAe,eAAsC;AAC/E,SAAQ,sCAAsC,kBAAkB,8BAA8B,sCAAqC;AAInI,MAAM,QAAQ,kBAAkB,oEAAoE;AAEpG,MAAM,WAAW,MAAM,OAAO,KAAK;AAEnC,0BAA2B;AACzB,SAAO;AAAA,IACL,aAAa;AAAA,IACb;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,IAAI,QAAQ;AACnB,YAAQ,uCAAuC,QAAQ;AACvD,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAI9C,wCAAoC,MAAM;AAG1C,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ;AAExB,YAAQ,4CAA4C,QAAQ;AAC5D,UAAM,4BAA4B,OAAO,OAAO,OAAO,WAAS,iBAAiB,OAAO,GAAG,CAAC;AAE5F,UAAM,iBAAiB,kBAAkB,yBAAyB;AAElE,UAAM,MAAM,EAAC,SAAS,CAAC,EAAC;AAExB,QAAI,eAAe,SAAS,GAAG;AAC7B,UAAI,UAAU,CAAC,GAAG,eAAe,MAAM,+CAA+C;AAAA,IACxF;AACA,QAAI,QAAQ,IAAI,QAAQ,SAAS;AACjC,WAAO;AAAA,EACT;AACF;AAEA,SAAS,oCAAoC,QAAQ;AACnD,QAAM,4BAA4B,OAAO,OAAO,OAAO,WAAS,iBAAiB,OAAO,GAAG,CAAC;AAC5F,QAAM,iBAAiB,kBAAkB,yBAAyB;AAElE,iBAAe,QAAQ,WAAS,0BAA0B,KAAK,CAAC;AAEhE,WAAS,0BAA0B,OAAO;AAExC,QAAI,MAAM,QAAQ,OAAO;AACvB,YAAM,UAAU,QAAQ,QAAM,4BAA4B,EAAE,CAAC;AAC7D;AAAA,IACF;AAEA,UAAM,qBAAqB,MAAM,UAAU,OAAO,QAAM,CAAC,mBAAmB,IAAI,MAAM,KAAK,yBAAyB,CAAC;AACrH,QAAI,mBAAmB,WAAW,GAAG;AACnC,aAAO,YAAY,KAAK;AACxB;AAAA,IACF;AACA,UAAM,YAAY;AAAA,EACpB;AAEA,WAAS,4BAA4B,UAAU;AAC7C,QAAI,CAAC,mBAAmB,UAAU,OAAO,yBAAyB,GAAG;AACnE;AAAA,IACF;AAEA,mCAA+B,UAAU,IAAI;AAAA,EAC/C;AACF;AAGA,SAAS,qCAAqC,WAAW,OAAO,gBAAgB;AAE9E,MAAI,CAAC,iBAAiB,SAAS,GAAG;AAChC,WAAO;AAAA,EACT;AAEA,iBAAe,QAAQ,WAAS,cAAc,KAAK,CAAC;AAGpD,QAAM,cAAc,UAAU,MAAM,UAAU,GAAG,CAAC;AAElD,QAAM,mBAAmB,6BAA6B,SAAS;AAC/D,MAAI,qBAAqB,MAAM;AAC7B,WAAO;AAAA,EACT;AACA,QAAM,yBAAyB,GAAG,KAAK,IAAI,gBAAgB;AAG3D,QAAM,iBAAiB,eAAe,OAAO,WAAS,MAAM,QAAQ,eAAe,qCAAqC,OAAO,sBAAsB,CAAC;AACtJ,MAAI,eAAe,WAAW,GAAG;AAC/B,WAAO;AAAA,EACT;AAEA,SAAO,eAAe,CAAC;AACzB;AAEA,SAAS,mBAAmB,UAAU,KAAK,qBAAqB;AAC9D,MAAI,CAAC,iBAAiB,QAAQ,KAAK,6BAA6B,QAAQ,MAAM,MAAM;AAClF,WAAO;AAAA,EACT;AACA,SAAO,CAAC,qCAAqC,UAAU,KAAK,mBAAmB;AACjF;AAGA,SAAS,gBAAgB,OAAO,qBAAqB;AACnD,SAAO,MAAM,UAAU,KAAK,QAAM,mBAAmB,IAAI,MAAM,KAAK,mBAAmB,CAAC;AAC1F;AAEA,SAAS,kBAAkB,gBAAgB;AACzC,SAAO,eAAe,OAAO,WAAS,gBAAgB,OAAO,cAAc,CAAC;AAC9E;",
   "names": []
 }

package/dist/sortSubfields.js

@@ -121,7 +121,7 @@ function getSubfieldSortOrder(field) {
     return entry[0].sortOrder;
   }
   if (!["300"].includes(field.tag)) {
-    nvdebug(`WARNING!	No subfield order found for ${field.tag}.`);
+    nvdebug(`WARNING!	No subfield order found for ${field.tag}.`, debugDev);
   }
   return [];
 }

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 = '863abcdefghijklmnopqrstuvwxyz4201759'; // NB! We Finns like $2 before $0 in 6XX...\nconst defaultSortOrderStringOthers = '863abcdefghijklmnopqrstuvwxyz4021759'; // NB 760-788 have '7' in different position...\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 sortOrderFor7XXLinkingEntries = ['8', '7', 'i', 'a', 's', 't', 'b', 'c', 'd', 'm', 'h', 'k', 'o', 'x', 'z', 'g', 'q', 'w', '0', '1', 'l', '9', '5'];\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  // rda mus: 041: k < h < e < n < g < m < j (I think h<e is bad)\n  // rda: g < h, j < p < h, i < j, k < h\n  // loc: b < j, $m follows $b or $g\n  // NV: $a \n  {'tag': '041', 'sortOrder': ['8', 'a', 'd', 'e', 'b', 'f',  'i', 'j', 'p', 'k', 'h', 'n', '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': sortOrderFor7XXLinkingEntries},\n  {'tag': '762', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '765', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '767', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '770', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '772', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '773', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '774', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '775', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '776', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '777', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '780', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '785', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '786', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '787', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '788', 'sortOrder': sortOrderFor7XXLinkingEntries},\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  if (!['300'].includes(field.tag)) { // Lis tags which use normal $a...$z order here!\n    nvdebug(`WARNING!\\tNo subfield order found for ${field.tag}.`);\n  }\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,gCAAgC,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACxJ,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;AAAA;AAAA;AAAA;AAAA,EAK/D,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA;AAAA,EACnG,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,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,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,MAAI,CAAC,CAAC,KAAK,EAAE,SAAS,MAAM,GAAG,GAAG;AAChC,YAAQ,wCAAyC,MAAM,GAAG,GAAG;AAAA,EAC/D;AACA,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;",
+  "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 = '863abcdefghijklmnopqrstuvwxyz4201759'; // NB! We Finns like $2 before $0 in 6XX...\nconst defaultSortOrderStringOthers = '863abcdefghijklmnopqrstuvwxyz4021759'; // NB 760-788 have '7' in different position...\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 sortOrderFor7XXLinkingEntries = ['8', '7', 'i', 'a', 's', 't', 'b', 'c', 'd', 'm', 'h', 'k', 'o', 'x', 'z', 'g', 'q', 'w', '0', '1', 'l', '9', '5'];\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  // rda mus: 041: k < h < e < n < g < m < j (I think h<e is bad)\n  // rda: g < h, j < p < h, i < j, k < h\n  // loc: b < j, $m follows $b or $g\n  // NV: $a \n  {'tag': '041', 'sortOrder': ['8', 'a', 'd', 'e', 'b', 'f',  'i', 'j', 'p', 'k', 'h', 'n', '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': sortOrderFor7XXLinkingEntries},\n  {'tag': '762', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '765', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '767', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '770', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '772', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '773', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '774', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '775', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '776', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '777', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '780', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '785', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '786', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '787', 'sortOrder': sortOrderFor7XXLinkingEntries},\n  {'tag': '788', 'sortOrder': sortOrderFor7XXLinkingEntries},\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  if (!['300'].includes(field.tag)) { // Lis tags which use normal $a...$z order here!\n    nvdebug(`WARNING!\\tNo subfield order found for ${field.tag}.`, debugDev);\n  }\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(', ')}`, debugDev);\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(', ')}`, debugDev);\n  //if (sortOrder === null) { return field; } //// Currently always sort..\n  //nvdebug(`IN:  ${fieldToString(field)}`, debugDev);\n  swapSubfields(field, subfieldOrder);\n  //nvdebug(`OUT: ${fieldToString(field)}`, debugDev);\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,gCAAgC,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG;AACxJ,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;AAAA;AAAA;AAAA;AAAA,EAK/D,EAAC,OAAO,OAAO,aAAa,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAM,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,GAAG,EAAC;AAAA;AAAA,EACnG,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,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,EAAC,OAAO,OAAO,aAAa,8BAA6B;AAAA,EACzD,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,MAAI,CAAC,CAAC,KAAK,EAAE,SAAS,MAAM,GAAG,GAAG;AAChC,YAAQ,wCAAyC,MAAM,GAAG,KAAK,QAAQ;AAAA,EACzE;AACA,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/stripPunctuation.js

@@ -1,7 +1,8 @@
 import { fieldGetFixedString, fieldNeedsModification, fieldStripPunctuation } from "./punctuation2.js";
 import createDebugLogger from "debug";
-import { fieldToString } from "./utils.js";
+import { fieldToString, nvdebug } from "./utils.js";
 const debug = createDebugLogger("@natlibfi/marc-record-validators-melinda/punctuation2");
+const debugDev = debug.extend("dev");
 const description = "Strip punctuation in data fields";
 export default function() {
   return {
@@ -10,13 +11,13 @@ export default function() {
     fix
   };
   function fix(record) {
-    debug(`${description}: fixer`);
+    nvdebug(`${description}: fixer`, debugDev);
     const res = { message: [], fix: [], valid: true };
     record.fields.forEach((f) => fieldStripPunctuation(f));
     return res;
   }
   function validate(record) {
-    debug(`${description}: validate`);
+    nvdebug(`${description}: validate`, debugDev);
     const fieldsNeedingModification = record.fields.filter((f) => fieldNeedsModification(f, false));
     const values = fieldsNeedingModification.map((f) => fieldToString(f));
     const newValues = fieldsNeedingModification.map((f) => fieldGetFixedString(f, false));

package/dist/stripPunctuation.js.map

@@ -1,7 +1,7 @@
 {
   "version": 3,
   "sources": ["../src/stripPunctuation.js"],
-  "sourcesContent": ["/*\n* stripPunctuation.js -- try and remove a marc field punctuation (based on and reverse of punctuation2.js)\n*\n* Author(s): Nicholas Volk <nicholas.volk@helsinki.fi>\n*\n*/\n\nimport {fieldGetFixedString, fieldNeedsModification, fieldStripPunctuation} from './punctuation2.js';\nimport createDebugLogger from 'debug';\n\nimport {fieldToString} from './utils.js';\n\nconst debug = createDebugLogger('@natlibfi/marc-record-validators-melinda/punctuation2');\n\nconst description =  'Strip punctuation in data fields';\n\nexport default function () {\n  return {\n    description: description,\n    validate, fix\n  };\n\n  function fix(record) {\n    debug(`${description}: fixer`);\n    const res = {message: [], fix: [], valid: true};\n    record.fields.forEach(f => fieldStripPunctuation(f));\n    return res;\n  }\n\n  function validate(record) {\n    debug(`${description}: validate`);\n\n    const fieldsNeedingModification = record.fields.filter(f => fieldNeedsModification(f, false));\n\n    const values = fieldsNeedingModification.map(f => fieldToString(f));\n    const newValues = fieldsNeedingModification.map(f => fieldGetFixedString(f, false));\n\n    const messages = values.map((val, i) => `'${val}' => '${newValues[i]}'`);\n\n    const res = {message: messages};\n\n    res.valid = res.message.length < 1;\n    return res;\n  }\n}\n"],
-  "mappings": "AAOA,SAAQ,qBAAqB,wBAAwB,6BAA4B;AACjF,OAAO,uBAAuB;AAE9B,SAAQ,qBAAoB;AAE5B,MAAM,QAAQ,kBAAkB,uDAAuD;AAEvF,MAAM,cAAe;AAErB,0BAA2B;AACzB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,IAAI,QAAQ;AACnB,UAAM,GAAG,WAAW,SAAS;AAC7B,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAC9C,WAAO,OAAO,QAAQ,OAAK,sBAAsB,CAAC,CAAC;AACnD,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ;AACxB,UAAM,GAAG,WAAW,YAAY;AAEhC,UAAM,4BAA4B,OAAO,OAAO,OAAO,OAAK,uBAAuB,GAAG,KAAK,CAAC;AAE5F,UAAM,SAAS,0BAA0B,IAAI,OAAK,cAAc,CAAC,CAAC;AAClE,UAAM,YAAY,0BAA0B,IAAI,OAAK,oBAAoB,GAAG,KAAK,CAAC;AAElF,UAAM,WAAW,OAAO,IAAI,CAAC,KAAK,MAAM,IAAI,GAAG,SAAS,UAAU,CAAC,CAAC,GAAG;AAEvE,UAAM,MAAM,EAAC,SAAS,SAAQ;AAE9B,QAAI,QAAQ,IAAI,QAAQ,SAAS;AACjC,WAAO;AAAA,EACT;AACF;",
+  "sourcesContent": ["/*\n* stripPunctuation.js -- try and remove a marc field punctuation (based on and reverse of punctuation2.js)\n*\n* Author(s): Nicholas Volk <nicholas.volk@helsinki.fi>\n*\n*/\n\nimport {fieldGetFixedString, fieldNeedsModification, fieldStripPunctuation} from './punctuation2.js';\nimport createDebugLogger from 'debug';\n\nimport {fieldToString, nvdebug} from './utils.js';\n\nconst debug = createDebugLogger('@natlibfi/marc-record-validators-melinda/punctuation2');\n//const debugData = debug.extend('data');\nconst debugDev = debug.extend('dev');\n\nconst description =  'Strip punctuation in data fields';\n\nexport default function () {\n  return {\n    description: description,\n    validate, fix\n  };\n\n  function fix(record) {\n    nvdebug(`${description}: fixer`, debugDev);\n    const res = {message: [], fix: [], valid: true};\n    record.fields.forEach(f => fieldStripPunctuation(f));\n    return res;\n  }\n\n  function validate(record) {\n    nvdebug(`${description}: validate`, debugDev);\n\n    const fieldsNeedingModification = record.fields.filter(f => fieldNeedsModification(f, false));\n\n    const values = fieldsNeedingModification.map(f => fieldToString(f));\n    const newValues = fieldsNeedingModification.map(f => fieldGetFixedString(f, false));\n\n    const messages = values.map((val, i) => `'${val}' => '${newValues[i]}'`);\n\n    const res = {message: messages};\n\n    res.valid = res.message.length < 1;\n    return res;\n  }\n}\n"],
+  "mappings": "AAOA,SAAQ,qBAAqB,wBAAwB,6BAA4B;AACjF,OAAO,uBAAuB;AAE9B,SAAQ,eAAe,eAAc;AAErC,MAAM,QAAQ,kBAAkB,uDAAuD;AAEvF,MAAM,WAAW,MAAM,OAAO,KAAK;AAEnC,MAAM,cAAe;AAErB,0BAA2B;AACzB,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IAAU;AAAA,EACZ;AAEA,WAAS,IAAI,QAAQ;AACnB,YAAQ,GAAG,WAAW,WAAW,QAAQ;AACzC,UAAM,MAAM,EAAC,SAAS,CAAC,GAAG,KAAK,CAAC,GAAG,OAAO,KAAI;AAC9C,WAAO,OAAO,QAAQ,OAAK,sBAAsB,CAAC,CAAC;AACnD,WAAO;AAAA,EACT;AAEA,WAAS,SAAS,QAAQ;AACxB,YAAQ,GAAG,WAAW,cAAc,QAAQ;AAE5C,UAAM,4BAA4B,OAAO,OAAO,OAAO,OAAK,uBAAuB,GAAG,KAAK,CAAC;AAE5F,UAAM,SAAS,0BAA0B,IAAI,OAAK,cAAc,CAAC,CAAC;AAClE,UAAM,YAAY,0BAA0B,IAAI,OAAK,oBAAoB,GAAG,KAAK,CAAC;AAElF,UAAM,WAAW,OAAO,IAAI,CAAC,KAAK,MAAM,IAAI,GAAG,SAAS,UAAU,CAAC,CAAC,GAAG;AAEvE,UAAM,MAAM,EAAC,SAAS,SAAQ;AAE9B,QAAI,QAAQ,IAAI,QAAQ,SAAS;AACjC,WAAO;AAAA,EACT;AACF;",
   "names": []
 }

package/dist/subfield6Utils.js

@@ -1,5 +1,8 @@
+import createDebugLogger from "debug";
 import { add8s, fieldsGetAllSubfield8LinkingNumbers, getSubfield8LinkingNumber, isValidSubfield8 } from "./subfield8Utils.js";
 import { fieldHasSubfield, fieldToString, nvdebug, subfieldToString } from "./utils.js";
+const debug = createDebugLogger("@natlibfi/melinda-marc-record-merge-reducers:subfield6Utils");
+const debugDev = debug.extend("dev");
 const sf6Regexp = /^[0-9][0-9][0-9]-(?:[0-9][0-9]|[1-9][0-9]+)(?:[^0-9].*)?$/u;
 export function isValidSubfield6(subfield) {
   if (subfield.code !== "6") {
@@ -140,7 +143,7 @@ export function fieldGetOccurrenceNumberPairs(field, candFields) {
   if (pairs.length === 0) {
     return pairs;
   }
-  pairs.forEach((pairedField) => nvdebug(`  '${fieldToString(pairedField)}'`));
+  pairs.forEach((pairedField) => nvdebug(`  '${fieldToString(pairedField)}'`, debugDev));
   return pairs;
 }
 export function fieldGetOccurrenceNumbers(field) {