/
parallel.go
executable file
·1306 lines (1280 loc) · 35.7 KB
/
parallel.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
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// Package parallel provides functions for expressing parallel algorithms.
//
// See https://github.com/ExaScience/pargo/wiki/TaskParallelism for a general
// overview.
package parallel
import (
"fmt"
"sync"
"github.com/exascience/pargo/internal"
)
// Reduce receives one or more functions, executes them in parallel, and
// combines their results with the join function in parallel.
//
// Each function is invoked in its own goroutine, and Reduce returns only when
// all functions have terminated.
//
// If one or more functions panic, the corresponding goroutines recover the
// panics, and Reduce eventually panics with the left-most recovered panic
// value.
func Reduce(
join func(x, y interface{}) interface{},
firstFunction func() interface{},
moreFunctions ...func() interface{},
) interface{} {
if len(moreFunctions) == 0 {
return firstFunction()
}
var left, right interface{}
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
if len(moreFunctions) == 1 {
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = moreFunctions[0]()
}()
left = firstFunction()
} else {
half := (len(moreFunctions) + 1) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = Reduce(join, moreFunctions[half], moreFunctions[half+1:]...)
}()
left = Reduce(join, firstFunction, moreFunctions[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return join(left, right)
}
// ReduceFloat64 receives one or more functions, executes them in parallel, and
// combines their results with the join function in parallel.
//
// Each function is invoked in its own goroutine, and ReduceFloat64 returns only
// when all functions have terminated.
//
// If one or more functions panic, the corresponding goroutines recover the
// panics, and ReduceFloat64 eventually panics with the left-most recovered
// panic value.
func ReduceFloat64(
join func(x, y float64) float64,
firstFunction func() float64,
moreFunctions ...func() float64,
) float64 {
if len(moreFunctions) == 0 {
return firstFunction()
}
var left, right float64
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
if len(moreFunctions) == 1 {
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = moreFunctions[0]()
}()
left = firstFunction()
} else {
half := (len(moreFunctions) + 1) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = ReduceFloat64(join, moreFunctions[half], moreFunctions[half+1:]...)
}()
left = ReduceFloat64(join, firstFunction, moreFunctions[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return join(left, right)
}
// ReduceFloat64Sum receives zero or more functions, executes them in parallel,
// and adds their results in parallel.
//
// Each function is invoked in its own goroutine, and ReduceFloat64Sum returns
// only when all functions have terminated.
//
// If one or more functions panic, the corresponding goroutines recover the
// panics, and ReduceFloat64Sum eventually panics with the left-most recovered
// panic value.
func ReduceFloat64Sum(functions ...func() float64) float64 {
switch len(functions) {
case 0:
return 0
case 1:
return functions[0]()
}
var left, right float64
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
switch len(functions) {
case 2:
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = functions[1]()
}()
left = functions[0]()
default:
half := len(functions) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = ReduceFloat64Sum(functions[half:]...)
}()
left = ReduceFloat64Sum(functions[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return left + right
}
// ReduceFloat64Product receives zero or more functions, executes them in
// parallel, and multiplies their results in parallel.
//
// Each function is invoked in its own goroutine, and ReduceFloat64Product
// returns only when all functions have terminated.
//
// If one or more functions panic, the corresponding goroutines recover the
// panics, and ReduceFloat64Product eventually panics with the left-most
// recovered panic value.
func ReduceFloat64Product(functions ...func() float64) float64 {
switch len(functions) {
case 0:
return 1
case 1:
return functions[0]()
}
var left, right float64
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
switch len(functions) {
case 2:
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = functions[1]()
}()
left = functions[0]()
default:
half := len(functions) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = ReduceFloat64Product(functions[half:]...)
}()
left = ReduceFloat64Product(functions[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return left * right
}
// ReduceInt receives zero or more functions, executes them in parallel, and
// combines their results with the join function in parallel.
//
// Each function is invoked in its own goroutine, and ReduceInt returns only
// when all functions have terminated.
//
// If one or more functions panic, the corresponding goroutines recover the
// panics, and ReduceInt eventually panics with the left-most recovered panic
// value.
func ReduceInt(
join func(x, y int) int,
firstFunction func() int,
moreFunctions ...func() int,
) int {
if len(moreFunctions) == 0 {
return firstFunction()
}
var left, right int
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
if len(moreFunctions) == 1 {
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = moreFunctions[0]()
}()
left = firstFunction()
} else {
half := (len(moreFunctions) + 1) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = ReduceInt(join, moreFunctions[half], moreFunctions[half+1:]...)
}()
left = ReduceInt(join, firstFunction, moreFunctions[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return join(left, right)
}
// ReduceIntSum receives zero or more functions, executes them in parallel, and
// adds their results in parallel.
//
// Each function is invoked in its own goroutine, and ReduceIntSum returns only
// when all functions have terminated.
//
// If one or more functions panic, the corresponding goroutines recover the
// panics, and ReduceIntSum eventually panics with the left-most recovered panic
// value.
func ReduceIntSum(functions ...func() int) int {
switch len(functions) {
case 0:
return 0
case 1:
return functions[0]()
}
var left, right int
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
switch len(functions) {
case 2:
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = functions[1]()
}()
left = functions[0]()
default:
half := len(functions) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = ReduceIntSum(functions[half:]...)
}()
left = ReduceIntSum(functions[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return left + right
}
// ReduceIntProduct receives zero or more functions, executes them in parallel,
// and multiplies their results in parallel.
//
// Each function is invoked in its own goroutine, and ReduceIntProduct returns
// only when all functions have terminated.
//
// If one or more functions panic, the corresponding goroutines recover the
// panics, and ReduceIntProduct eventually panics with the left-most recovered
// panic value.
func ReduceIntProduct(functions ...func() int) int {
switch len(functions) {
case 0:
return 1
case 1:
return functions[0]()
}
var left, right int
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
switch len(functions) {
case 2:
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = functions[1]()
}()
left = functions[0]()
default:
half := len(functions) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = ReduceIntProduct(functions[half:]...)
}()
left = ReduceIntProduct(functions[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return left * right
}
// ReduceString receives zero or more functions, executes them in parallel, and
// combines their results with the join function in parallel.
//
// Each function is invoked in its own goroutine, and ReduceString returns only
// when all functions have terminated.
//
// If one or more functions panic, the corresponding goroutines recover the
// panics, and ReduceString eventually panics with the left-most recovered panic
// value.
func ReduceString(
join func(x, y string) string,
firstFunction func() string,
moreFunctions ...func() string,
) string {
if len(moreFunctions) == 0 {
return firstFunction()
}
var left, right string
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
if len(moreFunctions) == 1 {
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = moreFunctions[0]()
}()
left = firstFunction()
} else {
half := (len(moreFunctions) + 1) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = ReduceString(join, moreFunctions[half], moreFunctions[half+1:]...)
}()
left = ReduceString(join, firstFunction, moreFunctions[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return join(left, right)
}
// ReduceStringSum receives zero or more functions, executes them in parallel,
// and concatenates their results in parallel.
//
// Each function is invoked in its own goroutine, and ReduceStringSum returns
// only when all functions have terminated.
//
// If one or more functions panic, the corresponding goroutines recover the
// panics, and ReduceStringSum eventually panics with the left-most recovered
// panic value.
func ReduceStringSum(functions ...func() string) string {
switch len(functions) {
case 0:
return ""
case 1:
return functions[0]()
}
var left, right string
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
switch len(functions) {
case 2:
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = functions[1]()
}()
left = functions[0]()
default:
half := len(functions) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = ReduceStringSum(functions[half:]...)
}()
left = ReduceStringSum(functions[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return left + right
}
// Do receives zero or more thunks and executes them in parallel.
//
// Each thunk is invoked in its own goroutine, and Do returns only when all
// thunks have terminated.
//
// If one or more thunks panic, the corresponding goroutines recover the panics,
// and Do eventually panics with the left-most recovered panic value.
func Do(thunks ...func()) {
switch len(thunks) {
case 0:
return
case 1:
thunks[0]()
return
}
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
switch len(thunks) {
case 2:
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
thunks[1]()
}()
thunks[0]()
default:
half := len(thunks) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
Do(thunks[half:]...)
}()
Do(thunks[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
}
// And receives zero or more predicate functions and executes them in parallel.
//
// Each predicate is invoked in its own goroutine, and And returns only when all
// predicates have terminated, combining all return values with the && operator,
// with true as the default return value.
//
// If one or more predicates panic, the corresponding goroutines recover the
// panics, and And eventually panics with the left-most recovered panic value.
func And(predicates ...func() bool) bool {
switch len(predicates) {
case 0:
return true
case 1:
return predicates[0]()
}
var b0, b1 bool
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
switch len(predicates) {
case 2:
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
b1 = predicates[1]()
}()
b0 = predicates[0]()
default:
half := len(predicates) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
b1 = And(predicates[half:]...)
}()
b0 = And(predicates[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return b0 && b1
}
// Or receives zero or more predicate functions and executes them in parallel.
//
// Each predicate is invoked in its own goroutine, and Or returns only when all
// predicates have terminated, combining all return values with the || operator,
// with false as the default return value.
//
// If one or more predicates panic, the corresponding goroutines recover the
// panics, and Or eventually panics with the left-most recovered panic value.
func Or(predicates ...func() bool) bool {
switch len(predicates) {
case 0:
return false
case 1:
return predicates[0]()
}
var b0, b1 bool
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
switch len(predicates) {
case 2:
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
b1 = predicates[1]()
}()
b0 = predicates[0]()
default:
half := len(predicates) / 2
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
b1 = Or(predicates[half:]...)
}()
b0 = Or(predicates[:half]...)
}
wg.Wait()
if p != nil {
panic(p)
}
return b0 || b1
}
// Range receives a range, a batch count n, and a range function f, divides the
// range into batches, and invokes the range function for each of these batches
// in parallel, covering the half-open interval from low to high, including low
// but excluding high.
//
// The range is specified by a low and high integer, with low <= high. The
// batches are determined by dividing up the size of the range (high - low) by
// n. If n is 0, a reasonable default is used that takes runtime.GOMAXPROCS(0)
// into account.
//
// The range function is invoked for each batch in its own goroutine, with 0 <=
// low <= high, and Range returns only when all range functions have terminated.
//
// Range panics if high < low, or if n < 0.
//
// If one or more range function invocations panic, the corresponding goroutines
// recover the panics, and Range eventually panics with the left-most recovered
// panic value.
func Range(
low, high, n int,
f func(low, high int),
) {
var recur func(int, int, int)
recur = func(low, high, n int) {
switch {
case n == 1:
f(low, high)
case n > 1:
batchSize := ((high - low - 1) / n) + 1
half := n / 2
mid := low + batchSize*half
if mid >= high {
f(low, high)
return
}
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
recur(mid, high, n-half)
}()
recur(low, mid, half)
wg.Wait()
if p != nil {
panic(p)
}
return
default:
panic(fmt.Sprintf("invalid number of batches: %v", n))
}
}
recur(low, high, internal.ComputeNofBatches(low, high, n))
}
// RangeAnd receives a range, a batch count n, and a range predicate function f,
// divides the range into batches, and invokes the range predicate for each of
// these batches in parallel, covering the half-open interval from low to high,
// including low but excluding high.
//
// The range is specified by a low and high integer, with low <= high. The
// batches are determined by dividing up the size of the range (high - low) by
// n. If n is 0, a reasonable default is used that takes runtime.GOMAXPROCS(0)
// into account.
//
// The range predicate is invoked for each batch in its own goroutine, with 0 <=
// low <= high, and RangeAnd returns only when all range predicates have
// terminated, combining all return values with the && operator.
//
// RangeAnd panics if high < low, or if n < 0.
//
// If one or more range predicate invocations panic, the corresponding
// goroutines recover the panics, and RangeAnd eventually panics with the
// left-most recovered panic value.
func RangeAnd(
low, high, n int,
f func(low, high int) bool,
) bool {
var recur func(int, int, int) bool
recur = func(low, high, n int) bool {
switch {
case n == 1:
return f(low, high)
case n > 1:
batchSize := ((high - low - 1) / n) + 1
half := n / 2
mid := low + batchSize*half
if mid >= high {
return f(low, high)
}
var b0, b1 bool
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
b1 = recur(mid, high, n-half)
}()
b0 = recur(low, mid, half)
wg.Wait()
if p != nil {
panic(p)
}
return b0 && b1
default:
panic(fmt.Sprintf("invalid number of batches: %v", n))
}
}
return recur(low, high, internal.ComputeNofBatches(low, high, n))
}
// RangeOr receives a range, a batch count n, and a range predicate function f,
// divides the range into batches, and invokes the range predicate for each of
// these batches in parallel, covering the half-open interval from low to high,
// including low but excluding high.
//
// The range is specified by a low and high integer, with low <= high. The
// batches are determined by dividing up the size of the range (high - low) by
// n. If n is 0, a reasonable default is used that takes runtime.GOMAXPROCS(0)
// into account.
//
// The range predicate is invoked for each batch in its own goroutine, with 0 <=
// low <= high, and RangeOr returns only when all range predicates have
// terminated, combining all return values with the || operator.
//
// RangeOr panics if high < low, or if n < 0.
//
// If one or more range predicate invocations panic, the corresponding
// goroutines recover the panics, and RangeOr eventually panics with the
// left-most recovered panic value.
func RangeOr(
low, high, n int,
f func(low, high int) bool,
) bool {
var recur func(int, int, int) bool
recur = func(low, high, n int) bool {
switch {
case n == 1:
return f(low, high)
case n > 1:
batchSize := ((high - low - 1) / n) + 1
half := n / 2
mid := low + batchSize*half
if mid >= high {
return f(low, high)
}
var b0, b1 bool
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
b1 = recur(mid, high, n-half)
}()
b0 = recur(low, mid, half)
wg.Wait()
if p != nil {
panic(p)
}
return b0 || b1
default:
panic(fmt.Sprintf("invalid number of batches: %v", n))
}
}
return recur(low, high, internal.ComputeNofBatches(low, high, n))
}
// RangeReduce receives a range, a batch count, a range reduce function, and a
// join function, divides the range into batches, and invokes the range reducer
// for each of these batches in parallel, covering the half-open interval from
// low to high, including low but excluding high. The results of the range
// reducer invocations are then combined by repeated invocations of join.
//
// The range is specified by a low and high integer, with low <= high. The
// batches are determined by dividing up the size of the range (high - low) by
// n. If n is 0, a reasonable default is used that takes runtime.GOMAXPROCS(0)
// into account.
//
// The range reducer is invoked for each batch in its own goroutine, with 0 <=
// low <= high, and RangeReduce returns only when all range reducers and pair
// reducers have terminated.
//
// RangeReduce panics if high < low, or if n < 0.
//
// If one or more reducer invocations panic, the corresponding goroutines
// recover the panics, and RangeReduce eventually panics with the left-most
// recovered panic value.
func RangeReduce(
low, high, n int,
reduce func(low, high int) interface{},
join func(x, y interface{}) interface{},
) interface{} {
var recur func(int, int, int) interface{}
recur = func(low, high, n int) interface{} {
switch {
case n == 1:
return reduce(low, high)
case n > 1:
batchSize := ((high - low - 1) / n) + 1
half := n / 2
mid := low + batchSize*half
if mid >= high {
return reduce(low, high)
}
var left, right interface{}
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = recur(mid, high, n-half)
}()
left = recur(low, mid, half)
wg.Wait()
if p != nil {
panic(p)
}
return join(left, right)
default:
panic(fmt.Sprintf("invalid number of batches: %v", n))
}
}
return recur(low, high, internal.ComputeNofBatches(low, high, n))
}
// RangeReduceInt receives a range, a batch count n, a range reducer function,
// and a join function, divides the range into batches, and invokes the range
// reducer for each of these batches in parallel, covering the half-open
// interval from low to high, including low but excluding high. The results of
// the range reducer invocations are then combined by repeated invocations of
// join.
//
// The range is specified by a low and high integer, with low <= high. The
// batches are determined by dividing up the size of the range (high - low) by
// n. If n is 0, a reasonable default is used that takes runtime.GOMAXPROCS(0)
// into account.
//
// The range reducer is invoked for each batch in its own goroutine, with 0 <=
// low <= high, and RangeReduceInt returns only when all range reducers and pair
// reducers have terminated.
//
// RangeReduceInt panics if high < low, or if n < 0.
//
// If one or more reducer invocations panic, the corresponding goroutines
// recover the panics, and RangeReduceInt eventually panics with the left-most
// recovered panic value.
func RangeReduceInt(
low, high, n int,
reduce func(low, high int) int,
join func(x, y int) int,
) int {
var recur func(int, int, int) int
recur = func(low, high, n int) int {
switch {
case n == 1:
return reduce(low, high)
case n > 1:
batchSize := ((high - low - 1) / n) + 1
half := n / 2
mid := low + batchSize*half
if mid >= high {
return reduce(low, high)
}
var left, right int
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = recur(mid, high, n-half)
}()
left = recur(low, mid, half)
wg.Wait()
if p != nil {
panic(p)
}
return join(left, right)
default:
panic(fmt.Sprintf("invalid number of batches: %v", n))
}
}
return recur(low, high, internal.ComputeNofBatches(low, high, n))
}
// RangeReduceIntSum receives a range, a batch count n, and a range reducer
// function, divides the range into batches, and invokes the range reducer for
// each of these batches in parallel, covering the half-open interval from low
// to high, including low but excluding high. The results of the range reducer
// invocations are then added together.
//
// The range is specified by a low and high integer, with low <= high. The
// batches are determined by dividing up the size of the range (high - low) by
// n. If n is 0, a reasonable default is used that takes runtime.GOMAXPROCS(0)
// into account.
//
// The range reducer is invoked for each batch in its own goroutine, with 0 <=
// low <= high, and RangeReduceIntSum returns only when all range reducers and
// pair reducers have terminated.
//
// RangeReduceIntSum panics if high < low, or if n < 0.
//
// If one or more reducer invocations panic, the corresponding goroutines
// recover the panics, and RangeReduceIntSum eventually panics with the
// left-most recovered panic value.
func RangeReduceIntSum(
low, high, n int,
reduce func(low, high int) int,
) int {
var recur func(int, int, int) int
recur = func(low, high, n int) int {
switch {
case n == 1:
return reduce(low, high)
case n > 1:
batchSize := ((high - low - 1) / n) + 1
half := n / 2
mid := low + batchSize*half
if mid >= high {
return reduce(low, high)
}
var left, right int
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = recur(mid, high, n-half)
}()
left = recur(low, mid, half)
wg.Wait()
if p != nil {
panic(p)
}
return left + right
default:
panic(fmt.Sprintf("invalid number of batches: %v", n))
}
}
return recur(low, high, internal.ComputeNofBatches(low, high, n))
}
// RangeReduceIntProduct receives a range, a batch count n, and a range reducer
// function, divides the range into batches, and invokes the range reducer for
// each of these batches in parallel, covering the half-open interval from low
// to high, including low but excluding high. The results of the range reducer
// invocations are then multiplied with each other.
//
// The range is specified by a low and high integer, with low <= high. The
// batches are determined by dividing up the size of the range (high - low) by
// n. If n is 0, a reasonable default is used that takes runtime.GOMAXPROCS(0)
// into account.
//
// The range reducer is invoked for each batch in its own goroutine, with 0 <=
// low <= high, and RangeReduceIntProduct returns only when all range reducers
// and pair reducers have terminated.
//
// RangeReduceIntProduct panics if high < low, or if n < 0.
//
// If one or more reducer invocations panic, the corresponding goroutines
// recover the panics, and RangeReduceIntProducet eventually panics with the
// left-most recovered panic value.
func RangeReduceIntProduct(
low, high, n int,
reduce func(low, high int) int,
) int {
var recur func(int, int, int) int
recur = func(low, high, n int) int {
switch {
case n == 1:
return reduce(low, high)
case n > 1:
batchSize := ((high - low - 1) / n) + 1
half := n / 2
mid := low + batchSize*half
if mid >= high {
return reduce(low, high)
}
var left, right int
var p interface{}
var wg sync.WaitGroup
wg.Add(1)
go func() {
defer func() {
p = internal.WrapPanic(recover())
wg.Done()
}()
right = recur(mid, high, n-half)
}()
left = recur(low, mid, half)
wg.Wait()
if p != nil {
panic(p)
}
return left * right
default:
panic(fmt.Sprintf("invalid number of batches: %v", n))
}
}