From 8944635bf9cff8614a0ce196c59c13ec6d61e8e8 Mon Sep 17 00:00:00 2001
From: huangqian <huangqian1985@qq.com>
Date: Sat, 27 Nov 2021 20:07:39 +0800
Subject: [PATCH] modify "May Output" to "Output" modify fuinction name

---
 container/gtree/gtree_z_example_avltree_test.go      | 10 +++++-----
 container/gtree/gtree_z_example_redblacktree_test.go |  8 ++++----
 2 files changed, 9 insertions(+), 9 deletions(-)

diff --git a/container/gtree/gtree_z_example_avltree_test.go b/container/gtree/gtree_z_example_avltree_test.go
index f14a3361a..1b10c24f5 100644
--- a/container/gtree/gtree_z_example_avltree_test.go
+++ b/container/gtree/gtree_z_example_avltree_test.go
@@ -525,7 +525,7 @@ func ExampleAVLTree_String() {
 
 	fmt.Println(tree.String())
 
-	// May Output:
+	// Output:
 	// │       ┌── key5
 	// │   ┌── key4
 	// └── key3
@@ -556,7 +556,7 @@ func ExampleAVLTree_Print() {
 
 	tree.Print()
 
-	// May Output:
+	// Output:
 	// │       ┌── key5
 	// │   ┌── key4
 	// └── key3
@@ -631,7 +631,7 @@ func ExampleAVLTree_IteratorAsc() {
 	// key: 9 , value: 1
 }
 
-func ExampleAVLTree_IteratorAscFrom_normal() {
+func ExampleAVLTree_IteratorAscFrom_Normal() {
 	m := make(map[interface{}]interface{})
 	for i := 1; i <= 5; i++ {
 		m[i] = i * 10
@@ -651,7 +651,7 @@ func ExampleAVLTree_IteratorAscFrom_normal() {
 	// key: 5 , value: 50
 }
 
-func ExampleAVLTree_IteratorAscFrom_noExistKey() {
+func ExampleAVLTree_IteratorAscFrom_NoExistKey() {
 	m := make(map[interface{}]interface{})
 	for i := 1; i <= 5; i++ {
 		m[i] = i * 10
@@ -666,7 +666,7 @@ func ExampleAVLTree_IteratorAscFrom_noExistKey() {
 	// Output:
 }
 
-func ExampleAVLTree_IteratorAscFrom_noExistKeyAndMatchFalse() {
+func ExampleAVLTree_IteratorAscFrom_NoExistKeyAndMatchFalse() {
 	m := make(map[interface{}]interface{})
 	for i := 1; i <= 5; i++ {
 		m[i] = i * 10
diff --git a/container/gtree/gtree_z_example_redblacktree_test.go b/container/gtree/gtree_z_example_redblacktree_test.go
index 182479b7f..46a39c6d1 100644
--- a/container/gtree/gtree_z_example_redblacktree_test.go
+++ b/container/gtree/gtree_z_example_redblacktree_test.go
@@ -2,7 +2,7 @@
 //
 // This Source Code Form is subject to the terms of the MIT License.
 // If a copy of the MIT was not distributed with gm file,
-// You can obtain one at https://github.com/Agogf/gf.
+// You can obtain one at https://github.com/gogf/gf.
 
 package gtree_test
 
@@ -543,7 +543,7 @@ func ExampleRedBlackTree_IteratorAsc() {
 	// key: 9 , value: 1
 }
 
-func ExampleRedBlackTree_IteratorAscFrom_normal() {
+func ExampleRedBlackTree_IteratorAscFrom_Normal() {
 	m := make(map[interface{}]interface{})
 	for i := 1; i <= 5; i++ {
 		m[i] = i * 10
@@ -563,7 +563,7 @@ func ExampleRedBlackTree_IteratorAscFrom_normal() {
 	// key: 5 , value: 50
 }
 
-func ExampleRedBlackTree_IteratorAscFrom_noExistKey() {
+func ExampleRedBlackTree_IteratorAscFrom_NoExistKey() {
 	m := make(map[interface{}]interface{})
 	for i := 1; i <= 5; i++ {
 		m[i] = i * 10
@@ -578,7 +578,7 @@ func ExampleRedBlackTree_IteratorAscFrom_noExistKey() {
 	// Output:
 }
 
-func ExampleRedBlackTree_IteratorAscFrom_noExistKeyAndMatchFalse() {
+func ExampleRedBlackTree_IteratorAscFrom_NoExistKeyAndMatchFalse() {
 	m := make(map[interface{}]interface{})
 	for i := 1; i <= 5; i++ {
 		m[i] = i * 10