-
Notifications
You must be signed in to change notification settings - Fork 0
/
unordered.go
68 lines (56 loc) · 1.44 KB
/
unordered.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
package outputset
import "github.com/andersfylling/go-sortnet/sortnet"
func NewEmptyUnordered() sortnet.OutputSet {
set := &Unordered{
SetMetadata: &sortnet.SetMetadata{},
}
return set
}
func NewUnordered(channels int) sortnet.OutputSet {
return sortnet.PopulateOutputSet(NewEmptyUnordered(), channels)
}
type Unordered struct {
Sequences []sortnet.BinarySequence
*sortnet.SetMetadata
}
func (s *Unordered) Metadata() *sortnet.SetMetadata {
return s.SetMetadata
}
func (s *Unordered) Contains(seq sortnet.BinarySequence) bool {
for i := range s.Sequences {
if seq == s.Sequences[i] {
return true
}
}
return false
}
func (s *Unordered) ContainsInPartition(seq sortnet.BinarySequence, _ int) bool {
return s.Contains(seq)
}
func (s *Unordered) Add(seq sortnet.BinarySequence) {
if !s.Contains(seq) {
s.Sequences = append(s.Sequences, seq)
s.SetMetadata.Add(seq, seq.OnesCount())
}
}
func (s *Unordered) Derive(network sortnet.Network) sortnet.OutputSet {
output := NewEmptyUnordered()
for i := range s.Sequences {
output.Add(network.Transform(s.Sequences[i]))
}
return output
}
func (s *Unordered) Size() int {
return s.SetMetadata.Size
}
func (s *Unordered) IsSubset(other sortnet.OutputSet, permutationMap sortnet.PermutationMap) bool {
for _, seq := range s.Sequences {
if permutationMap != nil {
seq = sortnet.ApplyPermutation(seq, permutationMap)
}
if !other.Contains(seq) {
return false
}
}
return true
}