{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"id":"D33","name":"JS/npm Dependency Vulnerabilities","shortDescription":{"text":"JS/npm Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D33","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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"]}},{"id":"D38","name":"OSV Dependency Vulnerabilities","shortDescription":{"text":"OSV Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D38","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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"V1SpanConverter.processAnnotations (cyclomatic 40): V1SpanConverter.processAnnotations has cyclomatic complexity 40 (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":"zipkin/src/main/java/zipkin2/v1/V1SpanConverter.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5441c0187284bd9d4450245441ac0a25ee304781e29b80c5d06ba4d18697a98"}},{"ruleId":"D1","level":"warning","message":{"text":"putTrace (cyclomatic 40): putTrace has cyclomatic complexity 40 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/dependency-linker.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad9f02ba06bfcc599fc83e6a029fbf8ec06159d7e76767b791285619cb7a9ae"}},{"ruleId":"D1","level":"warning","message":{"text":"V1SpanMetadata.parse (cyclomatic 38): V1SpanMetadata.parse has cyclomatic complexity 38 (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":"zipkin/src/main/java/zipkin2/v1/V2SpanConverter.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06bb73b6d03d7fd41e662cf63b90a227652308cea0c75cb77e326a50e012733"}},{"ruleId":"D1","level":"warning","message":{"text":"parseAnnotationRows (cyclomatic 31): parseAnnotationRows has cyclomatic complexity 31 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-row.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa2e161ad6c294dbe5c1e67faed31b35b295c26864e54e73f824dca7efafc12"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyLinker.putTrace (cyclomatic 30): DependencyLinker.putTrace has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/DependencyLinker.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"178092003a04e3c54a067e7d7a460420105f15d53b652475dc70c2adeb8960da"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryRequest.test (cyclomatic 29): QueryRequest.test has cyclomatic complexity 29 (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":"zipkin/src/main/java/zipkin2/storage/QueryRequest.java"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc31af09208b0e088c21a0560d053edad1b494c8b06f0981b9c5c350b6b3a7b5"}},{"ruleId":"D1","level":"warning","message":{"text":"V2SpanReader.fromJson (cyclomatic 27): V2SpanReader.fromJson has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/V2SpanReader.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae8ef24f17d954db3b0302183a3ef2490fce81c4926368412e65030a66382f2"}},{"ruleId":"D1","level":"warning","message":{"text":"DependencyLinkV2SpanIterator.next (cyclomatic 26): DependencyLinkV2SpanIterator.next has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/DependencyLinkV2SpanIterator.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf19dbd231fea9b8354e5a866676e1f8ccee6631705af0f64984dd58092ea9c"}},{"ruleId":"D1","level":"warning","message":{"text":"CassandraSpanConsumer.accept (cyclomatic 25): CassandraSpanConsumer.accept has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/CassandraSpanConsumer.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa23b7d83621f756e1b36c7fce96aa4a75b06a2f90a8bbfbda2f7e449870bbb3"}},{"ruleId":"D1","level":"warning","message":{"text":"V1SpanConverter.processBinaryAnnotations (cyclomatic 24): V1SpanConverter.processBinaryAnnotations has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/v1/V1SpanConverter.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a49dfe299a2981b0d2387ccd888049b8b8146a55666eecd1e3ea54dd82ca6f"}},{"ruleId":"D1","level":"warning","message":{"text":"WriteBuffer.asciiSizeInBytes (cyclomatic 23): WriteBuffer.asciiSizeInBytes has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/WriteBuffer.java"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96b29ce27fe3982189d04e02ab5502edc00446fecd785f074ab9a7a9fb93070"}},{"ruleId":"D1","level":"warning","message":{"text":"JsonSerializers.parseSpan (cyclomatic 22): JsonSerializers.parseSpan has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/internal/JsonSerializers.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b39d6d2a45efa357e7e5ee8024bc412eed1715045728f31cee68a564ceea364"}},{"ruleId":"D1","level":"warning","message":{"text":"mergeV2ById (cyclomatic 22): mergeV2ById has cyclomatic complexity 22 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-cleaner.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a937dc48bd79f434a48d7e3c0e04736b24123bef0923648a5878d28a2bc77a"}},{"ruleId":"D1","level":"warning","message":{"text":"JacksonSpanDecoder.parseSpan (cyclomatic 21): JacksonSpanDecoder.parseSpan has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/test/java/zipkin2/codec/JacksonSpanDecoder.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8436c2085a7eb440baf0bf92da1cfe2167d8086fed49f16ab03d7ffd98cf08"}},{"ruleId":"D1","level":"warning","message":{"text":"Trace.merge (cyclomatic 21): Trace.merge 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":"zipkin/src/main/java/zipkin2/internal/Trace.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"280e76ce4905ad872cf0321252e15e7963312500d673e8066b9df77b6080f355"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 21): (anonymous) has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-row.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff725c69083a0caef9a8bb5b73a88b6396f0a48aa440498c2f60f2a169655684"}},{"ruleId":"D1","level":"warning","message":{"text":"merge (cyclomatic 20): merge has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-cleaner.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd82368031360dc3cde46ee605ff3b68700edf9d2ccd2196738b332163f1967"}},{"ruleId":"D1","level":"warning","message":{"text":"SpanField.readValue (cyclomatic 19): SpanField.readValue has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/Proto3ZipkinFields.java"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e5d77c759ee2228c7bddf923fbcbaffeae7881a771fafe673c7e6e06fbfa96"}},{"ruleId":"D1","level":"warning","message":{"text":"Endpoint.writeIpV6 (cyclomatic 19): Endpoint.writeIpV6 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":"zipkin/src/main/java/zipkin2/Endpoint.java"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6a9b47474297bfe83647421a43a2d060f8cd6a7587d05688cd51543de7c032"}},{"ruleId":"D1","level":"warning","message":{"text":"1.fromJson (cyclomatic 18): 1.fromJson has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/test/java/zipkin2/codec/MoshiSpanDecoder.java"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"361d53a0ed5b2803803a71a78d0b34700fa1dcd6f8d1913a8991f1d85f4ca63f"}},{"ruleId":"D1","level":"warning","message":{"text":"ProtobufSpanDecoder.decodeOne (cyclomatic 18): ProtobufSpanDecoder.decodeOne has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/test/java/zipkin2/codec/ProtobufSpanDecoder.java"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"040bd9f584e0f3261f5c0e9a38aa28bb0083180e645ea8b6e0ebbc311d4f4fef"}},{"ruleId":"D1","level":"warning","message":{"text":"WireSpanDecoder.decodeOne (cyclomatic 18): WireSpanDecoder.decodeOne has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"benchmarks/src/test/java/zipkin2/codec/WireSpanDecoder.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a66347f1fa28ade520fdee94b090b94dcd8e7fa0066aa3f2125174675b1d378"}},{"ruleId":"D1","level":"warning","message":{"text":"BulkIndexWriter.write (cyclomatic 18): BulkIndexWriter.write has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/internal/BulkIndexWriter.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03033c7d28a70c13da358fabc49256f4d6ddb560af8339f7ca432cc06c6aec3"}},{"ruleId":"D1","level":"warning","message":{"text":"V1SpanWriter.sizeInBytes (cyclomatic 18): V1SpanWriter.sizeInBytes 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":"zipkin/src/main/java/zipkin2/internal/V1SpanWriter.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d21538b8ae69082e3368a9758b365ce1f52098603fb2f9efa2293fb55307eb"}},{"ruleId":"D1","level":"warning","message":{"text":"V1SpanWriter.write (cyclomatic 18): V1SpanWriter.write has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/V1SpanWriter.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6a8b2767519f6a01f1c79d969d1edec869e1b40e09a214c675f67a9d212d62"}},{"ruleId":"D1","level":"warning","message":{"text":"BatchInsertSpans.apply (cyclomatic 18): BatchInsertSpans.apply 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":"zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/MySQLSpanConsumer.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07e6246cfc55289e8560f51fcf31fb2cbf1ad4b46bbb3787bdc7037c16b9bed"}},{"ruleId":"D1","level":"warning","message":{"text":"Endpoint.detectFamily (cyclomatic 18): Endpoint.detectFamily 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":"zipkin/src/main/java/zipkin2/Endpoint.java"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"9456bb3d70330c1c92da25f1ee6c8521382943525478eb7d059513adfcef88d6"}},{"ruleId":"D1","level":"warning","message":{"text":"tryMerge (cyclomatic 18): tryMerge has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-cleaner.js"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4259eaf6bf4fb1b1ac2448fc325b16fa300635e2b8912766d5bf9021829ff0"}},{"ruleId":"D1","level":"warning","message":{"text":"getClockSkew (cyclomatic 18): getClockSkew has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/clock-skew.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b339e015f6945afa580435e423625958b0a62948a37236cc7138d266829a87"}},{"ruleId":"D1","level":"warning","message":{"text":"ThriftCodec.skip (cyclomatic 17): ThriftCodec.skip has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/ThriftCodec.java"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9ae27a2a783beff94b1756c5573d6e27ce3766c1e1b0ff8e2cb60fc0ceb01c"}},{"ruleId":"D1","level":"warning","message":{"text":"Endpoint.textToNumericFormatV6 (cyclomatic 17): Endpoint.textToNumericFormatV6 has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/Endpoint.java"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dfa3e364fce466baebbec53276a6fa44ca430da66e0008abfb364280371abf"}},{"ruleId":"D1","level":"warning","message":{"text":"clean (cyclomatic 17): clean has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-cleaner.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4099694b1ce0f7886d7458630eb256255926df0d6e29a28c28077429c8d5c01b"}},{"ruleId":"D1","level":"warning","message":{"text":"V1JsonSpanReader.fromJson (cyclomatic 16): V1JsonSpanReader.fromJson 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":"zipkin/src/main/java/zipkin2/internal/V1JsonSpanReader.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"aade34ce2c2232119db6b5a97036a6dff4f1860b3219fbf8305d178dd493e58c"}},{"ruleId":"D1","level":"warning","message":{"text":"V1ThriftSpanReader.read (cyclomatic 16): V1ThriftSpanReader.read has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/V1ThriftSpanReader.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8abe193aef75fc57f2ad96067141c1feefd473abb84e00fde64fb06a7dac155"}},{"ruleId":"D1","level":"warning","message":{"text":"BinaryAnnotationReader.read (cyclomatic 16): BinaryAnnotationReader.read 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":"zipkin/src/main/java/zipkin2/internal/V1ThriftSpanReader.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5968f019d7ec033a1bb3c6a45bd2e2e5e5f4b5e7b49f6587f03d4d4e7088010d"}},{"ruleId":"D1","level":"warning","message":{"text":"V2SpanWriter.sizeInBytes (cyclomatic 16): V2SpanWriter.sizeInBytes has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/V2SpanWriter.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"a687fd2a00910a5da796f7365bcc0720ebeb509688d652aa670770c1277cafd5"}},{"ruleId":"D1","level":"warning","message":{"text":"V2SpanWriter.write (cyclomatic 16): V2SpanWriter.write has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/V2SpanWriter.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b12cbdd15d5c35130034bc0280f4769182fe00e72180378aa0bf3942ed3d678"}},{"ruleId":"D1","level":"warning","message":{"text":"InsertSpan.newCompletionStage (cyclomatic 16): InsertSpan.newCompletionStage has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/InsertSpan.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4150e9678337b837313566896ca59f4a87eefaa4c65dfccdec7e43bd9580472b"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.build (cyclomatic 16): Builder.build has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/storage/QueryRequest.java"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"de2873fd44bb8f39247105bd2a20b5d3fec6d6dcb8e8dfc140168ce8c9288b2a"}},{"ruleId":"D1","level":"warning","message":{"text":"V2SpanConverter.convert (cyclomatic 16): V2SpanConverter.convert has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/v1/V2SpanConverter.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f506d19522483779e8a4932b6921689176e86b0c92b36b33c061b1ebc41fb2"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder.merge (cyclomatic 16): Builder.merge has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/Span.java"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b0c5035a9d6b8a687a412c790720d905389573713e045c024e8a83127d9644"}},{"ruleId":"D2","level":"warning","message":{"text":"V2SpanReader.fromJson (cognitive 115): V2SpanReader.fromJson has cognitive complexity 115 (threshold 15). Drivers by points: if/else 81, loops 33, boolean chains 1 (nesting depth added 86). 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":"zipkin/src/main/java/zipkin2/internal/V2SpanReader.java"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c561c1336f6cb3f8282abff53d96b258b2617e43553e5d2b54925373fb25020"}},{"ruleId":"D2","level":"warning","message":{"text":"putTrace (cognitive 74): putTrace has cognitive complexity 74 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/dependency-linker.js"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfd617ebe152d8c33fd743c5f03b3ce563d320d9d63157e9364836e775f0990"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteBuffer.asciiSizeInBytes (cognitive 68): WriteBuffer.asciiSizeInBytes has cognitive complexity 68 (threshold 15). Drivers by points: ternaries 65, if/else 3 (nesting depth added 46). 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":"zipkin/src/main/java/zipkin2/internal/WriteBuffer.java"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"73c9b291df5749ea0fdbddf4e474234f4af08f2e49232074def2e7149dc286cd"}},{"ruleId":"D2","level":"warning","message":{"text":"V1SpanConverter.processAnnotations (cognitive 65): V1SpanConverter.processAnnotations has cognitive complexity 65 (threshold 15). Drivers by points: if/else 51, boolean chains 11, ternaries 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/v1/V1SpanConverter.java"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"b124138f2ce4ba95d3d3dd45741edfd0fc2b73379431be4093e55c7be8034ce8"}},{"ruleId":"D2","level":"warning","message":{"text":"V1SpanMetadata.parse (cognitive 56): V1SpanMetadata.parse has cognitive complexity 56 (threshold 15). Drivers by points: if/else 43, boolean chains 10, loops 1, match/switch 1, ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/v1/V2SpanConverter.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c2cd2b9666980930e1941a5bccffc94d61a3bccaa68a67259127c7618fa924f"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryRequest.test (cognitive 54): QueryRequest.test has cognitive complexity 54 (threshold 15). Drivers by points: if/else 35, boolean chains 11, loops 8 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/storage/QueryRequest.java"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d5e727c107bde2f9577af3aab5e19449348f4cb80e94f4cd79660ce0ecf387"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyLinker.putTrace (cognitive 50): DependencyLinker.putTrace has cognitive complexity 50 (threshold 15). Drivers by points: if/else 38, boolean chains 9, match/switch 2, loops 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":"zipkin/src/main/java/zipkin2/internal/DependencyLinker.java"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6646b6b6c5196c7b5e910df32ca8f461596f0a4a4e9267f879efc225a9559569"}},{"ruleId":"D2","level":"warning","message":{"text":"Trace.merge (cognitive 44): Trace.merge has cognitive complexity 44 (threshold 15). Drivers by points: if/else 36, boolean chains 4, loops 4 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/Trace.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3472ee19859e308e6984c66cc951ed5c49f7296585ec6f61fb919a1e872ff8d"}},{"ruleId":"D2","level":"warning","message":{"text":"V1JsonSpanReader.fromJson (cognitive 40): V1JsonSpanReader.fromJson has cognitive complexity 40 (threshold 15). Drivers by points: if/else 24, loops 16 (nesting depth added 23). 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":"zipkin/src/main/java/zipkin2/internal/V1JsonSpanReader.java"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"c567c0abf49bd75a92200db1065d8b6b5d5893822d3ea06ab7f751ba8efb1e0f"}},{"ruleId":"D2","level":"warning","message":{"text":"CassandraSpanConsumer.accept (cognitive 40): CassandraSpanConsumer.accept has cognitive complexity 40 (threshold 15). Drivers by points: if/else 21, loops 10, ternaries 7, boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/CassandraSpanConsumer.java"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e01d0a8e00b80cbf74d6057fd38c5dbc8d6db1f183b99a7cd05aed962af576"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchInsertSpans.apply (cognitive 39): BatchInsertSpans.apply has cognitive complexity 39 (threshold 15). Drivers by points: if/else 23, ternaries 10, loops 5, boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/MySQLSpanConsumer.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3e2e7e4d85fb6a38143019dfc2e2c1b8fe62cc4efa8a748254525dfc340f25"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteBuffer.writeUtf8 (cognitive 35): WriteBuffer.writeUtf8 has cognitive complexity 35 (threshold 15). Drivers by points: if/else 24, ternaries 6, loops 4, boolean chains 1 (nesting depth added 23). 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":"zipkin/src/main/java/zipkin2/internal/WriteBuffer.java"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad4d4976af6b43d6be17eb7f212f18b492bf15fd9d1355d9e68302e57ac9531"}},{"ruleId":"D2","level":"warning","message":{"text":"V1ThriftSpanReader.read (cognitive 34): V1ThriftSpanReader.read has cognitive complexity 34 (threshold 15). Drivers by points: loops 18, if/else 16 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/V1ThriftSpanReader.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"84749f52d11a96638975c504abbd629efdccf7dcffb07691703831a3111228bd"}},{"ruleId":"D2","level":"warning","message":{"text":"Endpoint.detectFamily (cognitive 33): Endpoint.detectFamily has cognitive complexity 33 (threshold 15). Drivers by points: if/else 25, boolean chains 4, loops 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/Endpoint.java"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e27bba5108bc49f49a17dd0c8461557156449b9d0870290e37d6981284df68c0"}},{"ruleId":"D2","level":"warning","message":{"text":"parseAnnotationRows (cognitive 33): parseAnnotationRows has cognitive complexity 33 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-row.js"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9310b8f267c83d8040c475ebc2d8a7d9c5542bea5a7967537e2dd31a115f7c19"}},{"ruleId":"D2","level":"warning","message":{"text":"V1SpanWriter.write (cognitive 32): V1SpanWriter.write has cognitive complexity 32 (threshold 15). Drivers by points: if/else 28, loops 4 (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":"zipkin/src/main/java/zipkin2/internal/V1SpanWriter.java"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ac91e55ed450ed092f0183f83816a1ce3541de1d3c078eb57ab98151785ec1"}},{"ruleId":"D2","level":"warning","message":{"text":"V1SpanConverter.processBinaryAnnotations (cognitive 31): V1SpanConverter.processBinaryAnnotations has cognitive complexity 31 (threshold 15). Drivers by points: if/else 23, boolean chains 6, 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":"zipkin/src/main/java/zipkin2/v1/V1SpanConverter.java"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"791829ef46c6e5dc4defaea4901b554a6204c9a638f66b9263043cd9057714fb"}},{"ruleId":"D2","level":"warning","message":{"text":"Endpoint.writeIpV6 (cognitive 31): Endpoint.writeIpV6 has cognitive complexity 31 (threshold 15). Drivers by points: if/else 25, boolean chains 4, loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/Endpoint.java"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f67cb09a96c79c0b7d57efe24e6ef1da694a087ec3420798b7fae0768a48dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"mergeV2ById (cognitive 31): mergeV2ById has cognitive complexity 31 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-cleaner.js"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c8f15d5b7f13bd28f6dd41c37beaa31b33b61b9a5bebc7d089aaccfab4923b"}},{"ruleId":"D2","level":"warning","message":{"text":"IndexNameFormatter.formatTypeAndRange (cognitive 30): IndexNameFormatter.formatTypeAndRange has cognitive complexity 30 (threshold 15). Drivers by points: if/else 28, boolean chains 1, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/internal/IndexNameFormatter.java"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d858937c068ec0f6cb444ba4d47d56b4d3ff463cc50cd2297bb44c10f11d5fe5"}},{"ruleId":"D2","level":"warning","message":{"text":"V1SpanWriter.sizeInBytes (cognitive 30): V1SpanWriter.sizeInBytes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 26, loops 4 (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":"zipkin/src/main/java/zipkin2/internal/V1SpanWriter.java"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6101a1dde1864fc839f52bdf9fa10fd66079a556a7fcf494c424f5fe8c53bb"}},{"ruleId":"D2","level":"warning","message":{"text":"WriteBuffer.utf8SizeInBytes (cognitive 26): WriteBuffer.utf8SizeInBytes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15, ternaries 5, loops 4, boolean chains 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":"zipkin/src/main/java/zipkin2/internal/WriteBuffer.java"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73ea45de639e9c1fa296a06400a816a0ade0ad11bd0b29022bd188bba79d482"}},{"ruleId":"D2","level":"warning","message":{"text":"DependencyLinkV2SpanIterator.next (cognitive 24): DependencyLinkV2SpanIterator.next has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16, ternaries 3, boolean chains 2, match/switch 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/DependencyLinkV2SpanIterator.java"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ada4febd11dd76077e78f54fac3c7e3e33db3c9935111a9f6b30480dff121fd"}},{"ruleId":"D2","level":"warning","message":{"text":"BinaryAnnotationReader.read (cognitive 23): BinaryAnnotationReader.read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14, match/switch 5, boolean chains 3, loops 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":"zipkin/src/main/java/zipkin2/internal/V1ThriftSpanReader.java"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b63718a5bc511071b4be611a2b96a014a58b5c3d937ff6520e6c945243358c"}},{"ruleId":"D2","level":"warning","message":{"text":"Endpoint.textToNumericFormatV6 (cognitive 23): Endpoint.textToNumericFormatV6 has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13, loops 4, boolean chains 3, ternaries 2, error handling 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":"zipkin/src/main/java/zipkin2/Endpoint.java"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c1b95c075fddc38fad824cc7166294f386d1c6a763587bf9e3eed7e44cf704"}},{"ruleId":"D2","level":"warning","message":{"text":"V1JsonSpanReader.readBinaryAnnotation (cognitive 22): V1JsonSpanReader.readBinaryAnnotation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/V1JsonSpanReader.java"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ceb04feaf2cdf49b9a3ab0d8925d877af54c87b325441d2b315a976560c6001"}},{"ruleId":"D2","level":"warning","message":{"text":"V2SpanWriter.write (cognitive 21): V2SpanWriter.write has cognitive complexity 21 (threshold 15). Drivers by points: if/else 17, loops 4 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/V2SpanWriter.java"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"39ef6e534a876ed48f0139df93204eb79c061b594efab369d366363c0a2ccec8"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 21): (anonymous) has cognitive complexity 21 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-row.js"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"750f211b816fc52b6a699cd4fb609a6783090853813af6b2143a1770976734c4"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonSerializers.parseSpan (cognitive 20): JsonSerializers.parseSpan has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, loops 7, match/switch 2 (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":"zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/internal/JsonSerializers.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c936a4ba1f34f7572b5f4170203c9cb5b1a0450b22564ad655642d4dadc7bb6"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerIntegratedBenchmark.createZipkinContainer (cognitive 20): ServerIntegratedBenchmark.createZipkinContainer has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 6, match/switch 2 (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":"benchmarks/src/test/java/zipkin2/server/ServerIntegratedBenchmark.java"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9f780af558c8983a4ddb06a81f948695f9734bd530868e80cccee60b54f8e3"}},{"ruleId":"D2","level":"warning","message":{"text":"merge (cognitive 20): merge has cognitive complexity 20 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-cleaner.js"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cf7d4e602645dbaedf6c1835e96f95198228c4a8ae8d0892fda582768cbff6c"}},{"ruleId":"D2","level":"warning","message":{"text":"BulkIndexWriter.write (cognitive 19): BulkIndexWriter.write has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12, loops 4, boolean chains 2, error handling 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/internal/BulkIndexWriter.java"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"de33d25a2e060716f500d4abd5bf55e8bb6bb6be9a9f08b9e726fce339ef74ff"}},{"ruleId":"D2","level":"warning","message":{"text":"JsonEscaper.jsonEscape (cognitive 19): JsonEscaper.jsonEscape has cognitive complexity 19 (threshold 15). Drivers by points: if/else 18, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/JsonEscaper.java"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94cd989b0b0cda67b07b73a77ee9ab0b92a50601015eefa23d8752b75abeec6"}},{"ruleId":"D2","level":"warning","message":{"text":"V2SpanWriter.sizeInBytes (cognitive 19): V2SpanWriter.sizeInBytes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, loops 4 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/V2SpanWriter.java"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f07372097ce6be8fc453660efb8cba14d96430c2eac11f49c29d966e07337e"}},{"ruleId":"D2","level":"warning","message":{"text":"CassandraSpanStore.newBucketedTraceIdCall (cognitive 19): CassandraSpanStore.newBucketedTraceIdCall has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15, ternaries 2, boolean chains 1, loops 1 (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":"zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/CassandraSpanStore.java"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dd0d585f61e65d852503f1fe37b1d6b44a8ee4612e58d43866ffeb00ae5e89"}},{"ruleId":"D2","level":"warning","message":{"text":"JacksonSpanDecoder.parseSpan (cognitive 18): JacksonSpanDecoder.parseSpan has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, loops 7, match/switch 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":"benchmarks/src/test/java/zipkin2/codec/JacksonSpanDecoder.java"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e0e1b613dfc11f52410db18cc856a6519595e7becce052dd318dcb7055afb3"}},{"ruleId":"D2","level":"warning","message":{"text":"KafkaCollectorWorker.run (cognitive 18): KafkaCollectorWorker.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8, error handling 6, loops 3, 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":"zipkin-collector/kafka/src/main/java/zipkin2/collector/kafka/KafkaCollectorWorker.java"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"114b629f9d7a33ed9c14c6f6be30e56bc3dc31f718fa4a655accbd2c1d34d449"}},{"ruleId":"D2","level":"warning","message":{"text":"Dependencies.fromThrift (cognitive 18): Dependencies.fromThrift has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, loops 6 (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":"zipkin/src/main/java/zipkin2/internal/Dependencies.java"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a39aaaea68759d2085049cec23bd7abdd77579e4bd31bc737d63cb6be75099f"}},{"ruleId":"D2","level":"warning","message":{"text":"InitialEndpointSupplier.get (cognitive 18): InitialEndpointSupplier.get has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14, boolean chains 3, loops 1 (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":"zipkin-server/src/main/java/zipkin2/server/internal/elasticsearch/InitialEndpointSupplier.java"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"e475bc5160597975352b9e30dc392061cc2b81c2658e7caa10013690f1dc2e40"}},{"ruleId":"D2","level":"warning","message":{"text":"getClockSkew (cognitive 18): getClockSkew has cognitive complexity 18 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/clock-skew.js"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c87a4b1e87f8d102fd766b88c030f5cf15fc65d8877ac0e626babbacee5851d"}},{"ruleId":"D2","level":"warning","message":{"text":"InsertSpan.newCompletionStage (cognitive 17): InsertSpan.newCompletionStage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/InsertSpan.java"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c29b339d419c95d40ae0a57e982c58c133e1460e1f1fc51254c06cc9e5b6f6"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.build (cognitive 17): Builder.build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/storage/QueryRequest.java"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"05615a142ea47ea9bff422694f43aaccaf7db640b483de266477b6916b268cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"V2SpanConverter.convert (cognitive 17): V2SpanConverter.convert has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9, boolean chains 6, loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/v1/V2SpanConverter.java"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08f0c1945bd5113be13af030238d5f216e1319cf7e7b5df2ed4b0aa469fe435"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.merge (cognitive 17): Builder.merge has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/Span.java"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"771f8db00c33587bcc55c96b78aa733ae0bb38d5e4a9d1b35381e7b52eb762fd"}},{"ruleId":"D2","level":"warning","message":{"text":"Parser.convert (cognitive 16): Parser.convert has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, match/switch 4, error handling 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/BaseVersion.java"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d110e076b67a07feec45c6bb3505748f8128014ce98ed2ee679291a670ef72"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder.process (cognitive 16): Builder.process has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14, boolean chains 1, ternaries 1 (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":"zipkin/src/main/java/zipkin2/internal/SpanNode.java"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7f35f0ed759563775b72eb949c5b113a2110c85ec5829d900318a13e422f5b"}},{"ruleId":"D2","level":"warning","message":{"text":"ZipkinRabbitMQCollectorProperties.toBuilder (cognitive 16): ZipkinRabbitMQCollectorProperties.toBuilder has cognitive complexity 16 (threshold 15). Drivers by points: if/else 15, boolean chains 1 (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":"zipkin-server/src/main/java/zipkin2/server/internal/rabbitmq/ZipkinRabbitMQCollectorProperties.java"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c436f4aa3dce56171d2b37cbdc68e0f1602aaf28b2b5c001928802d4d288cbac"}},{"ruleId":"D2","level":"warning","message":{"text":"HostAndPort.fromString (cognitive 16): HostAndPort.fromString has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, ternaries 2, boolean chains 1 (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":"zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/internal/HostAndPort.java"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3d4b5120d1ea8aa2e98ace931d72597ee06cb008f3a5020472b551889a4259"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectSpansAndAnnotations.processAnnotationRecord (cognitive 16): SelectSpansAndAnnotations.processAnnotationRecord has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, boolean chains 2, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/SelectSpansAndAnnotations.java"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d5a44f0dba1a23bdd27a9e8e54cc29070e7d9e6a9579432bd576e02d8c69f6"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemoryStorage.doAccept (cognitive 16): InMemoryStorage.doAccept has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 3 (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":"zipkin/src/main/java/zipkin2/storage/InMemoryStorage.java"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"741d1434fa0c9dc100d9c09a87102386fcf0bccec7bfeea8e3f457931c1fe1a2"}},{"ruleId":"D2","level":"warning","message":{"text":"clean (cognitive 16): clean has cognitive complexity 16 (threshold 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/zipkin/span-cleaner.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4821b761be9f7af71dd26aca7608759d7d2059c08f4fc1564636f363aaddfe"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ZipkinElasticsearchStorageProperties: TooManyMethods \u2014 37 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-server/src/main/java/zipkin2/server/internal/elasticsearch/ZipkinElasticsearchStorageProperties.java"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5ecbe029b1bac5bbf77b13b61aadee14764126431484316a896fde92d6930f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/ITSpanStore.java: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: ITSpanStore (42-881). Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab14688935d67b88cb0b899244b6806ebfde067173b3f599dd48c1851ab0e58"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ElasticsearchStorage: TooManyMethods \u2014 36 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/ElasticsearchStorage.java"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd05167da8e877d7c6dbbf11f4b84ef28f1f2e8e508262f9107ee10b9c86dcc1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: storage/ITDependencies.java: FileTooLong \u2014 589 significant lines (blank, comment-only and punctuation-only lines excluded), about 95% of them inside a single declaration: ITDependencies (47-845). Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d5d43fef893db7676f3461f57045d748ab2f259489705b540f90e7cdfdbd95"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InMemoryStorage: TooManyMethods \u2014 34 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/storage/InMemoryStorage.java"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e4a3becc05c1c8fe05d4f655a847f9a7a99920bed8b355fdda749ff3081682"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ITSpanStore: TooManyMethods \u2014 33 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c08aa7e63a1630b0196d164c650a1defe2abc8b15dc50a214fc9954f07fbba6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ITDependencies: TooManyMethods \u2014 32 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"df71fc4849ce9be8d05eb783bb7a3ff9916559a9d0f43933271dbc0eb34f2f1f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ITStorage: TooManyMethods \u2014 31 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-tests/src/main/java/zipkin2/storage/ITStorage.java"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a976ebb465d3a9a5078f878c00978ee7e5f4408de9f1a212cc75d9c5e06a50d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Span: TooManyMethods \u2014 31 methods. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/Span.java"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6301f54db34df56b442804c633118e8d35f3f1de8f20d2638c01e684cbddd9dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/HasErrorCount.java:24-39 | zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/HasIpv6.java:24-39 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/HasErrorCount.java:24\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":"zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/HasErrorCount.java"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36adfe3157b013a134de98d7a6dc72cf56860299e0b2fd76e33a788cfbdb6e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): zipkin/src/main/java/zipkin2/internal/V1JsonSpanReader.java:51-62 | zipkin/src/main/java/zipkin2/internal/V2SpanReader.java:26-37 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060zipkin/src/main/java/zipkin2/internal/V1JsonSpanReader.java:51\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":"zipkin/src/main/java/zipkin2/internal/V1JsonSpanReader.java"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a247d36e8e7ccfe225826c2cec32909d4583eec45bb774a94ffde8fa6cc130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/HasRemoteServiceName.java:30-41 | zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/HasTraceIdHigh.java:36-47 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/HasRemoteServiceName.java:30\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":"zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/HasRemoteServiceName.java"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bdb9d381bacdde767b27f17882ba33266b4a6635da4b9a964e838cb3628400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/ElasticsearchSpecificTemplates.java:96-106 | zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/OpensearchSpecificTemplates.java:71-81 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/ElasticsearchSpecificTemplates.java:96\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":"zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/ElasticsearchSpecificTemplates.java"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50bba960af82daad124afd88ebe44ef6f2a36fe8f10cf3d045378556da71038"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:312-322 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:372-382 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:312\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":"zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"0779a033c11f2742dff799e12626da15603aaae99ad98807fe3d055e45579b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java:543-553 | zipkin-tests/src/main/java/zipkin2/storage/ITTraces.java:77-87 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. 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":"zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dcff473623ea1ef4fff814ac04f0c380f022271178447c40400db8b432369dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:521-530 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:565-575 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:627-636 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:521\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":"zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"84086d2a711df940b22e584f3d467c26a06e30bd64922cdb85f17bea0b5c5714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): zipkin/src/main/java/zipkin2/internal/V1SpanWriter.java:50-59 | zipkin/src/main/java/zipkin2/internal/V1SpanWriter.java:70-79 \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":"zipkin/src/main/java/zipkin2/internal/V1SpanWriter.java"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbc29fa26bfe7908e98bfe519c106f2d7445822d6f0a2ee37ddf07b60cd790a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): zipkin/src/main/java/zipkin2/internal/V1SpanWriter.java:126-135 | zipkin/src/main/java/zipkin2/internal/V1SpanWriter.java:146-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin/src/main/java/zipkin2/internal/V1SpanWriter.java"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"125deaee65f469cf45f591514fda23278f7f0285ea8b7ec3de113c97159d7270"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/ElasticsearchSpanStore.java:127-137 | zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/SelectFromSpan.java:70-78 \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":"zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/ElasticsearchSpanStore.java"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e6cb11ba16effea498fa9a858e43ff97c5697be41fce92ce6caec1e3a20feb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): zipkin-server/src/main/java/zipkin2/server/internal/ZipkinHttpCollector.java:191-199 | zipkin/src/main/java/zipkin2/SpanBytesDecoderDetector.java:100-108 \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 \u0060zipkin-server/src/main/java/zipkin2/server/internal/ZipkinHttpCollector.java:191\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":"zipkin-server/src/main/java/zipkin2/server/internal/ZipkinHttpCollector.java"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"db56dcdf5bf969fc78097f5d407a279955d8f63330fa8179890d2fad0e51c5bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:107-116 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:771-779 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d9f8e786b7730a5f09e2a36224d22c861ce958367357c2767315ff1a43c615"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:83-90 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:435-442 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:691-698 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:723-730 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java: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. 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":"zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7834961af5fd1844b6be4f2454234f6aa7937aa2b05ff2bc338ea2636adf1a88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:352-359 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:547-554 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:593-600 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:352\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":"zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70ef0147c5f11c20d28cf7ea68602b5f23d0ea699f1a32ae62790b3f73ad5e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/internal/IndexNameFormatter.java:128-135 | zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/internal/IndexNameFormatter.java:136-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 \u0060zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/internal/IndexNameFormatter.java:128\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":"zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/internal/IndexNameFormatter.java"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"860d6a1af65f9f816c016fc558ae777a90777230837aafc36c5242139c169c2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): zipkin/src/main/java/zipkin2/internal/ThriftEndpointCodec.java:33-40 | zipkin-storage/mysql-v1/src/main/java/zipkin2/storage/mysql/v1/SelectSpansAndAnnotations.java:260-267 \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 \u0060zipkin/src/main/java/zipkin2/internal/ThriftEndpointCodec.java:33\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":"zipkin/src/main/java/zipkin2/internal/ThriftEndpointCodec.java"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d011c616b107e9ed60c481f1f1fe51a8b242de0f6342fb2c19a078c1e5714999"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:286-293 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:503-510 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:286\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":"zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"9094e9245429b8da99df9d7b4ea3e76d28e6ff51e24cd2f7ee663138d2b15d43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): zipkin/src/main/java/zipkin2/internal/V1JsonSpanReader.java:94-100 | zipkin/src/main/java/zipkin2/internal/V2SpanReader.java:57-63 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060zipkin/src/main/java/zipkin2/internal/V1JsonSpanReader.java: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. 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":"zipkin/src/main/java/zipkin2/internal/V1JsonSpanReader.java"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb33f82fe5bce8a10e7ba7cd9abc85470707395bb94d9b6ba5736e4a49d395d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/SelectTraceIdsFromServiceRemoteService.java:113-119 | zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/SelectTraceIdsFromServiceSpan.java:140-146 \u2014 the copies sit in sibling files of one directory: extract the block into a single shared function in that directory and call it from each site, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/SelectTraceIdsFromServiceRemoteService.java:113\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":"zipkin-storage/cassandra/src/main/java/zipkin2/storage/cassandra/SelectTraceIdsFromServiceRemoteService.java"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dae46752a5122e949606455fe93171d2193dbdf491e41878d642abb0e0c11a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java:648-654 | zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java:666-672 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java:648\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":"zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b242ad5b60290c0eee9b6ca1df25e896b36e62973b269b1901a71b3de488526"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:161-166 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:173-178 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java: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":"zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ab757c221fca8a4bb35e79f2146f00bd52f039b2575df355f351849b8ba538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): zipkin/src/main/java/zipkin2/v1/V1Span.java:287-292 | zipkin/src/main/java/zipkin2/Span.java:775-780 \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. 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":"zipkin/src/main/java/zipkin2/v1/V1Span.java"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"64d80ccb5de66560aa86b3d36d42c01847983c56ed059818a97eb4a784d4bf8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java:839-843 | zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java:844-848 | zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java:849-853 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java:839\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"831e6efabf83bcff0888cad5c88172e938bdb774df98c38ecb9a2610c584deaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:441-446 | zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:600-604 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java:441\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-tests/src/main/java/zipkin2/storage/ITDependencies.java"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"94372899f835b07182902dd0763a9297a128ae0a214a37b31ac1b7b52bcee20d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java:590-595 | zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java:596-600 \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 \u0060zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java: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":"zipkin-tests/src/main/java/zipkin2/storage/ITSpanStore.java"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"1294fa94a481979c703e42704c4f29f300bdef4185c9bcd53d57cf61a3dfac73"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 1 significant file(s) lose their only recent owner: zipkin-storage/elasticsearch/src/main/java/zipkin2/elasticsearch/BaseVersion.java. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c96736bebc9fa2031b609bbc249458e9d490c7f370cb6d0f0dab56bde744c3f0"}},{"ruleId":"D19","level":"note","message":{"text":"The configuration table lists concurrency and connection-timeout but does not explain what happens when the RabbitMQ URI is set to a non-default address.: Add a note under Caveats about how setting the URI overrides the addresses/environment variables."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-collector/rabbitmq/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2030ea62458fb0d6155facb03f99c6154fbf603434cab301be3ed5643619a96"}},{"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":"dee588715574c9b04cd4d3728b6518f0527faa4a452b3c05951171b683afb7f4"},"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"}}]},{"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":"0d3da5644e5537cb62cf92452d02bef4e38fb91f49a2d646d1565ce15cbd7268"},"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"}}]},{"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":"2ea63277c25be482f99962fe104c15b4fbc12bd547a7e4070f6efbd13988c92b"},"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"}}]},{"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":"20f30d9f0310efaedbdadc07125188b13c982cb303a19f3eff26d96a1bc4b2ec"},"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"}}]},{"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":"f5666362dadc521d818128182ad7336e761fc333e4dfdb70b1450b35c4ea630e"},"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"}}]},{"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":"4844b3076cfb68afbb397c28bfb69c9d5a845a220a12e8dce26898cf27ec7799"},"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"}}]},{"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":"7434454e8c3c5cd375381146a0df6c4e257438c9647c351056508f1edf22f8b1"},"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"}}]},{"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":"1e112d12f542bc893247682d49ab62c3770990941a31a83157d064b481c0f018"},"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"}}]},{"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":"152c09058afb3186c12557802232c126d48550e967c5ca7482dd76f2bc3e0d1e"},"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"}}]},{"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":"af998ec9dc567217fde4e22246cbad2d2203ca995589e41f8334faf06741288b"},"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"}}]},{"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":"d33fa687b64071ae67e2bef0e7331804d4469ec514f979bfec1540931e2e5e46"},"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"}}]},{"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":"a7857b8fe145ed97dd2dc307730642a4bb0ffd11eb4a0306ea5c078fda0626a3"},"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"}}]},{"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":"296f693fbd542c1ce0561daeeefa13fe00dcb68de4d6f5fa438592dccdca96e0"},"taxa":[{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"45913bb3ddbced777f10812b4d6939d820ad816e8c1b51dc0d5d888223b1a092"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","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":"7aeb5372070c44458f0ad93cab4359d1fe291d32e9a29a2b36536c2e1429b51d"},"taxa":[{"id":"CWE-330","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"zipkin-lens/src/components/DiscoverPage/DiscoverPageContent.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df2f00264a5f7994e0b5ad8ebe8572137ad90677390447b5796b1681caeeb33"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 37 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than listed individually (38 orphaned of 167 analysed files in total, counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"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"}},{"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"}},{"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"}},{"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":"9658270ba49f37ed04e99ab1263b6393cd42aed8bdfb7aafd9fa1070f5491895"}},{"ruleId":"D38","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":"9753f2f9fab7620b5f5bdd6332882b207eff1b438b4f05ad1e26f83fc5b7a5f8"}},{"ruleId":"D38","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":"0d42ca5f28931aaa4026d5179dce870c7a2d69cd53b0455ed137079f628f793e"}},{"ruleId":"D38","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":"a1febf18cd174729d5595690fe95a108018288a08bf0facb04a84438233298ed"}},{"ruleId":"D38","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":"5b5f98dee7b4de8d7b812ed50de210682c1389de4ce8a40896cad6d1ac5e0b54"}},{"ruleId":"D38","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":"e994f1d005c17b98a7897e43c2adecd4e31c732f977be1571001cfa697699a08"}},{"ruleId":"D38","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":"a5bbabe9b58f0d093aa9c58f655af43da66d6bd55b68a83e01d27d873c1bd4f0"}},{"ruleId":"D38","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":"727b82b171092c2c83fe62e1433d7f0eae291466468699bdf34f5f7b1d9871d4"}},{"ruleId":"D38","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":"10520b1f91cfb6e6f475a5a23588c112ab377da9df6cf77e82a627f99d625876"}},{"ruleId":"D38","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":"ee7bf2ddcf104999ce5a8b4a26f1e65929c83589345e4742d19e7394830b40b3"}},{"ruleId":"D38","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":"4e0b2fa007de1b304e6e82bbb8870a9cc17999fb48df97e7c563cc2526f21334"}},{"ruleId":"D38","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":"d1e54d795ee805fe397ee5e96d3872cbf57164fb6fb0c92786adf12572ab33f2"}},{"ruleId":"D38","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":"0a80fad7e7dbd27ef533490e29c6cc339750c1b2205b8b2719a8bfa624660d77"}},{"ruleId":"D38","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":"24e79123df56b63eb01ced20bb0a1ac1ccb2fcb2ecf28fc11e1aaf30f8f55612"}},{"ruleId":"D38","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":"2c2d66be7484d5251d2fae911b5d3f2af3f8c1e2ba90d307ea1b9fcb40a17b65"}},{"ruleId":"D38","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":"86d519c0fde86c2a7c9c351d9b4ca11f4d65cff6f253b36082229006517929e7"}},{"ruleId":"D38","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":"f0cd7b16585c419a3da84bcc58af1215c524d66082262b080554f2fd00c5f7e3"}},{"ruleId":"D38","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":"ed6fc65b4e7775c4b2eb76693295f0a0c1e6ca9ba0efb5c948b1feec74b2f732"}},{"ruleId":"D38","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":"483b388bc2c917fed33503a264e203b27f94832fcda6d8c7502eefa722840f0f"}},{"ruleId":"D38","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":"91297efe3d52f474ef40ae5304c2bdee6827ef83a318cc8ebf86c4ac990e59c7"}}],"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-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"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-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.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-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"CWE-328","shortDescription":{"text":"CWE-328"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-330","guid":"f811ddf9-2e54-865b-9c76-f97905849790","name":"CWE-330","shortDescription":{"text":"CWE-330"},"helpUri":"https://cwe.mitre.org/data/definitions/330.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"CWE-353","shortDescription":{"text":"CWE-353"},"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-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":38,"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."]}]}