.

wcfs/internal/xbtree/blib/rangemap.go.in

@@ -121,7 +121,7 @@ func (M *RangedMap) SetRange(r KeyRange, v VALUE) {
 
 	// clear range for r and insert new entry
 	// TODO optimize for same-value/set case (just merge all covered
-	// entries into one - - see commented AddRange from set vvv)
+	// entries into one - see commented AddRange from set vvv)
 	i := M.delRange(r)
 	vInsert(&M.entryv, i, e)
 	debugfRMap("\tinsert %s\t-> %s\n", e, M)
@@ -277,8 +277,6 @@ func (M *RangedMap) delRange(r KeyRange) (i int) {
 		return 0
 	}
 
-	// XXX if jhi - ilo == 0 { return "non-overlap" } ?
-
 	// [ilo+1:jhi-1] should be deleted
 	// [ilo] and [jhi-1] overlap with [r.lo,r.hi) - they should be deleted, or shrinked,
 	// or split+shrinked if ilo==jhi-1 and r is inside [ilo]

wcfs/internal/xbtree/blib/zrangemap_str.go

@@ -123,7 +123,7 @@ func (M *_RangedMap_str) SetRange(r KeyRange, v string) {
 
 	// clear range for r and insert new entry
 	// TODO optimize for same-value/set case (just merge all covered
-	// entries into one - - see commented AddRange from set vvv)
+	// entries into one - see commented AddRange from set vvv)
 	i := M.delRange(r)
 	vInsert__RangedMap_str(&M.entryv, i, e)
 	debugf_RangedMap_str("\tinsert %s\t-> %s\n", e, M)
@@ -279,8 +279,6 @@ func (M *_RangedMap_str) delRange(r KeyRange) (i int) {
 		return 0
 	}
 
-	// XXX if jhi - ilo == 0 { return "non-overlap" } ?
-
 	// [ilo+1:jhi-1] should be deleted
 	// [ilo] and [jhi-1] overlap with [r.lo,r.hi) - they should be deleted, or shrinked,
 	// or split+shrinked if ilo==jhi-1 and r is inside [ilo]

wcfs/internal/xbtree/blib/zrangemap_void.go

@@ -123,7 +123,7 @@ func (M *_RangedMap_void) SetRange(r KeyRange, v void) {
 
 	// clear range for r and insert new entry
 	// TODO optimize for same-value/set case (just merge all covered
-	// entries into one - - see commented AddRange from set vvv)
+	// entries into one - see commented AddRange from set vvv)
 	i := M.delRange(r)
 	vInsert__RangedMap_void(&M.entryv, i, e)
 	debugf_RangedMap_void("\tinsert %s\t-> %s\n", e, M)
@@ -279,8 +279,6 @@ func (M *_RangedMap_void) delRange(r KeyRange) (i int) {
 		return 0
 	}
 
-	// XXX if jhi - ilo == 0 { return "non-overlap" } ?
-
 	// [ilo+1:jhi-1] should be deleted
 	// [ilo] and [jhi-1] overlap with [r.lo,r.hi) - they should be deleted, or shrinked,
 	// or split+shrinked if ilo==jhi-1 and r is inside [ilo]