Add RecursiveArrayToolsArrayPartitionAnyAll subpackage

Benchmarking shows the partition-by-partition any/all IS ~1.5-1.8x faster
than the AbstractArray default for full scans, because ArrayPartition's
generic element iteration has per-element partition lookup overhead.

Kept as a separate lib/ subpackage (not a submodule) because submodules
are loaded at package load time and would still cause invalidations.

Co-Authored-By: Chris Rackauckas <accounts@chrisrackauckas.com>
Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

Author: ChrisRackauckas

lib/RecursiveArrayToolsArrayPartitionAnyAll/Project.toml

@@ -0,0 +1,10 @@
+name = "RecursiveArrayToolsArrayPartitionAnyAll"
+uuid = "172d604e-c495-4f00-97bf-d70957099afa"
+version = "1.0.0"
+
+[deps]
+RecursiveArrayTools = "731186ca-8d62-57ce-b412-fbd966d074cd"
+
+[compat]
+RecursiveArrayTools = "3.48"
+julia = "1.10"

lib/RecursiveArrayToolsArrayPartitionAnyAll/src/RecursiveArrayToolsArrayPartitionAnyAll.jl

@@ -0,0 +1,25 @@
+"""
+    RecursiveArrayToolsArrayPartitionAnyAll
+
+Optimized `any`/`all` for `ArrayPartition` that iterates partition-by-partition
+instead of using the generic `AbstractArray` element iteration. This gives
+~1.5-1.8x speedup on full scans because it avoids per-element partition lookup
+overhead. Separated into its own subpackage because `any(f::Function, ::ArrayPartition)`
+invalidates ~780 specializations of `any(f::Function, ::AbstractArray)`.
+
+```julia
+using RecursiveArrayToolsArrayPartitionAnyAll
+```
+"""
+module RecursiveArrayToolsArrayPartitionAnyAll
+
+using RecursiveArrayTools: ArrayPartition
+
+Base.any(f, A::ArrayPartition) = any((any(f, x) for x in A.x))
+Base.any(f::Function, A::ArrayPartition) = any((any(f, x) for x in A.x))
+Base.any(A::ArrayPartition) = any(identity, A)
+Base.all(f, A::ArrayPartition) = all((all(f, x) for x in A.x))
+Base.all(f::Function, A::ArrayPartition) = all((all(f, x) for x in A.x))
+Base.all(A::ArrayPartition) = all(identity, A)
+
+end