44 "fmt"
55)
66
7- func ExampleInsert () {
7+ func ExampleTree_Insert () {
88 tree := NewTree ()
99 tree .Insert ([]byte ("sth" ), "sth" )
1010 oldValue , ok := tree .Insert ([]byte ("sth" ), "else" )
@@ -21,7 +21,7 @@ func ExampleInsert() {
2121 // else
2222}
2323
24- func ExampleGet () {
24+ func ExampleTree_Get () {
2525 tree := NewTree ()
2626 tree .Insert ([]byte ("sth" ), "sth" )
2727 value , found := tree .Get ([]byte ("sth" ))
@@ -31,7 +31,7 @@ func ExampleGet() {
3131 // Output: sth
3232}
3333
34- func ExampleLongestSuffix () {
34+ func ExampleTree_LongestSuffix () {
3535 tree := NewTree ()
3636 tree .Insert ([]byte ("table" ), "table" )
3737 tree .Insert ([]byte ("able" ), "able" )
@@ -46,7 +46,7 @@ func ExampleLongestSuffix() {
4646 // table
4747}
4848
49- func ExampleRemove () {
49+ func ExampleTree_Remove () {
5050 tree := NewTree ()
5151 tree .Insert ([]byte ("sth" ), "sth" )
5252 oldValue , found := tree .Remove ([]byte ("sth" ))
@@ -62,7 +62,7 @@ func ExampleRemove() {
6262 // Already removed
6363}
6464
65- func ExampleWalk () {
65+ func ExampleTree_Walk () {
6666 tree := NewTree ()
6767 tree .Insert ([]byte ("able" ), 1 )
6868 tree .Insert ([]byte ("table" ), 2 )
@@ -84,7 +84,7 @@ func ExampleWalk() {
8484 // able
8585}
8686
87- func ExampleWalkSuffix () {
87+ func ExampleTree_WalkSuffix () {
8888 tree := NewTree ()
8989 tree .Insert ([]byte ("able" ), 1 )
9090 tree .Insert ([]byte ("table" ), 2 )
0 commit comments