1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- A D A . C O N T A I N E R S . D O U B L Y _ L I N K E D _ L I S T S --
9 -- Copyright (C) 2004-2006, Free Software Foundation, Inc. --
11 -- This specification is derived from the Ada Reference Manual for use with --
12 -- GNAT. The copyright notice above, and the license provisions that follow --
13 -- apply solely to the contents of the part following the private keyword. --
15 -- GNAT is free software; you can redistribute it and/or modify it under --
16 -- terms of the GNU General Public License as published by the Free Soft- --
17 -- ware Foundation; either version 2, or (at your option) any later ver- --
18 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
19 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
20 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
21 -- for more details. You should have received a copy of the GNU General --
22 -- Public License distributed with GNAT; see file COPYING. If not, write --
23 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
24 -- Boston, MA 02110-1301, USA. --
26 -- As a special exception, if other files instantiate generics from this --
27 -- unit, or you link this unit with other files to produce an executable, --
28 -- this unit does not by itself cause the resulting executable to be --
29 -- covered by the GNU General Public License. This exception does not --
30 -- however invalidate any other reasons why the executable file might be --
31 -- covered by the GNU Public License. --
33 -- This unit was originally developed by Matthew J Heaney. --
34 ------------------------------------------------------------------------------
36 with Ada
.Finalization
;
40 type Element_Type
is private;
42 with function "=" (Left
, Right
: Element_Type
)
45 package Ada
.Containers
.Doubly_Linked_Lists
is
48 type List
is tagged private;
49 pragma Preelaborable_Initialization
(List
);
51 type Cursor
is private;
52 pragma Preelaborable_Initialization
(Cursor
);
54 Empty_List
: constant List
;
56 No_Element
: constant Cursor
;
58 function "=" (Left
, Right
: List
) return Boolean;
60 function Length
(Container
: List
) return Count_Type
;
62 function Is_Empty
(Container
: List
) return Boolean;
64 procedure Clear
(Container
: in out List
);
66 function Element
(Position
: Cursor
) return Element_Type
;
68 procedure Replace_Element
69 (Container
: in out List
;
71 New_Item
: Element_Type
);
73 procedure Query_Element
75 Process
: not null access procedure (Element
: Element_Type
));
77 procedure Update_Element
78 (Container
: in out List
;
80 Process
: not null access procedure (Element
: in out Element_Type
));
83 (Target
: in out List
;
84 Source
: in out List
);
87 (Container
: in out List
;
89 New_Item
: Element_Type
;
90 Count
: Count_Type
:= 1);
93 (Container
: in out List
;
95 New_Item
: Element_Type
;
96 Position
: out Cursor
;
97 Count
: Count_Type
:= 1);
100 (Container
: in out List
;
102 Position
: out Cursor
;
103 Count
: Count_Type
:= 1);
106 (Container
: in out List
;
107 New_Item
: Element_Type
;
108 Count
: Count_Type
:= 1);
111 (Container
: in out List
;
112 New_Item
: Element_Type
;
113 Count
: Count_Type
:= 1);
116 (Container
: in out List
;
117 Position
: in out Cursor
;
118 Count
: Count_Type
:= 1);
120 procedure Delete_First
121 (Container
: in out List
;
122 Count
: Count_Type
:= 1);
124 procedure Delete_Last
125 (Container
: in out List
;
126 Count
: Count_Type
:= 1);
128 procedure Reverse_Elements
(Container
: in out List
);
131 (Container
: in out List
;
135 (Container
: in out List
;
139 (Target
: in out List
;
141 Source
: in out List
);
144 (Target
: in out List
;
146 Source
: in out List
;
147 Position
: in out Cursor
);
150 (Container
: in out List
;
154 function First
(Container
: List
) return Cursor
;
156 function First_Element
(Container
: List
) return Element_Type
;
158 function Last
(Container
: List
) return Cursor
;
160 function Last_Element
(Container
: List
) return Element_Type
;
162 function Next
(Position
: Cursor
) return Cursor
;
164 procedure Next
(Position
: in out Cursor
);
166 function Previous
(Position
: Cursor
) return Cursor
;
168 procedure Previous
(Position
: in out Cursor
);
173 Position
: Cursor
:= No_Element
) return Cursor
;
175 function Reverse_Find
178 Position
: Cursor
:= No_Element
) return Cursor
;
182 Item
: Element_Type
) return Boolean;
184 function Has_Element
(Position
: Cursor
) return Boolean;
188 Process
: not null access procedure (Position
: Cursor
));
190 procedure Reverse_Iterate
192 Process
: not null access procedure (Position
: Cursor
));
195 with function "<" (Left
, Right
: Element_Type
) return Boolean is <>;
196 package Generic_Sorting
is
198 function Is_Sorted
(Container
: List
) return Boolean;
200 procedure Sort
(Container
: in out List
);
202 procedure Merge
(Target
, Source
: in out List
);
208 type Node_Access
is access Node_Type
;
212 Element
: Element_Type
;
217 use Ada
.Finalization
;
220 new Controlled
with record
223 Length
: Count_Type
:= 0;
228 procedure Adjust
(Container
: in out List
);
230 procedure Finalize
(Container
: in out List
) renames Clear
;
235 (Stream
: not null access Root_Stream_Type
'Class;
238 for List
'Read use Read
;
241 (Stream
: not null access Root_Stream_Type
'Class;
244 for List
'Write use Write
;
246 Empty_List
: constant List
:= (Controlled
with null, null, 0, 0, 0);
248 type List_Access
is access constant List
;
249 for List_Access
'Storage_Size use 0;
253 Container
: List_Access
;
258 (Stream
: not null access Root_Stream_Type
'Class;
261 for Cursor
'Read use Read
;
264 (Stream
: not null access Root_Stream_Type
'Class;
267 for Cursor
'Write use Write
;
269 No_Element
: constant Cursor
:= Cursor
'(null, null);
271 end Ada.Containers.Doubly_Linked_Lists;