On Apr 13, 2016 7:57 PM, "Matt Bauman" <mbau...@gmail.com> > If your default element is going to be zero(T), have you tried using SparseVectors?
Is that from this package https://github.com/JuliaSparse/SparseVectors.jl or somewhere else? > They should have *significantly* better performance than a dictionary in many cases. What about performance of random order insertions? The structure I'd want for fast linear algebra would be similar to one column of a csc matrix, right? The workloads will have a relatively high ratio of insertions to reads, and almost no bulk reads -- like you would have for a matvec. I guess one of the benefits of making the underlying storage type generic is that you could do this comparison easily. -James
