-
Notifications
You must be signed in to change notification settings - Fork 328
/
dedupe.go
58 lines (49 loc) · 1.41 KB
/
dedupe.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
// Copyright (C) 2018 Google Inc.
//
// 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 data
import (
"bytes"
"sort"
)
// Dedupe returns a new byte slice containing the concatenated bytes of slices
// with duplicates removed, along with indices that map slices into the new
// slice.
func Dedupe(slices [][]byte) ([]byte, []int) {
if len(slices) == 0 {
return nil, nil
}
type lenidx struct {
len, idx int
}
lis := make([]lenidx, len(slices))
for i, slice := range slices {
lis[i] = lenidx{len(slice), i}
}
sort.Slice(lis, func(i, j int) bool { return lis[i].len > lis[j].len })
idxs := make([]int, len(slices))
buf := bytes.Buffer{}
buf.Write(slices[lis[0].idx])
idxs[lis[0].idx] = 0
for _, li := range lis[1:] {
s := slices[li.idx]
idx := bytes.Index(buf.Bytes(), s)
if idx < 0 {
idxs[li.idx] = buf.Len()
buf.Write(s)
} else {
idxs[li.idx] = idx
}
}
return buf.Bytes(), idxs
}