77 *
88 *
99 * IDENTIFICATION
10- * $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.28 1999/02/11 17:00:49 momjian Exp $
10+ * $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.29 1999/02/11 17:03:17 momjian Exp $
1111 *
1212 *-------------------------------------------------------------------------
1313 */
@@ -198,12 +198,12 @@ better_path(Path *new_path, List *unique_paths, bool *is_new)
198198 * over unsorted keys in the same way.
199199 */
200200/* same keys, and new is cheaper, use it */
201- if ((better_key == 0 && better_sort == 0 &&
202- new_path -> path_cost < path -> path_cost )||
201+ if ((( better_key == 0 && better_sort == 0 &&
202+ new_path -> path_cost < path -> path_cost )||
203203
204204/* new is better, and cheaper, use it */
205205((better_key == 1 && better_sort != 2 )||
206- (better_key != 2 && better_sort == 1 ))&&
206+ (better_key != 2 && better_sort == 1 ))) &&
207207new_path -> path_cost <=path -> path_cost )
208208{
209209* is_new = false;
@@ -212,12 +212,12 @@ better_path(Path *new_path, List *unique_paths, bool *is_new)
212212
213213/* same keys, new is more expensive, stop */
214214else if
215- ((better_key == 0 && better_sort == 0 &&
216- new_path -> path_cost >=path -> path_cost )||
215+ ((( better_key == 0 && better_sort == 0 &&
216+ new_path -> path_cost >=path -> path_cost )||
217217
218218/* old is better, and less expensive, stop */
219219((better_key == 2 && better_sort != 1 )||
220- (better_key != 1 && better_sort == 2 ))&&
220+ (better_key != 1 && better_sort == 2 ))) &&
221221new_path -> path_cost >=path -> path_cost )
222222{
223223* is_new = false;