|
7 | 7 | * |
8 | 8 | * |
9 | 9 | * IDENTIFICATION |
10 | | - * $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.29 1999/02/11 17:03:17 momjian Exp $ |
| 10 | + * $Header: /cvsroot/pgsql/src/backend/optimizer/util/pathnode.c,v 1.30 1999/02/11 17:21:51 momjian Exp $ |
11 | 11 | * |
12 | 12 | *------------------------------------------------------------------------- |
13 | 13 | */ |
@@ -198,27 +198,27 @@ better_path(Path *new_path, List *unique_paths, bool *is_new) |
198 | 198 | * over unsorted keys in the same way. |
199 | 199 | */ |
200 | 200 | /* same keys, and new is cheaper, use it */ |
201 | | -if (((better_key==0&&better_sort==0&& |
| 201 | +if ((better_key==0&&better_sort==0&& |
202 | 202 | new_path->path_cost<path->path_cost)|| |
203 | 203 |
|
204 | 204 | /* new is better, and cheaper, use it */ |
205 | | -((better_key==1&&better_sort!=2)|| |
206 | | - (better_key!=2&&better_sort==1)))&& |
207 | | -new_path->path_cost <=path->path_cost) |
| 205 | +(((better_key==1&&better_sort!=2)|| |
| 206 | +(better_key!=2&&better_sort==1))&& |
| 207 | +new_path->path_cost <=path->path_cost)) |
208 | 208 | { |
209 | 209 | *is_new= false; |
210 | 210 | returnnew_path; |
211 | 211 | } |
212 | 212 |
|
213 | 213 | /* same keys, new is more expensive, stop */ |
214 | 214 | elseif |
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)|| |
217 | 217 |
|
218 | 218 | /* old is better, and less expensive, stop */ |
219 | | -((better_key==2&&better_sort!=1)|| |
220 | | - (better_key!=1&&better_sort==2)))&& |
221 | | -new_path->path_cost >=path->path_cost) |
| 219 | +(((better_key==2&&better_sort!=1)|| |
| 220 | +(better_key!=1&&better_sort==2))&& |
| 221 | +new_path->path_cost >=path->path_cost)) |
222 | 222 | { |
223 | 223 | *is_new= false; |
224 | 224 | returnNULL; |
|