pkg/trie/trie_revert.go
Method Trie.maybeDeleteSubTree has a Cognitive Complexity of 29 (exceeds 20 allowed). Consider refactoring. Open
Open
func (s *Trie) maybeDeleteSubTree(original, maybeDelete []byte, height, iBatch int, batch, batch2 [][]byte, ch chan<- (error)) {
if height == 0 {
if !bytes.Equal(original, maybeDelete) && len(maybeDelete) != 0 {
s.maybeDeleteRevertedNode(maybeDelete, 0)
}- Read upRead up
Cognitive Complexity
Cognitive Complexity is a measure of how difficult a unit of code is to intuitively understand. Unlike Cyclomatic Complexity, which determines how difficult your code will be to test, Cognitive Complexity tells you how difficult your code will be to read and comprehend.
A method's cognitive complexity is based on a few simple rules:
- Code is not considered more complex when it uses shorthand that the language provides for collapsing multiple statements into one
- Code is considered more complex for each "break in the linear flow of the code"
- Code is considered more complex when "flow breaking structures are nested"
Further reading
Method Trie.maybeDeleteSubTree has 56 lines of code (exceeds 50 allowed). Consider refactoring. Open
Open
func (s *Trie) maybeDeleteSubTree(original, maybeDelete []byte, height, iBatch int, batch, batch2 [][]byte, ch chan<- (error)) {
if height == 0 {
if !bytes.Equal(original, maybeDelete) && len(maybeDelete) != 0 {
s.maybeDeleteRevertedNode(maybeDelete, 0)
}Method Trie.maybeDeleteSubTree has 7 return statements (exceeds 4 allowed). Open
Open
func (s *Trie) maybeDeleteSubTree(original, maybeDelete []byte, height, iBatch int, batch, batch2 [][]byte, ch chan<- (error)) {
if height == 0 {
if !bytes.Equal(original, maybeDelete) && len(maybeDelete) != 0 {
s.maybeDeleteRevertedNode(maybeDelete, 0)
}