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
|
with Unit_Tests;
use Unit_Tests;
package Graph_Tests.Search is
function Find_Check return Test_Result;
function Find_Subgraph_Check return Test_Result;
function Contains_Check return Test_Result;
function Contains_Label_Check return Test_Result;
function Contains_Subgraph_Check return Test_Result;
function Contains_Label_Subgraph_Check return Test_Result;
function Contains_Path_Check return Test_Result;
function Contains_Path_Subgraph_Check return Test_Result;
function Iterate_Check return Test_Result;
function Iterate_Subgraph_Check return Test_Result;
function Iterate_By_Check return Test_Result;
Tests : Test_Array :=
((+"Find", Find_Check'Access),
(+"Find_In_Subgraph", Find_Subgraph_Check'Access),
(+"Contains", Contains_Check'Access),
(+"Contains_Label", Contains_Label_Check'Access),
(+"Contains_In_Subgraph", Contains_Subgraph_Check'Access),
(+"Contains_Label_In_Subgraph", Contains_Label_Subgraph_Check'Access),
(+"Contains_Path", Contains_Path_Check'Access),
(+"Contains_Path_In_Subgraph", Contains_Path_Subgraph_Check'Access),
(+"Iterate", Iterate_Check'Access),
(+"Iterate_Subgraph", Iterate_Subgraph_Check'Access),
(+"Iterate_By", Iterate_By_Check'Access));
end Graph_Tests.Search;
|
