Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 7754003
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 1, 20262026-06-01T12:11:51+00:00 2026-06-01T12:11:51+00:00

I have a recursive function which does a sort of tree process where each

  • 0

I have a recursive function which does a sort of tree process where each call may call itself multiple times, I don’t have any way of knowing how deep or wide it is. How do I run a callback once the entire process has been completed?

I’m thinking of having some sort of object to pass about to do a count but not quite cracked it yet, i’m wondering if there is a known best/better way of doing this.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-01T12:11:53+00:00Added an answer on June 1, 2026 at 12:11 pm

    what I needed to do is count the number of paths in each tree before calling the callback e.g.:

    myFunction: function(tree) {
      var count = 0;
      finishCallback = function() {
        if (--count === 0){
           callback();
        };
      };
    
      recursion = function(subTree) {
        count = tree.paths.length;
    
        _.each(subTree.path, function(route) {
          count += subFolder.fileRefs.length;
          recursion(route, function() {
            finishCallback();
          });
        });
      };
    
      recursion(tree);
    }
    

    Perhaps the count should not be inside myFunction but recursion should have its own count, however this works. (i’ve not tested this example)

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a recursive function which calls itself a very large number of times
I have some sort of recursive function, but I need to parse a string,
I have a recursive function which contains some drawing code inside. I was advised
I have the following example of a recursive function, and what I don't understand
I have a function in java which is written with a recursive algorithm that
I have a recursive function reading a table of contents of documents from a
Lets say I have a recursive function that creates lists within lists. It return
I am currently trying to build a program where I have a recursive function
I have a simple recursive function RCompare() that calls a more complex function Compare()
Is it possible to have a PHP function that is both recursive and anonymous?

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.