Spawn: Difference between revisions
(removed the dubble title i added) |
No edit summary |
||
Line 1: | Line 1: | ||
{| | {{Built-in|Spawn|&}} is a [[monadic operator]] which applies its [[operand]] in a new [[wikipedia:green thread]]. Rather that returning the result of its operand, Spawn returns a [[shy]] thread number. This [[operator]] is specific to [[Dyalog APL]]. | ||
| | |||
== Usage == | |||
Spawn is used to run background tasks, for example for monitoring or handling incoming requests. Since the thread number is returned, <source lang=apl inline>⎕TSYNC</source> ("Thread Synchronise") is provided to retrieve the result, given the thread number. If the result is ready before <source lang=apl inline>⎕TSYNC</source> is used, it prints to the [[session]] if applicable. | |||
Spawn is often used in conjunction with the [[Each]] operator (<source lang=apl inline>¨</source>) to launch multiple threads in parallel. | |||
As Spawn is an operator, it cannot be directly used with a [[niladic function]], since a niladic function is called immediately when its name is referenced. As a workaround, the niladic function can be wrapped in a [[dfn]] and called with a dummy argument: <source lang=apl inline>{nilFun}&⍬</source> | |||
== Examples == | == Examples == | ||
Line 18: | Line 13: | ||
÷&4 ⍝ Reciprocal in background | ÷&4 ⍝ Reciprocal in background | ||
0.25 | 0.25 | ||
⎕←÷&4 ⍝ Show thread number | ⎕←÷&4 ⍝ Show thread number; result prints afterwards | ||
1 | 1 | ||
0.25 | 0.25 | ||
</source> | </source> | ||
{{Works in|[[Dyalog APL]]}} | |||
The effect of running code in the background can be observed when a measurable amount of time elapses. In the first expression below, get the current time (in milliseconds) and then [[delay]] (<source lang=apl inline>⎕DL</source>) for each of 1, 2, and 3 seconds, eventually computing the elapsed time, which is slightly more than 1+2+3 seconds (6000 milliseconds). In the second expression, the delaying threads are launched, but we don't await their completion before computing the elapsed time. In the final expression, we synchronise the parallel running delays, giving us a total elapsed time only slightly longer than the longest delay. | |||
<source lang=apl> | |||
t←⎕AI[3] ⋄ ⎕DL¨⍳3 ⋄ ⎕AI[3]-t | |||
6138 | |||
t←⎕AI[3] ⋄ ⎕DL&¨⍳3 ⋄ ⎕AI[3]-t | |||
0 | |||
t←⎕AI[3] ⋄ ⎕TSYNC ⎕DL&¨⍳3 ⋄ ⎕AI[3]-t | |||
3046 | |||
</source> | |||
{{Works in|[[Dyalog APL]]}} | |||
== External links == | |||
=== Lessons === | |||
* [https://chat.stackexchange.com/rooms/52405/conversation/lesson-26-concurrent-apl-threads APL Cultivation] | |||
=== Documentation === | |||
* [https://help.dyalog.com/latest/#Language/Primitive%20Operators/Spawn.htm Dyalog] | |||
{{APL built-ins}}[[Category:Primitive operators]] |
Revision as of 08:00, 8 August 2022
&
|
Spawn (&
) is a monadic operator which applies its operand in a new wikipedia:green thread. Rather that returning the result of its operand, Spawn returns a shy thread number. This operator is specific to Dyalog APL.
Usage
Spawn is used to run background tasks, for example for monitoring or handling incoming requests. Since the thread number is returned, ⎕TSYNC
("Thread Synchronise") is provided to retrieve the result, given the thread number. If the result is ready before ⎕TSYNC
is used, it prints to the session if applicable.
Spawn is often used in conjunction with the Each operator (¨
) to launch multiple threads in parallel.
As Spawn is an operator, it cannot be directly used with a niladic function, since a niladic function is called immediately when its name is referenced. As a workaround, the niladic function can be wrapped in a dfn and called with a dummy argument: {nilFun}&⍬
Examples
÷&4 ⍝ Reciprocal in background 0.25 ⎕←÷&4 ⍝ Show thread number; result prints afterwards 1 0.25
The effect of running code in the background can be observed when a measurable amount of time elapses. In the first expression below, get the current time (in milliseconds) and then delay (⎕DL
) for each of 1, 2, and 3 seconds, eventually computing the elapsed time, which is slightly more than 1+2+3 seconds (6000 milliseconds). In the second expression, the delaying threads are launched, but we don't await their completion before computing the elapsed time. In the final expression, we synchronise the parallel running delays, giving us a total elapsed time only slightly longer than the longest delay.
t←⎕AI[3] ⋄ ⎕DL¨⍳3 ⋄ ⎕AI[3]-t 6138 t←⎕AI[3] ⋄ ⎕DL&¨⍳3 ⋄ ⎕AI[3]-t 0 t←⎕AI[3] ⋄ ⎕TSYNC ⎕DL&¨⍳3 ⋄ ⎕AI[3]-t 3046
External links
Lessons
Documentation