本文整理汇总了C++中QueryData::getQEvalClause方法的典型用法代码示例。如果您正苦于以下问题：C++ QueryData::getQEvalClause方法的具体用法？C++ QueryData::getQEvalClause怎么用？C++ QueryData::getQEvalClause使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类QueryData的用法示例。
在下文中一共展示了QueryData::getQEvalClause方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: appendEdgeQueryInstruc
void QEvalInstrucGenerator::appendEdgeQueryInstruc(std::queue<QEvalInstruc>& instrucQueue, const QueryData &qData, std::vector<bool> &qtClausePushed)
{
if (!qData.getQueryTarget().isBool()) {
appendEdgeQueryOnePath(instrucQueue, qData, qData.getQueryTarget().getTarArgIdx(), qtClausePushed);
}
arg_idx_t target;
bool finded = false;
for (int i = 0; i < (int)qtClausePushed.size(); i++) {
if (!qtClausePushed[i]) {
target = *(qData.getQEvalClause(i)->inVarArgIdxSet.begin());
finded = true;
}
}
while (finded) {
appendEdgeQueryOnePath(instrucQueue, qData, target, qtClausePushed);
finded = false;
for (int i = 0; i < (int)qtClausePushed.size(); i++) {
if (!qtClausePushed[i]) {
target = *(qData.getQEvalClause(i)->inVarArgIdxSet.begin());
finded = true;
}
}
}
}示例2: appendEdgeQueryOnePath
void QEvalInstrucGenerator::appendEdgeQueryOnePath(std::queue<QEvalInstruc> &instrucQueue, const QueryData &qData, arg_idx_t argIdx, std::vector<bool> &qtClausePushed)
{
std::stack<q_clause_idx_t> qClauseStack;
std::stack<arg_idx_t> targetVarArgIdxStack;
NonRepQueue<arg_idx_t> holdVarArgIdxQueue;
holdVarArgIdxQueue.push(argIdx);
while (!holdVarArgIdxQueue.empty()) {
arg_idx_t current = holdVarArgIdxQueue.front();
for (q_clause_idx_t i = 0; i < (int)qData.numClauses(); i++) {
if (!qtClausePushed[i]) {
const QEvalClause * clausePtr = qData.getQEvalClause(i);
const std::set<arg_idx_t> &refVarArgIdxSet = clausePtr->inVarArgIdxSet;
assert (refVarArgIdxSet.size() == 2);
if (*(refVarArgIdxSet.begin()) == current) {
holdVarArgIdxQueue.push(*(refVarArgIdxSet.end()));
}
else {
holdVarArgIdxQueue.push(*(refVarArgIdxSet.begin()));
}
qClauseStack.push(i);
targetVarArgIdxStack.push(current);
qtClausePushed[i] = true;
}
}
holdVarArgIdxQueue.pop();
}
while (!qClauseStack.empty()) {
instrucQueue.push(QEvalInstruc(qClauseStack.top(), targetVarArgIdxStack.top()));
qClauseStack.pop();
targetVarArgIdxStack.pop();
}
}示例3: appendIndepQueryInstruc
void QEvalInstrucGenerator::appendIndepQueryInstruc(std::queue<QEvalInstruc> &instrucQueue, const QueryData &qData, std::vector<bool> &qClausePushed)
{
for (q_clause_idx_t i = 0; i < (int)qData.numClauses(); i++) {
const QEvalClause * clausePtr = qData.getQEvalClause(i);
if (clausePtr->inVarArgIdxSet.size() == 0) {
instrucQueue.push(QEvalInstruc(i, 0));
qClausePushed[i] = true;
}
}
}