summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: 1be846f)
raw | patch | inline | side by side (parent: 1be846f)
author | Eric Wong <normalperson@yhbt.net> | |
Wed, 13 Jun 2007 09:37:03 +0000 (02:37 -0700) | ||
committer | Junio C Hamano <gitster@pobox.com> | |
Wed, 13 Jun 2007 17:56:44 +0000 (10:56 -0700) |
I hadn't looked at this code in a while and had to read this
again to figure out what it did. To avoid having to do this
again in the future, I just gave gave the hunk a descriptive
name.
Signed-off-by: Eric Wong <normalperson@yhbt.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
again to figure out what it did. To avoid having to do this
again in the future, I just gave gave the hunk a descriptive
name.
Signed-off-by: Eric Wong <normalperson@yhbt.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
git-svn.perl | patch | blob | history |
diff --git a/git-svn.perl b/git-svn.perl
index e35006142af766080b3bafe0cdcd39bf2ccf3f04..58f7dd09576ddf712900f435e4221fdbef892819 100755 (executable)
--- a/git-svn.perl
+++ b/git-svn.perl
$editor->{git_commit_ok};
}
-sub gs_fetch_loop_common {
- my ($self, $base, $head, $gsv, $globs) = @_;
- return if ($base > $head);
- my $inc = $_log_window_size;
- my ($min, $max) = ($base, $head < $base + $inc ? $head : $base + $inc);
+sub longest_common_path {
+ my ($gsv, $globs) = @_;
my %common;
my $common_max = scalar @$gsv;
last;
}
}
+ $longest_path;
+}
+
+sub gs_fetch_loop_common {
+ my ($self, $base, $head, $gsv, $globs) = @_;
+ return if ($base > $head);
+ my $inc = $_log_window_size;
+ my ($min, $max) = ($base, $head < $base + $inc ? $head : $base + $inc);
+ my $longest_path = longest_common_path($gsv, $globs);
while (1) {
my %revs;
my $err;