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 7ac1530 commit 332d141Copy full SHA for 332d141
README.md
@@ -25,8 +25,8 @@ Features:
25
package main
26
27
import (
28
- "fmt"
29
- "github.com/plar/go-adaptive-radix-tree/v2"
+ "fmt"
+ art "github.com/plar/go-adaptive-radix-tree/v2"
30
)
31
32
func main() {
@@ -56,7 +56,7 @@ func main() {
56
// Iterate over the tree in descending order using reverse traversal
57
fmt.Println("\nDescending order iteration:")
58
tree.ForEach(func(node art.Node) bool {
59
- fmt.Printf("Key: %s, Value: %s\n", node.Key(), node.Value()))
+ fmt.Printf("Key: %s, Value: %s\n", node.Key(), node.Value())
60
return true
61
}, art.TraverseReverse)
62
0 commit comments