STLdoc
STLdocumentation
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Public Types | Public Member Functions | Public Attributes | List of all members
cliext::impl::priority_queue_base< _Value_t, _Cont_t > Class Template Reference
Inheritance diagram for cliext::impl::priority_queue_base< _Value_t, _Cont_t >:

Public Types

typedef priority_queue_base< _Value_t, _Cont_t > _Mytype_t
 
typedef _STLCLR IPriorityQueue< _Value_t, typename _Container_traits< _Cont_t >::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< _Cont_t >::type container_type
 
typedef _STLCLR BinaryDelegate< _Value_t, _Value_t, boolvalue_compare
 

Public Member Functions

 priority_queue_base ()
 
priority_queue_base operator= (priority_queue_base%_Right)
 
 operator _Mycont_it^ ()
 
 priority_queue_base (value_compare^_Pred)
 
 priority_queue_base (value_compare^_Pred, container_type%_Cont)
 
 ~priority_queue_base ()
 
reference top ()
 
container_type get_container ()
 
value_compare value_comp ()
 
virtual System::Object Clone ()
 
_Myarray_t to_array ()
 
size_type size ()
 
bool empty ()
 
void push (value_type _Val)
 
void pop ()
 
void assign (_Mytype_t%_Right)
 

Public Attributes

property value_type top_item
 
_STLCLR_FIELD_ACCESS __pad0__: value_compare^ comp
 
container_type c
 

Member Typedef Documentation

template<typename _Value_t, typename _Cont_t>
typedef cli::array<_Value_t> cliext::impl::priority_queue_base< _Value_t, _Cont_t >::_Myarray_t
template<typename _Value_t, typename _Cont_t>
typedef _STLCLR IPriorityQueue<_Value_t, typename _Container_traits<_Cont_t>::generic_container_handle> cliext::impl::priority_queue_base< _Value_t, _Cont_t >::_Mycont_it
template<typename _Value_t, typename _Cont_t>
typedef priority_queue_base<_Value_t, _Cont_t> cliext::impl::priority_queue_base< _Value_t, _Cont_t >::_Mytype_t
template<typename _Value_t, typename _Cont_t>
typedef value_type cliext::impl::priority_queue_base< _Value_t, _Cont_t >::const_reference
template<typename _Value_t, typename _Cont_t>
typedef _Dehandle<_Cont_t>::type cliext::impl::priority_queue_base< _Value_t, _Cont_t >::container_type
template<typename _Value_t, typename _Cont_t>
typedef int cliext::impl::priority_queue_base< _Value_t, _Cont_t >::difference_type
template<typename _Value_t, typename _Cont_t>
typedef _Mycont_it cliext::impl::priority_queue_base< _Value_t, _Cont_t >::generic_container
template<typename _Value_t, typename _Cont_t>
typedef value_type cliext::impl::priority_queue_base< _Value_t, _Cont_t >::generic_value
template<typename _Value_t, typename _Cont_t>
typedef value_type cliext::impl::priority_queue_base< _Value_t, _Cont_t >::reference
template<typename _Value_t, typename _Cont_t>
typedef int cliext::impl::priority_queue_base< _Value_t, _Cont_t >::size_type
template<typename _Value_t, typename _Cont_t>
typedef _STLCLR BinaryDelegate<_Value_t, _Value_t, bool> cliext::impl::priority_queue_base< _Value_t, _Cont_t >::value_compare
template<typename _Value_t, typename _Cont_t>
typedef _Value_t cliext::impl::priority_queue_base< _Value_t, _Cont_t >::value_type

Constructor & Destructor Documentation

template<typename _Value_t, typename _Cont_t>
cliext::impl::priority_queue_base< _Value_t, _Cont_t >::priority_queue_base ( )
inline
510  : comp(gcnew value_compare(&_Queue_compare)),
511  c(gcnew container_type)
512  { // default constructor
513  }
_Dehandle< _Cont_t >::type container_type
Definition: queue:504
_STLCLR BinaryDelegate< _Value_t, _Value_t, bool > value_compare
Definition: queue:506
container_type c
Definition: queue:617
bool _Queue_compare(_Key_t _Left, _Key_t _Right)
Definition: queue:467
template<typename _Value_t, typename _Cont_t>
cliext::impl::priority_queue_base< _Value_t, _Cont_t >::priority_queue_base ( value_compare _Pred)
inlineexplicit
528  : comp(_Pred),
529  c(gcnew container_type)
530  { // construct with empty container, specified predicate
531  }
_FwdIt const _Ty _Pr _Pred
Definition: algorithm:1985
_Dehandle< _Cont_t >::type container_type
Definition: queue:504
container_type c
Definition: queue:617
template<typename _Value_t, typename _Cont_t>
cliext::impl::priority_queue_base< _Value_t, _Cont_t >::priority_queue_base ( value_compare _Pred,
container_type _Cont 
)
inline
534  : comp(_Pred),
535  c(gcnew container_type(_Cont))
536  { // construct with specified predicate and container
537  }
_FwdIt const _Ty _Pr _Pred
Definition: algorithm:1985
_Dehandle< _Cont_t >::type container_type
Definition: queue:504
container_type c
Definition: queue:617
template<typename _Value_t, typename _Cont_t>
cliext::impl::priority_queue_base< _Value_t, _Cont_t >::~priority_queue_base ( )
inline
541  { // destroy the object
542  delete c;
543  }
container_type c
Definition: queue:617

Member Function Documentation

template<typename _Value_t, typename _Cont_t>
void cliext::impl::priority_queue_base< _Value_t, _Cont_t >::assign ( _Mytype_t _Right)
inline
610  { // assign
611  *c = *_Right.get_container();
612  }
container_type c
Definition: queue:617
const _Ty & _Right
Definition: algorithm:4087
template<typename _Value_t, typename _Cont_t>
virtual System::Object cliext::impl::priority_queue_base< _Value_t, _Cont_t >::Clone ( )
inlinevirtual

Reimplemented in cliext::priority_queue< _Value_t, _Cont_t >.

576  { // clone the priority_queue
577  return (gcnew priority_queue_base(comp, *c));
578  }
container_type c
Definition: queue:617
priority_queue_base()
Definition: queue:509
template<typename _Value_t, typename _Cont_t>
bool cliext::impl::priority_queue_base< _Value_t, _Cont_t >::empty ( )
inline
592  { // test if sequence is empty
593  return (size() == 0);
594  }
size_type size()
Definition: queue:586
template<typename _Value_t, typename _Cont_t>
container_type cliext::impl::priority_queue_base< _Value_t, _Cont_t >::get_container ( )
inline
565  { // return container
566  return (c);
567  }
container_type c
Definition: queue:617
template<typename _Value_t, typename _Cont_t>
cliext::impl::priority_queue_base< _Value_t, _Cont_t >::operator _Mycont_it^ ( )
inline
522  { // convert to interface
523  return (this);
524  }
template<typename _Value_t, typename _Cont_t>
priority_queue_base cliext::impl::priority_queue_base< _Value_t, _Cont_t >::operator= ( priority_queue_base< _Value_t, _Cont_t >%  _Right)
inline
516  { // assign
517  assign(_Right);
518  return (*this);
519  }
void assign(_Mytype_t%_Right)
Definition: queue:609
const _Ty & _Right
Definition: algorithm:4087
template<typename _Value_t, typename _Cont_t>
void cliext::impl::priority_queue_base< _Value_t, _Cont_t >::pop ( )
inline
604  { // erase element at front end
605  cliext::pop_heap(c->begin(), c->end(), comp);
606  c->pop_back();
607  }
container_type c
Definition: queue:617
void pop_heap(_RanIt _First, _RanIt _Last)
Definition: algorithm:1630
template<typename _Value_t, typename _Cont_t>
void cliext::impl::priority_queue_base< _Value_t, _Cont_t >::push ( value_type  _Val)
inline
598  { // insert element at back end
599  c->push_back(_Val);
600  cliext::push_heap(c->begin(), c->end(), comp);
601  }
container_type c
Definition: queue:617
_FwdIt const _Ty _Val
Definition: algorithm:1938
void push_heap(_RanIt _First, _RanIt _Last)
Definition: algorithm:1524
template<typename _Value_t, typename _Cont_t>
size_type cliext::impl::priority_queue_base< _Value_t, _Cont_t >::size ( )
inline
587  { // return length of sequence
588  return (c->size());
589  }
container_type c
Definition: queue:617
template<typename _Value_t, typename _Cont_t>
_Myarray_t cliext::impl::priority_queue_base< _Value_t, _Cont_t >::to_array ( )
inline
581  { // convert to array
582  return (c->to_array());
583  }
container_type c
Definition: queue:617
template<typename _Value_t, typename _Cont_t>
reference cliext::impl::priority_queue_base< _Value_t, _Cont_t >::top ( )
inline
560  { // get highest priority element
561  return (((typename container_type::generic_container^)c)->front());
562  }
container_type c
Definition: queue:617
template<typename _Value_t, typename _Cont_t>
value_compare cliext::impl::priority_queue_base< _Value_t, _Cont_t >::value_comp ( )
inline
570  { // return object for comparing values
571  return (comp);
572  }

Member Data Documentation

template<typename _Value_t, typename _Cont_t>
_STLCLR_FIELD_ACCESS cliext::impl::priority_queue_base< _Value_t, _Cont_t >::__pad0__
template<typename _Value_t, typename _Cont_t>
container_type cliext::impl::priority_queue_base< _Value_t, _Cont_t >::c
template<typename _Value_t, typename _Cont_t>
property value_type cliext::impl::priority_queue_base< _Value_t, _Cont_t >::top_item
Initial value:
{
virtual value_type get()
{
return (top());
}
virtual void set(value_type _Val)
{
top() = _Val;
}
}

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