bingyi/gf
1
0
Fork 0
mirror of https://gitee.com/johng/gf synced 2026-07-05 21:32:17 +08:00
Code Issues Packages Projects Releases Wiki Activity

modify "May Output" to "Output"

Browse Source 
modify fuinction name
This commit is contained in:
huangqian
2021-11-27 20:07:39 +08:00
parent c4b45d2400
commit 8944635bf9
2 changed files with 9 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
container/gtree/gtree_z_example_avltree_test.go
View File

@ -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

8
container/gtree/gtree_z_example_redblacktree_test.go
View File

@ -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