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
Iterate and intersect on BitSet vs Int Performance	11	1350	October 27, 2019
Iterating over range is slower than while loop Performance	7	583	April 24, 2023
Indices of intersection of two arrays General Usage arrays	25	10526	April 19, 2024
Accessing a vector of vector is slow Performance	6	338	June 13, 2024
Performance difference in permuting Arrays Performance sort , sortperm	4	524	October 11, 2021

Hand written loop slower than bitVector broadcast

Related topics