1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- ADA.CONTAINERS.INDEFINITE_DOUBLY_LINKED_LISTS --
9 -- Copyright (C) 2004-2011, 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 3, 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. --
22 -- As a special exception under Section 7 of GPL version 3, you are granted --
23 -- additional permissions described in the GCC Runtime Library Exception, --
24 -- version 3.1, as published by the Free Software Foundation. --
26 -- You should have received a copy of the GNU General Public License and --
27 -- a copy of the GCC Runtime Library Exception along with this program; --
28 -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
29 -- <http://www.gnu.org/licenses/>. --
31 -- This unit was originally developed by Matthew J Heaney. --
32 ------------------------------------------------------------------------------
34 with Ada.Iterator_Interfaces;
35 with Ada.Streams; use Ada.Streams;
37 private with Ada.Finalization;
40 type Element_Type (<>) is private;
42 with function "=" (Left, Right : Element_Type)
45 package Ada.Containers.Indefinite_Doubly_Linked_Lists is
49 type List is tagged private with
50 Constant_Indexing => Constant_Reference,
51 Variable_Indexing => Reference,
52 Default_Iterator => Iterate,
53 Iterator_Element => Element_Type;
55 pragma Preelaborable_Initialization (List);
57 type Cursor is private;
58 pragma Preelaborable_Initialization (Cursor);
60 Empty_List : constant List;
62 No_Element : constant Cursor;
64 function Has_Element (Position : Cursor) return Boolean;
66 package List_Iterator_Interfaces is new
67 Ada.Iterator_Interfaces (Cursor, Has_Element);
69 function "=" (Left, Right : List) return Boolean;
71 function Length (Container : List) return Count_Type;
73 function Is_Empty (Container : List) return Boolean;
75 procedure Clear (Container : in out List);
77 function Element (Position : Cursor) return Element_Type;
79 procedure Replace_Element
80 (Container : in out List;
82 New_Item : Element_Type);
84 procedure Query_Element
86 Process : not null access procedure (Element : Element_Type));
88 procedure Update_Element
89 (Container : in out List;
91 Process : not null access procedure (Element : in out Element_Type));
93 procedure Assign (Target : in out List; Source : List);
95 function Copy (Source : List) return List;
98 (Target : in out List;
99 Source : in out List);
102 (Container : in out List;
104 New_Item : Element_Type;
105 Count : Count_Type := 1);
108 (Container : in out List;
110 New_Item : Element_Type;
111 Position : out Cursor;
112 Count : Count_Type := 1);
115 (Container : in out List;
116 New_Item : Element_Type;
117 Count : Count_Type := 1);
120 (Container : in out List;
121 New_Item : Element_Type;
122 Count : Count_Type := 1);
125 (Container : in out List;
126 Position : in out Cursor;
127 Count : Count_Type := 1);
129 procedure Delete_First
130 (Container : in out List;
131 Count : Count_Type := 1);
133 procedure Delete_Last
134 (Container : in out List;
135 Count : Count_Type := 1);
137 procedure Reverse_Elements (Container : in out List);
139 procedure Swap (Container : in out List; I, J : Cursor);
141 procedure Swap_Links (Container : in out List; I, J : Cursor);
144 (Target : in out List;
146 Source : in out List);
149 (Target : in out List;
151 Source : in out List;
152 Position : in out Cursor);
155 (Container : in out List;
159 function First (Container : List) return Cursor;
161 function First_Element (Container : List) return Element_Type;
163 function Last (Container : List) return Cursor;
165 function Last_Element (Container : List) return Element_Type;
167 function Next (Position : Cursor) return Cursor;
169 procedure Next (Position : in out Cursor);
171 function Previous (Position : Cursor) return Cursor;
173 procedure Previous (Position : in out Cursor);
178 Position : Cursor := No_Element) return Cursor;
180 function Reverse_Find
183 Position : Cursor := No_Element) return Cursor;
187 Item : Element_Type) return Boolean;
191 Process : not null access procedure (Position : Cursor));
193 procedure Reverse_Iterate
195 Process : not null access procedure (Position : Cursor));
199 return List_Iterator_Interfaces.Reversible_Iterator'class;
204 return List_Iterator_Interfaces.Reversible_Iterator'class;
206 type Constant_Reference_Type
207 (Element : not null access constant Element_Type) is private
209 Implicit_Dereference => Element;
212 (Stream : not null access Root_Stream_Type'Class;
213 Item : Constant_Reference_Type);
215 for Constant_Reference_Type'Write use Write;
218 (Stream : not null access Root_Stream_Type'Class;
219 Item : out Constant_Reference_Type);
221 for Constant_Reference_Type'Read use Read;
223 type Reference_Type (Element : not null access Element_Type) is
226 Implicit_Dereference => Element;
229 (Stream : not null access Root_Stream_Type'Class;
230 Item : Reference_Type);
232 for Reference_Type'Write use Write;
235 (Stream : not null access Root_Stream_Type'Class;
236 Item : out Reference_Type);
238 for Reference_Type'Read use Read;
240 function Constant_Reference
242 Position : Cursor) -- SHOULD BE ALIASED ???
243 return Constant_Reference_Type;
247 Position : Cursor) -- SHOULD BE ALIASED ???
248 return Reference_Type;
251 with function "<" (Left, Right : Element_Type) return Boolean is <>;
252 package Generic_Sorting is
254 function Is_Sorted (Container : List) return Boolean;
256 procedure Sort (Container : in out List);
258 procedure Merge (Target, Source : in out List);
264 pragma Inline (Next);
265 pragma Inline (Previous);
268 type Node_Access is access Node_Type;
270 type Element_Access is access Element_Type;
274 Element : Element_Access;
279 use Ada.Finalization;
282 new Controlled with record
285 Length : Count_Type := 0;
290 type Constant_Reference_Type
291 (Element : not null access constant Element_Type) is null record;
294 (Element : not null access Element_Type) is null record;
296 overriding procedure Adjust (Container : in out List);
298 overriding procedure Finalize (Container : in out List) renames Clear;
301 (Stream : not null access Root_Stream_Type'Class;
304 for List'Read use Read;
307 (Stream : not null access Root_Stream_Type'Class;
310 for List'Write use Write;
312 type List_Access is access constant List;
313 for List_Access'Storage_Size use 0;
317 Container : List_Access;
322 (Stream : not null access Root_Stream_Type'Class;
325 for Cursor'Read use Read;
328 (Stream : not null access Root_Stream_Type'Class;
331 for Cursor'Write use Write;
333 Empty_List : constant List := List'(Controlled with null, null, 0, 0, 0);
335 No_Element : constant Cursor := Cursor'(null, null);
337 end Ada.Containers.Indefinite_Doubly_Linked_Lists;