std::cout << int( sIt->first ) << " " << int( sIt->second.first ) << " " << sIt->second.second << std::endl;
} // rof
- std::cerr << ( this->m_CurrentThreshold != this->m_Thresholds.end( ) ) << std::endl;
}
// -------------------------------------------------------------------------
{
this->m_Signal[ this->m_Signal.size( ) + 1 ] =
TSignalData( *this->m_CurrentThreshold, this->m_Count );
- std::cerr << *( this->m_CurrentThreshold ) << std::endl;
this->m_CurrentThreshold++;
this->m_CurrentQueue = ( this->m_CurrentQueue + 1 ) % 2;
if( this->m_CurrentThreshold != this->m_Thresholds.end( ) )
// -------------------------------------------------------------------------
template< class _TAlgorithm >
-bool fpa::Base::Mori< _TAlgorithm >::
+void fpa::Base::Mori< _TAlgorithm >::
_ComputeOutputValue( TNode& n )
+{
+ // Do nothing!!!
+}
+
+// -------------------------------------------------------------------------
+template< class _TAlgorithm >
+void fpa::Base::Mori< _TAlgorithm >::
+_UpdateOutputValue( TNode& n )
{
TInputValue value = this->_GetInputValue( n.Vertex );
bool inside = this->m_Predicate->Evaluate( value );
- n.Value = this->m_InsideValue;
if( !inside )
{
+ n.Value = this->m_InitValue;
n.FrontId++;
this->m_Queues[ ( this->m_CurrentQueue + 1 ) % 2 ].push_back( n );
+ n.FrontId = 0;
}
else
+ {
+ n.Value = this->m_InsideValue;
this->m_Count++;
- return( inside );
+
+ } // fi
+ this->Superclass::_UpdateOutputValue( n );
}
-
+
// -------------------------------------------------------------------------
template< class _TAlgorithm >
void fpa::Base::Mori< _TAlgorithm >::
{
typename TNodes::iterator nIt = nodes.begin( );
for( ; nIt != nodes.end( ); ++nIt )
- nIt->Value = this->m_InsideValue;
+ nIt->Value = this->m_InitValue;
}
#endif // __fpa__Base__Mori__hxx__