--  This source is licensed under the Sunset License v1.0


with Unit_Tests;
use Unit_Tests;


package Rat_Tests.Parse_Graphs is


    function Debug_String_Check return String;


    function Assign_Check return Test_Result;
    function Copy_Check return Test_Result;
    function Move_Check return Test_Result;

    function Is_Empty_Check return Test_Result;
    function Clear_Check return Test_Result;

    function Contains_Check return Test_Result;
    function Reachable_Check return Test_Result;
    function All_Reachable_Check return Test_Result;
    function Valid_Starts_Finishes_Check return Test_Result;
    function Loops_Introduced_Check return Test_Result;
    function Is_Sorted_Check return Test_Result;
    function No_Duplicates_Check return Test_Result;

    function Include_Check return Test_Result;
    function Connect_Check return Test_Result;
    function Prune_Check return Test_Result;
    function Delete_Unreachable_Check return Test_Result;

    function Has_Root_Check return Test_Result;
    function Set_Root_Check return Test_Result;
    function Clear_Root_Check return Test_Result;
    function Root_Elements_Check return Test_Result;

    function Finish_List_Check return Test_Result;
    function Is_Leaf_Check return Test_Result;
    function Is_Branch_Check return Test_Result;

    function Subgroups_Check return Test_Result;
    function First_Index_Check return Test_Result;
    function Last_Index_Check return Test_Result;
    function Length_Check return Test_Result;
    function Element_Check return Test_Result;
    function Elements_Check return Test_Result;
    function Parent_Check return Test_Result;
    function Finish_Check return Test_Result;

    function Is_Root_Ambiguous_Check return Test_Result;
    function Is_Ambiguous_Check return Test_Result;
    function Ambiguities_Check return Test_Result;

    function Isomorphic_Check return Test_Result;
    function Isomorphic_Subgraph_Check return Test_Result;


    Tests : Test_Array :=
       ((+"Assign", Assign_Check'Access),
        (+"Copy", Copy_Check'Access),
        (+"Move", Move_Check'Access),

        (+"Is_Empty", Is_Empty_Check'Access),
        (+"Clear", Clear_Check'Access),

        (+"Contains", Contains_Check'Access),
        (+"Reachable", Reachable_Check'Access),
        (+"All_Reachable", All_Reachable_Check'Access),
        (+"Valid_Starts_Finishes", Valid_Starts_Finishes_Check'Access),
        (+"Loops_Introduced", Loops_Introduced_Check'Access),
        (+"Is_Sorted", Is_Sorted_Check'Access),
        (+"No_Duplicates", No_Duplicates_Check'Access),

        (+"Include", Include_Check'Access),
        (+"Connect", Connect_Check'Access),
        (+"Prune", Prune_Check'Access),
        (+"Delete_Unreachable", Delete_Unreachable_Check'Access),

        (+"Has_Root", Has_Root_Check'Access),
        (+"Set_Root", Set_Root_Check'Access),
        (+"Clear_Root", Clear_Root_Check'Access),
        (+"Root_Elements", Root_Elements_Check'Access),

        (+"Finish_List", Finish_List_Check'Access),
        (+"Is_Leaf", Is_Leaf_Check'Access),
        (+"Is_Branch", Is_Branch_Check'Access),

        (+"Subgroups", Subgroups_Check'Access),
        (+"First_Index", First_Index_Check'Access),
        (+"Last_Index", Last_Index_Check'Access),
        (+"Length", Length_Check'Access),
        (+"Element", Element_Check'Access),
        (+"Elements", Elements_Check'Access),
        (+"Parent", Parent_Check'Access),
        (+"Finish", Finish_Check'Access),

        (+"Is_Root_Ambiguous", Is_Root_Ambiguous_Check'Access),
        (+"Is_Ambiguous", Is_Ambiguous_Check'Access),
        (+"Ambiguities", Ambiguities_Check'Access),

        (+"Isomorphic", Isomorphic_Check'Access),
        (+"Isomorphic_Subgraph", Isomorphic_Subgraph_Check'Access));


end Rat_Tests.Parse_Graphs;