BoundedPriorityDeque.hpp File Reference

Provides a framework for a bounded priority deque with customizable comparison mechanisms. More...

#include <vector>

Go to the source code of this file.

Classes
class	has_comparison_operator< T >
	Type trait to detect the presence of a comparison operator in types. More...
class	BoundingPair< K, V, Enable >
	A template class to store key-value pairs with comparison operations. More...
class	BoundingPair< K, V, std::enable_if_t< has_comparison_operator_v< K > > >
class	BoundedPriorityDequeBase< K, V >
	Base class for implementing a bounded priority deque. More...
class	BoundedMinPriorityDeque< K, V >
	Lightweight minimum priority dequeue. More...
class	BoundedMaxPriorityDeque< K, V >
	Lightweight maximum priority dequeue. More...
class	BoundedPriorityDequeKeyed< K, V, Comparator >
	Lightweight custom key comparator priority dequeue. More...
class	BoundedPriorityDeque< V, Comparator, K >
	Lightweight custom value-based comparator priority dequeue. More...

Variables
template<typename T >
constexpr bool	has_comparison_operator_v = has_comparison_operator<T>::value

Detailed Description

Provides a framework for a bounded priority deque with customizable comparison mechanisms.

Defines several template classes for implementing a bounded priority deque that supports both min and max oriented operations with customizable comparison. It includes mechanisms to handle capacity and size management, as well as utility functions for element access and manipulation.