Calculating Statistics of an Array with A Mask (Masked Array)

[mbauman]

This is a pretty common stumbling block, unfortunately:

Shouldn't `@views sum(data[mask])` be non-allocating?

I was surprised to see the following function allocates - is this expected? using BenchmarkTools function f_viewalloc(data, mask) @views sum(data[mask]) end let N = 1_000_000 data = fill(true, N) mask = fill(true, N) @btime f_viewalloc($data, $mask) end 1.476 ms (2 allocations: 7.63 MiB)

Confused about performance interaction between @view and logical (Boolean) indexing

I’m trying to understand the interaction between array views and Boolean indexing. In general, my understanding (and experience thus far) is that views generally increasing performance when you’re not modifying the array slices. For example: x = collect(1:1000) @btime z = x[50:200]; 107.278 ns (1 allocation: 1.33 KiB) @btime z = @view x[50:200]; 19.084 ns (1 allocation: 48 bytes) However, now do the equivalent operations using Boolean indexing, and the performance is reversed: w = (x …

Faster array indexing with a logical array

Hi everyone, Pretty basic question… I was experimenting with indexing arrays with logical arrays. For instance, say I have an array shaped (10000,2) and I need to extract all the indices where the sum across the columns is less than a threshold. What would be the best Julian way to do it? I tried list comprehension but that is slower than the method below MWE: using BenchmarkTools # what I could think of ? function getindicesVectorized(x::Array) return x[getindex.(findall(sum(x, dims=2…