{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"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":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"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"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"VisualExpressionModule.fromExpression (cyclomatic 66): VisualExpressionModule.fromExpression has cyclomatic complexity 66 (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":"src/Symbolics/Visual/VisualExpression.fs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"665504940a3dec00ad6d90a3979e68308eff7327f2e8a06594a7caa2c754896b"}},{"ruleId":"D1","level":"warning","message":{"text":"Linq.toLambda (cyclomatic 65): Linq.toLambda has cyclomatic complexity 65 (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":"src/Symbolics/Typed/Linq.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f68c1ff103fbfc30474ad36374fe829a02885c6fd51ed03556422057ad0a2d3"}},{"ruleId":"D1","level":"warning","message":{"text":"LaTeXFormatter.format (cyclomatic 56): LaTeXFormatter.format has cyclomatic complexity 56 (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":"src/Symbolics/Visual/LaTeX.fs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"355d28b4c4aabe739f5847c81cdf4ddba2f6583050f958e251278e5e96f8eb0c"}},{"ruleId":"D1","level":"warning","message":{"text":"Operators.multiply (cyclomatic 46): Operators.multiply has cyclomatic complexity 46 (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":"src/Symbolics/Expression.fs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"4766977ddea5282daba9b0c08c7b18a2ee2559195690abd3a5c802726e23872a"}},{"ruleId":"D1","level":"warning","message":{"text":"Operators.orderRelation (cyclomatic 45): Operators.orderRelation has cyclomatic complexity 45 (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":"src/Symbolics/Expression.fs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed9313a6f5c779c6c2b2af840c7197e4602467b6ca659278c1f38645189034c"}},{"ruleId":"D1","level":"warning","message":{"text":"Trigonometric.Contract (cyclomatic 41): Trigonometric.Contract has cyclomatic complexity 41 (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":"src/Symbolics/Trigonometric.fs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"59451d6745004df169f3bda9272a4dc51525beee7afc312bb87579e811d27948"}},{"ruleId":"D1","level":"warning","message":{"text":"Operators.add (cyclomatic 40): Operators.add has cyclomatic complexity 40 (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":"src/Symbolics/Expression.fs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ef51956d2fd595f3cafd4cb13efce81ec3f41b1630a54170ac516125ea433f"}},{"ruleId":"D2","level":"warning","message":{"text":"Trigonometric.Contract (cognitive 50): Trigonometric.Contract has cognitive complexity 50 (threshold 15). Drivers by points: loops 24, if/else 12, match/switch 10, boolean chains 4 (nesting depth added 23). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. 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. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Trigonometric.fs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"b792aed8919b9adb3c1fdcf271be15c41fbc9954b2c111416cccb15b57224bfa"}},{"ruleId":"D2","level":"warning","message":{"text":"LaTeXFormatter.format (cognitive 49): LaTeXFormatter.format has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 33, if/else 15, boolean chains 1 (nesting depth added 24). 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. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Visual/LaTeX.fs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ced40c26aff11bd4a53c06267c9135969fb9497dffd458b4bf7d3751940dbf"}},{"ruleId":"D2","level":"warning","message":{"text":"VisualExpressionModule.fromExpression (cognitive 30): VisualExpressionModule.fromExpression has cognitive complexity 30 (threshold 15). Drivers by points: match/switch 12, boolean chains 9, if/else 9 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Visual/VisualExpression.fs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd5d99ad54282324c9c49608adf7c28b62e8ad6c59bf6a532388cdc9bbfe503f"}},{"ruleId":"D2","level":"warning","message":{"text":"Operators.multiply (cognitive 24): Operators.multiply has cognitive complexity 24 (threshold 15). Drivers by points: if/else 17, match/switch 6, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Expression.fs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a07d71574269e2aff57fabf8170a8a5620b1bf3be6920f16be838527339404"}},{"ruleId":"D2","level":"warning","message":{"text":"Operators.orderRelation (cognitive 17): Operators.orderRelation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, match/switch 2 (nesting depth added 5). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. 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. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Expression.fs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dd806f0eb2f7c59767fd08a932021aeec2f24611e75da31aca0bc14c058aac"}},{"ruleId":"D2","level":"warning","message":{"text":"Operators.add (cognitive 17): Operators.add has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, match/switch 5 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. 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. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Expression.fs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b9eee9b1e3135caf4434482a05d301cd6099cd83602ad45e50a24a2754b8f3"}},{"ruleId":"D2","level":"warning","message":{"text":"Linq.toLambda (cognitive 16): Linq.toLambda has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, match/switch 6 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. 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. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Typed/Linq.fs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e08ac4844e7045adfbe246873b78b6ef4e6f91cfd47c716557a1138e340f6bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SymbolicExpression: TooManyMethods \u2014 165 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":"src/Symbolics/SymbolicExpression.fs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"778372b0027064380729900f20a87fd7ba560f547897825b18a9d0cd51dfd1d0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Operators: TooManyMethods \u2014 82 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":"src/Symbolics/Expression.fs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0d1fcada9f44e8a73d101b038bb5094335d3cac37a1594a3551ea044691f92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: Symbolics/Expression.fs: FileTooLong \u2014 928 significant lines (blank, comment-only and punctuation-only lines excluded). To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Expression.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5ae63c5509140c7bf7ab6e835213e7f9cba9b9c94e6caf15abeff67f68c4d62"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Polynomial: TooManyMethods \u2014 40 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":"src/Symbolics/Polynomial.fs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"be48276ea1d71471a6b032df5048fc2cb1de84d540dd60685b0b00c480fedb2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/Symbolics/Approximation.fs:248-258 | src/Symbolics/Expression.fs:849-859 \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":"src/Symbolics/Approximation.fs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fd701f9f2015d7809bf5795f9fdd11ecf85f2030de1d412743ef885ca61f7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Symbolics/Approximation.fs:22-31 | src/Symbolics/Evaluate.fs:31-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Approximation.fs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b128a4e92ae7978a4ebf3c97d5d36f9ba12753b4d03b523b79be0174f1446010"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Symbolics/Polynomial.fs:65-73 | src/Symbolics/Polynomial.fs:373-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Polynomial.fs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85637dfb52e59d02b2112154a7288a0421ce1e40276df67226fd2d7bf85c406"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Symbolics/Visual/Infix.fs:148-156 | src/Symbolics/Visual/LaTeX.fs:79-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":"src/Symbolics/Visual/Infix.fs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf395945a358116f45e087f06ca0060c2f77091aa562bbd071908405169103cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/Symbolics/Typed/Linq.fs:215-223 | src/Symbolics/Typed/Linq.fs:250-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Typed/Linq.fs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9100575b027ee4bd9e15df09ffa02cf0c27502f1a0797bb5643c3b47f25161c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): src/Symbolics/Expression.fs:750-756 | src/Symbolics/Expression.fs:761-767 | src/Symbolics/Expression.fs:772-778 | src/Symbolics/Expression.fs:781-787 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Expression.fs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8ab7fa2eff8799171829ad26916e63b3d4cd214fb6ccb3b850762a46cf1e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Symbolics/Polynomial.fs:168-174 | src/Symbolics/Polynomial.fs:418-424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Polynomial.fs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"972e060b86943b94650da48c46e9ef531d4e9817df46f296b72521947de61b78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): src/Symbolics/Exponential.fs:47-53 | src/Symbolics/Trigonometric.fs:139-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Exponential.fs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9166de049c1067335032d6319227b5f7a0d8d345039dc7ba21a6c74521ba5b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Symbolics/Approximation.fs:259-264 | src/Symbolics/Expression.fs:860-865 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Approximation.fs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17432e1a521cc020127c49166afcf9044e8c287c9bcaef242a7b63dfb048c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Symbolics/Expression.fs:790-795 | src/Symbolics/Expression.fs:798-803 \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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Expression.fs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"719126e15e3ec4345bd5670b602e4863e330765bb36949cf19e6c96f5808142b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Symbolics/Expression.fs:807-812 | src/Symbolics/Expression.fs:815-820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Expression.fs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b426d01c9ae98fa030f16b72f7943455e540a78edb7034d46f8fa3603fc75b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Symbolics/Structure.fs:33-38 | src/Symbolics/Structure.fs:43-48 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Structure.fs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8830b3590424f4552dc17f0024498b94e95f37e339f977ab922eb5ca3ddb6ba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Symbolics/Structure.fs:64-69 | src/Symbolics/Trigonometric.fs:159-164 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Structure.fs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9417fd37874bbed3b2701ed2b68d4527905b80cf738aa6397d0366c7273b9a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Symbolics/Polynomial.fs:175-180 | src/Symbolics/Polynomial.fs:425-430 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Polynomial.fs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0667fe9382bc8197d3dd63b246116b07010a4a2bc381b07a23739942fbf62c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Symbolics/Visual/Infix.fs:136-141 | src/Symbolics/Visual/LaTeX.fs:67-72 \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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Visual/Infix.fs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"209ca0cb9597dbab5d6310eedc1a022e14117a977a6e900189479201a458972a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): src/Symbolics/Typed/TypedExpression.fs:74-79 | src/Symbolics/Typed/TypedExpression.fs:87-92 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/Symbolics/Typed/TypedExpression.fs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a7237baf974697bb3a306e54b2b13a6516173c424bd4d5e8414276ea497cdd"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 no coverage collector is wired up: Coverage NOT MEASURED: the test suite built and its tests PASSED, but the run produced no coverage data \u2014 \u0060--collect:\u0022XPlat Code Coverage\u0022\u0060 found no data collector, which is what a test project with no \u0060coverlet.collector\u0060 PackageReference does. Nothing is wrong with the suite or the build; there is simply no coverage instrumentation wired up. Add a \u0060coverlet.collector\u0060 PackageReference to the test project(s) (or commit the Cobertura/OpenCover/lcov report your CI produces) and real coverage will be measured. It is excluded from the score rather than counted as a near-zero defect."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D16","level":"warning","message":{"text":"dormant codebase \u2014 no living knowledge left to concentrate: All 15 significant source file(s) were last meaningfully changed so long ago that no living knowledge remains \u2014 nothing since has been substantial enough to re-establish ownership (a broad, mechanical sweep that touches many files shallowly does not count, and neither does no activity at all). There is no concentration to measure, so the bus factor is not scored. This is not a clean bill: nobody currently holds working knowledge of this code (see D34 Knowledge Freshness)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"569d55ea5cb0330f13c125b289d07e5abdfcceac947a2c2645277937942e7d5f"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"src/Symbolics/Expression.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1282f11110c86f63a481e04f2633e9d4de4d656bc05095425ab8e84c9354c3d3"}},{"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":"src/Symbolics/SymbolicExpression.fs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fdfce1a1bfe01c391911d9abe80fea3238ce2bc2e0ae4d813f8d61a9f3b17b"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 16 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than listed individually (18 orphaned of 18 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"}}],"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-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"CWE-829","shortDescription":{"text":"CWE-829"},"helpUri":"https://cwe.mitre.org/data/definitions/829.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":1,"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."]}]}