-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathreduce.go
83 lines (74 loc) · 2.31 KB
/
reduce.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
// Copyright (c) 2014 Marty Schoch
// 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 gouchstore
import (
"bytes"
)
type reduceFunc func(leaflist *nodeList, count int, context interface{}) ([]byte, error)
func byIdReduce(leaflist *nodeList, count int, context interface{}) ([]byte, error) {
var notDeleted, deleted, size uint64
i := leaflist
for i != nil && count > 0 {
docinfo := DocumentInfo{}
decodeByIdValue(&docinfo, i.data)
if docinfo.Deleted {
deleted++
} else {
notDeleted++
}
size += docinfo.Size
i = i.next
count--
}
return encodeByIdReduce(notDeleted, deleted, size), nil
}
func byIdReReduce(leaflist *nodeList, count int, context interface{}) ([]byte, error) {
var notDeleted, deleted, size uint64
i := leaflist
for i != nil && count > 0 {
if i.pointer != nil {
nd, d, s := decodeByIdReduce(i.pointer.reducedValue)
notDeleted += nd
deleted += d
size += s
}
i = i.next
count--
}
return encodeByIdReduce(notDeleted, deleted, size), nil
}
func encodeByIdReduce(notDeleted, deleted, size uint64) []byte {
buf := new(bytes.Buffer)
buf.Write(encode_raw40(notDeleted))
buf.Write(encode_raw40(deleted))
buf.Write(encode_raw48(size))
return buf.Bytes()
}
func decodeByIdReduce(buf []byte) (uint64, uint64, uint64) {
notDeleted := decode_raw40(buf[0:5])
deleted := decode_raw40(buf[5:10])
size := decode_raw48(buf[10:16])
return notDeleted, deleted, size
}
func bySeqReduce(leaflist *nodeList, count int, context interface{}) ([]byte, error) {
return encode_raw40(uint64(count)), nil
}
func bySeqReReduce(leaflist *nodeList, count int, context interface{}) ([]byte, error) {
var total uint64
i := leaflist
for i != nil && count > 0 {
if i.pointer != nil {
t := decode_raw40(i.pointer.reducedValue)
total += t
}
i = i.next
count--
}
return encode_raw40(total), nil
}