thanks section, cosmetic

README.md

@@ -81,3 +81,7 @@ Copyright © 2018 Igor Mikushkin <igor.mikushkin@gmail.com>.
 This work is free. You can redistribute it and/or modify it under the
 terms of the Do What The Fuck You Want To Public License, Version 2,
 as published by Sam Hocevar. See the LICENSE file for more details.
+
+### Thanks to
+
+[![JetBrains](svg/jetbrains.svg)](https://www.jetbrains.com/?from=treemap)

debug_test.go

@@ -34,6 +34,7 @@ func graphvizEdges(node *node) string {
 }
 
 // nolint: megacheck
+//noinspection GoUnusedFunction
 func graphviz(node *node) string {
 	return "digraph {\nnode [style=filled]\n" + graphvizNodes(node) + graphvizEdges(node) + "}\n"
 }

example/random_test.go

@@ -15,6 +15,7 @@ type TreeMap = intStringTreeMap
 const NumIters = 10000
 const RandMax = 40
 
+//noinspection GoNilness
 func min(kv map[Key]Value) Key {
 	if len(kv) == 0 {
 		return 0
@@ -29,6 +30,7 @@ func min(kv map[Key]Value) Key {
 	return *key
 }
 
+//noinspection GoNilness
 func max(kv map[Key]Value) Key {
 	if len(kv) == 0 {
 		return 0

example/treemap_test.go

@@ -113,7 +113,8 @@ func TestClear(t *testing.T) {
 }
 
 func testRange(t *testing.T, it, end forwardIteratorIntStringTreeMap, exp []string) {
-	var got []string
+	//noinspection GoPreferNilSlice
+	got := []string{}
 	for ; it != end; it.Next() {
 		got = append(got, it.Value())
 	}

treemap.go

@@ -340,6 +340,7 @@ func (t *TreeMap) insertFixup(x *node) {
 }
 
 // nolint: gocyclo
+//noinspection GoNilness
 func removeNode(root *node, z *node) {
 	var y *node
 	if z.left == nil || z.right == nil {

treemap_test.go

@@ -115,7 +115,8 @@ func TestClear(t *testing.T) {
 }
 
 func testRange(t *testing.T, it, end ForwardIterator, exp []Value) {
-	var got []Value
+	//noinspection GoPreferNilSlice
+	got := []Value{}
 	for ; it != end; it.Next() {
 		got = append(got, it.Value())
 	}