- 🎮Indie game dev
- 💬Adding content to programming.dev
posting things from the 100+ rss feeds I follow. You should see me post links in two chunks for when im reading stuff, once in the morning and once in the evening ET. If you want some of my sources for certain communities feel free to dm
- 46 Posts
- 11 Comments
When the draw function calls itself it yields control to that new function its calling. When that function ends it takes back control and continues doing what it was doing.
This means all of the for loops in all of the functions will execute. Draw(1) will do the for loop and then return as it hits the end of the function (standard behaviour when you reach the end of a function even if theres no return statement). Then draw(2) will do the for loop as it gets back control now that draw(1) is done and then return, etc. all the way up
All parts of a function are recursive, theres no such thing as a non recursive part
This code has a recursive call (function calls itself) within the function so that has to be taken into account when tracing it
This would make the function execute multiple times so the for loop would end up executing multiple times.
Lets say main calls draw with a height value of 10 (draw(10)). First it sees that n is greater than 0 so it keeps going. Then it calls the draw function with a value of 10 - 1 aka 9. Now its executing in the draw(9) function. Greater than 0 so continues and calls draw(8). etc. all the way down to draw(0) where it sees that n is equal to 0 so returns out of the function due to the return statement.
Now that draw(0) finished executing draw(1) can keep going and goes to the for loop. Here it prints 1 # and then prints a new line (and then returns since it hit the end of the function). Now that draw(1) is done draw(2) can keep going and prints 2 #'s and then prints a new line (and then returns). This keeps going all the way up to the initial draw call, draw(10) which prints 10 #'s and then a new line, returns, and then the main function keeps going but theres nothing after that so it returns and the execution ends.
The effect from coming back after the recursive calls makes it seem like n is increasing but its just different calls to the same function. i is taken into account for but printing the amount of #'s since thats whats within that loop
searching across all of github was made to be logged in then
repository level searching though is relatively recent. Heres the blog post about the change dated in June this year https://github.blog/changelog/2023-06-07-code-search-now-requires-login/
This comment by an employee in the thread also calls out it was in 2023 and links to the blog post
Weird, heres the content in it
It is with immense sadness that we must share with you the news of the loss of our friend, our leader, and our mentor, Kris Nóva.
It was Nóva who inspired us to come together to build Hachyderm, whose vision created Nivenly, and whose mission we continue to carry forward. In her working life beyond Nivenly, she has left behind a legacy of professionalism and strength of vision, and we all miss her terribly.
This is very fresh and raw for us in the Nivenly community right now, so we ask for patience while we figure out how we move forward. But move forward we will, as we know that is what Nóva would want.
Yes, or it compiles to JavaScript. From the version 1 post