src/packrat-graphs.ads


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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235


generic
    type Label_Enum is (<>);
    type Element is private;
    type Element_Array is array (Positive range <>) of Element;
    with package My_Interfaces is new Interfaces (Label_Enum, Element, Element_Array);
package Packrat.Graphs is


    type Cursor is new My_Interfaces.Cursor with private;

    type Parse_Graph is new My_Interfaces.Graph with private;


    function Is_Nothing
           (Position : in Cursor)
        return Boolean;


    function Depth
           (Position : in Cursor)
        return Natural;

    function Is_Root
           (Position : in Cursor)
        return Boolean;

    function Is_Branch
           (Position : in Cursor)
        return Boolean;

    function Is_Leaf
           (Position : in Cursor)
        return Boolean;

    function Label
           (Position : in Cursor)
        return Label_Enum;

    function Elements
           (Position : in Cursor)
        return Element_Array;


    function Start
           (Position : in Cursor)
        return Positive;

    function Finish
           (Position : in Cursor)
        return Natural;

    function Choices
           (Position : in Cursor)
        return Natural;


    function Parent
           (Position : in Cursor)
        return Cursor;

    function Child_Count
           (Position : in Cursor;
            Choice   : in Positive)
        return Natural;

    function Child_Count
           (Position : in Cursor)
        return Natural;

    function All_Child_Count
           (Position : in Cursor)
        return Natural;

    function First_Child
           (Position : in Cursor;
            Choice   : in Positive)
        return Cursor;

    function Last_Child
           (Position : in Cursor;
            Choice   : in Positive)
        return Cursor;

    function First_Child
           (Position : in Cursor)
        return Cursor;

    function Last_Child
           (Position : in Cursor)
        return Cursor;

    function Next_Sibling
           (Position : in Cursor)
        return Cursor;

    function Prev_Sibling
           (Position : in Cursor)
        return Cursor;

    procedure Delete_Children
           (Position : in out Cursor;
            Choice   : in     Positive);

    procedure Delete_Children
           (Position : in out Cursor);

    procedure Delete_All_Children
           (Position : in out Cursor);


    function Equal_Subgraph
           (Left, Right : in Cursor)
        return Boolean;

    function Subgraph_Node_Count
           (Position : in Cursor)
        return Natural;

    function Find_In_Subgraph
           (Position : in Cursor;
            Item     : in Element_Array)
        return Cursor;


    function Contains
           (Container : in Parse_Graph;
            Position  : in My_Interfaces.Cursor'Class)
        return Boolean;


    function Leaf
           (New_Item : in Element_Array;
            Start    : in Positive;
            Finish   : in Natural)
        return Parse_Graph;

    function Branch
           (Label  : in Label_Enum;
            Start  : in Positive;
            Finish : in Natural)
        return Parse_Graph;


    function Is_Empty
           (Container : in Parse_Graph)
        return Boolean;

    function Is_Ambiguous
           (Container : in Parse_Graph)
        return Boolean;

    function Node_Count
           (Container : in Parse_Graph)
        return Natural;


    function Root_Count
           (Container : in Parse_Graph)
        return Natural;

    function Root
           (Container : in Parse_Graph;
            Index     : in Positive)
        return My_Interfaces.Cursor'Class;


    procedure Append
           (Container : in out Parse_Graph;
            Addition  : in     Parse_Graph);

    procedure Prepend
           (Container : in out Parse_Graph;
            Addition  : in     Parse_Graph);

    procedure Attach_Choice
           (Container : in out Parse_Graph;
            Position  : in     My_Interfaces.Cursor'Class;
            Addition  : in     Parse_Graph);


    procedure Clear
           (Container : in out Parse_Graph);

    procedure Delete_Position
           (Container : in out Parse_Graph;
            Position  : in out My_Interfaces.Cursor'Class);


    function Find
           (Container : in Parse_Graph;
            Item      : in Element_Array)
        return My_Interfaces.Cursor'Class;


private


    type Cursor is new My_Interfaces.Cursor with null record;


    type Parse_Graph is new My_Interfaces.Graph with null record;


end Packrat.Graphs;