22#include <solv/solver.h> 
   25#define ZYPP_USE_RESOLVER_INTERNALS 
   50    os << 
"[" << (
_soft?
"Soft":
"") << 
"Lock: " <<
 
 
   75    ::Id 
id = 
_item.satSolvable().id();
 
   77        ERR << 
"Lock : " << 
_item << 
" not found" << endl;
 
   80    MIL << 
"Lock " << 
_item << 
" with the SAT-Pool ID: " << 
id << endl;
 
   81    if (
_item.status().isInstalled()) {
 
   83            queue_push( &(q), SOLVER_INSTALL | SOLVER_SOLVABLE | SOLVER_WEAK );
 
   85            queue_push( &(q), SOLVER_INSTALL | SOLVER_SOLVABLE );
 
   89            queue_push( &(q), SOLVER_ERASE | SOLVER_SOLVABLE | SOLVER_WEAK );
 
   91            queue_push( &(q), SOLVER_ERASE | SOLVER_SOLVABLE );
 
   94    queue_push( &(q), 
id );
 
 
  102    new_lock->SolverQueueItem::copy(
this);
 
  104    new_lock->_soft = 
_soft;
 
 
  111    int cmp = this->compare (item);
 
  114    SolverQueueItemLock_constPtr lock = dynamic_pointer_cast<const SolverQueueItemLock>(item);
 
 
Combining sat::Solvable and ResStatus.
int compareByNVRA(const Resolvable::constPtr &lhs, const Resolvable::constPtr &rhs)
Compare Resolvable::constPtr according to kind, name, edition and arch.
virtual ~SolverQueueItemLock()
virtual SolverQueueItem_Ptr copy(void) const
virtual bool addRule(sat::detail::CQueue &q)
virtual int cmp(SolverQueueItem_constPtr item) const
virtual std::ostream & dumpOn(std::ostream &str) const
SolverQueueItemLock(const ResPool &pool, const PoolItem &item, bool soft=false)
::s_Queue CQueue
Wrapped libsolv C data type exposed as backdoor.
Easy-to use interface to the ZYPP dependency resolver.
#define IMPL_PTR_TYPE(NAME)