We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 47baa28 commit a2ebfb3Copy full SHA for a2ebfb3
README.md
@@ -26,8 +26,8 @@ Features:
26
package main
27
28
import (
29
- "fmt"
30
- "github.com/plar/go-adaptive-radix-tree"
+ "fmt"
+ art "github.com/plar/go-adaptive-radix-tree"
31
)
32
33
func main() {
@@ -57,7 +57,7 @@ func main() {
57
// Iterate over the tree in descending order using reverse traversal
58
fmt.Println("\nDescending order iteration:")
59
tree.ForEach(func(node art.Node) bool {
60
- fmt.Printf("Key: %s, Value: %s\n", node.Key(), node.Value()))
+ fmt.Printf("Key: %s, Value: %s\n", node.Key(), node.Value())
61
return true
62
}, art.TraverseReverse)
63
0 commit comments