Remove misleading comments

src/solve.jl

@@ -45,10 +45,6 @@ function solve(
         # TODO: use `@spawn` instead of `@threads for` for better composability.
         # For as long as tasks can't jump between threads, `@spawn` is quiet unreliable
         # in populating different threads. Therefore we stick to `@threads` for now.
-        # Once the following PR is merged (maybe Julia v1.6), nested calls to `@threads`
-        # will be parallelized as well.
-        #
-        # https://github.com/JuliaLang/julia/pull/36131#pullrequestreview-425193294
         tasks = asyncmap(ws, countfrom(1, nt)) do w, i
             _conns = @view conns[i:i+nt]
             @spawnat w begin

src/types.jl

@@ -1,31 +1,14 @@
-"""
-doc
-"""
 struct ParaRealAlgorithm{CoarseAlgorithm,
                          FineAlgorithm,
                          UpdateFunction,
                         } <: DiffEqBase.DEAlgorithm
-    """
-    * Will be called like `coarse(prob)`
-    * Must return an integrator `integrator` that allows for `reinit!(integrator, u0)` and `solve!(integrator)`
-    """
     coarse::CoarseAlgorithm
-    "same as `coarse`"
     fine::FineAlgorithm
-    "how to merge coarse and fine solutions"
     update!::UpdateFunction
 end
 
 ParaRealAlgorithm(coarse, fine) = ParaRealAlgorithm(coarse, fine, default_update!)
 
-#=
-struct ParaRealCache <: OrdinaryDiffEqMutableCache
-end
-
-struct ParaRealConstantCache <: OrdinaryDiffEqConstantCache
-end
-=#
-
 function default_update!(y_new, y_coarse, y_fine, y_coarse_old)
     @. y_new = y_coarse+y_fine-y_coarse_old
     nothing

src/worker.jl

@@ -83,8 +83,6 @@ function _solve(prob,
 
     if niters > maxiters
         @warn "Worker $step/$n reached maximum number of iterations: $maxiters"
-        #close(next)
-        #return maxiters == 1 ? coarse_sol : fine_sol
     end
 
     # If this worker converged, there is no need to pass on the