I often want to do the following for a large n where I perform some calculations and return a tuple of values with the result of each iteration: function f(n::Int) v = Vector() for i in 1:n ... push!(v, (a=i, b=1.23, c=false, d=:foo, ...)) end v end As written, the code is less ef…

As discussed over in Ridiculous idea: types from the future (as @mohamed82008 mentioned), there is a pretty nice way to do this with map: function f(n) map(1:n) do i (a=i, b=1.23, c=false, d=:foo) end end This is a pretty nice solution, since it’s shorter than the original code while being…

Type-stable Array of NamedTuples

General Usage Performance

mohamed82008 December 27, 2019, 5:41pm 5

See this discussion Ridiculous idea: types from the future.

1 Like

Topic		Replies	Views
How to make type-stable: passing an element of a vector of functions Performance question	4	558	April 26, 2021
Type unstable function returning a tuple General Usage	34	1256	November 3, 2020
How can I create type stable stable tuples with non-concrete parameters (or: Invariant tuple types) General Usage	5	319	February 17, 2022
Type stability with tuples is hard Performance performance , tuple , type-stability	23	3205	April 21, 2021
Type Inference of many dynamically created NamedTuples Performance question , compilation , type-stability	6	77	July 25, 2024

Type-stable Array of NamedTuples

Related topics