merge_recurse in libray reshape - how does it work?

For the general purpose of Recall, this might help:

http://rfunction.com/archives/364

It's typically used in recursive function definitions - e.g., the
Fibonacci series.

Dennis

On Thu, May 30, 2013 at 7:57 PM, Stephen Sefick <sas0025 at auburn.edu> wrote:

merge_recurse
function (dfs, ...)
{
     if (length(dfs) == 2) {
         merge(dfs[[1]], dfs[[2]], all = TRUE, sort = FALSE, ...)
     }
     else {
         merge(dfs[[1]], Recall(dfs[-1]), all = TRUE, sort = FALSE,
             ...)
     }
}

I do not understand how the Recall part of this function works.  Could
somebody explain this to me?
many thanks,


--
Stephen Sefick
**************************************************
Auburn University
Biological Sciences
331 Funchess Hall
Auburn, Alabama
36849
**************************************************
sas0025 at auburn.edu
http://www.auburn.edu/~sas0025
**************************************************

Let's not spend our time and resources thinking about things that are so
little or so large that all they really do for us is puff us up and make us
feel like gods.  We are mammals, and have not exhausted the annoying little
problems of being mammals.

                                 -K. Mullis

"A big computer, a complex algorithm and a long time does not equal
science."

                               -Robert Gentleman