{"$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":"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":"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":"Field.setupValuerAndSetter (cyclomatic 192): Field.setupValuerAndSetter has cyclomatic complexity 192 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 175 belong to 14 function literals inside it that branch. 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":"schema/field.go"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"2beaa6e1a4b279cab41d13ef3bd5d47b63e49aee2a81d6b3716c4b2e8606ddf3"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema.ParseField (cyclomatic 121): Schema.ParseField has cyclomatic complexity 121 (threshold 15). Of this number, 112 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. 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":"schema/field.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8304e651b8895e1cbeb9940c6c33aae111ebc1cf08cd0cf91ab03fd26a236a27"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.ParseWithSpecialTableName (cyclomatic 76): schema.ParseWithSpecialTableName has cyclomatic complexity 76 (threshold 15). Of this number, 75 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"schema/schema.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91999a657645a7db7f16240a6aa391aa72f93eacc64168b047164bf1aa4c3d8"}},{"ruleId":"D1","level":"warning","message":{"text":"callbacks.ConvertToAssignments (cyclomatic 75): callbacks.ConvertToAssignments has cyclomatic complexity 75 (threshold 15). Of this number, 72 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"callbacks/update.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b588439b4ec1b59781910853ef2b1c5cd313f244ec1708dfff474d20d23127"}},{"ruleId":"D1","level":"warning","message":{"text":"callbacks.SaveAfterAssociations (cyclomatic 74): callbacks.SaveAfterAssociations has cyclomatic complexity 74 (threshold 15). Most of this is not in the body itself: 1 of the 74 points is its own statement and the rest belongs to one function literal inside it that branches (line 111). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/associations.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"61b0f1758c0478cfd4b85b4f10c17f07fb8a54d3e42fbf5ce8a313e784c2853c"}},{"ruleId":"D1","level":"warning","message":{"text":"callbacks.ConvertToCreateValues (cyclomatic 73): callbacks.ConvertToCreateValues has cyclomatic complexity 73 (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":"callbacks/create.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"507b8d512996ced326b7883b110d2ff96f11cb339fa9e547e88bbeb5318f4f23"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement.BuildCondition (cyclomatic 73): Statement.BuildCondition has cyclomatic complexity 73 (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":"statement.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"91759d53696141e19f4bb20c3fa83c0b678d04744cf8e4583f23b5e5830adec9"}},{"ruleId":"D1","level":"warning","message":{"text":"gorm.Scan (cyclomatic 71): gorm.Scan has cyclomatic complexity 71 (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":"scan.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"4266f9598a9851a318122299d54af938f15a53c0c6556b224d5d826ac2f2ae93"}},{"ruleId":"D1","level":"warning","message":{"text":"Association.saveAssociation (cyclomatic 64): Association.saveAssociation has cyclomatic complexity 64 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 26 belong to one function literal inside it that branches. 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":"association.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5c1d4d1ec3db97cab2fcb62e2884e4727321481b4576bbd57b38079d389b18"}},{"ruleId":"D1","level":"warning","message":{"text":"callbacks.BuildQuerySQL (cyclomatic 64): callbacks.BuildQuerySQL has cyclomatic complexity 64 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 15 belong to one function literal inside it that branches. 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":"callbacks/query.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9322dcadc20b5c21fed52779e1a085aae45ca133816a0c98cc957af07604e6"}},{"ruleId":"D1","level":"warning","message":{"text":"callbacks.Create (cyclomatic 51): callbacks.Create has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 1 of the 51 points is its own statement and the rest belongs to one function literal inside it that branches (line 40). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/create.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e509210f00803ba054e44a099c97739c497b5be526de0605c45e32f1a28baaa3"}},{"ruleId":"D1","level":"warning","message":{"text":"Migrator.MigrateColumn (cyclomatic 51): Migrator.MigrateColumn has cyclomatic complexity 51 (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":"migrator/migrator.go"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64043a5296d24dd981a0a806053b5bc950511c5a2e9426d01bee11313532586"}},{"ruleId":"D1","level":"warning","message":{"text":"logger.ExplainSQL (cyclomatic 49): logger.ExplainSQL has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 6 of the 49 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 57, 172). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"logger/sql.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e31b8a0101daddbe84af2821b4eb2009aa9f3c95dcf02c8c11761d8c43b8bfc"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema.guessRelation (cyclomatic 47): Schema.guessRelation has cyclomatic complexity 47 (threshold 15). Of this number, 43 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"schema/relationship.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d897cc1ff7d078b648b1964562e4ef979a73e236d750a0c0b18300bdcd878b"}},{"ruleId":"D1","level":"warning","message":{"text":"Association.Delete (cyclomatic 35): Association.Delete has cyclomatic complexity 35 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 13 belong to one function literal inside it that branches. 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":"association.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d4e96f12d643f8c22c93ca63dc31a85542c83cf41de166d16008571d865d5e"}},{"ruleId":"D1","level":"warning","message":{"text":"callbacks.preload (cyclomatic 35): callbacks.preload has cyclomatic complexity 35 (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":"callbacks/preload.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9768426812fcfa4a7603a2fd2424f396952a00ffeb6853b8b31b415e1443be4"}},{"ruleId":"D1","level":"warning","message":{"text":"gorm.sortCallbacks (cyclomatic 34): gorm.sortCallbacks has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 10 of the 34 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 284, 266). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks.go"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f5a086658b71fefc897f925743d5f0f02342afaded57e9dbe7613e332a4570"}},{"ruleId":"D1","level":"warning","message":{"text":"NamedExpr.Build (cyclomatic 31): NamedExpr.Build has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. 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":"clause/expression.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3956b1696d009aaff54f313d80feb925dc43309228e0b8914bffab32c7d8a3f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Association.Replace (cyclomatic 30): Association.Replace 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":"association.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd57306862f003f53ee91de0615246fde37236668a137184a91a9cc318e15db2"}},{"ruleId":"D1","level":"warning","message":{"text":"gorm.Open (cyclomatic 30): gorm.Open has cyclomatic complexity 30 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"gorm.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d968bf46c511920cc4057148c4dcaf711c2b9fc2578097431c801acc7160f684"}},{"ruleId":"D1","level":"warning","message":{"text":"callbacks.SaveBeforeAssociations (cyclomatic 30): callbacks.SaveBeforeAssociations has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 1 of the 30 points is its own statement and the rest belongs to one function literal inside it that branches (line 14). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/associations.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c3394c29c881863bb03a8822e2fd742fc2271939ffa2e6694960242f5d3296"}},{"ruleId":"D1","level":"warning","message":{"text":"setCreateOrUpdateG.handleAssociation (cyclomatic 30): setCreateOrUpdateG.handleAssociation has cyclomatic complexity 30 (threshold 15). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"generics.go"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11791e9fd62ccc340f551552906a7eab4806989511aefe555c7201f1c2d490b"}},{"ruleId":"D1","level":"warning","message":{"text":"processor.Execute (cyclomatic 27): processor.Execute has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"callbacks.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"61447310aafdf9364caca39fc960c078cd680eadedebf7cd1666ff6adcec5aac"}},{"ruleId":"D1","level":"warning","message":{"text":"Migrator.AutoMigrate (cyclomatic 27): Migrator.AutoMigrate has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 5 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 130). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"migrator/migrator.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11bf19977f7ab5a26c5c769913f286b493a1260b7379d3ceac9efffac9dceca"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema.buildMany2ManyRelation (cyclomatic 27): Schema.buildMany2ManyRelation 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":"schema/relationship.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9818e58644ccd6bd532990b61a24f217e32c30919318ee6fe07caaf77a6783"}},{"ruleId":"D1","level":"warning","message":{"text":"Migrator.CreateTable (cyclomatic 25): Migrator.CreateTable has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 3 of the 25 points are its own statements and the rest belongs to one function literal inside it that branches (line 219). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"migrator/migrator.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"4550df1a5b608bb1ac51d02a0bd725b96aaaf17359520a774b81412f2a1081d9"}},{"ruleId":"D1","level":"warning","message":{"text":"callbacks.DeleteBeforeAssociations (cyclomatic 24): callbacks.DeleteBeforeAssociations 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":"callbacks/delete.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86fbb3f74d3d787c174fafcb5497cf6bfe0a236fa6c4e4fca5a7fa43b80ce70"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement.QuoteTo (cyclomatic 24): Statement.QuoteTo has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"statement.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2118e6448f6220ab6dce41621aec7ea7c0839874c4bd4d63c4132374efd41e9"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement.AddVar (cyclomatic 23): Statement.AddVar 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":"statement.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a748515e42b042e72bab50d23aac956a699f84da9bb88194237f3e84a6f88c9"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement.SelectAndOmitColumns (cyclomatic 23): Statement.SelectAndOmitColumns has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 11 of the 23 points are its own statements and the rest belongs to one function literal inside it that branches (line 719). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"statement.go"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a2b5d0abfac0027c1c6a40853fb7ce80b9f994af0040386895c6cab1f8519c"}},{"ruleId":"D1","level":"warning","message":{"text":"callbacks.preloadEntryPoint (cyclomatic 22): callbacks.preloadEntryPoint has cyclomatic complexity 22 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. 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":"callbacks/preload.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"7881b390771a72455c527b6221caa078bb3819dc7e5d039d39bc6c97360e97c9"}},{"ruleId":"D1","level":"warning","message":{"text":"NotConditions.Build (cyclomatic 22): NotConditions.Build has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clause/where.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff2284bd18911ef7f3a2cb1018905caf6bb9bbc6519e2fa71a51c34c346a8e14"}},{"ruleId":"D1","level":"warning","message":{"text":"Migrator.ReorderModels (cyclomatic 22): Migrator.ReorderModels has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 5 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 934, 983). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"migrator/migrator.go"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"5860291277a1a3ea9a276faa23547fb8f7471d0f35b0f56fb3e48a4491125f3f"}},{"ruleId":"D1","level":"warning","message":{"text":"DB.Session (cyclomatic 21): DB.Session has cyclomatic complexity 21 (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":"gorm.go"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"28905f6e93f44a4f793758284fa5cee1a2a9c0f8fecd6c1210a8f0d3d04286be"}},{"ruleId":"D1","level":"warning","message":{"text":"DB.assignInterfacesToValue (cyclomatic 20): DB.assignInterfacesToValue has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"finisher_api.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8b8086b5b3f8ea1bfaf6a922e66f0c750d26a84b2e42ad0e3f5a03fb1e46c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Statement.Changed (cyclomatic 20): Statement.Changed has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 651). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"statement.go"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"835b4dadc203f1fa525f40b12e18ed3bf384a985ed37b74178de6b8dcd491bd4"}},{"ruleId":"D1","level":"warning","message":{"text":"callbacks.Delete (cyclomatic 19): callbacks.Delete has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 116). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/delete.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d26c68d7baafb390a507499fe6a8ec19eb2f8370d53bb05d5ec3d11bcac6bf"}},{"ruleId":"D1","level":"warning","message":{"text":"clause.buildExprs (cyclomatic 19): clause.buildExprs 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":"clause/where.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d2186fdd4401a60c105a56336cca2ee4713496b95be02c8ab0d7739834faf2"}},{"ruleId":"D1","level":"warning","message":{"text":"schema.GetIdentityFieldValuesMap (cyclomatic 19): schema.GetIdentityFieldValuesMap 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":"schema/utils.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"877b51ef7022d5e3f49acfaaf22f2ac1859e79353cd359f60ad4dec4a180eb7a"}},{"ruleId":"D1","level":"warning","message":{"text":"NamingStrategy.toDBName (cyclomatic 19): NamingStrategy.toDBName 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":"schema/naming.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b18ed886867d6edbb315ddfb4e37714b6922c507d7279df42d93d6d97272f68"}},{"ruleId":"D1","level":"warning","message":{"text":"Relationship.ParseConstraint (cyclomatic 19): Relationship.ParseConstraint 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":"schema/relationship.go"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e14e7e1e11b1cc152e85eb7cd9c4d6c1cc4d4ed7382bc142bbb1554577157ee"}},{"ruleId":"D1","level":"warning","message":{"text":"DB.Count (cyclomatic 18): DB.Count 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":"finisher_api.go"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacd3c2f37a492ad3853cac1deb82d4fcd8feb462a2e11ae6df8d1ecfcb4d69a"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema.parseRelation (cyclomatic 18): Schema.parseRelation 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":"schema/relationship.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"e644678b34e57b90bc838741612d9e57742620a995c6c8afb9dbd449039b2ef8"}},{"ruleId":"D1","level":"warning","message":{"text":"DB.FindInBatches (cyclomatic 17): DB.FindInBatches 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":"finisher_api.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e0c62f7c22637e7702a7da4ca4db5cb395a78c9ada013bf66ae73e64fa64cb"}},{"ruleId":"D1","level":"warning","message":{"text":"Migrator.GuessConstraintInterfaceAndTable (cyclomatic 17): Migrator.GuessConstraintInterfaceAndTable has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"migrator/migrator.go"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"15563de48578bbc94678407584c81dcadeba058f3712580619c0090e02037eb3"}},{"ruleId":"D1","level":"warning","message":{"text":"chainG.Preload (cyclomatic 16): chainG.Preload has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 482). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generics.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f78a2643dbeabfa46d60ce66bb6fc9829429ac59f772676c204ecaf35ced784"}},{"ruleId":"D2","level":"warning","message":{"text":"Field.setupValuerAndSetter (cognitive 282): Field.setupValuerAndSetter has cognitive complexity 282 (threshold 15). Drivers by points: if/else 228, boolean chains 29, match/switch 21, loops 4 (nesting depth added 144). Of this number, 16 points are the body\u0027s own statements and 266 belong to 14 function literals inside it that branch. 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":"schema/field.go"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e6915101f261f917a92dd1e08a8b546a7cb5d3c91853205a271636c415aa06"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.SaveAfterAssociations (cognitive 246): callbacks.SaveAfterAssociations has cognitive complexity 246 (threshold 15). Drivers by points: if/else 155, loops 69, boolean chains 13, match/switch 9 (nesting depth added 174). Most of this is not in the body itself: 0 of the 246 points are its own statements and the rest belongs to one function literal inside it that branches (line 111). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/associations.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0fc7f20ea658fb8b8058874d448158c0204fb8a88829d0dc54d3faf7f653d9"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.BuildQuerySQL (cognitive 241): callbacks.BuildQuerySQL has cognitive complexity 241 (threshold 15). Drivers by points: if/else 161, loops 63, boolean chains 13, match/switch 4 (nesting depth added 172). Of this number, 154 points are the body\u0027s own statements and 87 belong to one function literal inside it that branches. 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":"callbacks/query.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"41ae425d37c869a4d57e527a596bcc2bb0febc28d9e2bb12508842f0f37adb59"}},{"ruleId":"D2","level":"warning","message":{"text":"gorm.Scan (cognitive 225): gorm.Scan has cognitive complexity 225 (threshold 15). Drivers by points: if/else 165, loops 39, boolean chains 15, match/switch 5, jumps 1 (nesting depth added 153). 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":"scan.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c01333ee3ac3cd6c15e99ab5c1b34c2aec1c88e1c84daaadaf3c08b9cc007e"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement.BuildCondition (cognitive 221): Statement.BuildCondition has cognitive complexity 221 (threshold 15). Drivers by points: if/else 142, loops 52, match/switch 15, boolean chains 12 (nesting depth added 154). 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":"statement.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6137b40b6a227e6c7b240c9141f329937c8178655dfc738af2900957ddbfd96c"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.ParseField (cognitive 204): Schema.ParseField has cognitive complexity 204 (threshold 15). Drivers by points: if/else 143, boolean chains 26, loops 26, match/switch 9 (nesting depth added 100). Of this number, 166 points are the body\u0027s own statements and 38 belong to one function literal inside it that branches. 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":"schema/field.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e452f696f45dfeb7929fb268876dbc791d14a0980efc3f071d334a4ddd7f115"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.ConvertToAssignments (cognitive 192): callbacks.ConvertToAssignments has cognitive complexity 192 (threshold 15). Drivers by points: if/else 137, loops 25, boolean chains 24, match/switch 6 (nesting depth added 119). Of this number, 185 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"callbacks/update.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe0fd1a1927b38b843bb343c475f011db26c6c547c996c4267d8f56c5c3d575f"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.ConvertToCreateValues (cognitive 187): callbacks.ConvertToCreateValues has cognitive complexity 187 (threshold 15). Drivers by points: if/else 117, loops 36, boolean chains 22, match/switch 12 (nesting depth added 122). 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":"callbacks/create.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a261fdfcaf413536f8da5b7bd79e463a2a3bdff694ba36cce1c61bf6b44a174b"}},{"ruleId":"D2","level":"warning","message":{"text":"Association.saveAssociation (cognitive 151): Association.saveAssociation has cognitive complexity 151 (threshold 15). Drivers by points: if/else 107, loops 30, match/switch 8, boolean chains 6 (nesting depth added 90). Of this number, 95 points are the body\u0027s own statements and 56 belong to one function literal inside it that branches. 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":"association.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6041fd7766e0aafd5b06117db006666884860e52ac8a4e3e6004708a03cdee"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.ParseWithSpecialTableName (cognitive 137): schema.ParseWithSpecialTableName has cognitive complexity 137 (threshold 15). Drivers by points: if/else 104, loops 16, boolean chains 12, match/switch 5 (nesting depth added 64). Of this number, 136 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"schema/schema.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ef706e361b05a18056f482426af6c6be33a0d51b2d4a8a40fc12efdc6e6082"}},{"ruleId":"D2","level":"warning","message":{"text":"Association.Delete (cognitive 127): Association.Delete has cognitive complexity 127 (threshold 15). Drivers by points: if/else 81, loops 36, match/switch 9, boolean chains 1 (nesting depth added 89). Of this number, 64 points are the body\u0027s own statements and 63 belong to one function literal inside it that branches. 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":"association.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"337ca4cc44e15bf5ab140bbe32ce1bec2990fc1e37ac2271353d1352d857d864"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.SaveBeforeAssociations (cognitive 111): callbacks.SaveBeforeAssociations has cognitive complexity 111 (threshold 15). Drivers by points: if/else 82, loops 21, boolean chains 5, match/switch 3 (nesting depth added 83). Most of this is not in the body itself: 0 of the 111 points are its own statements and the rest belongs to one function literal inside it that branches (line 14). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/associations.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9952739b7ad7f4e27088fc940399dd956fd10cc0536b797d687b4fd70f1ca39a"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.Create (cognitive 109): callbacks.Create has cognitive complexity 109 (threshold 15). Drivers by points: if/else 84, loops 17, boolean chains 5, match/switch 3 (nesting depth added 62). Most of this is not in the body itself: 0 of the 109 points are its own statements and the rest belongs to one function literal inside it that branches (line 40). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/create.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"64204bb60abe8a3a0ee1fa0126da4261fcbf475c516c54e6de5c98045e4dd666"}},{"ruleId":"D2","level":"warning","message":{"text":"Migrator.AutoMigrate (cognitive 92): Migrator.AutoMigrate has cognitive complexity 92 (threshold 15). Drivers by points: if/else 72, loops 18, boolean chains 2 (nesting depth added 65). Most of this is not in the body itself: 10 of the 92 points are its own statements and the rest belongs to one function literal inside it that branches (line 130). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"migrator/migrator.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e277add54aae83780a74c1a8d555d24ee7dc97bab96abc8d6d6a49c1490d22d"}},{"ruleId":"D2","level":"warning","message":{"text":"Migrator.MigrateColumn (cognitive 87): Migrator.MigrateColumn has cognitive complexity 87 (threshold 15). Drivers by points: if/else 65, boolean chains 16, loops 3, match/switch 3 (nesting depth added 38). 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":"migrator/migrator.go"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"beffc005a00d71aea55747277c2ba601b0aae6e8df79ed7eb0defcabe9b5b606"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.guessRelation (cognitive 85): Schema.guessRelation has cognitive complexity 85 (threshold 15). Drivers by points: if/else 59, loops 16, boolean chains 5, match/switch 3, jumps 2 (nesting depth added 39). Of this number, 84 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"schema/relationship.go"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"631bda9293ce2ddfaa4692cfb9424d101ca88a6513c14ad88d04f73d4a3558fa"}},{"ruleId":"D2","level":"warning","message":{"text":"Association.Replace (cognitive 82): Association.Replace has cognitive complexity 82 (threshold 15). Drivers by points: if/else 56, loops 18, match/switch 6, boolean chains 2 (nesting depth added 52). 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":"association.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3765ba082f8ad22fd38aab7e1e326d5eb70c406250d83d00d2a298c5738957"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.preload (cognitive 72): callbacks.preload has cognitive complexity 72 (threshold 15). Drivers by points: if/else 40, loops 22, match/switch 9, boolean chains 1 (nesting depth added 35). 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":"callbacks/preload.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33a45866a8a953b2659caa0b4207841fd3ed479b1f166b3c77fd147642304ef"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.DeleteBeforeAssociations (cognitive 69): callbacks.DeleteBeforeAssociations has cognitive complexity 69 (threshold 15). Drivers by points: if/else 48, loops 15, boolean chains 3, match/switch 3 (nesting depth added 47). 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":"callbacks/delete.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e84e26f3110911875a65f775440a516aedb714e80ee4b37312fb612ea31e4c8"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.preloadEntryPoint (cognitive 69): callbacks.preloadEntryPoint has cognitive complexity 69 (threshold 15). Drivers by points: if/else 54, loops 9, match/switch 4, boolean chains 2 (nesting depth added 46). Of this number, 59 points are the body\u0027s own statements and 10 belong to one function literal inside it that branches. 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":"callbacks/preload.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c349daad95e5b224b414aad25f1e0106249a49349a55038045ed6a58fc1e8f2c"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.assignInterfacesToValue (cognitive 69): DB.assignInterfacesToValue has cognitive complexity 69 (threshold 15). Drivers by points: if/else 49, match/switch 11, loops 9 (nesting depth added 52). 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":"finisher_api.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dcbbf4307f40636e0151e495de68f7ac4bcf22e7bd191ed73644a36fc17d79"}},{"ruleId":"D2","level":"warning","message":{"text":"Migrator.CreateTable (cognitive 64): Migrator.CreateTable has cognitive complexity 64 (threshold 15). Drivers by points: if/else 46, loops 15, boolean chains 3 (nesting depth added 39). Most of this is not in the body itself: 3 of the 64 points are its own statements and the rest belongs to one function literal inside it that branches (line 219). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"migrator/migrator.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d41685eb615ff019c08f1c45a70269db8c0c6fec1008481d045e33f11a5c0c4"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.ExplainSQL (cognitive 63): logger.ExplainSQL has cognitive complexity 63 (threshold 15). Drivers by points: if/else 41, boolean chains 10, loops 6, match/switch 6 (nesting depth added 24). Most of this is not in the body itself: 12 of the 63 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 57, 172). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"logger/sql.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"c34f23e5c871d69da969e79bd74bbdd2e20c6dca857a6023f35b3bb82bbb6af1"}},{"ruleId":"D2","level":"warning","message":{"text":"NamedExpr.Build (cognitive 60): NamedExpr.Build has cognitive complexity 60 (threshold 15). Drivers by points: if/else 43, loops 9, match/switch 5, boolean chains 3 (nesting depth added 32). Of this number, 42 points are the body\u0027s own statements and 18 belong to one function literal inside it that branches. 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":"clause/expression.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"589603bf4c3551ea77a6d1ea9fc19b42591c2d9e2e3055d9ec79c1d893ca7391"}},{"ruleId":"D2","level":"warning","message":{"text":"NotConditions.Build (cognitive 56): NotConditions.Build has cognitive complexity 56 (threshold 15). Drivers by points: if/else 45, loops 5, match/switch 4, boolean chains 2 (nesting depth added 33). 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":"clause/where.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9690ca8b02523a3b9a54c5a794562fb23d1312a1565f37eeb9f818093be5da"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.buildMany2ManyRelation (cognitive 54): Schema.buildMany2ManyRelation has cognitive complexity 54 (threshold 15). Drivers by points: if/else 46, loops 7, boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"schema/relationship.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"948c290c366a531343e86cbfcb1cf7e1839a15161faff5ae3716f5c1d8309835"}},{"ruleId":"D2","level":"warning","message":{"text":"gorm.Open (cognitive 51): gorm.Open has cognitive complexity 51 (threshold 15). Drivers by points: if/else 48, boolean chains 2, loops 1 (nesting depth added 21). Of this number, 44 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"gorm.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d0c75a30840d4d781034d692aaa26c8b9e8bf09aefeedfc4ce82c62d98ddde"}},{"ruleId":"D2","level":"warning","message":{"text":"gorm.sortCallbacks (cognitive 50): gorm.sortCallbacks has cognitive complexity 50 (threshold 15). Drivers by points: if/else 42, boolean chains 5, loops 3 (nesting depth added 19). Most of this is not in the body itself: 10 of the 50 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 284, 266). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks.go"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb644bcb50501b46e3a96363e6db7643e62e08804923a608f19985175b8296a"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement.AddVar (cognitive 47): Statement.AddVar has cognitive complexity 47 (threshold 15). Drivers by points: if/else 31, loops 10, match/switch 5, boolean chains 1 (nesting depth added 28). 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":"statement.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"1944983af9571c3d5d18f6f311434cd48e4c90ece534cc62a099243f75981e7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement.Changed (cognitive 44): Statement.Changed has cognitive complexity 44 (threshold 15). Drivers by points: if/else 32, loops 7, boolean chains 4, match/switch 1 (nesting depth added 23). Of this number, 17 points are the body\u0027s own statements and 27 belong to one function literal inside it that branches. 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":"statement.go"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"0099c39870ab74bb8eec3785c1cc7f678bb4a06220965092c3af7358d60bbdd6"}},{"ruleId":"D2","level":"warning","message":{"text":"setCreateOrUpdateG.handleAssociation (cognitive 41): setCreateOrUpdateG.handleAssociation has cognitive complexity 41 (threshold 15). Drivers by points: if/else 20, loops 9, match/switch 7, boolean chains 5 (nesting depth added 19). Of this number, 38 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. 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":"generics.go"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1112a6bd7fb708b9a2320d0af1cab6c3f9d7580d684b4eec9cdd15b2d313e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement.QuoteTo (cognitive 40): Statement.QuoteTo has cognitive complexity 40 (threshold 15). Drivers by points: if/else 35, loops 4, match/switch 1 (nesting depth added 17). Of this number, 38 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"statement.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"6871b7a584486625a6cacbe95cda9627d17d65ad0a6f600549052e19517b8d27"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement.SetColumn (cognitive 40): Statement.SetColumn has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23, loops 10, match/switch 7 (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":"statement.go"},"region":{"startLine":587}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6bb9e94f03388efb881af4b8c999d13ac8498785bb3ce93ed6b5c368f65582"}},{"ruleId":"D2","level":"warning","message":{"text":"Migrator.ReorderModels (cognitive 39): Migrator.ReorderModels has cognitive complexity 39 (threshold 15). Drivers by points: if/else 30, loops 7, boolean chains 2 (nesting depth added 16). Most of this is not in the body itself: 6 of the 39 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 934, 983). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"migrator/migrator.go"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"65da31296de2357fd07d3e2243e6d9caa0cf1ed8825e012be2cccf543cc40993"}},{"ruleId":"D2","level":"warning","message":{"text":"clause.buildExprs (cognitive 38): clause.buildExprs has cognitive complexity 38 (threshold 15). Drivers by points: if/else 29, boolean chains 5, match/switch 3, loops 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":"clause/where.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d839b16b31e85eb5df8d040de0056c88e40d4d067dd184faf9dcb05fcfbdb66"}},{"ruleId":"D2","level":"warning","message":{"text":"chainG.Preload (cognitive 38): chainG.Preload has cognitive complexity 38 (threshold 15). Drivers by points: if/else 27, loops 11 (nesting depth added 20). Most of this is not in the body itself: 0 of the 38 points are its own statements and the rest belongs to one function literal inside it that branches (line 482). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generics.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d8e854a5a6d9a817a9c1ec7fe31f13fc729033c43ea1e3c84d651fcfc5efc6"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.ParseIndexes (cognitive 38): Schema.ParseIndexes has cognitive complexity 38 (threshold 15). Drivers by points: if/else 31, loops 5, boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"schema/index.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b29e7f56e010dc1a8c8142dbc79ed9d99d3b24e500ce8693a78a389f349f99"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.Delete (cognitive 37): callbacks.Delete has cognitive complexity 37 (threshold 15). Drivers by points: if/else 33, boolean chains 2, loops 2 (nesting depth added 20). Most of this is not in the body itself: 0 of the 37 points are its own statements and the rest belongs to one function literal inside it that branches (line 116). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/delete.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b0710c0c4a90d6e1584a0239712b796c818769b387f2e0dd5c330adffb17294"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.scanIntoStruct (cognitive 37): DB.scanIntoStruct has cognitive complexity 37 (threshold 15). Drivers by points: if/else 30, loops 5, boolean chains 2 (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":"scan.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6c546895017a5a25e509d823f615627fb0dbb12840796ba953bf33fc881dd3"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.parseFieldIndexes (cognitive 36): schema.parseFieldIndexes has cognitive complexity 36 (threshold 15). Drivers by points: if/else 32, boolean chains 3, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"schema/index.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e99552107edda3ea3dced3c8748ee2398c355b6215fd44249f53dd536438585"}},{"ruleId":"D2","level":"warning","message":{"text":"processor.Execute (cognitive 34): processor.Execute has cognitive complexity 34 (threshold 15). Drivers by points: if/else 25, boolean chains 5, loops 4 (nesting depth added 9). Of this number, 32 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"callbacks.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8723d3fc37a90978405e2163060fa042b99d8a556470512dc9f191d916c351f1"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.GetIdentityFieldValuesMap (cognitive 34): schema.GetIdentityFieldValuesMap has cognitive complexity 34 (threshold 15). Drivers by points: if/else 20, loops 9, boolean chains 4, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"schema/utils.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5feee8b776c0db96bb49bdb14cb291054003587983a966dc2c95805a0cfbedc"}},{"ruleId":"D2","level":"warning","message":{"text":"Relationship.ParseConstraint (cognitive 34): Relationship.ParseConstraint has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22, loops 7, boolean chains 5 (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":"schema/relationship.go"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"0182a20361aaa9baff5875a90f9712d078c71cf4fb2681c151fed9833936e2e2"}},{"ruleId":"D2","level":"warning","message":{"text":"Statement.SelectAndOmitColumns (cognitive 34): Statement.SelectAndOmitColumns has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17, loops 11, boolean chains 6 (nesting depth added 10). Most of this is not in the body itself: 15 of the 34 points are its own statements and the rest belongs to one function literal inside it that branches (line 719). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"statement.go"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"1530ba93b1aaa70525249bb3f49411c63f6fcc70639a34379637172f83920b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.Update (cognitive 33): callbacks.Update has cognitive complexity 33 (threshold 15). Drivers by points: if/else 30, loops 2, boolean chains 1 (nesting depth added 17). Most of this is not in the body itself: 0 of the 33 points are its own statements and the rest belongs to one function literal inside it that branches (line 59). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/update.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60db23c52efc8e2b911b71927777f141d2351095ea7cf4fc696715dd9d01b82"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.Count (cognitive 32): DB.Count has cognitive complexity 32 (threshold 15). Drivers by points: if/else 28, boolean chains 4 (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":"finisher_api.go"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1896640a775b04e1716987092675bf93cd6a39f34c50a073df78dc03787ca43"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.FindInBatches (cognitive 30): DB.FindInBatches has cognitive complexity 30 (threshold 15). Drivers by points: if/else 26, boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"finisher_api.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"69707f56a3b5fbc9943afda52c8b4c7546db442153c2af8f8ed5416609cd34dd"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.ConvertSliceOfMapToValuesForCreate (cognitive 28): callbacks.ConvertSliceOfMapToValuesForCreate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 19, loops 6, boolean chains 3 (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":"callbacks/helper.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"072db27306fe8a292d63dd9f6a0ad61a1c0e8d04b5e3554f425b326e96863fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"NamingStrategy.toDBName (cognitive 28): NamingStrategy.toDBName has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20, boolean chains 7, 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":"schema/naming.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"568065bb47d8e0d7c0b7a3db0bec7df3a01279d35f2f347693e681d351255b98"}},{"ruleId":"D2","level":"warning","message":{"text":"Migrator.GuessConstraintInterfaceAndTable (cognitive 25): Migrator.GuessConstraintInterfaceAndTable has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15, loops 7, boolean chains 2, match/switch 1 (nesting depth added 10). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"migrator/migrator.go"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea341c9d5fb21aaaa4d5d755fa43392272d0ddf429e075379d29a69a9296aaea"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.Select (cognitive 24): DB.Select has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9, match/switch 8, loops 5, boolean chains 2 (nesting depth added 12). 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":"chainable_api.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3ecb5745f65b6b730b121277437620bb8f921b10912255862282e9bdda0471"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.FirstOrCreate (cognitive 22): DB.FirstOrCreate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16, match/switch 4, loops 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":"finisher_api.go"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"40240a02be809549705082bcfbac282bf5b56ec36d4a51d80c907e9b3f160193"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.Session (cognitive 22): DB.Session has cognitive complexity 22 (threshold 15). Drivers by points: if/else 19, match/switch 2, boolean chains 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":"gorm.go"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd398f4ec9266c799da8be23178cc12ee3614e64527b299865ab5dcf5621c38e"}},{"ruleId":"D2","level":"warning","message":{"text":"schema.GetRelationsValues (cognitive 21): schema.GetRelationsValues has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8, loops 8, match/switch 5 (nesting depth added 13). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 74). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"schema/utils.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3010ab3d3a4aa9c552c06b163212c40820adec248bce6406913558424e9ada"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.parsePreloadMap (cognitive 20): callbacks.parsePreloadMap has cognitive complexity 20 (threshold 15). Drivers by points: loops 11, if/else 9 (nesting depth added 11). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"callbacks/preload.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f59ae44581312581d27a8be54b0f4a826367f3c24e7672abe3cbfddb0d5f2b"}},{"ruleId":"D2","level":"warning","message":{"text":"callbacks.SetupUpdateReflectValue (cognitive 20): callbacks.SetupUpdateReflectValue has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11, loops 7, boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/update.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f0c6ef8a3421fb3d5cfcb4a728f0d888cc87357cac484bb2552a778d5de764"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.Save (cognitive 20): DB.Save has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12, loops 4, boolean chains 3, match/switch 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":"finisher_api.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fc2f2f64598c51659a012101e3a00304e43b6816c8815dbc21ce1e7d6660ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.Transaction (cognitive 19): DB.Transaction has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 3 (nesting depth added 8). Of this number, 12 points are the body\u0027s own statements and 7 belong to 2 function literals inside it that branch. 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":"finisher_api.go"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"38298bd8ffd53a68a441ac98776e5e1c2c60b545ffec4511d33fd967ebea132d"}},{"ruleId":"D2","level":"warning","message":{"text":"chainG.Joins (cognitive 18): chainG.Joins has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18 (nesting depth added 8). Most of this is not in the body itself: 0 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 377). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"generics.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"423d996447ff2a18b305fa2d9374972e0aaa51c4cef2a343b8e868bebfc79924"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.setRelation (cognitive 18): Schema.setRelation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, 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":"schema/relationship.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d499308ed9894c2dadbb29e6fbeae6c989bf43d8e7be7ded07b89492524f56ae"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.buildPolymorphicRelation (cognitive 18): Schema.buildPolymorphicRelation has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"schema/relationship.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4af79d3a790172f0b18207d31fff0d7eed2ee367eeee5b6f2befaa616d4afa"}},{"ruleId":"D2","level":"warning","message":{"text":"SoftDeleteQueryClause.ModifyStatement (cognitive 18): SoftDeleteQueryClause.ModifyStatement has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, loops 4, boolean chains 3 (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":"soft_delete.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76c38b9beaa610f8a20e5045ff2cbadf89c4990373be377a7e4eb94e96deee7"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr.Build (cognitive 17): Expr.Build has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, loops 3, boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clause/expression.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cde616a68a8684f9e0fc710694961323ec59a1d11da2194a7c8796f01d79f38"}},{"ruleId":"D2","level":"warning","message":{"text":"gorm.prepareValues (cognitive 16): gorm.prepareValues has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, loops 6 (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":"scan.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"920dfce7a866860df7e9271ac3cf5923fd4ec1b98d614dd3b8e3d59364c5f9ea"}},{"ruleId":"D2","level":"warning","message":{"text":"OnConflict.Build (cognitive 16): OnConflict.Build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 13, loops 3 (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":"clause/on_conflict.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b291dd2c20cbb3d54d98b8c39299dd72c8db3283e97357ed413a1fc951ac15"}},{"ruleId":"D2","level":"warning","message":{"text":"DB.CreateInBatches (cognitive 16): DB.CreateInBatches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, loops 5, boolean chains 1, match/switch 1 (nesting depth added 8). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 41). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"finisher_api.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fc18735294aa703670022870189fcee05469517b483f745c8ced029d49be46"}},{"ruleId":"D2","level":"warning","message":{"text":"Relationship.ToQueryConditions (cognitive 16): Relationship.ToQueryConditions has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12, loops 4 (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":"schema/relationship.go"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"507385843f73d48f7d9a4f896dede6e99af07505072d5205b923601b238633f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.parseRelation (cognitive 16): Schema.parseRelation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, match/switch 6, boolean chains 1 (nesting depth added 4). 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":"schema/relationship.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"549b108ed4eab9397d0a89184b3f26484c06083b5dd3fe477f7ba5d195aa1bc6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DB: TooManyMethods \u2014 72 methods, declared across 6 files: ./finisher_api.go (30), ./chainable_api.go (24), ./gorm.go (14), ./migrator.go (2), \u002B2 more file(s). That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. 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":"gorm.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a79d1b9eb3f52d5529663816c7f1a7a9857345cd4a85804c55ccd73e54d504"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/field.go: FileTooLong \u2014 739 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":"schema/field.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"696cea3c8fc38fe195aa4663fbddb45e5b8df7903d5653b20f268d292b73e649"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Migrator: 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":"migrator/migrator.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"027c1833d30b8029a85b691cede75ba23c01010b9e5b43273f413c77c83b8486"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: migrator/migrator.go: FileTooLong \u2014 590 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":"migrator/migrator.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b9cc2a9c4d5beb1c724038e830b18559bcc699dfe2dc796deb0eaa54fee279"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./generics.go: FileTooLong \u2014 571 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":"generics.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d249b54b30209efd702c0b33b547f0ccc375491594115951275622500ce9be8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./statement.go: FileTooLong \u2014 522 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":"statement.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"248d63166f62c0a79d3927e5d1762ec193568a02c2095614ae204c27877b8b77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schema/relationship.go: FileTooLong \u2014 511 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":"schema/relationship.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a73df6929331c6efb37b89e3d6084d31f05f12b6875d8d6d809c19427779ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): clause/where.go:192-203 | clause/where.go:227-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"clause/where.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb696a8fa0b8e6099c7f291031e5d31b453f32603e41b263d888e660de9c978"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): association.go:165-174 | association.go:276-285 \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 \u0060association.go:165\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"association.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc19c7346341cd16029cbac2af1e1a540306267f852485272acd81493e38b8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): callbacks/associations.go:72-81 | callbacks/associations.go:309-319 \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 \u0060callbacks/associations.go:72\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":"callbacks/associations.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5513be90aed1b84063a0506cedb556c51b978025ed783cad06f28d0c5682eb74"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): callbacks/associations.go:192-201 | callbacks/associations.go:265-274 \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 \u0060callbacks/associations.go:192\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":"callbacks/associations.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3a837eda20d1d4c8e4f4d2a8aae1eae1efca3586f231a9f427abbbee71a97df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): callbacks/associations.go:243-252 | callbacks/associations.go:329-339 \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 \u0060callbacks/associations.go:243\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":"callbacks/associations.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3109eb8a088d36cfffc3dbad7088580d0b428c21cf279c805e623b9f1ef986b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): generics.go:611-619 | statement.go:235-243 \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 \u0060generics.go:611\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":"generics.go"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"368af0245d1ec1c5d187d96de21dcb4a63b294cf1536fb64cf1071e6612a20ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): migrator/migrator.go:349-357 | migrator/migrator.go:360-368 \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 \u0060migrator/migrator.go:349\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":"migrator/migrator.go"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ba7e6e90fd30249bf99de835b3bb7b0c1f39ff0e0faa9c88b2e4c6e9db7b02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): finisher_api.go:325-333 | finisher_api.go:371-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060finisher_api.go:325\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":"finisher_api.go"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"47266abc7dbbcc9ca53fa0b14089f5c0a553a7f7e1e34753be30f6fc96cf1813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): schema/relationship.go:319-326 | schema/relationship.go:347-354 \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 \u0060schema/relationship.go:319\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":"schema/relationship.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"aec5749f6942d0e538fe2354a6e5843d4a19eee95fc6f14f3dbf96f84bb97a6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): schema/schema.go:155-162 | schema/schema.go:398-405 \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 \u0060schema/schema.go:155\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":"schema/schema.go"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"0747523f22143c41317ecfc8b8d84fd182bbfdbd61380236c7adbf3832585278"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): callbacks/create.go:18-25 | callbacks/update.go:36-43 \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 \u0060callbacks/create.go:18\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":"callbacks/create.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bbeb680f06def9a1e900b7fa03060fb9a9b578f8abe4b49eb25bddab21e717d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): association.go:85-91 | association.go:240-246 \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 \u0060association.go:85\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":"association.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91ac6af6166b09452c60b039a567c5d56fa101df47eeec994d7dffd82a0d9d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): association.go:229-235 | association.go:294-300 \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 \u0060association.go:229\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":"association.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a5c78bd53946de8c7c3fcebc40be08ce760953daf8969ed7f5fc4bbbd446ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): callbacks/associations.go:147-153 | callbacks/associations.go:211-217 \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 \u0060callbacks/associations.go:147\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":"callbacks/associations.go"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d8aab0674ee802a5a728e3b71835285131b579036c22c4c5899fbea834a613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): callbacks/associations.go:158-164 | callbacks/associations.go:252-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060callbacks/associations.go:158\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":"callbacks/associations.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"362bf171ace2d951aa2a90d5aab5ff7b25fdb3f560cce84ee17121b6fa0a99c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): clause/where.go:58-64 | clause/where.go:65-71 \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":"clause/where.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfd41fdb35cec85bc01a0a4b96f80f885b10db0ba6f62d10773d785921ade102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): schema/relationship.go:735-741 | callbacks/delete.go:88-94 \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 \u0060schema/relationship.go:735\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":"schema/relationship.go"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"160cdd224c52364a039bdf4f7febe0d051db93a6e5f83ebe6d49b0fb00bd19b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): callbacks/preload.go:203-209 | callbacks/preload.go:249-255 \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 \u0060callbacks/preload.go:203\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":"callbacks/preload.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"6488afdc2601c11248aafcf86f936436fe23ecbb4262efea3458f23f37306d13"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): chainable_api.go:119-125 | chainable_api.go:149-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060chainable_api.go:119\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":"chainable_api.go"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"e123df83e88fd05014b439a9fccf055eb6da94ad990321d07e974d5cd0a2040e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): chainable_api.go:462-468 | finisher_api.go:785-791 \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 \u0060chainable_api.go:462\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":"chainable_api.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dd03159922fa44a094f0229317f57a06611151d07d83784b3379202eb31b9c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): finisher_api.go:133-139 | finisher_api.go:162-168 \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 \u0060finisher_api.go:133\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":"finisher_api.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4215ab0660a5247d93ba7273987c7299987001008a7eff5bab41c2be8866d6d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): internal/lru/lru.go:241-246 | internal/lru/lru.go:257-262 \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 \u0060internal/lru/lru.go:241\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":"internal/lru/lru.go"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"8982e4465a99ac80d704cd1f3fe050a530dd636bb9418478c59021df5abc27cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): statement.go:434-439 | statement.go:448-453 \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 \u0060statement.go:434\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":"statement.go"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f51a6643e899885973c3fabc8902b408ba15774d9bc314ef1cc337659d3842"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): finisher_api.go:176-181 | finisher_api.go:445-450 \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":"finisher_api.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2430b1834f40ff905b4f9fa0fe26479f530bbfddee0ac584a5dd39cc76b816"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): callbacks/associations.go:208-212 | callbacks/associations.go:280-284 \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 \u0060callbacks/associations.go:208\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":"callbacks/associations.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cae400e355759ff5471460d60449065e52fe60b70ed792375ce671b672ed07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): schema/field.go:673-677 | schema/field.go:682-686 \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 \u0060schema/field.go:673\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":"schema/field.go"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"e217135529c9093148016a45c9af8d5fffe2f512eaf7781b7f6575bd6b1d2071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): schema/field.go:898-902 | schema/field.go:924-928 \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 \u0060schema/field.go:898\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"schema/field.go"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9431af1fa1436af2f77bc30c2d7dbdfc5cb17355d2f2d5975ee9adbe1cd9c6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): callbacks/delete.go:174-178 | callbacks/update.go:90-94 \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. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"callbacks/delete.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13680003e49f1e86438e4b473df20336902b1e839d17cff3daa16c27f12eee2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: finisher_api.go: finisher_api.go changed 2 times in last 90 days, max complexity 20. 2 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, cover the area it touches with tests, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"finisher_api.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5de1e435e47e7df1fa4d2cb3639af39b417e5fcb449f1be13bff788c18f2ac6a"}},{"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: logger/sql.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6da7f53501738b18eec441228206d1e4f480795383f3ead5bc1f88843dce4798"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (2 single-owned of 37 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). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"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":"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":"8dee3870df1534fd1ca68bec89d76eb669c9700514369d831ea93b2fa8f28e6d"},"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":"762e949f27dc98afe88520723873aa6e50bc785c940e834baa0b8bf9d3e89dad"},"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":"0a85b7f486877990f02b41cdbab4d4e0d982259e5fd68ac81e69a51984c290dc"},"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":"8a8696033177e5f7c4729dba9961c91b2a1cf6e4ff0bdafbe8a2eb2916c847a5"},"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":"0a1b16554d7f044e5b64b829e299d230e6dfa4a22439a1a3fe3c953787e7f81d"},"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":"f9ab7342ed302c6d3f03866ca300f153d6cb3f17a7abc653705e7e32af47bfd3"},"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":"2e7c2e9987f1eedf7037ce95738876e7c2e8257c676e76513ef663ea4f33b2a4"},"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":"0b52f9353a22be3663bef907d6e84590685f23d2752127c8979045c9904f6ec4"},"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":"e1fb1af44a054712de221e9144bb4cf74e541340d3ce2cc2809788b98f0eca08"},"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":"ab8d83539c5ebe567cb6deae98d392d6617f9ea4001a34a9a21fb3f393c0be8f"},"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":"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":"9eea85c954a2987bd5bf8511bc58f2e5efaeeb048964b2db197544ecf73ae013"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 10 of 37 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 100 lines or more, excluding tests, vendored, generated and example/demo trees, largest first). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 largest first: callbacks/associations.go, callbacks/query.go, prepare_stmt.go (and 7 more). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"}},{"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":"0752d0df7434000fcabf1048e2de30a7a1a8b982b3db9a19898c4dec199856b4"}},{"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":"231ad4dc838e4a2768e6f7a1e67ca410b16632a9e046ea516d551978147d4308"}},{"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":"945212ddb396c4c12587cb5a126216b64a4fac0ec606f259b4fb41ab4d97644b"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-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-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":19,"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."]}]}