Stephan Hilb
Stephan Hilb
We have `binomial(n, k)=0` for `kn`. This makes `subsets` comply accordingly instead of creating wrong iterators or throwing errors.
It might be worth thinking about falling back to traditional loops if there are unrecognized expressions while issuing a warning about not optimizing instead of a hard error. Feel free...
generating expressions could be transformed to traditional loops to make the following work ```julia acc = 0 @avx for i in 1:10 acc += sum(i+j for j in 1:5) end...
Specializing `convert(Result{Any, E}, x)` for every type of `x` can incur substantial compilation overhead (not only on `convert` but also on `Some`). This change avoids specializing in case of explicit...
This implements `Statistics.median` based on the existing bitonic sorting, avoiding unnecessary allocation. While it is generally suboptimal to sort the whole array, the compiler manages to skip some branches since...
Allow more flexibility in output axes. Currently we only allow - output axes shrinked to applicable domain (no extension) - output axes matching input (when extension is used) ### Discussed...