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, …

[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
`unique(Vector{CustomStruct})` requires method for hash \| Bug or misleading documentation? General Usage question , hash	6	480	March 16, 2022
Help me understand the `unique` semantic for a vector of mutable struct General Usage question , mutable-structure	6	218	February 28, 2024
Unique! and sorted collections General Usage	5	1477	October 16, 2018
Possible issue with `unique` when overloading `isequal` General Usage question	2	386	January 9, 2021
Unique doesn't seem to obey == definitions General Usage	7	565	October 10, 2020

Fastest way to `unique!`

Related topics