mirror of
https://github.com/postgres/postgres.git
synced 2025-11-21 00:42:43 +03:00
Fix many typos and inconsistencies
Author: Alexander Lakhin Discussion: https://postgr.es/m/af27d1b3-a128-9d62-46e0-88f424397f44@gmail.com
This commit is contained in:
@@ -929,11 +929,10 @@ generate_base_implied_equalities_no_const(PlannerInfo *root,
|
||||
/*
|
||||
* We scan the EC members once and track the last-seen member for each
|
||||
* base relation. When we see another member of the same base relation,
|
||||
* we generate "prev_mem = cur_mem". This results in the minimum number
|
||||
* of derived clauses, but it's possible that it will fail when a
|
||||
* different ordering would succeed. XXX FIXME: use a UNION-FIND
|
||||
* algorithm similar to the way we build merged ECs. (Use a list-of-lists
|
||||
* for each rel.)
|
||||
* we generate "prev_em = cur_em". This results in the minimum number of
|
||||
* derived clauses, but it's possible that it will fail when a different
|
||||
* ordering would succeed. XXX FIXME: use a UNION-FIND algorithm similar
|
||||
* to the way we build merged ECs. (Use a list-of-lists for each rel.)
|
||||
*/
|
||||
prev_ems = (EquivalenceMember **)
|
||||
palloc0(root->simple_rel_array_size * sizeof(EquivalenceMember *));
|
||||
|
||||
Reference in New Issue
Block a user