cliext::priority_queue< _Value_t, _Cont_t > Class Template Reference

Inheritance diagram for cliext::priority_queue< _Value_t, _Cont_t >:

Public Types
typedef priority_queue< _Value_t, _Cont_t >	_Mytype_t
typedef impl::priority_queue_select< _Value_t, typename _Dehandle< _Cont_t >::type, __is_ref_class(typename _Dehandle< _Value_t >::type)&&!is_handle< _Value_t >::value >	_Mybase_t
Public Types inherited from cliext::impl::priority_queue_select< _Value_t, _Dehandle< _Cont_t >::type, __is_ref_class(_Dehandle< _Value_t >::type)&&!is_handle< _Value_t >::value >
typedef priority_queue_select< _Value_t, _Dehandle< _Cont_t >::type, _Is_ref >	_Mytype_t
typedef priority_queue_base< _Value_t, _Dehandle< _Cont_t >::type^>	_Mybase_t
typedef _Value_t	value_type
typedef value_type	reference
typedef value_type	const_reference
Public Types inherited from cliext::impl::priority_queue_base< _Value_t, _Dehandle< _Cont_t >::type^>
typedef priority_queue_base< _Value_t, _Dehandle< _Cont_t >::type^ >	_Mytype_t
typedef _STLCLR IPriorityQueue< _Value_t, typename _Container_traits< _Dehandle< _Cont_t >::type^ >::generic_container_handle >	_Mycont_it
typedef cli::array< _Value_t >	_Myarray_t
typedef int	size_type
typedef int	difference_type
typedef _Value_t	value_type
typedef value_type	reference
typedef value_type	const_reference
typedef _Mycont_it	generic_container
typedef value_type	generic_value
typedef _Dehandle< _Dehandle< _Cont_t >::type^ >::type	container_type
typedef _STLCLR BinaryDelegate< _Value_t, _Value_t, bool >	value_compare

Public Member Functions
	priority_queue ()
	priority_queue (priority_queue%_Right)
	priority_queue (priority_queue^_Right)
priority_queue	operator= (priority_queue%_Right)
priority_queue	operator= (priority_queue^_Right)
	priority_queue (value_compare^_Pred)
	priority_queue (value_compare^_Pred, container_type%_Cont)
template<typename _Iter >
	priority_queue (_Iter _First, _Iter _Last)
template<typename _Iter >
	priority_queue (_Iter _First, _Iter _Last, value_compare^_Pred)
template<typename _Iter >
	priority_queue (_Iter _First, _Iter _Last, value_compare^_Pred, container_type%_Cont)
virtual System::Object	Clone () override
Public Member Functions inherited from cliext::impl::priority_queue_select< _Value_t, _Dehandle< _Cont_t >::type, __is_ref_class(_Dehandle< _Value_t >::type)&&!is_handle< _Value_t >::value >
	priority_queue_select ()
	priority_queue_select (value_compare^_Pred)
	priority_queue_select (value_compare^_Pred, container_type%_Cont)
priority_queue_select	operator= (priority_queue_select%_Right)
Public Member Functions inherited from cliext::impl::priority_queue_base< _Value_t, _Dehandle< _Cont_t >::type^>
	priority_queue_base ()
	priority_queue_base (value_compare^_Pred)
	priority_queue_base (value_compare^_Pred, container_type%_Cont)
priority_queue_base	operator= (priority_queue_base%_Right)
	operator _Mycont_it^ ()
	~priority_queue_base ()
reference	top ()
container_type	get_container ()
value_compare	value_comp ()
_Myarray_t	to_array ()
size_type	size ()
bool	empty ()
void	push (value_type _Val)
void	pop ()
void	assign (_Mytype_t%_Right)

Additional Inherited Members
Public Attributes inherited from cliext::impl::priority_queue_base< _Value_t, _Dehandle< _Cont_t >::type^>
property value_type	top_item
_STLCLR_FIELD_ACCESS	__pad0__
container_type	c

Member Typedef Documentation

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

typedef impl::priority_queue_select< _Value_t, typename _Dehandle<_Cont_t>::type, __is_ref_class(typename _Dehandle<_Value_t>::type) && !is_handle<_Value_t>::value> cliext::priority_queue< _Value_t, _Cont_t >::_Mybase_t

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

typedef priority_queue<_Value_t, _Cont_t> cliext::priority_queue< _Value_t, _Cont_t >::_Mytype_t

Constructor & Destructor Documentation

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

cliext::priority_queue< _Value_t, _Cont_t >::priority_queue ( )

inline

        {   // construct with empty container
        }

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

cliext::priority_queue< _Value_t, _Cont_t >::priority_queue ( priority_queue< _Value_t, _Cont_t >%  _Right )

inline

        :   _Mybase_t(_Right.value_comp(), *_Right.get_container())
        {   // construct by copying a priority_queue
        }

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

cliext::priority_queue< _Value_t, _Cont_t >::priority_queue ( priority_queue< _Value_t, _Cont_t >^  _Right )

inline

        :   _Mybase_t(_Right->value_comp(), *_Right->get_container())
        {   // construct by copying a priority_queue
        }

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

cliext::priority_queue< _Value_t, _Cont_t >::priority_queue ( value_compare^  _Pred )

inlineexplicit

        :   _Mybase_t(_Pred)
        {   // construct with empty container, specified predicate
        }

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

cliext::priority_queue< _Value_t, _Cont_t >::priority_queue ( value_compare^  _Pred, container_type%  _Cont  )

inline

        :   _Mybase_t(_Pred, _Cont)
        {   // construct with specified predicate and container
        cliext::make_heap(c->begin(), c->end(), comp);
        }

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

template<typename _Iter >

cliext::priority_queue< _Value_t, _Cont_t >::priority_queue ( _Iter  _First, _Iter  _Last  )

inline

        {   // construct by copying [_First, _Last), default comparator
        c->insert(c->end(), _First, _Last);
        cliext::make_heap(c->begin(), c->end(), comp);
        }

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

template<typename _Iter >

cliext::priority_queue< _Value_t, _Cont_t >::priority_queue ( _Iter  _First, _Iter  _Last, value_compare^  _Pred  )

inline

        :   _Mybase_t(_Pred)
        {   // construct by copying [_First, _Last), specified comparator
        c->insert(c->end(), _First, _Last);
        cliext::make_heap(c->begin(), c->end(), comp);
        }

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

template<typename _Iter >

cliext::priority_queue< _Value_t, _Cont_t >::priority_queue ( _Iter  _First, _Iter  _Last, value_compare^  _Pred, container_type%  _Cont  )

inline

        :   _Mybase_t(_Pred, _Cont)
        {   // construct by copying [_First, _Last), container, and comparator
        c->insert(c->end(), _First, _Last);
        cliext::make_heap(c->begin(), c->end(), comp);
        }

Member Function Documentation

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

virtual System::Object cliext::priority_queue< _Value_t, _Cont_t >::Clone ( )

inlineoverridevirtual

Reimplemented from cliext::impl::priority_queue_base< _Value_t, _Dehandle< _Cont_t >::type^>.

        {   // clone the vector
        return (gcnew _Mytype_t(*this));
        }

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

priority_queue cliext::priority_queue< _Value_t, _Cont_t >::operator= ( priority_queue< _Value_t, _Cont_t >%  _Right )

inline

        {   // assign
        _Mybase_t::operator=(_Right);
        return (*this);
        }

template<typename _Value_t , typename _Cont_t = cliext::vector<_Value_t>>

priority_queue cliext::priority_queue< _Value_t, _Cont_t >::operator= ( priority_queue< _Value_t, _Cont_t >^  _Right )

inline

        {   // assign
        _Mybase_t::operator=(*_Right);
        return (*this);
        }

---

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

• VS2013/inc/cliext/queue