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
Generate sub-tuples in an efficient, type-stable way Performance	2	311	August 12, 2023
Poor typing of tuple generators General Usage	7	2473	May 8, 2017
Calling a funcion with tuple types General Usage	3	660	January 31, 2017
Hashing tuples of tuples is seemingly very slow Performance	6	725	December 22, 2020
Alternative to mutable named tuple? General Usage	14	7746	August 27, 2021

Computing tuple replacements

Related topics