github.com/m3db/m3@v1.5.0/src/dbnode/storage/dirty_series_new_map_gen.go (about)

     1  // Copyright (c) 2019 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  // This file was automatically generated by genny.
    22  // Any changes will be lost if this file is regenerated.
    23  // see https://github.com/mauricelam/genny
    24  
    25  package storage
    26  
    27  import (
    28  	"bytes"
    29  
    30  	"github.com/cespare/xxhash/v2"
    31  )
    32  
    33  // newDirtySeriesMap returns a new byte keyed map.
    34  func newDirtySeriesMap() *dirtySeriesMap {
    35  	return _dirtySeriesMapAlloc(_dirtySeriesMapOptions{
    36  		hash: func(k idAndBlockStart) dirtySeriesMapHash {
    37  			hash := uint64(7)
    38  			hash = 31*hash + xxhash.Sum64(k.id)
    39  			hash = 31*hash + uint64(k.blockStart)
    40  			return dirtySeriesMapHash(hash)
    41  		},
    42  		equals: func(x, y idAndBlockStart) bool {
    43  			// Note: Do cheap check (int comparison) first.
    44  			return x.blockStart == y.blockStart && bytes.Equal(x.id, y.id)
    45  		},
    46  		copy: func(k idAndBlockStart) idAndBlockStart {
    47  			return idAndBlockStart{
    48  				id:         append(make([]byte, 0, len(k.id)), k.id...),
    49  				blockStart: k.blockStart,
    50  			}
    51  		},
    52  	})
    53  }