11 #ifndef ZYPP_SAT_QUEUE_H 12 #define ZYPP_SAT_QUEUE_H 59 {
return( find( val_r ) != end() ); }
62 value_type first()
const;
65 value_type last()
const;
70 const value_type & at(
size_type idx_r )
const;
78 const value_type & operator[](
size_type idx_r )
const;
81 value_type & operator[](
size_type idx_r );
87 void remove( value_type val_r );
90 void push( value_type val_r );
96 void pushUnique( value_type val_r );
105 void push_front( value_type val_r );
108 value_type pop_front();
113 {
return _pimpl.get(); }
129 {
return !( lhs == rhs ); }
139 #endif // ZYPP_SAT_QUEUE_H
const value_type * const_iterator
bool operator==(const Map &lhs, const Map &rhs)
std::ostream & operator<<(std::ostream &str, const FileConflicts &obj)
String related utilities and Regular expression matching.
detail::IdType value_type
int IdType
Generic Id type.
const Arch Arch_armv7hnl Arch_armv7nhl ZYPP_API
RWCOW_pointer< detail::CQueue > _pimpl
Pointer to implementation.
std::ostream & dumpOn(std::ostream &str, const LocaleSupport &obj)
void push_back(value_type val_r)
Libsolv Id queue wrapper.
bool contains(value_type val_r) const
Return whether the Queue contais at lest one element with value val_r.
bool operator!=(const Queue &lhs, const Queue &rhs)
::s_Queue CQueue
Wrapped libsolv C data type exposed as backdoor.
Easy-to use interface to the ZYPP dependency resolver.