/
pendingentries.go
79 lines (74 loc) · 2.52 KB
/
pendingentries.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
// MIT License
//
// Copyright 2018 Canonical Ledgers, LLC
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
// IN THE SOFTWARE.
package factom
import (
"bytes"
"sort"
)
// PendingEntries is a list of pending entries which may or may not be
// revealed. If the entry's ChainID is not nil, then its data has been revealed
// and can be queried from factomd.
type PendingEntries []Entry
// Get returns all pending entries sorted by ChainID, and then order they were
// originally returned.
func (pe *PendingEntries) Get(c *Client) error {
if err := c.FactomdRequest("pending-entries", nil, pe); err != nil {
return err
}
sort.SliceStable(*pe, func(i, j int) bool {
pe := *pe
var ci, cj []byte
ei, ej := pe[i], pe[j]
if ei.ChainID != nil {
ci = ei.ChainID[:]
}
if ej.ChainID != nil {
cj = ej.ChainID[:]
}
return bytes.Compare(ci, cj) < 0
})
return nil
}
// Entries efficiently finds and returns all entries in pe for the given
// chainID, if any exist. Otherwise, Entries returns nil.
func (pe PendingEntries) Entries(chainID Bytes32) []Entry {
// Find the first index of the entry with this chainID.
ei := sort.Search(len(pe), func(i int) bool {
var c []byte
e := pe[i]
if e.ChainID != nil {
c = e.ChainID[:]
}
return bytes.Compare(c, chainID[:]) >= 0
})
if ei < len(pe) && *pe[ei].ChainID == chainID {
// Find all remaining entries with the chainID.
for i, e := range pe[ei:] {
if *e.ChainID != chainID {
return pe[ei : ei+i]
}
}
return pe[ei:]
}
// There are no entries for this ChainID.
return nil
}