Hi, MWE below I have a use case for intersection of lists of sorted integer vectors with a vector of sorted integers i.e. intersect!(vec :: Vector{Int},vectorOfVectors::Vector{Vector{Int}}) because the vectorOfVectors can be quite large in and of itself, and the fact that I cant always “edit” m…

[image] DNF: so a 6x speed difference seems roughly expected, since avx2 works on eight 32bit integers in parallel. FWIW, the fast Base code doesn’t use SIMD either. Back in 2018 when I last looked at that in detail, the core loop of the Base code was intended to run in ~1.7 cycles per selec…

Hand written loop slower than bitVector broadcast

General Usage Performance

rafael.guerra January 17, 2024, 11:18pm 15

PS: on this topic, have you ever got the tattoo?

Topic		Replies	Views
BitVector vs Vector{Bool} as default on comparison operations Performance	8	9365	November 2, 2020
Efficient (non-allocating, in-place) getindex! for BitArray? Performance question , indexing	19	1729	July 2, 2020
Iterate and intersect on BitSet vs Int Performance	11	1421	October 27, 2019
Why is BitArray so slow? Performance	28	5997	January 14, 2022
Boolean operations on large bit vectors / arrays Internals & Design	2	2210	December 26, 2016

Hand written loop slower than bitVector broadcast

Related topics