some_edits.txt

text/plain

Filename: some_edits.txt
Type: text/plain
Part: 0
Message: Re: [PoC] Reducing planning time when tables have many partitions
diff --git a/src/include/nodes/pathnodes.h b/src/include/nodes/pathnodes.h
index a09a00a7456..056911b2165 100644
--- a/src/include/nodes/pathnodes.h
+++ b/src/include/nodes/pathnodes.h
@@ -1449,9 +1449,9 @@ typedef struct EquivalenceClass
 
 	List	   *ec_opfamilies;	/* btree operator family OIDs */
 	Oid			ec_collation;	/* collation, if datatypes are collatable */
-	int			ec_childmembers_size;	/* # elements in ec_childmembers */
 	List	   *ec_members;		/* list of EquivalenceMembers */
 	List	  **ec_childmembers;	/* array of Lists of child members */
+	int			ec_childmembers_size;	/* # elements in ec_childmembers */
 	List	   *ec_sources;		/* list of generating RestrictInfos */
 	List	   *ec_derives_list;	/* list of derived RestrictInfos */
 	struct derives_hash *ec_derives_hash;	/* optional hash table for fast
@@ -1549,8 +1549,9 @@ typedef struct EquivalenceMember
  * always want to ensure the returned member matches their search criteria
  * rather than relying on the filtering to be done for them as all parent
  * members are returned and for members belonging to RELOPT_OTHER_JOINREL
- * rels, the member's em_relids may be a superset of the specified
- * 'child_relids'.
+ * rels, the member's em_relids will contain one of the relids specified in
+ * 'child_relids', but it may not match the exact criteria the caller is looking
+ * for.
  *
  * The most common way to use this iterator is as follows:
  * -----