本文整理汇总了C++中Enode::isCostIncur方法的典型用法代码示例。如果您正苦于以下问题：C++ Enode::isCostIncur方法的具体用法？C++ Enode::isCostIncur怎么用？C++ Enode::isCostIncur使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Enode的用法示例。
在下文中一共展示了Enode::isCostIncur方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: check_status
void CostSolver::check_status()
{
#ifndef NDEBUG
for ( costfuns_t::iterator it = costfuns_.begin();
it != costfuns_.end();
++it )
{
costfun & fun = **it;
codomain slack = 0;
for ( incurnode * n=fun.unassigned.head; n; n=n->next )
{
assert( !n->atom->hasPolarity() );
if ( n->next )
{
assert( n != n->next );
if ( n->cost > n->next->cost )
{
cout << n->cost << " > " << n->next->cost << endl;
}
assert( n->cost <= n->next->cost );
assert( n->next->prev == n );
}
if ( n->prev )
{
assert( n->prev != n );
assert( n->prev->next == n );
}
slack += get_incurred( n->atom );
}
assert( slack == fun.slack );
{
codomain incurred = 0;
for ( costfun::nodes_t::iterator it = fun.assigned.begin();
it != fun.assigned.end();
++it )
{
incurnode * node = *it;
assert( node->atom->hasPolarity() );
if ( node->atom->getPolarity() == l_True )
{
incurred += get_incurred( node->atom );
}
}
if ( fun.incurred != incurred )
{
if ( conflict_ )
{
cout << "conflict = " << conflict_ << endl;
}
cout << "incurred = " << incurred << endl;
print_status( cout, fun );
}
assert( fun.incurred == incurred );
}
}
if ( conflict_ )
{
cout << "ct conflict " << conflict_ << endl;
costfun & fun = *nodemap_.find( conflict_ )->second;
codomain incurred = 0;
Enode * upper_bound = 0;
Enode * lower_bound = 0;
for ( vector<Enode*>::iterator it = explanation.begin();
it != explanation.end();
++it )
{
Enode * atom = *it;
assert( atom->hasPolarity() );
if ( atom->isCostIncur() )
{
if ( atom->getPolarity() == l_True )
{
incurred += get_incurred( atom );
}
}
if ( atom->isCostBound() )
{
if ( atom->getPolarity() == l_True )
{
assert( !upper_bound );
upper_bound = atom;
}
else
{
assert( !lower_bound );
assert( atom->getPolarity() == l_False );
lower_bound = atom;
}
}
}
if ( !fun.lowerbound.empty() && fun.upperbound.empty() )
{
assert( fun.incurred + fun.slack < get_bound( fun.lowerbound.top() ) );
}
if ( fun.lowerbound.empty() && !fun.upperbound.empty() )
{
assert( fun.incurred >= get_bound( fun.upperbound.top() ) );
assert( incurred >= get_bound( upper_bound ) );
}
}
//.........这里部分代码省略.........
示例2: assertLitImpl
bool CostSolver::assertLitImpl( Enode * e )
{
assert( e );
assert( belongsToT( e ) );
assert( e->hasPolarity() );
assert( e->getPolarity() != l_Undef );
#if DEBUG
cout << "ct assert " << (e->getPolarity() == l_True ? "" : "!") << e << endl;
#endif
assert( !conflict_ );
Enode * atom = e;
const bool negated = e->getPolarity() == l_False;
if ( atom->isCostIncur() )
{
assert( nodemap_[ atom ] );
costfun & fun = *nodemap_[ atom ];
#if DEBUG
print_status( cout, fun );
#endif
incurnode * node = incurmap_[ atom ];
if ( node->prev )
{
node->prev->next = node->next;
assert( node->prev->cost <= node->cost );
}
if ( node->next )
{
node->next->prev = node->prev;
assert( node->cost <= node->next->cost );
}
else
{
fun.unassigned.last = node->prev;
}
if ( fun.unassigned.head == node )
{
fun.unassigned.head = node->next;
}
fun.slack -= node->cost;
fun.assigned.push_back( node );
if ( negated )
{
undo_ops_.push( undo_op( REMOVE_INCUR_NEG, node ) );
if ( !fun.lowerbound.empty() &&
get_bound( fun.lowerbound.top() ) > fun.incurred + fun.slack )
{
assert( explanation.empty() );
conflict_ = atom;
codomain potential = fun.incurred + fun.slack;
for ( costfun::nodes_t::iterator it = fun.assigned.begin();
it != fun.assigned.end();
++it )
{
incurnode * node = *it;
#if ELIM_REDUNDANT
if ( node->atom->getPolarity() != l_False )
{
continue;
}
if ( potential + node->cost < get_bound( fun.lowerbound.top() ) )
{
potential += node->cost;
continue;
}
#endif
if ( node->atom->getPolarity() == l_False )
{
explanation.push_back( node->atom );
}
}
assert( potential < get_bound( fun.lowerbound.top() ) );
assert( find( explanation.begin(), explanation.end(), conflict_ ) != explanation.end() );
explanation.push_back( fun.lowerbound.top() );
#if DEBUG_CONFLICT
cout << " " << explanation << " : " << fun.slack << endl;
print_status( cout, fun ); cout << endl;
#endif
#if DEBUG
cout << "conflict found " << conflict_ << endl;
print_status( cout, fun );
#endif
#if DEBUG_CHECK_STATUS
check_status();
#endif
return false;
}
}
else
{
fun.incurred += node->cost;
undo_ops_.push( undo_op( REMOVE_INCUR_POS, node ) );
if ( !fun.upperbound.empty() &&
get_bound( fun.upperbound.top() ) <= fun.incurred )
{
conflict_ = atom;
codomain incurred = fun.incurred;
for ( costfun::nodes_t::iterator it = fun.assigned.begin();
//.........这里部分代码省略.........