/
sharding.go
61 lines (55 loc) · 1.61 KB
/
sharding.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
// Copyright 2019 Erik Agsjö
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package letarette
import (
"encoding/binary"
"fmt"
"hash/fnv"
"strconv"
"strings"
"github.com/erkkah/letarette/pkg/protocol"
)
var shardHasher = fnv.New32a()
// ShardIndexFromDocumentID calculated a shard index based on a hash
// of the document ID.
// The hash algorithm is chosen for even distribution in a shard group.
func ShardIndexFromDocumentID(docID protocol.DocumentID, shardGroupSize int) int {
shardHasher.Reset()
_, _ = shardHasher.Write([]byte(docID))
sum := shardHasher.Sum(nil)
intPart := binary.BigEndian.Uint32(sum)
return int(intPart % uint32(shardGroupSize))
}
func parseShardString(shardGroup string) (group, size int, err error) {
parts := strings.SplitN(shardGroup, "/", 2)
parseError := fmt.Errorf("invalid shard group setting")
if len(parts) != 2 {
err = parseError
return
}
group, err = strconv.Atoi(parts[0])
if err != nil {
err = parseError
return
}
size, err = strconv.Atoi(parts[1])
if err != nil {
err = parseError
return
}
if group > size || group < 1 {
err = parseError
}
return
}