50        template<
typename T> 
bool contains( 
const std::set<T> & container, T search )
 
   52            return container.find( search ) != container.end();
 
 
   68            DBG << 
"Collecting packages the user explicitly asked for" << endl;
 
 
   89                    DBG << 
"Explicit user transaction on pkg \"" << (*it)->name() << 
"\"" << endl;
 
   91                    pkgNames.insert( (*it)->name() );
 
 
  103                Patch::constPtr patch = dynamic_pointer_cast<const Patch>( (*patch_it)->theObj() ? (*patch_it)->theObj().resolvable() : 0 );
 
  105                if ( patch && (*patch_it)->toModify() )
 
  107                    DBG << 
"Patch will be transacted: \"" << patch->name()
 
  108                        << 
"\" - \"" << patch->summary() << 
"\"" << endl;
 
  113                      pkgNames.insert( it->name() );
 
 
TraitsType::constPtrType constPtr
sat::SolvableSet Contents
ResPool::instance().proxy();.
const_iterator byKindBegin(const ResKind &kind_r) const
const_iterator byKindEnd(const ResKind &kind_r) const
MapKVIteratorTraits< SelectablePool >::Value_const_iterator const_iterator
ZYpp::Ptr getZYpp()
Convenience to get the Pointer to the ZYpp instance.
const_iterator end() const
Iterator pointing behind the last Solvable.
const_iterator begin() const
Iterator pointing to the first Solvable.
set< string > userWantedPackageNames()
This returns a set of package names the user explicitly wanted to transact ( to install,...
ResPoolProxy::const_iterator PoolProxyIterator
static PoolProxyIterator pkgEnd()
PoolProxyIterator poolProxyBegin()
static PoolProxyIterator pkgBegin()
PoolProxyIterator poolProxyEnd()
static void addDirectlySelectedPackages(set< string > &pkgNames)
static PoolProxyIterator patchesBegin()
static PoolProxyIterator patchesEnd()
static ResPoolProxy poolProxy()
bool contains(const std::set< T > &container, T search)
static void addPatchPackages(set< string > &pkgNames)
void addPkgSetPackages(set< string > &pkgNames)
Easy-to use interface to the ZYPP dependency resolver.
#define for_(IT, BEG, END)
Convenient for-loops using iterator.