Repository navigation
Expand file tree
/
Copy pathmain.go
More file actions
232 lines (196 loc) · 4.6 KB
/
Copy pathmain.go
File metadata and controls
232 lines (196 loc) · 4.6 KB
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
package main
import (
"fmt"
"math/rand"
"sort"
"time"
)
const (
arrayLen = 5
)
// func SortFuture(array []int64) chan []int64 {
// future := make(chan []int64)
// go func() {
// sort.Slice(array, func(i, j int) bool {
// return array[i] < array[j]
// })
// future <- array
// }()
// return future
// }
// func MultiplyFuture(array []int64) chan []int64 {
// future := make(chan []int64)
// go func() {
// for i := range array {
// array[i] *= 2
// }
// future <- array
// }()
// return future
// }
// func DivideFuture(array []int64, divider int64) chan []int64 {
// future := make(chan []int64)
// go func() {
// for i := range array {
// array[i] /= divider
// }
// future <- array
// }()
// return future
// }
// func RemoveOddFuture(array []int64) chan []int64 {
// future := make(chan []int64)
// go func() {
// newarr := make([]int64, 0)
// for _, v := range array {
// if v%2 == 0 {
// newarr = append(newarr, v)
// }
// }
// future <- newarr
// }()
// return future
// }
// func RemoveRangeFuture(array []int64, lo, hi float64, max int64) chan []int64 {
// future := make(chan []int64)
// go func() {
// low := int64(float64(max) * lo)
// high := int64(float64(max) * hi)
// newarr := make([]int64, 0)
// for _, v := range array {
// if v >= low && v <= high {
// newarr = append(newarr, v)
// }
// }
// future <- newarr
// }()
// return future
// }
func NumberGenerator(ch chan int64) {
source := rand.NewSource(time.Now().UnixNano())
generator := rand.New(source)
for {
ch <- generator.Int63n(50)
}
}
// func FillArrayFuture(array []int64, rng chan int64) chan []int64 {
// future := make(chan []int64)
// go func() {
// for i := range array {
// array[i] = <-rng
// }
// future <- array
// }()
// return future
// }
func DumpArrFuture(sourcearray, destinationarray []int64, startidx int) chan []int64 {
future := make(chan []int64)
go func() {
for i, v := range sourcearray {
destinationarray[startidx+i] = v
}
future <- destinationarray
}()
return future
}
func main() {
rng := make(chan int64)
go NumberGenerator(rng)
ar1, ar2, ar3 := make([]int64, arrayLen), make([]int64, arrayLen), make([]int64, arrayLen)
f1 := func(array []int64) chan []int64 {
future := make(chan []int64)
go func() {
for i := range array {
array[i] = <-rng
}
fmt.Println("Filled arr1:\n", ar1)
sort.Slice(array, func(i, j int) bool {
return array[i] < array[j]
})
fmt.Println("Sorted arr1:\n", ar1)
for i := range array {
array[i] *= 2
}
fmt.Println("Multiplied by 2 arr1:\n", ar1)
for i := range array {
array[i] /= 2
}
fmt.Println("Divided by 2 arr1:\n", ar1)
future <- array
}()
return future
}(ar1)
f2 := func(array []int64) chan []int64 {
future := make(chan []int64)
go func() {
for i := range array {
array[i] = <-rng
}
fmt.Println("Filled arr2:\n", array)
sort.Slice(array, func(i, j int) bool {
return array[i] < array[j]
})
fmt.Println("Sorted arr2:\n", array)
newarr := make([]int64, 0)
for _, v := range array {
if v%2 == 0 {
newarr = append(newarr, v)
}
}
array = newarr
fmt.Println("Removed odd arr2:\n", array)
for i := range array {
array[i] /= 2
}
fmt.Println("Divided by 2 arr2:\n", array)
future <- array
}()
return future
}(ar2)
f3 := func(array []int64) chan []int64 {
future := make(chan []int64)
go func() {
for i := range array {
array[i] = <-rng
}
fmt.Println("Filled arr3:\n", array)
sort.Slice(array, func(i, j int) bool {
return array[i] < array[j]
})
fmt.Println("Sorted arr3:\n", array)
max := array[len(array)-1]
low := int64(float64(max) * 0.3)
high := int64(float64(max) * 0.6)
newarr := make([]int64, 0)
for _, v := range array {
if v >= low && v <= high {
newarr = append(newarr, v)
}
}
array = newarr
fmt.Println("Left range [", low, high, "] arr3:\n", array)
for i := range array {
array[i] /= 2
}
fmt.Println("Divided by 2 arr3:\n", array)
future <- array
}()
return future
}(ar3)
ar1 = <-f1
ar2 = <-f2
ar3 = <-f3
finalarr := make([]int64, len(ar1)+len(ar2)+len(ar3))
fmt.Print("Arr1 after operations:\n", ar1, "\n")
fmt.Print("Arr2 after operations:\n", ar2, "\n")
fmt.Print("Arr3 after operations:\n", ar3, "\n")
//fmt.Println(len(ar1), len(ar2), len(ar3))
f1 = DumpArrFuture(ar1, finalarr, 0)
f2 = DumpArrFuture(ar2, finalarr, len(ar1))
f3 = DumpArrFuture(ar3, finalarr, len(ar1)+len(ar2))
<-f1
<-f2
<-f3
fmt.Println("Dumped into shared array")
fmt.Println(finalarr)
}