-
Notifications
You must be signed in to change notification settings - Fork 108
Expand file tree
/
Copy pathgenerics.go
More file actions
122 lines (109 loc) · 3.03 KB
/
generics.go
File metadata and controls
122 lines (109 loc) · 3.03 KB
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
package lib
import (
"bytes"
"github.com/pkg/errors"
)
// Generic Set object. Retains the order elements are addd to the set.
type Set[T comparable] struct {
_innerMap map[T]struct{}
}
func NewSet[T comparable](elements []T) *Set[T] {
set := &Set[T]{_innerMap: make(map[T]struct{})}
for _, element := range elements {
set.Add(element)
}
return set
}
func (set *Set[T]) Add(element T) {
// Add element to set.
if !set.Includes(element) {
set._innerMap[element] = struct{}{}
}
}
func (set *Set[T]) Remove(element T) {
// Remove element from set.
if set.Includes(element) {
delete(set._innerMap, element)
}
}
func (set *Set[T]) Size() int {
// Return size of set.
return len(set._innerMap)
}
func (set *Set[T]) Includes(element T) bool {
// True if the element exists in the set.
_, exists := set._innerMap[element]
return exists
}
func (set *Set[T]) ForEach(applyFunc func(elem T) error) error {
for mapKey := range set._innerMap {
if err := applyFunc(mapKey); err != nil {
return err
}
}
return nil
}
func (set *Set[T]) ToSlice() []T {
// Convert the set to a slice.
var results []T
for element := range set._innerMap {
results = append(results, element)
}
return results
}
func MapSet[T comparable, K any](set *Set[T], mapFunc func(elem T) (K, error)) ([]K, error) {
var results []K
err := set.ForEach(func(elem T) error {
mappedResult, innerErr := mapFunc(elem)
if innerErr != nil {
return innerErr
}
results = append(results, mappedResult)
return nil
})
if err != nil {
return nil, err
}
return results, nil
}
func DecodeDeSoEncoder[T DeSoEncoder](entry T, rr *bytes.Reader) (T, error) {
var emptyEntry T
exist, err := DecodeFromBytes(entry, rr)
if err != nil {
return emptyEntry, errors.Wrapf(err, "DecodeDeSoEncoder: Problem decoding from bytes")
}
if !exist {
return emptyEntry, nil
}
return entry, nil
}
func EncodeDeSoEncoderSlice[T DeSoEncoder](inputSlice []T, blockHeight uint64, skipMetadata ...bool) []byte {
var data []byte
numItems := uint64(len(inputSlice))
data = append(data, UintToBuf(numItems)...)
for _, item := range inputSlice {
data = append(data, EncodeToBytes(blockHeight, item, skipMetadata...)...)
}
return data
}
func DecodeDeSoEncoderSlice[T DeSoEncoder](rr *bytes.Reader) ([]T, error) {
numItems, err := ReadUvarint(rr)
if err != nil {
return nil, errors.Wrapf(err, "DecodeDeSoEncoderSlice: Problem decoding numItems")
}
// Note: is it more efficient to do a make with specific length and set at each index?
inputs, err := SafeMakeSliceWithLength[T](numItems)
if err != nil {
return nil, errors.Wrapf(err, "DecodeDeSoEncoderSlice: Problem making slice with length %d", numItems)
}
var results []T
for ii := uint64(0); ii < numItems; ii++ {
prevEntry := inputs[ii].GetEncoderType().New()
if exist, err := DecodeFromBytes(prevEntry, rr); exist && err == nil {
results = append(results, prevEntry.(T))
} else if err != nil {
return nil, errors.Wrapf(err, "DecodeDeSoEncoderSlice: Problem decoding item %d of %d", ii, numItems)
}
}
return results, nil
}