Tom Lane 5b05185262 Remove support for OR'd indexscans internal to a single IndexScan plan ... node, as this behavior is now better done as a bitmap OR indexscan. This allows considerable simplification in nodeIndexscan.c itself as well as several planner modules concerned with indexscan plan generation. Also we can improve the sharing of code between regular and bitmap indexscans, since they are now working with nigh-identical Plan nodes.		2005-04-25 01:30:14 +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	Remove support for OR'd indexscans internal to a single IndexScan plan	2005-04-25 01:30:14 +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	Rethink original decision to use AND/OR Expr nodes to represent bitmap	2005-04-21 19:18:13 +00:00
params.h	Tag appropriate files for rc3	2004-12-31 22:04:05 +00:00
parsenodes.h	Add a "USING" clause to DELETE, which is equivalent to the FROM clause	2005-04-07 01:51:41 +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	Remove support for OR'd indexscans internal to a single IndexScan plan	2005-04-25 01:30:14 +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