{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"CompressedTreeDecoder.decode (cyclomatic 99): CompressedTreeDecoder.decode has cyclomatic complexity 99 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/CompressedTreeDecoder.java"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d780b75c8852f1fb9cfceb55f4109a93ac724392892384b6751fcf8a283978"}},{"ruleId":"D1","level":"warning","message":{"text":"1.applyConfigOptions (cyclomatic 96): 1.applyConfigOptions has cyclomatic complexity 96 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"74584727a629798ad9e3f9ae5e7c81dd9723b2fd1e1e8269788d414a2969f42a"}},{"ruleId":"D1","level":"warning","message":{"text":"3.applyConfigOptions (cyclomatic 58): 3.applyConfigOptions has cyclomatic complexity 58 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21eb0a7aaaf0113e3c160da47d947d27802d87a7e2f108bb661b0bbdd80a3ee"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkLogicInputFormat.getSplits (cyclomatic 55): MarkLogicInputFormat.getSplits has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4775c5fa330bbe1be77ec534e600d57151d85f7d413c2160ea974d37b8a6758e"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseContentWriter.write (cyclomatic 52): DatabaseContentWriter.write has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4550f0c359c49cdb5bc197ba4421d76ea7898f1e2270b8bd63104159878765a"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformWriter.addValue (cyclomatic 46): TransformWriter.addValue has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"908af42c6086d571b649982433209fb2e1221b6b9f3ff06ef16633c9acf1a273"}},{"ruleId":"D1","level":"warning","message":{"text":"AggregateXMLReader.processStartElement (cyclomatic 44): AggregateXMLReader.processStartElement has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8775633e957b2958e461fbcf8c2a020d8e99d7436111e72037640de63d97eaeb"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseTransformWriter.write (cyclomatic 44): DatabaseTransformWriter.write has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcf65bad056b5b4555a50699acae2f7d460ec05683b2befbab0785b717a066a"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpandedTree.write (cyclomatic 38): ExpandedTree.write has cyclomatic complexity 38 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"5774c0359214ef1cec7b5852d3918b47d7691cee0fa4fea95783adf1c2d774f4"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentPump.runCommand (cyclomatic 36): ContentPump.runCommand has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentPump.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"77cb13d650edef75a790428f81e33ae755fd692ae35a68c56f2f222f030da762"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkLogicRecordReader.init (cyclomatic 36): MarkLogicRecordReader.init has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7262e545aa3ed0d936ac391b075a67c258510cebe23da29582cdc134c5383d"}},{"ruleId":"D1","level":"warning","message":{"text":"2.applyConfigOptions (cyclomatic 34): 2.applyConfigOptions has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ff916d1876eb5e3093908c49d2d9718fb49e95bafee5374bb1491ceb916a91b"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseContentReader.nextKeyValue (cyclomatic 34): DatabaseContentReader.nextKeyValue has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6a1bd9fc609988f8546bf613fc8a9c30ad5f3e3e57fbfa86abcdf2934c5f15"}},{"ruleId":"D1","level":"warning","message":{"text":"DelimitedTextReader.nextKeyValue (cyclomatic 34): DelimitedTextReader.nextKeyValue has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextReader.java"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea9601ae1ff39ac9e1830c90105d71f65466482d2e637258b118ff455bbf185"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentOutputFormat.initialize (cyclomatic 33): ContentOutputFormat.initialize has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3029e49eb4b7948d2b60381869206e0494108aa8f9a4bd1ebd887e70c2d0ee"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentWriter.\u003Cinit\u003E (cyclomatic 32): ContentWriter.\u003Cinit\u003E has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"43089a1db7fb11e33fe5ee21eda02e446c984d982157790799815d0d67cf5b34"}},{"ruleId":"D1","level":"warning","message":{"text":"ForestInputFormat.getSplits (cyclomatic 32): ForestInputFormat.getSplits has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestInputFormat.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c284680a5112904e784f6a545aed146f402098c7a7a9161f64d72996f9b843"}},{"ruleId":"D1","level":"warning","message":{"text":"MarkLogicInputFormat.getForestSplits (cyclomatic 31): MarkLogicInputFormat.getForestSplits has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a457284db9b24f8c23cf31ce31cc4d8050064f09567bdf4212e9dc3fa12733bc"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentWriter.write (cyclomatic 30): ContentWriter.write has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"454460e416a3515f9122e952cec572975f46cbaee67027a87a33aae83178c93d"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpandedTree.readFields (cyclomatic 29): ExpandedTree.readFields has cyclomatic complexity 29 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2990fb2a113544efffff2f9deb7ec2c83b692980bdf76d265cc1045bfd286a"}},{"ruleId":"D1","level":"warning","message":{"text":"FCheck.decodeTreeData (cyclomatic 28): FCheck.decodeTreeData has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdaa5fe284bbf11fe8dd702207d6ef7b3e81677761d9ee106478bf75752f07e"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseContentReader.init (cyclomatic 27): DatabaseContentReader.init has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"560e029508c61f8a34919be782bed7b7469249ceae547545c3c77ba9086fc39c"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseContentReader.parseMetadata (cyclomatic 27): DatabaseContentReader.parseMetadata has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b8c385d737d445ae6442c6f0d3e0e429dd02d43ff82618e4a58f69a3c25d47"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentOutputFormat.queryForestInfo (cyclomatic 27): ContentOutputFormat.queryForestInfo has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7768d5f9b538d4a63e3fa97643d053473a8013708bc68362b566431565f893"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseContentWriter.close (cyclomatic 26): DatabaseContentWriter.close has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c63061129a5f9c86f39912c145f1911e8d1e0452f6581c62dbbe1f956df86da"}},{"ruleId":"D1","level":"warning","message":{"text":"InternalUtilities.assignResultValue (cyclomatic 26): InternalUtilities.assignResultValue has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47fd7580d89abbe31893376813cfe6b69a060091a409cac45eca6bb1c8aa512"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentOutputFormat.checkOutputSpecs (cyclomatic 26): ContentOutputFormat.checkOutputSpecs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e69127cf51c58a4a84394b718912bd0a18f2a01a57c526ffaed0500554f147e"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentWriter.insertBatch (cyclomatic 26): ContentWriter.insertBatch has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"9859220de838b41492437e8111977f7c1fcd381224ac52506da3d30cd7edd009"}},{"ruleId":"D1","level":"warning","message":{"text":"CompressedTreeDecoder.assignOrdinals (cyclomatic 25): CompressedTreeDecoder.assignOrdinals has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/CompressedTreeDecoder.java"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9ca0c4fadc32ba76f4858f13bfcce59ad64d69536e5e02c7bfdaf486d9003c"}},{"ruleId":"D1","level":"warning","message":{"text":"AggregateXMLReader.nextKeyValue (cyclomatic 24): AggregateXMLReader.nextKeyValue has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"abab0a00e133ba02967b5e414a1df77d3ef9e00ab096b6968f64aab84f20ac86"}},{"ruleId":"D1","level":"warning","message":{"text":"ArchiveWriter.write (cyclomatic 24): ArchiveWriter.write has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ArchiveWriter.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"beaf41f7836bd086c547404c018986bb9770800733f094f87ed8371a3c65c003"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformWriter.write (cyclomatic 23): TransformWriter.write has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ecc5a73d686bca2a18c76f0be2989dfe3d0c383b13d0bed2225f7e6ffeb5a2"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentWriter.close (cyclomatic 22): ContentWriter.close has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d19c7bcda4255705d811b43b461e5fbaa90a038d4cba4aacdb6bc347fc9840d"}},{"ruleId":"D1","level":"warning","message":{"text":"ForestReader.applyFilter (cyclomatic 22): ForestReader.applyFilter has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestReader.java"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"023f2067b8da735fa3cfaf1bd31dc8904fc3fd455bf025dc6219cd4bcc86656f"}},{"ruleId":"D1","level":"warning","message":{"text":"ThreadPoller.run (cyclomatic 21): ThreadPoller.run has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"044b45fd470d3bd749f83a5df414e3ca2896af820330d3e2ea6b8c6dd6507abc"}},{"ruleId":"D1","level":"warning","message":{"text":"ContentWriter.createContent (cyclomatic 21): ContentWriter.createContent has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6053a1acf6d3d2ea33a7eadc6a8d98021a826c99389f8c03bce1e752c90dcd"}},{"ruleId":"D1","level":"warning","message":{"text":"ForestReader.getNextTree (cyclomatic 21): ForestReader.getNextTree has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestReader.java"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc446b410f836a7017d19d9ad449ecf788f8eae94d9e52b6b7cb729449e12b2b"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformWriter.insertBatch (cyclomatic 20): TransformWriter.insertBatch has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"600a14d798ec20ea58e4d8d7d2df33ec136381979620bc490eda9583773d5b5d"}},{"ruleId":"D1","level":"warning","message":{"text":"LocalJobRunner.run (cyclomatic 19): LocalJobRunner.run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/LocalJobRunner.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb65b6abc9b689dfa08a7321a5954672da3208ca328e8226b0dbe765e7a8d78"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitDelimitedTextReader.nextKeyValue (cyclomatic 19): SplitDelimitedTextReader.nextKeyValue has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c07985157f1abf4adbe9c19c54e41f0cc1c1b9fba2b28ad85a2978829dba3d"}},{"ruleId":"D1","level":"warning","message":{"text":"FCheck.checkTreeIndex (cyclomatic 19): FCheck.checkTreeIndex has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e19f766eea0b74dc8f0030bbd2a3d49a058c97a7542acf50a5f12d9e90c83b"}},{"ruleId":"D1","level":"warning","message":{"text":"AggregateXMLReader.processEndElement (cyclomatic 18): AggregateXMLReader.processEndElement has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb7f9bea1a0085d5b7d30dedda9e6539fe189ed21773a7343822caa69ba7536"}},{"ruleId":"D1","level":"warning","message":{"text":"Command.applyFilteringConfigOptions (cyclomatic 18): Command.applyFilteringConfigOptions has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9cb4552e588ddc71938b83793b974905d7eb6a6be4294f916d35d235fc310d"}},{"ruleId":"D1","level":"warning","message":{"text":"1.applyUriId (cyclomatic 18): 1.applyUriId has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c9d515ae582520a6b01285190949439c4082b16bec8ebaa0a0b47182b1f3a3"}},{"ruleId":"D1","level":"warning","message":{"text":"SingleDocumentWriter.write (cyclomatic 18): SingleDocumentWriter.write has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/SingleDocumentWriter.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2a76da54f3797b34694ed1830089629dfe4e0ea1f9ab66d15e8d60e5b11280"}},{"ruleId":"D1","level":"warning","message":{"text":"TransformWriter.close (cyclomatic 18): TransformWriter.close has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd1d20c3d9599cd34eee47cf77f022926515d10b86567bc9442ad6fea843cc4"}},{"ruleId":"D1","level":"warning","message":{"text":"2.init (cyclomatic 18): 2.init has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/NodeImpl.java"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"0237ae5fa0fe8f08cc50372656a6a4d1ec3d028840547dd216d54feb323ee64d"}},{"ruleId":"D1","level":"warning","message":{"text":"CompressedAggXMLReader.nextKeyValue (cyclomatic 17): CompressedAggXMLReader.nextKeyValue has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf14a35b4468d9ff63a60c1250192922e524eb9784a9c6b2754dfb52c96a5a8"}},{"ruleId":"D1","level":"warning","message":{"text":"FileAndDirectoryInputFormat.getSplits (cyclomatic 17): FileAndDirectoryInputFormat.getSplits has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/FileAndDirectoryInputFormat.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"407e64ce3202e2ec2e64903f2f76c0781bbf45cde1c4c10c0a417cbd25fa9627"}},{"ruleId":"D1","level":"warning","message":{"text":"6.applyConfigOptions (cyclomatic 17): 6.applyConfigOptions has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/InputType.java"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb42a491e882d3329f7a7389fc08bc4ce9763fdd5c721f9f2e5b424fb9662d6d"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeImpl.isEqualNode (cyclomatic 17): NodeImpl.isEqualNode has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/NodeImpl.java"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85d35d899886bbe00a371a0ebd09ff47c9d42ba5806ea000fc025ceb72d5ece"}},{"ruleId":"D1","level":"warning","message":{"text":"DatabaseContentWriter.newContentCreateOptions (cyclomatic 16): DatabaseContentWriter.newContentCreateOptions has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b40778fbf5032a50ecf6bd486464baab6629fca17ed8b3781de7b4ceb66aa9"}},{"ruleId":"D1","level":"warning","message":{"text":"RDFReader.writeValue (cyclomatic 16): RDFReader.writeValue has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"13efb5444c488711c5c1e305e6bcce6f26e29ee023dec09aa0258210b2dee3ff"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeImpl.builtinNSPrefix (cyclomatic 16): NodeImpl.builtinNSPrefix has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/NodeImpl.java"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c73a4608194ac4790d6ede7a665f17b7fcf36f67b4446616c15e4872825b90b"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedTreeDecoder.decode (cognitive 166): CompressedTreeDecoder.decode has cognitive complexity 166 (threshold 15). Drivers by points: if/else 66 (121 pts), loops 13 (26 pts), match/switch 4 (12 pts), boolean chains 5, error handling 1 (2 pts) (nesting depth added 77). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/CompressedTreeDecoder.java"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"49142c00c910724bb00a57c4330b9045d4f8dafa18b14cc4b26b2650bd6453e5"}},{"ruleId":"D2","level":"warning","message":{"text":"1.applyConfigOptions (cognitive 137): 1.applyConfigOptions has cognitive complexity 137 (threshold 15). Drivers by points: if/else 102 (131 pts), boolean chains 6 (nesting depth added 29). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e1de7c62625f3796f10ab22dcfad195c33e94585e260105e53049a9cb014df"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseContentWriter.write (cognitive 124): DatabaseContentWriter.write has cognitive complexity 124 (threshold 15). Drivers by points: if/else 35 (81 pts), boolean chains 12, loops 3 (12 pts), error handling 4 (11 pts), ternaries 4 (8 pts) (nesting depth added 66). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1519f3d42a1380f55ed328c20bc1c183b506da9a6220d97154cd36c3336ef4"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseContentReader.nextKeyValue (cognitive 117): DatabaseContentReader.nextKeyValue has cognitive complexity 117 (threshold 15). Drivers by points: if/else 23 (73 pts), error handling 6 (27 pts), loops 4 (12 pts), boolean chains 5 (nesting depth added 79). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48b5f676c7915ed4eed2021c17bb99f4a2300d52c4215c870a18b5fcb79593b"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkLogicInputFormat.getSplits (cognitive 113): MarkLogicInputFormat.getSplits has cognitive complexity 113 (threshold 15). Drivers by points: if/else 37 (79 pts), loops 9 (18 pts), boolean chains 9, error handling 3 (6 pts), ternaries 1 (nesting depth added 54). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"4537f232fec0d766f3a782b8f60f001462a038ea693fc0f5c1a1590d9fa0be9c"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseTransformWriter.write (cognitive 100): DatabaseTransformWriter.write has cognitive complexity 100 (threshold 15). Drivers by points: if/else 23 (57 pts), boolean chains 13, error handling 3 (11 pts), ternaries 5 (10 pts), loops 2 (9 pts) (nesting depth added 54). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9818e6abd1ab6846fa1879223bbd49876585cc03f6a92a38038f599e99a665"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseContentWriter.close (cognitive 96): DatabaseContentWriter.close has cognitive complexity 96 (threshold 15). Drivers by points: if/else 15 (59 pts), loops 4 (19 pts), error handling 2 (11 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 70). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dadd52ab12fe71cce5c662ff51f87accc9dd52b048456116a8b2b978c15c253"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkLogicRecordReader.init (cognitive 87): MarkLogicRecordReader.init has cognitive complexity 87 (threshold 15). Drivers by points: if/else 29 (61 pts), error handling 4 (11 pts), ternaries 4 (11 pts), boolean chains 3, loops 1 (nesting depth added 46). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e87a06892192b3a669f3d90fa438416fcbaeb9617bba9e6e9bbe65bdaa4ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkLogicInputFormat.getForestSplits (cognitive 78): MarkLogicInputFormat.getForestSplits has cognitive complexity 78 (threshold 15). Drivers by points: if/else 24 (62 pts), loops 6 (13 pts), boolean chains 2, ternaries 1 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a91afa8c87d30ddba34c794a60281bd7694ba5a51570c2801c2419f4208738ca"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateXMLReader.processStartElement (cognitive 77): AggregateXMLReader.processStartElement has cognitive complexity 77 (threshold 15). Drivers by points: if/else 32 (56 pts), boolean chains 11, loops 4 (8 pts), ternaries 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ee5737f0db4dc1e2f5151bcafb59da54dfbf26d00864998073e91e2fc2f74a"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformWriter.addValue (cognitive 76): TransformWriter.addValue has cognitive complexity 76 (threshold 15). Drivers by points: if/else 37 (66 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"24f69295edf52ef037da305152f2b2c144bf5f6c3f7d60efe785a8cc85346836"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentWriter.close (cognitive 74): ContentWriter.close has cognitive complexity 74 (threshold 15). Drivers by points: if/else 13 (44 pts), loops 3 (13 pts), error handling 2 (11 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"baf893fd35680346d440e091557f67fb031296a64bb9161bd44a83fffc26353f"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentWriter.write (cognitive 73): ContentWriter.write has cognitive complexity 73 (threshold 15). Drivers by points: if/else 20 (48 pts), loops 4 (13 pts), error handling 2 (7 pts), boolean chains 5 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde7fd476bd40457b8824f0f4b1937e5cd9afb1366bb388dcbc19c0515c5814"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentWriter.insertBatch (cognitive 70): ContentWriter.insertBatch has cognitive complexity 70 (threshold 15). Drivers by points: if/else 22 (57 pts), loops 4 (9 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4fcf1ce1b16d3a856919c4e1855f9b048b500bff7f795aea582afe4e1d75710"}},{"ruleId":"D2","level":"warning","message":{"text":"3.applyConfigOptions (cognitive 67): 3.applyConfigOptions has cognitive complexity 67 (threshold 15). Drivers by points: if/else 57 (65 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b105a13743e54414324bf40aa8d281c60eeb99d6677f3758fce465c26a25d3"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentOutputFormat.queryForestInfo (cognitive 62): ContentOutputFormat.queryForestInfo has cognitive complexity 62 (threshold 15). Drivers by points: if/else 24 (51 pts), boolean chains 5, loops 2 (5 pts), error handling 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c92bcd8f25428f39fa750b854c85cb0a1ed52e0a323aad6bd174c62dd57a46"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpandedTree.write (cognitive 59): ExpandedTree.write has cognitive complexity 59 (threshold 15). Drivers by points: loops 14 (28 pts), if/else 22, boolean chains 9 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c90e6a726c90e38bafef037de9e2d46b1820d5da2883aea5d9389d14b6a653"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformWriter.write (cognitive 58): TransformWriter.write has cognitive complexity 58 (threshold 15). Drivers by points: if/else 16 (40 pts), error handling 2 (7 pts), loops 2 (7 pts), boolean chains 4 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb91e0c811aaa9994f3cbe9552948c69ad5e27e0adb3585378b8a7c1aa0faec"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseContentReader.init (cognitive 57): DatabaseContentReader.init has cognitive complexity 57 (threshold 15). Drivers by points: if/else 24 (42 pts), error handling 4 (11 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfd67cf08343a4bab30ed90fadc1ccd9b0768db616716a07ae56fbbf2750255"}},{"ruleId":"D2","level":"warning","message":{"text":"ForestInputFormat.getSplits (cognitive 57): ForestInputFormat.getSplits has cognitive complexity 57 (threshold 15). Drivers by points: if/else 23 (45 pts), loops 3 (5 pts), boolean chains 4, error handling 1 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestInputFormat.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a1425ff18eb0c8b1df8c3769ea89c8308438fe333764556f3e52e8817c6ca6d"}},{"ruleId":"D2","level":"warning","message":{"text":"DelimitedTextReader.nextKeyValue (cognitive 55): DelimitedTextReader.nextKeyValue has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 8, error handling 3 (5 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextReader.java"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"27751807e964ce7d11a253219743acff1fdf3bd5423e38f6bb2bff08f2e93523"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformWriter.close (cognitive 54): TransformWriter.close has cognitive complexity 54 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 3 (10 pts), error handling 2 (9 pts), boolean chains 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e83b291dd58893794521aac2d3a76826369ceab97dd065d9bb59be998f8695"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentOutputFormat.initialize (cognitive 53): ContentOutputFormat.initialize has cognitive complexity 53 (threshold 15). Drivers by points: if/else 27 (43 pts), boolean chains 10 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"3263fb600e5f71f052aa397db889e34d22e8deaa5833201652eddd1552933994"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentOutputFormat.checkOutputSpecs (cognitive 52): ContentOutputFormat.checkOutputSpecs has cognitive complexity 52 (threshold 15). Drivers by points: if/else 23 (42 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (2 pts), error handling 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2dcac038800d8b4ca18091cd163ee527b4994a22aaff5890f5f568ddddc65f8"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentPump.runCommand (cognitive 51): ContentPump.runCommand has cognitive complexity 51 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 8, error handling 5 (7 pts), loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentPump.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb84d635f9daef2ab9301621c8f06043c3d60163bd90fff41c847768f35c943"}},{"ruleId":"D2","level":"warning","message":{"text":"FCheck.decodeTreeData (cognitive 51): FCheck.decodeTreeData has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (32 pts), loops 5 (12 pts), error handling 2 (4 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e1e2c6e448875bc71df54ed76a42db33a3fc4683f7834e1ed4d252995159c1"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentWriter.\u003Cinit\u003E (cognitive 50): ContentWriter.\u003Cinit\u003E has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (34 pts), loops 6 (11 pts), boolean chains 4, ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2436e8113e9c831bb52729703edc1c9fc7e3e5e9159ab7e46b25088d92f6fc6d"}},{"ruleId":"D2","level":"warning","message":{"text":"ArchiveWriter.write (cognitive 47): ArchiveWriter.write has cognitive complexity 47 (threshold 15). Drivers by points: if/else 28 (46 pts), ternaries 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ArchiveWriter.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71dfee16f18939c8eb7221d563c01341952a267862c8c5b7814e7cd91539919"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseContentWriter.newContentCreateOptions (cognitive 44): DatabaseContentWriter.newContentCreateOptions has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 3 (12 pts), boolean chains 2 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f362b8eecaca5172e7cb8c1d17f5aca7adf7ff95e83baca09ec856bd5aadb6c"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformWriter.insertBatch (cognitive 44): TransformWriter.insertBatch has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 3 (6 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0e34dc6565cefea1e0a0163f3f85c5ce5e151491bcee705cd51bcfc8143da5"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedTreeDecoder.assignOrdinals (cognitive 44): CompressedTreeDecoder.assignOrdinals has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 6 (10 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/CompressedTreeDecoder.java"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64e6fda4fa18ef68f2bdfdf61f3028392ecf046453c2e4d59466bd95905128c"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseContentReader.parseMetadata (cognitive 42): DatabaseContentReader.parseMetadata has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 3 (5 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db3b8eefc97d918be8ad0bde0fe7a05231c1be6e3173ff8f2d9ea85f3b23a82"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalJobRunner.run (cognitive 42): LocalJobRunner.run has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (25 pts), error handling 5 (11 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/LocalJobRunner.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f38c34d6413fbc1f26070a390a76e97e4f6cefc45d64b47ef61cf64dd62c063"}},{"ruleId":"D2","level":"warning","message":{"text":"SingleDocumentWriter.write (cognitive 42): SingleDocumentWriter.write has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (34 pts), loops 2 (6 pts), boolean chains 1, error handling 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/SingleDocumentWriter.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"46a8618e1c7407807a98f50bb929565d77a0eb117bbe2f7ff79b5a9874893ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpandedTree.readFields (cognitive 42): ExpandedTree.readFields has cognitive complexity 42 (threshold 15). Drivers by points: loops 14 (28 pts), if/else 14 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f278ad6f83e24da89336e9637e12fa6ce473a004ba94baeab21311268ed590a9"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadPoller.run (cognitive 41): ThreadPoller.run has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (33 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbc50aa1736331ed5bf7eb16c0fa5ff16484df91557e0b3c19061e03a413c46"}},{"ruleId":"D2","level":"warning","message":{"text":"2.applyConfigOptions (cognitive 40): 2.applyConfigOptions has cognitive complexity 40 (threshold 15). Drivers by points: if/else 34 (40 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"325aada0a00bcd34d36781d71d5c16c650a4734577be083575c3173b09182109"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentOutputFormat.getSourceMap (cognitive 40): ContentOutputFormat.getSourceMap has cognitive complexity 40 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (10 pts), error handling 2 (8 pts), ternaries 1 (4 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac184f71ab699efadd8ab571246a09889bebdfb2dead0bb3655e52e40035ed89"}},{"ruleId":"D2","level":"warning","message":{"text":"OptionsFileUtil.expandArguments (cognitive 39): OptionsFileUtil.expandArguments has cognitive complexity 39 (threshold 15). Drivers by points: if/else 9 (26 pts), error handling 2 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/OptionsFileUtil.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54bd4f6eba509485a1ae5c7dc737c3a13675370a549a1568be1987222128262"}},{"ruleId":"D2","level":"warning","message":{"text":"Command.applyFilteringConfigOptions (cognitive 36): Command.applyFilteringConfigOptions has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 2 (6 pts), ternaries 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5e5b5dbc5a9a94576359a22dc58d03b8a4210bd426e0bedf0953629fb48438"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalUtilities.getInputSslOptions (cognitive 35): InternalUtilities.getInputSslOptions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (24 pts), error handling 2 (10 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (InternalUtilities.getOutputSslOptions) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f483c8b8ec34a92f874ae936f8d30b82ffbe4808ed991aca3e38c4b3d15eb50"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalUtilities.getOutputSslOptions (cognitive 35): InternalUtilities.getOutputSslOptions has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (24 pts), error handling 2 (10 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (InternalUtilities.getInputSslOptions) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"223cc96cb6f081a74d26fa2c16d55dc0b519f6b0d607f43def8a79d123a2f962"}},{"ruleId":"D2","level":"warning","message":{"text":"RDFReader.writeValue (cognitive 33): RDFReader.writeValue has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (28 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fa712a194548feccfd455d8742d628754c5ea8cee527c8ce335e0dfcc2b3aa"}},{"ruleId":"D2","level":"warning","message":{"text":"ForestReader.applyFilter (cognitive 33): ForestReader.applyFilter has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 6, loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestReader.java"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6976e2ff65e0c857f43b210c2167022aada5e0757eb964f9b9abc04e8d86f6dd"}},{"ruleId":"D2","level":"warning","message":{"text":"DelimitedJSONReader.findUriInJSON (cognitive 32): DelimitedJSONReader.findUriInJSON has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedJSONReader.java"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb5d1a050c2d5d08153cc76d653d939a16189b0e3a356f19881dc15f544565e2"}},{"ruleId":"D2","level":"warning","message":{"text":"6.applyConfigOptions (cognitive 32): 6.applyConfigOptions has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), error handling 3 (6 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/InputType.java"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf78f988c9b62361c213ffb51ca81e424fbb40b6fe1f9f707335841ebf04390"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadManager.scaleOutThreadPool (cognitive 32): ThreadManager.scaleOutThreadPool has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (24 pts), error handling 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"9863674055bdcc1b5d14aacf267aad28ed48559747b3715a1bd82070cd819128"}},{"ruleId":"D2","level":"warning","message":{"text":"2.init (cognitive 32): 2.init has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/NodeImpl.java"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9c8e9b157f257e5cc083359dd7e2f918d5d2f12ae6cad705c8ffbc688b851d"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentWriter.createContent (cognitive 32): ContentWriter.createContent has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (29 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c57edd6fdd0d6d1dd468b4725e758a04158e4f85c136cf823b1a184b1c3f17d"}},{"ruleId":"D2","level":"warning","message":{"text":"FileAndDirectoryInputFormat.getSplits (cognitive 31): FileAndDirectoryInputFormat.getSplits has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (9 pts), boolean chains 3, error handling 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/FileAndDirectoryInputFormat.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2f3626c8bebe04e64af00d2af46a6028b097200929c75ef9184c6bafb50c91"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedAggXMLReader.nextKeyValue (cognitive 29): CompressedAggXMLReader.nextKeyValue has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (20 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"645ed95d464abc88f42ebbd3089dae0d488a957a569812777f0618cc58d22c4d"}},{"ruleId":"D2","level":"warning","message":{"text":"FileAndDirectoryInputFormat.simpleListStatus (cognitive 29): FileAndDirectoryInputFormat.simpleListStatus has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (9 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/FileAndDirectoryInputFormat.java"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"07536300bc3991b6db51b09f75269b1747275ff400fe920c417c590157aa27c7"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitDelimitedTextReader.nextKeyValue (cognitive 29): SplitDelimitedTextReader.nextKeyValue has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3347216220bdc2e91ffd67a0f6ccd51348fa0d19be2c4b12feda8a62258bb91"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeImpl.compareDocumentPosition (cognitive 29): NodeImpl.compareDocumentPosition has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (8 pts), boolean chains 2 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/NodeImpl.java"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c890d82466b6e9b4a77f39f2d5f2bdbfe285da7193e7827fe07c381be5da4a1"}},{"ruleId":"D2","level":"warning","message":{"text":"ForestReader.getNextTree (cognitive 29): ForestReader.getNextTree has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 4, ternaries 1 (3 pts), error handling 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestReader.java"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddcab69577e77c3989481043bb67ae65dcd9b7433d8816b68be05bc5a23dd1f"}},{"ruleId":"D2","level":"warning","message":{"text":"DelimitedJSONReader.nextKeyValue (cognitive 28): DelimitedJSONReader.nextKeyValue has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (24 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedJSONReader.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d31b922bd1abe4e0d32a929a0a91b143823674f84c4371651219cb4ac59698f"}},{"ruleId":"D2","level":"warning","message":{"text":"MultithreadedMapper.run (cognitive 27): MultithreadedMapper.run has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 5 (11 pts), error handling 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/MultithreadedMapper.java"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fcf06b8d3a23fab3ccdd5e961ddd94e897ed2d6aab2c0f3939fe25d1c8dc6b"}},{"ruleId":"D2","level":"warning","message":{"text":"Command.applyCopyConfigOptions (cognitive 26): Command.applyCopyConfigOptions has cognitive complexity 26 (threshold 15). Drivers by points: if/else 22 (26 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":2491}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08776a747adf23d9e974211e8b3b67f41f7d2aaa233da87ad6d026b012bf9ec"}},{"ruleId":"D2","level":"warning","message":{"text":"1.applyUriId (cognitive 26): 1.applyUriId has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"1316d31f4494e5adf08943c67f15b6ea060f50b0b74e02ae9e2833147e45a4ec"}},{"ruleId":"D2","level":"warning","message":{"text":"DelimitedTextInputFormat.getSplits (cognitive 26): DelimitedTextInputFormat.getSplits has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (9 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextInputFormat.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f3b064474a89d86cbcf16de18126488f2f120c914e39deb1ab51556902ba08"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadManager.assignIdleThreads (cognitive 26): ThreadManager.assignIdleThreads has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), error handling 2 (6 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e172baee29661794440412cb29db0234c855743dc4e09e4ed7f4ffdf4fcf877"}},{"ruleId":"D2","level":"warning","message":{"text":"ThreadManager.scaleInThreadPool (cognitive 26): ThreadManager.scaleInThreadPool has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfa0b28c875e639d32e9ad0fda727bf9a2e2421818080ac0108a7070543765b"}},{"ruleId":"D2","level":"warning","message":{"text":"InternalUtilities.assignResultValue (cognitive 26): InternalUtilities.assignResultValue has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14, boolean chains 12. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5e10ee8be581b332b863c9d856513eafa9de42a301a42d2d7734b0025a2a6a"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentWriter.getSession (cognitive 26): ContentWriter.getSession has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (8 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"83e7dce1992a3144b377d5b026d7bba68f4ca7de4bf356ed3be591bb7d196746"}},{"ruleId":"D2","level":"warning","message":{"text":"FCheck.checkTreeIndex (cognitive 25): FCheck.checkTreeIndex has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3, error handling 1 (2 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ba8653bf6a5b3027d5576658787ee0964d67d087f60761ab47e82ffa9657e77"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeImpl.isEqualNode (cognitive 24): NodeImpl.isEqualNode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (20 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/NodeImpl.java"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"257ad636627f74548a417ac72ae7887f3bc5450a7a9131c0c403a0fd154e2f70"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateXMLReader.nextKeyValue (cognitive 23): AggregateXMLReader.nextKeyValue has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, match/switch 1 (2 pts), error handling 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e3af75be0b22b87c91b2703c9251c469cfad2ef627ff48762ec2ad22b5e3de"}},{"ruleId":"D2","level":"warning","message":{"text":"AggregateXMLReader.processEndElement (cognitive 23): AggregateXMLReader.processEndElement has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 7 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aad5abf8f7cd986f8372b5ddccf0244480f928eb8da451858d5e20d7c460f79"}},{"ruleId":"D2","level":"warning","message":{"text":"ShutdownHook.run (cognitive 23): ShutdownHook.run has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), error handling 2 (5 pts), loops 4 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentPump.java"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2795be81b08f38444cf49ae5d388a44b83ecfa54ac3ea0a52706777f6c63977"}},{"ruleId":"D2","level":"warning","message":{"text":"RDFWritable.getContent (cognitive 23): RDFWritable.getContent has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFWritable.java"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fab7fcdccb4c6df1e46ef347f190772eef65722768a1dce0b6a2064bad96a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Command.applyCommonOutputConfigOptions (cognitive 22): Command.applyCommonOutputConfigOptions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":2697}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd3e8472b5eb059922772baee1d4c4b4e867e4f7dfbbfb85fc90b968a4dad66"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedAggXMLReader.initStreamReader (cognitive 22): CompressedAggXMLReader.initStreamReader has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), error handling 3 (7 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"95037ee7dcd8138b70921f8c1c0aaba0ee826184d6db967205c27429f1d759db"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedRDFReader.initStream (cognitive 22): CompressedRDFReader.initStream has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (4 pts), error handling 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedRDFReader.java"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a859fbf77906812c71f858c4fc454eee4edcdd6a8d0a047b87fd5b511cd124f"}},{"ruleId":"D2","level":"warning","message":{"text":"AttributeNodeMapImpl.item (cognitive 22): AttributeNodeMapImpl.item has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, error handling 1 (3 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/AttributeNodeMapImpl.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"a259a19b203d405da6379e0b346c2d5fc21a78db6dd56d31437336b2a134728c"}},{"ruleId":"D2","level":"warning","message":{"text":"FileIterator.next (cognitive 21): FileIterator.next has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (8 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/FileIterator.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef145b82fbc3d9162e615d9178c7bae7798fe51153e8ae272fc01931c154572"}},{"ruleId":"D2","level":"warning","message":{"text":"CombineDocumentInputFormat.getSplits (cognitive 21): CombineDocumentInputFormat.getSplits has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CombineDocumentInputFormat.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c7cbcb799fb6ee75c43461114b474cdae03f7fc99e25cd94b48e83a7770c8b"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedDelimitedTextReader.nextKeyValue (cognitive 21): CompressedDelimitedTextReader.nextKeyValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedDelimitedTextReader.java"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8968ada3cbd47c759ded250c1e031e5e90b788aaecc4f65b90793527977f23a"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedDocumentReader.nextKeyValue (cognitive 21): CompressedDocumentReader.nextKeyValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedDocumentReader.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebcb3ed91817e9071705663a94aa924ca698fdcb52455e74758f883b558c93ae"}},{"ruleId":"D2","level":"warning","message":{"text":"CompressedRDFReader.nextKeyValue (cognitive 21): CompressedRDFReader.nextKeyValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedRDFReader.java"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c03e2ba72325583247f7b634934d5f33f2ea4e45dfed3b8e77c88aa365bf1e"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformOutputFormat.getMimetypesMap (cognitive 21): TransformOutputFormat.getMimetypesMap has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (6 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformOutputFormat.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbe2696766ccabea422ab1156a26474ba57e6230ffe52bcff73ac69b023050d"}},{"ruleId":"D2","level":"warning","message":{"text":"FCheck.checkTreeData (cognitive 20): FCheck.checkTreeData has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"42717304e463febd59a5ba186af94e93414199e4d11f1b5872bf8671eb9648f7"}},{"ruleId":"D2","level":"warning","message":{"text":"BucketAssignmentPolicy.initBucketsTable (cognitive 20): BucketAssignmentPolicy.initBucketsTable has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (9 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/BucketAssignmentPolicy.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac244ac864f6a25f9868488f413702fe2f2e5be99f581cd27631730b10b135b9"}},{"ruleId":"D2","level":"warning","message":{"text":"AuditUtil.auditMlcpFinish (cognitive 19): AuditUtil.auditMlcpFinish has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (5 pts), error handling 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"03166c7073c88dc7dba1bb1a8f2cb72299fe0734fce16d516f1a19db36600ebb"}},{"ruleId":"D2","level":"warning","message":{"text":"RDFReader.initialize (cognitive 19): RDFReader.initialize has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93ae1048bc3c193dd9b4a3d4acf6c7be1e482595fb7a83589a96ec5b6f19bd9"}},{"ruleId":"D2","level":"warning","message":{"text":"RDFReader.nextStreamingQuadKeyValueWithCollections (cognitive 19): RDFReader.nextStreamingQuadKeyValueWithCollections has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (4 pts), boolean chains 2, error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40bf30f75c91fddf2f1ec72b4e68d0fa94a373d18aaf79817fd0fe1a12a98ba"}},{"ruleId":"D2","level":"warning","message":{"text":"MarkLogicRecordReader.nextKeyValue (cognitive 19): MarkLogicRecordReader.nextKeyValue has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), error handling 2 (7 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccecd2613ec9ab33b30e115ba7fe34e76a89bc9045481cd732b29137fe4c578"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseContentReader.readPermission (cognitive 18): DatabaseContentReader.readPermission has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9e2b8a863a0a60e28197ce92266a8866d4aba0bc358faeb3d28ebb2708c929"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalMapTask.call (cognitive 18): LocalMapTask.call has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), error handling 5 (6 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/LocalJobRunner.java"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bdfdb4998f9f7ff36dd40aa088c405464beb0641ef1046f4537fa93cc473351"}},{"ruleId":"D2","level":"warning","message":{"text":"RDFReader.initExistingMapPerms (cognitive 18): RDFReader.initExistingMapPerms has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), error handling 2, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f36bb449f633a1ee78bdfdbcadabf8731c18d97ba98f7c16e0e9680583ed06f"}},{"ruleId":"D2","level":"warning","message":{"text":"FCheck.checkListData (cognitive 18): FCheck.checkListData has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1017a4e8b4eef043f50f6216f37163a77534b325af8a45754c5a143d427c3530"}},{"ruleId":"D2","level":"warning","message":{"text":"ForestDocument.setContentOptions (cognitive 18): ForestDocument.setContentOptions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 2 (7 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestDocument.java"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"d26a02470372bed9237844c729114df8a7c7aed93f2caed384818eb4a09284f7"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpandedTree.putNode (cognitive 17): ExpandedTree.putNode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"4477502bb3a73e4f61b06a88251d45d30f7bfd6a99e88c57f22edf7805c96f92"}},{"ruleId":"D2","level":"warning","message":{"text":"CombineDocumentReader.nextKeyValue (cognitive 16): CombineDocumentReader.nextKeyValue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), error handling 2 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CombineDocumentReader.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dc3408ea9993f37b8761a0794710523fa70f3e2da1045e2531a90b365f7938"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabaseContentReader.queryNakedProperties (cognitive 16): DatabaseContentReader.queryNakedProperties has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a2934f207929f12b1b02c0186570d62ebdb3f19e6d711c69c3c90a56d456509"}},{"ruleId":"D2","level":"warning","message":{"text":"RDFReader.initParser (cognitive 16): RDFReader.initParser has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13 (16 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"437093c955d80e9c37133af87f691ade9e45ad964255a79ef7218008dd020b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitDelimitedTextReader.initParser (cognitive 16): SplitDelimitedTextReader.initParser has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 2, error handling 2, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e401ef96681c47ee7961764dc9db26a88c0789531e5c1ba9c987026b94f7a3a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Command: ClassTooLong \u2014 2248 significant lines (blank, comment-only and punctuation-only lines excluded), 36 methods. The bar is 400 significant lines; this is 1848 over it, 5.62\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"585cf7fc2425ae25fb833c3225f6fdaa5f9c08dfd6113590a343b573dd6548c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CompressedTreeDecoder.decode: MethodTooLong \u2014 decode runs 519 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 419 over it, 5.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/CompressedTreeDecoder.java"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5ff486c83e90633d4ed73774efceaca0de842a86b555b22fab980fa8e31225"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: contentpump/Command.java: FileTooLong \u2014 2281 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: Command (59-2817). The bar is 500 significant lines; this is 1781 over it, 4.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7f4cd75e0b45a3a7fc2ba4f05c7689aa7a5f19010bbde5f796df324cb4afe3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: 1.applyConfigOptions: MethodTooLong \u2014 applyConfigOptions runs 343 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 243 over it, 3.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d01c0572309a1d93774a8111a046d3cea00bf9259d61ca8e73c4183cf52c224"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: 1.configOptions: MethodTooLong \u2014 configOptions runs 298 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 198 over it, 2.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"efabb1ba91ad8de07f8e9339169fcf5eef6bee7363f99d67241bed3df3edc096"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: 3.configOptions: MethodTooLong \u2014 configOptions runs 225 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"1acf5299310ff6ab7b10c6c1a2fbb9d347b04f923eebfa96544cea8c02c94c17"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MarkLogicInputFormat.getSplits: MethodTooLong \u2014 getSplits runs 205 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dbc0c04d16e54dd26b51e2a1e65b39b69924c386c59f18d9ecc3e74407fe0b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RDFReader: ClassTooLong \u2014 753 significant lines (blank, comment-only and punctuation-only lines excluded), 43 methods. The bar is 400 significant lines; this is 353 over it, 1.88\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"94237911d66c9334d4bf8cc1a91947ce06f681fad48f2e2f8849f3efbb1d0be4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: 3.applyConfigOptions: MethodTooLong \u2014 applyConfigOptions runs 187 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 87 over it, 1.87\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c42f392f36a44fbfb9ac458cf8841c97e20a184ce0052031e862ea13b3f441"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeImpl: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/NodeImpl.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1e8320eb30e234673c25a95e1cabd97448f107880013be9afd489389b91e0d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CompressedTreeDecoder: ClassTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 277 over it, 1.69\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/CompressedTreeDecoder.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd700d4a50dd505231f4d55d544064998f6aec64e1fbce02485511af4cf1e8a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DocumentImpl: TooManyMethods \u2014 50 methods. The bar is 30 methods; this is 20 over it, 1.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentImpl.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09bdaaea113af10243b91f580a6a547aac4755c1a449e22d55fa06cbaf32aa6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: contentpump/RDFReader.java: FileTooLong \u2014 806 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: RDFReader (80-1140). The bar is 500 significant lines; this is 306 over it, 1.61\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f080506420499b910fe35e85b8f57ca6b77b7ac9b5d480d466918ce669708cb"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseContentWriter.write: MethodTooLong \u2014 write runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f4dff7bb3b9c3ac10863604538c348602c98d0d39dc02f4158ba03c2d70a97"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TransformWriter.addValue: MethodTooLong \u2014 addValue runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"5575c6929911cb9e308a51e605bea1c0b1d4b9d4b7b2e2f11c5124b13a67fa35"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContentWriter: ClassTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded), 17 methods. The bar is 400 significant lines; this is 182 over it, 1.46\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4751995f08ef8af2f6453d91a45f054fd17aa55877acdb4985122b75f5216c66"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MarkLogicRecordReader.init: MethodTooLong \u2014 init runs 144 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"96759674a8652879b369205351f8a45d8a075cdd0e558fe8c50f809e4cc96d89"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RDFReader: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dbb6c6a45292b040476ab74509aa45c2a13da876f0c136909b0fb70bf3ff18"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree/CompressedTreeDecoder.java: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: CompressedTreeDecoder (38-850). The bar is 500 significant lines; this is 188 over it, 1.38\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/CompressedTreeDecoder.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01737c88c9b2ba9df2d6ed0d483eccf9fd3e127bca80c8ebb2ab0584ddcaff46"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ElementImpl: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/ElementImpl.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db36cb2f0dc76502dfb4246332dcc9aa3afc0e42cd58035735e06f19497477b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseContentReader.init: MethodTooLong \u2014 init runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d099e545e8ea3ded61f1d3128019d309a36518c3b6ce9400249e2a679cc3b3dc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DatabaseContentReader: ClassTooLong \u2014 532 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 132 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52aa69d8717d3ff35211b93ba709574734312f109ab567243ba618dc7c78a7e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TransformWriter: ClassTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded), 13 methods. The bar is 400 significant lines; this is 122 over it, 1.31\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"392909d31d677b12ce821d1d40831580bdb476f6cc01295a441aaf8ddd7553d3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExpandedTree.readFields: MethodTooLong \u2014 readFields runs 125 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"1366ae9a381ac97e64491973e76e846af919f1c3834391f80c6de045004b1fd9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ForestInputFormat.getSplits: MethodTooLong \u2014 getSplits runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestInputFormat.java"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1f45553a78949cb0b7ef3188f1b599950d7c2a85b5ff4bff543281de9d2322"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mapreduce/ContentWriter.java: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: ContentWriter (59-939). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae6c2d6d11689b986d4d466a61aa1a9c665f1103e710024863f3f483e7871a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContentPump.runCommand: MethodTooLong \u2014 runCommand runs 123 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentPump.java"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf5efd5eba34732c4222bdee4264fc762632320d2bd53dc613eb18cb847e150"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AggregateXMLReader.processStartElement: MethodTooLong \u2014 processStartElement runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f5a96f1d7e78ec0bcd30943151855cc50ee60f07df85fd7f8780c6d30b0d6c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ExpandedTree: ClassTooLong \u2014 484 significant lines (blank, comment-only and punctuation-only lines excluded), 18 methods. The bar is 400 significant lines; this is 84 over it, 1.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ba3a934cb71fb8449689f78820b716f12beafc857058b55a48e27398c8f6f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseContentReader.nextKeyValue: MethodTooLong \u2014 nextKeyValue runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"1728286a0a9a81ec9da15f3e66a22d1d4ca49cdfbc8807364bc3b66fa0cc6157"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LocalJobRunner.run: MethodTooLong \u2014 run runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/LocalJobRunner.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b47bb591d4c3e3cb43dc0d3075bd6535e984a229fc5dcedae369bf00943a387"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContentWriter.\u003Cinit\u003E: MethodTooLong \u2014 \u003Cinit\u003E runs 118 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee63edfc4f5700bddadec6a7c5f2310f7334080ca26b3bfbdf9086f58d8e55c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DocumentMetadata: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DocumentMetadata.java"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"548bbb04d6fc742b8b950afe997abaae894b332cb4aad0967b0a858938eab202"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabaseTransformWriter.write: MethodTooLong \u2014 write runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edeb5a341220c855e1af3246a5572df86fda628bc85a87d2764ff317faad697"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: contentpump/DatabaseContentReader.java: FileTooLong \u2014 569 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: DatabaseContentReader (69-801). The bar is 500 significant lines; this is 69 over it, 1.14\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7209f41e511f5162947dc6474a0754fe9525f34784c2b6e4f917a79084ccb5a8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: contentpump/TransformWriter.java: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: TransformWriter (69-740). The bar is 500 significant lines; this is 64 over it, 1.13\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f66ae2d78b86b1f24723a45537ddacae1b8856ef0b624991fc60521e8525a43"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContentOutputFormat: ClassTooLong \u2014 431 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 31 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f4e328a15e1d17199d03a691b7eb00744a8b9fbb1fd8bb937050cccc580ecc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: 2.applyConfigOptions: MethodTooLong \u2014 applyConfigOptions runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23c1849cc3349989e6a5fddfd847549d1730cdc4dbe2edc3ac36ac99b79d72f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ExpandedTree.write: MethodTooLong \u2014 write runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d19e3f8b5fc95089b12d37872bebf27f02187c1caed419c2b53a520f06af6c3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ContentOutputFormat.initialize: MethodTooLong \u2014 initialize runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f222521fd61caffbec44d93655435d5e96ce6e4e6137ed930160606c7c7071e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tree/ExpandedTree.java: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: ExpandedTree (44-674). The bar is 500 significant lines; this is 3 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"112a30fa85ce52a553cd569216da8a7be345c88148d0a1d13c3e0243b3285243"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (38 shared lines): src/main/java/com/marklogic/contentpump/Command.java:1012-1072 | src/main/java/com/marklogic/contentpump/Command.java:1475-1530 \u2014 These two members are variants of one another: 38 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1012}}}],"partialFingerprints":{"codehealthFindingId/v1":"00610a33e33bbb694bb5c057ca46a68a3bc81911da74dd70de2d4eb3e3dda96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): src/main/java/com/marklogic/contentpump/ThreadManager.java:248-315 | src/main/java/com/marklogic/contentpump/ThreadManager.java:384-432 \u2014 These two members are variants of one another: 37 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b519736198eabd68be89c03c86bf19cd0d9fb7a136b1c49f3fa881cf714b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): src/main/java/com/marklogic/mapreduce/examples/BinaryReader.java:58-81 | src/main/java/com/marklogic/mapreduce/examples/ContentLoader.java:56-78 | src/main/java/com/marklogic/mapreduce/examples/ContentReader.java:71-95 | src/main/java/com/marklogic/mapreduce/examples/LinkCount.java:70-97 | src/main/java/com/marklogic/mapreduce/examples/LinkCountCooccurrences.java:79-111 | src/main/java/com/marklogic/mapreduce/examples/LinkCountHDFS.java:84-107 | src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java:126-149 | src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java:119-144 | src/main/java/com/marklogic/mapreduce/examples/LinkCountValue.java:71-98 | src/main/java/com/marklogic/mapreduce/examples/RevisionGrouper.java:57-78 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/BinaryReader.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f48e0838d1fd165a7202dcd747e1b7622943e440f910a2bd6f536d254511a5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (8 members, 50\u002B identical tokens): src/main/java/com/marklogic/mapreduce/functions/ElementValueMatch.java:58-68 | src/main/java/com/marklogic/mapreduce/functions/ElementValues.java:58-68 | src/main/java/com/marklogic/mapreduce/functions/ElementWordMatch.java:58-68 | src/main/java/com/marklogic/mapreduce/functions/ElementWords.java:58-68 | src/main/java/com/marklogic/mapreduce/functions/FieldValueMatch.java:55-65 | src/main/java/com/marklogic/mapreduce/functions/FieldValues.java:55-65 | src/main/java/com/marklogic/mapreduce/functions/FieldWordMatch.java:55-65 | src/main/java/com/marklogic/mapreduce/functions/FieldWords.java:57-67 \u2014 These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElementValueMatch.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b882c5e28535360a908d2c659b54e9b2b772469696cd5cffe2776521559387a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): src/main/java/com/marklogic/contentpump/AggregateXMLReader.java:108-131 | src/main/java/com/marklogic/contentpump/ArchiveRecordReader.java:75-88 | src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java:68-91 | src/main/java/com/marklogic/contentpump/CompressedDelimitedTextReader.java:60-74 | src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:90-102 | src/main/java/com/marklogic/contentpump/RDFReader.java:209-282 | src/main/java/com/marklogic/contentpump/SequenceFileReader.java:63-78 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"68779bf3aea87fe06db424709f9747645601082f722e6fb8a9a5d1761857641c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:159-356 | src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:360-457 | src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java:57-201 | src/main/java/com/marklogic/contentpump/TransformWriter.java:205-307 | src/main/java/com/marklogic/contentpump/TransformWriter.java:649-739 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:618-737 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:802-887 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8be595f022fec80d4ea3d471e40412a2288d4a319dc53be7424d07a9cfbc0f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:135-144 | src/main/java/com/marklogic/mapreduce/NodeWriter.java:48-68 | src/main/java/com/marklogic/mapreduce/functions/CooccurrencesFunction.java:40-79 | src/main/java/com/marklogic/mapreduce/functions/ValueOrWordMatchFunction.java:56-98 | src/main/java/com/marklogic/mapreduce/functions/ValuesOrWordsFunction.java:57-100 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a598d335fd5aaa056df3606e015373964371797de611ed8222970c549fe193"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): src/main/java/com/marklogic/mapreduce/functions/ElementAttributeValueMatch.java:69-89 | src/main/java/com/marklogic/mapreduce/functions/ElementAttributeValues.java:68-88 | src/main/java/com/marklogic/mapreduce/functions/ElementAttributeWordMatch.java:69-89 | src/main/java/com/marklogic/mapreduce/functions/ElementAttributeWords.java:70-90 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElementAttributeValueMatch.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ca21a5659690f11cfe9e402f480e56dacf4d1ae04fc55e3505a901fe655292"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:141-198 | src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:200-257 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6250a335e92adfa73bd321c3fc95753f3797550e8e16ce74edb58fe4004c76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): src/main/java/com/marklogic/contentpump/RDFReader.java:707-746 | src/main/java/com/marklogic/contentpump/RDFReader.java:748-796 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ad31e16b2a2720525e8be7bdfeac623efd7cbea05b17b2b35432ab6666670e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): src/main/java/com/marklogic/io/Decoder.java:237-259 | src/main/java/com/marklogic/io/Decoder.java:263-285 | src/main/java/com/marklogic/io/Decoder.java:289-311 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/io/Decoder.java"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"618702ed4f2219cc76f748dcf52f4f78f7220a136c265f399f5be5e3c4d6e27a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): src/main/java/com/marklogic/contentpump/RDFReader.java:459-488 | src/main/java/com/marklogic/contentpump/RDFReader.java:490-520 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaebe2c781f59f06c66d464aa58f2d3fbff3d4d920be835128b64373609431fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:109-139 | src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:225-253 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"580738526cc14419d84a46d022cb6fe40e3d65fcf818cc6456c3196737276779"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): src/main/java/com/marklogic/contentpump/RDFReader.java:821-849 | src/main/java/com/marklogic/contentpump/RDFReader.java:859-887 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":821}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af36d14d04d6b40da5fa4160f29d3bac7c530a1b4e10933f808ea10a7a43a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:155-179 | src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:192-221 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7fd69408381eef958e9dce8e15e98cd5c8c4a3c8d6aa0247a951c4b6f69813"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): src/main/java/com/marklogic/dom/AttrImpl.java:119-142 | src/main/java/com/marklogic/dom/ElementImpl.java:230-258 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/AttrImpl.java"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a80d6c00814c0c937f9b51207570f9b6bfaa65ab6221a1e188b6c91133e12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/main/java/com/marklogic/mapreduce/NodeOpType.java:70-89 | src/main/java/com/marklogic/mapreduce/PropertyOpType.java:59-88 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/NodeOpType.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f05e305a06a010282b33560f862b4ab017ad41034b32628507264ce8ff0f9e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/com/marklogic/io/BiendianDataInputStream.java:133-142 | src/main/java/com/marklogic/io/BiendianDataInputStream.java:144-155 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/io/BiendianDataInputStream.java"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"a846ff01282cf21ebc7f0c223302b22ab0a68d35c8e495c84164d58caedef5bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): src/main/java/com/marklogic/mapreduce/examples/HelloWorld.java:128-151 | src/main/java/com/marklogic/mapreduce/examples/ZipContentLoader.java:58-80 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/HelloWorld.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dbb63030a8f38933db034f6023a76a171631e0fe2488d32773e67ad148eadf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): src/main/java/com/marklogic/dom/ElementImpl.java:323-339 | src/main/java/com/marklogic/dom/ElementImpl.java:342-358 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/ElementImpl.java"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78e1d92bd56300391696922d33b5c4e52a3956c2fc00abab5f8b8f4fe49165e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:610-624 | src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:626-640 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"2390064c906502bff259b167a0d95010f0109fb0fb935d83e195a70bc70d942d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java:142-163 | src/main/java/com/marklogic/contentpump/examples/SimpleSequenceFileValue.java:52-71 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0641f388df8d3b8398a3aa138b9315133ef3c7d9e3cca0ad6892b7764ffe278e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:126-139 | src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:460-473 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe23aba5ac9e5f11c190f1137d2728b9376e0212601aca5fa305a1a904033a43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/main/java/com/marklogic/contentpump/ArchiveRecordReader.java:158-172 | src/main/java/com/marklogic/contentpump/ArchiveRecordReader.java:175-191 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ArchiveRecordReader.java"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6d3cdf1eaba03e56ce97773e783a691cd757d2aac2dfb3b56185e982aab888"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/main/java/com/marklogic/contentpump/ImportRecordReader.java:117-132 | src/main/java/com/marklogic/mapreduce/ForestReader.java:229-247 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ImportRecordReader.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"70557faeba2f054cfc41370dea5b6bc6bf1cb5878515c723f445f64b86c8482c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main/java/com/marklogic/dom/AttrImpl.java:146-156 | src/main/java/com/marklogic/dom/ElementImpl.java:273-284 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/AttrImpl.java"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"685f783e802c2847b2742d9785b355e8211aa0307fd161d103251b16eb5db433"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java:102-116 | src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java:96-109 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd984cef4b9088ec26cbbb33c7a6dfbbd9acb95f932267f3503f603d7d7c4a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): src/main/java/com/marklogic/contentpump/SingleDocumentWriter.java:167-182 | src/main/java/com/marklogic/mapreduce/utilities/URIUtil.java:86-101 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/SingleDocumentWriter.java"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8370f28e08d1a2b8d63100014e54241879c9d2c6c454cc8ced0bf88dc4403e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): src/main/java/com/marklogic/mapreduce/DOMDocument.java:128-142 | src/main/java/com/marklogic/mapreduce/DOMDocument.java:145-162 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/DOMDocument.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b28dc877ce831a75feac502bdd8f4f34264dc9a085d726c6f0fecbdfb70eefe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/main/java/com/marklogic/contentpump/utilities/FileIterator.java:52-63 | src/main/java/com/marklogic/contentpump/utilities/FileIterator.java:65-78 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/FileIterator.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e5c151e3bf35bd825c271b541252bd1d5910d06828a48cc45967b1ac936a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java:166-176 | src/main/java/com/marklogic/contentpump/examples/SimpleSequenceFileValue.java:74-83 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd538933bab66b0ae50f633c41a0d391c8b33c40467589bc14a35ce59b073e9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main/java/com/marklogic/contentpump/DocumentMetadata.java:360-370 | src/main/java/com/marklogic/contentpump/DocumentMetadata.java:371-384 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DocumentMetadata.java"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"13df3702af0e5e6cdec64927a5e8729b3a861d49f3e22f9692e4db616ab93681"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): src/main/java/com/marklogic/io/BiendianDataInputStream.java:96-107 | src/main/java/com/marklogic/io/BiendianDataInputStream.java:109-119 | src/main/java/com/marklogic/io/BiendianDataInputStream.java:121-131 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/io/BiendianDataInputStream.java"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1916dc8892cf8ee3a640f121e025d17d9c0089300e54d22927bb92a6071ce90d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:314-322 | src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:325-333 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f5d21f096cf5f29d6326e700385bd312bdf9ff6166c2d931341b99e258b79d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): src/main/java/com/marklogic/contentpump/CompressedRDFInputFormat.java:42-52 | src/main/java/com/marklogic/contentpump/RDFInputFormat.java:48-58 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedRDFInputFormat.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"222cf47e77d80c962af4e589c1e34acd07f98c00bd99b8ba3e05dc1ed7bb956b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): src/main/java/com/marklogic/mapreduce/DOMDocument.java:175-186 | src/main/java/com/marklogic/mapreduce/JSONDocument.java:110-123 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/DOMDocument.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04164fcae6837e70072cfd1550e6e817c9602e88f91b35cf547896357031728"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): src/main/java/com/marklogic/mapreduce/DocumentReader.java:67-79 | src/main/java/com/marklogic/mapreduce/ValueReader.java:75-88 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/DocumentReader.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e91ef69c38fca7dc0cc2f478bda21cfcf3c39d2af039bc21bc25f4b0684520"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/com/marklogic/mapreduce/functions/ValueMatch.java:69-76 | src/main/java/com/marklogic/mapreduce/functions/ValuesOrWordsFunction.java:102-109 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ValueMatch.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fe58d292f0b668c8e2f112c831bae62579c07759121cd46c4b4b9e9d7879d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/java/com/marklogic/mapreduce/examples/BinaryReader.java:48-55 | src/main/java/com/marklogic/mapreduce/examples/ContentReader.java:62-68 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/BinaryReader.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a43e21c68e450d66242b0966a1540af61653e9a7dff1928ee6074ccadd5700"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/com/marklogic/contentpump/DelimitedJSONReader.java:126-133 | src/main/java/com/marklogic/contentpump/GzipDelimitedJSONReader.java:41-49 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedJSONReader.java"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd555e1eaa3d0a59f0b344d6329c1f32e3481562c1c306d17927240d6218459b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): src/main/java/com/marklogic/mapreduce/DOMDocument.java:196-203 | src/main/java/com/marklogic/mapreduce/JSONDocument.java:139-146 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/DOMDocument.java"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfc9787425a9f69a2ba0662f8c88170f6bd0e4e8f30087bd193297ed221ba7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): src/main/java/com/marklogic/contentpump/utilities/XMLUtil.java:51-57 | src/main/java/com/marklogic/mapreduce/NodePath.java:80-87 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/XMLUtil.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"738cfbe55c8063de19f116d7681cebc3a6c70f6223dc4e3f6e98955b19bd1b8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): src/main/java/com/marklogic/mapreduce/MarkLogicNode.java:65-73 | src/main/java/com/marklogic/mapreduce/examples/LinkCountHDFS.java:135-143 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicNode.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"142d49ddca5a67c35de75e5b6fda82969adbd29087c4e04430a3e255d3c53a82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 3): src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:412-445 | src/main/java/com/marklogic/contentpump/TransformWriter.java:683-716 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:836-869 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:412\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"55049d9a29d823ad6cba638bed05ec2ae9ef338b79f5ada01755c6f44a42a1af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java:93-123 | src/main/java/com/marklogic/contentpump/TransformWriter.java:231-261 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/TransformWriter.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java:93\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efb4430f3e2d8bec53d311236e472d1f14c55f9ac00d0a4b764d21c58a5d952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:238-266 | src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:333-361 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:238\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"80457fecb421061b8d47e8822bc4a84af4a071904982615f788cdc141161ebb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:113-139 | src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:228-253 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:113\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a3d55c010bdf4bfbc9de9aec6ab9b112495caa5ade8883094a6393492ca06b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 2): src/main/java/com/marklogic/contentpump/ThreadManager.java:263-290 | src/main/java/com/marklogic/contentpump/ThreadManager.java:325-350 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/ThreadManager.java:263\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f325d4dd912f27c9b409b8fdc63b6aa862442081fd1ae26597818bb1cf08f073"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java:99-123 | src/main/java/com/marklogic/contentpump/CompressedRDFReader.java:71-95 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java:99\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: \u0060ZipInputStream\u0060 names \u0060com.marklogic.contentpump.utilities.ZipInputStream\u0060 in one and \u0060java.util.zip.ZipInputStream\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f152b71e5d36fd6755d0918ca02b56828ec0d20f9ba62e21919b2117f1a8cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 4): src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:293-316 | src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java:116-139 | src/main/java/com/marklogic/contentpump/TransformWriter.java:254-277 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:675-698 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:293\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/marklogic/contentpump/TransformWriter.java:278\u0060 calls \u0060getAdhocQuery\u0060 and \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:317\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b03a7f0c23b79817ee2d4c5879631d3442c4a71a04dc3899b91594603986db1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): src/main/java/com/marklogic/contentpump/AggregateXMLReader.java:109-131 | src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java:69-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc54b11416f8aaa2eed01f4bf6ec0100a89ad2bf3d79fefcfe3c5e64d1b6c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201322 lines \u00D7 3): src/main/java/com/marklogic/contentpump/ThreadManager.java:269-290 | src/main/java/com/marklogic/contentpump/ThreadManager.java:331-350 | src/main/java/com/marklogic/contentpump/ThreadManager.java:393-408 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/ThreadManager.java:269\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec899a242d8b4e21369058ec726935b46720fd431775f6149630f20bf6a6d716"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:242-263 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:645-666 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:242\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6de1229a21bd7b2389e1c34c82178a66ecda272b93af4ac7b260e665f197b35"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): src/main/java/com/marklogic/contentpump/RDFReader.java:829-849 | src/main/java/com/marklogic/contentpump/RDFReader.java:867-887 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/RDFReader.java:829\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c711d576e7bf3a405c4bb7ac11eaedab3922b02dcab3371857c6047cf9a62d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 4): src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:317-334 | src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java:140-158 | src/main/java/com/marklogic/contentpump/TransformWriter.java:279-298 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:699-717 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:317\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/marklogic/contentpump/TransformWriter.java:278\u0060 calls \u0060getAdhocQuery\u0060 and \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:316\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b341310da3326f244cb307387d47b86ba2c8abb364c62f128ef3a22fcecced2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:309-328 | src/main/java/com/marklogic/contentpump/Command.java:1861-1879 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc25c1fad0ad3aa4a170180debf7b1d6af195e27ad2df9b00e7e69edafc3d4f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:203-222 | src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:361-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b94eb673fea3dca472b7a48eb18f99c408426c710b682855bd5b7ea7998fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:372-391 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:814-833 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:372\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10ca32d3ce1e2cd4ef873e21b58be35d5674f8d488520ed83937cf2ade2b941"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 4): src/main/java/com/marklogic/mapreduce/functions/ElementAttributeValueMatch.java:71-89 | src/main/java/com/marklogic/mapreduce/functions/ElementAttributeValues.java:70-88 | src/main/java/com/marklogic/mapreduce/functions/ElementAttributeWordMatch.java:71-89 | src/main/java/com/marklogic/mapreduce/functions/ElementAttributeWords.java:72-90 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/functions/ElementAttributeValueMatch.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/functions/ElementAttributeValues.java\u0060 as WHOLE FILES: 94% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElementAttributeValueMatch.java"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84f4774573f3377ec9809fe39f938600bd763edee2f930845760102e4e2fce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3): src/main/java/com/marklogic/mapreduce/functions/CooccurrencesFunction.java:41-59 | src/main/java/com/marklogic/mapreduce/functions/ValueOrWordMatchFunction.java:58-76 | src/main/java/com/marklogic/mapreduce/functions/ValuesOrWordsFunction.java:60-78 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/functions/ValueOrWordMatchFunction.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/functions/ValuesOrWordsFunction.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/CooccurrencesFunction.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"575bee81829109a93baf6316a6233813fdf4de458bc6168a7c836743aaceae03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java:81-98 | src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java:74-92 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc35b74f17739e85595e97b8aa13076a150784d0b13309ba94679ff3c8b5415"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/functions/ValueOrWordMatchFunction.java:81-98 | src/main/java/com/marklogic/mapreduce/functions/ValuesOrWordsFunction.java:82-100 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/functions/ValueOrWordMatchFunction.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/functions/ValuesOrWordsFunction.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/functions/ValueOrWordMatchFunction.java:81\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ValueOrWordMatchFunction.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"31163876f3e2ad612bb1c04a8e892a060da5ca8408d503e840ae575172429eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 3): src/main/java/com/marklogic/contentpump/RDFWritable.java:204-217 | src/main/java/com/marklogic/contentpump/utilities/PermissionUtil.java:126-143 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:283-296 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFWritable.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b00472df955cae3cfb2f8f65cd16eec8a3b4f9f23f6833cca6d3c6149d6cfb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:668-685 | src/main/java/com/marklogic/contentpump/Command.java:1583-1599 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/Command.java:668\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"665a407a30151da2c0b35fd47351b246deab09804cda5ca133138ba04b9bd187"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java:145-162 | src/main/java/com/marklogic/contentpump/RDFWritable.java:176-193 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/RDFWritable.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e9bacd8fb7dcea4dc7c0ecf65db315a527e2b86001ed113690b3bdad6cd707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:1023-1039 | src/main/java/com/marklogic/contentpump/Command.java:1478-1492 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/Command.java:1023\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"339ff0a2946ddce07f512722a27aae244967250f5421b5c82c928624db50c59c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:1131-1147 | src/main/java/com/marklogic/contentpump/Command.java:1690-1706 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/Command.java:1131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a12bc52c52d15b27453d8c77edada74c83e26cb0d1b6583b06bd2f0a4156fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:974-989 | src/main/java/com/marklogic/contentpump/Command.java:1848-1863 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"a58560f3d70fd4944cb6d73af3ef8430f1e4b02e837fe1c8ae6eee8c1369bb8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/main/java/com/marklogic/contentpump/RDFReader.java:465-480 | src/main/java/com/marklogic/contentpump/RDFReader.java:497-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fe5bae54aff18269587d8d54d0b990eabf8540e355a6d5fa25d182f69f7377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/DOMDocument.java:70-85 | src/main/java/com/marklogic/mapreduce/JSONDocument.java:50-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/DOMDocument.java"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc14b4cd81e761094e777161016dcd99ca281ab50d3aee22489310811ef4cee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): src/main/java/com/marklogic/contentpump/Command.java:311-325 | src/main/java/com/marklogic/contentpump/Command.java:1862-1876 | src/main/java/com/marklogic/contentpump/Command.java:2324-2338 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/marklogic/contentpump/Command.java:2323\u0060 calls \u0060configFilteringOptions\u0060 and \u0060src/main/java/com/marklogic/contentpump/Command.java:309\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"357852da0c0ed6a1f34c99a8733cb376df077bc756f7f4a6605139b47415ddf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:604-618 | src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:690-704 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:604\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5062d2ddf7ea80f8a2ce7f7f54710ca4b2275aa0a9c99310322829a3a85862f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:161-174 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:619-633 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec21afd8692017c4af40b30582e6cb8ac1ece71ff25c8a9ad0ff99ed21329bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java:58-72 | src/main/java/com/marklogic/contentpump/TransformWriter.java:206-220 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/TransformWriter.java\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 104 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"da52574b562cdb7d5cd00ab5f4622b858559a75d9223a9398af546ba08d8ec5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:172-186 | src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:220-234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextReader.java"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edd0597529367226a3b61b9d349b138f4b45db9c916c1112e0c48a595ef9e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/marklogic/contentpump/RDFReader.java:717-731 | src/main/java/com/marklogic/contentpump/RDFReader.java:757-771 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/RDFReader.java:717\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7c114ed2d81deb4a4671b6fb066af670242b4b5073c6cf2b4fd3d783f3c194"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/main/java/com/marklogic/contentpump/utilities/ReflectionUtil.java:74-88 | src/main/java/com/marklogic/contentpump/utilities/ReflectionUtil.java:108-122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/ReflectionUtil.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be6a47dd3149182e46aa09305cbb667ea63dde0786676fcc151cc97ee013538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 7): src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:317-328 | src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:427-439 | src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java:140-152 | src/main/java/com/marklogic/contentpump/TransformWriter.java:279-292 | src/main/java/com/marklogic/contentpump/TransformWriter.java:698-710 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:699-711 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:851-863 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 58 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:317\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/marklogic/contentpump/TransformWriter.java:278\u0060 calls \u0060getAdhocQuery\u0060 and \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:316\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"29deebf60da3929f0862df6f31a8238a2ae975ca760cda51c3041d035a2b9ee1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:601-614 | src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:670-683 | src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:687-700 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b90ad22f8a0367c7e29c87b0879c500e3ee2ce6e9be67f3e3f5d5f0d3782a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java:125-138 | src/main/java/com/marklogic/contentpump/RDFWritable.java:121-134 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/RDFWritable.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java:125\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/marklogic/contentpump/RDFWritable.java:116\u0060 calls \u0060setGraph\u0060, \u0060setPermissions\u0060 and \u0060src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java:123\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"148adb4233ea4c3f746c3c09909d354dead3034035083b047331d71c577e42ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:194-207 | src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java:173-186 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/DelimitedTextReader.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:194\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextReader.java"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"07833c25d5b4331566df7fe26eeb667545e8b9206cada255a5828cd689881e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/main/java/com/marklogic/contentpump/LocalJobRunner.java:204-217 | src/main/java/com/marklogic/contentpump/LocalJobRunner.java:383-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/LocalJobRunner.java:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/marklogic/contentpump/LocalJobRunner.java:397\u0060 calls \u0060set\u0060 and \u0060src/main/java/com/marklogic/contentpump/LocalJobRunner.java:218\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/LocalJobRunner.java"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f714720331c3d35fcba923a40cbcfc556d25617eddd8df714a98021edd95a655"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/marklogic/contentpump/AggregateXMLReader.java:229-241 | src/main/java/com/marklogic/contentpump/AggregateXMLReader.java:398-410 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/AggregateXMLReader.java:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5e2e30d1ba2d91b4e14f26c221e02ccf03d52aec920be2359915a658b033a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:1047-1059 | src/main/java/com/marklogic/contentpump/Command.java:1500-1512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/Command.java:1047\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedb80689fc5f8bdced92aa2c789d533ae2a8643e23e1104c7fe7d3b79a579e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): src/main/java/com/marklogic/contentpump/TransformWriter.java:612-620 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:554-566 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/TransformWriter.java:612\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"5811c85dfeba18dd58829505e228519adf7430ead771e033d59ec0928d4d491a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java:125-137 | src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java:212-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java:125\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java:138\u0060 calls \u0060setNewVariable\u0060, \u0060Boolean\u0060 and \u0060src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java:225\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"409b6c74d99513bacc3c25936cf044d036af91fbd0f481a5c26ac558d949687c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java:140-152 | src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java:225-237 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java:140\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java:138\u0060 calls \u0060setNewVariable\u0060, \u0060Boolean\u0060 and \u0060src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java:224\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e7bccbf22c9eeddde52d6b751885cccd7427ebf23d8d876eb4bb0cd1e69cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:605-616 | src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:691-702 | src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:461-472 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:605\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff6924f216cd8a75b9ac0befb22cf6e3153ecafe86fdb627009799fe973d7c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/main/java/com/marklogic/contentpump/InputType.java:306-317 | src/main/java/com/marklogic/contentpump/RDFReader.java:603-614 | src/main/java/com/marklogic/contentpump/utilities/PermissionUtil.java:110-121 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/InputType.java:306\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/InputType.java"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e7b1ee8a858c0a6a65ebd3c658e3788db263494e5af470ceb57deb5566cd4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): src/main/java/com/marklogic/mapreduce/examples/LinkCount.java:81-92 | src/main/java/com/marklogic/mapreduce/examples/LinkCountCooccurrences.java:91-102 | src/main/java/com/marklogic/mapreduce/examples/LinkCountValue.java:82-93 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCount.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCountValue.java\u0060 as WHOLE FILES: 86% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCount.java"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac5fe5f4d70b99b8218085b634a86a54b2ebbb06334e584e4997fe4bc40af5c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/marklogic/contentpump/AggregateXMLReader.java:182-193 | src/main/java/com/marklogic/contentpump/AggregateXMLReader.java:305-316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/AggregateXMLReader.java:182\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b2531451f9e848631147fbb7793a122dbb776208b70792b2a2b030cdf88b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:72-83 | src/main/java/com/marklogic/contentpump/Command.java:1841-1851 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/Command.java:72\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"41817f19a66a3a94c268adf823c401bfac4e8b2f0e3545ce658efbf3368de638"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/marklogic/contentpump/ThreadManager.java:304-315 | src/main/java/com/marklogic/contentpump/ThreadManager.java:421-432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/ThreadManager.java:304\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc92e054fbe0dee247c6ecf8b87ced4f6044f0578ebc6d732248e1727892ee80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java:658-669 | src/main/java/com/marklogic/mapreduce/MarkLogicOutputFormat.java:188-199 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java:658\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"418dee7a7f9d57bcd1d3553407218a8fffbeceeff86645432a53bb9ecb855c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java:95-104 | src/main/java/com/marklogic/contentpump/CompressedDelimitedTextReader.java:77-87 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java:95\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: \u0060ZipInputStream\u0060 names \u0060com.marklogic.contentpump.utilities.ZipInputStream\u0060 in one and \u0060java.util.zip.ZipInputStream\u0060 in another \u2014 different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"75829fa34bef5fb3baf7d4bf0f9ae34969cb6a5dc44132472fea71d2c1a16870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:270-280 | src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:393-403 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:267\u0060 calls \u0060setNewIntegerVariable\u0060 and \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:392\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78972e4abc9b3505310324a4735e575d665aebefda9c9b4e7aaf9acf2af64fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:291-301 | src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:408-418 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:291\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:288\u0060 calls \u0060debug\u0060 and \u0060src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:405\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8bd883b330925cffafc705d33c77cca95e886ef93dac7efabdfc49dc21c1639"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:410-420 | src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:646-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:410\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaab5b1d0c1147e4196591c8d44a85d8c251e35e88a95e7060574b27f9e3628e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/marklogic/contentpump/SingleDocumentWriter.java:168-178 | src/main/java/com/marklogic/mapreduce/utilities/URIUtil.java:87-97 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/SingleDocumentWriter.java:168\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/SingleDocumentWriter.java"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7b5ebde33f7a661844389f187a507833d67f2b5967ca83bfb30b30533f9b26"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:165-175 | src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:206-215 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c656a67f43694ee119736bfefa5f031c18dbbeef776430ebcfe8a49447c7336"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:164-174 | src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:223-233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:164\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd08f7cdd5b809bcdca3abe6851215785f66a567749b82cedd1db8f8cfc3b1dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:176-186 | src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:235-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:176\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b93157dd238659b0ffc389dcb714809b74050093b4f85434b93bee40b6aa527"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/contentpump/ArchiveRecordReader.java:159-168 | src/main/java/com/marklogic/contentpump/ArchiveRecordReader.java:176-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ArchiveRecordReader.java"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c9d85b100f59a5a8385fc29892ff9f1b444ff17397d80fd03620322a24e4b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:780-789 | src/main/java/com/marklogic/contentpump/Command.java:1198-1207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6eed41a696777c5bc00b332ccc90e0a846f0703ff0107490f62d1bb8f3e9d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:1063-1072 | src/main/java/com/marklogic/contentpump/Command.java:1521-1530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/Command.java:1063\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fba1a593a0301882a9dd1cfdf5ee65bcc1b3830d95724d5f697fb5a925d44d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:361-370 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:803-812 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java:361\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a753871ebf4b080ff92b4350dab91c2098e5a974c3ce4b5a2900a3339e1b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:110-119 | src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java:159-168 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/DelimitedTextReader.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextReader.java"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cb227a7750c029405a99f6d686defc01ebba8ac2d8c17cf284d8de75357ee3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/contentpump/LocalJobRunner.java:107-116 | src/main/java/com/marklogic/contentpump/LocalJobRunner.java:128-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/LocalJobRunner.java:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/LocalJobRunner.java"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"336c7d9e2cf6ab81c6636a985a8b0b0b4f1a7e9b64353d422c7059e1c30ba176"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/contentpump/OutputArchive.java:91-100 | src/main/java/com/marklogic/contentpump/SingleDocumentWriter.java:87-96 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/OutputArchive.java:91\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/OutputArchive.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8214ab9df1ec96f5f4be19a394ffc42510e7ba7836243d7298e38f95f2fb5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/contentpump/TransformWriter.java:387-396 | src/main/java/com/marklogic/contentpump/TransformWriter.java:417-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/TransformWriter.java:387\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"038425aedfa06695853f0827fde824a58913cdfb326d86c1fa2eb5c7a83f3f6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/contentpump/utilities/PermissionUtil.java:51-60 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:273-282 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/utilities/PermissionUtil.java:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/PermissionUtil.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ddd0e20a777f8de1ee7ae3bb69d29aca41926377543a08371cc5c496fdf8dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/dom/ElementImpl.java:330-339 | src/main/java/com/marklogic/dom/ElementImpl.java:349-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/dom/ElementImpl.java:330\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/ElementImpl.java"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3992416ebbd9889f174f74cbe2303b30f63de3dbdef0fee202eb1e580a3b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java:239-248 | src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java:254-263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java:239\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e8129497682f22789a5f4af61cb462ee9df829e1e4626763b8b519d6fba418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/functions/ValueMatch.java:58-67 | src/main/java/com/marklogic/mapreduce/functions/Values.java:55-64 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/functions/ValueMatch.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/functions/Values.java\u0060 as WHOLE FILES: 85% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ValueMatch.java"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f45452103375c116d6fd9daa6978e85ef4482b1a83d87aecb26114cee95e3e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 10): src/main/java/com/marklogic/mapreduce/examples/BinaryReader.java:59-66 | src/main/java/com/marklogic/mapreduce/examples/ContentLoader.java:57-64 | src/main/java/com/marklogic/mapreduce/examples/ContentReader.java:72-79 | src/main/java/com/marklogic/mapreduce/examples/LinkCount.java:71-78 | src/main/java/com/marklogic/mapreduce/examples/LinkCountCooccurrences.java:80-88 | src/main/java/com/marklogic/mapreduce/examples/LinkCountHDFS.java:85-92 | src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java:127-134 | src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java:120-127 | src/main/java/com/marklogic/mapreduce/examples/LinkCountValue.java:72-79 | src/main/java/com/marklogic/mapreduce/examples/RevisionGrouper.java:58-65 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCount.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCountValue.java\u0060 as WHOLE FILES: 86% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/BinaryReader.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b12f3556dded53f90d980b070ff6b21ea8a6ca4e2ba44dc44082ea2cded77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 8): src/main/java/com/marklogic/mapreduce/functions/ElementValueMatch.java:60-68 | src/main/java/com/marklogic/mapreduce/functions/ElementValues.java:60-68 | src/main/java/com/marklogic/mapreduce/functions/ElementWordMatch.java:60-68 | src/main/java/com/marklogic/mapreduce/functions/ElementWords.java:60-68 | src/main/java/com/marklogic/mapreduce/functions/FieldValueMatch.java:57-65 | src/main/java/com/marklogic/mapreduce/functions/FieldValues.java:57-65 | src/main/java/com/marklogic/mapreduce/functions/FieldWordMatch.java:57-65 | src/main/java/com/marklogic/mapreduce/functions/FieldWords.java:59-67 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/functions/ElementValueMatch.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/functions/ElementValues.java\u0060 as WHOLE FILES: 95% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/functions/ElementValueMatch.java:60\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElementValueMatch.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2d321877ead8e504b6480d996dc47ab839efd9affab38ea29e54073b152c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/main/java/com/marklogic/contentpump/CompressedDelimitedTextReader.java:97-105 | src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:114-122 | src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java:163-171 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/DelimitedTextReader.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedDelimitedTextReader.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ef46786020714228d5de6683cc246e230e704f2104f2dce130bbaf8e2ada90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/main/java/com/marklogic/contentpump/RDFReader.java:681-689 | src/main/java/com/marklogic/contentpump/RDFReader.java:829-837 | src/main/java/com/marklogic/contentpump/RDFReader.java:867-875 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/RDFReader.java:681\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bbc298d5b28b962dcd07ac428a78850dce09c9c980c403818aa406afb6323a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:270-278 | src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java:109-117 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/DelimitedTextReader.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:270\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextReader.java"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"22eb26c323af9136f30f9017c28d077af4cf97a883c7835e7822063fe40170b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/ForestInputFormat.java:213-221 | src/main/java/com/marklogic/mapreduce/ForestInputFormat.java:230-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestInputFormat.java"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69147af1037b022e3b373aa64e827a190cedf1f87407cff4e4df92182150757"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/MarkLogicInputSplit.java:135-143 | src/main/java/com/marklogic/mapreduce/utilities/ForestInfo.java:87-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/MarkLogicInputSplit.java:135\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicInputSplit.java"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc036deb972a6f7ac15232daa06a53e55ef7ee5c0bc47264c8ff7a99ee43f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:616-624 | src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:632-640 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java:616\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacd7ac753882a69550c7e412e58c74e782531be9aec78c9e551ea156e04a621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 7): src/main/java/com/marklogic/contentpump/AggregateXMLReader.java:123-129 | src/main/java/com/marklogic/contentpump/ArchiveRecordReader.java:80-86 | src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java:82-89 | src/main/java/com/marklogic/contentpump/CompressedDelimitedTextReader.java:65-71 | src/main/java/com/marklogic/contentpump/DelimitedTextReader.java:94-100 | src/main/java/com/marklogic/contentpump/RDFReader.java:249-256 | src/main/java/com/marklogic/contentpump/SequenceFileReader.java:68-74 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 7 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0451c925951fc3c57a2142a03d693ad4fb46f954fc366acffd393ba8f20a56a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:299-307 | src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:602-609 | src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:671-678 | src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:688-695 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:299\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:610\u0060 calls \u0060init\u0060 and \u0060src/main/java/com/marklogic/contentpump/DatabaseContentReader.java:308\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3260fee5bbf014c994b574410fa0151ef46eecc920c83a7d8714d23fe4d8686"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java:168-175 | src/main/java/com/marklogic/contentpump/RDFWritable.java:145-152 | src/main/java/com/marklogic/contentpump/examples/SimpleSequenceFileValue.java:75-82 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/RDFWritable.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java:167\u0060 calls \u0060writeString\u0060 and \u0060src/main/java/com/marklogic/contentpump/examples/SimpleSequenceFileValue.java:74\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"750eb8e89357f9f979c238eeec27944aa9ba7cd067d363c28e3344175e956e6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/main/java/com/marklogic/contentpump/RDFReader.java:678-685 | src/main/java/com/marklogic/contentpump/RDFReader.java:727-734 | src/main/java/com/marklogic/contentpump/RDFReader.java:767-774 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/RDFReader.java:678\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/marklogic/contentpump/RDFReader.java:677\u0060 calls \u0060write\u0060 and \u0060src/main/java/com/marklogic/contentpump/RDFReader.java:726\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7783b04c2d21975bf00283c8efb4e3c6d33393bbafc48c00d84534ac0326814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:1084-1091 | src/main/java/com/marklogic/contentpump/Command.java:1806-1813 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1084}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bc8657b5b76d074ed2d1f7aae8a6046485d783d1457a3958d006f7528e2a28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/marklogic/contentpump/RDFReader.java:708-715 | src/main/java/com/marklogic/contentpump/RDFReader.java:749-756 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/RDFReader.java:708\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"438694e5116c80029c6b6b5560757d80855f9438e972aaf0a2a72ae4a11c1501"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/marklogic/contentpump/ThreadManager.java:293-300 | src/main/java/com/marklogic/contentpump/ThreadManager.java:411-419 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaaa7d4b7993abd39106762fce3c9a8dcab720c327aa3bfcf88705e180914be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:416-424 | src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:458-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:416\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:466\u0060 calls \u0060init\u0060 and \u0060src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:425\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"564ad59768315411456d708b7b6fce450a6298a3ef44fdece905cd9a3f2846cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/main/java/com/marklogic/tree/ExpandedTree.java:638-645 | src/main/java/com/marklogic/tree/ExpandedTree.java:652-659 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/tree/ExpandedTree.java:638\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060src/main/java/com/marklogic/tree/ExpandedTree.java:661\u0060 calls \u0060atomString\u0060 and \u0060src/main/java/com/marklogic/tree/ExpandedTree.java:646\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a84c039b43bbc0b444dac1d08a4b812987710186c610bbaf34ac7534bf61fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:137-144 | src/main/java/com/marklogic/mapreduce/NodeWriter.java:60-66 | src/main/java/com/marklogic/mapreduce/functions/CooccurrencesFunction.java:47-53 | src/main/java/com/marklogic/mapreduce/functions/ValueOrWordMatchFunction.java:64-70 | src/main/java/com/marklogic/mapreduce/functions/ValuesOrWordsFunction.java:66-72 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/functions/ValueOrWordMatchFunction.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/functions/ValuesOrWordsFunction.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java:137\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2013e0b0390bffe5ac5d8249e1dd4a683a4591ca58b4683ae47799ef8a3fcb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/marklogic/contentpump/Command.java:2576-2582 | src/main/java/com/marklogic/contentpump/Command.java:2599-2605 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/Command.java:2576\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":2576}}}],"partialFingerprints":{"codehealthFindingId/v1":"3223e59900699be7df175dfc8185aa831306ee1b9aa029514adbf1f27b16773c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/marklogic/contentpump/TransformWriter.java:380-386 | src/main/java/com/marklogic/contentpump/TransformWriter.java:401-407 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/TransformWriter.java:380\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9716a9e8207f3c727f5d553f237de95145d811086877746966ac912bf9cbd0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java:625-631 | src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java:253-259 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java:625\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6c0e087da5520a88d922182201b8928eb50d5284e44d2ea8aab7adbdd71e22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/utilities/LegacyAssignmentPolicy.java:68-74 | src/main/java/com/marklogic/mapreduce/utilities/LegacyAssignmentPolicy.java:84-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/utilities/LegacyAssignmentPolicy.java:68\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/LegacyAssignmentPolicy.java"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"021c338953ba4df7604078bab1fdec4dccb2cfed8ee854b780df0fdf4d71c896"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/marklogic/dom/NodeImpl.java:335-340 | src/main/java/com/marklogic/dom/NodeImpl.java:344-349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/dom/NodeImpl.java:335\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/NodeImpl.java"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"2243607125ad718bb587b96f3bb599d44eee3264d76db8f4a0afac70c4b3b0b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/main/java/com/marklogic/io/Decoder.java:199-208 | src/main/java/com/marklogic/io/Decoder.java:222-231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/io/Decoder.java"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"199e70562b9538bfb0fc2e7bb66edb7fcd5e3ab6a37b8f557386d0e0ac24a7a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/marklogic/tree/CompressedTreeDecoder.java:72-82 | src/main/java/com/marklogic/tree/CompressedTreeDecoder.java:95-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/main/java/com/marklogic/tree/CompressedTreeDecoder.java:71\u0060 calls \u0060decodeUnsigned\u0060 and \u0060src/main/java/com/marklogic/tree/CompressedTreeDecoder.java:94\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/CompressedTreeDecoder.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34f6949f4eff86ba4615aed0effa6e011c4b517d99c94f0b889254f88002b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/main/java/com/marklogic/dom/ElementImpl.java:234-238 | src/main/java/com/marklogic/dom/ElementImpl.java:328-332 | src/main/java/com/marklogic/dom/ElementImpl.java:347-351 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/dom/ElementImpl.java:234\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/ElementImpl.java"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7fe2405e24cf0a28c844ef3d36b9c705c8491be7e4f9ea86bd941c0fe11d5ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/marklogic/contentpump/AggregateXMLReader.java:99-104 | src/main/java/com/marklogic/contentpump/RDFReader.java:200-205 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47482c701c099c96b28206a8ace9e7abae22b9395ebdc1a66b02deae6bbd4fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): src/main/java/com/marklogic/contentpump/ArchiveOutputFormat.java:49-59 | src/main/java/com/marklogic/contentpump/SingleDocumentOutputFormat.java:51-61 | src/main/java/com/marklogic/mapreduce/MarkLogicOutputFormat.java:115-125 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/contentpump/ArchiveOutputFormat.java\u0060 and \u0060src/main/java/com/marklogic/contentpump/SingleDocumentOutputFormat.java\u0060 as WHOLE FILES: 82% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/ArchiveOutputFormat.java:49\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ArchiveOutputFormat.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"375263ebc6e9fd2bc014d372ef29e1566581be97801fa71bc00468f76de0446c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/main/java/com/marklogic/contentpump/TransformWriter.java:545-551 | src/main/java/com/marklogic/mapreduce/ContentWriter.java:788-798 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"03789e34d6fc60ee67f23e9715df811fc2dc331a455a8b419d8c29aee523098e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/NodeOutputFormat.java:69-79 | src/main/java/com/marklogic/mapreduce/PropertyOutputFormat.java:77-87 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/NodeOutputFormat.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"47599c00547fd1f812ba58b60be6fb04da16ff16276690601c330bf3d55b0640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): src/main/java/com/marklogic/mapreduce/examples/LinkCount.java:60-67 | src/main/java/com/marklogic/mapreduce/examples/LinkCountCooccurrences.java:69-76 | src/main/java/com/marklogic/mapreduce/examples/LinkCountHDFS.java:74-81 | src/main/java/com/marklogic/mapreduce/examples/LinkCountValue.java:61-68 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCount.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCountValue.java\u0060 as WHOLE FILES: 86% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 3 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCount.java:60\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCount.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1e19193d722f6b30b6aded2bc2b381937b2645c66a8e2742968076293654b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java:119-123 | src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java:112-116 \u2014 before extracting anything, compare \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java\u0060 and \u0060src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cf4022c7ead0851903e2d357bbab4317f0332f95b5bed7b9383185cbed0e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): src/main/java/com/marklogic/contentpump/DatabaseContentOutputFormat.java:40-47 | src/main/java/com/marklogic/contentpump/DatabaseTransformOutputFormat.java:39-46 | src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java:352-360 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/contentpump/DatabaseContentOutputFormat.java:40\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentOutputFormat.java"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae555f191bfb94354a9a27fedf8f6411e792772508feb0bd00aa2c51bade756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/main/java/com/marklogic/dom/AttrImpl.java:69-73 | src/main/java/com/marklogic/dom/ElementImpl.java:224-228 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/AttrImpl.java"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dbd83ee7b3601cdd9a33a926909a6c9c1fc8178f90cafbd364038f4e179b785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/NodeOutputFormat.java:59-64 | src/main/java/com/marklogic/mapreduce/PropertyOutputFormat.java:66-72 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/main/java/com/marklogic/mapreduce/NodeOutputFormat.java:59\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/NodeOutputFormat.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e3f5c0f0aa49c32a403a164e8aa242a879795e73a8b18c21725293e6340387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/main/java/com/marklogic/mapreduce/functions/ElemValueCooccurrences.java:76-81 | src/main/java/com/marklogic/mapreduce/functions/FieldValueCooccurrences.java:72-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElemValueCooccurrences.java"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96c1c6992c1952188d450190e9da9826e09a99beea98ccc4ff33801f61cd4b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/main/java/com/marklogic/mapreduce/utilities/AssignmentManager.java:95-101 | src/main/java/com/marklogic/mapreduce/utilities/AssignmentManager.java:106-112 | src/main/java/com/marklogic/mapreduce/utilities/AssignmentManager.java:117-123 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/AssignmentManager.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0409fd17e336eb84db25a6349d3680d578a1a595ea2c60bee205b410afb468"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0dbd7accc7da15291a1ed782f2de794f84d16681127c0437ce14622428c86a84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is it better to read into a buffer or directly from the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/marklogic/mapreduce/Utils.java"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"360ada15a92b7750eadda1afd3d7e85ff9ac0fe53e39c7b6ea38cf7f05f7f177"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is it better to read into a buffer or directly from the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestReader.java"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c66a203ddbf5a9d74d51ac256c722356e8222a6bf5722d701d487cabe4516c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Is it better to read into a buffer or directly from the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dfa6eb3952c5afa0da2fc9192f77589dac54faa16756a3c07a846d5f597688"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated catch block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/marklogic/contentpump/Constants.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5f3478e8315c259f4c719c5991a2865e65e428e9fc3c345e6d8f2913c03683"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated catch block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/marklogic/contentpump/Constants.java"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb73add41c6dd3f36f089a6c1aba6db351ea95eeb272a1a137010181fe74dd98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated catch block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/marklogic/contentpump/Constants.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6da82845e557f3eb20433c46902514d51766a1e767ad4dad19947be4e46902"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated catch block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/marklogic/contentpump/Constants.java"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"46028e5c3b306bc8cbb139211dcee9272d29368c68fa3009abc6b2511d0cb651"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated catch block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaf33dfa7ec315f426e226af480207d2b47409be29649d0238c2f11b33cd288"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated catch block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"f973df6e0b58e9c9e9ae126510b7b9f25512284695f02e50fd28a3053a1fe2ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated catch block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a184e5aa5a4eeffdd8fae1177bd5733babf48335dd5a3822ef6ddfc87582ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated catch block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af8ea0bef5f8424c8ef0824002e537e6c4283838c20a9c2503f1d2e91369777"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated catch block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49db0809cbde6d50d000e299bf46ff9f5d31f3ebe37e77318c9fb2e71ddb985"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated catch block \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc88088caf903241c2ff60455c5b6b6789f7d24ac94523bd534b46c7e6249da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated constructor stub \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/test/java/com/marklogic/contentpump/TestImportBigData.java"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48edb3a5d16c8013ae65b98efebdd1497c5566d5175f4d420757baec290973c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated constructor stub \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/ZipInputStream.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"be987d7b7dc843f458a3076727723344a222560f7c0dab52e0b3d08dd085fd1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: compared performance \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/CompressedTreeDecoder.java"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed36f3e8b87600b0eeb45d53edd2031ffadcab1c94ec641679c26c621a5cb31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: if MAPREDUCE-3377 still exists, need to re-run initialize"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3c121480cb33b7c2a39fecd27e4cab5944b889fd0505c52541e4c8f405f08e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: revisit -- is it faster to use Text or String? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/NodePath.java"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f429c120669af75d00cfdd904b397da5ff6c5f177fb4514f27da17891f0a60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: More rigorous file checks to match stat() in C\u002B\u002B version? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb5fe10fb4af82cac6951b64f03b0885a08679c4c250b4d5aa39dad3ff9bbd4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Test range, platform byte ordering, bitness.  Auto-detect? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"079109ca05cd51915b781a6dc13383583b05b84221f6cbb9d2eacef4cb4522b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: buffers larger than int indexes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d1753538fb82f58806bc39b42ed1b2b61de9ce0f3ed227a9f7a307570500b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: less long more int; review ranges carefully; can\u0027t we assume there won\u0027t be more than 2B fragments in a forest? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"921f77dc4e6e3f88a345ef3703a471f5be74b7dc2c1ddfe0d008c6cf4139f278"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: review for proper application of unsigned comparators \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff163105aad72f43383cb9dd60728dc841f462824e302b039a1bf61e3cedf97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: tune buffer sizes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bca5272b9ef4608b8b27153305acecbd505259ff7c6db62a448edca72c91fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: pass files into check functions rather than directory \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b6c4763888bf5d9d6cb5790ed7918c7db5e2db5b78c6158526df1f7d3ff0978"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: test cases for all fail conditions \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"500e7077d48e40fd6e707ec9754ec3435c006ddb1f0d39030a1d6d63af9cdc55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: complete debug trace implementation (in fcheck.cpp too) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"35989a1106cd0d9c71907f3b7c3d38dc76494fee805291dfdacf43840b13bc2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: good command-line parser to support more options flexibility \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"640925f405f9952df9fa008e7c0e3f936241f3c5b2852f46d829e81b8ced6dd6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: switch back to dedicated endian-ness stream classes? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb1dc32238861e38243bfdf18da3da3a437d63adbe5225bee3871ac505ba52a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fdatw test is wrong i think \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faecf5a8a1c788dea851a7bf643126f9591d77a5c0c56524735eeda3275afa9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: count and verify bytes read \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/FCheck.java"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e2e099115303e04f0c64d80494ff1bdf6da6f9b2735506749c6cf793827e160"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated method stub \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf273472b025964fd47bcf157ce86d82476b8c9b6b5c2ae84147c2976498bfc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated method stub \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"1954c061073926d9393d630359ea6e27fc2f91f32b012da0bea81ad8374399f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated method stub \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"879e21837ffe764ded6ac43b204d0ea9b63db8442066fb0c2975ae41ee8760a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated method stub \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"889a9b71401f1332e0f92ddd054247ca37250b8c5463751111289699c55cc1b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated method stub \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"804ea1846b492255141ab826cb53c08212a20f3a6a7ffec83434e8e1aace5267"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO Auto-generated method stub \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e30a2b300c76dad4b3135386dab14e732e554165d136fd5ed3f33ac22f44404"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider implementing Traversal \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/NodeImpl.java"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"c190804eab7b89bddfb8f6a1e58a4e7a923927b4ee4ef09d71df7d15f536b4c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO - override in subclasses? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/NodeImpl.java"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"779015d469f1c1da87c944579062a1801fd05f882b8486ef7837df7f21a707e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO remove this check after hadoop 2.8.0 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CombineDocumentReader.java"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6846f89d4fb3a9ee6e75487acd5111ff63447c349c4f12888d193cb0371190c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Use this version if only JAVA 8 is supported \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DocumentInputFormat.java"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14fda9312168eba4a73d243eab04bae0623bfd5038168b6e78a1e72e5255f4f"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // HACK: fix this! \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFReader.java"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"9363512d440a9fae1bd2a98f914cb43ae33a094f4446f09614076a4df9275845"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060pom.xml\u0060 makes this repository a deployable product (line 127)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pom.xml"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"73441b099d00905c340033bc34d2658fc4c752315eef835d5cd8de1f9034cbef"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"24b1a511a745afb719e1f39b86583e583aab025cf0586225626f2ab7ad6d5a82"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b1fcc8d6decb0b2bda62087c2102dcf0b5f14c15ff4a52e0c690d6dec4f38d95"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a043da9b3a1c807cd818c101781c856965f5def2a658ef1e1e2460a191ba88c0"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cc1da2e171d2e73abbcf4ecb149771086a2a61cb3c78dba5f216567527625de0"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61924e9ae388ccdb128772e320ae636649107e428be54245e13dbd95e4d0305b"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ab5439ad24b0f7f4dea2b79f9c4679d1b561c6243451e148f37db2d7401f746"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"136087491288e43c5d1183dff8e9fdf00434b85e59d5a3eef01f015406adce00"},"taxa":[{"id":"CWE-295","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f6ee101389ca7f44ad7364fae740789ae36c4d08ee853dcc3e4806c33f276397"},"properties":{"dependency":{"package":"com.fasterxml.jackson.core:jackson-core","version":"2.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c90a7bcb5d29841b7d64310d3c3abf51b562f70b7d01f42784f601698f4e6d0e"},"properties":{"dependency":{"package":"org.apache.thrift:libthrift","version":"0.17.0","advisory":"[GHSA redacted]","aliases":["BIT-thrift-2026-41603","BIT-thrift-2026-43869","BIT-thrift-2026-43871","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-3926"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1355f292e77244550ba29e1dd6a2097014a7e8006386047b1ad1ea67d740ca98"},"properties":{"dependency":{"package":"com.fasterxml.jackson.core:jackson-databind","version":"2.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"36428c67e358c870ef80aa14b7a6bb66799ec615607ed85e10874ce295bdb818"},"properties":{"dependency":{"package":"com.google.guava:guava","version":"32.1.2-jre","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1bd28f370d33bbe991b1aa1fe3fa1ae7922f0900316daa3d0d0f434186d730ba"},"properties":{"dependency":{"package":"org.apache.commons:commons-configuration2","version":"2.10.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dec38e0fc18cdc5992cebd8b7b52da1614cc962644a231bfe98364b335234319"},"properties":{"dependency":{"package":"org.apache.logging.log4j:log4j-core","version":"2.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5526f1d2ff71b0a1044d27e049b70f89d8b347a3161f0c3fdfe510f1dd082bea"},"properties":{"dependency":{"package":"org.apache.commons:commons-lang3","version":"3.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"466494a61acfad602ff6bf38923f54f729b27798d4db3a6062fc953f47319e02"},"properties":{"dependency":{"package":"org.apache.logging.log4j:log4j-api","version":"2.17.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D34","level":"note","message":{"text":"Concentrated knowledge decay: 119 of 134 significant files have no living knowledge, while the repository is still being changed at a low rate (25 commit(s) in the last 90 days) \u2014 so this is one repo-wide knowledge-decay state, not 119 separate risks. Counted over 134 of the 213 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"008bd8d3156a7f5206da709f59f1f87af76671c6b9becea72c8c9cffbcbd4f8e"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Command.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8daeca3fc33ae646dd91d968b7d83e380efddffe11d3a7fdf552118b67f7665"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicConstants.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea77138288d5ee28e58d9850428ab262aa5da1ebb6359d065dd286193d70149a"}},{"ruleId":"D34","level":"note","message":{"text":"Most significant orphaned file: One of the orphaned files carrying the most lost knowledge \u2014 ranked by size weighted by the file\u0027s role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/CompressedTreeDecoder.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5e01fcbf4d93895698760f59a35125d24b95dd2dd2fc1393897682df4ddd13"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40842b4c139656d32f39d47ff50cb6220857ab99273881bf472c42559fa15a06"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/InternalUtilities.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93c5c0307a88a6848d54e673f7b05345eec413402df31bc08dad76f6e40ab1b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"267af990a4ee353b53fc21acd83ee8ec6c66eff709c4ea3952d308cbac7aa7b5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/AggregateXMLReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d827c44e32a6f4dd1dfbc51ec20d8f9aa329985187305a6d3faa147a6780b2b4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentPump.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f20303542df39c9bdaeb45b898adfe77a8d9e5e21fe3e2c2376def2d1de963c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c2176e0c702bf9a901209557380ab33d5edd86f6ab650fc904e5b34e290b99"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/InputType.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af91bbfe6f7e606a2d7d2fd2b34461069f7770f5c283e16efac0dcfc2cc4f6c1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ConfigConstants.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabe7d99ddba5e67dd9c77f1c2d3a43e3556a9aeeb6c5548b3fc90cd7e989620"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9645518f4066c2ce42ba591ba187312ec05098159ee34be61139d9ba0f9403aa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/ElementImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0440c798e0811bf270837d133228f20430983cb5e94657356af8f59eeff2c76c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5037dbe47333652caebe6cd4cf92cd0dbbfd8a852692e6d7d296b00ae98ec89"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3283fc6cf5592e815dbbb3433f873629c5fc989b579be33938e5253867c37506"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestInputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ebf02441abd5dca7642954eec0f0140e3d7e9534653aa1406ecdf0f6dbdde1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/FileAndDirectoryInputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6128da3386e3a44668a5d836c21755a8bf0adde8545c23914a3bdf4d9780ce7d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DocumentMetadata.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3edc148efb940828280de08a3a78c0b198a0c09a76e4ccdeece4ad96c2ae2a41"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/io/Decoder.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc130e6e9a91811c82400256fda278ccc631cd0accad829c90e145a1f051e11"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/AuditUtil.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8c42c7541ca18e5ad397d65c85de5e9a6242f18e475d00d9083ee3f5d6a75d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedAggXMLReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70953fba2d1f500dccf56c45c3079edf881dc84100b0592bb47a318a033d575"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ArchiveWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87218830f8af51747b06ab3dab61a3011585e13876cd244ef77126e8f89d767e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedJSONReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e612055a0607657d11a9d13dcff866b83d8e783272508ada0cae19c1fee5a1a1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/RDFWritable.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6402b5c24f928b3f54022685d40a105e50a695b707c0606b9a205a22221f0ea4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountHDFS.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a87cc8549d85cf17167a7daf8e9cd37f8621b7d925c8724d56cfe7ac21a406"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ImportRecordReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7450fea2ca069cff2089cc66422396d3308348a3bb304bba71c00814d5b53b95"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicOutputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd73173311ee5c1598e73e2f8d42132ef4eacb1325675ee1f1e2b6ceb53ffda"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/OutputArchive.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9867932109d7fe970206436c5f1a98e152dfc792ad2f47681958475645ee70be"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedDelimitedTextReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"820035392db5879cd26984bc419988638b0b5ac76e5c7230eb60924a65c17686"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedRDFReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4671326f657d607bdbc08e8bc6bdc0799217d12302252e3760e3fbdd56d0946a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ForestDocument.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcbc1990069f1f74ab83bf37a7dd7353a2fc207b0b4336e9229a652e2ef1ded8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/DatabaseDocument.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b8a2bb8a33553dde110b88d17a1641ec80ce1038a1dbc5fc4fddf9f40917b3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicNode.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1893ccfa4a66ebd329276756c939ac6d09101afcac2fd37c8c8d3ffe6e12ccd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/OptionsFileUtil.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c6984130b0d00910d6c71a6cf1702801f952f2acc352b017040f1d965c0ef5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/SingleDocumentWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a007cf4e9e7b9c568022b5c5f89a9447ca86e707d864803e7894611d266fff4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/AttributeNodeMapImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c7e5439069713f742c1f4d77b31c2151218455460bdc4eb13c4e4f500253ed"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CompressedDocumentReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7213b0a24b7c5f04b4b2e9abeb1b91f5891e95f6ce5f2215d099976a89207dab"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ArchiveRecordReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec70d137aeb76c7fb3c711e161ea4858ebfdecda43fb40a2304491c6b7b6c16f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextInputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33539275f407e0d412e66586567fd9a3c556ab4f634ed5ca1c6f377cca799d49"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/LargeBinaryDocument.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fed0d15cd4047b2a69d30423070c321d1331a83e5c3c099cc74fec0139e91ae"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ContentWithFileNameWritable.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9002a38b9350b93cd35b9280dc3057d5f0b45397e5ee6a0be2d098f4b2f4bdf"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/HelloWorld.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"885113906a03cb55dc6bee11bed17e1147e3e2974cb93f7ab88f29f07b9ce828"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/AssignmentManager.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f8435874e4c7de490ad720bb4f91f4da562f7ab30f7d3948d30bd2801fe0cbc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInDoc.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0119c27a9d08deb23c1e12634eff9cfde33005a414932fc7bf4e8e96c9f952d8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformOutputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb86e1e64de8ca26001393714a876d394665161d5279d5c30ede801b8d9b7d1c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/PermissionUtil.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97845c4d47a195d1c15f05be6679023ea58d04a69f68ebf5f266c8daf0a6fac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountInProperty.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5ba6357dc41061991ca7e50cc3d2b39c7e48e47a9095801ee39a9e69889709"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/SequenceFileReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b63e1973eeff997a00150899a6819b80daf5808c301b73f0d959f539e312939"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/AttrImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b178d37be7dcba944c1af361508cbe62a9dabdab98e52b4376357e3cde9702d4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/FileIterator.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ef892f33fc1678c2062359a13d72da6803649ce0b54d68d2e05c57ab127251"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/ReflectionUtil.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2129f3611bc74773b4e1fbc931ded3dcfb727c7f790dbf98d410df4b52eb5c7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/ZipContentLoader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2e5cc2cc481efeb2d1d5f893967c83beb92d77bc1a3c865af147b56490d7e3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountCooccurrences.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a167918219f77331edc2962f79e3488e8b35b1686ccb78760a65797ec3b93011"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/io/BiendianDataInputStream.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a8349a8385e58a44795aa83a8a8c27b2e97d14a3e1a4ba5a7b7b9820c42dd5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/ContentLoader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc4075e75b9d69a407165d5d5bcd879872c99ce492edbf4110c5075cfd6c15b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicInputSplit.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8852a8ac111bca98974e2fa14fa8ff414652ab76bfeda3e3de00a20ef0944b7b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DocumentInputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3b0cca4efaea1bc1539fe7e927a34ebfbf63e2f5268b38f7a37797916482bd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CombineDocumentReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba24017912e24327aeda791a7514b2c92d7c4ea20e59e39716cca1515f3b53d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/JSONDocument.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5fae0d4796d0fba5b97a4359a9b9adf765ffbb4c50a3ef73f95af4d4bac192"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/BucketAssignmentPolicy.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39be2e3045044dd8f674b7a15e712212521973b36a3c825acc435b5ebca93960"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/BinaryReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db405c0bd0f27cdac354db77e4d18fab0138c6d532f7e4291ac81a74140bf340"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/JSONDocBuilder.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c327d29d709ca5e5dbc47778726d14f287752c025a8495eab67e2d951af4d436"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentType.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0decff9ef9c77849be512bd9b5505f330332b5c4cbd10c3a13dbb5d451c386aa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/DocumentURIWithSourceInfo.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"644718614e4f85c04861daaf5256143fdf71ec2ebb1ffce1492294fdb877e97f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/LinkedMapWritable.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c92926f6513067ba81d10c21d216ac5ff9ba636dff46a1c32d5247bbac3944e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CombineDocumentInputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d656a6a02f6bf3de84bffe275754054cb9152659d4ca92b2d165b1ad61507a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/StatisticalAssignmentPolicy.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93484ace7c7afcdba4adfda84a303a420b4d8889b33c1ec5b845f2f2592b49d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/DocumentURI.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13636564cb56a203e851399a91ef174adfc025c9d2c53666ed90a185b3854747"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ValuesOrWordsFunction.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9059924f294b21f4e4cd5e0505888c174b8d403a644580dedf8dc9ff4c26436"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElemAttrValueCooccurrences.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92fc13483ceae4ad1995da10a238f041f308d0d256e9ec9fc2dff1c7fde871b6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCountValue.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eee5ce063fe7d7920a92e56ea3d7bbcd965ead665da1ca4501d70cc95760ada"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/CombineDocumentSplit.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"092fb1ef5b8433ebeadad33561b552b636086fedb739975c4dda507691335f2a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/LinkCount.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f0c5752e9e49b86e79955dcb91852a60163513fc89509930cd65c6307ea4e0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ZipDelimitedJSONReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff5d1b10d4054711d3108943fc0dc422468dccef31b818479843ea122a32d90f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/NodeWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"892985b5d5f91a9a2f297fe4c8ab82b793c14b5f5c94b8b5c2a8d732f53935f3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01600b0b59a520487e8d2568776cda9e8218e1e087166fe8f44337f1d59fae45"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ValueOrWordMatchFunction.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"712a96627dd97f61fbe9be54cd877c584e6cbab254bde91c26ca2c8cd53332ec"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/KeyValueReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23eefaad5eca10d42c18d12c41f3de64573f0b8bfe5c8241a54255b21059c64"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/URIUtil.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3820395ed63ab7e2c66c5ed84880c4c10c19c4bf4dc54dfaa70ff586699cb690"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/LegacyAssignmentPolicy.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83666f9c4824bc43b85beb802c5d2982fbc56231fe32d483dcc7509ca08dcdb3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ZipEntryInputStream.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6f1c63d47091d51b2e465c090aaec76373fa8fbd5b105209d5238b062fc900"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/PropertyOutputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81d226580f7cab4378ccded2ce926c34898034378b6dd0e9b79d2e9e2bfcc0a0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/ForestInfo.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b2d12600a8d005ee4168549fc94fd68d563addc48316a94b7f357e7f93673c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/CharacterDataImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04bf3a492caca26ebdb74c4e179adb8c583fd8d34d93a1e1b2c9f6353914551"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ArchiveInputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da1fe54f831347f8404beb348328b164dcb21fc5c5347b770a37153fdfd5eef"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseDocumentWithMeta.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3158636672f5f61d5b851aebf73512cd4a1a76610ac170d5264ddb407ab5ac97"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/NodeOutputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79e31c1f994c8c24903e99f494497e86cb6b812a0672bc9f7afb730a065cf4a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DocumentPathFilter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5387bd0190985192ed9ec1794dc15353ae93c66071acbbdda1cddde33be487d6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElementAttributeValueMatch.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df28e704f8ec9ae758d110f5b7a9b8686289f868ee3502582390ffd63444282d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElementAttributeWords.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3162fb016299f12bab6294105c3262ed587a4474700fe92a651861c6b72bcca"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElementAttributeWordMatch.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a33af31b4540a5eb5c5ed021e19d860f8ddc895d9085ec0c962fa745bdef322"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/RestrictedHostsUtil.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfe6b1c494e5826e6df313b711262d8a58362241526f9bd64a5fc1a5789aed9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ValueMatch.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c57a8fde791ac47c8cec672bb69ad376a29312a25d116d361b25afc195d4495"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/PropertyOpType.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0beecf46aa48c366f8fad46390b49646e8aef11287490b6aace281c4c759e5e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElementAttributeValues.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b061e5c5771ceda0b929ade5378f802697bafaf2a3846bd00be7b1b4f70499"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/Versions.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fa0315103dbbf76903a5a897b717eed5a70c92da238c4baaa8ea28aa151b93"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/RevisionGrouper.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8b29b262dc543efade5d0fa9eadf4e79c502e21316604447a9642f09c3f9f2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/RegularBinaryDocument.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa81783197cdba4c8bf67d7292b9da88e5fa5ae68f425e5edbbcb1fbd7d349d6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/NodeOpType.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21a8d764608e179b16376c501bf8e8f514c23f4693ca3a9885039e9cd7daf85"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/KeyValueWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e4de6ea0914828d4070b63433d00dc1bde9353c7734ac14e88cb7bdca29ccc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/utilities/XMLDocBuilder.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3b30963d4dc881aa0f7f66fff5fabec5e53c65d43ee33d3034973f1a705ae5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ElemValueCooccurrences.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4031a4462a60f9511c87e281d86fb5c1e206eb41197060616c265fe2bc9ae147"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicDocument.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25b4e3c42b0fdc08331c44e89a7f2f978fb6dc6d9b2af9cc4f71b45667866b1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/PropertyWriter.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ef3f7cdbd8cec5431a841e95cfbedd45ab8cd2816361fa733207142fdfd623"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/CooccurrencesFunction.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4134f598134bf142e13876d825879c18084c4d4ab5513eff3593445098537bd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ValueReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f31bce3e46ebe7a0e0aebaa32c75fcec8be25ecc56c2251428c27bccff2f32"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/KeyValueOutputFormat.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b8493ab2b2a07874f5b422f7814bfe8b60e9ed689a4915259af0a140bd7250"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/FieldValueCooccurrences.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2c45f2a73e1434269c7f289da95a42aa4b8becc1d2132f00f2dae19f7a7d4a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/DocumentReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf00993f923bee0d63354f7908011a0197c52279f8cfef4c0bb310561672470"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/BaseMapper.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c6fdb91e6f139cbf5e854ee21263cc66c5df13511f8302e4f566ae5616ebd8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/ValueCooccurrences.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"959b96e8183da0ca9c0e2c2347ec8902fdcea8e0786d642cab0a1663ddc5ad3b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/examples/SimpleSequenceFileValue.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de1f140f556976b595f4b64a1da1a7535dde6b63d781be49e3d72d90ffe432b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/NodePath.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"604bf891d9e82a8159c3576a6d12f75b9539da6e795f5f0f568828c5ae44ab69"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/utilities/SegmentAssignmentPolicy.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edfb2efebbebb9b7d8a7ee9261eb84046fe575acf68728531686207057cbcc3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/functions/LexiconFunction.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"904af3443772999a5944afccba269bfecf19bcda4fefeaadba326b2b79c66a2c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/examples/SimpleSequenceFileCreator.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74187f3ebf041f3a5c450bebdb704824bb810c6bf4e9a174e59489f5c0157ce0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ExportOutputType.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"928141b964a6663906492beef7ca0121bc42ebe28b3ed9200eb513cf1c531282"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/examples/SimpleSequenceFileReader.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2facf6c122160aed33445d2ade402e651449ad27652a94539f2b11c3a216fa40"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/ProcessingInstructionImpl.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a24229f70713813ca14c0c993690286ff58f1d5b6b113415584ab077ef8f81"}},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4e9cb59d54ec885ff0057c9f360816cfc358d70541157199f728117e82ff2151"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 returns a placeholder under a TODO marker: \u0060getEntities\u0060 is a shipped method whose whole body returns a default value under a TODO/FIXME \u2014 a placeholder standing in for the implementation. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e2155669c1571b30f9fbdd3e36bd6e2841fb6dc783af309b49cfb70a77ba8d"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 returns a placeholder under a TODO marker: \u0060getNotations\u0060 is a shipped method whose whole body returns a default value under a TODO/FIXME \u2014 a placeholder standing in for the implementation. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f69217ef56c951af0146b80fb7625f2937a636e4328c4fffc26691914ecd03ab"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 returns a placeholder under a TODO marker: \u0060getPublicId\u0060 is a shipped method whose whole body returns a default value under a TODO/FIXME \u2014 a placeholder standing in for the implementation. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"85018110d2bbffd21139fac4749056e961393f7a59572b489eb01d2f5e8a7b7e"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 returns a placeholder under a TODO marker: \u0060getSystemId\u0060 is a shipped method whose whole body returns a default value under a TODO/FIXME \u2014 a placeholder standing in for the implementation. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f98b90cc2e6dda1628907dac6b50410f6366d3a367c1e9bd596ca42462fcb5"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 returns a placeholder under a TODO marker: \u0060getInternalSubset\u0060 is a shipped method whose whole body returns a default value under a TODO/FIXME \u2014 a placeholder standing in for the implementation. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"280a4e58996c74f5b780671df3ef1be4287469d1de04dc4c52aba75fa7978384"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 returns a placeholder under a TODO marker: \u0060getNodeName\u0060 is a shipped method whose whole body returns a default value under a TODO/FIXME \u2014 a placeholder standing in for the implementation. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/dom/DocumentTypeImpl.java"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ef66f82298e0d9fcd6315b904eb8662815afac7b2f6a9a96331a62c3c62c36"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P1","level":"note","message":{"text":"CI build step not evidenced: A CI pipeline exists but no build step was matched \u2014 changes may merge without the build ever running. A build step may be invoked directly as a command, or declared as a task that a runner named in the pipeline resolves."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"251015acef1a259fcc13b7c60660cc8917ccb3ae8056cb5165ae03312dd586e8"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add spotbugs with find-sec-bugs (or \u0060semgrep --config=auto\u0060, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 1 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/trufflehog.yaml"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060pom.xml\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pom.xml"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ba56174326d291606b85af9bcc30fde25dfc5976574bf512182928ada72ae7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(!fastLoad) \u0026\u0026 ((!needCommit) || committed)\u0060 appears character-identically in 2 files \u2014 src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java, src/main/java/com/marklogic/contentpump/TransformWriter.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bad1d828a27f44b40b1e7ffeae649babc00af02a3f9b6036d90b56f16742264"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(!fastLoad) \u0026\u0026 ((inserted \u0026\u0026 (!needCommit)) || committed)\u0060 appears character-identically in 2 files \u2014 src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java, src/main/java/com/marklogic/mapreduce/ContentWriter.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c2239b567e75a78043e98fd8e4afa33eb0d637d452813ddce151468a5295b0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060copyCollections || copyMetadata || copyQuality\u0060 appears character-identically in 3 files \u2014 src/main/java/com/marklogic/mapreduce/BinaryDocument.java, src/main/java/com/marklogic/mapreduce/DOMDocument.java, src/main/java/com/marklogic/mapreduce/JSONDocument.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/BinaryDocument.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"445acf765fdb1d6d044b3f98a34a803603d73df702d63d9117b5c723c7c208de"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hostNames == null || hostNames.length \u003C 1\u0060 appears character-identically in 2 files \u2014 src/main/java/com/marklogic/contentpump/DatabaseContentReader.java, src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"8924d83fb943f774e18b36239a264202d0516b249d3268674f0eace5dde083ee"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060message != null \u0026\u0026 message.contains(INVALID_TOKEN_DELIMITER_ERROR)\u0060 appears character-identically in 2 files \u2014 src/main/java/com/marklogic/contentpump/DelimitedTextReader.java, src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextReader.java"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"eebbcbaf4fcbc1efb1831357cad46811b6c29741fe1f76acbb5f41845a3e04f5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060needCommit \u0026\u0026 stmtCounts[sid] == txnSize\u0060 appears character-identically in 3 files \u2014 src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java, src/main/java/com/marklogic/contentpump/TransformWriter.java, src/main/java/com/marklogic/mapreduce/ContentWriter.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c2fc4f8784b33306a197c386701c9b4d201afa49119d0415706a8463f18589"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060needCommit \u0026\u0026 stmtCounts[sid] \u003E= txnSize\u0060 appears character-identically in 2 files \u2014 src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java, src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"802f82b1d870332a0d6b824ad46e6574c250e1e5d32ab7f2be427536432a92a2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060outputHosts == null || outputHosts.length == 0\u0060 appears character-identically in 2 files \u2014 src/main/java/com/marklogic/contentpump/InputType.java, src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/InputType.java"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"3521c862f87d6df3d859e54d898eef911c5b807d091fc4948c0a7e4270f9c8d8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parser == null || parserIterator == null\u0060 appears character-identically in 2 files \u2014 src/main/java/com/marklogic/contentpump/DelimitedTextReader.java, src/main/java/com/marklogic/contentpump/SplitDelimitedTextReader.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DelimitedTextReader.java"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"b434f2857bf771d83302bf423dc2e233c4d50643403337211442c19a279792bb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060restrictHostsString!=null \u0026\u0026 !restrictHostsString.isEmpty()\u0060 appears character-identically in 2 files \u2014 src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java, src/main/java/com/marklogic/mapreduce/MarkLogicInputFormat.java. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentOutputFormat.java"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f10688e3f333f02c794cb06216289e7449199acb5f878eb6b8ec8a43821d9e2"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060atomDataLen\u0060 is read from the bytes being parsed at line 306 (\u0060readInt\u0060), then used to size a \u0060new byte[]\u0060 at line 308 \u2014 and nowhere in its scope is \u0060atomDataLen\u0060 bounded from above \u2014 compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an \u0060OutOfMemoryError\u0060 or, negative, throws \u0060NegativeArraySizeException\u0060 out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060atomDataLen\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e113ccc69ff4e26f406ee22e822a0b2bfafe12adba3a5d5e93c21d477cb10e5c"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060nodeNameNameAtomLen\u0060 is read from the bytes being parsed at line 320 (\u0060readInt\u0060), then used to size a \u0060new int[]\u0060 at line 322 \u2014 and nowhere in its scope is \u0060nodeNameNameAtomLen\u0060 bounded from above \u2014 compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an \u0060OutOfMemoryError\u0060 or, negative, throws \u0060NegativeArraySizeException\u0060 out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060nodeNameNameAtomLen\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c0eade93f7ec5f2be746d2b0d196d532e190b87ea79d63bf5488f9916e494f"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060numElemNodeReps\u0060 is read from the bytes being parsed at line 343 (\u0060readInt\u0060), then used to size a \u0060new int[]\u0060 at line 345 \u2014 and nowhere in its scope is \u0060numElemNodeReps\u0060 bounded from above \u2014 compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an \u0060OutOfMemoryError\u0060 or, negative, throws \u0060NegativeArraySizeException\u0060 out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060numElemNodeReps\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7005237bdf8b5b3ed9fc079f6693fbb715c5064de8f0d06b5b6a478b84d59d"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060numAttrNodeReps\u0060 is read from the bytes being parsed at line 364 (\u0060readInt\u0060), then used to size a \u0060new int[]\u0060 at line 366 \u2014 and nowhere in its scope is \u0060numAttrNodeReps\u0060 bounded from above \u2014 compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an \u0060OutOfMemoryError\u0060 or, negative, throws \u0060NegativeArraySizeException\u0060 out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060numAttrNodeReps\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bfbf3e9cb2f1d54388bfc3336b2f23896c9868b80bfa00e8fac99b8757a1aa"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060numDocNodeReps\u0060 is read from the bytes being parsed at line 388 (\u0060readInt\u0060), then used to size a \u0060new int[]\u0060 at line 390 \u2014 and nowhere in its scope is \u0060numDocNodeReps\u0060 bounded from above \u2014 compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an \u0060OutOfMemoryError\u0060 or, negative, throws \u0060NegativeArraySizeException\u0060 out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060numDocNodeReps\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22db67056663a512cbe259d0456a570eabd585f1497fbd7b2d67247fff5a763"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060numPINodeReps\u0060 is read from the bytes being parsed at line 399 (\u0060readInt\u0060), then used to size a \u0060new int[]\u0060 at line 401 \u2014 and nowhere in its scope is \u0060numPINodeReps\u0060 bounded from above \u2014 compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an \u0060OutOfMemoryError\u0060 or, negative, throws \u0060NegativeArraySizeException\u0060 out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060numPINodeReps\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fabb41faecb060ecff9041730cc597baf5e9be1c117eefde2603ef29666c058"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060numArrayNodeReps\u0060 is read from the bytes being parsed at line 431 (\u0060readInt\u0060), then used to size a \u0060new int[]\u0060 at line 433 \u2014 and nowhere in its scope is \u0060numArrayNodeReps\u0060 bounded from above \u2014 compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an \u0060OutOfMemoryError\u0060 or, negative, throws \u0060NegativeArraySizeException\u0060 out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060numArrayNodeReps\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0569b606190478ee3629bea3257698f83ebd8d2e105a4db6a305badf1fec70"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060numDoubles\u0060 is read from the bytes being parsed at line 442 (\u0060readInt\u0060), then used to size a \u0060new double[]\u0060 at line 444 \u2014 and nowhere in its scope is \u0060numDoubles\u0060 bounded from above \u2014 compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an \u0060OutOfMemoryError\u0060 or, negative, throws \u0060NegativeArraySizeException\u0060 out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060numDoubles\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/tree/ExpandedTree.java"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d58f607477ec099c4bb03585e95abe9ecafeeb9370daf6019ed92b817092df"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 72 (\u0060readInt\u0060), then used to size a \u0060new byte[]\u0060 at line 74 \u2014 and nowhere in its scope is \u0060len\u0060 bounded from above \u2014 compared to a limit, clamped, or checked against the input that remains (a zero or sign test, or the loop that counts up to it, bounds nothing). Whoever wrote those bytes therefore chooses the allocation directly: a 32-bit length asks for up to 2 GiB before a single byte of the payload is known to exist, which either exhausts the heap with an \u0060OutOfMemoryError\u0060 or, negative, throws \u0060NegativeArraySizeException\u0060 out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseDocumentWithMeta.java"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc28635265b23cb6e5df257ce7c9adb847199199b9c2bca3058b5e1747b808c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"0196c032cf54fd306818f6e968651c63f8daebeb7a2688f15fc8f75ac6143317"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of \u0060close()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3838a209d4834dee9ed2bf75c4faf20c4f41c36bc1f4510e105363288d99c2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"23063157a538550cd109a452d693c26fc3f4831c8d0f181dffa2d93dc90376cd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/ContentWriter.java"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b2eade84c5714a57dbdbdef02385432d1db85739dd1a50f66e0a75c7f8111d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"002e78b828653d3e40b240eec98b0cf68064f8782d4e579df243fe1873f4b754"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/MarkLogicRecordReader.java"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"2126ae8ed11cf7061f05733ac8a0e8feffcf39cbf3c6814034f0678f42cad2b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/test/BinaryLoader.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7f7c065225451f99934d94baebec7e72a50737d334a1535b3cc1a7c81178d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (Exception)\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/mapreduce/examples/ContentLoader.java"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c13e4126cdb87f00c2e7ffde5c82b38539b2b9feda7c942282f488d7316ba8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a1fc20b20046e2275e688ac3cc5e7d6c5babf2b2936bc34da0cdb7952b751b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"38234143a2076437b976ddde4fe0a1019df41ea9098e37b642a3da8fa3050a0f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb46bff3c88249e4bb67c5808e08b8137414b6e88ca6928a35cf5ab411ab78d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentReader.java"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9c1d6b043cdb2f050e7c6e2e7c6b6ed359131ec82f543d8388f637e1bff7ef"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"f590267fd96c364ee0b5911ab592eb0e77b99516b1b794133af134265c17a489"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of \u0060close()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseContentWriter.java"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd862ba544c168dc575974ca43090cb6be13ec4cb38dbe9e59e3d47e9e852e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/DatabaseTransformWriter.java"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"90315d22d0f6254bc12cc905e98933463c48d0f3c3cc2de0e3137875145e4098"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/MultithreadedMapper.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4779cd822eb6007d56b71b0708948e1d4af50e539c833e5cd8339d5c5bcc87"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/ThreadManager.java"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1f65de54c2c61b484a053b5040660e217edec5e8ebe3c63c87e1432e83761f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f98c949d77c8c4b0d321712040ca909d38931dc0433d677c1012c9356d8543e9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of \u0060close()\u0060 masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems \u2014 or, if it truly cannot matter, say why in a comment on the catch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/main/java/com/marklogic/contentpump/TransformWriter.java"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb15e10914037ca8fbd3514c712e84cffedfaa50cc5d173b6c2eb7c5ad6416d"}},{"ruleId":"X5","level":"note","message":{"text":"Java packages are not null-marked everywhere: 0/12 of this repository\u0027s Java package directories are under a non-null default: a \u0060package-info.java\u0060 declaring \u0060@NullMarked\u0060 (JSpecify) or \u0060@NonNullApi\u0060, \u0060@ParametersAreNonnullByDefault\u0060, \u0060@NonNullByDefault\u0060, \u0060@DefaultQualifier(NonNull.class)\u0060; a \u0060module-info.java\u0060 declaring \u0060@NullMarked\u0060; every type in it \u0060@NullMarked\u0060; or a build that runs NullAway with the package in \u0060AnnotatedPackages\u0060, or the Checker Framework\u0027s \u0060NullnessChecker\u0060. Elsewhere every reference admits null and no checker warns on the dereference that throws a \u0060NullPointerException\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"419201f6fc7ba243aef2cfb154378641588a8190e6269cea04a7b48c3d343bd5"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-295","guid":"a706c4e2-1232-8859-ae2e-17aa2d41f8e2","name":"Improper Certificate Validation","shortDescription":{"text":"Improper Certificate Validation"},"helpUri":"https://cwe.mitre.org/data/definitions/295.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":17,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}