Base class providing common iterator types based on a Solvable iterator. More...

#include <SolvIterMixin.h>

Public Types
typedef size_t	size_type

Public Member Functions
Convenience methods.
In case `Derived` is able to provide a more efficient implementation, the methods should be overloaded.
bool	empty () const
	Whether the collection is epmty. More...

size_type	size () const
	Size of the collection. More...

template<class _Solv >
bool	contains (const _Solv &solv_r) const
	Whether collection contains a specific Solvable. More...

Protected Member Functions
	SolvIterMixin ()

	~SolvIterMixin ()

	SolvIterMixin (const SolvIterMixin &)

void	operator= (const SolvIterMixin &)

Private Types
typedef filter_iterator < solvitermixin_detail::UnifyByIdent, Solvable_iterator >	UnifiedSolvable_iterator

Private Member Functions
const Derived &	self () const

Iterate unified Solbvables to be transformed into Selectable.
UnifiedSolvable_iterator	unifiedSolvableBegin () const

UnifiedSolvable_iterator	unifiedSolvableEnd () const

Iterate as Solvable
typedef DerivedSolvable_iterator	Solvable_iterator

Solvable_iterator	solvableBegin () const

Solvable_iterator	solvableEnd () const

Iterate as PoolItem
typedef transform_iterator < asPoolItem, Solvable_iterator >	PoolItem_iterator

PoolItem_iterator	poolItemBegin () const

PoolItem_iterator	poolItemEnd () const

Iterate ui::Selectable::Ptr
typedef transform_iterator < ui::asSelectable, UnifiedSolvable_iterator >	Selectable_iterator

Selectable_iterator	selectableBegin () const

Selectable_iterator	selectableEnd () const

Detailed Description

template<class Derived, class DerivedSolvable_iterator>
class zypp::sat::SolvIterMixin< Derived, DerivedSolvable_iterator >

Base class providing common iterator types based on a Solvable iterator.

A class deriving from SolvIterMixin must provide two methods begin and end returning iterator over sat::Solvable.

SolvIterMixin will then provide iterators over the corresponding PoolItem and ui::Selectable_Ptr.

SolvIterMixin will also provide default implementations for empty and size by iterating from begin to end. In case Derived is able to provide a more efficient implementation, the methods should be overloaded.

Note: You will sometimes face the problem, that when using the PoolItem iterator you hit multiple version of the same package, while when using the ui::Selectable iterator the information which of the available candidates actually matched got lost. In this case class PoolItemBest may help you. Use it to pick the best version only.

*     namespace detail
*     {
*       class WhatProvidesIterator;
*     }
*
*     class WhatProvides : public SolvIterMixin<WhatProvides,detail::WhatProvidesIterator>
*     {
*       public:
*         typedef detail::WhatProvidesIterator const_iterator;
*
*         // Iterator pointing to the first Solvable.
*         const_iterator begin() const;
*
*         // Iterator pointing behind the last Solvable.
*         const_iterator end() const;
*
*     };
*
*     namespace detail
*     {
*       class WhatProvidesIterator : public boost::iterator_adaptor<
*           WhatProvidesIterator          // Derived
*          , const detail::IdType *       // Base
*          , const Solvable               // Value
*          , boost::forward_traversal_tag // CategoryOrTraversal
*          , const Solvable               // Reference
*       >
*       {
*          ...
*       };
*     }
* 

Definition at line 122 of file SolvIterMixin.h.