forked from dgraph-io/dgraph
-
Notifications
You must be signed in to change notification settings - Fork 1
/
count_index.go
90 lines (81 loc) · 2.38 KB
/
count_index.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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
/*
* Copyright (C) 2017 Dgraph Labs, Inc. and Contributors
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Affero General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Affero General Public License for more details.
*
* You should have received a copy of the GNU Affero General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package bulk
import (
"sort"
"sync"
"github.com/dgraph-io/badger"
"github.com/dgraph-io/dgraph/bp128"
"github.com/dgraph-io/dgraph/posting"
"github.com/dgraph-io/dgraph/x"
)
type current struct {
pred string
rev bool
track bool
}
type countIndexer struct {
*state
db *badger.ManagedDB
cur current
counts map[int][]uint64
wg sync.WaitGroup
}
// addUid adds the uid from rawKey to a count index if a count index is
// required by the schema. This method expects keys to be passed into it in
// sorted order.
func (c *countIndexer) addUid(rawKey []byte, count int) {
key := x.Parse(rawKey)
if key == nil || (!key.IsData() && !key.IsReverse()) {
return
}
sameIndexKey := key.Attr == c.cur.pred && key.IsReverse() == c.cur.rev
if sameIndexKey && !c.cur.track {
return
}
if !sameIndexKey {
if len(c.counts) > 0 {
c.wg.Add(1)
go c.writeIndex(c.cur.pred, c.cur.rev, c.counts)
}
if len(c.counts) > 0 || c.counts == nil {
c.counts = make(map[int][]uint64)
}
c.cur.pred = key.Attr
c.cur.rev = key.IsReverse()
c.cur.track = c.schema.getSchema(key.Attr).GetCount()
}
if c.cur.track {
c.counts[count] = append(c.counts[count], key.Uid)
}
}
func (c *countIndexer) writeIndex(pred string, rev bool, counts map[int][]uint64) {
txn := c.db.NewTransactionAt(c.state.writeTs, true)
for count, uids := range counts {
sort.Slice(uids, func(i, j int) bool { return uids[i] < uids[j] })
x.Check(txn.SetWithMeta(
x.CountKey(pred, uint32(count), rev),
bp128.DeltaPack(uids),
posting.BitCompletePosting|posting.BitUidPosting,
))
}
x.Check(txn.CommitAt(c.state.writeTs, nil))
c.wg.Done()
}
func (c *countIndexer) wait() {
c.wg.Wait()
}