pathman: fix operations with ranges (by Alexander Korotkov)

zilder · zilder · commit 2aaae1ebb412 · 2016-03-10T15:42:46.000+03:00
diff --git a/contrib/pg_pathman/rangeset.c b/contrib/pg_pathman/rangeset.c
@@ -13,15 +13,15 @@
 bool
 irange_intersects(IndexRange a, IndexRange b)
 {
-	return (irange_lower(a) <= irange_upper(b)) ||
+	return (irange_lower(a) <= irange_upper(b)) &&
 		   (irange_lower(b) <= irange_upper(a));
 }
 
 /* Check if two ranges are conjuncted */
 bool
 irange_conjuncted(IndexRange a, IndexRange b)
 {
-	return (irange_lower(a) - 1 <= irange_upper(b)) ||
+	return (irange_lower(a) - 1 <= irange_upper(b)) &&
 		   (irange_lower(b) - 1 <= irange_upper(a));
 }
 
@@ -44,6 +44,27 @@ irange_intersect(IndexRange a, IndexRange b)
 					   irange_is_lossy(a) || irange_is_lossy(b));
 }
 
+#ifdef NOT_USED
+/* Print range list in debug purposes */
+static char *
+print_irange(List *l)
+{
+	ListCell   *c;
+	StringInfoData str;
+
+	initStringInfo(&str);
+
+	foreach (c, l)
+	{
+		IndexRange ir = lfirst_irange(c);
+
+		appendStringInfo(&str, "[%d,%d]%c ", irange_lower(ir), irange_upper(ir),
+			irange_is_lossy(ir) ? 'l' : 'e');
+	}
+	return str.data;
+}
+#endif
+
 /*
  * Make union of two index rage lists.
  */
