golang map和for循环的查找效率对比

<pre class="brush:go;gutter:true;">package main import ( "encoding/json" "fmt" "math/rand" "strconv" "testing" "time" ) func TestMap(t *testing.T) { num := 100 testdata := initTestData(num) random := rand.New(rand.NewSource(time.Now().UnixNano())) searchs := make([]int, num) for i := 0; i < num; i { searchs[i] = int(random.Int31n(int32(num))) } find := true t.Log(find) start := time.Now() hash := make(map[int]*TestStruct, num) for i := 0; i < num; i { hash[testdata[i].Id] = testdata[i] } for _, item := range searchs { _, has := hash[item] find = has } end := time.Now() t.Log("cost:", end.UnixNano()-start.UnixNano()) start = time.Now() for _, item := range searchs { for _, data := range testdata { if item == data.Id { find = true break } } } end = time.Now() t.Log("cost:", end.UnixNano()-start.UnixNano()) } type TestStruct struct { Id int No string } func initTestData(num int) []*TestStruct { result := make([]*TestStruct, num) for i := 0; i < num; i { result[i] = &TestStruct{ Id: i 1, No: strconv.Itoa(i 1), } } return result } </pre>