2011/12/8 <pclouds@xxxxxxxxx>: > From: Nguyễn Thái Ngọc Duy <pclouds@xxxxxxxxx> > > This seems to work for me. But I think this approach uses (much?) more > memory because it turns a tree of calls into a flat list of calls and > keep the list until the end, while the recursive version only has to > keep one call chain at a time. > > Any ideas how to improve it? Well, fortunately JGit is under a very liberal BSD license and has a pretty efficient version of a heap based algorithm for delta resolution. You could look at [1] for ideas. I am told the BSD license is very compatible with the GPLv2. (Unlike the reverse.) [1] http://egit.eclipse.org/w/?p=jgit.git;a=blob;f=org.eclipse.jgit/src/org/eclipse/jgit/transport/PackParser.java;hb=HEAD#l556 -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html