|
libzypp
15.22.2
|
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. More... | |
| ~Queue () | |
| Dtor. More... | |
| 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. More... | |
| bool | contains (value_type val_r) const |
| Return whether the Queue contais at lest one element with value val_r. More... | |
| value_type | first () const |
Return the 1st Id in the queue or 0 if empty. More... | |
| value_type | last () const |
Return the last Id in the queue or 0 if empty. More... | |
| const value_type & | at (size_type idx_r) const |
| Return the Id at idx_r in the queue. More... | |
| value_type & | at (size_type idx_r) |
| Return the Id at idx_r in the queue. More... | |
| const value_type & | operator[] (size_type idx_r) const |
| Return the Id at idx_r in the queue (no range check) More... | |
| value_type & | operator[] (size_type idx_r) |
| Return the Id at idx_r in the queue (no range check) More... | |
| void | clear () |
| Clear the queue. More... | |
| void | remove (value_type val_r) |
| Remove all occurances of val_r from the queue. More... | |
| void | push (value_type val_r) |
| Push a value to the end off the Queue. More... | |
| void | push_back (value_type val_r) |
| void | pushUnique (value_type val_r) |
| Push a value if it's not yet in the Queue. More... | |
| value_type | pop () |
Pop and return the last Id from the queue or 0 if empty. More... | |
| value_type | pop_back () |
| void | push_front (value_type val_r) |
| Push a value to the beginning off the Queue. More... | |
| value_type | pop_front () |
Pop and return the 1st Id from the queue or 0 if empty. More... | |
| operator detail::CQueue * () | |
| libsolv backdoor More... | |
| operator const detail::CQueue * () const | |
| < libsolv backdoor More... | |
Private Attributes | |
| RWCOW_pointer< detail::CQueue > | _pimpl |
| Pointer to implementation. More... | |
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) |
| bool | operator== (const Queue &lhs, const Queue &rhs) |
| bool | operator!= (const Queue &lhs, const Queue &rhs) |
Libsolv Id queue wrapper.
| 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 |
|
inline |
| Queue::value_type zypp::sat::Queue::first | ( | ) | const |
| Queue::value_type zypp::sat::Queue::last | ( | ) | const |
| const Queue::value_type & zypp::sat::Queue::at | ( | size_type | idx_r | ) | const |
| Queue::value_type & zypp::sat::Queue::at | ( | size_type | idx_r | ) |
| const Queue::value_type & zypp::sat::Queue::operator[] | ( | size_type | idx_r | ) | const |
| Queue::value_type & zypp::sat::Queue::operator[] | ( | size_type | idx_r | ) |
| void zypp::sat::Queue::remove | ( | value_type | val_r | ) |
| void zypp::sat::Queue::push | ( | value_type | val_r | ) |
|
inline |
| void zypp::sat::Queue::pushUnique | ( | value_type | val_r | ) |
| Queue::value_type zypp::sat::Queue::pop | ( | ) |
|
inline |
| void zypp::sat::Queue::push_front | ( | value_type | val_r | ) |
| Queue::value_type zypp::sat::Queue::pop_front | ( | ) |
| zypp::sat::Queue::operator detail::CQueue * | ( | ) |
|
inline |
|
related |
|
related |
|
private |