1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
|
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;
|
