Appease the typo-bot

src/independentlylinearizedutils.jl

@@ -36,7 +36,7 @@ mutable struct CachePool{T, THREAD_SAFE}
     const pool::Vector{T}
     const alloc::Function
     lock::ReentrantLock
-    num_alloced::Int
+    num_allocated::Int
     num_acquired::Int
 
     function CachePool(T, alloc::F; thread_safe::Bool = true) where {F}
@@ -55,7 +55,7 @@ are available.
 Base.@inline function acquire!(cache::CachePool{T}, _dummy = nothing) where {T}
     cache.num_acquired += 1
     if isempty(cache.pool)
-        cache.num_alloced += 1
+        cache.num_allocated += 1
         return cache.alloc()::T
     end
     return pop!(cache.pool)

src/saving.jl

@@ -384,7 +384,7 @@ cache = LinearizingSavingCallbackCache(prob, solver; num_derivatives)
 # Store the results in this array of independently linearized solutions
 ilss = Vector{IndependentlyLinearizedSolution}(undef, num_trajectories)
 
-# Create `prob_func` piece ot remake `prob` to have the correct callback,
+# Create `prob_func` piece to remake `prob` to have the correct callback,
 # hooking up the necessary caching pieces.
 function linearizer_adding_remake(prob,i,_)
     ilss[i] = IndependentlyLinearizedSolution(prob, num_derivatives; cache_pool=cache.ils_cache)

test/independentlylinearizedtests.jl

@@ -25,15 +25,15 @@ using DiffEqCallbacks: CachePool, acquire!, release!, @with_cache
                 @test u₁[1] == 1.0
             end
 
-            previously_alloced = pool.num_alloced
+            previously_allocated = pool.num_allocated
             # Test that asking for a vector while we have one free does not allocate
             function foo(pool)
                 return @with_cache pool u begin
                     u[1]
                 end
             end
             @test foo(pool) == 1.0
-            @test pool.num_alloced == previously_alloced
+            @test pool.num_allocated == previously_allocated
         end
     end