README

 SNAPHU
 Statistical-Cost, Netowrk-Flow Algorithm for Phase Unwrapping
 Author: Curtis W. Chen
-Version 2.0.2, October 2019
+Version 2.0.3, November 2019
 
 
 Contents

README_releasenotes.txt

+Notable changes in v2.0.3 since v2.0.2:
+---------------------------------------
+
+* Fixed limit-checking error that would sometimes cause segmentation fault when
+  width of masked area was only one pixel at right or bottom edges.
+  
+
 Notable changes in v2.0.2 since v2.0.1:
 ---------------------------------------
 

debian/changelog

+snaphu (2.0.3-1) UNRELEASED; urgency=medium
+
+  * New upstream release.
+  * debian/patches:
+    - refresh all patches
+
+ -- Antonio Valentino <antonio.valentino@tiscali.it>  Mon, 11 Nov 2019 07:06:55 +0000
+
 snaphu (2.0.2-1) unstable; urgency=medium
 
   * New upstream release.

debian/patches/0002-Spelling.patch

@@ -21,7 +21,7 @@ index 161cc25..a4ed3c9 100644
  preceding one, although round-off errors in flow-to-phase conversions
  may cause minor differences
 diff --git a/src/snaphu.h b/src/snaphu.h
-index b4cdc3e..7c33fc0 100644
+index 1659aa1..db35619 100644
 --- a/src/snaphu.h
 +++ b/src/snaphu.h
 @@ -407,7 +407,7 @@

src/snaphu.h

@@ -14,7 +14,7 @@
 /**********************/
 
 #define PROGRAMNAME          "snaphu"
-#define VERSION              "2.0.2"
+#define VERSION              "2.0.3"
 #define BUGREPORTEMAIL       "snaphu@gmail.com"
 #ifdef PI
 #undef PI

src/snaphu_solver.c

@@ -2095,7 +2095,7 @@ void GetArcGrid(nodeT *from, nodeT *to, long *arcrow, long *arccol,
     *arccol=fromcol;
     *arcdir=-1;
   }else if(fromrow==BOUNDARYROW){ /* arc from boundary pointer */  
-    if(tocol<ncol-1 && nodes[torow][tocol+1].group==BOUNDARYPTR){
+    if(tocol<ncol-2 && nodes[torow][tocol+1].group==BOUNDARYPTR){
       *arcrow=torow;
       *arccol=tocol+1;
       *arcdir=-1;
@@ -2103,7 +2103,7 @@ void GetArcGrid(nodeT *from, nodeT *to, long *arcrow, long *arccol,
       *arcrow=torow;
       *arccol=tocol;
       *arcdir=1;
-    }else if(torow<nrow-1 && nodes[torow+1][tocol].group==BOUNDARYPTR){
+    }else if(torow<nrow-2 && nodes[torow+1][tocol].group==BOUNDARYPTR){
       *arcrow=torow+1+nrow-1;
       *arccol=tocol;
       *arcdir=-1;
@@ -2113,7 +2113,7 @@ void GetArcGrid(nodeT *from, nodeT *to, long *arcrow, long *arccol,
       *arcdir=1;
     }
   }else if(torow==BOUNDARYROW){   /* arc to boundary pointer */
-    if(fromcol<ncol-1 && nodes[fromrow][fromcol+1].group==BOUNDARYPTR){
+    if(fromcol<ncol-2 && nodes[fromrow][fromcol+1].group==BOUNDARYPTR){
       *arcrow=fromrow;
       *arccol=fromcol+1;
       *arcdir=1;
@@ -2121,7 +2121,7 @@ void GetArcGrid(nodeT *from, nodeT *to, long *arcrow, long *arccol,
       *arcrow=fromrow;
       *arccol=fromcol;
       *arcdir=-1;
-    }else if(fromrow<nrow-1 && nodes[fromrow+1][fromcol].group==BOUNDARYPTR){
+    }else if(fromrow<nrow-2 && nodes[fromrow+1][fromcol].group==BOUNDARYPTR){
       *arcrow=fromrow+1+nrow-1;
       *arccol=fromcol;
       *arcdir=1;