forked from johnkerl/miller
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmost_or_least_frequent.go
288 lines (246 loc) · 8.39 KB
/
most_or_least_frequent.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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
package transformers
import (
"container/list"
"fmt"
"os"
"sort"
"strings"
"github.com/johnkerl/miller/pkg/cli"
"github.com/johnkerl/miller/pkg/lib"
"github.com/johnkerl/miller/pkg/mlrval"
"github.com/johnkerl/miller/pkg/types"
)
// ----------------------------------------------------------------
const verbNameMostFrequent = "most-frequent"
const verbNameLeastFrequent = "least-frequent"
const mostLeastFrequentDefaultMaxOutputLength = int64(10)
const mostLeastFrequentDefaultOutputFieldName = "count"
var MostFrequentSetup = TransformerSetup{
Verb: verbNameMostFrequent,
UsageFunc: transformerMostFrequentUsage,
ParseCLIFunc: transformerMostFrequentParseCLI,
IgnoresInput: false,
}
var LeastFrequentSetup = TransformerSetup{
Verb: verbNameLeastFrequent,
UsageFunc: transformerLeastFrequentUsage,
ParseCLIFunc: transformerLeastFrequentParseCLI,
IgnoresInput: false,
}
func transformerMostFrequentUsage(
o *os.File,
) {
argv0 := "mlr"
verb := verbNameMostFrequent
fmt.Fprintf(o, "Usage: %s %s [options]\n", argv0, verb)
fmt.Fprintf(o, "Shows the most frequently occurring distinct values for specified field names.\n")
fmt.Fprintf(o, "The first entry is the statistical mode; the remaining are runners-up.\n")
fmt.Fprintf(o, "Options:\n")
fmt.Fprintf(o, "-f {one or more comma-separated field names}. Required flag.\n")
fmt.Fprintf(o, "-n {count}. Optional flag defaulting to %d.\n", mostLeastFrequentDefaultMaxOutputLength)
fmt.Fprintf(o, "-b Suppress counts; show only field values.\n")
fmt.Fprintf(o, "-o {name} Field name for output count. Default \"%s\".\n", mostLeastFrequentDefaultOutputFieldName)
fmt.Fprintf(o, "See also \"%s %s\".\n", argv0, "least-frequent")
}
func transformerLeastFrequentUsage(
o *os.File,
) {
argv0 := "mlr"
verb := verbNameLeastFrequent
fmt.Fprintf(o, "Usage: %s %s [options]\n", argv0, verb)
fmt.Fprintf(o, "Shows the least frequently occurring distinct values for specified field names.\n")
fmt.Fprintf(o, "The first entry is the statistical anti-mode; the remaining are runners-up.\n")
fmt.Fprintf(o, "Options:\n")
fmt.Fprintf(o, "-f {one or more comma-separated field names}. Required flag.\n")
fmt.Fprintf(o, "-n {count}. Optional flag defaulting to %d.\n", mostLeastFrequentDefaultMaxOutputLength)
fmt.Fprintf(o, "-b Suppress counts; show only field values.\n")
fmt.Fprintf(o, "-o {name} Field name for output count. Default \"%s\".\n", mostLeastFrequentDefaultOutputFieldName)
fmt.Fprintf(o, "See also \"%s %s\".\n", argv0, "most-frequent")
}
func transformerMostFrequentParseCLI(
pargi *int,
argc int,
args []string,
_ *cli.TOptions,
doConstruct bool, // false for first pass of CLI-parse, true for second pass
) IRecordTransformer {
return transformerMostOrLeastFrequentParseCLI(pargi, argc, args, true, transformerMostFrequentUsage, doConstruct)
}
func transformerLeastFrequentParseCLI(
pargi *int,
argc int,
args []string,
_ *cli.TOptions,
doConstruct bool, // false for first pass of CLI-parse, true for second pass
) IRecordTransformer {
return transformerMostOrLeastFrequentParseCLI(pargi, argc, args, false, transformerLeastFrequentUsage, doConstruct)
}
func transformerMostOrLeastFrequentParseCLI(
pargi *int,
argc int,
args []string,
descending bool,
usageFunc TransformerUsageFunc,
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
verb := args[argi]
argi++
// Parse local flags
var groupByFieldNames []string = nil
maxOutputLength := mostLeastFrequentDefaultMaxOutputLength
showCounts := true
outputFieldName := mostLeastFrequentDefaultOutputFieldName
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" {
usageFunc(os.Stdout)
os.Exit(0)
} else if opt == "-f" {
groupByFieldNames = cli.VerbGetStringArrayArgOrDie(verb, opt, args, &argi, argc)
} else if opt == "-n" {
maxOutputLength = cli.VerbGetIntArgOrDie(verb, opt, args, &argi, argc)
} else if opt == "-b" {
showCounts = false
} else if opt == "-o" {
outputFieldName = cli.VerbGetStringArgOrDie(verb, opt, args, &argi, argc)
} else {
usageFunc(os.Stderr)
os.Exit(1)
}
}
if groupByFieldNames == nil {
usageFunc(os.Stderr)
os.Exit(1)
return nil
}
*pargi = argi
if !doConstruct { // All transformers must do this for main command-line parsing
return nil
}
transformer, err := NewTransformerMostOrLeastFrequent(
groupByFieldNames,
maxOutputLength,
showCounts,
outputFieldName,
descending,
)
if err != nil {
fmt.Fprintln(os.Stderr, err)
os.Exit(1)
}
return transformer
}
// ----------------------------------------------------------------
type TransformerMostOrLeastFrequent struct {
groupByFieldNames []string
maxOutputLength int64
showCounts bool
outputFieldName string
descending bool
countsByGroup *lib.OrderedMap // map[string]int
valuesForGroup map[string][]*mlrval.Mlrval
}
type tMostOrLeastFrequentSortPair struct {
count int64
groupingKey string
}
// ----------------------------------------------------------------
func NewTransformerMostOrLeastFrequent(
groupByFieldNames []string,
maxOutputLength int64,
showCounts bool,
outputFieldName string,
descending bool,
) (*TransformerMostOrLeastFrequent, error) {
tr := &TransformerMostOrLeastFrequent{
groupByFieldNames: groupByFieldNames,
maxOutputLength: maxOutputLength,
showCounts: showCounts,
outputFieldName: outputFieldName,
descending: descending,
countsByGroup: lib.NewOrderedMap(),
valuesForGroup: make(map[string][]*mlrval.Mlrval),
}
return tr, nil
}
// ----------------------------------------------------------------
func (tr *TransformerMostOrLeastFrequent) Transform(
inrecAndContext *types.RecordAndContext,
outputRecordsAndContexts *list.List, // list of *types.RecordAndContext
inputDownstreamDoneChannel <-chan bool,
outputDownstreamDoneChannel chan<- bool,
) {
HandleDefaultDownstreamDone(inputDownstreamDoneChannel, outputDownstreamDoneChannel)
if !inrecAndContext.EndOfStream {
inrec := inrecAndContext.Record
groupingKey, ok := inrec.GetSelectedValuesJoined(tr.groupByFieldNames)
if !ok {
return
}
iCount := tr.countsByGroup.Get(groupingKey)
if iCount == nil {
tr.countsByGroup.Put(groupingKey, int64(1))
} else {
tr.countsByGroup.Put(groupingKey, iCount.(int64)+1)
}
if tr.valuesForGroup[groupingKey] == nil {
selectedValues, _ := inrec.GetSelectedValues(tr.groupByFieldNames)
tr.valuesForGroup[groupingKey] = selectedValues
}
} else {
// TODO: Use a heap so this would be m log(n) not n log(n), where m is
// the output length and n is the input length. (Each delete-max would
// be O(log n) and there would be m of them.)
// Copy keys and counters from hashmap to array for sorting
inputLength := tr.countsByGroup.FieldCount
sortPairs := make([]tMostOrLeastFrequentSortPair, inputLength)
i := 0
for pe := tr.countsByGroup.Head; pe != nil; pe = pe.Next {
groupingKey := pe.Key
count := pe.Value.(int64)
sortPairs[i].groupingKey = groupingKey
sortPairs[i].count = count
i++
}
// Sort by count
// Go sort API: for ascending sort, return true if element i < element j.
if tr.descending {
sort.Slice(sortPairs, func(i, j int) bool {
return sortPairs[i].count > sortPairs[j].count
})
} else {
sort.Slice(sortPairs, func(i, j int) bool {
return sortPairs[i].count < sortPairs[j].count
})
}
// Emit top n
outputLength := inputLength
if inputLength > tr.maxOutputLength {
outputLength = tr.maxOutputLength
}
for i := int64(0); i < outputLength; i++ {
outrec := mlrval.NewMlrmapAsRecord()
groupByFieldValues := tr.valuesForGroup[sortPairs[i].groupingKey]
for j := range tr.groupByFieldNames {
outrec.PutCopy(
tr.groupByFieldNames[j],
groupByFieldValues[j],
)
}
if tr.showCounts {
outrec.PutReference(tr.outputFieldName, mlrval.FromInt(sortPairs[i].count))
}
outputRecordsAndContexts.PushBack(types.NewRecordAndContext(outrec, &inrecAndContext.Context))
}
outputRecordsAndContexts.PushBack(inrecAndContext) // End-of-stream marker
}
}