Maximum Recursions Limit

[comment]

I am discovering that a Custom Function will not perform more than 10,000 recursions. Beyond that I get a question mark in the calc field.

I can't find any documentation for this limitation. Can anyone confirm/disprove this?

[comment]

I am discovering that a Custom Function will not perform more than 10,000 recursions. Beyond that I get a question mark in the calc field.

I can't find any documentation for this limitation. Can anyone confirm/disprove this?

[comment]

I am discovering that a Custom Function will not perform more than 10,000 recursions. Beyond that I get a question mark in the calc field.

I can't find any documentation for this limitation. Can anyone confirm/disprove this?

[Fenton]

From the file "Recursive" by Andrew Parsons (excelisys.com):

[Fenton]

From the file "Recursive" by Andrew Parsons (excelisys.com):

[Fenton]

From the file "Recursive" by Andrew Parsons (excelisys.com):

[-Queue-]

I can confirm that this is the limit.

Starting with a parameter of 1.

Case( num = 10000; "end"; num & " - " & test(num + 1) )

works, but

Case( num = 10001; "end"; num & " - " & test(num + 1) )

returns a question mark.

[-Queue-]

I can confirm that this is the limit.

Starting with a parameter of 1.

Case( num = 10000; "end"; num & " - " & test(num + 1) )

works, but

Case( num = 10001; "end"; num & " - " & test(num + 1) )

returns a question mark.

[-Queue-]

I can confirm that this is the limit.

Starting with a parameter of 1.

Case( num = 10000; "end"; num & " - " & test(num + 1) )

works, but

Case( num = 10001; "end"; num & " - " & test(num + 1) )

returns a question mark.

[comment]

Thanks for confirming, Fenton and JT.

A recursive calculation must provide a mechanism to end the loop, or it will run for 10,000 iterations

That's not very well put, is it? JT's calc clearly does provide such a mechanism (as does mine). It seems that the correct statement would be:

A recursive calculation will run for 10,000 iterations, or until FileMaker runs out of memory, or when a condition to end the loop has been met - whichever of the three comes first.

[comment]

Thanks for confirming, Fenton and JT.

A recursive calculation must provide a mechanism to end the loop, or it will run for 10,000 iterations

That's not very well put, is it? JT's calc clearly does provide such a mechanism (as does mine). It seems that the correct statement would be:

A recursive calculation will run for 10,000 iterations, or until FileMaker runs out of memory, or when a condition to end the loop has been met - whichever of the three comes first.

[comment]

Thanks for confirming, Fenton and JT.

A recursive calculation must provide a mechanism to end the loop, or it will run for 10,000 iterations

That's not very well put, is it? JT's calc clearly does provide such a mechanism (as does mine). It seems that the correct statement would be:

A recursive calculation will run for 10,000 iterations, or until FileMaker runs out of memory, or when a condition to end the loop has been met - whichever of the three comes first.