I have some code to compute a tuple replacement function set(tuple::Tuple{T1, T2}, t, i::I) where {T1, T2, I} if i == 1 (t, tuple[2]) elseif i == 2 (tuple[1], t) else tuple end end function set(tuple::Tuple{T1, T2, T3}, t, i::I) where {T1, T2, T3, I} if …

This already exists in Base. help?> Base.setindex setindex(c::Tuple, v, i::Integer) Creates a new tuple similar to x with the value at index i set to v. Throws a BoundsError when out of bounds. Examples ≡≡≡≡≡≡≡≡≡≡ julia> Base.setindex((1, 2, 6), 2, 3) == (1, 2, 2) true ─────────…

Computing tuple replacements

New to Julia

goerch October 12, 2021, 6:11am 11

I shortly looked into Setfield.jl and realized that it does some funky Haskellish stuff. I imagine it is more suited for nested immutable data, which I currently do not have.

1 Like

Topic		Replies	Views
Is there a way to "forward" getindex for Tuples in a type-stable way? General Usage	25	3748	December 6, 2017
Subset tuples with macros General Usage tuple	10	1392	February 17, 2019
Strange behavior of setindex() inside a function or a loop? General Usage question	2	369	September 22, 2019
Vararg vs Tuple{Vararg} performance Performance	4	1246	March 7, 2020
Fast type indexing Performance	6	634	March 10, 2019

Computing tuple replacements

Related topics