1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- A D A . C O N T A I N E R S . O R D E R E D _ M A P S --
9 -- Copyright (C) 2004-2005 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.Containers.Red_Black_Trees;
37 with Ada.Finalization;
42 type Key_Type is private;
44 type Element_Type is private;
46 with function "<" (Left, Right : Key_Type) return Boolean is <>;
47 with function "=" (Left, Right : Element_Type) return Boolean is <>;
49 package Ada.Containers.Ordered_Maps is
52 type Map is tagged private;
54 type Cursor is private;
56 Empty_Map : constant Map;
58 No_Element : constant Cursor;
60 function "=" (Left, Right : Map) return Boolean;
62 function Length (Container : Map) return Count_Type;
64 function Is_Empty (Container : Map) return Boolean;
66 procedure Clear (Container : in out Map);
68 function Key (Position : Cursor) return Key_Type;
70 function Element (Position : Cursor) return Element_Type;
72 procedure Query_Element
74 Process : not null access
75 procedure (Key : Key_Type; Element : Element_Type));
77 procedure Update_Element
79 Process : not null access
80 procedure (Key : Key_Type; Element : in out Element_Type));
82 procedure Replace_Element (Position : Cursor; By : in Element_Type);
84 procedure Move (Target : in out Map; Source : in out Map);
87 (Container : in out Map;
89 New_Item : Element_Type;
90 Position : out Cursor;
91 Inserted : out Boolean);
94 (Container : in out Map;
96 Position : out Cursor;
97 Inserted : out Boolean);
100 (Container : in out Map;
102 New_Item : Element_Type);
105 (Container : in out Map;
107 New_Item : Element_Type);
110 (Container : in out Map;
112 New_Item : Element_Type);
114 procedure Delete (Container : in out Map; Key : Key_Type);
116 procedure Delete (Container : in out Map; Position : in out Cursor);
118 procedure Delete_First (Container : in out Map);
120 procedure Delete_Last (Container : in out Map);
122 procedure Exclude (Container : in out Map; Key : Key_Type);
124 function Contains (Container : Map; Key : Key_Type) return Boolean;
126 function Find (Container : Map; Key : Key_Type) return Cursor;
128 function Element (Container : Map; Key : Key_Type) return Element_Type;
130 function Floor (Container : Map; Key : Key_Type) return Cursor;
132 function Ceiling (Container : Map; Key : Key_Type) return Cursor;
134 function First (Container : Map) return Cursor;
136 function First_Key (Container : Map) return Key_Type;
138 function First_Element (Container : Map) return Element_Type;
140 function Last (Container : Map) return Cursor;
142 function Last_Key (Container : Map) return Key_Type;
144 function Last_Element (Container : Map) return Element_Type;
146 function Next (Position : Cursor) return Cursor;
148 procedure Next (Position : in out Cursor);
150 function Previous (Position : Cursor) return Cursor;
152 procedure Previous (Position : in out Cursor);
154 function Has_Element (Position : Cursor) return Boolean;
156 function "<" (Left, Right : Cursor) return Boolean;
158 function ">" (Left, Right : Cursor) return Boolean;
160 function "<" (Left : Cursor; Right : Key_Type) return Boolean;
162 function ">" (Left : Cursor; Right : Key_Type) return Boolean;
164 function "<" (Left : Key_Type; Right : Cursor) return Boolean;
166 function ">" (Left : Key_Type; Right : Cursor) return Boolean;
170 Process : not null access procedure (Position : Cursor));
172 procedure Reverse_Iterate
174 Process : not null access procedure (Position : Cursor));
179 type Node_Access is access Node_Type;
181 type Node_Type is limited record
182 Parent : Node_Access;
185 Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
187 Element : Element_Type;
190 package Tree_Types is new Red_Black_Trees.Generic_Tree_Types
194 type Map is new Ada.Finalization.Controlled with record
195 Tree : Tree_Types.Tree_Type;
198 procedure Adjust (Container : in out Map);
200 procedure Finalize (Container : in out Map) renames Clear;
204 use Ada.Finalization;
206 type Map_Access is access Map;
207 for Map_Access'Storage_Size use 0;
209 type Cursor is record
210 Container : Map_Access;
214 No_Element : constant Cursor := Cursor'(null, null);
219 (Stream : access Root_Stream_Type'Class;
222 for Map'Write use Write;
225 (Stream : access Root_Stream_Type'Class;
226 Container : out Map);
228 for Map'Read use Read;
230 Empty_Map : constant Map :=
231 (Controlled with Tree => (First => null,
238 end Ada.Containers.Ordered_Maps;