friendica.eskimo.com

Welcome to Friendica.Eskimo.Com

Home of Censorship Free Hosting

 Eskimo North Linux Shells, E-mail, Virtual Machines, Web Hosting.

E-mail, Web Hosting, Linux Shell Accounts terminal or full remote desktops.

Sign Up For A Free Trial Here

Please tell your friends about federated social media site that speaks several fediverse protocols thus serving as a hub uniting them, hubzilla.eskimo.com, also check out friendica.eskimo.com, federated macroblogging social media site, mastodon.eskimo.com a federated microblogging site, and yacy.eskimo.com an uncensored federated search engine. All Free!
Hypolite Petovan
Hypolite Petovan friendica (via ActivityPub)
It isn't always easy to figure out whether you have progressed as a programmer or not, but managing to write a recursive function right the first try definitely is a solid milestone.
#programming
Link to source
3 1
Nanook
Nanook friendica
The follow obviously worked because here you are.
Link to source
1
Nanook
Nanook friendica
Few people interface both with machines and people well, you do exceedingly well at both!
Link to source
1
Brad Koehn
Brad Koehn unkn (AP)
Then the trick is to re-write it without using recursion!
Link to source
Hypolite Petovan
Hypolite Petovan friendica (via ActivityPub)

Here's the problem I solved with recursion: I want to update a value in a multi-dimensional array based on a key path. The path is a list of array keys in increasing depth. The value should override the existing one or be created (along with the intermediate keys) if it doesn't.

For example, with the following key path: friendica, database, user and the value hypolite, I want to update the following array key: array[friendica][database][user] = hypolite. Of course the key path length is arbitrary.

I can't think of a way of not using recursion, but I'm curious how you would do it.

Link to source

This website uses cookies. If you continue browsing this website, you agree to the usage of cookies.