Function BenchmarkMergeSorted

algo/uidlist_test.go:75–107

(b *testing.B)

}

func BenchmarkMergeSorted(b *testing.B) {
	createList := func(n int) *pb.List {
		list := make([]uint64, n)
		for i := range list {
			list[i] = uint64(rand.Int63())
		}
		sort.Slice(list, func(i, j int) bool {
			return list[i] < list[j]
		})
		return &pb.List{Uids: list}
	}

	input := []*pb.List{}
	for i := 0; i < 10000; i++ {
		input = append(input, createList(100))
	}

	b.Run("MergeSorted", func(b *testing.B) {
		for i := 0; i < b.N; i++ {
			internalMergeSort(input)
		}
	})
	b.Run("MergeSortedParallel", func(b *testing.B) {
		for i := 0; i < b.N; i++ {
			MergeSortedMoreMem(input)
		}
	})
	b.Run("MergeSortedNew", func(b *testing.B) {
		for i := 0; i < b.N; i++ {
			MergeSorted(input)
		}
	})
}

func TestMergeSortedRandom(t *testing.T) {
	createList := func(n int) *pb.List {