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

CameronBieganek October 21, 2021, 9:08pm 19

Related discussion of @code_warntype here:

1 Like

Topic		Replies	Views
How to get a tuple's field using a runtime index in a type stable way? General Usage	24	582	March 16, 2024
Is there a way to "forward" getindex for Tuples in a type-stable way? General Usage	25	3676	December 6, 2017
Subset tuples with macros General Usage tuple	10	1366	February 17, 2019
Tuple indexing taking time? Performance	25	959	April 1, 2021
Vararg vs Tuple{Vararg} performance Performance	4	1222	March 7, 2020

Computing tuple replacements

Related topics