1 #ifndef __fpa__Base__QueueAlgorithm__hxx__
2 #define __fpa__Base__QueueAlgorithm__hxx__
4 // -------------------------------------------------------------------------
5 template< class _TSuperclass >
6 fpa::Base::QueueAlgorithm< _TSuperclass >::
12 // -------------------------------------------------------------------------
13 template< class _TSuperclass >
14 fpa::Base::QueueAlgorithm< _TSuperclass >::
19 // -------------------------------------------------------------------------
20 template< class _TSuperclass >
21 unsigned long fpa::Base::QueueAlgorithm< _TSuperclass >::
24 return( this->m_Queue.size( ) );
27 // -------------------------------------------------------------------------
28 template< class _TSuperclass >
29 void fpa::Base::QueueAlgorithm< _TSuperclass >::
32 while( this->m_Queue.size( ) > 0 )
36 // -------------------------------------------------------------------------
37 template< class _TSuperclass >
38 void fpa::Base::QueueAlgorithm< _TSuperclass >::
39 _QueuePush( const _TQueueNode& node )
41 this->m_Queue.push( node );
44 // -------------------------------------------------------------------------
45 template< class _TSuperclass >
46 typename fpa::Base::QueueAlgorithm< _TSuperclass >::
47 _TQueueNode fpa::Base::QueueAlgorithm< _TSuperclass >::
50 _TQueueNode f = this->m_Queue.front( );
55 #endif // __fpa__Base__QueueAlgorithm__hxx__