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

stevengj September 10, 2021, 12:03pm 20

Sure, could you file an issue?

Topic		Replies	Views
Variable Length Tuples Without Allocation Internals & Design question	9	878	March 27, 2025
Alllocations in a reduction over a Tuple Performance memory-allocation	2	476	April 28, 2022
Memory allocations when performing operation on Tuple of structs Performance tuple , memory-allocation , struct	9	258	October 15, 2024
Efficient tuple concatenation General Usage tuple , recursion	16	8702	January 17, 2025
Performance of recursively building tuples Performance	6	599	November 30, 2020

Efficient recursive tuple construction

Related topics