From: Eric S. Raymond <esr@thyrsus.com>
Date: Tue, 2 Sep 2003 00:14:39 +0000 (+0000)
Subject: This appears to do reduction correctly.
X-Git-Tag: 1.0~85
X-Git-Url: http://thyrsus.com/gitweb/?a=commitdiff_plain;h=0290b5dfb3b3cb605ee06f23b23761610e7375c5;p=comparator.git

This appears to do reduction correctly.
---

diff --git a/report.c b/report.c
index 6bfe2b1..5897509 100644
--- a/report.c
+++ b/report.c
@@ -11,8 +11,6 @@
 #define min(x, y)	((x < y) ? (x) : (y)) 
 #define max(x, y)	((x > y) ? (x) : (y)) 
 
-#define DEBUG
-
 static int local_duplicates;
 
 struct item
@@ -228,7 +226,6 @@ static int merge_ranges(struct range_t *p, struct range_t *q, int nmatches)
 /* merge t into s, if the ranges in the match are compatible */
 {
     int	i;
-    return 0;
     /*
      * The general problem: you have two lists of shreds, of the same
      * lengths.  Within each list, all shreds have the same hash.
@@ -383,8 +380,6 @@ struct match_t *reduce_matches(int localdups)
 #endif /* DEBUG */
 		 free(tp->matches);
 		 tp->matches = NULL;
-		 /* if this garbages *tp the loop may fail */ 
-		 free(tp);
 		 /* list is altered, do another merge pass */
 	         retry = 1;
 	     }