Tweak for Channel()

Author: kwj

julia/Euler/src/bin/p0050.jl

@@ -23,7 +23,7 @@ end
 
 function solve_0050(limit::Int = 1_000_000)
     # cs_lst: [0, prime(1), prime(1) + prime(2), prime(1) + prime(2) + prime(3), ...]
-    cs_gen = Channel(cumsum_generator)
+    cs_gen = Channel{Int}(cumsum_generator)
     cs_lst = init_cumsum_lst(cs_gen, limit)
 
     answer = 0

julia/Euler/src/bin/p0070.jl

@@ -101,7 +101,7 @@ function solve_0070()
             break
         end
 
-        for pf_lst in Channel(c -> pf_generator(c, (p, prevprime(LIMIT ÷ p))))
+        for pf_lst in Channel{Vector{Tuple{Int, Int}}}(c -> pf_generator(c, (p, prevprime(LIMIT ÷ p))))
             # pruning: skip to the next prime smaller than 'p'
             if get_ratio(pf_lst[1:min(length(pf_lst), 2)]) > peek(pq)[2]
                 break

julia/Euler/src/bin/p0077.jl

@@ -12,7 +12,7 @@ function prime_generator(c)
 end
 
 function solve_0077(thr::Int = 5_000)
-    p_gen = Channel(prime_generator)
+    p_gen = Channel{Int}(prime_generator)
     plst = Array{Int}(undef, 0)
     while true
         push!(plst, take!(p_gen))

julia/Euler/src/bin/p0078.jl

@@ -85,7 +85,7 @@ end
 
 function solve_0078(denom::Int = 1_000_000)
     # generalized pentagonal numbers: gp[1] = 1, gp[2] = 2, gp[3] = 5, gp[4] = 7, ...
-    gp_gen = Channel(gp_generator)
+    gp_gen = Channel{Int}(gp_generator, 1)
     gp = Vector{Int}(undef, 0)
     push!(gp, take!(gp_gen))