{"$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":"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":"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":"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":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"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":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"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":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"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":"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":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"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":"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":"_HashNode._intersection (cyclomatic 21): _HashNode._intersection 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f0de30f76bd068fc0be54fa4a732034ee89e86a1ec6a2616d6a6446ad72ccf"}},{"ruleId":"D1","level":"warning","message":{"text":"_HashNode._subtracting (cyclomatic 21): _HashNode._subtracting 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa2849f12b02c9162610b0ad4c53495b31a04cc1c3e06555985b9357c5c1888"}},{"ruleId":"D1","level":"warning","message":{"text":"OrderedSet._updateHashAfterContiguousMove (cyclomatic 21): OrderedSet._updateHashAfterContiguousMove 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b173ce57d15906c6bcc0274110da699e19890a5d10e603e55194834b7bab2044"}},{"ruleId":"D1","level":"warning","message":{"text":"_HTable.checkInvariants (cyclomatic 20): _HTable.checkInvariants 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":"Sources/BasicContainers/HashTable/_HTable\u002BDebug.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"2275344dc6293ffb3d74bff32fdf71343e456c39d1bb2ca62712e0b74a0f64e2"}},{"ruleId":"D1","level":"warning","message":{"text":"_UnsafeBitSet.index (cyclomatic 20): _UnsafeBitSet.index 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":"Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet.swift"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e75812e42be08220b2ad2821f46012d7365a2861795a44ced303753ef8bd91"}},{"ruleId":"D1","level":"warning","message":{"text":"_HashNode.isSubset (cyclomatic 19): _HashNode.isSubset 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural isSubset.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc069c91f9995f868049e350cb6b551227223c56aaa717a8c54720d8d2e8cbb6"}},{"ruleId":"D1","level":"warning","message":{"text":"BorrowingIteratorProtocol._elementsEqual (cyclomatic 19): BorrowingIteratorProtocol._elementsEqual 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":"Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol\u002BEquality.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a1bc9d3101a2cf705ee3aa10ffb601d362e0b00d7575f61d07bdd4f8335f2f"}},{"ruleId":"D1","level":"warning","message":{"text":"BitSet.isEqualSet (cyclomatic 18): BitSet.isEqualSet 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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isEqualSet.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a37d2739b3883ac5f5b0cc01de0504d25393e63d1fa1ecbcbe27d848aa4ff6d"}},{"ruleId":"D1","level":"warning","message":{"text":"_HashNode._intersection_slow (cyclomatic 18): _HashNode._intersection_slow 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"86c9714b335eb9783346b658b3efcadb11da2832079aaf7169110153719e5643"}},{"ruleId":"D1","level":"warning","message":{"text":"_HashNode._subtracting_slow (cyclomatic 18): _HashNode._subtracting_slow 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce39648522e76cc235fee7efb00c4006dd1067f99a13309430c0839bfc243d48"}},{"ruleId":"D1","level":"warning","message":{"text":"_HashNode._symmetricDifference (cyclomatic 18): _HashNode._symmetricDifference 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3947104e9641c7cd8f3926820530998a24ed07b6efc3ed85b5c8929c086eb8"}},{"ruleId":"D1","level":"warning","message":{"text":"_HashNode._union (cyclomatic 16): _HashNode._union 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural union.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d001822b2cfea2239d7839cef55807421e71c2dfb04d65b1d967f65c72425be"}},{"ruleId":"D1","level":"warning","message":{"text":"BorrowingIteratorProtocol._spanwiseZip (cyclomatic 16): BorrowingIteratorProtocol._spanwiseZip 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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BSpanwiseZip.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa72de5e36ab080b8f8d3d1ac6846f8332213772e3543f1ed809c45b08ddeede"}},{"ruleId":"D1","level":"warning","message":{"text":"OrderedSet._move (cyclomatic 16): OrderedSet._move 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"1943915a4c0ce838f14f7a83004186f997c019eadfc22da11d7e9427b5ab9c14"}},{"ruleId":"D1","level":"warning","message":{"text":"_Chunk.formCharacterIndex (cyclomatic 16): _Chunk.formCharacterIndex 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":"Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BCharacter.swift"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"84661fa8a135730692171173453bcfe0d12c431685b261f2c61fee5514e9c669"}},{"ruleId":"D1","level":"warning","message":{"text":"_Chunk.resyncBreaks (cyclomatic 16): _Chunk.resyncBreaks 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":"Sources/RopeModule/BigString/Operations/BigString\u002BManaging Breaks.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc099f1bee95e7ba290b3f040f405b7cbb6018ba7e861ee5a18077f55ef83718"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderedSet._updateHashAfterContiguousMove (cognitive 41): OrderedSet._updateHashAfterContiguousMove has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (14 pts), boolean chains 6, ternaries 2 (6 pts) (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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7816e2578604ca4cbc1005f4f22374cd51209b4f48b3067453125cef7f7bfbb"}},{"ruleId":"D2","level":"warning","message":{"text":"_UnsafeHashTable.adjustContents (cognitive 41): _UnsafeHashTable.adjustContents has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 4 (12 pts) (nesting depth added 24). 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":"Sources/OrderedCollections/HashTable/_HashTable\u002BUnsafeHandle.swift"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"31de82e65082ee20913c33622f44b016b22c07b01864f3735ac7e87e185baf21"}},{"ruleId":"D2","level":"warning","message":{"text":"BorrowingIteratorProtocol._spanwiseZip (cognitive 38): BorrowingIteratorProtocol._spanwiseZip has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 4 (7 pts), boolean chains 1 (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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BSpanwiseZip.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"349170bcc719aa673f8592abf14f1e85865a839cef6097bdb014e79cce3e7c54"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderedSet._updateHashAfterMove (cognitive 38): OrderedSet._updateHashAfterMove has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (16 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"145cf9e5a99a6268d18003740e67632808a20ddcc036d599c0571e0970131f86"}},{"ruleId":"D2","level":"warning","message":{"text":"_UnsafeBitSet.index (cognitive 36): _UnsafeBitSet.index has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 5 (15 pts), boolean chains 3, loops 2 (3 pts) (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":"Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet.swift"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0814da3f13e95f4d2bceb5f72b649b58c4c0ae2c3f60d8c54d62786aa325af9"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode._subtracting (cognitive 35): _HashNode._subtracting has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 4, loops 2 (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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6a1dd6fb6cb1ae8cd2ecdeaf00f32d38e0d412499d5aebf87e8bcd96206d8d"}},{"ruleId":"D2","level":"warning","message":{"text":"BorrowingIteratorProtocol._elementsEqual (cognitive 34): BorrowingIteratorProtocol._elementsEqual has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 6 (10 pts), boolean chains 3 (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":"Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol\u002BEquality.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5023fabc6befb555f40352c7726478f829178248b79e3eb6fd919bb92701e8"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode._intersection (cognitive 33): _HashNode._intersection has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 3, loops 2 (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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ae3773818bf99bf5481ba7c3769da1a47d65909143368e811b08bbf856dae7"}},{"ruleId":"D2","level":"warning","message":{"text":"_HTable.checkInvariants (cognitive 31): _HTable.checkInvariants has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (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":"Sources/BasicContainers/HashTable/_HTable\u002BDebug.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"8abcce1c3204868a1cf22be166ad80c85e5abba4f28007ce5635ba5c96a2f56f"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode._symmetricDifference (cognitive 31): _HashNode._symmetricDifference has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 4, boolean chains 2 (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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"334851957b4d632ddc6179b82284e697478b5705b0cc83969a817cd35b3c8480"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode.isSubset (cognitive 30): _HashNode.isSubset has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 2, 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural isSubset.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"09095a940ba06aacdedb6e45cb96bbc149e29d1773e7e7c22cfdca0e6f010e1f"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSet.isStrictSubset (cognitive 30): TreeSet.isStrictSubset has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (4 pts), boolean chains 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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSubset.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"619fcd5cf83294b69943a7a2ab3963e9d9cca8795dabb7e80f9736a6dae037f6"}},{"ruleId":"D2","level":"warning","message":{"text":"BitSet.isEqualSet (cognitive 28): BitSet.isEqualSet has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (24 pts), loops 3 (4 pts) (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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isEqualSet.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0d456aaecacb4129f7340f8673596728b1f1b960021cc437844a544a36239c"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode._intersection_slow (cognitive 28): _HashNode._intersection_slow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 3, loops 1 (2 pts) (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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaf6e81b4a06c5a3cd5abbe888a4b604af5b915df3cec81dd69d38549fd2a88"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode._merge_slow (cognitive 28): _HashNode._merge_slow has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), ternaries 2 (5 pts), loops 1 (2 pts), boolean chains 1 (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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural merge.swift"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c397fd3c203d56f361b2023716720832b5f1c129c3ef2d4c17b49cf883e7b7"}},{"ruleId":"D2","level":"warning","message":{"text":"_UnsafeHashTable.adjustContents (cognitive 28): _UnsafeHashTable.adjustContents has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (12 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":"Sources/OrderedCollections/HashTable/_HashTable\u002BUnsafeHandle.swift"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4afc13abb4bdfad89c3673c266ef71a3d7e59c4f4b65f8f40249bd64b23ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode._subtracting_slow (cognitive 27): _HashNode._subtracting_slow has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 3, 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f72769bc9b84da3500e93e62ae7bf421859937d1b96f1c5a67c2105e5fcf40"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderedSet.isStrictSubset (cognitive 27): OrderedSet.isStrictSubset has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 2 (3 pts), boolean chains 2 (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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isStrictSubset.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"660dbf3bd3485ba77d2e4309f54dd583f462ef890ef979246645df975d6c246d"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode._union (cognitive 26): _HashNode._union has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4, ternaries 1 (4 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural union.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac124defc3456f2ce4df0f8773c9b309aca2afa9398dbb71bf3efcf0b9482e35"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderedSet._move (cognitive 25): OrderedSet._move has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 2, 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1acd3d8e7ee61a197c862327e7afae8e5092cc0cf8e285bf55305dfec76639"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsafeHandle.describeNode (cognitive 24): UnsafeHandle.describeNode has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 1 (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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BCustomDebugStringConvertible.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"02cf055e9f6b06d653b007ff51f6d12a4314efec6f4d6d8371f450d8c88c7152"}},{"ruleId":"D2","level":"warning","message":{"text":"_Chunk.formCharacterIndex (cognitive 24): _Chunk.formCharacterIndex has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 2 (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":"Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BCharacter.swift"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fba6867549d13aef499b49e99cf1f00a011268006e503081394742ead47230b"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode._merge (cognitive 23): _HashNode._merge has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4, 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural merge.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"575d82d5536d670ef22a8f31530249e048fedb8f0666566472fa81f315781055"}},{"ruleId":"D2","level":"warning","message":{"text":"_HTable._bitmapDescription (cognitive 22): _HTable._bitmapDescription has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (10 pts), loops 1 (2 pts) (nesting depth added 13). 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":"Sources/BasicContainers/HashTable/_HTable\u002BDebug.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab27e8baa3483807719c9f211247e4823bcc5727998e57662f571c07f216a801"}},{"ruleId":"D2","level":"warning","message":{"text":"Container._spanwiseZip (cognitive 22): Container._spanwiseZip has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 4 (8 pts), boolean chains 1, loops 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":"Sources/ContainersPreview/Protocols/Container/Container\u002BSpanwiseZip.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"086c2ba864d7bf2977a31f4488903a5184fb1f5e59f46da8280d3ddda6237498"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeDictionary.init (cognitive 22): TreeDictionary.init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (7 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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCodable.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f3bc75d057475c2f476f35de06e9297ce33952c48a798a359cfc93debecaac"}},{"ruleId":"D2","level":"warning","message":{"text":"_Chunk.resyncBreaks (cognitive 22): _Chunk.resyncBreaks has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 1 (2 pts), loops 1, ternaries 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":"Sources/RopeModule/BigString/Operations/BigString\u002BManaging Breaks.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"428cfc21d33122e0b306f29b1260d5fbce8fec44092e21db7cd4f0be77a16913"}},{"ruleId":"D2","level":"warning","message":{"text":"_BTree.checkInvariants (cognitive 22): _BTree.checkInvariants has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts), boolean chains 2 (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":"Sources/SortedCollections/BTree/_BTree\u002BInvariants.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5547f05fbc9d0d9c0833b6ffeade79c4cf8469ce519c310d9d9c93646aefc5ce"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode._union_slow (cognitive 21): _HashNode._union_slow has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural union.swift"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9bd6030946e5315315ea0e172ee3cfa19bb85e74112c6f84df4be9c7f8e27a6"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderedSet.isStrictSuperset (cognitive 21): OrderedSet.isStrictSuperset has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2 (3 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isStrictSuperset.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d484d0eedab4e8a3f3b4c7fb994bf53223aafc3de5a3f28d191f51ca8cf557"}},{"ruleId":"D2","level":"warning","message":{"text":"_BTree.findAnyIndex (cognitive 21): _BTree.findAnyIndex has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (9 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":"Sources/SortedCollections/BTree/_BTree.swift"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e11832f526b3521b5570a6285ddfe2808de7aa4527db3b6272460c1242a35b0"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderedSet.isSubset (cognitive 20): OrderedSet.isSubset has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isSubset.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fa3bc99306cc0bc480a623e7150df6e9dcd658e7db3369ead7a94e604c173a"}},{"ruleId":"D2","level":"warning","message":{"text":"PermutableContainer.heapSort (cognitive 19): PermutableContainer.heapSort has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts) (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":"Sources/ContainersPreview/Protocols/Container/PermutableContainer\u002BHeapSort.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e0e7c44a9fdf41e92f9f8cc7019a58ccffef01e66dc79fa2e371620abf44e6"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSet.isEqualSet (cognitive 19): TreeSet.isEqualSet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isEqualSet.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc09f87117afc4ccdc58b8721c75028bb32246c66fe481035a4f55299a2a1191"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderedSet.difference (cognitive 19): OrderedSet.difference has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BDiffing.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eea907e8a01bf4f3b45e874f0d37dc023a68572ccb00fb2c807bb7ce86a4a89"}},{"ruleId":"D2","level":"warning","message":{"text":"BitSet.isSubset (cognitive 18): BitSet.isSubset has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isSubset.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6b0b10ca7e89bdc0720c6aad04e15ee5b5c672862f465b72e0da324b68fd5c"}},{"ruleId":"D2","level":"warning","message":{"text":"_UnsafeDequeHandle.closeGap (cognitive 18): _UnsafeDequeHandle.closeGap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 3 (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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":1152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d67d2dd0f1100fe4ee3b3950e3fdadf1ae24bbaf30a0f85cab51b2a9a61d85c"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode.isDisjoint (cognitive 18): _HashNode.isDisjoint has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 4, boolean chains 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural isDisjoint.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b1ad1d569b7a9118ccf272448a64c85f3448cae394a22b1f5c07a85c451886"}},{"ruleId":"D2","level":"warning","message":{"text":"_HashNode.isEqualSet (cognitive 18): _HashNode.isEqualSet has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1 (2 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural isEqualSet.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad8b4f7e03e9a8fc4a0ee9022e8cd5e9c35183c93083adbf1d27d9b07e1c2d5"}},{"ruleId":"D2","level":"warning","message":{"text":"_UnsafeBitSet.index (cognitive 18): _UnsafeBitSet.index has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 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":"Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet.swift"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd2dd81be7384607e9a83625be03bd384ce8fce7432d9268e738e98a61fcea4"}},{"ruleId":"D2","level":"warning","message":{"text":"_Node.join (cognitive 18): _Node.join has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (18 pts) (nesting depth added 4). Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 2 function items inside it that branch (prepending, appending). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/BTree/_Node.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0175dfcf501da72822c1f48e0caa93efe775739c20b2253211c193f67ee59b"}},{"ruleId":"D2","level":"warning","message":{"text":"BitSet.isStrictSubset (cognitive 17): BitSet.isStrictSubset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (5 pts), boolean chains 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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isStrictSubset.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66881f8bff003f4aefce1e579af2b8286ad4833fcc24aa455818a9fb7d4ee14"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSet.isStrictSuperset (cognitive 17): TreeSet.isStrictSuperset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSuperset.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df473a7c043961064df142703c1f583283432972a2ce775d0f30c7aac4bdbdf"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeSet.isSubset (cognitive 17): TreeSet.isSubset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isSubset.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"269685e5e69280eaa711d28c3ceed540cab8eebbd24ec6f01da2c9b2a90f2d11"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsafeHandle.insertElement (cognitive 17): UnsafeHandle.insertElement has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (17 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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BInsertion.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4bf299f532fa2f37d8b950261c9db09cfe724da5ae6c67ce6d44a9c2af7f19"}},{"ruleId":"D2","level":"warning","message":{"text":"_UnsafeHandle.closeGap (cognitive 17): _UnsafeHandle.closeGap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2 (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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d28249660bcec4b38d1772b515adc3466d3dc35a78925b98106a05763561552"}},{"ruleId":"D2","level":"warning","message":{"text":"OrderedSet._partition (cognitive 17): OrderedSet._partition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (5 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. This shape REPEATS in the file: one other method here (MutableCollection._partition) 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial MutableCollection.swift"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cf3f6a5b6459fca47b9b2229e8002cf353912556b809c81ecc8a6fb74e4d7c"}},{"ruleId":"D2","level":"warning","message":{"text":"MutableCollection._partition (cognitive 17): MutableCollection._partition has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (5 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. This shape REPEATS in the file: one other method here (OrderedSet._partition) 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial MutableCollection.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d949bd4cbfdfc07074c7508dc9b646ad265c34dcceabc4a5561b77f3009c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"UnsafeHandle.concatenateWith (cognitive 16): UnsafeHandle.concatenateWith has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BInsertion.swift"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6997fda395b3077701baf408c2c216cf4ab7177a2941d2cf4a22a1a4e38d65"}},{"ruleId":"D2","level":"warning","message":{"text":"_BTree.takeCursor (cognitive 16): _BTree.takeCursor has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1, ternaries 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":"Sources/SortedCollections/BTree/_BTree\u002BUnsafeCursor.swift"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"4097e22dd6a3cf1b7f307e5bfadb1829abc48e65984e7e750ea78ef25af3b16e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:194-230 | Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:248-278 \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":"Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4f18313715ea68246118b56fa190f4916372a40432f3f34596a9143bb28010"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:206-215 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:186-195 | Sources/DequeModule/RigidDeque/RigidDeque\u002BDeprecations.swift:78-87 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:95-104 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ca5f10639788e7333424a80c828efd4f163056eb4c0f769be8f6fcfbc7780d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift:94-103 | Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift:85-94 | Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift:104-113 | Sources/InternalCollectionsUtilities/Span\u002BExtras.swift:100-109 \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":"Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e88bbd4b141a16928ee1e0857ed11d4afac684e1fa6e4cdff2801e1b7edbc8b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:547-672 | Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:759-865 | Sources/DequeModule/_UnsafeDequeHandle.swift:1021-1144 | Sources/DequeModule/_UnsafeDequeHandle.swift:1152-1257 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"98690e0505de1e7dd00b996373578936082bc33a4a649af9acf18fa151c0a488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (88 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:109-196 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift:112-200 \u2014 These two members are one piece of code written twice and then edited apart: 88 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9259995c3fb421cb622d0b8da0b93e380e9089aab5f85069d4dd89b8c888c13"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (80 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:28-107 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift:28-110 \u2014 These two members are one piece of code written twice and then edited apart: 80 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54f846979294b37d4c48216375fb4472a42be6789df76b33aa2d99cba1520a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BResizing.swift:32-87 | Sources/BasicContainers/RigidSet/RigidSet\u002BResizing.swift:32-81 \u2014 These two members are one piece of code written twice and then edited apart: 50 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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BResizing.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"136336c6dc48278b7cd2efaa89fec7a62e238f1d9dcd110dca6615c1bb6557b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:28-76 | Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:139-185 \u2014 These two members are one piece of code written twice and then edited apart: 47 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdef94f923e11ffdb85a9b8639c032b4c1075f676c32efcb09892d1671b5267b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:373-419 | Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:423-467 \u2014 These two members are one piece of code written twice and then edited apart: 45 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"e759650e6bcff867087c3877902dc0f12960e3b0b2a70f139dd764ea28d2cd72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): Sources/HeapModule/Heap\u002BUnsafeHandle.swift:145-205 | Sources/HeapModule/Heap\u002BUnsafeHandle.swift:262-316 \u2014 These two members are one piece of code written twice and then edited apart: 55 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":"Sources/HeapModule/Heap\u002BUnsafeHandle.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa57358e92d0c49b07d2a2575d6d1a6286d4b325fb22ddecc864ea9c7f80046b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): Sources/SortedCollections/BTree/_BTree.swift:462-520 | Sources/SortedCollections/BTree/_BTree.swift:523-583 \u2014 These two members are one piece of code written twice and then edited apart: 59 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":"Sources/SortedCollections/BTree/_BTree.swift"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"40283f3548e177e82b44ecf27f5216aeb3471457f22afd506c21b0906e58617c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): Sources/RopeModule/Rope/Conformances/Rope\u002BCollection.swift:410-453 | Sources/RopeModule/Rope/Conformances/Rope\u002BCollection.swift:455-499 \u2014 These two members are one piece of code written twice and then edited apart: 44 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":"Sources/RopeModule/Rope/Conformances/Rope\u002BCollection.swift"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6bb9046c18ce3332736464dccd41e99b4cf98db6a12c50ffdbcf0bddd54257"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift:61-98 | Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift:100-132 \u2014 These two members are one piece of code written twice and then edited apart: 33 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":"Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"013b8ca51cbc924c4e4266f5af7444328f2dc0ba3f7f60bc17e5dd4fe3f9ece9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift:251-315 | Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift:323-371 \u2014 These two members are one piece of code written twice and then edited apart: 49 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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ae46923f4dfa5d43c04b6ce80aa5c7edbdd201075baccee96cdfa1e89bfd22"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): Sources/HeapModule/Heap\u002BUnsafeHandle.swift:217-248 | Sources/HeapModule/Heap\u002BUnsafeHandle.swift:328-359 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"Sources/HeapModule/Heap\u002BUnsafeHandle.swift"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03a3724d1b932615b55b9553afb3264249593d21ae20877b8a730543b1a689e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:230-259 | Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:261-292 \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2029211d72cc9d81eab5123297c087195a4a1aa16d8b65c1791322e63264e05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BStorage.swift:156-196 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStorage.swift:198-228 \u2014 These two members are one piece of code written twice and then edited apart: 31 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStorage.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c473b26ac64acf38a62bab3a3b74574924b1774055339493d6b004a7596e7437"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isStrictSubset.swift:119-163 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isStrictSuperset.swift:120-160 \u2014 These two members are one piece of code written twice and then edited apart: 41 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isStrictSubset.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b53a21927c9f9f2fe144269a5568357e2ae5c4c9c7d0c2392451f3552c3a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:162-214 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:221-258 \u2014 These two members are one piece of code written twice and then edited apart: 38 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec38724e97ca6ccbe2ab857212e55cef5b54b7d621ad06c37f2874afd4f2bb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BSplitting.swift:63-94 | Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BSplitting.swift:107-142 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BSplitting.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad9cce84779bb129ce2daec14af8fb889286f522dc6e0c1662158b509300827"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:200-223 | Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:225-253 \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":"Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d15d7248946b5cf0f7ba4d1582296f1f7cb5cc25875fee0bd11c651fd4ae551"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift:141-170 | Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift:172-197 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd15d8f8acedbead87e2214070ce2dd4d930eb51e0c377572b1f963a1e88a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:653-685 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:718-743 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f2263ef9db49d0183f77f41a0ea7a56113c71f532d56e61b094ae92c037335"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift:82-116 | Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift:122-151 \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":"Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b31e734953c14ae2bc4b263bec27d2ffe2768ca3ed629431da1a314de58c99c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BRopeElement.swift:57-79 | Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BRopeElement.swift:81-105 \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":"Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BRopeElement.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"be78587fc9383c586968637467a5608fe0460084fd42876a9ca0f2e5a470869d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSuperset.swift:94-126 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isSubset.swift:86-114 \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSuperset.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"272d9dc2dc74935e1051bf9e757cf428c05f3bcabd1498ac17e3b2a40b6891ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift:123-151 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BInsertions.swift:75-111 \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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc1a3409125760dab5aecaa947b1cda5dfd61297e96fb4c37c02c2ec06c177de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift:267-299 | Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift:301-332 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e83fc79d7698fbfdb8a9aec80c91603383ad46bc45a8943c9c3bb8813990ee5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:77-100 | Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:173-205 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa878ba2408feb8daee58ba5f70966151222b3eaa25b3cc0d428e4ec63846e20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:235-268 | Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:312-347 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"9640a9cdd5e3c2ddadf0c55a5e88a663ed214aa28d5e43521d1f8f904d574b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift:134-152 | Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift:154-172 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d52fc0a6dfb799db7fab5a5685904eab0b608649aac453c7e6a07138419145"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BCharacter.swift:167-200 | Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BUTF16.swift:78-107 \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":"Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BCharacter.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f5d2a06543c88335aab469f06651b05a4546f7e64da8d2a02ca8a419ffa2951"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift:199-232 | Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift:234-265 \u2014 These two members are one piece of code written twice and then edited apart: 32 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":"Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c964ce8e35fe777023b357ea7caf26bcf4f8c633b4b75b5868cca5f0639d4520"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): Sources/RopeModule/Rope/Operations/Rope\u002BSplit.swift:81-114 | Sources/RopeModule/Rope/Operations/Rope\u002BSplit.swift:116-149 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"Sources/RopeModule/Rope/Operations/Rope\u002BSplit.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"befab19ec9e6ca029a34d1af0380fee0479db1191064c5c7c9f0c7833d4adf3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 29\u002B corresponding lines): Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift:37-70 | Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift:74-102 | Sources/SpanPreview/MutableSpan\u002BInputSpanHelpers.swift:22-56 | Sources/SpanPreview/MutableSpan\u002BInputSpanHelpers.swift:59-88 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba530dd6e6740e8a5de438f1ad1682e11277fa73a4926eefddce3acf72561489"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:319-342 | Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:347-372 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"82797167340f592a6de5dc44ab92ad0bec84c5484ea57da11806258a5074a8da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Sources/DequeModule/_UnsafeDequeHandle.swift:564-581 | Sources/DequeModule/_UnsafeDequeHandle.swift:583-600 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4a132e5ab760de22428be7c56478244de990a7d1ee01f839cf2aae38f46135"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 19\u002B corresponding lines): Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:55-75 | Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:77-100 | Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:102-123 | Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:125-143 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 19 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6925fc3bcbd880d3a292f0d92507c6c90039d54a5b95c7f025764b1974bbc31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): Sources/DequeModule/_UnsafeDequeHandle.swift:830-850 | Sources/DequeModule/_UnsafeDequeHandle.swift:1316-1336 \u2014 These two members are one piece of code written twice and then edited apart: 21 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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed40caa6500e7a1d5d02fe85f78d081fae2c19062bf0d9e1d28a40ed3e1bcbdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): Sources/ContainersPreview/Protocols/Container/MutableContainer\u002BUpdateSubrange.swift:150-172 | Sources/ContainersPreview/Protocols/Container/MutableContainer\u002BUpdateSubrange.swift:210-232 \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":"Sources/ContainersPreview/Protocols/Container/MutableContainer\u002BUpdateSubrange.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4865952577cfdaca9706343d61da26bafb647a3f44a617232f1735d892611bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:423-452 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:466-492 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a6642fc7ec863dd0bfff26624356cdaee4228c88c3ebb5796a035ef5e894d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/RopeModule/BigString/Views/BigString\u002BUnicodeScalarView.swift:200-224 | Sources/RopeModule/BigString/Views/BigString\u002BUnicodeScalarView.swift:254-266 \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":"Sources/RopeModule/BigString/Views/BigString\u002BUnicodeScalarView.swift"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab8acd41e1d6209b6741e4835b29d9be1d80bd92612c8640b42e0f690795ab6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): Sources/ContainersPreview/Protocols/Producer/Producer\u002BReduce.swift:27-51 | Sources/ContainersPreview/Protocols/Producer/Producer\u002BReduce.swift:53-77 \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":"Sources/ContainersPreview/Protocols/Producer/Producer\u002BReduce.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4af698afad6d5324ec6bfd214fe62604f78a10deb7f20694777b43e7865947"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift:180-197 | Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift:199-220 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"11557183d883743132dc9310e5f353cce5c228973450f96a904a7c31264e4bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/RopeModule/BigString/Views/BigString\u002BUnicodeScalarView.swift:305-317 | Sources/RopeModule/BigString/Views/BigString\u002BUnicodeScalarView.swift:339-354 \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":"Sources/RopeModule/BigString/Views/BigString\u002BUnicodeScalarView.swift"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf7614ca5d399e52f6c14ab7b3b3372da70c8e99d56535ed4ed1f4a0f8a1b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Sources/DequeModule/Deque/Deque\u002BCollection.swift:730-748 | Sources/DequeModule/Deque/Deque\u002BExtras.swift:139-158 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"Sources/DequeModule/Deque/Deque\u002BCollection.swift"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7720e1ca56bc2277c8cbc1414b21facf33c09172940802bbd60315222798baf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:331-348 | Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:350-369 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"095eaba5da74298e8f65eb109325137f519c9382b11578fac4a1b38bcac86701"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:93-125 | Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:147-174 \u2014 These two members are one piece of code written twice and then edited apart: 28 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":"Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"44102558da800a6663e2d51fe70dc94bb5b151c2eae5975a13d2fe869338f400"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): Sources/RopeModule/BigString/Views/BigSubstring\u002BUnicodeScalarView.swift:214-239 | Sources/RopeModule/BigString/Views/BigSubstring.swift:241-266 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"Sources/RopeModule/BigString/Views/BigSubstring\u002BUnicodeScalarView.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0d3fc13a5585af50753b783db4e86c02a3814fcf1ff4edef0a62e3e1d09a8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:455-481 | Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:483-508 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"2917c09d1b379098506bd92435d965d59755bc4465df26c6d107229f7ec700cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BRemovals.swift:37-53 | Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BRemovals.swift:73-87 \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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BRemovals.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e188c1f2137f69acd96536ed957cb4ba70d6b866444d21ea4665bd2d943dbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:272-289 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:264-279 \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff90d6a98432ee0c9d6f170cdd2db6bfb07d011e04e86e1cc9d0ae26ffd70016"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:540-563 | Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:565-588 \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece5f1fe58a395aebeda12e65f9555d6ad8d40bd1c9052f56ac8cb51b306fad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/RopeModule/Rope/Basics/Rope\u002B_UnsafeHandle.swift:186-202 | Sources/RopeModule/Rope/Basics/Rope\u002B_UnsafeHandle.swift:204-220 \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":"Sources/RopeModule/Rope/Basics/Rope\u002B_UnsafeHandle.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24593aa149642879e7ae1ca1187b40efc567226aad1fd781ef45a5bb84459cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:238-255 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift:250-268 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"10cb339ea96d5da80d90888bcebf70726251bcab9d22751bbe3b682daab26807"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BStorage.swift:231-255 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStorage.swift:257-284 \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStorage.swift"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c693a121e60f4b189cdcfac7db7fa2d7aa91ad25ce524c1e25aad03f11c4ceb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/DequeModule/_UnsafeDequeHandle.swift:866-883 | Sources/DequeModule/_UnsafeDequeHandle.swift:896-911 \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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5ef2027c0276bc551264788aee503f376252f18998c4494c5f5fb6bd2282f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BRandomAccessCollection.swift:32-46 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BSubSequence.swift:90-107 \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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BRandomAccessCollection.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f347d0e28d50bbb9519f3e9562deb24849eb8a559a361cb28c1c2857dc6c860d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:213-228 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:259-276 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:412-428 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:524-539 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9479b9151545208a15df5e5f7b866b79450f5bdeb79bd768f2c3a5c7a7975ca9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:278-293 | Sources/DequeModule/_UnsafeDequeHandle.swift:981-996 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"c531cc7729c390d4aa708c84a74d63ecc5503225e23d500f1da43fa1fdd1b839"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BCodable.swift:46-79 | Sources/SortedCollections/SortedSet/SortedSet\u002BCodable.swift:37-56 \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BCodable.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4425253e69168fdf80faa89fe449dcea835c8ace57aa0470d282569bf7536a9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift:104-121 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BInsertions.swift:52-73 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a27b48f23dd354e7cab7ca6f71533331f9aab1c9392e70acf9dc7a6b332087b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:121-137 | Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:139-155 | Sources/InternalCollectionsUtilities/Span\u002BExtras.swift:83-98 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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":"Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6169a429bef3a0c1d5cdfd68cab189a9a881eeedc618a4212ab52ccf216fa6f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BRopeElement.swift:119-134 | Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BRopeElement.swift:136-153 \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":"Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BRopeElement.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c401b1ddf1629ba31f2e5a5e4cbbbe28b16ed3ad4212e1eda827de16089b2c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:343-364 | Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:366-387 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf8b1fa664abed649601d7ffce4c4a6495011949635ce37353ce6fd9d4278b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift:134-153 | Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift:155-176 \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b28cdd951c05cbfaaddc259d01895ffc5d5ed1f528a2d1bfd7302e21eaaa9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift:42-61 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:48-67 \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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a355f2573ced5d54fcd3a3d2f970b12c213d9b431a13c19362c6b443e2f4b8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isDisjoint.swift:92-107 | Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isSuperset.swift:96-112 \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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isDisjoint.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"44052d8ad30d871c7451063d36478dfbf65ad9cea913866b70942f117483aba3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): Sources/RopeModule/BigString/Conformances/BigString\u002BRangeReplaceableCollection.swift:28-43 | Sources/RopeModule/BigString/Conformances/BigString\u002BRangeReplaceableCollection.swift:137-153 | Sources/RopeModule/BigString/Conformances/BigString\u002BRangeReplaceableCollection.swift:175-190 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 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":"Sources/RopeModule/BigString/Conformances/BigString\u002BRangeReplaceableCollection.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"2198ced34b3fde0194a49ac4eaea9b82105d7b45f9abb774670755c308ab3598"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary.swift:345-363 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra basics.swift:120-135 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary.swift"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0497d581e57a63a8af8b09972b87509486ff3afd554e6fafa1b7eb695acc7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift:55-77 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:698-716 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"831ff9493c9ccc5da186babf210d9d1f46a073c6abdabded20e2f886a641836b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:95-109 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift:99-113 \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4f24d3a048f16ce4747299f168a7df860d7fc094073bfdd2a5749a955518bb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Sources/InternalCollectionsUtilities/TemporaryAllocation.swift:15-35 | Sources/InternalCollectionsUtilities/TemporaryAllocation.swift:38-56 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"Sources/InternalCollectionsUtilities/TemporaryAllocation.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"348a37a8a90f4528e4305566f617d0c659fe696592f374169257a4e92d55acc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Sources/BasicContainers/HashTable/_HTable\u002BSizing.swift:123-142 | Sources/OrderedCollections/HashTable/_HashTable\u002BConstants.swift:74-93 \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":"Sources/BasicContainers/HashTable/_HTable\u002BSizing.swift"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"702040720f89a774b064e0af6b5c3abe504e6778f0684878a16c4c61e4adc680"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift:14-27 | Sources/SpanPreview/InputSpan.swift:634-646 \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":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"788e00a72aec4ef6a49e890b850a8a6c7f3fb825a052b7744f238b8f46788db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift:23-42 | Sources/RopeModule/BigString/Views/BigSubstring.swift:70-91 \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":"Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc2f5d2a34257eb3cbe36283287bd322436ac745777307bc5e45181e650e4882"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/BitCollections/BitArray/BitArray\u002BRangeReplaceableCollection.swift:153-169 | Sources/BitCollections/BitArray/BitArray\u002BRangeReplaceableCollection.swift:386-407 \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":"Sources/BitCollections/BitArray/BitArray\u002BRangeReplaceableCollection.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb61bb3118922dcad50d33d7e73f992ef7dbdf3720e8843ef6cff064220a07e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:519-535 | Sources/DequeModule/_UnsafeDequeHandle.swift:472-487 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"312c8280f65e910474421bacef5f6434c2b1bc5f8c662967ee651751fdfa295c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BCharacter.swift:61-74 | Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BCharacter.swift:76-89 \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":"Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BCharacter.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"649844c9a3dfde456ffbed5f228f3ef05a12ef2487a520824a5e1d67a34fc221"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): Sources/RopeModule/Rope/Conformances/Rope\u002BCollection.swift:361-382 | Sources/RopeModule/Rope/Conformances/Rope\u002BCollection.swift:384-406 \u2014 These two members are one piece of code written twice and then edited apart: 22 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":"Sources/RopeModule/Rope/Conformances/Rope\u002BCollection.swift"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2d2920851355f1dbecffb0189b67e47709587ac47712d3c407269694fd0f0c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary.swift:686-700 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary.swift:734-748 \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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary.swift"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b87be1895c9547c272446587fd1594d639a8f5c03d80a70196022d9f530a992"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/BasicContainers/RigidSet/RigidSet\u002BRemovals.swift:30-43 | Sources/BasicContainers/RigidSet/RigidSet\u002BRemovals.swift:45-62 \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":"Sources/BasicContainers/RigidSet/RigidSet\u002BRemovals.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cad15e19d9ed788ffe3678c567e776ad777f6431e81a09cae1a61b2a29380b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BReduce.swift:22-38 | Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BReduce.swift:40-56 \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BReduce.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ad60fc8ba71e4a7662a2b04efe1dede6ef2009d33893e555cc45f5447cf95e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BLookups.swift:178-193 | Sources/HashTreeCollections/HashNode/_HashNode\u002BLookups.swift:197-210 | Sources/HashTreeCollections/HashNode/_HashNode\u002BLookups.swift:214-231 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BLookups.swift"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5793fe50a9ab26249a2d1525524ada5c0436e8866958b1eca6623af9d5ed44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:156-174 | Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:177-195 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8560f44f4bf36dc0ff1413166c6cbe3867cbecb4b629d95e249820764eb98a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/DequeModule/_UnsafeDequeHandle.swift:424-436 | Sources/DequeModule/_UnsafeDequeHandle.swift:438-456 \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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"553a60c319226ff016e598e7a243714c05e68bfeddc596d86f885053a9f59f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/BitCollections/BitArray/BitArray\u002BRandomBits.swift:33-43 | Sources/BitCollections/BitSet/BitSet\u002BRandom.swift:24-34 \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":"Sources/BitCollections/BitArray/BitArray\u002BRandomBits.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a558b07d1ea1b3d98dfc2dd7e210be266aaaa52354e081bb33f70d0d762cccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:368-382 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:363-377 \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2914fb38e7b1eaf6ad3c78a9d69e9f1147bd4cfd20ae43e1072f8618a672a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Sources/DequeModule/_UnsafeDequeHandle.swift:341-359 | Sources/DequeModule/_UnsafeDequeHandle.swift:378-396 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36932453ff31f176a978b2e71f25f43af8fac811ac54f81da26ae99394f2e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:158-167 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:169-179 \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":"Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5aa75d231816cabc5370110f61ba1de5f9af9cf68ab19ad21ed3469af020ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/RopeModule/Utilities/_CharacterRecognizer.swift:135-149 | Sources/RopeModule/Utilities/_CharacterRecognizer.swift:167-186 \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":"Sources/RopeModule/Utilities/_CharacterRecognizer.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ee816cef8792450cb880d353e85a803764c81b1304dd5e2b9bae7b6ed1adaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Sources/ContainersPreview/Protocols/Drain/Drain\u002BMap.swift:75-92 | Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BMap.swift:99-118 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"Sources/ContainersPreview/Protocols/Drain/Drain\u002BMap.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"66f0392cde8d580b75d843616fe9f7390e40a5221cf9f894779ffabd299bff9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/RopeModule/Rope/Conformances/Rope\u002BCollection.swift:94-110 | Sources/RopeModule/Rope/Conformances/Rope\u002BCollection.swift:112-127 \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":"Sources/RopeModule/Rope/Conformances/Rope\u002BCollection.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a015d06b89513f1f5a30dd2132546a4421a7976227464cc2bc4007dcc5bfff9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 15\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:61-75 | Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:153-171 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:62-77 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:131-147 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:61-77 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:136-154 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:75-89 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:143-159 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 15 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"56569e0717ab68504629a940aa8c27c5dd97da5760df50a818828ea1db493297"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:233-247 | Sources/DequeModule/_UnsafeDequeHandle.swift:491-506 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"719eda8d00b7e1ba5a8b3512d62ca87699ab3e6884846919bdacf513284e25f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:573-589 | Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:598-614 \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":"Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d196495156cfabacab32f4c5cab4fcc45a933a05e6548a43eede667f6aa95e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:101-115 | Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:105-116 \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb9825df7c55fddd892558fb1084813f418edc25b23fb4e5c7513c9a6d4d1d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:150-159 | Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:161-171 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:158-167 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:169-179 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fecba73e2f0c7159047adf22e1134ceebce6c025b8d0ba93319f041d77d86f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:66-79 | Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:94-106 \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":"Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea6ebf4a65ee2ec436e60d0afc20e5b2968aee1c317a295e4bfb8edba94a893"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:119-135 | Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:138-153 \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":"Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6927447157612e92d43634b1c6cf3ccb8b810f2efb1b5d57dea322f4e6b3acdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/ContainersPreview/Protocols/Drain/Drain\u002BReduce.swift:26-42 | Sources/ContainersPreview/Protocols/Drain/Drain\u002BReduce.swift:44-60 \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":"Sources/ContainersPreview/Protocols/Drain/Drain\u002BReduce.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"651180ac5218a50dd9a3fa604378c8efb4c3edc20268be25d6a6593cbab5b08f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/RopeModule/BigString/Operations/BigString\u002BInsert.swift:59-77 | Sources/RopeModule/BigString/Operations/BigString\u002BInsert.swift:82-97 \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":"Sources/RopeModule/BigString/Operations/BigString\u002BInsert.swift"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26ff9a2e6dc030cdc601a0db72577657b6b6a777217ad6cc763744cd578872f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/SpanPreview/InputSpan.swift:507-517 | Sources/SpanPreview/InputSpan.swift:519-530 \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":"Sources/SpanPreview/InputSpan.swift"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa245843fa6a90e6493459cf9149e55fd2e49f6311d000a229485b13546d4b6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isStrictSubset.swift:39-57 | Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isSubset.swift:37-53 \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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isStrictSubset.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf9050998f92b3c0b59c884d978517af450eb962709a17e126c05f4faddde11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BBuilder.swift:314-327 | Sources/HashTreeCollections/HashNode/_HashNode\u002BBuilder.swift:329-345 \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BBuilder.swift"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8692ac04a7538866afd65cc2439c680e1651c85abeb40aad22597554a81ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BCharacter.swift:151-165 | Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BUTF16.swift:60-76 | Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BUnicodeScalar.swift:66-80 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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":"Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BCharacter.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff0ba60b990d006d5d78bf2e27a13b99b761329d85d4c2362e4897f26f8b2a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Sources/ContainersPreview/Conformances/UniqueSet\u002BContainer.swift:74-91 | Sources/ContainersPreview/Protocols/Container/DynamicContainer.swift:84-112 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"Sources/ContainersPreview/Conformances/UniqueSet\u002BContainer.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f9b977c0cd067580bea0e012d11a451f2f6785d01dc2945d1725d834bf7944"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:171-192 | Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:194-211 \u2014 These two members are one piece of code written twice and then edited apart: 18 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":"Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b59c1fdb9d869fe7ea284b7b9dc6e1fbf28a8ed5e7c9e7903dc0c7b821c1936"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift:102-115 | Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift:211-224 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95da10353c84ab2d548149102a62c45ddbf8367b10fb3cf62d1fbe1d7ae3d9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:296-310 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:287-302 \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b249c76c3d4a0b0afe02e7e7ee712b910e4ec1c37dab49158ea13a56db09e82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift:52-67 | Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift:105-120 \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49fb805f0a29c7aa16ff70230933047248e98405c42c4cf3546e29644f353ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary.swift:365-380 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary.swift:471-485 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f21a94d364663a8308ee6df09b442d6a9617db4980cbfccc0925ec0d3652152"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Sources/BasicContainers/HashTable/_HTable\u002BBitmap.swift:84-102 | Sources/BasicContainers/HashTable/_HTable\u002BBitmap.swift:128-148 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"Sources/BasicContainers/HashTable/_HTable\u002BBitmap.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd84152a08da79039d849ad5b4f437067710a61f3bf198a19a1794e3aa1eac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BInsertions.swift:18-33 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BInsertions.swift:35-50 \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":"Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BInsertions.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8655908dfc4fb43eb31c47f2a48e3fa467cb98a641afe437d4015f2500069a98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift:58-69 | Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift:83-95 \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6464e9b08ad3038230542b3cd388a3bfa25b49a3890b0973229571ecf91e7c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:367-379 | Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:381-393 \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":"Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f7f8d5ca989d27efa4206b10c183e7daa0552bf5ce5b41fdee3d9a4c265609"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/DequeModule/_UnsafeDequeHandle.swift:514-525 | Sources/DequeModule/_UnsafeDequeHandle.swift:529-540 \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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12fdb9818b349db299e2a90fd2b8293cc6b43f4c5b5b7cb0b4c8006725bd93a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:721-739 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:751-772 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:786-807 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a81dacf90e8e16dfeb8f5e063347f492b03e498fa7d9e578f4987ce03530d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/SpanPreview/InputSpan.swift:449-461 | Sources/SpanPreview/InputSpan.swift:481-493 \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":"Sources/SpanPreview/InputSpan.swift"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78420fd797bbcc14ac89ea1dfbea6ed9f5d8349167cb2d1a330764b5bf8e609"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/BitCollections/BitArray/BitArray\u002BShifts.swift:145-153 | Sources/BitCollections/BitArray/BitArray\u002BShifts.swift:155-163 \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":"Sources/BitCollections/BitArray/BitArray\u002BShifts.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"7555ef993ed4a2f6297e956d0e7ed2651b70085d25f0041faba712c6641ee26b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:203-216 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:233-245 \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":"Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dfb77029081f4f880065f5324c2083cff6e90b76b868ac62eedb1e15afeba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:504-517 | Sources/DequeModule/_UnsafeDequeHandle.swift:1351-1362 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"0320e0cf7bdd67f5083c60f7282778c3c1eac4bdb942bf6f152db5b0823377a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift:50-67 | Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift:85-98 \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":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c43126a077ccb1e24d22b14988f914312fa451726cd7edb5cd2859536433c10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BSplitting.swift:52-61 | Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BSplitting.swift:96-105 \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":"Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BSplitting.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bcdca44bda94a2b7a48651d8818e1c8210f79ce2a789d7991b475398e8c2f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:251-262 | Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:264-276 | Sources/DequeModule/_UnsafeDequeHandle.swift:310-320 | Sources/DequeModule/_UnsafeDequeHandle.swift:324-335 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fedddb8d2a9f71364fb53d82b9b736776163a022469092bf5f9d73ce5a06ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isDisjoint.swift:42-55 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isDisjoint.swift:93-106 \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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isDisjoint.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef3b2482b0f020529abb5993dd499a9fc7da36a85e3ce475cd6aee0198aa70d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:505-525 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:538-558 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:566-577 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"72a05c844d16b5bddb924718abb5f435658594f0e03f60a10d416777adbb8ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:405-417 | Sources/DequeModule/_UnsafeDequeHandle.swift:623-633 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfbaf6f143351a48e939a30eec5ac73c92ae9142241721902a59359b7a1a09cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:625-637 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:641-661 \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbf3c23f0f8b0fdba269c51722776f3c6f984e03af33329336a8fff0e72c64a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:177-191 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:187-201 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:489-502 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 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":"Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"255480d7cb8bfd64ea0ead8944ab2b815ab1eeafa30f306bd5c2757a3432bd44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/RopeModule/BigString/Operations/BigString\u002BInitializers.swift:61-72 | Sources/RopeModule/BigString/Operations/BigString\u002BInitializers.swift:74-85 \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":"Sources/RopeModule/BigString/Operations/BigString\u002BInitializers.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b916c6f0770b777a223d57b345c371e3e8aea437c6af2a5e4caa5493800a10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): Sources/TrailingElementsModule/TrailingArray.swift:310-322 | Sources/TrailingElementsModule/TrailingArray.swift:329-342 | Sources/TrailingElementsModule/TrailingArray.swift:397-409 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"Sources/TrailingElementsModule/TrailingArray.swift"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"1056b841040a90b8b17314584d9103e3877521410d8fa0d1d4c4f8525d3e1161"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift:196-210 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:235-253 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BInsertions.swift:90-105 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 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":"Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"72e0de2149a400d4435877b147aaf12df6fb5199455691e2db261c81d92e15b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:151-166 | Sources/ContainersPreview/Conformances/UniqueDeque\u002BContainer.swift:85-103 | Sources/ContainersPreview/Extensions/RigidSet\u002BExtras.swift:98-113 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:343-358 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 16 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2716696774825dd31e7cacd4a0acf441fa07e147e20dabfe0c3cc691e9fa6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:85-96 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:90-100 \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":"Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ea54866e81e951f7db6ed5d326f077553d158d42eb357331dce898e6af38d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/DequeModule/_UnsafeDequeSegments.swift:256-269 | Sources/DequeModule/_UnsafeDequeSegments.swift:279-292 \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":"Sources/DequeModule/_UnsafeDequeSegments.swift"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"86928d7bbce43b120acf6c5815e60ded7a5a4d7c46c9198bfb2fc3f070520c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/InternalCollectionsUtilities/Span\u002BExtras.swift:115-124 | Sources/InternalCollectionsUtilities/Span\u002BExtras.swift:126-135 \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":"Sources/InternalCollectionsUtilities/Span\u002BExtras.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"425d2989d91d47825326b3fb95bd2150947cca817d471f757bfea833f0b4566a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:51-64 | Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:81-92 \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":"Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cbf16164f4902ca11e6cf38682dcc92bd85bb3abfcf2ba27f73020e28dab93a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BInitializers.swift:69-85 | Sources/SortedCollections/SortedSet/SortedSet\u002BInitializers.swift:41-56 \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BInitializers.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8badbed7a8ebd1a506577196e518471cbe3b57c0145441ecc30e95a6a602ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/ContainersPreview/Protocols/Container/MutableContainer.swift:153-164 | Sources/ContainersPreview/Protocols/Container/MutableContainer.swift:166-183 \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":"Sources/ContainersPreview/Protocols/Container/MutableContainer.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9491c8c4368c12b9fef3a6546582299b97c93caa443a97e1b240878e3fa49cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:336-349 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:329-342 \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e353167f21bc5f5a4db8236704a1732fbbe982befa116e75dce014b5db1c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift:106-122 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift:147-163 \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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04dcac99335bdaed2c1d13f5b7313ddaf5b3057e9e67c5313ba8156bc1e2942"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/InternalCollectionsUtilities/Strideable\u002BLimitHelpers.swift:15-26 | Sources/InternalCollectionsUtilities/Strideable\u002BLimitHelpers.swift:28-39 \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":"Sources/InternalCollectionsUtilities/Strideable\u002BLimitHelpers.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd3752632909635c1e5fcdc8ecac68b7039dde2dca886a2eb593f02b249ef03"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/RopeModule/BigString/Operations/BigString\u002BInitializers.swift:25-37 | Sources/RopeModule/BigString/Operations/BigString\u002BInitializers.swift:39-51 \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":"Sources/RopeModule/BigString/Operations/BigString\u002BInitializers.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"21193ce89e636f13c43da0cbefe21ae7b476f1fec82d591a87ca612edf2a2df3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift:272-284 | Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift:334-347 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c87194d4d351bc5f26ca4b28ab7e59c22125965517b66f68b109e5d16fcf1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/ContainersPreview/Conformances/UniqueSet\u002BContainer.swift:56-72 | Sources/ContainersPreview/Extensions/RigidSet\u002BExtras.swift:41-54 \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":"Sources/ContainersPreview/Conformances/UniqueSet\u002BContainer.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"856f7063a2df30df2b4c57b0c5f197d6bc4c38c66b53d27a87f7433c07ec13a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:256-270 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:245-262 \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f370638997f24a4b0469ca499003a805c4d5f2cacef098ba5ce7649fb3f6f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift:24-36 | Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift:38-50 \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BInitializers.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5da21a4e19f2bef3fb1af2621aa7982bfa49fec72c28a630716c116056501c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift:154-172 | Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift:180-200 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8242c281748fbb09af8de75d0d8f3af87e9a5d971bc0edc57e71efc4a91522a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray.swift:212-222 | Sources/DequeModule/_UnsafeDequeHandle.swift:703-715 \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":"Sources/BasicContainers/RigidArray/RigidArray.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7b752a9f74d94557a4ce6b8d5c20d985b441f2ffec6f8c912ca2e1346d6e55f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): Sources/BitCollections/BitArray/BitArray\u002BBitwiseOperations.swift:52-62 | Sources/BitCollections/BitArray/BitArray\u002BBitwiseOperations.swift:84-94 | Sources/BitCollections/BitArray/BitArray\u002BBitwiseOperations.swift:116-126 \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":"Sources/BitCollections/BitArray/BitArray\u002BBitwiseOperations.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df452a75fd6c597d2c887ad7ee03bf15876c1a93d6c319b37f8de5d35eba176"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:442-452 | Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:474-487 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1c8c51b4f08a8c6da6c0f87c1326c088310944c3af11f0d3d160e18eabfd097"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift:299-314 | Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BInitializers.swift:135-147 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"792ea34eb03470d30b4c224c74cb05e9fabdabd3cc6fe8773b456b3d858f2c0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/RopeModule/BigString/Operations/BigString\u002BReplaceSubrange.swift:16-29 | Sources/RopeModule/BigString/Operations/BigString\u002BReplaceSubrange.swift:31-43 \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":"Sources/RopeModule/BigString/Operations/BigString\u002BReplaceSubrange.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c302b9009732b6f4c4c8758206b9983dde061945581cecf14d21140d5b15a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift:341-351 | Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:292-302 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ef756b895c2b9de96affb9a101e44a0d15f8f57c9774b9a7ded16ca328f0ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BInsertions.swift:24-40 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BInsertions.swift:50-65 \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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BInsertions.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d6692753bef0a802828bb0a6425ef393d75298366a84c6ddf885c6727a8ac8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:15-26 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift:15-26 \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8b681e998832c296f15a464f0b7c13f2a1db298dd92f7b917bf8cc7644bf90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BInsertions.swift:167-177 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BInsertions.swift:317-331 \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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BInsertions.swift"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6951503ba12371b1927644aeec7aaf764634fb127978ff2122c56b871d0b4cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:367-384 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:391-407 \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"865ff425a1b5ebbdb7a6be754bd5cabc272d0f0c76e51dfa45ef320eaef6059d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:96-106 | Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:108-119 \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":"Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf866e564b7d9f1046b9129df461a653b33433d4fa7bf150d783590720f10f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BElementsEqual.swift:48-58 | Sources/InternalCollectionsUtilities/Iterable\u002BEquality.swift:63-75 \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BElementsEqual.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ef927923e7ffb69e674ea0cb5617cece9558a66c4a6ac27d0577e274a8ad07"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/HashTreeCollections/HashNode/_AncestorHashSlots.swift:103-111 | Sources/HashTreeCollections/HashNode/_Hash.swift:87-95 \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":"Sources/HashTreeCollections/HashNode/_AncestorHashSlots.swift"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9222da0c7d5860ebe40901ae54bdc307d085b0105a860dbd79f2fe3d1e929aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/BitCollections/BitArray/BitArray\u002BCollection.swift:139-148 | Sources/ContainersPreview/Protocols/Container/RandomAccessContainer.swift:58-70 \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":"Sources/BitCollections/BitArray/BitArray\u002BCollection.swift"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"439b183ce81db8f290c709077d3f7e93e57f6d9230dd4763402ce1d7dc8596cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift:105-119 | Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift:148-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":"Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"03237556abbbe75b293f293e7ddab05b7ed6310db91ccbae3c193e446f78bdd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/ContainersPreview/Protocols/Container/DrainableContainer.swift:108-118 | Sources/ContainersPreview/Protocols/Container/DrainableContainer.swift:322-336 \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":"Sources/ContainersPreview/Protocols/Container/DrainableContainer.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4151da9fa1fe599e4476eaca021fcf1f33d0f05b41c8d79b7a98a55203532549"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift:80-91 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift:129-140 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30acf8e08bf70cf07c692513de08c33d896932f7e470cebfb543ff13f8cfc7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift:69-80 | Sources/SpanPreview/OutputSpan\u002BInputSpanHelpers.swift:21-34 \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":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c573ee55b6dc3a0665dccaf4f5d6eaabc1be3370a0b207f8bc03c0d52a30573"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/RopeModule/Rope/Basics/Rope\u002B_UnsafeHandle.swift:157-170 | Sources/RopeModule/Rope/Basics/Rope\u002B_UnsafeHandle.swift:172-184 \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":"Sources/RopeModule/Rope/Basics/Rope\u002B_UnsafeHandle.swift"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"4844b2e23b1abacf7f380f5d4446c8b72232e2653715e74c414f01f239de1a1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/BitCollections/BitSet/BitSet\u002BBidirectionalCollection.swift:225-231 | Sources/BitCollections/BitSet/BitSet\u002BBidirectionalCollection.swift:277-287 \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":"Sources/BitCollections/BitSet/BitSet\u002BBidirectionalCollection.swift"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"03554ac2602f357fa65bc2e1a0d2d50f22a2ad1aeb4ee50ea28729c19edb40a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/SortedCollections/BTree/_Node.swift:315-326 | Sources/SortedCollections/BTree/_Node.swift:333-348 \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":"Sources/SortedCollections/BTree/_Node.swift"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef45b75f4f85118f12d771caae673bd64b4ce6a341ac939fd65996b3c4a0972"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift:125-135 | Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift:148-158 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BInitializers.swift:94-104 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BInitializers.swift:132-142 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"53517cc409504325639b9638d59090f90d0718c17e9efce1ecf17913517f0f87"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BLookup.swift:40-48 | Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BLookup.swift:56-64 \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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BLookup.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2354417825e9f507fca7118cddf0f4cf3d354023878ccbd92f1c03153248ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:128-139 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:154-168 \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc26d07b6a6562d10719a9e7c20eda4e413bf2dbfc2a3000f02f7a14809170ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): Sources/BitCollections/BitArray/BitArray.swift:68-79 | Sources/BitCollections/BitSet/BitSet.swift:77-88 | Sources/BitCollections/BitSet/BitSet.swift:90-103 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"Sources/BitCollections/BitArray/BitArray.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"23c77e91c40196be9a3ef35d4d230fe34cc9304fd5a760143638c29031c9f244"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/ContainersPreview/Conformances/UniqueSet\u002BContainer.swift:93-106 | Sources/ContainersPreview/Extensions/RigidSet\u002BExtras.swift:126-142 \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":"Sources/ContainersPreview/Conformances/UniqueSet\u002BContainer.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f42a9be047ad8a59a2726255af22ba02149526573ee97ef28b6ed0d3ae6b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/DequeModule/Deque/Deque._Storage.swift:111-122 | Sources/DequeModule/Deque/Deque._Storage.swift:124-135 \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":"Sources/DequeModule/Deque/Deque._Storage.swift"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5275a7aa4695a176ecfd74d6aeaee89985d9a91289c2e339e5d297d52ef58967"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift:51-63 | Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift:97-107 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInitializers.swift:96-106 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInitializers.swift:174-184 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInitializers.swift:94-104 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInitializers.swift:133-143 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"0417d35e75fb139f614852f921966ceecd6a8580accb0d7445fa1bdd57d0746d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BRemovals.swift:25-36 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BRemovals.swift:18-28 \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":"Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BRemovals.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"816f11b7fb9071c760c95f326ea3bafcfc6d6e7f3dabce88adb43a607e2f7983"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/BitCollections/BitArray/BitArray\u002BChunkedBitsIterators.swift:28-37 | Sources/BitCollections/BitArray/BitArray\u002BChunkedBitsIterators.swift:66-75 \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":"Sources/BitCollections/BitArray/BitArray\u002BChunkedBitsIterators.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf11dd2d6e5cc42349c0993bf0a0238414156e68f4da8387d2f073ffbe03c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:240-251 | Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:443-454 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccbdf3960e3d1ba387e1d9dd89a19a9b362ad9feaecae4b5a2096dbf50ddb748"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:59-69 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift:83-96 \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"646629686b2038fead7c3291d36007e6551ce67af3bc5024f5d74c9e42c3ab20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/ContainersPreview/Extensions/RigidSet\u002BExtras.swift:27-39 | Sources/ContainersPreview/Protocols/Container/DynamicContainer.swift:70-82 \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":"Sources/ContainersPreview/Extensions/RigidSet\u002BExtras.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b39157e9fcca33f2520079ec0aefeb5c4f1b82adda30dd1085c25431f2d51a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/OrderedCollections/HashTable/_HashTable.swift:192-199 | Sources/OrderedCollections/HashTable/_HashTable.swift:205-212 \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":"Sources/OrderedCollections/HashTable/_HashTable.swift"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"7534b0f98401420ff9c1ef3e08ebc9f2c8f5f1372fc94b122422bb9c1f8622a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:214-232 | Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:270-286 | Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:349-365 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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":"Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eb2d2e4bb313d5ea5c6b24656f5230c2dc4e2d8cf4633ed82ab642a9dee40a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift:129-139 | Sources/DequeModule/RigidDeque/RigidDeque\u002BConsumption.swift:127-137 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f5192e1b889092ac77ab4bd23f0043afb320bd2fb1caa7a6fb34b5324698e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:400-410 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:430-440 \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":"Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc009a8f148fdeaf75a25851efd2b5135739d7f7ba447483a35b2ab5738078c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift:205-214 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift:260-269 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db4076752e11bf6d0891af776da706aefc5d713eb0c8c1d89b34b9a086cb1ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet\u002B_Word.swift:59-69 | Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet\u002B_Word.swift:71-81 \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":"Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet\u002B_Word.swift"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"10105e2b5e1ab3baa10000b3cf520409f442fcbdc077a00cbc29079038014cd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:297-306 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:308-317 \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":"Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f9377a83ae65e7717e55b668e88c984532785dcf009d6cb79ea90c2cf94c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:172-181 | Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:183-191 \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":"Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67493448eafb60c52cbd07f666f12b4ae9bb0c288de679ff98e134437aa820d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:183-191 | Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:203-211 \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":"Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2042ce759b3c704a8bc3e6144dde6e7add76890877ee51c9e481906c862dc3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:193-201 | Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:203-211 \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":"Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04c10bd6102a368266109a99f5d3b81d9290aba91f8dbb9f5392e2ef24c6f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift:90-102 | Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift:97-108 \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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"65fd82cf78f1e7e01cfdfd457daa1702ba89cd567d4ad5f29e00b97bf5913aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:247-257 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:304-314 \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":"Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aebeb8302a832c806073730c664c6e36984dc2ea7fadd0db306965ef81a3be2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/DequeModule/_UnsafeDequeHandle.swift:920-930 | Sources/DequeModule/_UnsafeDequeHandle.swift:937-945 \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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"2314ce8e78c12518a20de88a888e715e76263d3deeef049afd3cab5003088afc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra symmetricDifference.swift:34-41 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra symmetricDifference.swift:58-67 \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra symmetricDifference.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f71b99e7bc66e10883ecc9b661712529fcef6df473ae46e5c8eef52c8018ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BUnicodeScalar.swift:42-52 | Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BUnicodeScalar.swift:54-64 \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":"Sources/RopeModule/BigString/Chunk/BigString\u002BChunk\u002BUnicodeScalar.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb92a73f554629e5736eaeb7d611b7413851af35a4979c31300c7cc1a6fb9c47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/RopeModule/Rope/Operations/Rope\u002BInsert.swift:30-43 | Sources/RopeModule/Rope/Operations/Rope\u002BInsert.swift:45-59 \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":"Sources/RopeModule/Rope/Operations/Rope\u002BInsert.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b7b1d6996ea03ee506524d38e974ca523fd2e21e177cd79b432886a76f2720"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra formSymmetricDifference.swift:65-74 | Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra formUnion.swift:61-70 \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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra formSymmetricDifference.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c8a6a2f25099bb6a0b0717748b0df997c01df95feec6d9bff1393702112d3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/ContainersPreview/Protocols/Container/RangeExpression2.swift:41-47 | Sources/ContainersPreview/Protocols/Container/RangeExpression2.swift:72-78 \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":"Sources/ContainersPreview/Protocols/Container/RangeExpression2.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02c5bfce40f5a84310eea72b769c1331bf70d97d52d312f321b37a1e320c891"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode\u002BUnsafeHandle.swift:71-81 | Sources/HashTreeCollections/HashNode/_HashNode\u002BUnsafeHandle.swift:83-91 | Sources/HashTreeCollections/HashNode/_HashNode\u002BUnsafeHandle.swift:93-103 | Sources/HashTreeCollections/HashNode/_HashNode\u002BUnsafeHandle.swift:105-113 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/HashNode/_HashNode\u002BUnsafeHandle.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0e1128f5a5474fb449549dd7b8cf95c2629d8d4f843b4a7edb505176fa26a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BLookup.swift:79-85 | Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BLookup.swift:87-93 | Sources/BasicContainers/RigidSet/RigidSet\u002BLookup.swift:39-45 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BLookup.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d7ecced484f94cc02d5f463331023048933e52d8a583420cddf516e5bcfdba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:77-89 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:104-114 \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":"Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1fc2867a0af38a48ba1e26e18e5680b7afe01a5059a2974954ecb512548c6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:700-710 | Sources/DequeModule/_UnsafeDequeHandle.swift:1397-1406 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ca3a323100cdd236ea9458906466d5db23e6afa9c647ef30da6cba86fad6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/ContainersPreview/Protocols/Container/PermutableContainer\u002BReverse.swift:22-32 | Sources/ContainersPreview/Protocols/Container/PermutableContainer\u002BReverse.swift:41-51 \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":"Sources/ContainersPreview/Protocols/Container/PermutableContainer\u002BReverse.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0f0b870cb652b304507a5e75bbf0307df5f5f644cbf33cf1335f0b40049e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isDisjoint.swift:74-81 | Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:545-552 \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isDisjoint.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"0813a7db1121106e64a12cb72da00c86aa26c281775cd8f44c9fc3861f665bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): Sources/InternalCollectionsUtilities/Descriptions.swift:34-50 | Sources/SortedCollections/SortedSet/SortedSet\u002BCustomStringConvertible.swift:35-49 \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":"Sources/InternalCollectionsUtilities/Descriptions.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eaf0080db09175776d517ce67c6601016c4691fd8f9cd149f1fba59d9180eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/BitCollections/BitArray/BitArray.swift:57-66 | Sources/BitCollections/BitSet/BitSet.swift:42-50 \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":"Sources/BitCollections/BitArray/BitArray.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ef8baa1dbb49f87715199a8e556db2bf76fa1a9f8512a780b5128390d1d51f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift:49-56 | Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift:71-81 \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"325ec3c5f82a54b0592a8189236e554085d3624e44645bff2e6d08ca84000e81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BSubSequence.swift:299-308 | Sources/SortedCollections/SortedSet/SortedSet\u002BEquatable.swift:26-36 \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BSubSequence.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"093699f64f41bf0e8b2d183bec3d207910492c7c1035427019d89ac51dce773b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift:85-93 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BConsumption.swift:61-70 | Sources/DequeModule/RigidDeque/RigidDeque\u002BConsumption.swift:79-87 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BConsumption.swift:63-70 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acb520d7a48143e11dc175e87c6537ee15adfe2060f881af5a35d0c13a15e5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): Sources/ContainersPreview/Protocols/Container/Container\u002BFilter.swift:75-88 | Sources/ContainersPreview/Protocols/Container/Container\u002BFilter.swift:90-101 \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":"Sources/ContainersPreview/Protocols/Container/Container\u002BFilter.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac98d4ee12434f786f0d199ee6ceaa229508864eed66db80195c21969c3999d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift:251-259 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BInitializers.swift:287-293 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"73de58ef6d253930381cc0886681713f7e88158b8b5cc9338637c68824feccf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:138-145 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:148-154 \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":"Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"400c7ad5a16051f8b88bf862783391f8184db13c3aecde9e3191e7a8746b01aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/RopeModule/BigString/Conformances/BigString\u002BHashing.swift:23-35 | Sources/RopeModule/BigString/Views/BigSubstring.swift:101-108 \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":"Sources/RopeModule/BigString/Conformances/BigString\u002BHashing.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03f63cb274561b9bfae6f86305fad9c3c667e0ff47ceb0adfbb30f0b97f9e7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:172-181 | Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:193-201 | Sources/RopeModule/Rope/Basics/Rope\u002B_UnmanagedLeaf.swift:41-51 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 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":"Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df392c89a94b93b2ce06b80df51eead0ecf0ba2e86116c9c82091819bfd19d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift:319-329 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:270-280 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:323-333 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"550ff5b4a1be7d1caf493861db824dcaf6305b78eaba05f00f376bff1becd3cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BFilter.swift:25-34 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BFilter.swift:25-32 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BFilter.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"7480c14f363010471b6e75c3d71602ff217d759f3368e969be15d57ba657a1ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary.swift:922-931 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BMerge.swift:214-222 \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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary.swift"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a81bebc8bc1234d05d989793448aab9d6caf674fb9d9ca069c620c8a001b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary.swift:544-552 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BExtras.swift:31-38 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary.swift"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbe6c91c82b537b6ce7ac875750ac0fc81812f86a39a2283704e54e09ec5e3d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:66-73 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:79-85 \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":"Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f355ae6d17682768d21a66d298b43f63283518af6c275201900875452fd6664"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift:214-222 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BMerge.swift:123-132 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6853f032f7786cc2044990587ef9769cb76160aace7b639f7f0a660931fcc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:183-192 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:204-213 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:270-280 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 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":"Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b662cb4102ad80bbaf9e159b9516ac04a820bb0548608b84ed17e02a7108ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): Sources/SortedCollections/BTree/_BTree.swift:221-239 | Sources/SortedCollections/BTree/_BTree.swift:248-261 \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":"Sources/SortedCollections/BTree/_BTree.swift"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0a9ff2b925ad62b592e3da31872a219c4be904eccd3e8fb0dd945c9d0a960ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift:399-405 | Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift:55-61 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"878b197446dafe99b412bfefb0408214c3885f2f8cbdcdd8720a28970bdcbb1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:130-138 | Sources/DequeModule/_UnsafeDequeHandle.swift:185-195 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"306d8e48acfde02b3273b6d4452718392cf055d46efd8da89cdf7dcbcdf591ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:712-721 | Sources/DequeModule/_UnsafeDequeHandle.swift:1408-1416 \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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea86e523aa6314a1e61ffe231ce319bc4430a766f6e883bacb32f8d4a48cb4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BInitializers.swift:123-135 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BInitializers.swift:347-359 \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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BInitializers.swift"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"768d0733ac84ee021d889ae7b7e83bacce52bed8a26f56409d6df5525b712571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra intersection.swift:85-92 | Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra symmetricDifference.swift:87-96 \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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra intersection.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b64cd27d537c4e4de52fb1ae226deb131f9167f3247e27f6561c97bc8f3ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/DequeModule/Deque/_DequeBufferHeader.swift:35-40 | Sources/DequeModule/_UnsafeDequeHandle.swift:78-83 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/DequeModule/Deque/_DequeBufferHeader.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"839de91022d0f3eb0e814f8c726f5322b9986ca56d5875be1e7b4b9d344f0fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BMerge.swift:259-268 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary.swift:968-976 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BMerge.swift"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa1f4b27f51aa5931909a3d51f1fb20614934f37fcee31952dcfdde9ac26c88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:90-97 | Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:114-121 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:102-108 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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":"Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"532a1a6d40bd6c2024e9fc76313e4a45486e4c96cc169c3aca59fa9a195f1003"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift:224-231 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BInsertions.swift:118-126 \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":"Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ebd5dc21da6eee6e8b14c8451c4e95b46a9eeadf0ddf6ca18eff33e1d59eb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:245-252 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:252-259 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa9928856f597523c7ec8bd1c89409a17a14a27c7a60c3e061a7d57dbcc532c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:224-231 | Sources/DequeModule/RigidDeque/RigidDeque\u002BDeprecations.swift:153-160 \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f68a87438ab5903bbbe7bcc9144045f5ccca47602faa20ba4f824ec210e15ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra formIntersection.swift:90-100 | Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra formSymmetricDifference.swift:89-99 \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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra formIntersection.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1f7bb3cad67e3e050ebc86e508dc6ea7e40c5c39905707dda006eecaadc45b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isEqualSet.swift:43-47 | Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isSuperset.swift:71-75 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isEqualSet.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"580e0a4bb4e7bd2915c3bdaed22814f3d03a35445c083c945c66f03edbf350c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BInitializers.swift:207-216 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift:174-180 \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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BInitializers.swift"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d25baa74e1be7953d11b6e46d76dfa8de940922c71ad7a963843c9d23923ff1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:48-55 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:47-54 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5209331a2efa6d7dce413cdb5d7a395cea44c61916c78ed16a4ebbc0736d2f3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:57-64 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:56-63 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e0695a4f69a735c6d095e1b70c9c2a5f5ccfa26128d518f0f1d23eee4a1366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BRemovals.swift:18-23 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BRemovals.swift:18-23 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BRemovals.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9952dd1af4350efb04dfb58dcb18d228eeabb8096a37261710260207bcafbdf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra formSymmetricDifference.swift:30-38 | Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra subtract.swift:29-38 \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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra formSymmetricDifference.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"8315600a48b5e7d57852c3b40e4339a7fcd740993f4d73056304683bc0dd374d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra intersection.swift:69-73 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra subtracting.swift:61-67 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra intersection.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"03806f8e529ef74b3cef3873dfec28271b29638d7e5f130814c550c6dff45e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isSuperset.swift:84-91 | Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:517-523 \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isSuperset.swift"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"62988719c3217e75d82cbd15d1d4c03b031977bdf3491bae5d9a14c68f753963"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BPartial RangeReplaceableCollection.swift:139-144 | Sources/SortedCollections/SortedSet/SortedSet\u002BPartial RangeReplaceableCollection.swift:139-144 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BPartial RangeReplaceableCollection.swift"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"04981168923f356e71909f49429e0730e07b26d5832e8d5565447eca6cf18343"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift:439-445 | Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:79-84 | Sources/ContainersPreview/Conformances/Span\u002BContainer.swift:90-95 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc1604c9dd28a63ad27cf0be00c19218328c9de55de17827756d29156c099ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:16-21 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:20-26 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12b1d79e1cbcc47f4fe551a461bee7fdf1837dd1cc6262d8cb006bffd41c6d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift:57-64 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInitializers.swift:43-50 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInitializers.swift:45-51 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ecf5bf854e43d96c650d9de05f0a2d82ba88e7529ac5e96900b58f27c1f2f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/BasicContainers/RigidSet/RigidSet\u002BRemovals.swift:18-23 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BRemovals.swift:30-35 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/BasicContainers/RigidSet/RigidSet\u002BRemovals.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1636e49acbe2f0f13944cd952d1fb4295e955b3f2f9923148b4dd238f948c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BPartial RangeReplaceableCollection.swift:21-28 | Sources/SortedCollections/SortedSet/SortedSet\u002BPartial RangeReplaceableCollection.swift:21-28 \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BPartial RangeReplaceableCollection.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30bb2a486d069c6a66b1309b4a33081892895fe8eb4ff26ac4416d904a2af31"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift:187-195 | Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift:75-83 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BInitializers.swift:153-161 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInitializers.swift:114-122 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"2846ddca89040523dbd182909d7588836b1069c71758e055441fb2f714115155"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift:306-314 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift:293-301 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ed9e0747d1f02699742431fb1668dfd6489ee660157b584ccb936764a3183c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BKeys.swift:32-37 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BKeys.swift:32-37 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BKeys.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae578633c78afba50ec5041bbd3406a5c7333e94c856a352ff79f7f075c67c30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/ContainersPreview/Protocols/Drain/Drain\u002BMap.swift:47-55 | Sources/ContainersPreview/Protocols/Producer/Producer\u002BMap.swift:49-57 \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":"Sources/ContainersPreview/Protocols/Drain/Drain\u002BMap.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e3585ed94cccd5ae3b805700ff22b68144dfba9184069afccab9a5c8e17938"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift:128-136 | Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:131-138 | Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:132-141 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa5910f96200b59768ca210daf2f4fc7858a0c308e963439e8ab0a9f69f27960"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift:236-246 | Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:200-209 | Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:203-214 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"047bb46b9a548d0e077d36bf2c5abefbea42078ba8494a59932df43feef8433d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/DequeModule/Deque/Deque\u002BCollection.swift:871-878 | Sources/DequeModule/RigidDeque/RigidDeque\u002BRemovals.swift:118-124 \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":"Sources/DequeModule/Deque/Deque\u002BCollection.swift"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"b07ac64c52838d754fff92206e5288cd4f4ac28bfbbfe4620ce2d2e88e0ab7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BCodable.swift:32-40 | Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BCodable.swift:34-42 \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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BCodable.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d4abcd4d3e7c2dadce7314d3481ea9d98aa74e542cc89ff7168cc06d94e05e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/TrailingElementsModule/TrailingArray.swift:218-223 | Sources/TrailingElementsModule/TrailingPadding.swift:84-90 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/TrailingElementsModule/TrailingArray.swift"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2d0bdb880b7a5f697e0e64a744c0d49d7926158a3622c2a431528a4e9620d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift:363-373 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:891-899 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b3bc46c09d1379b5692478414cdbf95944b57b64b49ebbd1edf6891766aceb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSubset.swift:65-71 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSuperset.swift:65-71 \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSubset.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1be002884c8d589c2463f6706c428f1a20a0059907119f4755de614a6e8b51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BHashable.swift:19-26 | Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BHashable.swift:22-29 \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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BHashable.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f995d8c735efe6dcad6669add157b06ab98bbb4cd2161993570a1f3df8b9d29b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BDebugging.swift:34-44 | Sources/BasicContainers/RigidSet/RigidSet\u002BDebugging.swift:150-160 \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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BDebugging.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a38c1dfeb67d54f67a4f65f903b5c4dbfe7a20d72f03413bea89038523f8de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift:310-315 | Sources/RopeModule/Rope/Basics/RopeElement.swift:72-77 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a8d111dede2d25d163de2b7d81116ccc33ba753acb745a39e437655e5997665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift:146-153 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BConsumption.swift:121-126 | Sources/DequeModule/RigidDeque/RigidDeque\u002BConsumption.swift:173-181 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"105e52cc8aa255924ca76faba5cf8fb75afe3652cd6623dc9842866f604aac18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray\u002BConsumption.swift:105-112 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BConsumption.swift:110-117 \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BConsumption.swift"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"02de7d3598720f1e15d61d559661b41fdf58d40b937a056d8e53205210c0ba11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/SortedCollections/SortedDictionary/SortedDictionary.Index.swift:19-26 | Sources/SortedCollections/SortedSet/SortedSet.Index.swift:19-26 \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary.Index.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"110b458322f6d76840d7cb1c09c8327318d5b833f34939bef63ebd8d94b785e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BDebugging.swift:18-24 | Sources/BasicContainers/RigidSet/RigidSet\u002BDebugging.swift:54-60 \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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BDebugging.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"37aafc3a44a16efb483ad39c99cb7d9531762c4c5c40247e68ab92aa7171192f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:107-114 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:222-231 \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15666c14373af264c396a92396bc33182eb68719c9714b2348f90aa41372491"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift:148-151 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift:147-150 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"4901285b93d8c2e09cb16aa86b06fa36f1500b1bacd155783d8fec0772143141"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:86-93 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:114-121 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:118-127 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d2a468c2229e64d43cec7669ba24bb2c94d6c588f8a9a7faa2c603b8b3c457"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:185-192 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:190-197 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:195-203 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"36553646e0478f29a0c965aac88f8a61fc99a857914c9b9edaabe11405948daa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/ContainersPreview/Protocols/Drain/Drain\u002BMap.swift:69-73 | Sources/ContainersPreview/Protocols/Producer/Producer\u002BMap.swift:83-87 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"Sources/ContainersPreview/Protocols/Drain/Drain\u002BMap.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b61912ba5d6fbd686db36bcf5067a339b79214f4f7fd6e1c5f3003aeaf6522"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BFilter.swift:46-54 | Sources/ContainersPreview/Protocols/Iterable/Iterable\u002BFilter.swift:46-54 \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BFilter.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"082ab7f5f5a71365cb9e2872bb35430a146c4b69e2bb4cdfc9cb9c19488ccba1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/HashTreeCollections/HashNode/_HashNode.swift:89-95 | Sources/SortedCollections/BTree/_Node.swift:304-309 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/HashTreeCollections/HashNode/_HashNode.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f567dac944352376e12859f3f1f5e1569506572b162eb4746b56d7ffe87c17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.swift:331-335 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BRandomAccessCollection.swift:302-306 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BSubSequence.swift:360-364 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.swift"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"d554f3b6b07bc5127af4566c331ae39490c29bb84346ab36722ceef30c5d9371"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift:276-283 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:225-232 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:230-235 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"93842d57b1251eeea4b7021882c9b2bdbf5d3b372a600f5ac3ae1699c6a7358a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift:83-89 | Sources/DequeModule/RigidDeque/RigidDeque.swift:240-246 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b78557671b518eb21f7b4394de49a999aa70826e7e598d6ef23c57971898c0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/BitCollections/BitArray/BitArray\u002BEquatable.swift:27-30 | Sources/BitCollections/BitSet/BitSet.Counted.swift:217-220 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/BitCollections/BitArray/BitArray\u002BEquatable.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b7845b68feb11b67ce6fd55828a8f1810eb1e5d0126c62cf93ce91c2db752b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:25-32 | Sources/ContainersPreview/Conformances/Span\u002BContainer.swift:26-30 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0a1497f1c9e1e917a8f44b0a35671a047392614fcd18e6b92970b684960dfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/ContainersPreview/Protocols/Drain/Drain\u002BMap.swift:94-98 | Sources/ContainersPreview/Protocols/Producer/Producer\u002BMap.swift:115-119 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"Sources/ContainersPreview/Protocols/Drain/Drain\u002BMap.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"4086c6bd41deee2dcb313ac30991ab83420ccd1ed70bc63da9b8c02684dfd1c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:227-235 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:218-224 \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"830eb559244d87f50c83ef2fd7f4a04bbbf5ee2047d737cdbc96b94e8f01c8d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BRemovals.swift:111-116 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BPartial RangeReplaceableCollection.swift:155-161 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial RangeReplaceableCollection.swift:190-195 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BRemovals.swift"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32220e68cc74af3a7fe50d385c15026c96e807d3b21ed90dea03c59d587c4c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BEquatable.swift:21-24 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift:309-312 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BEquatable.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e8d8a0170bc573caeeb203761b0dd249cfb8a2e6026bbaf808a92e72b05740"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift:67-73 | Sources/DequeModule/RigidDeque/RigidDeque.swift:224-230 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"683410902abcc6a0c827a6e3c6665fea3be51c5fc9f8613f30c87bb911e57039"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift:75-81 | Sources/DequeModule/RigidDeque/RigidDeque.swift:232-238 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9306aed6f81cdbb8063c9bdcc67c453f03b8a6d9fbb6f7ebcc43846a0a481de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift:258-263 | Sources/ContainersPreview/Protocols/Container/RandomAccessContainer.swift:123-129 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc71e33798501a64d7bc327e64ddf724a7e934ac9fd46e0159f5617e8096a17f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift:165-170 | Sources/DequeModule/RigidDeque/RigidDeque.swift:300-305 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4e5a0602bdd74f2a894d96e6cde94ca7d588b707fe16ea5fbca0e19fb5066b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift:78-82 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInitializers.swift:77-82 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4487bad792a2a653b5093e5e1374da2ebb459f21d0eeb5c6374c3891935bcf0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.swift:319-323 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BRandomAccessCollection.swift:290-294 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BSubSequence.swift:348-352 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.swift"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"92834684262246337b6a101926f4efc39d3b0fb3d4c89773f93554320a5aed6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.swift:325-329 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BRandomAccessCollection.swift:296-300 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BSubSequence.swift:354-358 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.swift"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56f46385b04cffd45669ebeb729b6ce45f6cc5bd0fcddee494fb4d46851eea3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BRandomAccessCollection.swift:57-62 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BSubSequence.swift:118-123 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BRandomAccessCollection.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c0470468aaaf2d517900c17db27bb5ebc7d4cb4cc6e63919e2fc48e11b582d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BEquatable.swift:63-66 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BEquatable.swift:46-50 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BEquatable.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc7abe394a9f098badb21ac52aceec0a9e910e529e11aece24bd0072aaedc71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/BitCollections/BitArray/BitArray\u002BRangeReplaceableCollection.swift:27-30 | Sources/BitCollections/BitSet/BitSet\u002BExtras.swift:34-37 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/BitCollections/BitArray/BitArray\u002BRangeReplaceableCollection.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"8242e4d015e2a0ca8b353b929eb5449d02be0c3785e4412329ea9007aaa2f12b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/BitCollections/BitSet/BitSet\u002BBidirectionalCollection.swift:50-55 | Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra basics.swift:40-43 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/BitCollections/BitSet/BitSet\u002BBidirectionalCollection.swift"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce87a4c371e5a1d1a6de920813c4c0945acb073fa2351d47874f3f45745677b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.swift:390-394 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BValues.swift:331-335 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.swift"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd203808b51ac1e11e56a9aa23d4715d8708dba129b7b94c2339595970ca2ab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/RopeModule/BigString/Views/BigString\u002BUTF8View.swift:155-158 | Sources/RopeModule/BigString/Views/BigString\u002BUnicodeScalarView.swift:157-160 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/RopeModule/BigString/Views/BigString\u002BUTF8View.swift"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e37b05799641c995282e6fbfb4a6e3b3a7ae91f7a1b5cad664485cee25ffe9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift:319-325 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift:333-339 | Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:56-62 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab4f6b074d799bc05998b1854343dd94e5dcea083e434ffd86d6a30d2f6369e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInitializers.swift:39-43 | Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift:24-28 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BInitializers.swift:23-28 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInitializers.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7077a9da01d5ae42a16dc876b22b593d447330678015b38ef166cfc91f76df2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift:161-164 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BValues.swift:147-150 | Sources/SortedCollections/BTree/_BTree\u002BSubSequence.swift:107-111 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b995b991926700949af73c510bd9f8ea4edbb21819a7d10539f0a5e1204153"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BExpressibleByDictionaryLiteral.swift:29-36 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BExpressibleByArrayLiteral.swift:30-37 \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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BExpressibleByDictionaryLiteral.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"701e4d668834fb40743b9cfe98b4d87039f82ffa0ac45e6c11fadbdb28caf0d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): Sources/RopeModule/BigString/Views/BigString\u002BUTF16View.swift:37-39 | Sources/RopeModule/BigString/Views/BigString\u002BUTF8View.swift:37-39 | Sources/RopeModule/BigString/Views/BigString\u002BUnicodeScalarView.swift:75-77 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 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":"Sources/RopeModule/BigString/Views/BigString\u002BUTF16View.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5b2a981b2829a85fc54cbaac4db5818780aad12b50edebd3212cf45fe54f52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): Sources/RopeModule/BigString/Views/BigString\u002BUTF8View.swift:37-39 | Sources/RopeModule/BigString/Views/BigString\u002BUnicodeScalarView.swift:75-77 \u2014 These two members are one piece of code written twice and then edited apart: 3 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":"Sources/RopeModule/BigString/Views/BigString\u002BUTF8View.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e049a1e5b0cdc7b868d5286c18e48978ba9623ca64965ed04ed3c96f5f2700e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BIndex.swift:32-36 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BIndex.swift:32-36 \u2014 These two members are one piece of code written twice and then edited apart: 5 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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BIndex.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e2e69957d6822d82923168c50f4bbe2721ac84066022f925e3940bae91c1a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift:365-370 | Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:72-77 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift:79-82 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"b690f5ef63e7bdc4e37b2156a7dda57f369c93d092e478764a13b6825b70cbc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/BitCollections/BitArray/BitArray\u002BCodable.swift:27-31 | Sources/BitCollections/BitSet/BitSet\u002BCodable.swift:22-25 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/BitCollections/BitArray/BitArray\u002BCodable.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"338ae9cbe760cbc4aafbc2881df31691645f18a1127082c188878edc3ad2e90e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/BitCollections/BitSet/BitSet.Index.swift:70-73 | Sources/HashTreeCollections/HashNode/_Bucket.swift:55-58 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/BitCollections/BitSet/BitSet.Index.swift"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec929164579f6067ecc67c6ca53201c89a6efc3b99d47be23ce53834eea69158"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): Sources/BitCollections/BitSet/BitSet.Index.swift:81-84 | Sources/HashTreeCollections/HashNode/_Bucket.swift:62-65 | Sources/HashTreeCollections/HashNode/_HashSlot.swift:65-68 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"Sources/BitCollections/BitSet/BitSet.Index.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b569babd3a1fa35e7774d65c8d6e97e33e996e1f56b6e7ed5a0ef54f2a6c4c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:29-34 | Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:29-34 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b9db90c86f57bb229ae95a1fcc195f3d20fba0885388077a6fbe60e2774175"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 4\u002B corresponding lines): Sources/RopeModule/BigString/Conformances/BigString\u002BBidirectionalCollection.swift:42-45 | Sources/RopeModule/BigString/Views/BigString\u002BUTF16View.swift:119-122 | Sources/RopeModule/BigString/Views/BigString\u002BUTF8View.swift:155-158 | Sources/RopeModule/BigString/Views/BigString\u002BUnicodeScalarView.swift:157-160 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/RopeModule/BigString/Conformances/BigString\u002BBidirectionalCollection.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7699b741340f2b899a936d17ff77d42c516b91398f58df4c67ebf0b4a6dc42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift:107-112 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BConsumption.swift:83-88 | Sources/ContainersPreview/Protocols/Container/DrainableContainer.swift:234-239 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee08709babff249320bcbf81ebe3ee35f02e52c2f99b5729926dcc8ffd3d059"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:173-177 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:180-184 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:35-39 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fadca5708dc166aabbdb15e444b574fff518f7aff6e2d9b16674f8ace24df0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BRemovals.swift:41-46 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BRemovals.swift:42-47 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BRemovals.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"418a63846999b6c133159156af3b7c84c24be9b84f3aa4d179a7c3210f7fdba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/BasicContainers/UniqueArray/UniqueArray.swift:182-187 | Sources/DequeModule/UniqueDeque/UniqueDeque.swift:276-281 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/BasicContainers/UniqueArray/UniqueArray.swift"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e84b595a8ddf0ebe95cfbf77495c6cf7bbd713f114ad7bdc940546e8a6cd8ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 4\u002B corresponding lines): Sources/HashTreeCollections/HashNode/_AncestorHashSlots.swift:35-38 | Sources/HashTreeCollections/HashNode/_Bitmap.swift:59-62 | Sources/HashTreeCollections/HashNode/_Hash.swift:34-37 | Sources/HashTreeCollections/HashNode/_HashLevel.swift:92-95 | Sources/HashTreeCollections/HashNode/_HashSlot.swift:58-61 | Sources/HeapModule/_HeapNode.swift:39-42 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 4 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/HashNode/_AncestorHashSlots.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b33b5de5a3f76a4e8e456cf55e50c6e1cc2f1ff24aa7a2f1bf8da78f1e510fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/HashTreeCollections/HashNode/_HashLevel.swift:99-102 | Sources/HeapModule/_HeapNode.swift:44-47 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/HashTreeCollections/HashNode/_HashLevel.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e54c5c1cb2e130bd2d6cadbd73048efe2aac053b40987ad4e75c912f378d0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift:149-152 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BValues.swift:135-138 | Sources/SortedCollections/BTree/_BTree\u002BSubSequence.swift:138-142 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d794c918f547f1c9293679caa6b146280ebcd4eaa734715c55fda4bde24ef25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BPartial RangeReplaceableCollection.swift:138-143 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial RangeReplaceableCollection.swift:173-178 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BPartial RangeReplaceableCollection.swift"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb604929a7ee04f7edc80936b894c19981b1a29de83b13fdd870f0a18e67e3cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift:52-57 | Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:46-53 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ba8aa4ca4fda08ca96bcdc46bcca62df167ce64335e03dba19d58032dbe95d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 5\u002B corresponding lines): Sources/DequeModule/Deque/Deque\u002BCodable.swift:23-29 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCodable.swift:19-23 | Sources/SortedCollections/SortedSet/SortedSet\u002BCodable.swift:21-27 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 5 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":"Sources/DequeModule/Deque/Deque\u002BCodable.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce97adfc9b959851c4b40bfdff510eca9130364c297051b9431fb9f2c4c5995a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BValues.swift:393-396 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BSubSequence.swift:368-371 \u2014 These two members are one piece of code written twice and then edited apart: 4 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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BValues.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04f8a7dd6e7705807c2a6ff385c30d9191e0f020ec82a0a3ac193431747be1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BUnorderedView.swift:314-319 | Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:78-83 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BUnorderedView.swift"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13e3f77e3ba12cabe19f14c400ff4ab66a8f960863ea8d6ecde6d377fe8ea36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:628-666 | Sources/DequeModule/_UnsafeDequeHandle.swift:1100-1138 \u2014 before extracting anything, compare \u0060Sources/DequeModule/Deque/Deque._UnsafeHandle.swift\u0060 and \u0060Sources/DequeModule/_UnsafeDequeHandle.swift\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:628\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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd9ec93c1cbc14149fef8a4c8050c0e78b26b3be4a4c4c26c0fa8b23351f8b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (33 lines \u00D7 2): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:827-859 | Sources/DequeModule/_UnsafeDequeHandle.swift:1219-1251 \u2014 before extracting anything, compare \u0060Sources/DequeModule/Deque/Deque._UnsafeHandle.swift\u0060 and \u0060Sources/DequeModule/_UnsafeDequeHandle.swift\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:827\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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd19396612c1880ed1a0b22c83a7d22d12d9b26b75c171c514be647ce282aaaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:407-432 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:420-445 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d9248cb8375af7afc6df43deeadceb47cc969db2e6760608b36ed42fb10d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:127-151 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift:132-156 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift\u0060 and \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:127\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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d02768cac1509362c1bc81c1514e192f52191ce0cda1e92836e9d21357fd743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isEqualSet.swift:82-106 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isEqualSet.swift:51-75 \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 \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isEqualSet.swift:82\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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isEqualSet.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b31f7798ccc5a9ce7e7b78b1e3fe78c773f476872efe6c69bfb5beb1426c351"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift:92-116 | Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift:129-151 \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 \u0060Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift:92\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":"Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7199b14f729248228a64a4a8bd2a3aadb63f08b4862621da8d9a6914043807a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:191-214 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:321-342 \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 \u0060Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:191\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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a28984ec89448a51153b686d55d0dad196fb00d6cd84947526f18557b5728f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:590-611 | Sources/DequeModule/_UnsafeDequeHandle.swift:1062-1083 \u2014 before extracting anything, compare \u0060Sources/DequeModule/Deque/Deque._UnsafeHandle.swift\u0060 and \u0060Sources/DequeModule/_UnsafeDequeHandle.swift\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:590\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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a0bcd9cc63b01c8b5ea14972c7e2a212b4578cea6906e3ecaa7c7e837448f13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:318-339 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift:335-356 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"906a7d8c45b040b2c8219cffaf854b4bd37d651d9b852157ed4361eae3911f3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): Sources/RopeModule/BigString/Conformances/BigString\u002BComparable.swift:16-36 | Sources/RopeModule/BigString/Views/BigSubstring.swift:113-133 \u2014 before extracting anything, compare \u0060Sources/RopeModule/BigString/Conformances/BigString\u002BComparable.swift\u0060 and \u0060Sources/RopeModule/BigString/Views/BigSubstring.swift\u0060 as WHOLE FILES: 96% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/RopeModule/BigString/Conformances/BigString\u002BComparable.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"db60bca13c00950a19ce0e06df1bd4c2de9797a16498d39dea3dfc0caaa2fe82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:188-205 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:194-213 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c083f4c9a47f63f762ad913dd43aa6d1596b918d78c0f0fad54b4407046ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:250-268 | Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:329-347 \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 \u0060Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift:250\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":"Sources/BasicContainers/HashTable/_HTable\u002BIteration.swift"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9680dd735c5fb75658e406ceafc035310bc4f2fc9a304ad9ba85281f2844f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:797-815 | Sources/DequeModule/_UnsafeDequeHandle.swift:1189-1207 \u2014 before extracting anything, compare \u0060Sources/DequeModule/Deque/Deque._UnsafeHandle.swift\u0060 and \u0060Sources/DequeModule/_UnsafeDequeHandle.swift\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:797\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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"7531226d53e26fb111980bfd4aded9fc5585813afa9dac63099cac6b236cd669"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:132-150 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift:138-156 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bcf398981ff6f589374adee6688f62c3ca94752da388b6952b7452a464efd2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift:239-255 | Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:111-127 \u2014 before extracting anything, compare \u0060Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift\u0060 and \u0060Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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 after the matched lines, \u0060Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift:259\u0060 calls \u0060available\u0060 and \u0060Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:151\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":"Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ea88511606b3f1b4e789fe243c14486a7549b677c632cbf3fa81e7dd5b10d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:316-332 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:327-343 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 127 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25f48d0557e74405c94e6ffe476dd1a44a6706bb760d017d2e38524efc67551"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:240-255 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift:253-268 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2253b5aaeccba7f50fddd630c24351cf9e98dd728efc01956828eddd0cfab0c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:256-268 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:245-260 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:256\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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede68c2af529866012f82b228eea0452c38ed0809ea39d6da7f4c8193e37335b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:274-289 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:266-279 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"28065c76a18ee674b69c208969a5d2c05cb26e4e08aa2dd5bc5a2eb6648d6041"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:110-125 | Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:215-230 \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 \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:110\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":"Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"78dfab72593aa176d1e91549b1b1cd8ba7bf423af11ffed376ec614d227280db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol\u002BEquality.swift:35-49 | Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol\u002BEquality.swift:117-131 \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 \u0060Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol\u002BEquality.swift:35\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":"Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol\u002BEquality.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b681c11b3a5a89d24906254626b23e97aec765c2ac347bdb7b892e980bd42f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift:207-220 | Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:79-92 \u2014 before extracting anything, compare \u0060Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift\u0060 and \u0060Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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":"Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"f496c5e214289c5d17205b73ac86d7811afdde4c0f168e620c7ae117cb1d91fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:56-69 | Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:163-176 \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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:56\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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060slot\u0060 to \u0060_HashSlot\u0060 in one and \u0060let\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab493a7cc3394a086c99bffeaed4d0cf8dce2cac0633b950087e2c76c5b4dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift:263-276 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift:262-275 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b811bd27fd6ddfed54bf4191b91d0c0050be41142ed0e9752161f7b2a5a6a7e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift:299-312 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BInitializers.swift:331-342 \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 \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift: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, \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift:313\u0060 calls \u0060_invariantCheck\u0060 and \u0060Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BInitializers.swift:343\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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37d0df3217d8c768f207c37d2a6bd5bb2ebb8a7ae2a5dde365323d96394c58a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BPartial RangeReplaceableCollection.swift:153-165 | Sources/SortedCollections/SortedSet/SortedSet\u002BPartial RangeReplaceableCollection.swift:153-166 \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BPartial RangeReplaceableCollection.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"721666af6cea625b5bc5db0ff10df45e6f37c432b7df3221c0dc6a927251b2bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift:171-183 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:170-181 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift:178-189 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9bb780b989fad81868f4a788f582fc3417c3e5c9a1f51a6e5a2fed15c7517b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift:202-214 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:201-212 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift:211-222 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:215\u0060 calls \u0060available\u0060 and \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift:233\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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a0c18fe1b214d4dddfd4fbcbde71a378333926da27f70ef4c1441e4f79b38d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:114-126 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:120-132 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a48b327150891c68e8e0646b77b89e911d9ddb38a1418a9af26419e5b2a987e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:148-160 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:155-167 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e244b0c6b0dc948be84fe0e1055add69ac7e90e26bbe5fdb04bcd89e4b6468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:88-100 | Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:192-204 \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 \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:88\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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1aae06a8aefcdbaaeec8aca3ddb6d6852f2ceb29501af646fa02b91a65c6a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:248-260 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:238-250 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"782c0825fa3f353947f1d4843e33c916c3070ff3bad81625d2ade7bf9d7aee2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Sources/RopeModule/Rope/Operations/Rope\u002BRemove.swift:63-75 | Sources/RopeModule/Rope/Operations/Rope\u002BRemove.swift:133-145 \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 \u0060Sources/RopeModule/Rope/Operations/Rope\u002BRemove.swift:63\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":"Sources/RopeModule/Rope/Operations/Rope\u002BRemove.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1b222f08293ea8af6481a44d41ea05918bfd39ac86f832acc2d1eb764790dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:280-291 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:234-245 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:243-254 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0163cb54056ef4271698218227c61bc4f0f502f7e1e5468e9cfbd165a2d83411"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:320-331 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:274-285 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:284-295 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:288\u0060 calls \u0060available\u0060 and \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:361\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":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f3f5601dd8c213745324d47ec3b5b6e7b151be39b115c909ed9cb4135aa7b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:151-162 | Sources/ContainersPreview/Conformances/UniqueDeque\u002BContainer.swift:85-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 \u0060Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:151\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":"Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1a8bba30b0b8b970d5f317e107d3c58ffce97f11ad0a67f5ca8ff591da1150"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:336-347 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:329-340 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:336\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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e7d276e09b5af9ca98311365112631a70380f2474b17fb3c1d80afd6cad111"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSubset.swift:101-112 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isStrictSubset.swift:130-141 \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSubset.swift"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66f0ef29396aedc09ad5e3a136fa652c280af416b99fb1f711ce3ad8788922b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:550-561 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:572-583 \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 \u0060Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:550\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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d5d4107821b5d450802ac613d65f873200f75def3c6356545f13d03f0af113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isDisjoint.swift:44-55 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isDisjoint.swift:95-106 \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. 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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isDisjoint.swift"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e07d1f55342aba839a2f73ed1dd6b0cfae1c4181dea752f4d05300654590da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:95-105 | Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:151-161 | Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:196-206 | Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:250-260 \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 \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift: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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:162\u0060 calls \u0060next\u0060 and \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:106\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":"Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed693a9051246479e05447bf78e680b08bdd24769254d0b2e55cdc89bc29aa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift:149-160 | Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:151-161 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:136-146 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c6df38e7d32964ed6765b7087e8420ce535034c284385710196580a35f0069"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:66-76 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:35-45 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"14da24da50f05bcf38c36f624037067ad9d18341b63c6624e79940abb626e9e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:78-88 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:65-75 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"a181551ac265d66c8e623081e1e144ca79c8d2b37989cea114eab151442db930"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift:51-61 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInitializers.swift:96-104 \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 \u0060Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift: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":"Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df763c0450efbdf1a2cca0e5d09fc7786d628d26297cc4e017dc19ced230497"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:62-72 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:75-84 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 4 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:62\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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5821a78965012023c5d6096d1da5da8c54c8a8f7829457def2abcfb6052d9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:174-184 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:161-171 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6455e4ae65311b1de2d533d7b22e916035b3e9eac1671ad148a8cb82b7ed4ce7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:154-164 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:142-152 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fb997e10cc256ab293c503828557738a4b9e1a3d04fe8548d322df9ad2408d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:177-187 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:167-177 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"2803f47e2d42cd50135f9fe3e561fb590cd56a09bc3dfa7cec681a43d72adabb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift:70-80 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift:96-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift:70\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 before the matched lines, \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift:69\u0060 calls \u0060mapValuesToVoid\u0060 and \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift:95\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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecee2014c6fe914dc84fd10db6225226cb38cc4eb87f4b3005ab31e0d82b0801"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:393-403 | Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:438-448 \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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:393\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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"7685bf1889b0fc600d6fa2e1f2ec3dd6a4d10ff33d1ff39a7b20161d0470cb8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSuperset.swift:100-110 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BPartial SetAlgebra isStrictSuperset.swift:131-141 \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSuperset.swift"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"140accea92cb0cca8568470f83c4ca59581447c21894374bae799e0594c42a2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift:45-55 | Sources/SpanPreview/MutableSpan\u002BInputSpanHelpers.swift:31-41 \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 \u0060Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift:45\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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"238f4278f3a082a90b570af66247998e851bfa1d3ca3f80a697e087a65ae1d45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift:32-42 | Sources/RopeModule/BigString/Views/BigSubstring.swift:81-91 \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 \u0060Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift:32\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":"Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c1230a2a96345d7bb310a2138a3a9c49fd3ad4499695dce59ea681754f9f2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift:62-74 | Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift:90-102 \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 \u0060Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift:62\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":"Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"7accec4209d2b36b2d1df0cdee8c5395ffabb9ea9c808f43ca6e92e891d172b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/SortedCollections/BTree/_BTree\u002BUnsafeCursor.swift:392-402 | Sources/SortedCollections/BTree/_BTree\u002BUnsafeCursor.swift:447-457 \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":"Sources/SortedCollections/BTree/_BTree\u002BUnsafeCursor.swift"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"04a4f20aba6c7425f1c9db2789814bff29d98a96e8f9c5723801c2836966f760"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:511-521 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:544-554 \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 \u0060Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:511\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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ad7ce29b122ea20b9bca3a0070afe4901012215c57ea978364df2664a65d90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:153-163 | Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:354-364 \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 \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift:153\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":"Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c90b6ff560d0986c8a20d97279ed268a5855d9cce4c85accbc3be5e38e29acb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:206-215 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:186-195 | Sources/DequeModule/RigidDeque/RigidDeque\u002BDeprecations.swift:78-87 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:95-104 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc7a9933d77ffdc277597f73c88692b27b571c36ef7ffa53a4d2b915f2c2646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:143-152 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift:148-157 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural union.swift:191-200 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift\u0060 and \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:143\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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c65175954ea090f7bb16bc9c8f0ed2ccabbff41327b7e0054010178aa77a76c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift:97-106 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:95-104 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift:97\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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dad6dff6e77e7413fcaa3479a1aeaca7d1588595bc21c432734ec6a8a96d63a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:65-73 | Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:158-167 \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 \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:65\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. 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"563cec04b6d75a5238a1f18148833fed1a08ee8272571eb2f7f894c0951ce96c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift:212-222 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BInsertions.swift:107-116 \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":"Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c33008351a936d6321355e784729e66183f735492f46af15e514061c92cdba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isSubset.swift:120-129 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isSubset.swift:92-101 \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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isSubset.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbc2fdb4287044cdfe14924c3b0d56b04ed3aba4b7995afbdf871d827db7e18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/ContainersPreview/Protocols/Container/BidirectionalContainer.swift:188-197 | Sources/ContainersPreview/Protocols/Container/Container.swift:396-405 \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":"Sources/ContainersPreview/Protocols/Container/BidirectionalContainer.swift"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad7a6f4e743fc1d0f17960ebbd8fdf941ae02f3f87638c10528200bc5f532d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:65-74 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:141-150 \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 \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:65\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4d80ddb4183db757f85def6a1b2a18848ee9ac93efe8b5bc3645c26b66450a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:39-48 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift:39-48 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift\u0060 and \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:39\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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8ead91edf88a69926f5812faf7a98875e215da45ef675334cdf06e82f4c407"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:59-68 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift:61-70 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift\u0060 and \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:59\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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8d4b22b4f70c514765a35719a3374855f003378bd66154b3c9e9577947a802"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift:78-87 | Sources/SpanPreview/MutableSpan\u002BInputSpanHelpers.swift:64-73 \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 \u0060Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift:78\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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c28a33098bf578082c8eb419333dc94d54850c385b617aa18af7971adac6b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:166-174 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:269-278 \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 \u0060Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:166\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7e922a03d67de4410eeb24165fb0713d2d9b4ec2818348a589cd48822378a39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:83-92 | Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:97-106 \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 \u0060Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift:83\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":"Sources/RopeModule/BigString/Operations/BigString\u002BAppend.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"702300b968d1c09f1d27b531e0e4540cc9ac813ac35d8b2cb86b28bba6c7cd73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:62-70 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:62-70 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:62\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":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a662174a435ca1f39062720cc722f3467e017445ae31502007c8b88a75b7bf76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift:97-105 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInitializers.swift:174-182 \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 \u0060Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift:97\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":"Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b578c68c08baf917a13922bb37c060b3dfb2774ed7807d51c9c67fb2c3c69eef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift:199-207 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:840-848 \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 \u0060Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift:199\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":"Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"db09fdc2582a746488161a9522fbe99641251eca1f40eb30ed77cb8db862179f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift:135-143 | Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift:155-163 \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 \u0060Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift:135\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":"Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f32e9fa51807726378c368eb95d1db469eb6ff514138d187d7a5ca427bda30e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:124-132 | Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:142-150 \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 \u0060Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:124\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fd696cfe5c4856b035b58ef17c9766d2f7bcf16e73749bb94fe1f4664a498d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:216-224 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:527-535 \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 \u0060Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:216\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":"Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"54289893aa0477bd99282b1724e589b7934072989d8cd70112ccebc626323a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural merge.swift:37-45 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural merge.swift:259-267 \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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural merge.swift:37\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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural merge.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa374c510d41c02cdacaec94142aeb87b592a3077c2c5d739d6336b2abba93cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift:53-61 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:59-67 \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 \u0060Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift:53\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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54caa072da10cd07d4390ebc18bb7b3a0b966e799c5ffb2793edd996244d2f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift:63-71 | Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift:102-110 \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 \u0060Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift:63\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6001a41538b8bbcc99025fea7cb1cdd150c96d855f988c1e69a788af86b354"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:601-611 | Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:852-859 | Sources/DequeModule/_UnsafeDequeHandle.swift:1073-1083 | Sources/DequeModule/_UnsafeDequeHandle.swift:1244-1251 \u2014 before extracting anything, compare \u0060Sources/DequeModule/Deque/Deque._UnsafeHandle.swift\u0060 and \u0060Sources/DequeModule/_UnsafeDequeHandle.swift\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 124 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/DequeModule/Deque/Deque._UnsafeHandle.swift:601\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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4923d356db0fc717030051259dd2d84bfe2f582f08d9e3774784c2991e4287"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:165-172 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:224-231 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:268-275 \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 \u0060Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift:165\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7be0af05af51aa5e362a8899f722c5d48a390473e4c5ba2289b782d5d6f4012"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:156-163 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:139-146 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:156\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41ad11380ead187dd05f66a2370faeccca85badd76025dcbcd3742b16216a46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift:104-111 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BInsertions.swift:52-59 \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 \u0060Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift:104\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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ce22a8967bcff6d23ebc5256fc372f0aa81bf7cae7ad95c2690943b1fdc2ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift:123-130 | Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BInsertions.swift:75-82 \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 \u0060Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift:123\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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInsertions.swift"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"78393be7a9404d2a05509b630156b599c7b1cec90f29df653bc01a0f1c952e6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BResizing.swift:71-78 | Sources/BasicContainers/RigidSet/RigidSet\u002BResizing.swift:68-75 \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 \u0060Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BResizing.swift:71\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 after the matched lines, \u0060Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BResizing.swift:79\u0060 calls \u0060swap\u0060 and \u0060Sources/BasicContainers/RigidSet/RigidSet\u002BResizing.swift:76\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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BResizing.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c1cfaf5aeec126c78d0074f706c07e2426528957f952be08733e5cb5d8867e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/RigidSet/RigidSet\u002BDeprecated.swift:19-26 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BDeprecated.swift:19-26 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidSet/RigidSet\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueSet/UniqueSet\u002BDeprecated.swift\u0060 as WHOLE FILES: 96% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidSet/RigidSet\u002BDeprecated.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad3ca2b5ebe85978dd0590bfd28cc46196655a5dac5fd77ded2abf202cd169df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:134-141 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:146-153 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 4 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:134\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2f3b97316ab7c9ddcea8864a2af5c9fd2e56ceb826e964eb9033a67d391e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:57-64 | Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:104-111 \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 \u0060Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift:57\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":"Sources/BitCollections/BitSet/BitSet._UnsafeHandle.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"99433eb1f949074e22277572211baac97945534d458a451c071d15f4601bd491"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/DequeModule/_UnsafeDequeHandle.swift:874-881 | Sources/DequeModule/_UnsafeDequeHandle.swift:902-909 \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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"43340598984ad1e0eb6db146f982ac2f20451cea4716d43e6239f840c00e90ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/DequeModule/_UnsafeDequeHandle.swift:1493-1500 | Sources/DequeModule/_UnsafeDequeHandle.swift:1513-1520 \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 \u0060Sources/DequeModule/_UnsafeDequeHandle.swift:1493\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"6992999522a67d3eb7df84c18dab5d22671eb85c61a65a17b7b216d1574f93d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift:233-240 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift:232-239 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50e8fc32150a5b0f773b7c235aae7c9a0da9cf7af86011b0f3cacda729af492"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/HeapModule/Heap\u002BUnsafeHandle.swift:219-226 | Sources/HeapModule/Heap\u002BUnsafeHandle.swift:330-337 \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 \u0060Sources/HeapModule/Heap\u002BUnsafeHandle.swift:219\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":"Sources/HeapModule/Heap\u002BUnsafeHandle.swift"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f58a73af6516a789b5e18c3adf7d3259775f597004b7e4efdd72115c60d92b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:163-171 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:171-179 \u2014 before extracting anything, compare \u0060Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift\u0060 and \u0060Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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":"Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc3967115eb5ebbd0956563825c70c20c918aaaafc344480aec06ec026a9e03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:426-433 | Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:469-476 \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 \u0060Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift:426\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe14187bbab445337615f4e6b117e671fec469ff4b2e63857d11a97634bd643"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift:150-159 | Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift:150-159 \u2014 before extracting anything, compare \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift\u0060 and \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccad9f1839e005b78f67967f7325f8f5f1e308c63d74e21a5f7d3769d2a784e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:154-160 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:132-138 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:137-143 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:144-150 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:154\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":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e902d2e394249b89032fad8db31fc3f7cda121f9690df04901256b6744ac78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:218-224 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:265-271 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:529-535 \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 \u0060Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:218\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"227dd44073e3f90bf1c492001620e0f6df9e6389d3c490413b002e4145614d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift:366-372 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:736-742 \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 \u0060Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:736\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. 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"547bdee37f7ad7a4ae8c3be8646f4aaa3ecb7f1a74949c304f7111e323edb324"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:67-74 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:137-143 \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 \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:67\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f430c82a891040f2c90c95f98de37d4386d2b22247007d8812253fe236cda9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:665-672 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:728-734 \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 \u0060Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:665\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":"Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bcb55d5b05d6846b563bbfd891707b3ff148f98811db92f59df9802d0b7661"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:80-86 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:149-155 \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 \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:80\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"376f041c6f2d36eae2aa301108968a355167850cec694b16759c35902b7806e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:169-175 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift:175-181 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift\u0060 and \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:169\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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4726f15e0a9d1ebc79f096ca0f8b2eafc016301239fa7f48353ebb510d95df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:239-245 | Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift:270-276 \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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift: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. 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Insertions.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bdc35c3267ac96dac438bd0afe8a1986399a870538c2b674bd240fb0124ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Removals.swift:161-168 | Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Removals.swift:195-201 \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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Removals.swift:161\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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BSubtree Removals.swift"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"88db9dfce5498c08709ce029ac650ab77f6ee22aa734c4cad5567516629fdf61"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:148-153 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:171-176 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift:153-158 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift:177-182 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural union.swift:196-201 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift\u0060 and \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 68 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 \u0060Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift:148\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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28ffe81a860bc7413c89b836445492644817b338ac8cc9a499c0951c05550d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:66-72 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:136-141 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:79-84 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:148-153 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 4 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:66\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcfa1f68a2c3e6b3d0bfe4b4efd28e2caee32c7b7e149c13baeca551108a899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift:94-99 | Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift:85-90 | Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift:104-109 \u2014 before extracting anything, compare \u0060Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift\u0060 and \u0060Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 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 \u0060Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift:94\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":"Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"87528ee6892cf904f1f63a9fa1d4b95d95de08bf1dfda434f50eafb119215adf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/RopeModule/Rope/Basics/Rope\u002B_UnsafeHandle.swift:189-194 | Sources/RopeModule/Rope/Basics/Rope\u002B_UnsafeHandle.swift:207-212 \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 \u0060Sources/RopeModule/Rope/Basics/Rope\u002B_UnsafeHandle.swift:189\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":"Sources/RopeModule/Rope/Basics/Rope\u002B_UnsafeHandle.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"575ddccb15b2bc20b19d73979982cceb6de0dccf166d99ed8fde5ec64f4c0f9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift:83-88 | Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift:119-124 \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 \u0060Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift:83\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":"Sources/RopeModule/Rope/Operations/Rope\u002BJoin.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf110146d5b14154c13c2a6c09bad47596536ef655b91b29059f02531bebd6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift:97-103 | Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift:88-94 | Sources/InternalCollectionsUtilities/Span\u002BExtras.swift:103-109 \u2014 before extracting anything, compare \u0060Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift\u0060 and \u0060Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 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 \u0060Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift:97\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":"Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"400d16d7e6afb3677b613ce37293964c9868fd958deda1246b4350464ec3153e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/DequeModule/_UnsafeDequeHandle.swift:566-570 | Sources/DequeModule/_UnsafeDequeHandle.swift:585-589 \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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"1baa8d28232cd86e61d0e2a7347401210d0701a6220a142bd303c39607515494"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift:164-171 | Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift:174-181 \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"840620829057abfbdd2a55d093729e79ce264b7aa8afff21d9b72f0d19c6d948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:152-159 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:160-167 \u2014 before extracting anything, compare \u0060Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift\u0060 and \u0060Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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":"Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"3483e0bf7960af3efa62aa0d9c83294121299af23114fc908b0a2c10f4980fad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BDebugging.swift:18-52 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BDebugging.swift:18-52 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BDebugging.swift\u0060 and \u0060Sources/BasicContainers/UniqueSet/UniqueSet\u002BDebugging.swift\u0060 as WHOLE FILES: 97% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BDebugging.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"37995114949f96cf51d76717ef7b3cfefe373b23db8d83205fa0d8b435a39e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BResizing.swift:18-39 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BResizing.swift:18-39 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BResizing.swift\u0060 and \u0060Sources/BasicContainers/UniqueSet/UniqueSet\u002BResizing.swift\u0060 as WHOLE FILES: 96% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BResizing.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0b361eebb0bde94b61d948efb485edf7cd098ad93ef87d651b18a647395745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BDebugging.swift:25-46 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BDebugging.swift:25-46 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BDebugging.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BDebugging.swift\u0060 as WHOLE FILES: 97% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BDebugging.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff9a4b5c28f081eb47f31ceb8c5d2fce89b1ff721ac396239fa08c6aa6a29b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (62 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BKeys.swift:186-247 | Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BValues.swift:187-266 \u2014 before extracting anything, compare \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BKeys.swift\u0060 and \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BValues.swift\u0060 as WHOLE FILES: 92% 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 \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BKeys.swift:186\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 register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BKeys.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1f4afbda40c925694a919bdbabea9eea9b80bca41e7bd665010a095b69a00a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift:301-306 | Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift:42-47 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift:42-47 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift\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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f6b02df7190bb1946783acd4e23af7a72f2cc4ca6c16943bb2d436e7bac5ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift:433-437 | Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift:88-92 | Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift:79-83 | Sources/ContainersPreview/Conformances/Span\u002BContainer.swift:82-88 \u2014 before extracting anything, compare \u0060Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift\u0060 and \u0060Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fe7db975fdf5fe9e17021d3bedd9e2032a6a5c17d7c48bc65f79ec24004922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:23-28 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:28-33 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad59f9fbe76a394ed005fdaf91672eafa5f7f7706f9efc7292d9896c92ec65e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:90-97 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:77-84 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce0120d1b5108742f715466d33bcd97155df650236e5a138be3b4a76c840cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:200-204 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:282-286 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"531c6ab6472504ed068874db85cf4f9d74d18d0df70eb24aad1ad1db386eb804"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:217-225 | Sources/DequeModule/RigidDeque/RigidDeque\u002BDeprecations.swift:117-125 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:135-143 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d69bd1a0ed8579a85717cfa6d31645a1dd3898dfc0851452c0eaabac0298969"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:227-234 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:234-241 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:172-179 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:182\u0060 calls \u0060available\u0060 and \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:236\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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"208d5c91406efee3ddaeb539292aa6eb3f6d5fd34d415a9aab5e8e73bf973f36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:236-243 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:243-250 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73fa211af449ee19575c42a473e967f0bc89f987efe2069f5c4d9444edebf4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:254-262 | Sources/DequeModule/RigidDeque/RigidDeque\u002BDeprecations.swift:191-199 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:211-219 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:182\u0060 calls \u0060available\u0060 and \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:252\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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d87818f3254ea9cc7fa0c1d7453a480e17d81855fb8558a123b4fd57e6416a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:264-272 | Sources/DequeModule/RigidDeque/RigidDeque\u002BDeprecations.swift:227-235 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:248-256 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"761df750c094ae250e6120de24a443e1fd168453db45cd66809e0b1b4108f241"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:274-281 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:306-313 | Sources/DequeModule/RigidDeque/RigidDeque\u002BDeprecations.swift:263-270 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:285-292 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:285\u0060 calls \u0060inline\u0060 and \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BDeprecated.swift:317\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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0092167e9825ded820732d130b29dec9e574b2e68218a4ebdb2c5abf893630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift:283-291 | Sources/DequeModule/RigidDeque/RigidDeque\u002BDeprecations.swift:298-306 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDeprecations.swift:321-329 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b48498ef98e9343ecb7a94311eb3eb7eaef64112f4c81e0ca85f1801b8c8163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BEquatable.swift:33-39 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BEquatable.swift:32-38 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BEquatable.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8b96c2f92ddaf9eb62986ac838bae72991fc41f3eb182e2acc933a733df252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BExperimental.swift:61-68 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BExperimental.swift:74-81 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BExperimental.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"36fb930a63d792f23972bc9a75fec82ac41038e6c9ebaf4ce66c7cb7bf1c5504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift:106-114 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInitializers.swift:116-124 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift:125\u0060 calls \u0060available\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInitializers.swift:133\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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c77e7112951c90edf82fe1fcc5b05d938dcc21e092974038836d3a75bc5b582"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift:169-177 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInitializers.swift:133-141 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInitializers.swift:151\u0060 calls \u0060available\u0060 and \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift:187\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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInitializers.swift"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"a755a467923db736d1e370504aa39acdc3741cb3a9792070c9842f4efd232188"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BRemovals.swift:135-140 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BRemovals.swift:117-124 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BRemovals.swift"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca26ba5a8a46599145aefc817d0ff1c528d8f844254fc55a64f133926d95357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:404-412 | Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift:342-349 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"db3f973e8434262dd38e0c3bf66ed1ab7ab41b88cbed42934df6081641b29981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:482-492 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:360-368 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:372-380 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"661503d47773d184c3413dc99f549e5b817356005c75941e2f07cb09e679744b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:520-529 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:396-405 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:409-418 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"0645f2043f792e8cd7a5519882d3adf68d39f5dea40bfefaf95761521f4494c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift:584-595 | Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift:460-468 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift:474-482 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 81 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe731a852e0aa3b14cfa1a08f5e7dd47b4a7ef0e7b5d607b25feeeb2ab74fbfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BResizing.swift:18-24 | Sources/BasicContainers/RigidSet/RigidSet\u002BResizing.swift:18-24 \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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BResizing.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0631cbf517536b3e6ece228bf953b60012c17df3a07af85712c95301273fa19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift:206-212 | Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:222-228 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:211-217 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5f5e1505a7c0b838587b2b678fce0d1a671bd0fc6d329b36016cff2e52fd85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift:341-347 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift:55-61 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cbaaddae955f463775c25208d146ad2ae355fc902032a888276808790cf37e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift:349-355 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift:63-69 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90695d4bab9ba96bcac8b8b08107e9184bb259a135701974c6f19ceaae31988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift:372-378 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift:84-89 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1610f4412a55839c6aeab22f10d8cfa2e2178b905556b14b77f6f765ac71d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift:389-396 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift:91-96 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3895a6b4305d7f22d78f10cd734ffdf9b17b27d893c0e246f4f7af37f995a731"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift:265-273 | Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:278-286 \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f950973936c2778ef7b4685bc26cace7f22af36ab469da18a9ecf66f483502"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BEquatable.swift:22-26 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BEquatable.swift:22-26 \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":"Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BEquatable.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3108d6e463170aaff8429ad1f5553ca1b24b253da3c20bfdb2cee53aa6f2cd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift:58-62 | Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift:49-53 \u2014 before extracting anything, compare \u0060Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift\u0060 and \u0060Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 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":"Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8eb3fe716d0fbcb6ba773919e0ad157fb5e950ba0fe7ab1d07ce3a8994829d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift:64-70 | Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift:64-70 \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":"Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb779c63e59235980f818e52512b45fe53efb5f182359529191e41d0a51a784"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift:72-78 | Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift:63-69 \u2014 before extracting anything, compare \u0060Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift\u0060 and \u0060Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 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":"Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3173d38bdc0bdcc691648e217ea080e3b720fc7b59eafe6706b6d6f8dab7791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift:80-86 | Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift:71-77 \u2014 before extracting anything, compare \u0060Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift\u0060 and \u0060Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 39 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":"Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e9cae87c52c0a70d0abede56c575842d3afae57a4cbe5a2ead1313ba7d62f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift:27-34 | Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift:26-33 \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":"Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbd4eb30b5250ffef35c3a4061a6813d46b3c912d279cd8d10201153066bbe27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift:269-279 | Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:242-252 \u2014 before extracting anything, compare \u0060Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift\u0060 and \u0060Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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":"Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b8962e91fea4d53003e9fac2a90c2ec7506a550ab5de9ae18a865ca92d53b24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift:289-299 | Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:262-272 \u2014 before extracting anything, compare \u0060Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift\u0060 and \u0060Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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":"Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"60aae3248dbe6971e2890de5981ccb757b835c26eecb19b64eb597c3740dae31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:304-310 | Sources/ContainersPreview/Conformances/UniqueDeque\u002BContainer.swift:165-171 \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":"Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d986d43876bc0ab2b210f2b1561ace95af3f8dacd0803517fc1251b54ce0fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Sources/ContainersPreview/Conformances/UniqueArray\u002BContainer.swift:25-31 | Sources/ContainersPreview/Conformances/UniqueDeque\u002BContainer.swift:27-33 | Sources/ContainersPreview/Conformances/UniqueSet\u002BContainer.swift:32-38 \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 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/ContainersPreview/Conformances/UniqueArray\u002BContainer.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ab9f4b092cdffa26715a722a824bcf9c19542fb0fd417410f171f9aadc86c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): Sources/DequeModule/Deque/Deque\u002BHashable.swift:19-25 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BValues.swift:400-406 | Sources/OrderedCollections/OrderedSet/OrderedSet\u002BSubSequence.swift:375-381 \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":"Sources/DequeModule/Deque/Deque\u002BHashable.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e414fe55d1b9becc9edfbcdaea87830a6bebddb1c9caab315fb4907cad4738a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:272-279 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:264-271 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ffa9a0e80967624f968fd8ddb5e844347c0bafacaa639b4d40b4cdce98c12ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:314-323 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:316-323 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 61 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12c313ad019fba5ef7ed3fa013bc752acfd33bacdc21b0c18564b3d6c8229aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BConsumption.swift:102-108 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BConsumption.swift:85-91 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BConsumption.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BConsumption.swift\u0060 as WHOLE FILES: 91% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BConsumption.swift"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d63935b678c22ba0eb95f844127f8f6a295aed0cf795722961db2e6a7cb192d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift:305-312 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:296-303 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 74 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4fedf5c7a70f1d7b60be0f8cb1b406ab564635b2571b0110dc36faa59b81a31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift:131-135 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift:130-134 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07a0521a943a25845a8e43c0979e8e712c91fc0ce7f8c1a9246d4f0a8c9d483"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift:142-146 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift:141-145 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. 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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e1bb36f4ed63da35455ff629d709111b6cf184b6c2b512636ad4d3e744982e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift:180-186 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift:179-185 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc4f9b2f37be9159c98e9177c4e75adb597f83d16f17b8c26669b8c0ce71f1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift:194-199 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift:193-198 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de8ad70c03b40eb54ded0346cf98b93d7f70fa8f39b165404ddc614639f24ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift:210-214 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift:209-213 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"38af8ae3368428cb2bd71185c76d9885f30ce498b9ac0b9d7e38d6c3a1313a97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift:290-296 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift:356-362 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c4d806eb4d01cab86ad5de838610c58f67e45acd12fab23f4f1339adca6276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift:304-309 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift:370-375 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BCollection.swift"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"99048f68a3b08317579a50d8f153e3b33899321d6a83163ddfc4925dc0fa34ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BFilter.swift:52-58 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BFilter.swift:50-56 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BFilter.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd4adbb6436751ebda3b4fdb80ba2407bc70d36f4f68fb1115a452bdeabe243"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift:154-159 | Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BValues.swift:140-145 \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d0d34c8194e75d68769d38d2414cae7255359de75f6210f152d9f9cc092f2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift:320-330 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BHashable.swift:19-29 \u2014 before extracting anything, compare \u0060Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift\u0060 and \u0060Sources/HashTreeCollections/TreeSet/TreeSet\u002BHashable.swift\u0060 as WHOLE FILES: 96% 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. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BKeys.swift"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b0bedae9b6e04910e1dcdfa00b4b1dea343cceb1183635409eb613f578cd55"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:27-31 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:28-32 | Sources/InternalCollectionsUtilities/UnsafeMutableRawBufferPointer\u002BExtras.swift:18-22 | Sources/InternalCollectionsUtilities/UnsafeRawBufferPointer\u002BExtras.swift:17-21 \u2014 before extracting anything, compare \u0060Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift\u0060 and \u0060Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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":"Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a192244051649347f27f0982891044ac8cbeea31965b08bd6317fbc9a86b654"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:42-49 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:55-62 \u2014 before extracting anything, compare \u0060Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift\u0060 and \u0060Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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":"Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabf14054eff51e3887ea63eb904bb0e7c7f57246ee659748c3dc12761d9af60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.SubSequence.swift:287-295 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.swift:250-258 | Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BValues.swift:252-260 \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 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.SubSequence.swift"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"54de4b08d3e0519f10319e391a5617f983b8dc010400dd3f242f3a5851897ea1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift:68-72 | Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift:68-72 \u2014 before extracting anything, compare \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift\u0060 and \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bd4f967de12d97e3b9c37f6105275da3c3d20502231c200a250d44fabf020c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift:79-83 | Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift:79-83 \u2014 before extracting anything, compare \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift\u0060 and \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a231e04ed3bbba16a28b0a43d5ae4d0c6d65f6a2140cdd4d0d8d62147a54c096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift:90-94 | Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift:90-94 \u2014 before extracting anything, compare \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift\u0060 and \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bd4c552bcd0b24f4f91a1065215b0f32f05065485dfa038a6193fb32441d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift:102-106 | Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift:102-106 \u2014 before extracting anything, compare \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift\u0060 and \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e9aa26d62992a728288f23cf4bd4f8fa7135776a145bb0d0e0aa64d77ec8c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift:116-120 | Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift:116-120 \u2014 before extracting anything, compare \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift\u0060 and \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"b98e327054d50f085c9e15232cbfc14badadb74df68ceea6ddbc0c435f221b46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift:132-136 | Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift:132-136 \u2014 before extracting anything, compare \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift\u0060 and \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8071f7587c2a0bece81aca861ecb00f0b062a5bbe150f07c2645727091fe13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift:395-402 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:788-795 \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8beccd71455dc69b8f2d8ca687565b7d052d2ce544dd0ddab9bcd831d7b0ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift:39-46 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BInitializers.swift:38-47 | Sources/ContainersPreview/Protocols/Container/DynamicContainer.swift:51-58 \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":"Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"66251cb00521329d87992d373dcbfd073373295cd70260571f13f4209ed2cf17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift:380-387 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift:49-53 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"93af3b6aeef7293771ff08c10ab13acb172eb058b4ec13fd66dd1bfad99a1be3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift:357-363 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift:71-77 \u2014 before extracting anything, compare \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c81583cecc0e20d2af259f6363655e407c7417b549c67f6f8e626c6afa2ce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): Sources/BasicContainers/UniqueArray/UniqueArray.swift:142-149 | Sources/DequeModule/UniqueDeque/UniqueDeque.swift:235-242 \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":"Sources/BasicContainers/UniqueArray/UniqueArray.swift"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bf66f6f75cfa304a8e73e6687787878cc94e50c7544b9d402c629e5535765f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BRemovals.swift:56-64 | Sources/BasicContainers/UniqueSet/UniqueSet\u002BRemovals.swift:37-45 \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":"Sources/BasicContainers/UniqueDictionary/UniqueDictionary\u002BRemovals.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe1c5513ebd3de36651f16a094e27a0fb71b9f9cb4da8eb27a577895612d737"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra subtracting.swift:31-40 | Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra symmetricDifference.swift:31-40 | Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra union.swift:28-37 \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 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra subtracting.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c032032748e8a07bb1c595f3bbafc87e81e4a93f3f8f69bb84a79dc7f666ea1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift:202-211 | Sources/ContainersPreview/Protocols/Container/RangeReplaceableContainer.swift:513-522 \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":"Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"b899096062ea9a79b6281a0ec38e179e42449d9582bf6ad032d99229fc0c3ab2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift:239-245 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:236-242 \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9eeeac493af44b239bc4061a19a41223cf453dc86c104de83ae60a33dedd7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:307-315 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift:324-332 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db225004b50dc4a0116d9cbc12c544d3e6a317bdae9cc2e9cb1f5fdfbd13d24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift:361-369 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift:380-388 \u2014 before extracting anything, compare \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BInsertions.swift\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 101 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BInsertions.swift"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d80222092b81662bbe945deae7f8b7f5aa66f8f29e88f9f39f6e127ad769537"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift:30-35 | Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift:30-35 \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":"Sources/DequeModule/UniqueDeque/UniqueDeque\u002BAppend.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e624b065da7d873c5344accd16ec7381c9fff191f953320676e317618c1b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra formSymmetricDifference.swift:50-55 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra formUnion.swift:59-64 \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra formSymmetricDifference.swift"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc442e9288d71e0b981ec51ce78bfb32ce281ac7f2e790e97633b8e928991883"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isDisjoint.swift:52-57 | Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isSubset.swift:60-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isDisjoint.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b1f566b0e8de2b8bb67535d43f0c5e0e46c50cfad56e027706a11b3621bf66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift:15-21 | Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift:15-21 \u2014 before extracting anything, compare \u0060Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift\u0060 and \u0060Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 37 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":"Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef9a49a8ea008bff200f8ec64426ad09862bb8aeb0353c04cc9eda10ff50c52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/RopeModule/BigString/Views/BigSubstring\u002BUnicodeScalarView.swift:269-274 | Sources/RopeModule/BigString/Views/BigSubstring.swift:311-316 \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":"Sources/RopeModule/BigString/Views/BigSubstring\u002BUnicodeScalarView.swift"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c297f91b3e16e0961cb0a40d72b5ba9cb27e7f57fe9a7d6a85d943e6059d4b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary.Index.swift:46-50 | Sources/SortedCollections/SortedSet/SortedSet.Index.swift:78-82 \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary.Index.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16c2a598215e1803882a30c629e1176d95d75187cb63d711cdd77f01546d7e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary.Index.swift:55-59 | Sources/SortedCollections/SortedSet/SortedSet.Index.swift:87-91 \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary.Index.swift"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebdd4a865bf88f2ac88abde483d742c3fcd40f0dcba2749512b52c174343be0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): Sources/RopeModule/BigString/Basics/BigString\u002BContents.swift:171-175 | Sources/RopeModule/BigString/Basics/BigString\u002BContents.swift:181-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060Sources/RopeModule/BigString/Basics/BigString\u002BContents.swift:171\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":"Sources/RopeModule/BigString/Basics/BigString\u002BContents.swift"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45f1e7460fb268f37426593f69a46df3e92e80cb87bb445b87034ebfac58f2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift:57-62 | Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift:57-62 \u2014 before extracting anything, compare \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift\u0060 and \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a9f6b5fa374e4e886bed44ce6142001988ed2fa61a11b1e8681d7b55e0092e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift:173-178 | Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift:173-178 \u2014 before extracting anything, compare \u0060Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift\u0060 and \u0060Sources/SortedCollections/SortedSet/SortedSet\u002BBidirectionalCollection.swift\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 52 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BBidirectionalCollection.swift"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"899ec1682cbeb994dbf86f5ded98bc3bd78d9508a236c3cf69a362346cb5f1b5"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: InternalCollectionsUtilities: InternalCollectionsUtilities: abstractness 0.20, instability 0.00, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"59df969399eba26fb53008340f77e28474d389262feddd5572245752a8389f58"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: SpanPreview: SpanPreview: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8d1d4288fd0faab8ecd5473171a4e50b09c8dff96ea6530a8dedcc89acde0370"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Counted (LCOM4 57): Counted\u0027s methods fall into 57 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 57 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BitCollections/BitSet/BitSet.Counted.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a87f3b2fc62b32107bace86cea996c6528de1c8ac1acb2e5353b24f6e3e2a0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UnorderedView (LCOM4 38): UnorderedView\u0027s methods fall into 38 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 38 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BUnorderedView.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de489add8f06176ff593a55a2af034b6ab2fd6f3750517cc5e8010d34bb983e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Elements (LCOM4 30): Elements\u0027s methods fall into 30 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 30 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.SubSequence.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"388b9b5cf76e4b42f0526efb85777cb9038f1218d0f9433684ccc297193ec550"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: _Word (LCOM4 25): _Word\u0027s methods fall into 25 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet\u002B_Word.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bcfaf2c5ebebb4b2e414fd748b2493fdb1c395aee9ed608b05c2d2f1dd8ff4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Values (LCOM4 23): Values\u0027s methods fall into 23 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 23 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BValues.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aeac6d87100996d1dc86ec33d5b65dbc74c527dda3cccc109d709b5864a7b51"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SubSequence (LCOM4 22): SubSequence\u0027s methods fall into 22 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 22 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BElements.SubSequence.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e4e766a6e35ff4d011236fbfefc5593f1738596f103e482c7555ff2cbde1532"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UnicodeScalarView (LCOM4 20): UnicodeScalarView\u0027s methods fall into 20 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 20 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Benchmarks/Sources/Benchmarks/BigStringBenchmarks.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"819eb8c74674c6ab670b3b82c56ad433c79f20a4b462d0351908393756fa5b13"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: MutableSpan (LCOM4 17): MutableSpan\u0027s methods fall into 17 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a6f62d7bbd7d036510a7617bb3a9e913ce96e3e4e78cc167d4495b273660f2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Keys (LCOM4 16): Keys\u0027s methods fall into 16 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 16 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/InternalCollectionsUtilities/_UniqueCollection.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c48a2e24c60f268d45e489bc6cc011c00e6cb079aa3b227b7374803769c45f0"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UnsafeHandle (LCOM4 13): UnsafeHandle\u0027s methods fall into 13 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 13 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/HashNode/_HashNode\u002BDebugging.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d6168333f3b4cb85fe6e76691f7ee9a11493e83eb6c3002ff83bf014b97764"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: OutputSpan (LCOM4 12): OutputSpan\u0027s methods fall into 12 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 12 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0c24cadf4f1a982b912a1d5bb05b7dc80e7b0c94a1835ad928534e1347829e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Span (LCOM4 10): Span\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/InternalCollectionsUtilities/Span\u002BExtras.swift"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"213aee75a76608ca0fdbc46432252dee783d1978b07a287a4c8b9f3bb3c378f5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UTF16View (LCOM4 10): UTF16View\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/RopeModule/BigString/Views/BigString\u002BUTF16View.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e52ffd9b592ccd763813e1495357b1f807675ee7f03c804bc4afcc6f3f7fce3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: UTF8View (LCOM4 10): UTF8View\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/RopeModule/BigString/Views/BigString\u002BUTF8View.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb39e67bf7060e4b206e16a2df034ba5d9f7be931cb2c0674021cf5ffe878605"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Index (LCOM4 9): Index\u0027s methods fall into 9 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 9 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BitCollections/BitSet/BitSet.Index.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"df54295405dd5cc9b9c8cfd648808fc2a61b2d3634e0a74f64bbd66f30576fea"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Builder (LCOM4 7): Builder\u0027s methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/HashTreeCollections/HashNode/_HashNode\u002BBuilder.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae97627850983e2181fa4b9a4f1941c5016d9a7375d3e1307fd16646a7eef53"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: String (LCOM4 6): String\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/InternalCollectionsUtilities/String\u002BPadding.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"599d12eaf68f5a7e15add8b7671f630f23acf184b9a4e9a3a55b418d73eb894e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Slice (LCOM4 5): Slice\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a7fddeda1a973cd7c08e25fa6e15500e0cc84958318eb3bb047eed3f27f01a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Iterator (LCOM4 4): Iterator\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BitCollections/BitSet/BitSet\u002BBidirectionalCollection.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d139acf58628745b0f752b17f4f4927f8945f72c742ecb096b546e61bf2ad1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StringProtocol (LCOM4 4): StringProtocol\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/RopeModule/Utilities/String Utilities.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff1a0b9a3e7f306f300c30e986295dfd1b237bd7feb480dcc848f7728897f28"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift: Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Benchmark.addBitSetBenchmarks at line 19. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 11:16:20 -08:00\u0027 --until=\u00272026-11-10 11:16:20 -08:00\u0027 --full-history --no-merges -- Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Benchmarks/Sources/Benchmarks/BitsetBenchmarks.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf11ff6acd7769e8107452c7cc0ada9e3059d148a62d3987f36cd6a60bcc29c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift: Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in OrderedSet._move at line 265. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 11:16:20 -08:00\u0027 --until=\u00272026-11-10 11:16:20 -08:00\u0027 --full-history --no-merges -- Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5963c485d8c8341a9be459d87c233460c39d7d5ce520e792b62005c0f6de05c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: Sources/BitCollections/BitSet/BitSet.Counted.swift: Sources/BitCollections/BitSet/BitSet.Counted.swift changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 2 (its worst body is Counted.== at line 217), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C[BitCollections] Fix BitSet intersection doc examples for Range inputs\u201D; \u201C[BitCollections] Fix BitSet.Counted.isEqualSet(to:) rejecting sequences with duplicates\u201D; \u201C[BitCollections] Fix BitSet.Counted.update(with:) not maintaining the cached count\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-12..2026-11-10, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-12 11:16:20 -08:00\u0027 --until=\u00272026-11-10 11:16:20 -08:00\u0027 --full-history --no-merges -- Sources/BitCollections/BitSet/BitSet.Counted.swift\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BitCollections/BitSet/BitSet.Counted.swift"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ce54a0236ab376ca269bdf19888f071efb906be975f173f4d245dc46954360"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 78 significant file(s) lose their only recent owner: Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift, Sources/DequeModule/UniqueDeque/UniqueDeque\u002BReplacements.swift, Sources/DequeModule/RigidDeque/RigidDeque\u002BReplacements.swift, Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift, Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BInsertion.swift, Sources/ContainersPreview/Protocols/Container/Container.swift, Sources/RopeModule/Rope/Basics/Rope\u002B_Node.swift, Sources/ContainersPreview/Protocols/Producer/Producer.swift (\u002B70 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"84e3ed2fe00bd957297c9665a48e899e50bd361c75c78f1e370153eefc7c9dbb"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 5 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (84 single-owned of 372 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 372 of the 621 production source files in this repository met that bar). They are anonymized user #2 (2 file(s)), anonymized user #3 (1 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)), anonymized user #6 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: Benchmarks/Sources/Benchmarks/OrderedDictionaryBenchmarks.swift, Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift, Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift, Sources/OrderedCollections/OrderedSet/OrderedSet\u002BReserveCapacity.swift, Sources/HashTreeCollections/HashNode/_HashNode\u002BInvariants.swift, Sources/BasicContainers/RigidArray/RigidArray\u002BFormatter.swift."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: _modify accessors in RopeModule seem to be broken in Swift 6 mode \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":"Package.swift"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6553399a4af38533296a0040c8afe874644dd30fb54d606c3d06345361dfbf2e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: _modify accessors in RopeModule seem to be broken in Swift 6 mode \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":"[e-mail redacted]"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f2cc82a2764d02421392925bd3a444fbe1babfd5ec8099daa28133b94b3740"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME: uleb \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":"Utils/Debugger/formatter_bytecode.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"47dd538bea38dd993252aa12ff28fe9232f15def4f2f608f0567719844e2a6bf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME \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":"Utils/Debugger/formatter_bytecode.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3dc6d565939ba72644043b8c1a48f192b8fcbdfbbb8a8775e9e4beca826dfb5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME \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":"Utils/Debugger/formatter_bytecode.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e22f68edc30539121b679edbd1957f3f0ee37e49ec6490a1651208105d0ca748"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME uleb \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":"Utils/Debugger/formatter_bytecode.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b706e89d930aa764fe55f33a734306c0fc24af4a501ca519c347edb674f86ae7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME uleb \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":"Utils/Debugger/formatter_bytecode.py"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac234b277551ed3fd6db64b954991de2174638a1411b7451785867955ad83b72"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: # FIXME uleb \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":"Utils/Debugger/formatter_bytecode.py"},"region":{"startLine":622}}}],"partialFingerprints":{"codehealthFindingId/v1":"514ac3d30d5d13a4bb2bd43ae1225f15d4767236c9bc4f77016f0dc7ae9f4669"}},{"ruleId":"D17","level":"warning","message":{"text":"XxxComment: # XXX: Does not handle multiple comparisons, ex: \u00600 \u003C x \u003C 10\u0060 \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":"Utils/Debugger/formatter_bytecode.py"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cde3ac28762ddcf616d912b23192639697c51d55ff1ce3319f4ee8c31c12b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with something better. \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":"Tests/_CollectionsTestSupport/Utilities/RepeatableRandomNumberGenerator.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f3f989cb56a8b329600bcddb335297bb45bfb7146498db30dcc230819d5008"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Properties with borrow accessors cannot initialize locals. \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":"Tests/_CollectionsTestSupport/Utilities/With.swift"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"4656b96e3caccfcbf5f609b20559bd38797112f794e5cc5411777fbd4a0ff8a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Why is this necessary? \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":"Tests/_CollectionsTestSupport/MinimalTypes/CustomBorrowingIterator.swift"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"46999b963cd59411be71ca2840d24cee002a460ddb54bff021efac72f91c11fd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Why is this necessary? \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":"Sources/DequeModule/UniqueDeque/UniqueDeque.swift"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b83bb5ddb6c14ad3bec049cf5e481c076ce5f46232595848b54fa646072e5e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Why is this necessary? \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79b47a2594d8353ee6e2e90ed8f9ccb47443a9aedf878fcb14f8e0c00ef3788"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Fix error reporting. We ought to throw errors instead of trapping \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":"Tests/_CollectionsTestSupport/MinimalTypes/MinimalEncoder.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"360731b0a5f4d4b2f728d35749b656775f9fbfd580d769f86fca3066addf9155"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is rejected: \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":"Tests/_CollectionsTestSupport/MinimalTypes/PureProducer.swift"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1373dcba8afab23c38ca25715fec4f637c9b550171593616ea9fecb8fce618a1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME rdar://150240032 \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":"Tests/_CollectionsTestSupport/MinimalTypes/StaccatoContainer.swift"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf311a7c6ce90adc37d85a7d633f4af53c42639a3fdb1430f803809249acbf5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Port all of the collection validation tests from the Swift compiler codebase. \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":"Tests/_CollectionsTestSupport/ConformanceCheckers/CheckBidirectionalCollection.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc6771fa254c8dbae2bc51605cc57316fa41e8ec2777b566fef08daca2f3f97"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Port all of the collection validation tests from the Swift compiler codebase. \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":"Tests/_CollectionsTestSupport/ConformanceCheckers/CheckCollection.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fa7210aea21a1645e7877bd64dd717dbd14519cf5aa85407db68399df7dc9f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Port all of the collection validation tests from the Swift compiler codebase. \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":"Tests/_CollectionsTestSupport/ConformanceCheckers/CheckSequence.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"277517a3b5687afdb48805025714271657c7207e6a0d7e70e45f99a324f25747"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Port the collection validation tests from the Swift compiler codebase. \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":"Tests/_CollectionsTestSupport/ConformanceCheckers/CheckCollection.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"654fb487a2e32ee8a99a097e024ca2ab44b81a4f96e3aac494d5b41d3abac867"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Port the collection validation tests from the Swift compiler codebase. \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":"Tests/_CollectionsTestSupport/ConformanceCheckers/CheckSequence.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea871ccf7b6614b0705f1e6ec86ba4c16f49daf1e66d71281fecdeec739a508"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add throwing versions of checkEquatable/checkHashable/checkComparable \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":"Tests/_CollectionsTestSupport/ConformanceCheckers/CheckContainer.swift"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"76dd69c21062b479779cc8b9a86611253a97852113cf0fa255cff4a85f4480bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove when CustomStringConvertible starts supporting \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":"Tests/_CollectionsTestSupport/AssertionContexts/Assertions.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52735c40053e794217b9223aefdf9927140ef48dd03cdf99304265b1607bcd6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the better one below \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":"Tests/_CollectionsTestSupport/AssertionContexts/Assertions.swift"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"45d7728937f69132f86f33d76f11072acce1b7b6559b160749b2810d5e07ce21"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use randomSample() from swift-algorithms to eliminate dupes \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":"Tests/_CollectionsTestSupport/AssertionContexts/Combinatorics.swift"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ac9af35f6266f4baeb4d8b2d07b887c362e0c0019345a238d99c15fabb218e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This ought to be a thread-local variable. \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":"Tests/_CollectionsTestSupport/AssertionContexts/TestContext.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a121753167738f2b7e872d8b470acf9588bc8a8f0a3476ae6ee72155916d44f0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \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":"Tests/SpanPreviewTests/InputSpanTests.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd63cd37322eee4f0b0864170638b23f4d3e67dbb8af15ba1c115056091321b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BMap.swift"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec3f16c1830fa7cd0839e66263e9090a86826e3b7831c6b9848e766ffb6de9d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \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":"Sources/ContainersPreview/Conformances/RigidSet\u002BContainer.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eedd23c77ca60c0ea432bfb41bff4806d5ce64d7738393be2a3f7fd2acf014c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \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":"Sources/ContainersPreview/Conformances/UniqueSet\u002BContainer.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3215f0e1320b907138404127881f8ab49287ddcbd08689b6bfea5bd73b0cf2e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BExperimental.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"411f4ef2a60b2cb5c317635bf04cc60c26273e922c810049801bf75cec2ca1a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BExperimental.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c848d90eef92b5808848da0e5a6d52c71d1b6c3ee02653bbe319bf10781648c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: determine how to best calculate the expected order of the hash tree \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":"Tests/HashTreeCollectionsTests/TreeDictionary Tests.swift"},"region":{"startLine":1738}}}],"partialFingerprints":{"codehealthFindingId/v1":"1933eaf931d54e43dc422815e0bccbf87c1d284f04b9828a1a0ba97429720ba6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: determine how to best calculate the expected order of the hash tree \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":"Tests/HashTreeCollectionsTests/TreeDictionary Tests.swift"},"region":{"startLine":1758}}}],"partialFingerprints":{"codehealthFindingId/v1":"281c05565101b07e473929825ee2d5950b8a42247a441ba7539c79d109dac197"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add a specialized \u0060filter\u0060 on Span.BorrowingIterator. \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":"Tests/ContainersTests/Container_Algorithms_Tests.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b3fec879ee8e8949a2e27cc8025f062c219abeb0488ab5865e7f7b80189c6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // producers end up covering the same code paths. (FIXME: Do it anyway) \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":"Tests/ContainersTests/MutableContainer_Update_Tests.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c742fd28b5e31518d0f366b6657629a2d186412bcd4d28d38698ae5863db4d4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // producers end up covering the same code paths. (FIXME: Do it anyway) \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":"Tests/ContainersTests/MutableContainer_Update_Tests.swift"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8345771dca15f1ae29351f1330b62488c25a50f09584f83b4917cf0b46dec6a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Bitwise operations disabled for now \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":"Tests/BitCollectionsTests/BitArrayTests.swift"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"77ec788b1b843cdf03f5821612ae934c2d22a0f7b497e1b170dcdfd884c49122"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Update \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":"Tests/BasicContainersTests/RigidArrayTests.swift"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fecf1966ee37ec1c726d2369931538a92405e9482c985807f20a0faa55367f6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Update \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":"Tests/BasicContainersTests/RigidArrayTests.swift"},"region":{"startLine":1103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d2f861705f242036ac7f3628466aee3fb0a957d82c00f109b50d8592c948a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Update \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":"Tests/BasicContainersTests/UniqueArrayTests.swift"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"398177e357a2e11d1273117f9c5a217e74170a9d49102040fd4092dbbca641d9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Update \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":"Tests/BasicContainersTests/UniqueArrayTests.swift"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"5979add5823b397f54cf52e9ee9c6e5ade8210931c61f76156c0ee2c88ccf33f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Update \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":"Tests/BasicContainersTests/UniqueArrayTests.swift"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"4436bf7467e94d786ba9aeb06c4c4be25c1b32e51674da6d8ae574e5a10de56a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Update \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":"Tests/BasicContainersTests/UniqueArrayTests.swift"},"region":{"startLine":1101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2d52faba09e27eae3a550423b6a8cdf195d9cb8484b333430c012005f722b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"Tests/BasicContainersTests/RigidArrayTests.swift"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1ee5f4434f8db5a02161a802d913721ffca91cc5e7db4feffc9e9cd831d7f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"Tests/BasicContainersTests/RigidArrayTests.swift"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bb16c42f99f5e53ea01192ade964737d9ce95de4607de92e23966b044bd811"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"Tests/BasicContainersTests/RigidArrayTests.swift"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"536bf7bc767d31ec64feae60303866f8025e99a3b470add5c947ef80ec8b8269"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"Tests/BasicContainersTests/UniqueArrayTests.swift"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"6845739d2856d9ebfead8e09ad889de51567e71100b26fdd05b724fdfcd1b361"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"Tests/BasicContainersTests/UniqueArrayTests.swift"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"8626fff03110128362969aefc119c5fcdab2bb92654cd3438b842d7960362cb3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"Tests/BasicContainersTests/UniqueArrayTests.swift"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"175ea258c1301a056829bc9e089e4777f00abf336d2e143eb1a0bebcc5fc129a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"Sources/ContainersPreview/Types/Shared.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"500d6b8e6cc7b2907e6e2835ba6b988eb816130c7b1a08025652c77b05f9686c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BExperimental.swift"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"943d6cb8826ec8e4d111b1fdfcb11359cfe51bdbba5508917e0d11da1b072c74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BExperimental.swift"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3de6e7965e4ae341e9e04232039297f7a7f88a55eb1769b3adffd1b27dfb159"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BExperimental.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3896b9b7bc44c7f51f7dd2485562363e6f1d5733687547fd8fdd77ddfeb83c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use checkHashable when possible \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":"Tests/BasicContainersTests/RigidArrayTests.swift"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9217102fa76d95c862cdf263a35f071e86b5ca7f839163453e004dcd929cc6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use checkHashable when possible \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":"Tests/BasicContainersTests/RigidDictionaryTests.swift"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61116fced29fce85c78271e72533aee3bc4e10e59d1eacc91c99fd2d0daa46b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use checkHashable when possible \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":"Tests/BasicContainersTests/RigidSetTests.swift"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7250a55e1900dcb0b376d65143302466b8150028ac4697aa3a231aa9e1c89e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use checkHashable when possible \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":"Tests/BasicContainersTests/UniqueDictionaryTests.swift"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9eceda94983ee8f16e386f20141f2721e2c7422d5e20ea64067bb591ae3ef7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use checkHashable when possible \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":"Tests/BasicContainersTests/UniqueSetTests.swift"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"af10a83abadcee331959c040df6fbb02f06c32118ad9865dd8cc696c8c4647e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rdar://158440246 \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":"Tests/BasicContainersTests/RigidArrayTests.swift"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f612757d63025aa57670523c72b7ed86d0512214082dab40d77ac0815d42d755"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: //expectEqual(transformed.capacity, c) // FIXME: Would be nice \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":"Tests/BasicContainersTests/RigidArrayTests.swift"},"region":{"startLine":1648}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9407556dccc2aaa9c337423de25ff99c6b1cec293022c0380e24a61f47a625d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Create a separate test suite for BorrowingIteratorProtocol.map, and devise a specific test for .init(capacity:from:) \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":"Tests/BasicContainersTests/RigidArrayTests.swift"},"region":{"startLine":1672}}}],"partialFingerprints":{"codehealthFindingId/v1":"593f36834edc0a6cb39bd12e3caac531a11cf6590b1dc8c55d50a2cfef18cf18"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The language needs to grow up to allow us to elide this \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":"Tests/BasicContainersTests/RigidDictionaryTests.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b26968f9d545ea8c2477dac48d606b0188d7b329cd68562c1d657403af020b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The language needs to grow up to allow us to elide this \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":"Tests/BasicContainersTests/UniqueDictionaryTests.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bb521a05bd89184dae2747d3bf3e7f7faf787358657c7d34d722dbed0795ca"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Sigh, borrow accessors are limited in 6.4 \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":"Tests/BasicContainersTests/RigidDictionaryTests.swift"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"f004516d2c1af08df3f9ac2faa86ccb41aa1c8ee6c943e6b7c0a3149d18fe04e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Sigh, borrow accessors are limited in 6.4 \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":"Tests/BasicContainersTests/UniqueDictionaryTests.swift"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e873b90bc9640fafc21858ea38bdfdce11e04a1ddc801542244df9e33ddc74e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: OutputSpan.removeAll crashes when empty in some 6.2 snapshots (rdar://158440246) \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":"Tests/BasicContainersTests/UniqueArrayTests.swift"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"0883263b5795fe2bc880aa290d2b812f2426e7d64bf5a13b0d55ba3026e0533b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with stdlib implementation when it becomes available \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":"Sources/SpanPreview/MutableSpan\u002BInputSpanHelpers.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03e07d3e0222b0a8ec9e7d23f3c1dca29f1d48227619b70ccbb631602b979f8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with stdlib implementation when it becomes available \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":"Sources/SpanPreview/MutableSpan\u002BInputSpanHelpers.swift"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"157015c76be652a2fb4a5ce026b322167e53d728240979f331284bc72f0fb1fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with stdlib implementation when it becomes available \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"564126cebdf068bfff0099008b9b47d4cb0b67d07760006a6c62669371216aba"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with stdlib implementation when it becomes available \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd3593ccffc0cae5fa71a3820900a4eebf187f56862bd31799bf3a2ca690820"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with stdlib implementation when it becomes available \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db717dca5618f24362e8e7432f9bfeaf42f56860438e7467ede3020d0e0fdf7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with stdlib implementation when it becomes available \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ebc51dbdf27d67296f0fa53c0c42077a7f91fba0d2a82f5338b91050a12633"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace with stdlib implementation when it becomes available \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be5a6ac91cbdc832a70448051ad549601e91b1389e8c7d88cf16dff69bd35fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make sure this calls memcpy when Element is bitwise movable. \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":"Sources/SpanPreview/MutableSpan\u002BInputSpanHelpers.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"651840c23374b22c7a823fc7f90c8b3c4cbf955c2c44c2eda918cddbb4f899db"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make sure this calls memcpy when Element is bitwise movable. \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":"Sources/SpanPreview/MutableSpan\u002BInputSpanHelpers.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a0ca08b6d064b98ed0164c1c05dc7a739d6b62055184b33b90a28c9ad05a0a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make sure this calls memcpy when Element is bitwise movable. \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f4a6e0ee5bcef3f8c4ab93918b63848ad0be4293cba007c8eeb3429e70c5d3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make sure this calls memcpy when Element is bitwise movable. \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45ff4189978126ce8bef8e22319b9aeb1d3a4654b3a0ee9bfb28de00f9b3d4e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: UMBP.moveUpdate(fromContentsOf:) is broken as of 2026-09-17 (rdar://187733648) \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":"Sources/SpanPreview/MutableSpan\u002BInputSpanHelpers.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"854239d2a50ae011bf4072cca4df4ca84ff96ffaceae3c28505f24c170f2c8b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: UMBP.moveUpdate(fromContentsOf:) is broken as of 2026-09-17 (rdar://187733648) \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":"Sources/SpanPreview/MutableSpan\u002BInputSpanHelpers.swift"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6dd4e04dca052f50dd4e9d6d8ab065becd1c7feab90d524db1c77224791a38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: UMBP.moveUpdate(fromContentsOf:) is broken as of 2026-09-17 (rdar://187733648) \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63f4a634d89863072c47128310801987d7e543eeb1b505e3bd711007cc19a3b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: UMBP.moveUpdate(fromContentsOf:) is broken as of 2026-09-17 (rdar://187733648) \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34b97b1e58e1e4c69ec12f626dd4a130c4b3bc2c9f76c524679da02146b8752"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be in the stdlib. \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":"Sources/SpanPreview/OutputSpan\u002BInputSpanHelpers.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf699cd2b6ccf5b61097b098a5f949bd64ab1736d1b22df8fe2df4cb72232a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be in the stdlib. \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":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"663e6179ce810478091b9d93071140d8bac2fd381887953495c19cad77774a81"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be in the stdlib. \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":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b5c8d77ac6379db4a3bf3616e4cb77127b87ce97e39b03b638e75e581559e57"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be in the stdlib. \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":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8097bb7c7e9a424f5b1a96fa3cdadaad90faea1b16f85b3c87570a13308bc3d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be in the stdlib. \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":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5ca9578e98bf78f28c40afaf14f08e5d9caa8a7dcf44cde3bbb273f86e6148"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be in the stdlib. \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":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"53396a25643e7b57dcdeb124bd9320816a5000c997615bccd5e8bb7e903cd582"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be in the stdlib. \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":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe54e6154ebcd2c30908588ab10293016e860233216e37155a33cbf759a67618"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be in the stdlib. \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":"Sources/InternalCollectionsUtilities/OutputSpan\u002BExtras.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"4465dacede029dc47d44226395379a56a4cb44380f67b3a9bad8be75cfa6d393"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize/benchmarking by comparing node identity. \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":"Sources/SortedCollections/SortedSet/SortedSet\u002BEquatable.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"002c4c228ec5854f36e9f0181afd3af5dfc3a0f901479754669c460170de4a26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize to not perform excessive traversals \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":"Sources/SortedCollections/SortedSet/SortedSet\u002BPartial RangeReplaceableCollection.swift"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1959b1e3801caf3fc9a0e2aefedc9da1d231db12e9d0d7eefb9333d240b51a88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: might want to consider uniqueness to minimize CoW copies. \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":"Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0fbfa71b28719dc6c3dca1573a899c2aaab9984343bbda864c351f597a29e0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: could be worthwhile to evaluate recursive approach \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":"Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"63003d2e0d98587a6c06cec4eed7897f75c595507e83efdda7d99639c209abbc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: in some cases, it could be faster to search from the root each time \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":"Sources/SortedCollections/SortedSet/SortedSet\u002BSetAlgebra.swift"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bddf8dafc3a9a6ec8207f650d5d8bb9e6923aa6dd3eb8079fde52c0a6c695a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize/benchmarking by comparing node identity/shared subtrees. \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BEquatable.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f33c2e61bd8c6c82c5804f0686a3f54794e9be73ce867efc1e2fc127890780"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Optimize to reuse dictionary structure. \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary.swift"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf82018c73a6f647359b72b836d0670720e54008c0376bb3543db2f859d2deb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize to use identify fastest iteration method \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary.swift"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3d8b794ef6a0d9434e86d0b4bd949f77241ec35250f28b3e9a3482d25515b7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimize CoW checks \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":"Sources/SortedCollections/SortedDictionary/SortedDictionary.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"284e128cc1e1d7f332d5df3bf39a3efbe1cddc9aca8762e17bd9cdabb36edd08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: further consider O(1) implementation \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":"Sources/SortedCollections/BTree/_BTree\u002BBidirectionalCollection.swift"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"5acbf8044abfb9ae2cbc828cbf36a31a820cbcfa5c2902331a0efc3f60f2eb8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: this might be redundant given the fact the same (but generalized) \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":"Sources/SortedCollections/BTree/_BTree\u002BBidirectionalCollection.swift"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d66baaa7a05c58236d050ffc79f8fc8bbbbc8425f828264644a67b2baef807"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: optimization for searching within children \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":"Sources/SortedCollections/BTree/_BTree\u002BBidirectionalCollection.swift"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f27b8a476c638938ed62bd52e24327584daf6c8a4e98d4d96de59e62d6de1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: potentially use empty storage class. \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":"Sources/SortedCollections/BTree/_BTree\u002BPartial RangeReplaceableCollection.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45b722181bcf0512412752d36040801af09760703e8fe1963c5768d8796422d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement optimized \u0060var indices\u0060 \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":"Sources/SortedCollections/BTree/_BTree\u002BSubSequence.swift"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"da88437125f3251b3874f18ff5a2a66abec2b035bba24e92048c7dc12cef2a1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: implement partial RangeReplaceableCollection methods \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":"Sources/SortedCollections/BTree/_BTree\u002BSubSequence.swift"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee219052f6030ef411cb014c21ac5fbdc681a7fdff065e48330d1d8c9a05afd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It is possible that there is a single transient CoW copied made \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":"Sources/SortedCollections/BTree/_BTree.swift"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bba8f0442d2723747292c11f15f6dd52a054c24dafd3ea3b9268c45868059c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Really? \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":"Sources/SortedCollections/BTree/_Node.Storage.swift"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"f633b42c466978c271139bd3a0721741813ac6ae9249ddc45627b46daac1f9c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: potentially be smarter about using the predecessor or successor. \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf365f8968d960ce8fcf6826b123e9cdedb9c0677132df2d232600afef944ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: performing the remove and then balancing may result in an \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e875db92d4720b2723d43fc3de109ac6f502b5207e6fe77b54a26808a64d9b67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: create optimized version that avoids a CoW copy for when 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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"800767ccdff6abcc330777e92eb3c22598f457176bc0416504c43829dd7015eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: might be more optimal to memcpy the right child, and avoid \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c2c2c26563f10d680c78f616254ccc2d94459a40faf18660e9c12190f8046c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: As part of deletion, we probably already visited the right \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BDeletion.swift"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f720dfd0818a082319c0088bbd592fd90dad2ef88da935b7fb50faa4c9e226"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Potential transient ARC traffic here. \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BInsertion.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"adbd5a8070bf0c08b1b10b76e7047b55211f21bb6d46c084123694b65e87d281"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: potentially extract out this logic to reduce code duplication. \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BInsertion.swift"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"944bf684f705cf99f7dfd8029bf621b249aae2156dd2f380c0ef772e52809117"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: potentially evaluate min(left.children, right.children), \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BInsertion.swift"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"184e28aebf552eb9b4406c76c8214e4c1451065527b429a28118da484b582f6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: adjust counts \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle\u002BInsertion.swift"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcba06d2c65ce587d453aea5740713f06c46736592dd8faecff000956d6db1b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: make this info a conditional_mov \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":"Sources/SortedCollections/BTree/_Node.UnsafeHandle.swift"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd6e801edb510cb6294501cadd60a7e3d2ce5ad4e0c7147b732f36e8932e98c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add fast path for tiny removals \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":"Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77e4b4ff3beeb357d7541d905481f67aa28c2249c03d5e684d617cc8b54fce2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement insert(contentsOf:at:in:) and dispatch to it when bounds.isEmpty. \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":"Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4add740f061f7f51ee287164cbb0d343e87eb77719f0ebbe68f8d2e6092513e1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add fast path for replacing tiny ranges with tiny data. \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":"Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dea11afae2ab342e088301c1c7019147e7301f72974136cac89b4794f672df8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add special cases if newElements is itself a _Rope etc. \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":"Sources/RopeModule/Rope/Operations/Rope\u002BRemoveSubrange.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"568ee2a03e9a0c28f4e5913fb289bfcb824cfeff62769879b47f81a79a07e501"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Replace this probabilistic mess with atomics when Swift gets its act together. \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":"Sources/RopeModule/Rope/Basics/_RopeVersion.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e2b81dd1602c786d70d04e27607460169f7253d6383abc221b1d9c784326c0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Should be \u0060maxCount\u0060 \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":"Sources/RopeModule/BigString/Views/BigString\u002BUTF8View.swift"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c29bb4a1f9674f994616fc78db9e60e2831bc9930725b8979d998abfd0ca2ee8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement properly normalized comparisons \u0026 hashing. \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":"Sources/RopeModule/BigString/Views/BigSubstring.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0b8adc7b61cc371afd5c446415e66d58d9a5503db92bc1ec0fbf389ba5aa1a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement properly normalized comparisons \u0026 hashing. \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":"Sources/RopeModule/BigString/Views/BigSubstring.swift"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"1528de7db214876a877512126d96fabf0852d079fccc9101b1747e07ee4c1103"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement properly normalized comparisons \u0026 hashing. \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":"Sources/RopeModule/BigString/Conformances/BigString\u002BComparable.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f45f246253b5f28f9ed1cb3045f75a59c85ca788a82450a52c93a56d36bbc49a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement properly normalized comparisons \u0026 hashing. \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":"Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17133ec5dfe34aac78bd24dbc8e658b7eb589db60863c443206e22315ed675b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement properly normalized comparisons \u0026 hashing. \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":"Sources/RopeModule/BigString/Conformances/BigString\u002BHashing.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8711a00e8c8a11aef9aeae16aa6a8f241e937eff32762db3b4684998bd631fd7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Even if we keep doing characterwise comparisons, we should skip over shared subtrees. \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":"Sources/RopeModule/BigString/Views/BigSubstring.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f7b3a3bdde61cde17d14eae891bb4e2723fbba0cdd7269b8f4b303bed7ca82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Even if we keep doing characterwise comparisons, we should skip over shared subtrees. \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":"Sources/RopeModule/BigString/Views/BigSubstring.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f91aa777a466a5b18b9120c6b268b81e4d9c2694318531f2745aaece09a74aa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Even if we keep doing characterwise comparisons, we should skip over shared subtrees. \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":"Sources/RopeModule/BigString/Conformances/BigString\u002BComparable.swift"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ba40580001c83d66151708a8b1592fb0aa6c7f21cd592704e45713b88c8284"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Even if we keep doing characterwise comparisons, we should skip over shared subtrees. \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":"Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d18a97899775c8931997f2af6a98ed40ae8917ccf0f9b7f654e8b0421f3b51"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Fast path when \u0060other\u0060 is tiny. \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":"Sources/RopeModule/BigString/Operations/BigString\u002BInsert.swift"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d6db1c5984d9229da26f7d6a61a6fd64f4d7922a534c94e94bedd5ad558d5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Rewrite in terms of \u0060firstBreak(in:)\u0060. \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":"Sources/RopeModule/BigString/Operations/BigString\u002BManaging Breaks.swift"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b5ea7b89bd2e6519e3a1a31ab1a742de673eb6c8fa34dd038f627334ab169c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Don\u0027t split the indices twice -- they are currently split once here and once in 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":"Sources/RopeModule/BigString/Operations/BigString\u002BReplaceSubrange.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc6bd713133f20ea92480feaa0bb09310d8d40934ac7ce8c0b0f98b59335dc9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement a structural comparison that ignores shared subtrees when possible. \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":"Sources/RopeModule/BigString/Conformances/BigString\u002BEquatable.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"01fb17e2d64a0fe84dcbd39b381b5a44b217e3aa977051ef47f3e692362dded8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See if we need direct implementations for these. \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":"Sources/RopeModule/BigString/Basics/BigString\u002BContents.swift"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1092f7aaf8c831bc27e4f3ae6c43264a767285783dfb8c1f519f354417ebf883"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See if we need direct implementations for these. \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":"Sources/RopeModule/BigString/Basics/BigString\u002BContents.swift"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e625d78061b4371dd1ee9ae789a2d817683ec323acdb9d06365a95ca5a81e2a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Do we need a direct implementation? \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":"Sources/RopeModule/BigString/Basics/BigString\u002BContents.swift"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b8af93582fc5ad1ab50c376de5637aab20a0c9da6f6697bf9361cb519c5f8c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is wasteful: if \u0060input\u0060 happens to be a bridged \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":"Sources/RopeModule/BigString/Basics/BigString\u002BIngester.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e4123f997f057beef1f63493852ab66221554507ae25ddf1ec7077d66d47b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: NSString instance, then it temporarily allocates a full \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":"Sources/RopeModule/BigString/Basics/BigString\u002BIngester.swift"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"523768bc99a0874f2761187dcc419cdd1a35213159f6f1ccf4ddcd85624f4e4a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: copy of the (transcoded) input string, only to then copy \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":"Sources/RopeModule/BigString/Basics/BigString\u002BIngester.swift"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d345ada09d2a80c95aca78748c1b050227f20c703f99e8848279b1e574fd7d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: its pieces into the tree later. \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":"Sources/RopeModule/BigString/Basics/BigString\u002BIngester.swift"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3803305f402269eebd655ea99b80bc056b20d106e346594c5d1f78aebd3b10"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We should have a direct ingester path for native UTF-16 data."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/RopeModule/BigString/Basics/BigString\u002BIngester.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74220fdef3239539d443663f389aac3bd9cb0c7300f7dc53a0b48d5fcc89493"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make use of the chunk\u0027s known scalar count to reduce work \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":"Sources/RopeModule/BigString/Basics/BigString\u002BMetrics.swift"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"47d9b3a472d35e1913a89f5b293c63847e468b11ad30a033300f54d73012c87d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make use of the chunk\u0027s known UTF-16 count to reduce work"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/RopeModule/BigString/Basics/BigString\u002BMetrics.swift"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5763c86058ca4366dc792f9fd9d8161ce5f7ddfdf9db219c5e1eaa82b484238f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We only need 48 * 3 = 192 bits to represent a nonnegative value; pack these better \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":"Sources/RopeModule/BigString/Basics/BigString\u002BSummary.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ff1d1ab85c78e5229dc874ee363759e312d633ead76ff36f886392a728580d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement in-place sorting. \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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BPartial MutableCollection.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"22713dca30b378bd698278275cfb7f1801f08c7f921ba7ea3f4c13c807ac823a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rdar://150228920 Exclusive access scopes aren\u0027t expanded enough \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":"Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol\u002BEquality.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"6258320b2021b6b25f8fe42368b4607dc8c49e8cff07cba8028bb825dcfe243a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rdar://150228920 Exclusive access scopes aren\u0027t expanded enough \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BSpanwiseZip.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d77de03ec76a0aaf675994761cc0caf7aa0a6a638c84a4e7140c796349b53d8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Eep; _overrideLifetime(_:mutating:) doesn\u0027t work \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":"Sources/InternalCollectionsUtilities/BorrowingIteratorProtocol\u002BExtras.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2976dd18fb3f3b356f5d75ab574eed2a198936ad199a501becee10804b8f53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Remove @_unsafeNonescapableResult. Instead, the unsafe dependence \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":"Sources/InternalCollectionsUtilities/LifetimeOverride.swift"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e734928168379864fb375b6c0f06ea0aa5aeb9fb253823c81c361590f035b51e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove when MutableRef becomes usable \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":"Sources/InternalCollectionsUtilities/MutableRef.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c210b862950a2c9de756ae6cafb1e7157caa69bfc1c98142282e23618f842b22"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make sure this calls memcpy when Element is BitwiseCopyable. \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1c9e3912c2865e74823fa2f422341c555bb4fd34f323f73a5a06fdccab607d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Make sure this calls memcpy when Element is BitwiseCopyable. \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":"Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"499d25b4c9f04228e7c78ea23ed8f7be2f6068215e3e2dfeea97432c4b26b1e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this when \u0060Span.BorrowingIterator\u0060 becomes actually usable. \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":"Sources/InternalCollectionsUtilities/Span\u002BExtras.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c18a0586be5caf5ea52680c7640e588c876c0c27ce590d524335b29b43dfeaa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Span\u0027s iterator needs to provide a public \u0022slicing\u0022 initializer \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":"Sources/InternalCollectionsUtilities/Span\u002BExtras.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c09a5b82089d5f4ae93bd5c329aef58a29db498734131512715589c953afc01"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This has the proper lifetime declaration but can\u0027t fulfill the Container requirement. \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":"Sources/InternalCollectionsUtilities/Span\u002BExtras.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c852e1db45311285e0d9b21cb77fd2e31b35bf50d84c138d8865c63333645303"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This has the proper lifetime declaration but can\u0027t fulfill the Container requirement. \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":"Sources/InternalCollectionsUtilities/Span\u002BExtras.swift"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e3228eab9b02f25ff06412fbcc0c5ae18b8c91893c7e9ecbdd072489c1f1f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove when we drop Swift 6.2 \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":"Sources/InternalCollectionsUtilities/TemporaryAllocation.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e579eb2f2e1cc0c00a330d54571b11be9904b130c8baf0f1b2a456b3065efa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this once the standard \u0060pointee\u0060 has a borrow accessor. \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":"Sources/InternalCollectionsUtilities/UnsafeMutablePointer\u002BExtras.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7382c8212724e70324c7cd94974b2a64a98e12e27944eb0a2a89e8f400e27fbb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this once the standard \u0060pointee\u0060 has a borrow accessor. \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":"Sources/InternalCollectionsUtilities/UnsafePointer\u002BExtras.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8416f31e0051e31ff0cc6a0e637dfebaacaad7601bfb3e430020dab515ef7dc4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: really? \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":"Sources/InternalCollectionsUtilities/UnsafeBitSet/_UnsafeBitSet.swift"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa92008c0f613a72edaa272e38355d84474c4fe33018e79cdfc4b37c1c18c2e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use bit deposit instruction when available (PDEP on Intel). \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":"Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"165485328eb7ef11280f5c0717122d697ad93bb9dd35ead2c0a26c22a87478fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use bit deposit instruction when available (PDEP on Intel). \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":"Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c5190776e7d32ab9d6261fe1f0d375e905e19cae36ee4386f27fb6d78dbc79"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Use bit deposit instruction when available (PDEP on Intel). \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":"Sources/InternalCollectionsUtilities/IntegerTricks/Integer rank.swift"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ff3f373cd5c3b5fc0444c107b4eea74a63eb1c89fbe44943653662081f2367"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See if a more cache friendly algorithm would be faster. \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":"Sources/HeapModule/Heap\u002BUnsafeHandle.swift"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"659b4e6aceb546ff1ed03cca13b9b6cdf36df133a1a7800ef11d9a349df5e4f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Write a benchmark to verify this heuristic. \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":"Sources/HeapModule/Heap.swift"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"45975f845338ea1a83e8176cc9a4f583814c29ad48b05bebbf645185c8bbd2a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement in-place reductions \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BFilter.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8776b8da3809907132016c94c4b957a14fe1cf1e57d2f4959e3011c1391b8c89"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement in-place reductions \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra formIntersection.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b4664faace180f9617007bfccaffcb9e7abed31ebc2af973e635870380cab18"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement in-place reductions \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra formIntersection.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"36b89d0d27fc96c3bafadb00e5c474599d71d3fd35d358138cefe589e9ae9c38"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement in-place reductions \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra subtract.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ccd7a2af371cdc6d5ec1d98b1fb87ec91895f1bc222b6b576622ff3f3df754"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement in-place reductions \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra subtract.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd4fde9a8aa5f82febf4b99fd7c596d215ef80d3cf795157d431d04d93b40df"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement in-place reductions \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BFilter.swift"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de2d947d229c013845a878af37d3b417602bb745e3c1903fa8db23edb03c0a6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These are non-standard extensions generalizing ==. \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isEqualSet.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"06963bd69bdcb7fcf8ff3b482e322aa9ce529103cbcd51a8bdef28c32886ed1d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: These are non-standard extensions generalizing ==. \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":"Sources/BitCollections/BitSet/BitSet\u002BSetAlgebra isEqualSet.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fe858a78e1d98426633e919f3c6da0601fee6d480a01df2d17373f57852ba31"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Would making this a BitSet of seen positions be better? \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isEqualSet.swift"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a263f1bcc166a742fb8e61bfdbb925e3c7e5802fa3a8dc1e3a783da9d2f574"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Would making this a BitSet of seen positions be better? \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSubset.swift"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a822cae4feb13681310962e27502544ec9e812bec3ce447efcb9642541ec91f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Would making this a BitSet of seen positions be better? \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isStrictSuperset.swift"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"13756c07b21546d4c9f6cc428f4bd53cdf1127124f8b77543768eba9959e1e6f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Would making this a BitSet of seen positions be better? \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":"Sources/HashTreeCollections/TreeSet/TreeSet\u002BSetAlgebra isSubset.swift"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"815353baa8d6ea0c02c95962e75986196ca037850538edfc909b083b590d9b16"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is a non-standard addition \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":"Sources/HashTreeCollections/TreeDictionary/TreeDictionary\u002BInitializers.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cfb8ff2706fb87f1d3828b2dc2c966730b71ef5d757938ed2a6236982a1b82"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider returning nil when we run out of bits \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":"Sources/HashTreeCollections/HashNode/_HashLevel.swift"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ca83ac55d5cbd72fa39cf6173f5d50b92773e578bf494e06ab74e2532eb966"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: \u0060Equatable\u0060 needs more test coverage, apart from hash-collision smoke test \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural isEqualSet.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"6114d3489d7ff5728e26528dbc1aaf12370ab798014fb8ca8e7403e324bbeb6f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider remembering slots of shared items in r by \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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"122fd0f8747644f227d7f56ac3399230a155ec42aa1dd5047de3ce2ce77c47a3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t own its storage; should we dissolve it into RigidDeque? \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":"Sources/DequeModule/_UnsafeDequeHandle.swift"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3ac5ab6b9809afa8c9ba9ff649b872e0e760f77ab7f13b148ad840dc7419cb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add support for segmented (a.k.a. piecewise contiguous) \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":"Sources/DequeModule/_UnsafeDequeSegments.swift"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b7ad1c79b0f44c3351162253d104a2b085f5371b328613f583a2c1191bf310"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the BidirectionalContainer algorithm. \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":"Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca1991ab305048a1d032b8eadd4be418303cebed2ce2a65bf83b9890510250d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the BidirectionalContainer algorithm. \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3eb51806da0baa2aa61af90fe50efaf8a489988c0fb011c17c3673a7f55667a8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the BidirectionalContainer algorithm. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e412af228006f4a1f2171055cb2a0c7fef73bdff289b0626bb7802cfadbb009a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the BidirectionalContainer algorithm. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"0775c86c7c3288ff7e6d3607d17f362cd06ad1281045db2a33c49eaf24c84659"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the BidirectionalContainer algorithm. \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d6c02a9ff9dcd590d51aa70b2276bfc398536036b8a018db07e3f340835b32"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the BidirectionalContainer algorithm. \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"187eed3ea48a95ce9d84cda0a264e935000d54b2644bbc1cc79e22609b062a92"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the BidirectionalContainer algorithm. \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"b24826a2a868cc8d885f96a2356904e0d6bc5d3a432e86af48ae77d48a6503fe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Print the item descriptions when available. \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":"Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDescriptions.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6afb537981121c056b11cca3f5a5d67ea81bdd3bac82a67da77d73df53b8a0f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Print the item descriptions when available. \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":"Sources/DequeModule/UniqueDeque/UniqueDeque\u002BDescriptions.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d990c73a273eb652207c6ec5a53a9cdf7a3ce3e3514b71902bf8a32b26b0c668"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Print the item descriptions when available. \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BDescriptions.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5e5fbaae07f07fa9b97e866848f51ace32bbcd1adc3906f628bb24eb6d975a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Print the item descriptions when available. \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BDescriptions.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc98a0eacebe688c29be61805021bcddc3e25cd0f8734c50e8c1e4e698386aa7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Print the item descriptions when available. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BDescriptions.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa9b4acc73c4daf39574ef1c233bdd231f78e31f829de9ed88f2ceb31998949"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Print the item descriptions when available. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BDescriptions.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64bf40c983a56be341853fe333ba6a21458a6de6d0b026ecfde5de364a38abe"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Print the item descriptions when available. \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDescriptions.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd62368d0ae5fd1c8815089bbd96f6200ea07811877075df55831c6839699b47"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: /// FIXME: Print the item descriptions when available. \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDescriptions.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ca5270a2e87e0247257e992ec6702cc6296372721a6746668c74a0be4c5fc0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If we get a BorrowingSequence.estimatedCount with an exact case, \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":"Sources/DequeModule/UniqueDeque/UniqueDeque\u002BPrepend.swift"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a218f72bd62cc9ad5a1ad869f2677687e7d9288d535f09190d3aa582cdf9ea1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this algorithm; it is already provided by \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":"Sources/DequeModule/UniqueDeque/UniqueDeque\u002BRemovals.swift"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf72eacbcfda2b93e7eb66c7fcbc6adc6d42c1ae262d593c80ddecb1f04a7b5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this algorithm; it is already provided by \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BRemovals.swift"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"34add14d248f4a39ae191e1c16622a1ce59361ecbeb2da17d5c127614ab5aeb0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of a standard algorithm. \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BAppend.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c940c3942cee5aa37549f9b8da992469106d2018541d4c0703844b1e59a378b3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of a standard algorithm. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BExperimental.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe5b9b319c2457ed1d0c0f4a84ca01bbb1f3d817734a59176f43d7e540b14899"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of a standard algorithm. \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BExperimental.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eeefebd4f9187dfad6993a94674bf07c46f1e2460d69a251aad20448e793756"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This works around a Swift 6.5 name resolution issue; see usages below. \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BConsumption.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfbb03ccca7f37f5673a16eaa7eb46ca433a13a3a2acd3af6850a205009ce37c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We have to use our own MutableRef because the standard one \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BConsumption.swift"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"43260a80b9439fa6efdf43986b7c864ce2b3c34d31e9022fa6052b14947d58e8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We have to use our own MutableRef because the standard one \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f280da9c69b49ef385d281de34df0bdcd46682f273f15cfd7a98116c21eb8e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This ought to be using \u0060Element\u0060 directly, but when the package is \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BConsumption.swift"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f8144eba64e2b0c933e7e423f2acd59638fba0ab78dd40bd38bbaaf1fcf481"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be written as \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BConsumption.swift"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ff2d1b27294250f574788d4ade371f25bb64d17814920b79074a4403fd48276"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This needs to be written as \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"080ec1b4face97e0fbcf95c68afa85c4b6e389f1a97a35bd393dbd50da4e846d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of a standard algorithm. (Or not -- prependable containers may not be worth a protocol) \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":"Sources/DequeModule/RigidDeque/RigidDeque\u002BPrepend.swift"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"354e0ffcbcdbbc961bd5d249d52d5ccf52770553524d8d09e62ec93c6c915448"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement \u0060partition(by:)\u0060 by making storage contiguous, \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":"Sources/DequeModule/Deque/Deque\u002BCollection.swift"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e218828f74a9ca0a3a9aa28d361c0cab716cf5a3a832da9fd93f5a46d029818"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Rotate storage such that it becomes contiguous. \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":"Sources/DequeModule/Deque/Deque\u002BCollection.swift"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"8be6445953142feaa45d60a65989547de751cde6d2a969f8f3bd4f41fad519f4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Implement storage shrinking \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":"Sources/DequeModule/Deque/Deque\u002BCollection.swift"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"789528d33205a2ef1e2934d42bb7b190b40d04fc231bab3625c81f555f5b1adb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add direct implementation \u0026 see if it makes a difference \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":"Sources/DequeModule/Deque/Deque\u002BCollection.swift"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed9d881bac166d0520fbb835fcb5a2d3dd09fa111110ed5aa615411cee0f289"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add this to the stdlib on BidirectionalCollection \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":"Sources/DequeModule/Deque/Deque\u002BExtras.swift"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c357335e5e519d90b415d7504c29ced82564ec469856a655a5d8047b47240fa"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Can we avoid hacks like this? If not, perhaps \u0060_Box.storage\u0060 should be tail-allocated. \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":"Sources/ContainersPreview/Types/Shared.swift"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe73fd12fd8399c5bcaa2f7be4ebec7f54699781d83c202615d1ad3c516b497"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not be necessary \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":"Sources/ContainersPreview/Types/UniqueBox.swift"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbb887e883c74699072ec735f1827d15358bb141d470bef5744f58550ec3d52"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: _unsafeImmortalize does not work here, and MutableRef has no immortal initializer \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":"Sources/ContainersPreview/Types/UniqueBox.swift"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"88274825b50df8548c15c2d21e1178e0ecd16dafb46c8bd1c2f3d904b2e94ac5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not work with SuppressedAssociatedTypesWithDefaults \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":"Sources/ContainersPreview/Protocols/Producer/Producer\u002BFilter.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55ac527b33420109b611bb2bb53cdf8845ba4963c0fc16a4ccac0dcb5a8053d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not work with SuppressedAssociatedTypesWithDefaults \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":"Sources/ContainersPreview/Protocols/Producer/Producer\u002BMap.swift"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"2173184165547d316c5696180934ece14d48e55b51916f8c2cc12cc1dbb2d28e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Why declare Escapable? \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":"Sources/ContainersPreview/Protocols/Producer/Producer\u002BFilter.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebbfa298b281cbf94df7ed2ec16e6cef0767759c30114dac5695bd1d912f804f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Why declare this? \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":"Sources/ContainersPreview/Protocols/Producer/Producer\u002BFilter.swift"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a357251d29b3eac92da10dbac3dff7505545138f57e21b634f36f9a8023e74e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We could also just define a direct implementation that avoids the closure. \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BCopy.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf109d5285f8328da4f2bd4248a9fb1a478d35dd6a9a4b46621b183719135f4f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: isIncluded should be allowed to throw \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BFilter.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"725175cb36814a8b016d055913e00a1e202e4a0f6604e47f5d03f916327932ce"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: isIncluded should be allowed to throw \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":"Sources/ContainersPreview/Protocols/Iterable/Iterable\u002BFilter.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c84a97ddfe2be6ef56c2823ba5929aced448a57d6aaabf8370719a3852c8b0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: isIncluded should be allowed to throw \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":"Sources/ContainersPreview/Protocols/Container/Container\u002BFilter.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e09966903b5a3f222b6d17b711a19d04ecc60b6e356533483c2396c6e768566"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: isIncluded should be allowed to throw \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":"Sources/ContainersPreview/Protocols/Container/Container\u002BFilter.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcc6592f3d677e28bd7c4b96b8b1827b2914673ea3e745d09decde3142ca03a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Sendable \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BFilter.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"072adbdc7ad06251b1672e8295efcafe07790cbe2555224bd45505aeb5092d5d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Sendable \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BMap.swift"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c28c37b8e18076968d8121338cb36dec48e399e3f8d81c3ef77e8066c0be1e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Sendable \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":"Sources/ContainersPreview/Protocols/Iterable/Iterable\u002BFilter.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"875cad9917c1a3b6d9ca873e6d02fd7ae0111926ae62da3e12f3397f7b1f9dc1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Sendable \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":"Sources/ContainersPreview/Protocols/Container/Container\u002BFilter.swift"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b349a0b8c2607ca7c045b9c47e3c5421149ed56d53358978aa9655b7e2dfb2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is quite inefficient compared to Container\u0027s filter \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BFilter.swift"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97897cdec9625d5c9db38734c67a6f3b57e62a64f499df62e0c03a3b840657a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060map\u0060 should allow \u0060transform\u0060 to throw, and not just \u0060Self.Failure\u0060. See \u0060_map2\u0060 and \u0060_map3\u0060 below. \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BMap.swift"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25def947f2773e4a17c57435014c95094ab8bc3398e85ce4195761af01502fc"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Conversion from non-throwing to throwing closure should be implicit \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BMap.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57444a13f5a047155f8a366a2630a156fadcca22caedd94ee17fd9abe62f993"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can\u0027t overload on the type of error thrown. \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BMap.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a0f4ecb7c3f0b5a661997e3eaf32f3151d8377a592e1c8b70f2758f67012bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We can\u0027t overload on the type of error thrown. \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BMap.swift"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2cdde06ab01b6e42626a7bc99dbc836d12e774c1e95aeca2a68cb8259fd10af"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Iterator\u0027s ill-conceived skip(by:) fails to report the position that triggers errors \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":"Sources/ContainersPreview/Protocols/Iterable/BorrowingIteratorProtocol\u002BMap.swift"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"398abaf18437de72b9e97ad7fce4e0b9c8ccbbd3332f88f5220b16ddd37e5fbf"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: The predicate should be able to throw an arbitrary error type, \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":"Sources/ContainersPreview/Protocols/Iterable/Iterable\u002BElementsEqual.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58fca087832b6f5fa8c8bbee42f33dda8e966ca77c93a445d32d4f5fb20e5f3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not require Other.Failure == Failure; but we cannot \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":"Sources/ContainersPreview/Protocols/Iterable/Iterable\u002BElementsEqual.swift"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc516f6d9373fc775f9ba37960110a17bbfbfe658f8fa5e80d35a6dd3ef9884"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should not require Other.Failure == Failure; but we cannot \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":"Sources/ContainersPreview/Protocols/Iterable/Iterable\u002BElementsEqual.swift"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"96da6532f62786785b9526b3150da4f3ed03a1703f1127c695a65de9508c6af8"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ambiguity with Sequence.filter \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":"Sources/ContainersPreview/Protocols/Iterable/Iterable\u002BFilter.swift"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"6055c0bc7591e3e67583f667a7270aad0561670b099bd86a4ad90c48f7fc756d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ambiguity with Sequence.filter \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":"Sources/ContainersPreview/Protocols/Container/Container\u002BFilter.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a288669b2048af25e8f260211210ff23cfdc6d00873a10499ebd721653f848"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Support for ~Escapable \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":"Sources/ContainersPreview/Protocols/Iterable/Iterable\u002BFilter.swift"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead6caa4a5ac7533d2e895290700e9489c09190ce985542c310ef5ed99c38b80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: The primary use case does not need this to throw; do we need to allow that? \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":"Sources/ContainersPreview/Protocols/Drain/Drain.swift"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c76678cb3bde1806dfc05808346f90d8e8fea65460cd7460a0d72ceeaa30470"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Compiler crash when this declares throws(Failure) \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":"Sources/ContainersPreview/Protocols/Drain/Drain.swift"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6f7f593f53d36708219b191f4ca2e28b7c80a3ba3e7dc264d3a5322573d8706"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider avoiding using \u0060@_nonoverride\u0060, reducing witness 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":"Sources/ContainersPreview/Protocols/Container/BidirectionalContainer.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e832084ac309c235a0691b449580e5c2fca6a586f35c2b5f78acfa30fc40ac5"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Consider avoiding using \u0060@_nonoverride\u0060, reducing witness 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":"Sources/ContainersPreview/Protocols/Container/RandomAccessContainer.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fcc037b8c7d5ff2f5a623d22acaa4e0984fb7d9f16fc088dee95a7c02492e0d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add ambiguity resolvers against BidirectionCollection algorithms. \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":"Sources/ContainersPreview/Protocols/Container/BidirectionalContainer.swift"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"d95b16483350e7387cc32ec40337c314bd277e25f88ef9b8fb879dce11061458"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This does not allow escapable Bases \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":"Sources/ContainersPreview/Protocols/Container/Container\u002BFilter.swift"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f34162ceb890d4bf12d0745fb1bd37b9d9d3e25b7d47bde83cd23c44432d4c9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: We need Container to define a default value for BorrowingIterator, \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":"Sources/ContainersPreview/Protocols/Container/Container.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0993e44975f9b5ec752a74e2628632223042a25b7339a24b95e1775f880b7bb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Ideally Index should also be required to be Hashable. \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":"Sources/ContainersPreview/Protocols/Container/Container.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"303e9c3a0f4fe817214e198ef442c98157b51b8006f9d33c5926df00056b1720"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If we discard the separate BorrowingSequence abstraction, then we \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":"Sources/ContainersPreview/Protocols/Container/Container.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"91dd541d3e30528a8e2a6212cb8857352de8cbbe619ef5d29937d8ca2bcf88b6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060inout\u0060 needs to be \u0060borrowing\u0060, but Span\u0027s needlessly limited iterator makes that unworkable. \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":"Sources/ContainersPreview/Protocols/Container/Container.swift"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b143bfb3faa0639be328c9efd22d0e96b0e92ee491a4e627c23a86d44234ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Now that Index is Comparable, this should probably become the protocol requirement. \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":"Sources/ContainersPreview/Protocols/Container/Container.swift"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbf0b7e0063d87df79c03c53d345ec9a0ff35d791a6852606dc599b8aba9082"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add ambiguity resolvers against Collection\u0027s algorithms. \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":"Sources/ContainersPreview/Protocols/Container/Container.swift"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5736300a17a468f166736bd1ffa78adf5d4cccecdcf3d4ed788b1c514da2a60a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should validate that the iterator belongs to this container. \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":"Sources/ContainersPreview/Protocols/Container/ContainerIterator.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"63695d42d3a218ee4f982f8078387b489a3562a4567e58711d8624c67256bf09"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This doesn\u0027t support nonescapable Bases \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":"Sources/ContainersPreview/Protocols/Container/ContainerIterator.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e20cd6ed465cdf3235a7384df2f94c4bdaa6e827f13225c94e17aa639ed470"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: we cannot convert from a borrow to an inout dependence?! \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":"Sources/ContainersPreview/Protocols/Container/ContainerIterator.swift"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4cf94b3c41bdd222a931f198139606954b22f65c32c908ea455ea8fb2e76db"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: If we aren\u0027t modeling bidirectional iterators, then this should \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":"Sources/ContainersPreview/Protocols/Container/ContainerIterator.swift"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1db49c49c6948e39d45161adf16fda1962b6bba44256452810973abc0ea310"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060consumeAll(where:)\u0060 \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":"Sources/ContainersPreview/Protocols/Container/DrainableContainer.swift"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8f256a900df0cafd2de93eed45dd67cbbf4c74f6a17d5b2ddc7017ccfc2a5f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060removeAll(where:)\u0060 \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":"Sources/ContainersPreview/Protocols/Container/DrainableContainer.swift"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff06f6157f2bcce53feee9a37aaa42204fde3c7f295c00a45b3684b0a69b070"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Figure out if it would be possible to add the container-based \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":"Sources/ContainersPreview/Protocols/Container/RangeExpression2.swift"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"291c686ec447e3a057eef45fe9e0a770765554be85670b5cb524fdc2e33d2b6d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060it\u0060 is borrowing \u0060span\u0060, not self \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":"Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1590ca674f9f7f36305f7cc84064ee14797e36a8c6cf728e9f9abaa2213e2ea"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060makeBorrowingIterator\u0060 would be borrowing the temporary \u0060span\u0060, not self \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":"Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"dadf4a754dbc6290232251f748df9d552fa9ce4a7f93d01bf5ee815b770eb9b4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060makeBorrowingIterator\u0060 would be borrowing the temporary \u0060span\u0060, not self \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":"Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d97a1e01cfc9c12e04a6cf6f011cad7802285d3155bdbbdf1990e89956ce7f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: \u0060makeBorrowingIterator\u0060 would be borrowing the temporary \u0060span\u0060, not self \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":"Sources/ContainersPreview/Conformances/RigidArray\u002BContainer.swift"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78df09e69339f55ebc6024d2ce13445d9c0e94a557625d1fe0f14e91a3fb6da"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: rdar://183153655 OutputSpan\u0027s Iterable conformance requires Element to be Copyable \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":"Sources/ContainersPreview/Conformances/OutputSpan\u002BContainer.swift"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d28f04154b9a1b1ad5248ce5de1274aa780e0d220ec5a6abfd9cd33008ba98"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should validate that the iterator belongs to this deque. \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":"Sources/ContainersPreview/Conformances/RigidDeque\u002BContainer.swift"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91a2bff87c3adfd34cc1655aa7cc356cd4cf2633f38d62e40536ec8469185b2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: SpanIterator needs to provide public \u0060base\u0060 and \u0060position\u0060 properties \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":"Sources/ContainersPreview/Conformances/Span\u002BContainer.swift"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"510c8a5d32f1fc862826baa54f81d623e670ca96748b687cca08a3839c8727dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This is slower than it should be because it is moving elements \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":"Sources/ContainersPreview/Conformances/UniqueDeque\u002BContainer.swift"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"430281c463990416c0da94b67234c477f2956fbf6031666d543f4af216dfe392"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Bitwise operators disabled for now. I have two concerns: \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":"Sources/BitCollections/BitArray/BitArray\u002BBitwiseOperations.swift"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5893afcb352ccfca618a1c9b4ded8da7cf1ecc6e40eb1aadd18f67f4308ce908"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add maskingShiftRight(by:in:) and maskingShiftLeft(by:in:) for shifting slices. \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":"Sources/BitCollections/BitArray/BitArray\u002BShifts.swift"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"88fef883043dc731e0bc7cdb14b39077f3bd6ea6497638cfa4e4472e8109dd24"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove in favor of the generic RRC algorithm \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"668770b24f81ac2359c9cc59a40b4166eb3829bec6c371daec764efcd80be1d1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add _append(copyingContainer:), forwarding to the same method on RigidArray \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BAppend.swift"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87e367e5020120729f9ee3e2a64d3820c51984700a20ff1acef5aa600273904"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe5316d93000457340a9b4de67658721cd81d6a74f8b6b2096a1de0f1ee0820"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78d2454717000ce78ba67500d10e41ec969afe512ba5bb0456b874544464997"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"5231b87dc112dab8e5f1f17ab6e55d7c5f46fe7df228f11b74b12c68c829ba1c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5cfa24adc62b270743246153b831b39994353f68e7471e184cd18899c11041b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8380ab0a6b7ced177b7df9130fbbbb543da528d49998f5f0bced6542a02cb868"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b70d24248ed7d6975c9653f5c239d5764a2a1263f660dbdf9918cd87b1c76ae4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"676a1d52696ac1eb447640f29172aed25a4e3197d7e826a83e5a93e4731134b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"3725864ce77238df9cb99e7ce9c7057fe9ade74ed7a179ec9b8951d413e2f05b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a1aa43ea6a212281251af27231116b35c3ab3b282f38fae0488559dd060d6d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bad386004ba73e5bfbfcaf183c6cef4ab02ddb9772bfa93d44e0eb1ce34385"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c52994ad213c70f865643f5cd1f99da82b51939f63f6b56619fbae98c246f2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba9ce1f61c86184e545585bb9b062ef89daf0348d61542daad87e886fca89a4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7ad826a52bfa13995b0431736c0889d91736842cf80731a9cd25a6eb645876"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove when InputSpan starts conforming to RangeReplaceableContainer \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef21fc05633183e5c4f645d535ad1f3e1b543f9adefdbf2a38dc0775415afc1b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove when InputSpan starts conforming to RangeReplaceableContainer \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"98357a023d5a5c877e633392fddb190c94ee8b34f537aebdd51480914d114d2b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove when OutputSpan starts conforming to RangeReplaceableContainer \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7f1b74846733cd2fcd92754a3133567e3ba363d15828c2c13aa744baac7e9c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove when OutputSpan starts conforming to RangeReplaceableContainer \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37550d0c27cb595a7e143fe3e992b79261a216f11d6e2760c3eb2d71083d3e9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this -- RangeReplaceContainer already has this algorithm. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BInsertions.swift"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"2698d78a92eb2fbc0211db685cc216124bdae023e0c5623028eef076d850f368"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the DrainableContainer algorithm. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BRemovals.swift"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a14733ba6aca244d91256472a6178f03501acc1e689eb91d316a21f9d38200"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the DrainableContainer algorithm. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BRemovals.swift"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"5321b0ccb566d9e18418f7e4cd52ef9f660c59a137a731565bab6ea22477674b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the DrainableContainer algorithm. \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BRemovals.swift"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0640be3ed378f409f62c4c5890bd9a24aeffb81d516f979ddfe6c7d54fe5c8d"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the DrainableContainer algorithm. \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BRemovals.swift"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0051bb3af41adab63d3d35babe2072d7403a0314b5ce0a0ed83b44cc0e4e7c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Avoid moving the subsequent elements twice on resize. \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":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BReplacements.swift"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"303806463cec38ee00a89f41bb8dabeddcfa5fa5fba26a3be01e19feedc6107f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Language limitation as of 6.3; this should not be needed here. \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":"Sources/BasicContainers/RigidSet/RigidSet\u002BInitializers.swift"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b82fe18c04d05cedabd5ea91e6dc17310cf31fec56efc4811b62f786bf44565"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Language limitation as of 6.3; this should not be needed here. \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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BInitializers.swift"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ea256b9f6fad209672324fcc137aadd39b2ae0cd65c57ea0a3baece4ecc384"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This struct really just wants to be a tuple. \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":"Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"298f8fcd1e0061c92e64083a153d0c8dbc0f457a0c3bfce50054c50d991895b7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Instead of getting temporary buffers, we could place the new \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":"Sources/BasicContainers/RigidSet/RigidSet\u002BInsertions.swift"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"389df74f81774e7f99d6e1e79a9bcb934e70774f43a3fcb5d7816df7216cdfa9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Only mutations are unsafe \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":"Sources/BasicContainers/RigidSet/RigidSet.swift"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"89d4e080896dec52dbdd8e697e88c075319bf717b8ce97c782d403ca3dd6d556"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Only mutations are unsafe \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":"Sources/BasicContainers/HashTable/_HTable.swift"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"24a962dc01aaf580f6a81390626853cceeaf3188877a6e5bf2a7121dfe18b79c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Only mutations are unsafe \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":"Sources/BasicContainers/HashTable/_HTable.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9401a97967f68789b2050015b08361740a23501e8cf24969220e12c4e855db97"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This should be declared mutating and update stored properties. \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":"Sources/BasicContainers/RigidSet/RigidSet.swift"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"427a830ae910685364caa630e4a437b805cecad5970b8d245b2731ccb522b565"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: See if using (the real) \u0060struct Borrow\u0060 would make sense here. \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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BIndex.swift"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e818624468758f43524885a513815787c20ae0232034050e2db8d081d4556e"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: This iterates over the bitmap twice: once in \u0060self._dispose()\u0060, \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":"Sources/BasicContainers/RigidDictionary/RigidDictionary.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4942cfea7182f42d6662733d127d4f08d9cb43bdd7e0800bb5eb54ed96dde54"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this when \u0060InputSpan\u0060 starts conforming to RangeReplaceableContainer \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"acddb563cff8f0235ba64a528b8ee935dfe8e4c371b8f2f328c065d65daa86e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this when \u0060OutputSpan\u0060 starts conforming to RangeReplaceableContainer \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"347c90287d4ff12449293a91d6125f6398027a481fbde085d8eb1b9955060391"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this; RangeReplaceableContainer provides a more general algorithm \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BAppend.swift"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a102dc319a8a39bc6ad7a390413e24f531e5b192b62bcf0ed7fb4b18cb34e4"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove when references have been flushed \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BDeprecated.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8e5ad89b9be454fb865314bab9c13632d2883b3245a1eb268b860e6d948c7b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add this when/if SE-0499 gets implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDescriptions.swift"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c5f13827e4289890da40ea7bf79ca9c889e5e7ac706e19becb071004669ee0"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add this when/if SE-0499 gets implemented."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BDescriptions.swift"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e852779ae01fce60b9664d9eb66589e3b337937871fd8459aa1bb75ba381b9"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of a generic algorithm over consumable containers \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b9a9d05638eead62ea06a04c64966136a554e68b7700f51ddf22824ac90c48"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this -- RangeReplaceContainer already has this algorithm, \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BInsertions.swift"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cd7e8528af23d38316987871f56f0b2146b6effc3188544688e7eaaf7dabd9b"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the generic algorithm over DrainableContainer \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbbdbffec91cc9ce3dbcbf3d70c91af450b4478383d8b3a1b9a25f1e53619e6"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove this in favor of the generic algorithm over DrainableContainer \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":"Sources/BasicContainers/RigidArray/RigidArray\u002BReplacements.swift"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"5035fd3d7ae8bb8bbe0a2ec6994a4498a3c02395633efba9f67f5dac64bc6ae3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Stop using and remove this in favor of \u0060edit\u0060 \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":"Sources/BasicContainers/RigidArray/RigidArray.swift"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e50f3ff4101a1afc2613e045d13d450c2466afe3815a5202fb0b59f7a89201"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove after 27.0 releases \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":"Sources/BasicContainers/HashTable/_HTable\u002BDeprecated.swift"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc30e081069d2c06f44c92cccc4760387f6f41065a9cdef37f63c025fd86dcae"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove after 27.0 releases \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":"Sources/BasicContainers/HashTable/_HTable\u002BDeprecated.swift"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0852e48aa523d551d7c477aea1bd4ad306771c81de8cb84c710370d488950de7"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove after 27.0 releases \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":"Sources/BasicContainers/HashTable/_HTable\u002BDeprecated.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0ab53b824a20541be586ea9cf10e9fbe6103dc71c03d5c10a6ca03335ff887"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Remove after 27.0 releases \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":"Sources/BasicContainers/HashTable/_HTable\u002BDeprecated.swift"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b5d7722a746ef268c8f398772a5edc0fdd0e2c394a2ec542db249065a8601fb"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // (FIXME: Try it and see.) \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":"Sources/BasicContainers/HashTable/_HTable\u002BRemoval.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc157cd56cb606bdb0e2550edc79dd4155479c3d466f43d4eb20c1eb33afc2dd"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME: Add a reservedScale for UniqueSet/UniqueDictonary \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":"Sources/BasicContainers/HashTable/_HTable.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e037a8c63bb183143da21411c4b89e986bb43c9697f54d315ad2bb8b51a18b"}},{"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 \u0060Utils/Debugger/FormatterFixtures/Package.swift\u0060 makes this repository a deployable product (line 39)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Utils/Debugger/FormatterFixtures/Package.swift"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee7fe211822cea3de8711907141ede860226e9a92b9c089de1648ce92f490187"}},{"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":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"3bf6d9903590779ead48e34b980321f7b50e0c7a4c2e47ef53a9f782fba2df36"},"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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"6985eada467f770b5c377495cfc3c726964ee54a4489713d8e52ebf4419fed72"},"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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"e98c5a6962305d24477d5b999dac0ee2d8bcf2435f7cbd9f362b53760a6f026f"},"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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"e67a562232b1fd2f4cbf52339635156357247036b1bcf3259d276f2c8e4ca275"},"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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"35309f094f5b859a6bb1d8fc4d37946cf609cf3a6287e26a475473b08b555b47"},"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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0a38e99c3a3d3be1bed243a51bea949f239340918fcff4354cbfa47893aba14f"},"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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"70127ebd344ee058690e9cc6a5ce30a816f9d40df64601835e4865829924289c"},"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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"428f067c43abffd6b5161f685be81af560aa9725dcee5312b15f208b78ad9ece"},"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"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"a192da2e98942e27f4b5791265ff1c8f05727967d8ce1b4a97572ee257507567"},"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":"cf91664577273de2d210bb344e16aa144402dac7f54473d849957c0aaae9e4a4"},"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":"7cbbf4df9dd6cf280dea6d4ae229cf81b125559ab2290d4249e69d701ff2d3d9"},"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":"816bd02f34a8f2999e3dce7bb4611c2372fc096fd5c8a01dcb9646373b3003eb"},"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":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 1 of 372 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 372 of the 621 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: Sources/OrderedCollections/OrderedSet/OrderedSet\u002BDiffing.swift. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"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":"Sources/OrderedCollections/OrderedSet/OrderedSet\u002BDiffing.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fa938c6321b05a362c81d5a4b55c81445ff8ea0909114d40f8ceec09b01723"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: RigidArray\u002BContainerOperations.swift \u2192 UniqueArray\u002BContainerOperations.swift, BidirectionalContainer.swift, Container.swift, RigidDeque\u002BContainerOperations.swift, UniqueDeque\u002BContainerOperations.swift: \u0060Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift\u0060 changes together with 5 other files \u2014 \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift\u0060, \u0060Sources/ContainersPreview/Protocols/Container/BidirectionalContainer.swift\u0060, \u0060Sources/ContainersPreview/Protocols/Container/Container.swift\u0060, \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift\u0060, \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"edf788da159632f0c24c519b5931376427138bcb20cd0f119f7de0bcc6d67d4d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: UniqueArray\u002BContainerOperations.swift \u2194 UniqueDeque\u002BContainerOperations.swift: \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift\u0060 change together 100% of the time (11 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060e75f053e\u0060 Update MutableContainer (at that commit the files were still \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainer.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainer.swift\u0060); \u006095395ad9\u0060 Add BidirectionalContainer.spanBoundary(before:maxDistance:limitedBy:\u2026 (at that commit the files were still \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainer.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainer.swift\u0060); \u0060e70b4df2\u0060 Introduce Container.nextSpan(after:maxCount:limitedBy:) and make it t\u2026 (at that commit the files were still \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainer.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainer.swift\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b5e28b2285f0d8397c99c285523e2866397991c9d5741c1aa5859751ac24b1"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: RigidDeque\u002BContainerOperations.swift \u2194 UniqueDeque\u002BContainerOperations.swift: \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainerOperations.swift\u0060 change together 100% of the time (11 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060e75f053e\u0060 Update MutableContainer (at that commit the files were still \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BContainer.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainer.swift\u0060); \u006095395ad9\u0060 Add BidirectionalContainer.spanBoundary(before:maxDistance:limitedBy:\u2026 (at that commit the files were still \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BContainer.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainer.swift\u0060); \u0060e70b4df2\u0060 Introduce Container.nextSpan(after:maxCount:limitedBy:) and make it t\u2026 (at that commit the files were still \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BContainer.swift\u0060 and \u0060Sources/DequeModule/UniqueDeque/UniqueDeque\u002BContainer.swift\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90dfb28d7dcd29e4f581dbe122bdd228d100b15e6986d38aaeca8aef9320ef0e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: UniqueArray\u002BContainerOperations.swift \u2194 RigidDeque\u002BContainerOperations.swift: \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BContainerOperations.swift\u0060 change together 69% of the time (11 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in different directories, but in this ecosystem the namespace is declared in the FILE, not by the folder \u2014 so the two may well share one namespace and reference each other with no import for this pass to see. Read the pair before acting: if one derives from or overrides the other, the dependency is explicit in the type declaration and the co-change is definitional; if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE and the thing to add is a comment saying so; if they simply belong together, co-locate them; if none of these holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u0060e75f053e\u0060 Update MutableContainer (at that commit the files were still \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainer.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BContainer.swift\u0060); \u006095395ad9\u0060 Add BidirectionalContainer.spanBoundary(before:maxDistance:limitedBy:\u2026 (at that commit the files were still \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainer.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BContainer.swift\u0060); \u0060e70b4df2\u0060 Introduce Container.nextSpan(after:maxCount:limitedBy:) and make it t\u2026 (at that commit the files were still \u0060Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainer.swift\u0060 and \u0060Sources/DequeModule/RigidDeque/RigidDeque\u002BContainer.swift\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"Sources/BasicContainers/UniqueArray/UniqueArray\u002BContainerOperations.swift"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab7da659dcb93ba3e28331797a253b290f5b10b834e5c590a409abe96e6c19f"}},{"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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"P2","level":"warning","message":{"text":"No structured logging: No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page \u2014 but when a run fails on a user\u0027s machine, neither they nor you have anything to read."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s Swift pack (Swift/Xcode) (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/pull_request.yml"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bounds.lowerBound \u003E= 0 \u0026\u0026 bounds.upperBound \u003C= count\u0060 appears character-identically in 3 files \u2014 Sources/DequeModule/Deque/Deque\u002BCollection.swift, Sources/DequeModule/RigidDeque/RigidDeque\u002BRemovals.swift, Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift. 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":"Sources/DequeModule/Deque/Deque\u002BCollection.swift"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c0e006f6bf77cbc83ae562c5d8ba111cbfbbf5d99adb952c533974706385a7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bounds.lowerBound \u003E= 0 \u0026\u0026 bounds.upperBound \u003C= self.count\u0060 appears character-identically in 2 files \u2014 Sources/DequeModule/Deque/Deque\u002BCollection.swift, Sources/DequeModule/_UnsafeDequeHandle.swift. 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":"Sources/DequeModule/Deque/Deque\u002BCollection.swift"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42083bed8bdcc222b4d526dcdadbd625653643679ead29dd56a10a411cf8a6c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bounds.lowerBound \u003E= startIndex \u0026\u0026 bounds.upperBound \u003C= endIndex\u0060 appears character-identically in 4 files \u2014 Sources/RopeModule/BigString/Views/BigSubstring\u002BUTF16View.swift, Sources/RopeModule/BigString/Views/BigSubstring\u002BUTF8View.swift, Sources/RopeModule/BigString/Views/BigSubstring\u002BUnicodeScalarView.swift, Sources/RopeModule/BigString/Views/BigSubstring.swift. 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":"Sources/RopeModule/BigString/Views/BigSubstring\u002BUTF16View.swift"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"23aafa22019eb674771dcb7ca5b01f94107c423d83da43e7081077e187073904"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compiler(\u003E=6.4) \u0026\u0026 UnstableContainersPreview\u0060 appears character-identically in 52 files \u2014 Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift, Sources/BasicContainers/UniqueArray/UniqueArray\u002BConsumption.swift, Sources/ContainersPreview/Conformances/InputSpan\u002BContainer.swift, Sources/ContainersPreview/Conformances/MutableSpan\u002BContainer.swift. 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BConsumption.swift"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0de693a1c9fd81dbcce44a5769ebc16ed49e0f33cfe94cb87c4e5a27769e782"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compiler(\u003E=6.4) \u0026\u0026 UnstableContainersPreview \u0026\u0026 UnstableHashedContainers\u0060 appears character-identically in 3 files \u2014 Sources/ContainersPreview/Conformances/RigidSet\u002BContainer.swift, Sources/ContainersPreview/Conformances/UniqueSet\u002BContainer.swift, Sources/ContainersPreview/Extensions/RigidSet\u002BExtras.swift. 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":"Sources/ContainersPreview/Conformances/RigidSet\u002BContainer.swift"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"db970ca2e56f6ad9d1d091c406eccfb4251d4050c2bbf87fa6fab1089139867c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060compiler(\u003E=6.4) \u0026\u0026 UnstableHashedContainers\u0060 appears character-identically in 47 files \u2014 Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BConsumption.swift, Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BDebugging.swift, Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BEquatable.swift, Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BHashable.swift. 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":"Sources/BasicContainers/RigidDictionary/RigidDictionary\u002BConsumption.swift"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65d4984d81d717eddb51117fc693d5014d58bea21b7f91b88609e266491e8a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060destination \u003E= 0 \u0026\u0026 destination \u003C= count\u0060 appears character-identically in 2 files \u2014 Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift, Sources/OrderedCollections/OrderedSet/OrderedSet\u002BMove.swift. 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":"Sources/OrderedCollections/OrderedDictionary/OrderedDictionary\u002BMove.swift"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4130adaaf5d2941c519d7c31f8089552c597bc5dd188eb819f00c0f1f42bb72"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060position \u003E= startIndex \u0026\u0026 position \u003C endIndex\u0060 appears character-identically in 4 files \u2014 Sources/RopeModule/BigString/Views/BigSubstring\u002BUTF16View.swift, Sources/RopeModule/BigString/Views/BigSubstring\u002BUTF8View.swift, Sources/RopeModule/BigString/Views/BigSubstring\u002BUnicodeScalarView.swift, Sources/RopeModule/BigString/Views/BigSubstring.swift. 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":"Sources/RopeModule/BigString/Views/BigSubstring\u002BUTF16View.swift"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf908315cc8e664c04dabebc1d8716f19b4f0711dba1a9b0a9cb0fbec889381b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previousElement == nil || previousElement! \u003C element\u0060 appears character-identically in 2 files \u2014 Sources/SortedCollections/SortedSet/SortedSet\u002BCodable.swift, Sources/SortedCollections/SortedSet/SortedSet\u002BInitializers.swift. 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":"Sources/SortedCollections/SortedSet/SortedSet\u002BCodable.swift"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff74167302a74c5f1b6aa4f3e3de45067a9933ea535855c94e62ad345836bf36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060previousKey == nil || previousKey! \u003C key\u0060 appears character-identically in 2 files \u2014 Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BCodable.swift, Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BInitializers.swift. 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":"Sources/SortedCollections/SortedDictionary/SortedDictionary\u002BCodable.swift"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc1569b46658e39f075608ed88701a03825ea5770760e398d94bd8b70ac569f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060range.lowerBound \u003E= 0 \u0026\u0026 range.upperBound \u003C= count\u0060 appears character-identically in 2 files \u2014 Sources/BitCollections/BitArray/BitArray\u002BRangeReplaceableCollection.swift, Sources/BitCollections/BitArray/BitArray._UnsafeHandle.swift. 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":"Sources/BitCollections/BitArray/BitArray\u002BRangeReplaceableCollection.swift"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b69b67179b49796c4db7f345f24fdb22e99aaae65e5df52ff11f3277fa9df9b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060range.lowerBound \u003E= 0 \u0026\u0026 range.upperBound \u003C= self.count\u0060 appears character-identically in 2 files \u2014 Sources/BitCollections/BitArray/BitArray\u002BCopy.swift, Sources/BitCollections/BitArray/BitArray\u002BRangeReplaceableCollection.swift. 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":"Sources/BitCollections/BitArray/BitArray\u002BCopy.swift"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1848fabbb40e0665d04bfe352f61317900c6004dedeffeecdbfd0fb528e56e2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060range.lowerBound \u003E= _bounds.lowerBound \u0026\u0026 range.upperBound \u003C= _bounds.upperBound\u0060 appears character-identically in 2 files \u2014 Sources/RopeModule/BigString/Views/BigSubstring\u002BUnicodeScalarView.swift, Sources/RopeModule/BigString/Views/BigSubstring.swift. 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":"Sources/RopeModule/BigString/Views/BigSubstring\u002BUnicodeScalarView.swift"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b387d4f4994134fa10cbeb0b1ba92cc6e9b75c31b875daf9026ebe4af4a521a9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060scale \u003E= Self.minimumScale \u0026\u0026 scale \u003C= Self.maximumScale\u0060 appears character-identically in 2 files \u2014 Sources/BasicContainers/HashTable/_HTable.swift, Sources/OrderedCollections/HashTable/_HashTable.swift. 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":"Sources/BasicContainers/HashTable/_HTable.swift"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34a429ca038944fe663c632e08c599b2063227372c129a5479ddd74c7242a0d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.isCollisionNode || other.isCollisionNode\u0060 appears character-identically in 5 files \u2014 Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift, Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural merge.swift, Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural subtracting.swift, Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural symmetricDifference.swift. 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":"Sources/HashTreeCollections/HashNode/_HashNode\u002BStructural intersection.swift"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d5ad5507737c74c714866353ef0215beff2724b5816fabd86a59540344d332"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sourceIsContiguous \u0026\u0026 targetIsContiguous\u0060 appears character-identically in 2 files \u2014 Sources/DequeModule/Deque/Deque._UnsafeHandle.swift, Sources/DequeModule/_UnsafeDequeHandle.swift. 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":"Sources/DequeModule/Deque/Deque._UnsafeHandle.swift"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d2fe908090e0a758543bdde8487a8fc0bea0ccb069214ed1f0549cbc2bd8f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start \u003E= startIndex \u0026\u0026 start \u003C= endIndex\u0060 appears character-identically in 4 files \u2014 Sources/RopeModule/BigString/Views/BigSubstring\u002BUTF16View.swift, Sources/RopeModule/BigString/Views/BigSubstring\u002BUTF8View.swift, Sources/RopeModule/BigString/Views/BigSubstring\u002BUnicodeScalarView.swift, Sources/RopeModule/BigString/Views/BigSubstring.swift. 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":"Sources/RopeModule/BigString/Views/BigSubstring\u002BUTF16View.swift"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd51fcce5dd1235388f42325f9544ba6683e782ab616d60d3c566f739f4e4b01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subrange.lowerBound \u003E= 0 \u0026\u0026 subrange.upperBound \u003C= count\u0060 appears character-identically in 5 files \u2014 Sources/DequeModule/Deque/Deque\u002BCollection.swift, Sources/DequeModule/RigidDeque/RigidDeque.swift, Sources/DequeModule/_UnsafeDequeHandle.swift, Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift. 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":"Sources/DequeModule/Deque/Deque\u002BCollection.swift"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf1f08a0b136279c597ee8627f353d89122d10afea6afcf376f46323f49a4e12"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060subrange.lowerBound \u003E= 0 \u0026\u0026 subrange.upperBound \u003C= self.count\u0060 appears character-identically in 3 files \u2014 Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift, Sources/BasicContainers/RigidArray/RigidArray.swift, Sources/InternalCollectionsUtilities/MutableSpan\u002BExtras.swift. 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":"Sources/BasicContainers/RigidArray/RigidArray\u002BContainerOperations.swift"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ac94352922897ee764015ee4b061315d99714f3c1afd4fa9efe02b9e3b1d87"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060unsafe (self.baseAddress == other.baseAddress) \u0026\u0026 (self.count == other.count)\u0060 appears character-identically in 4 files \u2014 Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift, Sources/InternalCollectionsUtilities/UnsafeMutableBufferPointer\u002BExtras.swift, Sources/InternalCollectionsUtilities/UnsafeMutableRawBufferPointer\u002BExtras.swift, Sources/InternalCollectionsUtilities/UnsafeRawBufferPointer\u002BExtras.swift. 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":"Sources/InternalCollectionsUtilities/UnsafeBufferPointer\u002BExtras.swift"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4850322d5a5f8e97654206ec38b18f5aca6a2c3d5163790a491087d54b8c74cb"}}],"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-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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.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-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"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."]}]}