Problem formulation I have an array old::Vector{T} of somewhat complicated structs; I have an array new::Vector{T} of other complicated structs. I want an array result::Vector{T} which contains a single element for each == equivalence class for elements from old and new, and preserves the order, i…

[image] abulak: a clever way to multithread unique! FYI ThreadsX.jl has ThreadsX.unique. It should work with many iterator transforms including Iterator.flatten. Here is a comparison of Base.unique ("base") and ThreadsX.unique ("tx") ran on a two-core machine (some random machine on GitHub A…

Fastest way to `unique!`

General Usage

Tamas_Papp October 9, 2020, 10:41am 8

Use an OrderedSet, only insert new elements, collect when done.

also preserves order AFAIK and has a cool API to avoid hash table lookups twice.

1 Like

Topic		Replies	Views
[ANN] ThreadsX.jl: Parallelized Base functions Package Announcements package , announcement , parallel	63	6797	February 2, 2022
In multithreading, how to make each thread pick the first/smallest available element? General Usage parallel , multithreading	13	947	January 10, 2023
Add unique!(f, itr) #28415 Internals & Design	6	684	December 5, 2018
Thread-safe array building General Usage multithreading	21	7753	October 24, 2017
No more threadid indexing? [thread-local storage] Performance multithreading , threads	36	1307	August 15, 2025

Fastest way to `unique!`

Related topics