#include "pp.h"



int Path_constraint_exp::isAlsoBypass( Meta_edge*  e )
{
  DEM_TRACE("Path_constraint_exp","int Path_constraint_exp::isAlsoBypass(Meta_edge*  e)");
  int return_val;

  this->isAlsoBypass_( return_val, e  );
  return return_val;
}
void Path_constraint_exp::isAlsoBypass_( int& return_val, Meta_edge*  e )
{
  DEM_TRACE("Path_constraint_exp","void Path_constraint_exp::isAlsoBypass_(int& return_val,Meta_edge*  e)");
  // prefix class wrappers

       return_val =  0;
    

  // suffix class wrappers

}

int Require_through::isAlsoBypass( Meta_edge*  e )
{
  DEM_TRACE("Require_through","int Require_through::isAlsoBypass(Meta_edge*  e)");
  int return_val;

  this->isAlsoBypass_( return_val, e  );
  return return_val;
}
void Require_through::isAlsoBypass_( int& return_val, Meta_edge*  e )
{
  DEM_TRACE("Require_through","void Require_through::isAlsoBypass_(int& return_val,Meta_edge*  e)");
  // prefix class wrappers

       if (bypassing)
         return_val = bypassing->isAlsoBypass(e);
       else
         return_val = 0;
    

  // suffix class wrappers

}

int Require_bypassing::isAlsoBypass( Meta_edge*  e )
{
  DEM_TRACE("Require_bypassing","int Require_bypassing::isAlsoBypass(Meta_edge*  e)");
  int return_val;

  this->isAlsoBypass_( return_val, e  );
  return return_val;
}
void Require_bypassing::isAlsoBypass_( int& return_val, Meta_edge*  e )
{
  DEM_TRACE("Require_bypassing","void Require_bypassing::isAlsoBypass_(int& return_val,Meta_edge*  e)");
  // prefix class wrappers

       return_val = bypassing->isAlsoBypass(e);
    

  // suffix class wrappers

}

int Bypassing_path_constraint::isAlsoBypass( Meta_edge*  e )
{
  DEM_TRACE("Bypassing_path_constraint","int Bypassing_path_constraint::isAlsoBypass(Meta_edge*  e)");
  int return_val;

  this->isAlsoBypass_( return_val, e  );
  return return_val;
}
void Bypassing_path_constraint::isAlsoBypass_( int& return_val, Meta_edge*  e )
{
  DEM_TRACE("Bypassing_path_constraint","void Bypassing_path_constraint::isAlsoBypass_(int& return_val,Meta_edge*  e)");
  // prefix class wrappers

       Meta_edge_list_iterator next(*bypassing);
       Meta_edge*              each;
       while (each = next())
         if (each->g_equal(e))
	    break;
       if (each)
          return_val = 1;
       else
          return_val = 0;
    

  // suffix class wrappers

}