github.com/m3db/m3@v1.5.1-0.20231129193456-75a402aa583b/src/m3ninx/postings/roaring/roaring_bench_unions_test.go (about)

     1  // Copyright (c) 2018 Uber Technologies, Inc.
     2  //
     3  // Permission is hereby granted, free of charge, to any person obtaining a copy
     4  // of this software and associated documentation files (the "Software"), to deal
     5  // in the Software without restriction, including without limitation the rights
     6  // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
     7  // copies of the Software, and to permit persons to whom the Software is
     8  // furnished to do so, subject to the following conditions:
     9  //
    10  // The above copyright notice and this permission notice shall be included in
    11  // all copies or substantial portions of the Software.
    12  //
    13  // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
    14  // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
    15  // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
    16  // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
    17  // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
    18  // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
    19  // THE SOFTWARE.
    20  
    21  package roaring
    22  
    23  import (
    24  	"math/rand"
    25  	"testing"
    26  
    27  	"github.com/m3dbx/pilosa/roaring"
    28  )
    29  
    30  const (
    31  	numPls              = 10
    32  	numElemsPer         = 10000
    33  	numTotalElems       = numElemsPer * numPls
    34  	seed          int64 = 123456789
    35  )
    36  
    37  func newRandPostingsLists(numPostingsLists, numElemsPer int) []*roaring.Bitmap {
    38  	rng := rand.New(rand.NewSource(seed))
    39  	elems := make([]uint64, 0, numElemsPer)
    40  	pls := make([]*roaring.Bitmap, 0, numPostingsLists)
    41  	for j := 0; j < numPostingsLists; j++ {
    42  		elems = elems[:0]
    43  		for i := 0; i < numElemsPer; i++ {
    44  			elems = append(elems, rng.Uint64())
    45  		}
    46  		pls = append(pls, roaring.NewBitmap(elems...))
    47  	}
    48  	return pls
    49  }
    50  
    51  func newSampledPostingsLists(numPostingsLists, numTotalElements int) []*roaring.Bitmap {
    52  	elems := make([][]uint64, numPostingsLists)
    53  	for i := 0; i < numTotalElements; i++ {
    54  		idx := i % numPostingsLists
    55  		elems[idx] = append(elems[idx], uint64(i))
    56  	}
    57  	pls := make([]*roaring.Bitmap, 0, numPostingsLists)
    58  	for _, elem := range elems {
    59  		pls = append(pls, roaring.NewBitmap(elem...))
    60  	}
    61  	return pls
    62  }
    63  
    64  func BenchmarkUnionRandPlsFastOr(b *testing.B) {
    65  	pls := newRandPostingsLists(numPls, numElemsPer)
    66  	b.ReportAllocs()
    67  	b.ResetTimer()
    68  	for i := 0; i < b.N; i++ {
    69  		roaring.NewBitmap().UnionInPlace(pls...)
    70  	}
    71  }
    72  
    73  func BenchmarkUnionSampledPlsFastOr(b *testing.B) {
    74  	pls := newSampledPostingsLists(numPls, numTotalElems)
    75  	b.ReportAllocs()
    76  	b.ResetTimer()
    77  	for i := 0; i < b.N; i++ {
    78  		roaring.NewBitmap().UnionInPlace(pls...)
    79  	}
    80  }