本文整理汇总了C++中TableTuple::isPendingDelete方法的典型用法代码示例。如果您正苦于以下问题：C++ TableTuple::isPendingDelete方法的具体用法？C++ TableTuple::isPendingDelete怎么用？C++ TableTuple::isPendingDelete使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类TableTuple的用法示例。
在下文中一共展示了TableTuple::isPendingDelete方法的4个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: deleteStreamedTuples
/**
* Clean up after consuming indexed tuples.
*/
void ElasticIndexReadContext::deleteStreamedTuples()
{
// Delete the indexed tuples that were streamed.
// Undo token release will cause the index to delete the corresponding items
// via notifications.
m_iter->reset();
TableTuple tuple;
while (m_iter->next(tuple)) {
if (!tuple.isPendingDelete()) {
m_surgeon.deleteTuple(tuple);
}
}
}示例2: deleteStreamedTuples
/**
* Clean up after consuming indexed tuples.
*/
void ElasticIndexReadContext::deleteStreamedTuples()
{
// Delete the indexed tuples that were streamed.
// Undo token release will cause the index to delete the corresponding items
// via notifications.
DRTupleStreamDisableGuard guard(ExecutorContext::getExecutorContext()->drStream(),
ExecutorContext::getExecutorContext()->drReplicatedStream());
m_iter->reset();
TableTuple tuple;
while (m_iter->next(tuple)) {
if (!tuple.isPendingDelete()) {
m_surgeon.deleteTuple(tuple);
}
}
}示例3: deleteStreamedTuples
/**
* Clean up after consuming indexed tuples.
*/
void ElasticIndexReadContext::deleteStreamedTuples()
{
// Delete the indexed tuples that were streamed.
// Undo token release will cause the index to delete the corresponding items
// via notifications.
ExecutorContext::getExecutorContext()->drStream()->m_enabled = false;
//Not unused, but GCC doesn't think a destructor counts as use
class DisableDRGuard {
public:
~DisableDRGuard() {
ExecutorContext::getExecutorContext()->drStream()->m_enabled = true;
}
} __attribute__((unused)) guard;
m_iter->reset();
TableTuple tuple;
while (m_iter->next(tuple)) {
if (!tuple.isPendingDelete()) {
m_surgeon.deleteTuple(tuple);
}
}
}示例4: p_execute
//.........这里部分代码省略.........
break;
}
}
if (tuple.isNullTuple()) {
tableIndex->moveToEnd(false, indexCursor);
}
}
}
else {
return false;
}
}
else {
bool toStartActually = (localSortDirection != SORT_DIRECTION_TYPE_DESC);
tableIndex->moveToEnd(toStartActually, indexCursor);
}
int tuple_ctr = 0;
int tuples_skipped = 0; // for offset
int limit = -1;
int offset = -1;
if (limit_node != NULL) {
limit_node->getLimitAndOffsetByReference(params, limit, offset);
}
//
// We have to different nextValue() methods for different lookup types
//
while ((limit == -1 || tuple_ctr < limit) &&
((localLookupType == INDEX_LOOKUP_TYPE_EQ &&
!(tuple = tableIndex->nextValueAtKey(indexCursor)).isNullTuple()) ||
((localLookupType != INDEX_LOOKUP_TYPE_EQ || activeNumOfSearchKeys == 0) &&
!(tuple = tableIndex->nextValue(indexCursor)).isNullTuple()))) {
if (tuple.isPendingDelete()) {
continue;
}
VOLT_TRACE("LOOPING in indexscan: tuple: '%s'\n", tuple.debug("tablename").c_str());
pmp.countdownProgress();
//
// First check to eliminate the null index rows for UNDERFLOW case only
//
if (skipNullExpr != NULL) {
if (skipNullExpr->eval(&tuple, NULL).isTrue()) {
VOLT_DEBUG("Index scan: find out null rows or columns.");
continue;
} else {
skipNullExpr = NULL;
}
}
//
// First check whether the end_expression is now false
//
if (end_expression != NULL && !end_expression->eval(&tuple, NULL).isTrue()) {
VOLT_TRACE("End Expression evaluated to false, stopping scan");
break;
}
//
// Then apply our post-predicate to do further filtering
//
if (post_expression == NULL || post_expression->eval(&tuple, NULL).isTrue()) {
//
// INLINE OFFSET
//
if (tuples_skipped < offset)
{