Sparse vector uses binary search. Dictionary uses a hash. Anyone has an experience to share?

const NLOOP = 1000000 yields 157.137 ms (0 allocations: 0 bytes) 157.251 ms (0 allocations: 0 bytes) 36.294 ms (0 allocations: 0 bytes) 37.151 ms (0 allocations: 0 bytes) Main.m

What is faster: sparse vector or a dictionary?

General Usage

PetrKryslUCSD March 31, 2024, 11:44pm 12

What if I never defined the name (i.e. used _)? Edit: That wouldn’t have helped at all.

What is the fastest way of making a vector of dictionaries?

Topic		Replies	Views
Poor time performance on Dict? Performance	26	19203	March 12, 2018
Really Fast Hash Set and Map Internals & Design	20	6318	August 29, 2018
How efficient is dictionary lookup in Julia? Performance dictionary	6	5115	July 30, 2019
Performance of array of arrays vs. dictionaries when accessing and manipulating data structures Performance question	5	2393	March 14, 2022
Small <: AbstractDict implementation General Usage question	9	1129	February 13, 2019

What is faster: sparse vector or a dictionary?

Related topics