literal phrase ⇒ token, literal phrase ⇒ token, expression phrase ⇒ map, natural number?, []→boolean
Source: /avail/Avail/Foundation/Concurrency
Categories: Concurrency, Control Structures, Loops, Collections, Maps, Transformers
Concurrently apply predicate to each consecutive element of aMap, collecting elements for which predicate answered false into a new map (and preserving ordering of the transformed elements). Answer this map.
| Position | Name | Type | Description | |
|---|---|---|---|---|
| Parameters | ||||
| 1 | keyPhrase | 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 aMap. | |
| 2 | valuePhrase | 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 aMap. | |
| 3 | aMap | expression phrase ⇒ map | An expression phrase that yields the map to iterate over | |
| 4 | optionalLimit | 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 | []→boolean | A filter function that accepts an arbitrary element of the map and answers true if the element should be accumulated into the result. | |
| Returns | map | A map of elements from aMap for which predicate answered false. | Raises | |
| worker exception | If any of the forked workers raise an exception. | |||