Update dependent packages

Author: kwj

julia/Euler/Project.toml

@@ -8,3 +8,8 @@ Combinatorics = "861a8166-3701-5b0c-9a16-15d98fcdc6aa"
 DataStructures = "864edb3b-99cc-5e75-8d2d-829cb0a9cfe8"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
 Primes = "27ebfcd6-29c5-5fa9-bf4b-fb8fc14df3ae"
+
+[compat]
+Combinatorics = "~1.0.3"
+DataStructures = "~0.19.0"
+Primes = "~0.5.7"

julia/Euler/src/bin/p0070.jl

@@ -21,7 +21,7 @@
 module Prob0070
 
 import Primes: prevprime, primes
-import DataStructures: PriorityQueue, enqueue!, peek
+import DataStructures: PriorityQueue
 
 LIMIT = 10 ^ 7 - 1
 
@@ -93,26 +93,26 @@ function solve_0070()
     # initial data for pruning:
     #   n = 87109 = 11 * 7919, phi(87109) = 79180
     pq = PriorityQueue{Vector{Tuple{Int, Int}}, Float64}()
-    enqueue!(pq, [(11, 1), (7919, 1)] => (87109 / 79180) )
+    push!(pq, [(11, 1), (7919, 1)] => (87109 / 79180) )
 
     for p in reverse(primes(11, isqrt(LIMIT)))
         # pruning: end of search
-        if get_ratio([(p, 1)]) > peek(pq)[2]
+        if get_ratio([(p, 1)]) > first(pq)[2]
             break
         end
 
         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]
+            if get_ratio(pf_lst[1:min(length(pf_lst), 2)]) > first(pq)[2]
                 break
             end
 
             if is_perm(prod(pf_lst), phi(pf_lst)) == true
-                enqueue!(pq, pf_lst => get_ratio(pf_lst))
+                push!(pq, pf_lst => get_ratio(pf_lst))
             end
         end
     end
-    prod(peek(pq)[1])
+    prod(first(pq)[1])
 end
 
 end #module

julia/Euler/src/bin/p0083.jl

@@ -8,7 +8,7 @@
 
 module Prob0083
 
-import DataStructures: PriorityQueue, enqueue!, dequeue_pair!, peek, isempty
+import DataStructures: PriorityQueue
 
 function make_neighbor_tbl(nrow, ncol)
     tbl = Array{Vector{Tuple{Int, Int}}}(undef, nrow, ncol)
@@ -26,14 +26,14 @@ function solve_0083(fname::String = "0083_matrix.txt")
     dist_tbl[1, 1] = data[1, 1]
 
     pq = PriorityQueue{Tuple{Int, Int}, Int}()
-    enqueue!(pq, (1, 1) => dist_tbl[1, 1])
+    push!(pq, (1, 1) => dist_tbl[1, 1])
 
     while isempty(pq) == false
-        (i, j), d = dequeue_pair!(pq)
+        (i, j), d = popfirst!(pq)
         for (x, y) in nbr_tbl[i, j]
             if (new_d = d + data[x, y]) < dist_tbl[x, y]
                 dist_tbl[x, y] = new_d
-                enqueue!(pq, (x, y) => new_d)
+                push!(pq, (x, y) => new_d)
             end
         end
     end

julia/README.md

@@ -22,13 +22,13 @@ You can run the test suite in the Pkg REPL.
 
 ## Notes
 
-It was confirmed to work with Julia v1.11.0.
+It was confirmed to work with Julia v1.11.6.
 
 I used the following packages and their dependent packages.
 
-- Combinatorics v1.0.2
-- DataStructures v0.18.20
+- Combinatorics v1.0.3
+- DataStructures v0.19.0
 - LinearAlgebra[^1]
-- Primes v0.5.6
+- Primes v0.5.7
 
 [^1]: It's distributd with Julia.