-
Notifications
You must be signed in to change notification settings - Fork 216
/
shuffle.go
154 lines (131 loc) · 4.2 KB
/
shuffle.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
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
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
package transformers
import (
"container/list"
"fmt"
"os"
"strings"
"github.com/johnkerl/miller/v6/pkg/cli"
"github.com/johnkerl/miller/v6/pkg/lib"
"github.com/johnkerl/miller/v6/pkg/types"
)
// ----------------------------------------------------------------
const verbNameShuffle = "shuffle"
var ShuffleSetup = TransformerSetup{
Verb: verbNameShuffle,
UsageFunc: transformerShuffleUsage,
ParseCLIFunc: transformerShuffleParseCLI,
IgnoresInput: false,
}
func transformerShuffleUsage(
o *os.File,
) {
fmt.Fprintf(o, "Usage: %s %s [options]\n", "mlr", verbNameShuffle)
fmt.Fprintf(o, "Outputs records randomly permuted. No output records are produced until\n")
fmt.Fprintf(o, "all input records are read. See also %s bootstrap and %s sample.\n",
"mlr", "mlr",
)
fmt.Fprintf(o, "Options:\n")
fmt.Fprintf(o, "-h|--help Show this message.\n")
}
func transformerShuffleParseCLI(
pargi *int,
argc int,
args []string,
_ *cli.TOptions,
doConstruct bool, // false for first pass of CLI-parse, true for second pass
) IRecordTransformer {
// Skip the verb name from the current spot in the mlr command line
argi := *pargi
argi++
for argi < argc /* variable increment: 1 or 2 depending on flag */ {
opt := args[argi]
if !strings.HasPrefix(opt, "-") {
break // No more flag options to process
}
if args[argi] == "--" {
break // All transformers must do this so main-flags can follow verb-flags
}
argi++
if opt == "-h" || opt == "--help" {
transformerShuffleUsage(os.Stdout)
os.Exit(0)
} else {
transformerShuffleUsage(os.Stderr)
os.Exit(1)
}
}
*pargi = argi
if !doConstruct { // All transformers must do this for main command-line parsing
return nil
}
transformer, err := NewTransformerShuffle()
if err != nil {
fmt.Fprintln(os.Stderr, err)
os.Exit(1)
}
return transformer
}
// ----------------------------------------------------------------
type TransformerShuffle struct {
recordsAndContexts *list.List
}
func NewTransformerShuffle() (*TransformerShuffle, error) {
tr := &TransformerShuffle{
recordsAndContexts: list.New(),
}
return tr, nil
}
// ----------------------------------------------------------------
func (tr *TransformerShuffle) Transform(
inrecAndContext *types.RecordAndContext,
outputRecordsAndContexts *list.List, // list of *types.RecordAndContext
inputDownstreamDoneChannel <-chan bool,
outputDownstreamDoneChannel chan<- bool,
) {
HandleDefaultDownstreamDone(inputDownstreamDoneChannel, outputDownstreamDoneChannel)
// Not end of input stream: retain the record, and emit nothing until end of stream.
if !inrecAndContext.EndOfStream {
tr.recordsAndContexts.PushBack(inrecAndContext)
} else { // end of record stream
// Knuth shuffle:
// * Initial permutation is identity.
// * Make a pseudorandom permutation using pseudorandom swaps in the image map.
// TODO: Go list Len() maxes at 2^31. We should track this ourselves in an int64.
n := int64(tr.recordsAndContexts.Len())
images := make([]int64, n)
for i := int64(0); i < n; i++ {
images[i] = i
}
unusedStart := int64(0)
numUnused := n
for i := int64(0); i < n; i++ {
// Select a pseudorandom element from the pool of unused images.
u := lib.RandRange(unusedStart, unusedStart+numUnused)
temp := images[u]
images[u] = images[i]
images[i] = temp
// Decrease the size of the pool by 1. (Yes, unusedStart and k always have the same value.
// Using two variables wastes negligible memory and makes the code easier to understand.)
unusedStart++
numUnused--
}
// Move the record-pointers from linked list to array.
array := make([]*types.RecordAndContext, n)
for i := int64(0); i < n; i++ {
head := tr.recordsAndContexts.Front()
if head == nil {
break
}
array[i] = head.Value.(*types.RecordAndContext)
tr.recordsAndContexts.Remove(head)
}
// Transfer from input array to output list. Because permutations are one-to-one maps,
// all input records have ownership transferred exactly once. So, there are no
// records to copy here.
for i := int64(0); i < n; i++ {
outputRecordsAndContexts.PushBack(array[images[i]])
}
// Emit the stream-terminating null record
outputRecordsAndContexts.PushBack(inrecAndContext)
}
}