Tom Lane 9a586fe0c5 Nab some low-hanging fruit: replace the planner's base_rel_list and ... other_rel_list with a single array indexed by rangetable index. This reduces find_base_rel from O(N) to O(1) without any real penalty. While find_base_rel isn't one of the major bottlenecks in any profile I've seen so far, it was starting to creep up on the radar screen for complex queries --- so might as well fix it.		2005-06-06 04:13:36 +00:00
..
bitmapset.h	Some more missed copyright notices. Many of these look like they	2005-01-01 20:44:34 +00:00
execnodes.h	Minor refactoring to eliminate duplicate code and make startup a	2005-05-14 21:29:23 +00:00
makefuncs.h	Merge Resdom nodes into TargetEntry nodes to simplify code and save a	2005-04-06 16:34:07 +00:00
memnodes.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
nodeFuncs.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
nodes.h	Remove planner's private fields from Query struct, and put them into	2005-06-05 22:32:58 +00:00
params.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
parsenodes.h	Remove planner's private fields from Query struct, and put them into	2005-06-05 22:32:58 +00:00
pg_list.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
plannodes.h	Remove support for OR'd indexscans internal to a single IndexScan plan	2005-04-25 01:30:14 +00:00
primnodes.h	Merge Resdom nodes into TargetEntry nodes to simplify code and save a	2005-04-06 16:34:07 +00:00
print.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
readfuncs.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
relation.h	Nab some low-hanging fruit: replace the planner's base_rel_list and	2005-06-06 04:13:36 +00:00
tidbitmap.h	Initial implementation of lossy-tuple-bitmap data structures.	2005-04-17 22:24:02 +00:00
value.h	Some more missed copyright notices. Many of these look like they	2005-01-01 20:44:34 +00:00