spell check

src/FilterPkgs.jl

@@ -20,7 +20,7 @@ of required "root" packages, using the following recursive logic:
 - D[end] conflicts w. reachable & P[i] depends on D => P[i+1] reachable
 
 The function returns a dictionary mapping packages to the maximum version index
-of that package that could be reached in an optimal solution. If a pacakge
+of that package that could be reached in an optimal solution. If a package
 cannot appear in an optimal solution, it will not appear in this dictionary.
 """
 function find_reachable(
@@ -153,11 +153,11 @@ function mark_necessary!(
         # get conflicts & dimensions
         X = info[p].conflicts
         m = size(X, 1) - 1
-        m > 1 || continue # unique version cannot be reundant
+        m > 1 || continue # unique version cannot be redundant
         n = size(X, 2) - 1
         # active indices
         append!(empty!(J), (j for j = 1:m if X[j, end]))
-        length(J) > 1 || continue # unique version cannot be reundant
+        length(J) > 1 || continue # unique version cannot be redundant
         append!(empty!(K), (k for k = 1:n if X[end, k]))
         # find redundant versions
         empty!(R)

src/Resolve.jl

@@ -7,7 +7,7 @@ function resolve_core(
     max  :: Integer = RESOLVE_MAX_SOLUTIONS,
     by   :: Function = identity, # ordering
 ) where {P}
-    # solution search data strutures
+    # solution search data structures
     sol = Dict{P,Int}() # current solution
     sols = typeof(sol)[] # all solutions
 

src/SAT.jl

@@ -29,7 +29,7 @@ function SAT(
     for p in names
         vars[p] = N
         n_p = length(info[p].versions)
-        # 1 varible for package
+        # 1 variable for package
         # n_p variables for versions
         N += 1 + n_p
     end

test/setup.jl

@@ -113,7 +113,7 @@ function is_valid_solution(
     pkgs :: AbstractVector{P},
     vers :: AbstractVector{<:Union{V,Nothing}},
 ) where {P,V}
-    # check satisfiaction of dependencies
+    # check satisfaction of dependencies
     for (i, v) in enumerate(vers)
         v === nothing && continue
         data_p = data[pkgs[i]]
@@ -147,7 +147,7 @@ function make_solution_partial_order!(
     reqs :: AbstractVector{P},
     pkgs :: AbstractVector{P}, # may be expanded
 ) where {P,V}
-    # verion dependencies (may expand pkgs)
+    # version dependencies (may expand pkgs)
     deps = Dict{Tuple{Int,V},Vector{Int}}()
     i = 0
     while (i += 1) ≤ length(pkgs)

test/tiny_data.jl

@@ -148,7 +148,7 @@ for mask = 0x0:0xff
     end
 end
 
-# functions for generiting test data
+# functions for generating test data
 
 using ..Resolver: PkgData