Repository navigation
Expand file tree
/
Copy pathExamples.hs
More file actions
373 lines (335 loc) · 9.11 KB
/
Copy pathExamples.hs
File metadata and controls
373 lines (335 loc) · 9.11 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
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
{-# LANGUAGE
DataKinds
, FlexibleContexts
, MultiWayIf
, RankNTypes
, ScopedTypeVariables
#-}
{-|
Module : Join.Examples
Copyright : (c) Samuel A. Yallop, 2014
Maintainer : syallop@gmail.com
Stability : experimental
This module gives several small example programs, most testing the data structures
defined in "Join.Data".
-}
module Join.Examples where
import Prelude hiding (take, read)
import Join
import Join.Pattern.Pass
import Join.Data.Barrier
import Join.Data.Buffer
import Join.Data.Count
import Join.Data.Counter
import Join.Data.JVar
import Join.Data.Lock
import Control.Applicative
import Control.Concurrent (threadDelay)
import Control.Monad (liftM,replicateM_,replicateM)
-- | Countdown all values to 0.
--
-- >countDown n = do
-- > -- Get a new Channel, inferred to be of type 'Chan Int'.
-- > intChannel <- newChannel
-- >
-- > -- Make a join definition:
-- > -- When there's an int on intChannel:
-- > -- If 0, do nothing.
-- > -- Otherwise, print and send the de-incremented int.
-- > def $ intChannel&=0 |> inert
-- > |$ intChannel |> \i -> do ioAction $ print i
-- > send intChannel (i-1)
-- >
-- > -- Send the starting number on intChannel and initiate the countdown.
-- > send intChannel n
--
-- @ run $ countDown 5 @
--
-- > 5
-- > 4
-- > 3
-- > 2
-- > 1
countDown :: Int -> Process ()
countDown n = do
-- Get a new Channel, inferred to be of type 'Chan Int'.
intChannel <- newChannel
-- Make a join definition:
-- When there's an int on intChannel:
-- If 0, do nothing.
-- Otherwise, print and send the de-incremented int.
def $ intChannel&=0 |> inert
|$ intChannel |> \i -> do ioAction $ print i
send intChannel (i-1)
-- Send the starting number on intChannel and initiate the countdown.
send intChannel n
-- | Parallel computation of the fibonacci function.
--
-- > fibonacci i = do
-- > fib <- newChannel
-- > def $ fib&=0 |> reply fib 1
-- > |$ fib&=1 |> reply fib 1
-- > |$ fib |> \n -> do i <- sync fib (n-1)
-- > j <- sync fib (n-2)
-- > reply fib (readResponse i + readResponse j)
-- >
-- > sync' fib i
--
-- @ run $ fibonacci 15 @
--
-- > 987
fibonacci :: Int -> Process Int
fibonacci i = do
fib <- newChannel
def $ fib&=0 |> reply fib 1
|$ fib&=1 |> reply fib 1
|$ fib |> \n -> do i <- sync fib (n-1)
j <- sync fib (n-2)
reply fib (readResponse i + readResponse j)
sync' fib i
-- | 'Count' example:
--
-- @
-- countExample = do
-- ioAction $ putStrLn "Initialising Count to 100"
-- c <- mkCount 100
--
-- waitForZero c `with` tickDown c
--
-- where
-- waitForZero c = do
-- waitZero c
-- ioAction $ putStrLn "Counter reached zero"
--
-- tickDown c = do
-- replicateM_ 99 $ tick c
-- ioAction $ putStrLn "Sent 99 ticks, waiting."
-- threadDelay 100000
-- putStrLn "Sending 100th tick."
-- tick c
-- @
--
-- @ run countExample @
--
-- >Initialising Count to 100
-- >Sent 99 ticks, waiting.
-- >
-- >Sending 100th tick.
-- >Counter reached zero
countExample :: Process ()
countExample = do
ioAction $ putStrLn "Initialising Count to 100"
c <- mkCount 100
waitForZero c `with` tickDown c
where
waitForZero c = do
waitZero c
ioAction $ putStrLn "Counter reached zero"
tickDown c = do
replicateM_ 99 $ tick c
ioAction $ do putStrLn "Sent 99 ticks, waiting."
threadDelay 100000
putStrLn "Sending 100th tick."
tick c
-- | Increment and query a 'Counter' with implicit mutex.
--
-- @
-- counterExample = do
-- c <- mkCounter
--
-- -- Make one inc, then check the value:
-- inc c
-- ioAction $ putStrLn "After one inc: "
-- get c >>= ioAction . print
--
-- -- Make 100 inc's, and check the value in 5 seconds
-- replicateM_ 100 (inc c)
-- ioAction $ putStrLn "After at most 100 inc, and 5 seconds: " >> threadDelay 5000000
-- get c >>= ioAction . print
--
-- inert
-- @
--
-- @ run counterExample @
--
-- > After one inc: 2
-- > After at most 100 inc, and 5 seconds: 102
counterExample :: Process ()
counterExample = do
c <- mkCounter
-- Make one inc, then check the value:
inc c
ioAction $ putStrLn "After one inc: "
get c >>= ioAction . print
-- Make 100 inc's, and check the value in 5 seconds
replicateM_ 100 (inc c)
ioAction $ putStrLn "After at most 100 inc, and 5 seconds: " >> threadDelay 5000000
get c >>= ioAction . print
inert
-- | Store some items in a buffer, retrieve them later. Simulates state.
--
-- @
-- bufferExample = do
-- -- Create a new Buffer
-- b <- mkBuffer
--
-- -- Put values in
-- put b 1
-- put b 2
--
-- -- Do things, wait a bit
-- ioAction $ putStrLn "Waiting..." >> threadDelay 100000
--
-- -- Get values out and do something with them
-- i <- take b
-- j <- take b
--
-- return $ readResponse i + readResponse j
-- @
--
-- @ run bufferExample @
--
-- > 3
bufferExample :: Process Int
bufferExample = do
-- Create a new Buffer
b <- mkBuffer
-- Put values in
put b 1
put b 2
-- Do things, wait a bit
ioAction $ putStrLn "Waiting..." >> threadDelay 100000
-- Get values out and do something with them
i <- take b
j <- take b
return $ readResponse i + readResponse j
-- | Only one subprocess may hold the lock at a time.
--
-- @
-- lockExample :: Process ()
-- lockExample = mkLock >>= \l -> withLock l (ioAction $ putStrLn "One")
-- `with` withLock l (ioAction $ putStrLn "two")
--
-- @
--
-- @ run lockExample @
--
-- > One
-- > Two
--
-- OR
--
-- > Two
-- > One
--
-- Printing from the two separate Process's is never intermingled.
lockExample :: Process ()
lockExample = mkLock >>= \l -> withLock l (ioAction $ putStrLn "One")
`with` withLock l (ioAction $ putStrLn "two")
-- | Use a 'Barrier' to co-ordinate two processes into printing
-- either (lr) or (rl).
--
-- > barrierExample = do
-- > b <- mkBarrier
-- > procLeft b `with` procRight b
-- > where
-- > procLeft b = do
-- > ioAction$ putStrLn "("
-- > signalLeft b
-- > ioAction $ putStrLn "l"
-- > signalLeft b
-- > ioAction$ putStrLn ")"
-- >
-- > procRight b = do
-- > signalRight b
-- > ioAction $ putStrLn "r"
-- > signalRight b
--
-- @ run barrierExample @
--
-- > (
-- > l
-- > r
-- > )
--
-- OR
--
-- > (
-- > r
-- > l
-- > )
barrierExample :: Process ()
barrierExample = do
b <- mkBarrier
procLeft b `with` procRight b
where
procLeft :: Barrier -> Process ()
procLeft b = do
ioAction $ putStrLn "("
signalLeft b
ioAction $ putStrLn "l"
signalLeft b
ioAction $ putStrLn ")"
procRight :: Barrier -> Process ()
procRight b = do
signalRight b
ioAction $ putStrLn "r"
signalRight b
-- | Use '&~' patterns to filter 5..15 on <10 / >=10
--
--
-- > predExample = do
-- > intChannel <- newChannel :: Process (Chan Int)
-- > printLock <- mkLock
-- >
-- > def $ (intChannel&~(<10) |> \i -> withLock printLock $
-- > ioAction $ putStrLn $ show i ++ " is less than 10")
-- > |$ (intChannel |> \i -> withLock printLock $
-- > ioAction $ putStrLn $ show i ++ " is greater than or equal to 10")
-- >
-- > ioAction $ putStrLn "Sending numbers 5..15"
-- > sendAll [(intChannel,i) | i <- [5..15]]
--
-- @ run predExample @
--
-- > 5 is less than or equal to 10
-- > ...
-- > 10 is less than or equal to 10
-- > 11 is greater than or equal to 10.
-- > ...
-- > 15 is greater than or equal to 10.
predExample :: Process ()
predExample = do
intChannel <- newChannel :: Process (Chan Int)
printLock <- mkLock
def $ (intChannel&~(<10) |> \i -> withLock printLock $
ioAction $ putStrLn $ show i ++ " is less than 10")
|$ (intChannel |> \i -> withLock printLock $
ioAction $ putStrLn $ show i ++ " is greater than or equal to 10")
ioAction $ putStrLn "Sending numbers 5..15"
sendAll [(intChannel,i) | i <- [5..15]]
-- | Concurrently run two Processes reading and writing to a JVar for 'n'
-- iterations.
--
-- @ run (jVarExample 2) @
--
-- > left: took "right"
-- > right: took "left"
-- > left: took "right"
-- > right: took "left"
jVarExample :: Int -> Process ()
jVarExample n = do
jvar <- newJVar "initial value"
spawn $ jvarLeft jvar n
spawn $ jvarRight jvar n
where
jvarLeft jvar n = do
val <- takeJVar jvar
ioAction $ putStrLn $ "left: took " ++ show val
putJVar jvar "left"
if n < 0 then return () else jvarLeft jvar (n - 1)
jvarRight jvar n = do
val <- takeJVar jvar
ioAction $ putStrLn $ "right: took " ++ show val
putJVar jvar "right"
if n < 0 then return () else jvarRight jvar (n - 1)