Rosetta 3.5
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
Public Member Functions | Private Attributes | List of all members
protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering > Class Template Reference

#include <BoundedPriorityQueue.hh>

Inheritance diagram for protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >:
Inheritance graph
[legend]
Collaboration diagram for protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >:
Collaboration graph
[legend]

Public Member Functions

 BoundedPriorityQueue (StrictWeakOrdering cmp, Size max_capacity)
 
 ~BoundedPriorityQueue ()
 
const T & top ()
 
bool push (const T &x)
 
Size count_inserted ()
 
T & pop ()
 Removes and returns a reference to the best element in the queue. More...
 
void lazy_sort ()
 
void set_boundary (Size max_capacity)
 sets new capacity for the container More...
 
T & peek_back ()
 Returns a reference to the worst element in the queue. More...
 
T & peek_front ()
 
T & at (Size index)
 
T & operator[] (Size index)
 
Size size ()
 
utility::vector1< T > & expose_data ()
 
void clear ()
 

Private Attributes

StrictWeakOrdering comp
 
bool sorted
 
Size max_capacity_
 
worst_
 
Size last_
 
bool initialized_
 
utility::vector1< T > data_
 
Size n_sorts
 
Size n_denied
 

Constructor & Destructor Documentation

template<class T , class StrictWeakOrdering >
protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::BoundedPriorityQueue ( StrictWeakOrdering  cmp,
Size  max_capacity 
)
inline
template<class T , class StrictWeakOrdering >
protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::~BoundedPriorityQueue ( )
inline

Member Function Documentation

template<class T , class StrictWeakOrdering >
T& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::at ( Size  index)
inline
template<class T , class StrictWeakOrdering >
void protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::clear ( )
inline
template<class T , class StrictWeakOrdering >
Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::count_inserted ( )
inline
template<class T , class StrictWeakOrdering >
utility::vector1<T>& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::expose_data ( )
inline
template<class T , class StrictWeakOrdering >
void protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::lazy_sort ( )
inline
template<class T , class StrictWeakOrdering >
T& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::operator[] ( Size  index)
inline
template<class T , class StrictWeakOrdering >
T& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::peek_back ( )
inline

Returns a reference to the worst element in the queue.

Detailed: This element when compared to any other element in the queue will give false.

References protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::lazy_sort().

template<class T , class StrictWeakOrdering >
T& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::peek_front ( )
inline
template<class T , class StrictWeakOrdering >
T& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::pop ( )
inline

Removes and returns a reference to the best element in the queue.

Detailed: This element, when compared to any other element in the queue will give true.

References core::pack::interaction_graph::T(), core::scoring::hbonds::t(), and protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::top().

template<class T , class StrictWeakOrdering >
bool protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::push ( const T &  x)
inline
template<class T , class StrictWeakOrdering >
void protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::set_boundary ( Size  max_capacity)
inline

sets new capacity for the container

template<class T , class StrictWeakOrdering >
Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::size ( )
inline
template<class T , class StrictWeakOrdering >
const T& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::top ( )
inline

Member Data Documentation

template<class T , class StrictWeakOrdering >
StrictWeakOrdering protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::comp
private
template<class T , class StrictWeakOrdering >
utility::vector1<T> protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::data_
private
template<class T , class StrictWeakOrdering >
bool protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::initialized_
private
template<class T , class StrictWeakOrdering >
Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::last_
private
template<class T , class StrictWeakOrdering >
Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::max_capacity_
private
template<class T , class StrictWeakOrdering >
Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::n_denied
private
template<class T , class StrictWeakOrdering >
Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::n_sorts
private
template<class T , class StrictWeakOrdering >
bool protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::sorted
private
template<class T , class StrictWeakOrdering >
T protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::worst_
private

The documentation for this class was generated from the following files: