milon @ milon @lemm.ee

Posts

6

Comments

26

Joined

2 yr. ago

Yeah I think I will follow the same approach. 3rd parties are a bit risky.

Thanks for the additional info. Maybe I will opt for the developer version instead in that case.

Yup no issues here

I see now. So it's possible for someone to run into multiple issues which can make updating a hassle.

Done 😀

Thanks again!

Yes, I did. I was warned about doing so before but now I understand 😆

Turns out the issue was with one or some of the layered packages I had. After uninstalling, the CLI method to upgrade worked. See the post below, but thanks for your reply.

Also, as I reinstall a flathub version of LibreOffice, should I choose the Fedora repo or Flathub repo?

It worked! I uninstalled dnf-automatic, libreoffice, and rpmfusion and then restarted.

Thanks for your help! Will keep your tips in mind for the future and try to avoid layering.

So basically it's not allowing me to update because of these layered packages and every time I want to update, I have to uninstall them and reinstall after I update?

Problem is I don't know what the packages are or what they were for even. I don't recall installing them.

I have two entries each with a different BaseCommit. One has dnf-automatic, libreoffice, vpn app. The other has the same three plus rpmfusion-free-release and rpmfusion-nonfree-release.

I just recently installed the rpmfusion packages but I didn't know what I was doing. Just found something online suggesting an alternative update method for Silverblue.

Yes, that helps. Thanks. I see now how n goes from 1 to 2 to 3...etc. Now not so sure how i = 1 when the for loop starts.

Yes - I finally caught that part about n as it's just moving in reverse so it gets decremented. Now I'm not sure about i. In the debugger when the program gets to the for loop both n and i are equal to 1. The n I understand but i?

Gotcha. Thanks for the explanation.

I see. I guess my understanding was that the recursion was over after the recursive call, but it's actually for all the code in draw().

Thanks. I did see that. I have a general understanding of how recursion works I think where the function calls itself again and again but I don't get why the code (for loop) below the draw(n - 1) is recursive.

Right. I was aware it was recursion as stated in the title of my post. I had two questions specific to where the for loop returns after printing #.

Why does the for loop return when it hits the end of the function? Isn't the recursive portion already completed in draw(n - 1)? The rest of it is just normal non-recursive code if I understand it correctly.