libzypp
10.5.0
|
Libsolv Id queue wrapper. More...
#include <Queue.h>
Public Types | |
typedef unsigned | size_type |
typedef detail::IdType | value_type |
typedef const value_type * | const_iterator |
Public Member Functions | |
Queue () | |
Default ctor: empty Queue. | |
~Queue () | |
Dtor. | |
bool | empty () const |
size_type | size () const |
const_iterator | begin () const |
const_iterator | end () const |
const_iterator | find (value_type val_r) const |
Return iterator to the 1st occurance of val_r or end. | |
bool | contains (value_type val_r) const |
Return whether the Queue contais at lest one element with value val_r. | |
value_type | first () const |
Return the 1st Id in the queue or 0 if empty. | |
value_type | last () const |
Return the last Id in the queue or 0 if empty. | |
void | clear () |
Clear the queue. | |
void | remove (value_type val_r) |
Remove all occurances of val_r from the queue. | |
void | push (value_type val_r) |
Push a value to the end off the Queue. | |
void | push_back (value_type val_r) |
value_type | pop () |
Pop and return the last Id from the queue or 0 if empty. | |
value_type | pop_back () |
void | push_front (value_type val_r) |
Push a value to the beginning off the Queue. | |
value_type | pop_front () |
Pop and return the 1st Id from the queue or 0 if empty. | |
operator struct::_Queue * () | |
Backdoor. | |
operator const struct::_Queue * () const | |
Backdoor. | |
Private Attributes | |
struct::_Queue * | _pimpl |
Pointer to implementation. | |
Related Functions | |
(Note that these are not member functions.) | |
std::ostream & | operator<< (std::ostream &str, const Queue &obj) |
std::ostream & | dumpOn (std::ostream &str, const Queue &obj) |
typedef unsigned zypp::sat::Queue::size_type |
typedef const value_type* zypp::sat::Queue::const_iterator |
Queue::size_type zypp::sat::Queue::size | ( | ) | const |
Queue::const_iterator zypp::sat::Queue::begin | ( | ) | const |
Queue::const_iterator zypp::sat::Queue::end | ( | ) | const |
Queue::const_iterator zypp::sat::Queue::find | ( | value_type | val_r | ) | const |
bool zypp::sat::Queue::contains | ( | value_type | val_r | ) | const [inline] |
Queue::value_type zypp::sat::Queue::first | ( | ) | const |
Queue::value_type zypp::sat::Queue::last | ( | ) | const |
void zypp::sat::Queue::remove | ( | value_type | val_r | ) |
void zypp::sat::Queue::push | ( | value_type | val_r | ) |
void zypp::sat::Queue::push_back | ( | value_type | val_r | ) | [inline] |
Queue::value_type zypp::sat::Queue::pop | ( | ) |
value_type zypp::sat::Queue::pop_back | ( | ) | [inline] |
void zypp::sat::Queue::push_front | ( | value_type | val_r | ) |
Queue::value_type zypp::sat::Queue::pop_front | ( | ) |
zypp::sat::Queue::operator struct::_Queue * | ( | ) | [inline] |
zypp::sat::Queue::operator const struct::_Queue * | ( | ) | const [inline] |
std::ostream & operator<< | ( | std::ostream & | str, |
const Queue & | obj | ||
) | [related] |
std::ostream & dumpOn | ( | std::ostream & | str, |
const Queue & | obj | ||
) | [related] |
struct ::_Queue* zypp::sat::Queue::_pimpl [private] |