.

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

@@ -287,6 +287,7 @@ func (M *RangedMap) HasRange(r KeyRange) (yes bool) {
 	}
 
 
+	// scan right and verify that whole r is covered
 	lo := r.Lo
 	for {
 		e := M.entryv[ilo]
@@ -296,7 +297,7 @@ func (M *RangedMap) HasRange(r KeyRange) (yes bool) {
 			return false // hole in coverage
 		}
 		if r.Hi_ <= e.Hi_ {
-			return true  // full coverage
+			return true  // reached full coverage
 		}
 
 		lo = e.Hi_
@@ -309,10 +310,6 @@ func (M *RangedMap) HasRange(r KeyRange) (yes bool) {
 			return false // r's right not fully covered
 		}
 	}
-
-
-//	// all keys from r are in M if r ∈ [ilo]	XXX not in case of different values
-//	return (M.entryv[ilo].Lo <= r.Lo && r.Hi_ <= M.entryv[ilo].Hi_)
 }