# HG changeset patch
# User Bruno Haible <bruno@clisp.org>
# Date 1166731749 0
# Node ID 6c5a4b5959bb3fcbf2f39de1e4175599aecb0990
# Parent  ef05b5eb2c12042a9de957bc6563205c400ed74c
Actually use the EQUAL macro.

diff -r ef05b5eb2c12 -r 6c5a4b5959bb lib/diffseq.h
--- a/lib/diffseq.h	Mon Dec 18 13:23:40 2006 +0000
+++ b/lib/diffseq.h	Thu Dec 21 20:09:09 2006 +0000
@@ -191,7 +191,7 @@
 	    x = thi;
 	  oldx = x;
 	  y = x - d;
-	  while (x < xlim && y < ylim && xv[x] == yv[y])
+	  while (x < xlim && y < ylim && EQUAL (xv[x], yv[y]))
 	    {
 	      ++x;
 	      ++y;
@@ -231,7 +231,7 @@
 	    x = thi - 1;
 	  oldx = x;
 	  y = x - d;
-	  while (x > xoff && y > yoff && xv[x - 1] == yv[y - 1])
+	  while (x > xoff && y > yoff && EQUAL (xv[x - 1], yv[y - 1]))
 	    {
 	      --x;
 	      --y;
@@ -282,7 +282,7 @@
 			 that it end with a significant snake.  */
 		      int k;
 
-		      for (k = 1; xv[x - k] == yv[y - k]; k++)
+		      for (k = 1; EQUAL (xv[x - k], yv[y - k]); k++)
 			if (k == SNAKE_LIMIT)
 			  {
 			    best = v;
@@ -318,7 +318,7 @@
 			 that it end with a significant snake.  */
 		      int k;
 
-		      for (k = 0; xv[x + k] == yv[y + k]; k++)
+		      for (k = 0; EQUAL (xv[x + k], yv[y + k]); k++)
 			if (k == SNAKE_LIMIT - 1)
 			  {
 			    best = v;
@@ -431,13 +431,13 @@
   const ELEMENT *const yv = ctxt->yvec;
 
   /* Slide down the bottom initial diagonal. */
-  while (xoff < xlim && yoff < ylim && xv[xoff] == yv[yoff])
+  while (xoff < xlim && yoff < ylim && EQUAL (xv[xoff], yv[yoff]))
     {
       ++xoff;
       ++yoff;
     }
   /* Slide up the top initial diagonal. */
-  while (xlim > xoff && ylim > yoff && xv[xlim - 1] == yv[ylim - 1])
+  while (xlim > xoff && ylim > yoff && EQUAL (xv[xlim - 1], yv[ylim - 1]))
     {
       --xlim;
       --ylim;