------------------------------------------------------------------------------
------------------------------------------------------------------------------
--  This Ada package was automatically generated by the software engineering
--tool Platypus
--  see http://cassoulet.univ-brest.fr/mme
--
--  Any modification of this file will be lost.
--  Please see the "platypus" directory instead : it contains the Cheddar's
--  model and its meta-model.
------------------------------------------------------------------------------

------------------------------------------------------------------------------
-- Cheddar is a free real time scheduling tool.
-- This program provides services to automatically check temporal constraints
-- of real time tasks.
--
-- Copyright (C) 2002-2009   Frank Singhoff
-- Cheddar is developed by the LISYC Team, University of Brest
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 2 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program; if not, write to the Free Software
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
--
--
-- Contact : cheddar@listes.univ-brest.fr
-- 	To post to this mailing list, you must be subscribed
-- 	(see http//beru.univ-brest.fr/~singhoff/cheddar for details)
--
------------------------------------------------------------------------------
------------------------------------------------------------------------------

with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;

with Generic_Graph; use Generic_Graph;

with Tasks; use Tasks;

with Buffers; use Buffers;

with Messages; use Messages;

with Dependencies; use Dependencies;

with Resources; use Resources;

with Systems; use Systems;

with Processors; use Processors;

with Convert_Strings;

with Convert_Unbounded_Strings;

with Text_IO; use Text_IO;

with Ada.Finalization;

with Unbounded_Strings; use Unbounded_Strings;

use Unbounded_Strings.Unbounded_String_List_Package;

with Unchecked_Deallocation;

package DP_Graph.extended is

   Building_Graph_Exception : exception;

   procedure Initialize (obj : in out Task_Node_Ptr);
   procedure Initialize (obj : in out Time_Triggered_Communication_Edge_Ptr);
   procedure Initialize (obj : in out Resource_Edge_Ptr);
   procedure Initialize (obj : in out Precedence_Edge_Ptr);
   procedure Initialize (obj : in out Communication_Edge_Ptr);
   procedure Initialize (obj : in out Buffer_Edge_Ptr);

   procedure Add_Node
     (obj     : in out Graph;
      N       : in Task_Node_Ptr;
      succeed : out Boolean);
   function Create_Node_From_Task
     (obj  : in Generic_Task_Ptr)
      return Task_Node_Ptr;

   procedure Add_Edge
     (obj     : in out Graph;
      E       : in Time_Triggered_Communication_Edge_Ptr;
      succeed : out Boolean);
   function Build_Graph_From_System (obj : System) return Graph;
   function get_value (obj : Graph_Ptr) return Graph;

end DP_Graph.extended;