-
-
Notifications
You must be signed in to change notification settings - Fork 95
/
Copy pathseries_generic.go
740 lines (602 loc) · 15 KB
/
series_generic.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
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
// Copyright 2018-20 PJ Engineering and Business Solutions Pty. Ltd. All rights reserved.
package dataframe
import (
"bytes"
"context"
"errors"
"fmt"
"sort"
"sync"
"github.com/olekukonko/tablewriter"
)
// SeriesGeneric is a series of data where the contained data can be
// of any type. Only concrete data types can be used.
type SeriesGeneric struct {
valFormatter ValueToStringFormatter
isEqualFunc IsEqualFunc
isLessThanFunc IsLessThanFunc
concreteType interface{} // The underlying data type
lock sync.RWMutex
name string
values []interface{}
nilCount int
}
// NewSeriesGeneric creates a new generic series.
func NewSeriesGeneric(name string, concreteType interface{}, init *SeriesInit, vals ...interface{}) *SeriesGeneric {
// Validate concrete type
err := checkConcreteType(concreteType)
if err != nil {
panic(err)
}
s := &SeriesGeneric{
isEqualFunc: DefaultIsEqualFunc,
name: name,
concreteType: concreteType,
values: []interface{}{},
nilCount: 0,
}
var (
size int
capacity int
)
if init != nil {
size = init.Size
capacity = init.Capacity
if size > capacity {
capacity = size
}
}
s.values = make([]interface{}, size, capacity)
s.valFormatter = DefaultValueFormatter
for idx, v := range vals {
if v != nil {
if err := s.checkValue(v); err != nil {
panic(err)
}
} else {
s.nilCount++
}
if idx < size {
s.values[idx] = v
} else {
s.values = append(s.values, v)
}
}
if len(vals) < size {
s.nilCount = s.nilCount + size - len(vals)
}
return s
}
// Name returns the series name.
func (s *SeriesGeneric) Name(opts ...Options) string {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.RLock()
defer s.lock.RUnlock()
}
return s.name
}
// Rename renames the series.
func (s *SeriesGeneric) Rename(n string, opts ...Options) {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.RLock()
defer s.lock.RUnlock()
}
s.name = n
}
// Type returns the type of data the series holds.
func (s *SeriesGeneric) Type() string {
return fmt.Sprintf("generic(%T)", s.concreteType)
}
// NRows returns how many rows the series contains.
func (s *SeriesGeneric) NRows(opts ...Options) int {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.RLock()
defer s.lock.RUnlock()
}
return len(s.values)
}
// Value returns the value of a particular row.
// The return value could be nil or the concrete type
// the data type held by the series.
// Pointers are never returned.
func (s *SeriesGeneric) Value(row int, opts ...Options) interface{} {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.RLock()
defer s.lock.RUnlock()
}
val := s.values[row]
if val == nil {
return nil
}
return val
}
// ValueString returns a string representation of a
// particular row. The string representation is defined
// by the function set in SetValueToStringFormatter.
// By default, a nil value is returned as "NaN".
func (s *SeriesGeneric) ValueString(row int, opts ...Options) string {
return s.valFormatter(s.Value(row, opts...))
}
// Prepend is used to set a value to the beginning of the
// series. val can be a concrete data type or nil. Nil
// represents the absence of a value.
func (s *SeriesGeneric) Prepend(val interface{}, opts ...Options) {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.Lock()
defer s.lock.Unlock()
}
// See: https://stackoverflow.com/questions/41914386/what-is-the-mechanism-of-using-append-to-prepend-in-go
if cap(s.values) > len(s.values) {
// There is already extra capacity so copy current values by 1 spot
s.values = s.values[:len(s.values)+1]
copy(s.values[1:], s.values)
if val == nil {
s.values[0] = nil
} else {
if err := s.checkValue(val); err != nil {
panic(err)
}
s.values[0] = val
}
return
}
// No room, new slice needs to be allocated:
s.insert(0, val)
}
// Append is used to set a value to the end of the series.
// val can be a concrete data type or nil. Nil represents
// the absence of a value.
func (s *SeriesGeneric) Append(val interface{}, opts ...Options) int {
var locked bool
if len(opts) == 0 || !opts[0].DontLock {
s.lock.Lock()
defer s.lock.Unlock()
locked = true
}
row := s.NRows(Options{DontLock: locked})
s.insert(row, val)
return row
}
// Insert is used to set a value at an arbitrary row in
// the series. All existing values from that row onwards
// are shifted by 1. val can be a concrete data type or nil.
// Nil represents the absence of a value.
func (s *SeriesGeneric) Insert(row int, val interface{}, opts ...Options) {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.Lock()
defer s.lock.Unlock()
}
s.insert(row, val)
}
func (s *SeriesGeneric) insert(row int, val interface{}) {
s.values = append(s.values, nil)
copy(s.values[row+1:], s.values[row:])
if val == nil {
s.nilCount++
s.values[row] = nil
} else {
if err := s.checkValue(val); err != nil {
panic(err)
}
s.values[row] = val
}
}
// Remove is used to delete the value of a particular row.
func (s *SeriesGeneric) Remove(row int, opts ...Options) {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.Lock()
defer s.lock.Unlock()
}
if s.values[row] == nil {
s.nilCount--
}
s.values = append(s.values[:row], s.values[row+1:]...)
}
// Reset is used clear all data contained in the Series.
func (s *SeriesGeneric) Reset(opts ...Options) {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.Lock()
defer s.lock.Unlock()
}
s.values = []interface{}{}
s.nilCount = 0
}
// Update is used to update the value of a particular row.
// val can be a concrete data type or nil. Nil represents
// the absence of a value.
func (s *SeriesGeneric) Update(row int, val interface{}, opts ...Options) {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.Lock()
defer s.lock.Unlock()
}
if s.values[row] == nil && val != nil {
s.nilCount--
} else if s.values[row] != nil && val == nil {
s.nilCount++
}
if val == nil {
s.values[row] = nil
} else {
if err := s.checkValue(val); err != nil {
panic(err)
}
s.values[row] = val
}
}
// ValuesIterator will return a function that can be used to iterate through all the values.
func (s *SeriesGeneric) ValuesIterator(opts ...ValuesOptions) func() (*int, interface{}, int) {
var (
row int
step int = 1
)
var dontReadLock bool
if len(opts) > 0 {
dontReadLock = opts[0].DontReadLock
row = opts[0].InitialRow
if row < 0 {
row = len(s.values) + row
}
if opts[0].Step != 0 {
step = opts[0].Step
}
}
initial := row
return func() (*int, interface{}, int) {
if !dontReadLock {
s.lock.RLock()
defer s.lock.RUnlock()
}
var t int
if step > 0 {
t = (len(s.values)-initial-1)/step + 1
} else {
t = -initial/step + 1
}
if row > len(s.values)-1 || row < 0 {
// Don't iterate further
return nil, nil, t
}
out := s.values[row]
if out == nil {
out = nil
}
row = row + step
return &[]int{row - step}[0], out, t
}
}
// SetValueToStringFormatter is used to set a function
// to convert the value of a particular row to a string
// representation.
func (s *SeriesGeneric) SetValueToStringFormatter(f ValueToStringFormatter) {
if f == nil {
s.valFormatter = DefaultValueFormatter
return
}
s.valFormatter = f
}
// IsEqualFunc returns true if a is equal to b.
func (s *SeriesGeneric) IsEqualFunc(a, b interface{}) bool {
if s.isEqualFunc == nil {
panic(errors.New("IsEqualFunc not set"))
}
return s.isEqualFunc(a, b)
}
// IsLessThanFunc returns true if a is less than b.
func (s *SeriesGeneric) IsLessThanFunc(a, b interface{}) bool {
if s.isLessThanFunc == nil {
panic(errors.New("IsLessThanFunc not set"))
}
return s.isLessThanFunc(a, b)
}
// SetIsEqualFunc sets a function which can be used to determine
// if 2 values in the series are equal.
func (s *SeriesGeneric) SetIsEqualFunc(f IsEqualFunc) {
if f == nil {
// Return to default
s.isEqualFunc = DefaultIsEqualFunc
} else {
s.isEqualFunc = f
}
}
// SetIsLessThanFunc sets a function which can be used to determine
// if a value is less than another in the series.
func (s *SeriesGeneric) SetIsLessThanFunc(f IsLessThanFunc) {
if f == nil {
// Return to default
s.isLessThanFunc = nil
} else {
s.isLessThanFunc = f
}
}
// Sort will sort the series.
// It will return true if sorting was completed or false when the context is canceled.
func (s *SeriesGeneric) Sort(ctx context.Context, opts ...SortOptions) (completed bool) {
if s.isLessThanFunc == nil {
panic(fmt.Errorf("cannot sort without setting IsLessThanFunc"))
}
defer func() {
if x := recover(); x != nil {
completed = false
}
}()
if len(opts) == 0 {
opts = append(opts, SortOptions{})
}
if !opts[0].DontLock {
s.Lock()
defer s.Unlock()
}
sortFunc := func(i, j int) (ret bool) {
if err := ctx.Err(); err != nil {
panic(err)
}
defer func() {
if opts[0].Desc {
ret = !ret
}
}()
left := s.values[i]
right := s.values[j]
if left == nil {
if right == nil {
// both are nil
return true
}
return true
}
if right == nil {
// left has value and right is nil
return false
}
// Both are not nil
return s.isLessThanFunc(left, right)
}
if opts[0].Stable {
sort.SliceStable(s.values, sortFunc)
} else {
sort.Slice(s.values, sortFunc)
}
return true
}
// Swap is used to swap 2 values based on their row position.
func (s *SeriesGeneric) Swap(row1, row2 int, opts ...Options) {
if row1 == row2 {
return
}
if len(opts) > 0 && !opts[0].DontLock {
s.lock.Lock()
defer s.lock.Unlock()
}
s.values[row1], s.values[row2] = s.values[row2], s.values[row1]
}
// Lock will lock the Series allowing you to directly manipulate
// the underlying slice with confidence.
func (s *SeriesGeneric) Lock() {
s.lock.Lock()
}
// Unlock will unlock the Series that was previously locked.
func (s *SeriesGeneric) Unlock() {
s.lock.Unlock()
}
// Copy will create a new copy of the series.
// It is recommended that you lock the Series before attempting
// to Copy.
func (s *SeriesGeneric) Copy(r ...Range) Series {
if len(s.values) == 0 {
return &SeriesGeneric{
valFormatter: s.valFormatter,
isEqualFunc: s.isEqualFunc,
isLessThanFunc: s.isLessThanFunc,
concreteType: s.concreteType,
name: s.name,
values: []interface{}{},
nilCount: s.nilCount,
}
}
if len(r) == 0 {
r = append(r, Range{})
}
start, end, err := r[0].Limits(len(s.values))
if err != nil {
panic(err)
}
// Copy slice
x := s.values[start : end+1]
newSlice := append(x[:0:0], x...)
return &SeriesGeneric{
valFormatter: s.valFormatter,
isEqualFunc: s.isEqualFunc,
isLessThanFunc: s.isLessThanFunc,
concreteType: s.concreteType,
name: s.name,
values: newSlice,
nilCount: s.nilCount,
}
}
// Table will produce the Series in a table.
func (s *SeriesGeneric) Table(opts ...TableOptions) string {
if len(opts) == 0 {
opts = append(opts, TableOptions{R: &Range{}})
}
if !opts[0].DontLock {
s.lock.RLock()
defer s.lock.RUnlock()
}
data := [][]string{}
headers := []string{"", s.name} // row header is blank
footers := []string{fmt.Sprintf("%dx%d", len(s.values), 1), s.Type()}
if len(s.values) > 0 {
start, end, err := opts[0].R.Limits(len(s.values))
if err != nil {
panic(err)
}
for row := start; row <= end; row++ {
sVals := []string{fmt.Sprintf("%d:", row), s.ValueString(row, dontLock)}
data = append(data, sVals)
}
}
var buf bytes.Buffer
table := tablewriter.NewWriter(&buf)
table.SetHeader(headers)
for _, v := range data {
table.Append(v)
}
table.SetFooter(footers)
table.SetAlignment(tablewriter.ALIGN_CENTER)
table.Render()
return buf.String()
}
// String implements the fmt.Stringer interface. It does not lock the Series.
func (s *SeriesGeneric) String() string {
count := len(s.values)
out := s.name + ": [ "
if count > 6 {
idx := []int{0, 1, 2, count - 3, count - 2, count - 1}
for j, row := range idx {
if j == 3 {
out = out + "... "
}
out = out + s.ValueString(row, dontLock) + " "
}
return out + "]"
}
for row := range s.values {
out = out + s.ValueString(row, dontLock) + " "
}
return out + "]"
}
// ContainsNil will return whether or not the series contains any nil values.
func (s *SeriesGeneric) ContainsNil(opts ...Options) bool {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.RLock()
defer s.lock.RUnlock()
}
return s.nilCount > 0
}
// NilCount will return how many nil values are in the series.
func (s *SeriesGeneric) NilCount(opts ...NilCountOptions) (int, error) {
if len(opts) == 0 {
s.lock.RLock()
defer s.lock.RUnlock()
return s.nilCount, nil
}
if !opts[0].DontLock {
s.lock.RLock()
defer s.lock.RUnlock()
}
var (
ctx context.Context
r *Range
)
if opts[0].Ctx == nil {
ctx = context.Background()
} else {
ctx = opts[0].Ctx
}
if opts[0].R == nil {
r = &Range{}
} else {
r = opts[0].R
}
start, end, err := r.Limits(len(s.values))
if err != nil {
return 0, err
}
if start == 0 && end == len(s.values)-1 {
return s.nilCount, nil
}
var nilCount int
for i := start; i <= end; i++ {
if err := ctx.Err(); err != nil {
return 0, err
}
if s.values[i] == nil {
if opts[0].StopAtOneNil {
return 1, nil
}
nilCount++
}
}
return nilCount, nil
}
// ToSeriesMixed will convert the Series to a SeriesMIxed.
// The operation does not lock the Series.
func (s *SeriesGeneric) ToSeriesMixed(ctx context.Context, removeNil bool, conv ...func(interface{}) (interface{}, error)) (*SeriesMixed, error) {
ec := NewErrorCollection()
ss := NewSeriesMixed(s.name, &SeriesInit{Capacity: s.NRows(dontLock)})
for row, rowVal := range s.values {
// Cancel operation
if err := ctx.Err(); err != nil {
return nil, err
}
if rowVal == nil {
if removeNil {
continue
}
ss.values = append(ss.values, nil)
ss.nilCount++
} else {
if len(conv) == 0 {
cv := rowVal
ss.values = append(ss.values, cv)
} else {
cv, err := conv[0](rowVal)
if err != nil {
// interpret as nil
ss.values = append(ss.values, nil)
ss.nilCount++
ec.AddError(&RowError{Row: row, Err: err}, false)
} else {
if cv == nil {
ss.nilCount++
}
ss.values = append(ss.values, cv)
}
}
}
}
if !ec.IsNil(false) {
return ss, ec
}
return ss, nil
}
// IsEqual returns true if s2's values are equal to s.
func (s *SeriesGeneric) IsEqual(ctx context.Context, s2 Series, opts ...IsEqualOptions) (bool, error) {
if len(opts) == 0 || !opts[0].DontLock {
s.lock.RLock()
defer s.lock.RUnlock()
}
// Check type
gs, ok := s2.(*SeriesGeneric)
if !ok {
return false, nil
}
// Check number of values
if len(s.values) != len(gs.values) {
return false, nil
}
// Check name
if len(opts) != 0 && opts[0].CheckName {
if s.name != gs.name {
return false, nil
}
}
// Check values
for i, v := range s.values {
if err := ctx.Err(); err != nil {
return false, err
}
if v == nil {
if gs.values[i] == nil {
// Both are nil
continue
} else {
return false, nil
}
}
if !s.isEqualFunc(v, gs.values[i]) {
return false, nil
}
}
return true, nil
}