a-rbtgso.adb, [...]: New files.

	* a-rbtgso.adb, a-crbtgo.ads, a-crbtgo.adb, a-crbtgk.ads,
	a-crbtgk.adb, a-crbltr.ads, a-coprnu.ads, a-coprnu.adb,
	a-coorse.ads, a-coorse.adb, a-convec.ads, a-convec.adb,
	a-contai.ads, a-coinve.ads, a-coinve.adb, a-cohata.ads,
	a-cohama.ads, a-cohama.adb, a-ciorse.ads, a-ciorse.adb,
	a-cihama.ads, a-cihama.adb, a-cidlli.ads, a-cidlli.adb,
	a-chtgop.ads, a-chtgop.adb, a-cgcaso.ads, a-cgcaso.adb,
	a-cgarso.ads, a-cgarso.adb, a-cdlili.ads, a-cdlili.adb,
	a-cgaaso.adb, a-coormu.adb, a-ciormu.adb, a-cihase.adb,
	a-cihase.ads, a-cohase.adb, a-cohase.ads, a-ciorma.ads,
	a-coorma.ads, a-swunha.ads, a-stunha.ads, a-ciormu.ads,
	a-coormu.ads, a-rbtgso.ads, a-swunha.adb, a-stunha.adb,
	a-cgaaso.ads, a-ciorma.adb, a-coorma.adb, a-secain.adb,
	a-secain.ads, a-slcain.ads, a-slcain.adb, a-shcain.ads,
	a-shcain.adb, a-chtgke.ads, a-chtgke.adb, a-stwiha.ads,
	a-stwiha.adb, a-strhas.ads, a-strhas.adb, a-chzla1.ads,
	a-chzla9.ads, a-lfztio.ads, a-liztio.ads, a-llfzti.ads,
	a-llizti.ads, a-sfztio.ads, a-siztio.ads, a-ssizti.ads,
	a-stzbou.adb, a-stzbou.ads, a-stzfix.adb, a-stzfix.ads,
	a-stzhas.adb, a-stzhas.ads, a-stzmap.adb, a-stzmap.ads,
	a-stzsea.adb, a-stzsea.ads, a-stzsup.adb, a-stzsup.ads,
	a-stzunb.adb, a-stzunb.ads, a-swunau.adb, a-swunau.ads,
	a-szmzco.ads, a-szunau.adb, a-szunau.ads, a-szunha.adb,
	a-szunha.ads, a-szuzti.adb, a-szuzti.ads, a-tiunio.ads,
	a-wwunio.ads, a-ztcoau.adb, a-ztcoau.ads, a-ztcoio.adb,
	a-ztcoio.ads, a-ztcstr.adb, a-ztcstr.ads, a-ztdeau.adb,
	a-ztdeau.ads, a-ztdeio.adb, a-ztdeio.ads, a-ztedit.adb,
	a-ztedit.ads, a-ztenau.adb, a-ztenau.ads, a-ztenio.adb,
	a-ztenio.ads, a-ztexio.adb, a-ztexio.ads, a-ztfiio.adb,
	a-ztfiio.ads, a-ztflau.adb, a-ztflau.ads, a-ztflio.adb,
	a-ztflio.ads, a-ztgeau.adb, a-ztgeau.ads, a-ztinau.adb,
	a-ztinau.ads, a-ztinio.adb, a-ztinio.ads, a-ztmoau.adb,
	a-ztmoau.ads, a-ztmoio.adb, a-ztmoio.ads, a-zttest.adb,
	a-zttest.ads, a-zzunio.ads: New files. Part of new Ada 2005
	library.

From-SVN: r94764

1 files changed, 138 insertions, 0 deletions

diff --git a/gcc/ada/a-crbtgk.ads b/gcc/ada/a-crbtgk.ads
new file mode 100644
index 00000000000..445c28b1c9d
--- /dev/null
+++ b/gcc/ada/a-crbtgk.ads
@@ -0,0 +1,138 @@
+------------------------------------------------------------------------------
+--                                                                          --
+--                         GNAT LIBRARY COMPONENTS                          --
+--                                                                          --
+--               ADA.CONTAINERS.RED_BLACK_TREES.GENERIC_KEYS                --
+--                                                                          --
+--                                 S p e c                                  --
+--                                                                          --
+-- This specification is adapted from the Ada Reference Manual for use with --
+-- GNAT.  In accordance with the copyright of that document, you can freely --
+-- copy and modify this specification,  provided that if you redistribute a --
+-- modified version,  any changes that you have made are clearly indicated. --
+--                                                                          --
+------------------------------------------------------------------------------
+
+with Ada.Containers.Red_Black_Trees.Generic_Operations;
+
+generic
+   with package Tree_Operations is new Generic_Operations (<>);
+
+   use Tree_Operations.Tree_Types;
+
+   type Key_Type (<>) is limited private;
+
+   with function Is_Less_Key_Node
+     (L : Key_Type;
+      R : Node_Access) return Boolean;
+
+   with function Is_Greater_Key_Node
+     (L : Key_Type;
+      R : Node_Access) return Boolean;
+
+package Ada.Containers.Red_Black_Trees.Generic_Keys is
+pragma Pure (Generic_Keys);
+
+   generic
+      with function New_Node return Node_Access;
+   procedure Generic_Insert_Post
+     (Tree : in out Tree_Type;
+      X, Y : Node_Access;
+      Key  : Key_Type;
+      Z    : out Node_Access);
+
+   generic
+      with procedure Insert_Post
+        (Tree : in out Tree_Type;
+         X, Y : Node_Access;
+         Key  : Key_Type;
+         Z    : out Node_Access);
+
+   procedure Generic_Conditional_Insert
+     (Tree    : in out Tree_Type;
+      Key     : Key_Type;
+      Node    : out Node_Access;
+      Success : out Boolean);
+
+   generic
+      with procedure Insert_Post
+        (Tree : in out Tree_Type;
+         X, Y : Node_Access;
+         Key  : Key_Type;
+         Z    : out Node_Access);
+
+   procedure Generic_Unconditional_Insert
+     (Tree : in out Tree_Type;
+      Key  : Key_Type;
+      Node : out Node_Access);
+
+   generic
+      with procedure Insert_Post
+        (Tree : in out Tree_Type;
+         X, Y : Node_Access;
+         Key  : Key_Type;
+         Z    : out Node_Access);
+
+      with procedure Unconditional_Insert_Sans_Hint
+        (Tree    : in out Tree_Type;
+         Key     : Key_Type;
+         Node    : out Node_Access);
+
+   procedure Generic_Unconditional_Insert_With_Hint
+     (Tree : in out Tree_Type;
+      Hint : Node_Access;
+      Key  : Key_Type;
+      Node : out Node_Access);
+
+   generic
+      with procedure Insert_Post
+        (Tree : in out Tree_Type;
+         X, Y : Node_Access;
+         Key  : Key_Type;
+         Z    : out Node_Access);
+
+      with procedure Conditional_Insert_Sans_Hint
+        (Tree    : in out Tree_Type;
+         Key     : Key_Type;
+         Node    : out Node_Access;
+         Success : out Boolean);
+
+   procedure Generic_Conditional_Insert_With_Hint
+     (Tree     : in out Tree_Type;
+      Position : Node_Access;
+      Key      : Key_Type;
+      Node     : out Node_Access;
+      Success  : out Boolean);
+
+   function Find
+     (Tree : Tree_Type;
+      Key  : Key_Type) return Node_Access;
+
+   function Ceiling
+     (Tree : Tree_Type;
+      Key  : Key_Type) return Node_Access;
+
+   function Floor
+     (Tree : Tree_Type;
+      Key  : Key_Type) return Node_Access;
+
+   function Upper_Bound
+     (Tree : Tree_Type;
+      Key  : Key_Type) return Node_Access;
+
+   generic
+      with procedure Process (Node : Node_Access);
+   procedure Generic_Iteration
+     (Tree : Tree_Type;
+      Key  : Key_Type);
+
+   generic
+      with procedure Process (Node : Node_Access);
+   procedure Generic_Reverse_Iteration
+     (Tree : Tree_Type;
+      Key  : Key_Type);
+
+end Ada.Containers.Red_Black_Trees.Generic_Keys;
+
+
+