The slowdown of using something like ` count(z->(edges[1]<z<=edges[2]),x)`

is substantial, and can be avoided by a wrapping another function (see below).

Is this the same as 10x slowdown when passing function as argument?

```
using BenchmarkTools
x = randn(1_000_000)
edges = [0.0,1.0]
fn1(x,edges) = count(z->(edges[1]<z<=edges[2]),x) #slow
fn2(x) = count(z->(0<z<=1),x) #quick
fn3(x,edges) = fn3b(x,edges[1],edges[2]) #quick
fn3b(x,lo,hi) = count(z->(lo<z<=hi),x)
@btime fn1($x,$edges)
@btime fn2($x)
@btime fn3($x,$edges)
```

gives (on my notebook)

5.007 ms (0 allocations: 0 bytes)

335.300 ÎĽs (0 allocations: 0 bytes)

336.300 ÎĽs (0 allocations: 0 bytes)