11 #ifndef ZYPP_SAT_QUEUE_H
12 #define ZYPP_SAT_QUEUE_H
56 {
return(
find( val_r ) !=
end() ); }
90 operator struct ::_Queue *()
93 operator const struct ::_Queue *()
const
105 std::ostream &
dumpOn( std::ostream & str,
const Queue & obj );
112 {
return !( lhs == rhs ); }
120 #endif // ZYPP_SAT_QUEUE_H
int IdType
Generic Id type.
std::ostream & operator<<(std::ostream &str, const LocaleSupport &obj)
detail::IdType value_type
bool operator==(const Map &lhs, const Map &rhs)
struct::_Queue * _pimpl
Pointer to implementation.
value_type last() const
Return the last Id in the queue or 0 if empty.
const_iterator find(value_type val_r) const
Return iterator to the 1st occurance of val_r or end.
const_iterator end() const
void push(value_type val_r)
Push a value to the end off the Queue.
boost::noncopyable NonCopyable
Ensure derived classes cannot be copied.
const_iterator begin() const
value_type pop_front()
Pop and return the 1st Id from the queue or 0 if empty.
void push_front(value_type val_r)
Push a value to the beginning off the Queue.
const value_type * const_iterator
std::ostream & dumpOn(std::ostream &str, const LocaleSupport &obj)
void push_back(value_type val_r)
Libsolv Id queue wrapper.
void clear()
Clear the queue.
bool operator!=(const Queue &lhs, const Queue &rhs)
Queue()
Default ctor: empty Queue.
value_type first() const
Return the 1st Id in the queue or 0 if empty.
value_type pop()
Pop and return the last Id from the queue or 0 if empty.
bool contains(value_type val_r) const
Return whether the Queue contais at lest one element with value val_r.