------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Cheddar is a GNU GPL real-time scheduling analysis tool.
-- This program provides services to automatically check schedulability and
-- other performance criteria of real-time architecture models.
--
-- Copyright (C) 2002-2023, Frank Singhoff, Alain Plantec, Jerome Legrand,
--                          Hai Nam Tran, Stephane Rubini
--
-- The Cheddar project was started in 2002 by
-- Frank Singhoff, Lab-STICC UMR 6285, Université de Bretagne Occidentale
--
-- Cheddar has been published in the "Agence de Protection des Programmes/France" in 2008.
-- Since 2008, Ellidiss technologies also contributes to the development of
-- Cheddar and provides industrial support.
--
-- The full list of contributors and sponsors can be found in README.md
--
-- 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
--
------------------------------------------------------------------------------
-- Last update :
--    $Rev: 3477 $
--    $Date: 2020-07-13 11:43:48 +0200 (Mon, 13 Jul 2020) $
--    $Author: singhoff $
------------------------------------------------------------------------------
------------------------------------------------------------------------------

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

generic
   max_element : Natural := 100;
   type element is private;

   with procedure put (e : in element);
   with procedure free (e : in out element);
   with function copy (e : in element) return element;
   with function xml_string (e : in element) return Unbounded_String;
   with function xml_ref_string (e : in element) return Unbounded_String;

package unary_trees is

   type unary_tree;
   type unary_tree_ptr is access unary_tree;

   procedure put (e : in unary_tree_ptr);
   procedure free (e : in out unary_tree_ptr);
   function copy (e : in unary_tree_ptr) return unary_tree_ptr;
   function xml_string (e : in unary_tree_ptr) return Unbounded_String;
   function xml_ref_string (e : in unary_tree_ptr) return Unbounded_String;

   package child_set is new sets
     (max_element    => max_element,
      element        => unary_tree_ptr,
      copy           => copy,
      free           => free,
      put            => put,
      xml_string     => xml_string,
      xml_ref_string => xml_ref_string);
   use child_set;
   type childs_set is new child_set.set with private;
   subtype childs_range is child_set.element_range;
   subtype childs_iterator is child_set.iterator;

   type unary_tree is record
      childs : childs_set;
      data   : element;
   end record;

   subtype node is unary_tree;
   subtype node_ptr is unary_tree_ptr;

   procedure initialize (t : out unary_tree_ptr; e : element);
   procedure add_child
     (t        : in     unary_tree_ptr;
      e        :        element;
      new_node :    out node_ptr);
   function contains (t : in unary_tree_ptr; e : in element) return node_ptr;

private

   type childs_set is new child_set.set with null record;

end unary_trees;