12 #ifndef ZYPP_SAT_SOLVABLESET_H
13 #define ZYPP_SAT_SOLVABLESET_H
52 template<
class TInputIterator>
60 {
return _pimpl->empty(); }
69 {
return(
get().count(
asSolvable()( solv_r ) ) ); }
73 {
return _pimpl->begin(); }
92 template<
class TIterator>
93 void insert( TIterator begin_r, TIterator end_r )
120 #endif // ZYPP_SAT_SOLVABLESET_H
bool contains(const TSolv &solv_r) const
SolvableSet()
Default ctor.
std::ostream & operator<<(std::ostream &str, const FileConflicts &obj)
RWCOW_pointer< Container > _pimpl
Pointer to implementation.
#define for_(IT, BEG, END)
Convenient for-loops using iterator.
const_iterator begin() const
Iterator pointing to the first Solvable.
size_type size() const
Size of the set.
const_iterator end() const
Iterator pointing behind the last Solvable.
Base class providing common iterator types based on a Solvable iterator.
std::unordered_set< Solvable >::const_iterator Solvable_iterator
Container::value_type value_type
bool empty() const
Whether the set is epmty.
std::unordered_set< Solvable > Container
Solvable_iterator const_iterator
void insert(TIterator begin_r, TIterator end_r)
Insert a range of Solvables.
void clear()
Clear the container.
Container::size_type size_type
To Solvable transform functor.
friend std::ostream & operator<<(std::ostream &str, const SolvableSet &obj)
SolvableSet(TInputIterator begin_r, TInputIterator end_r)
Ctor building a set from a range.
bool insert(const TSolv &solv_r)
Insert a Solvable.
Solvable set wrapper to allow adding additional convenience iterators.