#include "treeprop.h"



int Ar_Vertex_list::set_contained_ins(  )
{
  DEM_TRACE("Ar_Vertex_list","int Ar_Vertex_list::set_contained_ins()");
  int return_val =  1 ;

  this->set_contained_ins_( return_val );
  return return_val;
}
//  Ar_Vertex  = <v > Vertex 
//            <ar > Vertex_comma_list 
//            <contained_in > Vertex .
void Ar_Vertex::set_contained_ins_( int& return_val, Vertex* &  k )
{
  DEM_TRACE("Ar_Vertex","void Ar_Vertex::set_contained_ins_(int& return_val,Vertex* &  k)");
  // variables for carrying in and out

  // assignments for carrying in

  // prefix class wrappers

      if (contained_in == NULL) {
        contained_in = k;
      } else if (!(contained_in->g_equal(k))) {
        return_val = 0;
      }
      k = v;
    

  // outgoing calls

  // suffix class wrappers

  // assignments for carrying out
}

//  Ar_Vertex_list  ~  { Ar_Vertex  }. .
void Ar_Vertex_list::set_contained_ins_( int& return_val )
{
  DEM_TRACE("Ar_Vertex_list","void Ar_Vertex_list::set_contained_ins_(int& return_val)");
  // variables for carrying in and out
  Vertex*  k =  new Vertex(new DemIdent("")) ;

  // assignments for carrying in

  // prefix class wrappers

  // outgoing calls
  Ar_Vertex_list_iterator	next_Ar_Vertex(*this);
  Ar_Vertex*		each_Ar_Vertex;

  while ( each_Ar_Vertex = next_Ar_Vertex() )
  {
  // repetition edge prefix wrappers
    each_Ar_Vertex->set_contained_ins_( return_val, k  );
  // repetition edge suffix wrappers
  }

  // suffix class wrappers

  // assignments for carrying out
}