SonarQube

trees/btree/btree.go

@@ -210,8 +210,7 @@ func (tree *Tree) RightValue() interface{} {
 // String returns a string representation of container (for debugging purposes)
 func (tree *Tree) String() string {
 	var buffer bytes.Buffer
-	if _, err := buffer.WriteString("BTree\n"); err != nil {
+	buffer.WriteString("BTree\n")
-	}
 	if !tree.Empty() {
 		tree.output(&buffer, tree.Root, 0, true)
 	}
@@ -228,10 +227,8 @@ func (tree *Tree) output(buffer *bytes.Buffer, node *Node, level int, isTail boo
 			tree.output(buffer, node.Children[e], level+1, true)
 		}
 		if e < len(node.Entries) {
-			if _, err := buffer.WriteString(strings.Repeat("    ", level)); err != nil {
+			buffer.WriteString(strings.Repeat("    ", level))
-			}
+			buffer.WriteString(fmt.Sprintf("%v", node.Entries[e].Key) + "\n")
-			if _, err := buffer.WriteString(fmt.Sprintf("%v", node.Entries[e].Key) + "\n"); err != nil {
-			}
 		}
 	}
 }

trees/btree/btree_test.go

@@ -1001,7 +1001,7 @@ func TestBTreeIteratorLast(t *testing.T) {
 	}
 }
 
-func TestBTree_search(t *testing.T) {
+func TestBTreeSearch(t *testing.T) {
 	{
 		tree := NewWithIntComparator(3)
 		tree.Root = &Node{Entries: []*Entry{}, Children: make([]*Node, 0)}