主文件
package mainvar max = 100var Slice = make([]int, max+10)var Map = make(map[int]int)func init() {for i := 0; i < max; i++ {Slice[i] = iMap[i] = i}}// 查找算法可以优化,本文对于常用无序查找做比较func SearchSlice(i int) int {for _, v := range Slice {if v == i {return v}}return -1}func SearchMap(i int) int {return Map[i]}
测试文件
package mainimport "testing"func BenchmarkSearchMap(b *testing.B) {for i := 0; i < b.N; i++ {_ = SearchMap(i % max)}}func BenchmarkSearchSlice(b *testing.B) {for i := 0; i < b.N; i++ {_ = SearchSlice(i % max)}}func BenchmarkSlice(b *testing.B) {for i := 0; i < b.N; i++ {_ = Slice[i%max]}}
测试结果
max = 100
BenchmarkSearchMap-16 9414829312.7 ns/op 0 B/op0 allocs/opBenchmarkSearchSlice-16 4947344723.6 ns/op 0 B/op0 allocs/opBenchmarkSlice-161874613366.46 ns/op 0 B/op0 allocs/op
max = 10000
BenchmarkSearchMap-16 4314736427.6 ns/op 0 B/op0 allocs/opBenchmarkSearchSlice-16 968623 1159 ns/op0 B/op0 allocs/opBenchmarkSlice-161876494726.42 ns/op 0 B/op0 allocs/op
Max = 1000000
BenchmarkSearchMap-16 1501569090.1 ns/op 0 B/op0 allocs/opBenchmarkSearchSlice-16 441436 104242 ns/op0 B/op0 allocs/opBenchmarkSlice-16 1826207026.58 ns/op 0 B/op0 allocs/op
在一些特定优化条件下,可以尝试用slice,效果会比map好,比如把10 6级的查找优化成3级102查找, 对于一些结构体,可以根据某些特征分类或预先根据特征值排序
如果觉得《golang 中map 和slice 索引速度比较》对你有帮助,请点赞、收藏,并留下你的观点哦!