pkg/trie/trie_merkle_proof.go
Method Trie.merkleProof
has 10 return statements (exceeds 4 allowed). Open
Open
func (s *Trie) merkleProof(root, key []byte, batch [][]byte, height, iBatch int) ([][]byte, bool, []byte, []byte, error) {
if len(root) == 0 {
// proove that an empty subtree is on the path of the key
return nil, false, nil, nil, nil
}
Method Trie.verifyInclusionC
has 5 return statements (exceeds 4 allowed). Open
Open
func (s *Trie) verifyInclusionC(bitmap, key, leafHash []byte, ap [][]byte, length, keyIndex, apIndex int) []byte {
if keyIndex == length {
return leafHash
}
if bitIsSet(key, keyIndex) {