literal phrase ⇒ token, literal phrase ⇒ token, expression phrase ⇒ tuple, expression phrase ⇒ natural number?, block phrase ⇒ []→⊤
Source: /avail/Avail/Foundation/Concurrency
Categories: Concurrency, Control Structures, Loops, Collections, Tuples
Concurrently apply predicate to each consecutive element of aTuple, collecting elements for which filter answered true into a new tuple (and preserving ordering of the transformed elements). Answer this tuple.
| Position | Name | Type | Description | |
|---|---|---|---|---|
| Parameters | ||||
| 1 | elementPhrase | literal phrase ⇒ token | A literal phrase holding a synthetic literal token whose value is the name of the loop variable. The generated loop variable is given the strongest possible type based on the type union of the leading types and default type of aTuple. | |
| 2 | indexPhrase | literal phrase ⇒ token | A literal phrase holding a synthetic literal token whose value is the name of the loop index variable. The generated loop variable is given the strongest possible type based on the cardinality of aTuple. | |
| 3 | aTuple | expression phrase ⇒ tuple | An expression phrase that yields the tuple to iterate over | |
| 4 | optionalLimit | expression phrase ⇒ natural number? |
If specified, then the maximum number of worker fiber s permitted to run in parallel. If not specified, then permit default maximum worker fibers worker fiber s to run in parallel.
|
|
| 5 | predicate | block phrase ⇒ []→⊤ | A filter function that accepts an arbitrary element of the tuple and that element's index answers true if the element should be accumulated into the result. | |
| Returns | ⊤ | Raises | ||
| worker exception | If any of the forked workers raise an exception. | |||