protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering > Class Template Reference

#include <BoundedCollector.fwd.hh>

Inheritance diagram for protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >:

Collaboration diagram for protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >:

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_
T	worst_
Size	last_
bool	initialized_
utility::vector1< T >	data_
Size	n_sorts
Size	n_denied

Detailed Description

template<class T, class StrictWeakOrdering>
class protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >

Definition at line 25 of file BoundedCollector.fwd.hh.

Constructor & Destructor Documentation

template<class T , class StrictWeakOrdering >

protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::BoundedPriorityQueue ( StrictWeakOrdering  cmp, Size  max_capacity  )

inline

Definition at line 35 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::~BoundedPriorityQueue ( )

inline

Definition at line 46 of file BoundedPriorityQueue.hh.

Member Function Documentation

template<class T , class StrictWeakOrdering >

T& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::at ( Size  index)

inline

Definition at line 122 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

void protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::clear ( )

inline

Definition at line 138 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::count_inserted ( )

inline

Definition at line 86 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

utility::vector1<T>& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::expose_data ( )

inline

Definition at line 134 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

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

inline

Definition at line 97 of file BoundedPriorityQueue.hh.

Referenced by protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::peek_back(), protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::peek_front(), protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::push(), and protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::top().

template<class T , class StrictWeakOrdering >

T& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::operator[] ( Size  index)

inline

Definition at line 126 of file BoundedPriorityQueue.hh.

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.

Definition at line 112 of file BoundedPriorityQueue.hh.

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

template<class T , class StrictWeakOrdering >

T& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::peek_front ( )

inline

Definition at line 117 of file BoundedPriorityQueue.hh.

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

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.

Definition at line 90 of file BoundedPriorityQueue.hh.

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

Definition at line 55 of file BoundedPriorityQueue.hh.

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

template<class T , class StrictWeakOrdering >

void protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::set_boundary ( Size  max_capacity)

inline

sets new capacity for the container

Definition at line 106 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::size ( )

inline

Definition at line 130 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

const T& protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::top ( )

inline

Definition at line 50 of file BoundedPriorityQueue.hh.

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

Referenced by protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::pop().

Member Data Documentation

template<class T , class StrictWeakOrdering >

StrictWeakOrdering protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::comp

private

Definition at line 142 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

utility::vector1<T> protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::data_

private

Definition at line 148 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

bool protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::initialized_

private

Definition at line 147 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::last_

private

Definition at line 146 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::max_capacity_

private

Definition at line 144 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::n_denied

private

Definition at line 152 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

Size protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::n_sorts

private

Definition at line 151 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

bool protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::sorted

private

Definition at line 143 of file BoundedPriorityQueue.hh.

template<class T , class StrictWeakOrdering >

T protocols::frag_picker::BoundedPriorityQueue< T, StrictWeakOrdering >::worst_

private

Definition at line 145 of file BoundedPriorityQueue.hh.

---

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

• src/protocols/frag_picker/BoundedCollector.fwd.hh
• src/protocols/frag_picker/BoundedPriorityQueue.hh