1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- A D A . C O N T A I N E R S . --
6 -- I N D E F I N I T E _ O R D E R E D _ S E T S --
10 -- Copyright (C) 2004-2007, Free Software Foundation, Inc. --
12 -- GNAT is free software; you can redistribute it and/or modify it under --
13 -- terms of the GNU General Public License as published by the Free Soft- --
14 -- ware Foundation; either version 2, or (at your option) any later ver- --
15 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
16 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
17 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
18 -- for more details. You should have received a copy of the GNU General --
19 -- Public License distributed with GNAT; see file COPYING. If not, write --
20 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
21 -- Boston, MA 02110-1301, USA. --
23 -- As a special exception, if other files instantiate generics from this --
24 -- unit, or you link this unit with other files to produce an executable, --
25 -- this unit does not by itself cause the resulting executable to be --
26 -- covered by the GNU General Public License. This exception does not --
27 -- however invalidate any other reasons why the executable file might be --
28 -- covered by the GNU Public License. --
30 -- This unit was originally developed by Matthew J Heaney. --
31 ------------------------------------------------------------------------------
33 with Ada.Containers.Red_Black_Trees.Generic_Operations;
34 pragma Elaborate_All (Ada.Containers.Red_Black_Trees.Generic_Operations);
36 with Ada.Containers.Red_Black_Trees.Generic_Keys;
37 pragma Elaborate_All (Ada.Containers.Red_Black_Trees.Generic_Keys);
39 with Ada.Containers.Red_Black_Trees.Generic_Set_Operations;
40 pragma Elaborate_All (Ada.Containers.Red_Black_Trees.Generic_Set_Operations);
42 with Ada.Unchecked_Deallocation;
44 package body Ada.Containers.Indefinite_Ordered_Sets is
46 -----------------------
47 -- Local Subprograms --
48 -----------------------
50 function Color (Node : Node_Access) return Color_Type;
51 pragma Inline (Color);
53 function Copy_Node (Source : Node_Access) return Node_Access;
54 pragma Inline (Copy_Node);
56 procedure Free (X : in out Node_Access);
58 procedure Insert_Sans_Hint
59 (Tree : in out Tree_Type;
60 New_Item : Element_Type;
61 Node : out Node_Access;
62 Inserted : out Boolean);
64 procedure Insert_With_Hint
65 (Dst_Tree : in out Tree_Type;
66 Dst_Hint : Node_Access;
67 Src_Node : Node_Access;
68 Dst_Node : out Node_Access);
70 function Is_Greater_Element_Node
72 Right : Node_Access) return Boolean;
73 pragma Inline (Is_Greater_Element_Node);
75 function Is_Less_Element_Node
77 Right : Node_Access) return Boolean;
78 pragma Inline (Is_Less_Element_Node);
80 function Is_Less_Node_Node (L, R : Node_Access) return Boolean;
81 pragma Inline (Is_Less_Node_Node);
83 function Left (Node : Node_Access) return Node_Access;
86 function Parent (Node : Node_Access) return Node_Access;
87 pragma Inline (Parent);
89 procedure Replace_Element
90 (Tree : in out Tree_Type;
94 function Right (Node : Node_Access) return Node_Access;
95 pragma Inline (Right);
97 procedure Set_Color (Node : Node_Access; Color : Color_Type);
98 pragma Inline (Set_Color);
100 procedure Set_Left (Node : Node_Access; Left : Node_Access);
101 pragma Inline (Set_Left);
103 procedure Set_Parent (Node : Node_Access; Parent : Node_Access);
104 pragma Inline (Set_Parent);
106 procedure Set_Right (Node : Node_Access; Right : Node_Access);
107 pragma Inline (Set_Right);
109 --------------------------
110 -- Local Instantiations --
111 --------------------------
113 procedure Free_Element is
114 new Ada.Unchecked_Deallocation (Element_Type, Element_Access);
116 package Tree_Operations is
117 new Red_Black_Trees.Generic_Operations (Tree_Types);
119 procedure Delete_Tree is
120 new Tree_Operations.Generic_Delete_Tree (Free);
122 function Copy_Tree is
123 new Tree_Operations.Generic_Copy_Tree (Copy_Node, Delete_Tree);
127 package Element_Keys is
128 new Red_Black_Trees.Generic_Keys
129 (Tree_Operations => Tree_Operations,
130 Key_Type => Element_Type,
131 Is_Less_Key_Node => Is_Less_Element_Node,
132 Is_Greater_Key_Node => Is_Greater_Element_Node);
135 new Generic_Set_Operations
136 (Tree_Operations => Tree_Operations,
137 Insert_With_Hint => Insert_With_Hint,
138 Copy_Tree => Copy_Tree,
139 Delete_Tree => Delete_Tree,
140 Is_Less => Is_Less_Node_Node,
147 function "<" (Left, Right : Cursor) return Boolean is
149 if Left.Node = null then
150 raise Constraint_Error with "Left cursor equals No_Element";
153 if Right.Node = null then
154 raise Constraint_Error with "Right cursor equals No_Element";
157 if Left.Node.Element = null then
158 raise Program_Error with "Left cursor is bad";
161 if Right.Node.Element = null then
162 raise Program_Error with "Right cursor is bad";
165 pragma Assert (Vet (Left.Container.Tree, Left.Node),
166 "bad Left cursor in ""<""");
168 pragma Assert (Vet (Right.Container.Tree, Right.Node),
169 "bad Right cursor in ""<""");
171 return Left.Node.Element.all < Right.Node.Element.all;
174 function "<" (Left : Cursor; Right : Element_Type) return Boolean is
176 if Left.Node = null then
177 raise Constraint_Error with "Left cursor equals No_Element";
180 if Left.Node.Element = null then
181 raise Program_Error with "Left cursor is bad";
184 pragma Assert (Vet (Left.Container.Tree, Left.Node),
185 "bad Left cursor in ""<""");
187 return Left.Node.Element.all < Right;
190 function "<" (Left : Element_Type; Right : Cursor) return Boolean is
192 if Right.Node = null then
193 raise Constraint_Error with "Right cursor equals No_Element";
196 if Right.Node.Element = null then
197 raise Program_Error with "Right cursor is bad";
200 pragma Assert (Vet (Right.Container.Tree, Right.Node),
201 "bad Right cursor in ""<""");
203 return Left < Right.Node.Element.all;
210 function "=" (Left, Right : Set) return Boolean is
212 function Is_Equal_Node_Node (L, R : Node_Access) return Boolean;
213 pragma Inline (Is_Equal_Node_Node);
216 new Tree_Operations.Generic_Equal (Is_Equal_Node_Node);
218 ------------------------
219 -- Is_Equal_Node_Node --
220 ------------------------
222 function Is_Equal_Node_Node (L, R : Node_Access) return Boolean is
224 return L.Element.all = R.Element.all;
225 end Is_Equal_Node_Node;
227 -- Start of processing for "="
230 return Is_Equal (Left.Tree, Right.Tree);
237 function ">" (Left, Right : Cursor) return Boolean is
239 if Left.Node = null then
240 raise Constraint_Error with "Left cursor equals No_Element";
243 if Right.Node = null then
244 raise Constraint_Error with "Right cursor equals No_Element";
247 if Left.Node.Element = null then
248 raise Program_Error with "Left cursor is bad";
251 if Right.Node.Element = null then
252 raise Program_Error with "Right cursor is bad";
255 pragma Assert (Vet (Left.Container.Tree, Left.Node),
256 "bad Left cursor in "">""");
258 pragma Assert (Vet (Right.Container.Tree, Right.Node),
259 "bad Right cursor in "">""");
261 -- L > R same as R < L
263 return Right.Node.Element.all < Left.Node.Element.all;
266 function ">" (Left : Cursor; Right : Element_Type) return Boolean is
268 if Left.Node = null then
269 raise Constraint_Error with "Left cursor equals No_Element";
272 if Left.Node.Element = null then
273 raise Program_Error with "Left cursor is bad";
276 pragma Assert (Vet (Left.Container.Tree, Left.Node),
277 "bad Left cursor in "">""");
279 return Right < Left.Node.Element.all;
282 function ">" (Left : Element_Type; Right : Cursor) return Boolean is
284 if Right.Node = null then
285 raise Constraint_Error with "Right cursor equals No_Element";
288 if Right.Node.Element = null then
289 raise Program_Error with "Right cursor is bad";
292 pragma Assert (Vet (Right.Container.Tree, Right.Node),
293 "bad Right cursor in "">""");
295 return Right.Node.Element.all < Left;
303 new Tree_Operations.Generic_Adjust (Copy_Tree);
305 procedure Adjust (Container : in out Set) is
307 Adjust (Container.Tree);
314 function Ceiling (Container : Set; Item : Element_Type) return Cursor is
315 Node : constant Node_Access :=
316 Element_Keys.Ceiling (Container.Tree, Item);
323 return Cursor'(Container'Unrestricted_Access, Node);
331 new Tree_Operations.Generic_Clear (Delete_Tree);
333 procedure Clear (Container : in out Set) is
335 Clear (Container.Tree);
342 function Color (Node : Node_Access) return Color_Type is
351 function Contains (Container : Set; Item : Element_Type) return Boolean is
353 return Find (Container, Item) /= No_Element;
360 function Copy_Node (Source : Node_Access) return Node_Access is
361 Element : Element_Access := new Element_Type'(Source.Element.all);
364 return new Node_Type'(Parent => null,
367 Color => Source.Color,
371 Free_Element (Element);
379 procedure Delete (Container : in out Set; Position : in out Cursor) is
381 if Position.Node = null then
382 raise Constraint_Error with "Position cursor equals No_Element";
385 if Position.Node.Element = null then
386 raise Program_Error with "Position cursor is bad";
389 if Position.Container /= Container'Unrestricted_Access then
390 raise Program_Error with "Position cursor designates wrong set";
393 pragma Assert (Vet (Container.Tree, Position.Node),
394 "bad cursor in Delete");
396 Tree_Operations.Delete_Node_Sans_Free (Container.Tree, Position.Node);
397 Free (Position.Node);
398 Position.Container := null;
401 procedure Delete (Container : in out Set; Item : Element_Type) is
403 Element_Keys.Find (Container.Tree, Item);
407 raise Constraint_Error with "attempt to delete element not in set";
410 Tree_Operations.Delete_Node_Sans_Free (Container.Tree, X);
418 procedure Delete_First (Container : in out Set) is
419 Tree : Tree_Type renames Container.Tree;
420 X : Node_Access := Tree.First;
424 Tree_Operations.Delete_Node_Sans_Free (Tree, X);
433 procedure Delete_Last (Container : in out Set) is
434 Tree : Tree_Type renames Container.Tree;
435 X : Node_Access := Tree.Last;
439 Tree_Operations.Delete_Node_Sans_Free (Tree, X);
448 procedure Difference (Target : in out Set; Source : Set) is
450 Set_Ops.Difference (Target.Tree, Source.Tree);
453 function Difference (Left, Right : Set) return Set is
454 Tree : constant Tree_Type :=
455 Set_Ops.Difference (Left.Tree, Right.Tree);
457 return Set'(Controlled with Tree);
464 function Element (Position : Cursor) return Element_Type is
466 if Position.Node = null then
467 raise Constraint_Error with "Position cursor equals No_Element";
470 if Position.Node.Element = null then
471 raise Program_Error with "Position cursor is bad";
474 pragma Assert (Vet (Position.Container.Tree, Position.Node),
475 "bad cursor in Element");
477 return Position.Node.Element.all;
480 -------------------------
481 -- Equivalent_Elements --
482 -------------------------
484 function Equivalent_Elements (Left, Right : Element_Type) return Boolean is
493 end Equivalent_Elements;
495 ---------------------
496 -- Equivalent_Sets --
497 ---------------------
499 function Equivalent_Sets (Left, Right : Set) return Boolean is
501 function Is_Equivalent_Node_Node (L, R : Node_Access) return Boolean;
502 pragma Inline (Is_Equivalent_Node_Node);
504 function Is_Equivalent is
505 new Tree_Operations.Generic_Equal (Is_Equivalent_Node_Node);
507 -----------------------------
508 -- Is_Equivalent_Node_Node --
509 -----------------------------
511 function Is_Equivalent_Node_Node (L, R : Node_Access) return Boolean is
513 if L.Element.all < R.Element.all then
515 elsif R.Element.all < L.Element.all then
520 end Is_Equivalent_Node_Node;
522 -- Start of processing for Equivalent_Sets
525 return Is_Equivalent (Left.Tree, Right.Tree);
532 procedure Exclude (Container : in out Set; Item : Element_Type) is
534 Element_Keys.Find (Container.Tree, Item);
538 Tree_Operations.Delete_Node_Sans_Free (Container.Tree, X);
547 function Find (Container : Set; Item : Element_Type) return Cursor is
548 Node : constant Node_Access :=
549 Element_Keys.Find (Container.Tree, Item);
556 return Cursor'(Container'Unrestricted_Access, Node);
563 function First (Container : Set) return Cursor is
565 if Container.Tree.First = null then
569 return Cursor'(Container'Unrestricted_Access, Container.Tree.First);
576 function First_Element (Container : Set) return Element_Type is
578 if Container.Tree.First = null then
579 raise Constraint_Error with "set is empty";
582 return Container.Tree.First.Element.all;
589 function Floor (Container : Set; Item : Element_Type) return Cursor is
590 Node : constant Node_Access :=
591 Element_Keys.Floor (Container.Tree, Item);
598 return Cursor'(Container'Unrestricted_Access, Node);
605 procedure Free (X : in out Node_Access) is
606 procedure Deallocate is
607 new Ada.Unchecked_Deallocation (Node_Type, Node_Access);
619 Free_Element (X.Element);
634 package body Generic_Keys is
636 -----------------------
637 -- Local Subprograms --
638 -----------------------
640 function Is_Greater_Key_Node
642 Right : Node_Access) return Boolean;
643 pragma Inline (Is_Greater_Key_Node);
645 function Is_Less_Key_Node
647 Right : Node_Access) return Boolean;
648 pragma Inline (Is_Less_Key_Node);
650 --------------------------
651 -- Local Instantiations --
652 --------------------------
655 new Red_Black_Trees.Generic_Keys
656 (Tree_Operations => Tree_Operations,
657 Key_Type => Key_Type,
658 Is_Less_Key_Node => Is_Less_Key_Node,
659 Is_Greater_Key_Node => Is_Greater_Key_Node);
665 function Ceiling (Container : Set; Key : Key_Type) return Cursor is
666 Node : constant Node_Access :=
667 Key_Keys.Ceiling (Container.Tree, Key);
674 return Cursor'(Container'Unrestricted_Access, Node);
681 function Contains (Container : Set; Key : Key_Type) return Boolean is
683 return Find (Container, Key) /= No_Element;
690 procedure Delete (Container : in out Set; Key : Key_Type) is
691 X : Node_Access := Key_Keys.Find (Container.Tree, Key);
695 raise Constraint_Error with "attempt to delete key not in set";
698 Tree_Operations.Delete_Node_Sans_Free (Container.Tree, X);
706 function Element (Container : Set; Key : Key_Type) return Element_Type is
707 Node : constant Node_Access :=
708 Key_Keys.Find (Container.Tree, Key);
712 raise Constraint_Error with "key not in set";
715 return Node.Element.all;
718 ---------------------
719 -- Equivalent_Keys --
720 ---------------------
722 function Equivalent_Keys (Left, Right : Key_Type) return Boolean is
737 procedure Exclude (Container : in out Set; Key : Key_Type) is
738 X : Node_Access := Key_Keys.Find (Container.Tree, Key);
742 Tree_Operations.Delete_Node_Sans_Free (Container.Tree, X);
751 function Find (Container : Set; Key : Key_Type) return Cursor is
752 Node : constant Node_Access :=
753 Key_Keys.Find (Container.Tree, Key);
760 return Cursor'(Container'Unrestricted_Access, Node);
767 function Floor (Container : Set; Key : Key_Type) return Cursor is
768 Node : constant Node_Access :=
769 Key_Keys.Floor (Container.Tree, Key);
776 return Cursor'(Container'Unrestricted_Access, Node);
779 -------------------------
780 -- Is_Greater_Key_Node --
781 -------------------------
783 function Is_Greater_Key_Node
785 Right : Node_Access) return Boolean is
787 return Key (Right.Element.all) < Left;
788 end Is_Greater_Key_Node;
790 ----------------------
791 -- Is_Less_Key_Node --
792 ----------------------
794 function Is_Less_Key_Node
796 Right : Node_Access) return Boolean is
798 return Left < Key (Right.Element.all);
799 end Is_Less_Key_Node;
805 function Key (Position : Cursor) return Key_Type is
807 if Position.Node = null then
808 raise Constraint_Error with
809 "Position cursor equals No_Element";
812 if Position.Node.Element = null then
813 raise Program_Error with
814 "Position cursor is bad";
817 pragma Assert (Vet (Position.Container.Tree, Position.Node),
818 "bad cursor in Key");
820 return Key (Position.Node.Element.all);
828 (Container : in out Set;
830 New_Item : Element_Type)
832 Node : constant Node_Access := Key_Keys.Find (Container.Tree, Key);
836 raise Constraint_Error with
837 "attempt to replace key not in set";
840 Replace_Element (Container.Tree, Node, New_Item);
843 -----------------------------------
844 -- Update_Element_Preserving_Key --
845 -----------------------------------
847 procedure Update_Element_Preserving_Key
848 (Container : in out Set;
850 Process : not null access
851 procedure (Element : in out Element_Type))
853 Tree : Tree_Type renames Container.Tree;
856 if Position.Node = null then
857 raise Constraint_Error with "Position cursor equals No_Element";
860 if Position.Node.Element = null then
861 raise Program_Error with "Position cursor is bad";
864 if Position.Container /= Container'Unrestricted_Access then
865 raise Program_Error with "Position cursor designates wrong set";
868 pragma Assert (Vet (Container.Tree, Position.Node),
869 "bad cursor in Update_Element_Preserving_Key");
872 E : Element_Type renames Position.Node.Element.all;
873 K : constant Key_Type := Key (E);
875 B : Natural renames Tree.Busy;
876 L : Natural renames Tree.Lock;
894 if Equivalent_Keys (K, Key (E)) then
900 X : Node_Access := Position.Node;
902 Tree_Operations.Delete_Node_Sans_Free (Tree, X);
906 raise Program_Error with "key was modified";
907 end Update_Element_Preserving_Key;
915 function Has_Element (Position : Cursor) return Boolean is
917 return Position /= No_Element;
924 procedure Include (Container : in out Set; New_Item : Element_Type) is
931 Insert (Container, New_Item, Position, Inserted);
934 if Container.Tree.Lock > 0 then
935 raise Program_Error with
936 "attempt to tamper with cursors (set is locked)";
939 X := Position.Node.Element;
940 Position.Node.Element := new Element_Type'(New_Item);
950 (Container : in out Set;
951 New_Item : Element_Type;
952 Position : out Cursor;
953 Inserted : out Boolean)
962 Position.Container := Container'Unrestricted_Access;
965 procedure Insert (Container : in out Set; New_Item : Element_Type) is
967 pragma Unreferenced (Position);
972 Insert (Container, New_Item, Position, Inserted);
975 raise Constraint_Error with
976 "attempt to insert element already in set";
980 ----------------------
981 -- Insert_Sans_Hint --
982 ----------------------
984 procedure Insert_Sans_Hint
985 (Tree : in out Tree_Type;
986 New_Item : Element_Type;
987 Node : out Node_Access;
988 Inserted : out Boolean)
990 function New_Node return Node_Access;
991 pragma Inline (New_Node);
993 procedure Insert_Post is
994 new Element_Keys.Generic_Insert_Post (New_Node);
996 procedure Conditional_Insert_Sans_Hint is
997 new Element_Keys.Generic_Conditional_Insert (Insert_Post);
1003 function New_Node return Node_Access is
1004 Element : Element_Access := new Element_Type'(New_Item);
1007 return new Node_Type'(Parent => null,
1010 Color => Red_Black_Trees.Red,
1011 Element => Element);
1014 Free_Element (Element);
1018 -- Start of processing for Insert_Sans_Hint
1021 Conditional_Insert_Sans_Hint
1026 end Insert_Sans_Hint;
1028 ----------------------
1029 -- Insert_With_Hint --
1030 ----------------------
1032 procedure Insert_With_Hint
1033 (Dst_Tree : in out Tree_Type;
1034 Dst_Hint : Node_Access;
1035 Src_Node : Node_Access;
1036 Dst_Node : out Node_Access)
1039 pragma Unreferenced (Success);
1041 function New_Node return Node_Access;
1043 procedure Insert_Post is
1044 new Element_Keys.Generic_Insert_Post (New_Node);
1046 procedure Insert_Sans_Hint is
1047 new Element_Keys.Generic_Conditional_Insert (Insert_Post);
1049 procedure Insert_With_Hint is
1050 new Element_Keys.Generic_Conditional_Insert_With_Hint
1058 function New_Node return Node_Access is
1059 Element : Element_Access :=
1060 new Element_Type'(Src_Node.Element.all);
1065 Node := new Node_Type;
1068 Free_Element (Element);
1072 Node.Element := Element;
1076 -- Start of processing for Insert_With_Hint
1082 Src_Node.Element.all,
1085 end Insert_With_Hint;
1091 procedure Intersection (Target : in out Set; Source : Set) is
1093 Set_Ops.Intersection (Target.Tree, Source.Tree);
1096 function Intersection (Left, Right : Set) return Set is
1097 Tree : constant Tree_Type :=
1098 Set_Ops.Intersection (Left.Tree, Right.Tree);
1100 return Set'(Controlled with Tree);
1107 function Is_Empty (Container : Set) return Boolean is
1109 return Container.Tree.Length = 0;
1112 -----------------------------
1113 -- Is_Greater_Element_Node --
1114 -----------------------------
1116 function Is_Greater_Element_Node
1117 (Left : Element_Type;
1118 Right : Node_Access) return Boolean is
1120 -- e > node same as node < e
1122 return Right.Element.all < Left;
1123 end Is_Greater_Element_Node;
1125 --------------------------
1126 -- Is_Less_Element_Node --
1127 --------------------------
1129 function Is_Less_Element_Node
1130 (Left : Element_Type;
1131 Right : Node_Access) return Boolean is
1133 return Left < Right.Element.all;
1134 end Is_Less_Element_Node;
1136 -----------------------
1137 -- Is_Less_Node_Node --
1138 -----------------------
1140 function Is_Less_Node_Node (L, R : Node_Access) return Boolean is
1142 return L.Element.all < R.Element.all;
1143 end Is_Less_Node_Node;
1149 function Is_Subset (Subset : Set; Of_Set : Set) return Boolean is
1151 return Set_Ops.Is_Subset (Subset => Subset.Tree, Of_Set => Of_Set.Tree);
1160 Process : not null access procedure (Position : Cursor))
1162 procedure Process_Node (Node : Node_Access);
1163 pragma Inline (Process_Node);
1165 procedure Local_Iterate is
1166 new Tree_Operations.Generic_Iteration (Process_Node);
1172 procedure Process_Node (Node : Node_Access) is
1174 Process (Cursor'(Container'Unrestricted_Access, Node));
1177 T : Tree_Type renames Container.Tree'Unrestricted_Access.all;
1178 B : Natural renames T.Busy;
1180 -- Start of prccessing for Iterate
1200 function Last (Container : Set) return Cursor is
1202 if Container.Tree.Last = null then
1206 return Cursor'(Container'Unrestricted_Access, Container.Tree.Last);
1213 function Last_Element (Container : Set) return Element_Type is
1215 if Container.Tree.Last = null then
1216 raise Constraint_Error with "set is empty";
1219 return Container.Tree.Last.Element.all;
1226 function Left (Node : Node_Access) return Node_Access is
1235 function Length (Container : Set) return Count_Type is
1237 return Container.Tree.Length;
1245 new Tree_Operations.Generic_Move (Clear);
1247 procedure Move (Target : in out Set; Source : in out Set) is
1249 Move (Target => Target.Tree, Source => Source.Tree);
1256 procedure Next (Position : in out Cursor) is
1258 Position := Next (Position);
1261 function Next (Position : Cursor) return Cursor is
1263 if Position = No_Element then
1267 if Position.Node.Element = null then
1268 raise Program_Error with "Position cursor is bad";
1271 pragma Assert (Vet (Position.Container.Tree, Position.Node),
1272 "bad cursor in Next");
1275 Node : constant Node_Access :=
1276 Tree_Operations.Next (Position.Node);
1283 return Cursor'(Position.Container, Node);
1291 function Overlap (Left, Right : Set) return Boolean is
1293 return Set_Ops.Overlap (Left.Tree, Right.Tree);
1300 function Parent (Node : Node_Access) return Node_Access is
1309 procedure Previous (Position : in out Cursor) is
1311 Position := Previous (Position);
1314 function Previous (Position : Cursor) return Cursor is
1316 if Position = No_Element then
1320 if Position.Node.Element = null then
1321 raise Program_Error with "Position cursor is bad";
1324 pragma Assert (Vet (Position.Container.Tree, Position.Node),
1325 "bad cursor in Previous");
1328 Node : constant Node_Access :=
1329 Tree_Operations.Previous (Position.Node);
1336 return Cursor'(Position.Container, Node);
1344 procedure Query_Element
1346 Process : not null access procedure (Element : Element_Type))
1349 if Position.Node = null then
1350 raise Constraint_Error with "Position cursor equals No_Element";
1353 if Position.Node.Element = null then
1354 raise Program_Error with "Position cursor is bad";
1357 pragma Assert (Vet (Position.Container.Tree, Position.Node),
1358 "bad cursor in Query_Element");
1361 T : Tree_Type renames Position.Container.Tree;
1363 B : Natural renames T.Busy;
1364 L : Natural renames T.Lock;
1371 Process (Position.Node.Element.all);
1389 (Stream : not null access Root_Stream_Type'Class;
1390 Container : out Set)
1393 (Stream : not null access Root_Stream_Type'Class) return Node_Access;
1394 pragma Inline (Read_Node);
1397 new Tree_Operations.Generic_Read (Clear, Read_Node);
1404 (Stream : not null access Root_Stream_Type'Class) return Node_Access
1406 Node : Node_Access := new Node_Type;
1409 Node.Element := new Element_Type'(Element_Type'Input (Stream));
1414 Free (Node); -- Note that Free deallocates elem too
1418 -- Start of processing for Read
1421 Read (Stream, Container.Tree);
1425 (Stream : not null access Root_Stream_Type'Class;
1429 raise Program_Error with "attempt to stream set cursor";
1436 procedure Replace (Container : in out Set; New_Item : Element_Type) is
1437 Node : constant Node_Access :=
1438 Element_Keys.Find (Container.Tree, New_Item);
1441 pragma Warnings (Off, X);
1445 raise Constraint_Error with "attempt to replace element not in set";
1448 if Container.Tree.Lock > 0 then
1449 raise Program_Error with
1450 "attempt to tamper with cursors (set is locked)";
1454 Node.Element := new Element_Type'(New_Item);
1458 ---------------------
1459 -- Replace_Element --
1460 ---------------------
1462 procedure Replace_Element
1463 (Tree : in out Tree_Type;
1465 Item : Element_Type)
1467 pragma Assert (Node /= null);
1468 pragma Assert (Node.Element /= null);
1470 function New_Node return Node_Access;
1471 pragma Inline (New_Node);
1473 procedure Local_Insert_Post is
1474 new Element_Keys.Generic_Insert_Post (New_Node);
1476 procedure Local_Insert_Sans_Hint is
1477 new Element_Keys.Generic_Conditional_Insert (Local_Insert_Post);
1479 procedure Local_Insert_With_Hint is
1480 new Element_Keys.Generic_Conditional_Insert_With_Hint
1482 Local_Insert_Sans_Hint);
1488 function New_Node return Node_Access is
1490 Node.Element := new Element_Type'(Item); -- OK if fails
1492 Node.Parent := null;
1500 Result : Node_Access;
1503 X : Element_Access := Node.Element;
1505 -- Start of processing for Insert
1508 if Item < Node.Element.all
1509 or else Node.Element.all < Item
1514 if Tree.Lock > 0 then
1515 raise Program_Error with
1516 "attempt to tamper with cursors (set is locked)";
1519 Node.Element := new Element_Type'(Item);
1525 Hint := Element_Keys.Ceiling (Tree, Item);
1530 elsif Item < Hint.Element.all then
1532 if Tree.Lock > 0 then
1533 raise Program_Error with
1534 "attempt to tamper with cursors (set is locked)";
1537 Node.Element := new Element_Type'(Item);
1544 pragma Assert (not (Hint.Element.all < Item));
1545 raise Program_Error with "attempt to replace existing element";
1548 Tree_Operations.Delete_Node_Sans_Free (Tree, Node); -- Checks busy-bit
1550 Local_Insert_With_Hint
1555 Inserted => Inserted);
1557 pragma Assert (Inserted);
1558 pragma Assert (Result = Node);
1561 end Replace_Element;
1563 procedure Replace_Element
1564 (Container : in out Set;
1566 New_Item : Element_Type)
1569 if Position.Node = null then
1570 raise Constraint_Error with "Position cursor equals No_Element";
1573 if Position.Node.Element = null then
1574 raise Program_Error with "Position cursor is bad";
1577 if Position.Container /= Container'Unrestricted_Access then
1578 raise Program_Error with "Position cursor designates wrong set";
1581 pragma Assert (Vet (Container.Tree, Position.Node),
1582 "bad cursor in Replace_Element");
1584 Replace_Element (Container.Tree, Position.Node, New_Item);
1585 end Replace_Element;
1587 ---------------------
1588 -- Reverse_Iterate --
1589 ---------------------
1591 procedure Reverse_Iterate
1593 Process : not null access procedure (Position : Cursor))
1595 procedure Process_Node (Node : Node_Access);
1596 pragma Inline (Process_Node);
1598 procedure Local_Reverse_Iterate is
1599 new Tree_Operations.Generic_Reverse_Iteration (Process_Node);
1605 procedure Process_Node (Node : Node_Access) is
1607 Process (Cursor'(Container'Unrestricted_Access, Node));
1610 T : Tree_Type renames Container.Tree'Unrestricted_Access.all;
1611 B : Natural renames T.Busy;
1613 -- Start of processing for Reverse_Iterate
1619 Local_Reverse_Iterate (T);
1627 end Reverse_Iterate;
1633 function Right (Node : Node_Access) return Node_Access is
1642 procedure Set_Color (Node : Node_Access; Color : Color_Type) is
1644 Node.Color := Color;
1651 procedure Set_Left (Node : Node_Access; Left : Node_Access) is
1660 procedure Set_Parent (Node : Node_Access; Parent : Node_Access) is
1662 Node.Parent := Parent;
1669 procedure Set_Right (Node : Node_Access; Right : Node_Access) is
1671 Node.Right := Right;
1674 --------------------------
1675 -- Symmetric_Difference --
1676 --------------------------
1678 procedure Symmetric_Difference (Target : in out Set; Source : Set) is
1680 Set_Ops.Symmetric_Difference (Target.Tree, Source.Tree);
1681 end Symmetric_Difference;
1683 function Symmetric_Difference (Left, Right : Set) return Set is
1684 Tree : constant Tree_Type :=
1685 Set_Ops.Symmetric_Difference (Left.Tree, Right.Tree);
1687 return Set'(Controlled with Tree);
1688 end Symmetric_Difference;
1694 function To_Set (New_Item : Element_Type) return Set is
1699 pragma Unreferenced (Node, Inserted);
1702 Insert_Sans_Hint (Tree, New_Item, Node, Inserted);
1703 return Set'(Controlled with Tree);
1710 procedure Union (Target : in out Set; Source : Set) is
1712 Set_Ops.Union (Target.Tree, Source.Tree);
1715 function Union (Left, Right : Set) return Set is
1716 Tree : constant Tree_Type :=
1717 Set_Ops.Union (Left.Tree, Right.Tree);
1719 return Set'(Controlled with Tree);
1727 (Stream : not null access Root_Stream_Type'Class;
1730 procedure Write_Node
1731 (Stream : not null access Root_Stream_Type'Class;
1732 Node : Node_Access);
1733 pragma Inline (Write_Node);
1736 new Tree_Operations.Generic_Write (Write_Node);
1742 procedure Write_Node
1743 (Stream : not null access Root_Stream_Type'Class;
1747 Element_Type'Output (Stream, Node.Element.all);
1750 -- Start of processing for Write
1753 Write (Stream, Container.Tree);
1757 (Stream : not null access Root_Stream_Type'Class;
1761 raise Program_Error with "attempt to stream set cursor";
1764 end Ada.Containers.Indefinite_Ordered_Sets;