Also remove dynamic dispatch from GeneralLazyBifferCache

Author: LilithHafner

README.md

@@ -247,7 +247,7 @@ new caches on demand when they are required. The function `f` generates the cach
 for the type of `u`, and subsequent indexing reuses that cache if that type of `u` has
 already ben seen.
 
-Note that `LazyBufferCache` does cause a dynamic dispatch and its return is not type-inferred.
+Note that `GeneralLazyBufferCache`'s return is not type-inferred.
 This means it's the slowest of the preallocation methods, but it's the most general.
 
 ### Example

docs/src/index.md

@@ -242,7 +242,7 @@ new caches on demand when they are required. The function `f` generates the cach
 for the type of `u`, and subsequent indexing reuses that cache if that type of `u` has
 already been seen.
 
-Note that `LazyBufferCache` does cause a dynamic dispatch and its return is not type-inferred.
+Note that `GeneralLazyBufferCache`'s return is not type-inferred.
 This means it's the slowest of the preallocation methods, but it's the most general.
 
 ### Example

src/PreallocationTools.jl

@@ -234,7 +234,7 @@ correct using things like function barriers, then this is a general technique th
 is sufficiently fast.
 """
 struct GeneralLazyBufferCache{F <: Function}
-    bufs::Dict # a dictionary mapping types to buffers
+    bufs::Dict{Any, Any} # a dictionary mapping types to buffers
     f::F
     GeneralLazyBufferCache(f::F = identity) where {F <: Function} = new{F}(Dict(), f) # start with empty dict
 end