@catch, retry, partition, asyncmap and pmap (#15409)

* @catch, retry, partition, asyncmap and refactored pmap (#15409 and #14843)

NEWS.md

@@ -58,6 +58,12 @@ Breaking changes
     is now divided among the fields `code`, `slotnames`, `slottypes`, `slotflags`,
     `gensymtypes`, `rettype`, `nargs`, and `isva` in the `LambdaInfo` type ([#15609]).
 
+  * `pmap` keyword arguments `err_retry=true` and `err_stop=false` are deprecated.
+    `pmap` no longer retries or returns `Exception` objects in the result collection.
+    `pmap(retry(f), c)` or `pmap(@catch(f), c)` can be used instead.
+    ([#15409](https://github.com/JuliaLang/julia/pull/15409#discussion_r57494701)).
+
+
 Library improvements
 --------------------
 

base/asyncmap.jl

@@ -0,0 +1,187 @@
+# This file is a part of Julia. License is MIT: http://julialang.org/license
+
+
+"""
+    AsyncCollector(f, results, c...; ntasks=100) -> iterator
+
+Apply f to each element of c using at most 100 asynchronous tasks.
+For multiple collection arguments, apply f elementwise.
+Output is collected into "results".
+
+Note: `next(::AsyncCollector, state) -> (nothing, state)`
+
+Note: `for task in AsyncCollector(f, results, c...) end` is equivalent to
+`map!(f, results, c...)`.
+"""
+type AsyncCollector
+    f
+    results
+    enumerator::Enumerate
+    ntasks::Int
+end
+
+function AsyncCollector(f, results, c...; ntasks=0)
+    if ntasks == 0
+        ntasks = 100
+    end
+    AsyncCollector(f, results, enumerate(zip(c...)), ntasks)
+end
+
+
+type AsyncCollectorState
+    enum_state
+    active_count::Int
+    task_done::Condition
+    done::Bool
+end
+
+
+# Busy if the maximum number of concurrent tasks is running.
+function isbusy(itr::AsyncCollector, state::AsyncCollectorState)
+    state.active_count == itr.ntasks
+end
+
+
+# Wait for @async task to end.
+wait(state::AsyncCollectorState) = wait(state.task_done)
+
+
+# Open a @sync block and initialise iterator state.
+function start(itr::AsyncCollector)
+    sync_begin()
+    AsyncCollectorState(start(itr.enumerator),  0, Condition(), false)
+end
+
+# Close @sync block when iterator is done.
+function done(itr::AsyncCollector, state::AsyncCollectorState)
+    if !state.done && done(itr.enumerator, state.enum_state)
+        state.done = true
+        sync_end()
+    end
+    return state.done
+end
+
+function next(itr::AsyncCollector, state::AsyncCollectorState)
+
+    # Wait if the maximum number of concurrent tasks are already running...
+    while isbusy(itr, state)
+        wait(state)
+    end
+
+    # Get index and mapped function arguments from enumeration iterator...
+    (i, args), state.enum_state = next(itr.enumerator, state.enum_state)
+
+    # Execute function call and save result asynchronously...
+    @async begin
+        itr.results[i] = itr.f(args...)
+        state.active_count -= 1
+        notify(state.task_done, nothing)
+    end
+
+    # Count number of concurrent tasks...
+    state.active_count += 1
+
+    return (nothing, state)
+end
+
+
+
+"""
+    AsyncGenerator(f, c...; ntasks=100) -> iterator
+
+Apply f to each element of c using at most 100 asynchronous tasks.
+For multiple collection arguments, apply f elementwise.
+Results are returned by the iterator as they become available.
+Note: `collect(AsyncGenerator(f, c...; ntasks=1))` is equivalent to
+`map(f, c...)`.
+"""
+type AsyncGenerator
+    collector::AsyncCollector
+end
+
+function AsyncGenerator(f, c...; ntasks=0)
+    AsyncGenerator(AsyncCollector(f, Dict{Int,Any}(), c...; ntasks=ntasks))
+end
+
+
+type AsyncGeneratorState
+    i::Int
+    async_state::AsyncCollectorState
+end
+
+
+start(itr::AsyncGenerator) = AsyncGeneratorState(0, start(itr.collector))
+
+# Done when source async collector is done and all results have been consumed.
+function done(itr::AsyncGenerator, state::AsyncGeneratorState)
+    done(itr.collector, state.async_state) && isempty(itr.collector.results)
+end
+
+# Pump the source async collector if it is not already busy...
+function pump_source(itr::AsyncGenerator, state::AsyncGeneratorState)
+    if !isbusy(itr.collector, state.async_state) &&
+       !done(itr.collector, state.async_state)
+        ignored, state.async_state = next(itr.collector, state.async_state)
+        return true
+    else
+        return false
+    end
+end
+
+function next(itr::AsyncGenerator, state::AsyncGeneratorState)
+
+    state.i += 1
+
+    results = itr.collector.results
+    while !haskey(results, state.i)
+
+        # Wait for results to become available...
+        if !pump_source(itr,state) && !haskey(results, state.i)
+            wait(state.async_state)
+        end
+    end
+    r = results[state.i]
+    delete!(results, state.i)
+
+    return (r, state)
+end
+
+iteratorsize(::Type{AsyncGenerator}) = SizeUnknown()
+
+
+"""
+    asyncgenerate(f, c...) -> iterator
+
+Apply `@async f` to each element of `c`.
+
+For multiple collection arguments, apply f elementwise.
+
+Results are returned in order as they become available.
+"""
+asyncgenerate(f, c...) = AsyncGenerator(f, c...)
+
+
+"""
+    asyncmap(f, c...) -> collection
+
+Transform collection `c` by applying `@async f` to each element.
+
+For multiple collection arguments, apply f elementwise.
+"""
+asyncmap(f, c...) = collect(asyncgenerate(f, c...))
+
+
+"""
+    asyncmap!(f, c)
+
+In-place version of `asyncmap()`.
+"""
+asyncmap!(f, c) = (for x in AsyncCollector(f, c, c) end; c)
+
+
+"""
+    asyncmap!(f, results, c...)
+
+Like `asyncmap()`, but stores output in `results` rather returning a collection.
+"""
+asyncmap!(f, r, c1, c...) = (for x in AsyncCollector(f, r, c1, c...) end; r)

base/deprecated.jl

@@ -1003,5 +1003,33 @@ export call
 # 1933
 @deprecate_binding SingleAsyncWork AsyncCondition
 
+
 # #12872
 @deprecate istext istextmime
+
+#15409
+function pmap(f, c...; err_retry=nothing, err_stop=nothing, pids=nothing)
+
+    if err_retry != nothing
+        depwarn("err_retry is deprecated, use pmap(retry(f), c...).", :pmap)
+        if err_retry == true
+            f = retry(f)
+        end
+    end
+
+    if err_stop != nothing
+        depwarn("err_stop is deprecated, use pmap(@catch(f), c...).", :pmap)
+        if err_stop == false
+            f = @catch(f)
+        end
+    end
+
+    if pids == nothing
+        p = default_worker_pool()
+    else
+        depwarn("pids is deprecated, use pmap(::WorkerPool, f, c...).", :pmap)
+        p = WorkerPool(pids)
+    end
+
+    return pmap(p, f, c...)
+end

base/docs/helpdb/Base.jl

@@ -241,21 +241,6 @@ If `types` is specified, returns an array of methods whose types match.
 """
 methods
 
-"""
-    pmap(f, lsts...; err_retry=true, err_stop=false, pids=workers())
-
-Transform collections `lsts` by applying `f` to each element in parallel. (Note that
-`f` must be made available to all worker processes; see [Code Availability and Loading Packages](:ref:`Code Availability and Loading Packages <man-parallel-computing-code-availability>`)
-for details.) If `nprocs() > 1`, the calling process will be dedicated to assigning tasks.
-All other available processes will be used as parallel workers, or on the processes
-specified by `pids`.
-
-If `err_retry` is `true`, it retries a failed application of `f` on a different worker. If
-`err_stop` is `true`, it takes precedence over the value of `err_retry` and `pmap` stops
-execution on the first error.
-"""
-pmap
-
 """
     workers()
 

base/error.jl

@@ -49,3 +49,63 @@ macro assert(ex, msgs...)
     end
     :($(esc(ex)) ? $(nothing) : throw(Main.Base.AssertionError($msg)))
 end
+
+
+"""
+    retry(f, [condition]; n=3; max_delay=10) -> Function
+
+Returns a lambda that retries function `f` up to `n` times in the
+event of an exception. If `condition` is a `Type` then retry only
+for exceptions of that type. If `condition` is a function
+`cond(::Exception) -> Bool` then retry only if it is true.
+
+# Examples
+```julia
+retry(http_get, e -> e.status == "503")(url)
+retry(read, UVError)(io)
+```
+"""
+function retry(f::Function, condition::Function=e->true;
+               n::Int=3, max_delay::Int=10)
+
+    (args...) -> begin
+        delay = 0.05
+        for i = 1:n
+            try
+                return f(args...)
+            catch e
+                if i == n || try condition(e) end != true
+                    rethrow(e)
+                end
+            end
+            sleep(delay * (0.8 + (rand() * 0.4)))
+            delay = min(max_delay, delay * 5)
+        end
+    end
+end
+
+retry(f::Function, t::Type; kw...) = retry(f, e->isa(e, t); kw...)
+
+
+"""
+    @catch(f) -> Function
+
+Returns a lambda that executes `f` and returns either the result of `f` or
+an `Exception` thrown by `f`.
+
+# Examples
+```julia
+julia> r = @catch(length)([1,2,3])
+3
+
+julia> r = @catch(length)()
+MethodError(length,())
+
+julia> typeof(r)
+MethodError
+```
+"""
+catchf(f) = (args...) -> try f(args...) catch ex; ex end
+macro catch(f)
+    esc(:(Base.catchf($f)))
+end

base/exports.jl

@@ -1045,9 +1045,11 @@ export
 # errors
     assert,
     backtrace,
+    @catch,
     catch_backtrace,
     error,
     rethrow,
+    retry,
     systemerror,
 
 # stack traces
@@ -1211,7 +1213,9 @@ export
 
 # multiprocessing
     addprocs,
+    asyncmap,
     ClusterManager,
+    default_worker_pool,
     fetch,
     init_worker,
     interrupt,
@@ -1233,6 +1237,7 @@ export
     timedwait,
     wait,
     workers,
+    WorkerPool,
 
 # multimedia I/O
     Display,

base/generator.jl

@@ -22,6 +22,16 @@ function next(g::Generator, s)
     g.f(v), s2
 end
 
+
+"""
+    generate(f, c...) -> iterator
+
+Return an iterator applying `f` to each element of `c`.
+For multiple collection arguments, apply f elementwise.
+"""
+generate(f, c...) = Generator(f, c...)
+
+
 ## iterator traits
 
 abstract IteratorSize