Hi everyone. This might be a REALLY silly question, but I wonder if it is possible. I am making this function Set_Up(). It is design to load all other functions in my code, force precompilation, load global variables, etc. Because sometimes something goes wrong I have: try Do a lot of things c…

Yes. I actually implemented this for a network handshaking function a few years ago. I did also have a “retries” variable that increments on each restart, with provision to exit if too many retries. This kept the function from being stuck too long (in practice the restart hardly ever happened, with…

There should be no difficulty in practice. For example, the following function will run successively once being called. function hello() println("hello") hello() end But I guess finding the reason that leads to “something goes wrong” makes more sense here.

This is called recursion , an important technique in computer science. Note that each call allocates on the stack, so if you go too deep you will get a stack overflow (which gave its name to a famous website). julia> counter = 0; julia> function f() global counter += 1 f() …

[image] sijo: This is called recursion , an important technique in computer science. Note that each call allocates on the stack, so if you go too deep you will get a stack overflow (which gave its name to a famous website). Well, don’t keep us in suspense forever, what is the name of this famo…

Hmm Hi guys. I tried this… but my code just gets into a loop and never actually finishes… Not sure why. I wonder if there is a line to kill the current execution and then call the function again.

What goes wrong is that some libraries in the OS need to be called twice (GMT package) for them to work. This is a problem of the package … and I can’t fix it hehehe.

[image] StevenSiew: Well, don’t keep us in suspense forever, what is the name of this famous website? Can’t tell if joking… https://stackoverflow.com/

With recursion, at some point you have to return anything which is not the function call to ensure that the recursion terminates. You do this via a conditional like “if counter > 100” and return nothing for that case. For some kind of repeated call, you can also use retry (from HTTP if I’m not mist…

Can any one give me an example to make sure that the recursion happens only once?

function myrecursion(depth::Int,arg) if depth>=2 return nothing else println(arg) @info("myrecursion was called (depth=$(depth))") return myrecursion(depth+1,arg) end end myrecursion(0,"foo") 0

Can I make a Function Call Itself?

New to Julia

StefanKarpinski Split this topic July 5, 2021, 7:46pm 12

3 posts were split to a new topic: Does Julia have tail call optimization?

Topic		Replies	Views
How to call a recursive function without stackoverflow? New to Julia compilation , recursion	10	1236	March 11, 2023
StackOverflowError after only 14 calls to the same function? General Usage stackoverflow	4	271	November 18, 2025
Infinite recursion kills Julia instead of stackoverflowing General Usage	6	1318	December 5, 2019
Why do Julia BigInt iterative functions overflow? General Usage question	6	546	February 23, 2024
Recursive inner functions a thousand times slower? Performance	8	1465	August 20, 2022

Can I make a Function Call Itself?

Related topics