github.com/m3db/m3@v1.5.1-0.20231129193456-75a402aa583b/src/dbnode/client/received_blocks_new_map.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 client
    22  
    23  import (
    24  	"github.com/m3db/m3/src/x/ident"
    25  	"github.com/m3db/m3/src/x/pool"
    26  
    27  	"github.com/cespare/xxhash/v2"
    28  )
    29  
    30  func newReceivedBlocksMap(pool pool.BytesPool) *receivedBlocksMap {
    31  	return _receivedBlocksMapAlloc(_receivedBlocksMapOptions{
    32  		hash: func(k idAndBlockStart) receivedBlocksMapHash {
    33  			// NB(r): Similar to the standard composite key hashes for Java objects
    34  			hash := uint64(7)
    35  			hash = 31*hash + xxhash.Sum64(k.id.Bytes())
    36  			hash = 31*hash + uint64(k.blockStart)
    37  			return receivedBlocksMapHash(hash)
    38  		},
    39  		equals: func(x, y idAndBlockStart) bool {
    40  			return x.id.Equal(y.id) && x.blockStart == y.blockStart
    41  		},
    42  		copy: func(k idAndBlockStart) idAndBlockStart {
    43  			bytes := k.id.Bytes()
    44  			keyLen := len(bytes)
    45  			pooled := pool.Get(keyLen)[:keyLen]
    46  			copy(pooled, bytes)
    47  			return idAndBlockStart{
    48  				id:         ident.BytesID(pooled),
    49  				blockStart: k.blockStart,
    50  			}
    51  		},
    52  		finalize: func(k idAndBlockStart) {
    53  			if slice, ok := k.id.(ident.BytesID); ok {
    54  				pool.Put(slice)
    55  			}
    56  		},
    57  	})
    58  }