---------------------------------------------------------------- * ExecTidRangeScan(node) * * Scans the relation using tids and returns the next qualifying tuple. * We call the ExecScan() routine and pass it the appropriate * access method functions. * * Conditions: * -- the "cursor" maintained by the AMI is positioned at the tuple * returned previously. * * Initial States:
| 287 | * ---------------------------------------------------------------- |
| 288 | */ |
| 289 | static TupleTableSlot * |
| 290 | ExecTidRangeScan(PlanState *pstate) |
| 291 | { |
| 292 | TidRangeScanState *node = castNode(TidRangeScanState, pstate); |
| 293 | |
| 294 | return ExecScan(&node->ss, |
| 295 | (ExecScanAccessMtd) TidRangeNext, |
| 296 | (ExecScanRecheckMtd) TidRangeRecheck); |
| 297 | } |
| 298 | |
| 299 | /* ---------------------------------------------------------------- |
| 300 | * ExecReScanTidRangeScan(node) |
nothing calls this directly
no test coverage detected