Libsolv Id queue wrapper.  
 More...
#include <zypp/sat/Queue.h>
Libsolv Id queue wrapper. 
- Todo
- template value_type to work with IString and other Id based types
Definition at line 35 of file Queue.h.
◆ size_type
◆ value_type
◆ const_iterator
◆ Queue()
      
        
          | zypp::sat::Queue::Queue | ( |  | ) |  | 
      
 
 
◆ ~Queue()
      
        
          | zypp::sat::Queue::~Queue | ( |  | ) |  | 
      
 
 
◆ empty()
      
        
          | bool zypp::sat::Queue::empty | ( |  | ) | const | 
      
 
 
◆ size()
◆ begin()
◆ end()
◆ find()
Return iterator to the 1st occurance of val_r or end. 
Definition at line 58 of file Queue.cc.
 
 
◆ contains()
Return whether the Queue contais at lest one element with value val_r. 
Definition at line 58 of file Queue.h.
 
 
◆ first()
Return the 1st Id in the queue or 0 if empty. 
Definition at line 66 of file Queue.cc.
 
 
◆ last()
Return the last Id in the queue or 0 if empty. 
Definition at line 73 of file Queue.cc.
 
 
◆ at() [1/2]
Return the Id at idx_r in the queue. 
- Exceptions
- 
  
    | std::out_of_range | if idx_r is out of range |  
 
Definition at line 82 of file Queue.cc.
 
 
◆ at() [2/2]
Return the Id at idx_r in the queue. 
- Exceptions
- 
  
    | std::out_of_range | if idx_r is out of range |  
 
Definition at line 85 of file Queue.cc.
 
 
◆ operator[]() [1/2]
Return the Id at idx_r in the queue (no range check) 
Definition at line 88 of file Queue.cc.
 
 
◆ operator[]() [2/2]
Return the Id at idx_r in the queue (no range check) 
Definition at line 91 of file Queue.cc.
 
 
◆ clear()
      
        
          | void zypp::sat::Queue::clear | ( |  | ) |  | 
      
 
Clear the queue. 
Definition at line 94 of file Queue.cc.
 
 
◆ remove()
Remove all occurances of val_r from the queue. 
Definition at line 97 of file Queue.cc.
 
 
◆ push()
◆ push_back()
  
  | 
        
          | void zypp::sat::Queue::push_back | ( | value_type | val_r | ) |  |  | inline | 
 
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
Definition at line 92 of file Queue.h.
 
 
◆ pushUnique()
      
        
          | void zypp::sat::Queue::pushUnique | ( | value_type | val_r | ) |  | 
      
 
Push a value if it's not yet in the Queue. 
Definition at line 106 of file Queue.cc.
 
 
◆ pop()
Pop and return the last Id from the queue or 0 if empty. 
Definition at line 109 of file Queue.cc.
 
 
◆ pop_back()
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts. 
Definition at line 101 of file Queue.h.
 
 
◆ push_front()
      
        
          | void zypp::sat::Queue::push_front | ( | value_type | val_r | ) |  | 
      
 
Push a value to the beginning off the Queue. 
Definition at line 112 of file Queue.cc.
 
 
◆ pop_front()
Pop and return the 1st Id from the queue or 0 if empty. 
Definition at line 115 of file Queue.cc.
 
 
◆ operator detail::CQueue *()
libsolv backdoor 
Definition at line 118 of file Queue.cc.
 
 
◆ operator const detail::CQueue *()
< libsolv backdoor 
Definition at line 112 of file Queue.h.
 
 
◆ operator<<()
  
  | 
        
          | std::ostream & operator<< | ( | std::ostream & | str, |  
          |  |  | const Queue & | obj ) |  | related | 
 
Stream output. 
Definition at line 121 of file Queue.cc.
 
 
◆ dumpOn()
  
  | 
        
          | std::ostream & dumpOn | ( | std::ostream & | str, |  
          |  |  | const Queue & | obj ) |  | related | 
 
 
◆ operator==()
◆ operator!=()
◆ _pimpl
Pointer to implementation. 
Definition at line 115 of file Queue.h.
 
 
The documentation for this class was generated from the following files: