libs/fpa/Base/QueueAlgorithm.hxx

   1 #ifndef __fpa__Base__QueueAlgorithm__hxx__
   2 #define __fpa__Base__QueueAlgorithm__hxx__
   3
   4 // -------------------------------------------------------------------------
   5 template< class _TSuperclass >
   6 fpa::Base::QueueAlgorithm< _TSuperclass >::
   7 QueueAlgorithm( )
   8   : Superclass( )
   9 {
  10 }
  11
  12 // -------------------------------------------------------------------------
  13 template< class _TSuperclass >
  14 fpa::Base::QueueAlgorithm< _TSuperclass >::
  15 ~QueueAlgorithm( )
  16 {
  17 }
  18
  19 // -------------------------------------------------------------------------
  20 template< class _TSuperclass >
  21 unsigned long fpa::Base::QueueAlgorithm< _TSuperclass >::
  22 _QueueSize( ) const
  23 {
  24   return( this->m_Queue.size( ) );
  25 }
  26
  27 // -------------------------------------------------------------------------
  28 template< class _TSuperclass >
  29 void fpa::Base::QueueAlgorithm< _TSuperclass >::
  30 _QueueClear( )
  31 {
  32   while( this->m_Queue.size( ) > 0 )
  33     this->m_Queue.pop( );
  34 }
  35
  36 // -------------------------------------------------------------------------
  37 template< class _TSuperclass >
  38 void fpa::Base::QueueAlgorithm< _TSuperclass >::
  39 _QueuePush( const _TQueueNode& node )
  40 {
  41   this->m_Queue.push( node );
  42 }
  43
  44 // -------------------------------------------------------------------------
  45 template< class _TSuperclass >
  46 typename fpa::Base::QueueAlgorithm< _TSuperclass >::
  47 _TQueueNode fpa::Base::QueueAlgorithm< _TSuperclass >::
  48 _QueuePop( )
  49 {
  50   _TQueueNode f = this->m_Queue.front( );
  51   this->m_Queue.pop( );
  52   return( f );
  53 }
  54
  55 #endif // __fpa__Base__QueueAlgorithm__hxx__
  56
  57 // eof - $RCSfile$