I’m wondering if there is an efficient way to build a tuple recursively. I’m working with a three-term recurrence relationship (specifically, this one ). The first and second terms are known. From them, all the other terms can be computed, one-by-one. The number of terms is known at run time. I can…

[image] markmbaum: The number of terms is known at run time. A tuple is probably the wrong data structure if the length is only known at runtime. This is what a Vector is for.

Efficient recursive tuple construction

General Usage

markmbaum September 9, 2021, 5:53pm 15

Does a generated function work for you if the number of terms is a little larger? Say, 100? I gave it a try and had issues with larger numbers of terms.

Topic		Replies	Views
Alllocations in a reduction over a Tuple Performance memory-allocation	2	464	April 28, 2022
Question on tuple New to Julia	10	753	November 18, 2018
Core.tuple() warntype Performance	22	1574	January 17, 2020
Performance of recursively building tuples Performance	6	569	November 30, 2020
Manually unroll operations with objects of tuple New to Julia question , metaprogramming , unrolling	21	2326	June 13, 2018

Efficient recursive tuple construction

Related topics