.

wcfs/internal/xbtree/rangeset.go

@@ -170,7 +170,7 @@ func (S *RangeSet) DelRange(r Range) {
 	debugfRSet("\tilo: %d\n", ilo)
 
 	if ilo == l { // not found
-		debugfRSet("\tnon-overlap right")
+		debugfRSet("\tnon-overlap right\n")
 		return
 	}
 
@@ -188,7 +188,7 @@ func (S *RangeSet) DelRange(r Range) {
 	debugfRSet("\tjhi: %d\n", jhi)
 
 	if jhi == 0 {
-		debugfRSet("\tnon-overlap left")
+		debugfRSet("\tnon-overlap left\n")
 		return
 	}
 
@@ -211,7 +211,7 @@ func (S *RangeSet) DelRange(r Range) {
 		debugfRSet("\tshrink right\t-> %s\n", S)
 	}
 
-	if (jhi - ilo) > 1 {
+	if (jhi - ilo) > 0 {
 		S.rangev = append(
 			S.rangev[:ilo],
 			S.rangev[jhi:]...)

wcfs/internal/xbtree/rangeset_test.go

@@ -109,12 +109,12 @@ func TestRangeSet(t *testing.T) {
 	}
 
 	for _, tt := range testv {
-		U := tt.A.Union(tt.B)
+//		U := tt.A.Union(tt.B)
 		D := tt.A.Difference(tt.B)
 
-		if !U.Equal(tt.Union) {
-			t.Errorf("Union:\n  A:   %s\n  B:   %s\n  ->u: %s\n  okU: %s\n", tt.A, tt.B, U, tt.Union)
-		}
+//		if !U.Equal(tt.Union) {
+//			t.Errorf("Union:\n  A:   %s\n  B:   %s\n  ->u: %s\n  okU: %s\n", tt.A, tt.B, U, tt.Union)
+//		}
 		if !D.Equal(tt.Difference) {
 			t.Errorf("Difference:\n  A:   %s\n  B:   %s\n  ->d: %s\n  okD: %s\n", tt.A, tt.B, D, tt.Difference)
 		}