@@ -70,7 +70,7 @@ If `p` is omitted, test whether any values along the given `dims` are `true`
70
70
71
71
# Usage Recommendation
72
72
If `A` is reasonably small, `vany` may be faster than `any`; however, as the size
73
- of `A` grows, the probability of any element returning true inevitably increases
73
+ of `A` grows, the probability of any element returning ` true` inevitably increases
74
74
(it is repeated Bernoulli sampling, thus, even with a very small success probability,
75
75
a large number of tries makes may yield a scenario where the `break` of `any` wins out).
76
76
Consequently, the probability of individual elements being `true` should determine choice --
@@ -99,6 +99,15 @@ Determine whether predicate `p` returns true for all elements over the given `di
99
99
If `p` is omitted, test whether all values along the given `dims` are `true`
100
100
(in which case `A` should be `AbstractArray{Bool}`).
101
101
102
+ # Usage Recommendation
103
+ If `A` is reasonably small, `vall` may be faster than `all`; however, as the size
104
+ of `A` grows, the probability of all element returning `false` inevitably increases
105
+ (it is repeated Bernoulli sampling, thus, even with a very small success probability,
106
+ a large number of tries makes may yield a scenario where the `break` of `all` wins out).
107
+ Consequently, the probability of individual elements being `true` should determine choice --
108
+ if one suspects a reasonable success probability, then `all` may be preferable, depending
109
+ on the size `A`. More testing is needed to determine potential breakpoints.
110
+
102
111
# Additional Notes
103
112
This function suffers from the same issue as `vfindmax` and friends -- reductions
104
113
which include the first dimension with max masks are not yet supported by LoopVectorization.
0 commit comments