1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- ADA.CONTAINERS.GENERIC_CONSTRAINED_ARRAY_SORT --
9 -- Copyright (C) 2004 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, 59 Temple Place - Suite 330, Boston, --
24 -- MA 02111-1307, 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 has originally being developed by Matthew J Heaney. --
34 ------------------------------------------------------------------------------
36 procedure Ada.Containers.Generic_Constrained_Array_Sort
37 (Container : in out Array_Type)
39 function Is_Less (I, J : Index_Type) return Boolean;
40 pragma Inline (Is_Less);
42 procedure Swap (I, J : Index_Type);
45 procedure Sort (First, Last : Index_Type'Base);
51 function Is_Less (I, J : Index_Type) return Boolean is
53 return Container (I) < Container (J);
60 procedure Sort (First, Last : Index_Type'Base) is
61 Pivot, Lo, Mid, Hi : Index_Type;
71 if Last = Index_Type'Succ (First) then
72 if not Is_Less (Lo, Hi) then
80 (Index_Type'Pos (Lo) +
81 (Index_Type'Pos (Hi) - Index_Type'Pos (Lo)) / 2);
83 -- We need to figure out which case we have:
91 if Is_Less (Lo, Mid) then
92 if Is_Less (Lo, Hi) then
93 if Is_Less (Mid, Hi) then
100 null; -- lo is median
103 elsif Is_Less (Lo, Hi) then
104 null; -- lo is median
106 elsif Is_Less (Mid, Hi) then
117 exit Outer when not (Pivot < Hi);
119 if Is_Less (Hi, Pivot) then
122 Lo := Index_Type'Succ (Lo);
125 Hi := Index_Type'Pred (Hi);
130 exit Outer when not (Lo < Pivot);
132 if Is_Less (Lo, Pivot) then
133 Lo := Index_Type'Succ (Lo);
137 Hi := Index_Type'Pred (Hi);
143 Sort (First, Index_Type'Pred (Pivot));
144 Sort (Index_Type'Succ (Pivot), Last);
151 procedure Swap (I, J : Index_Type) is
152 EI : constant Element_Type := Container (I);
154 Container (I) := Container (J);
158 -- Start of processing for Generic_Constrained_Array_Sort
161 Sort (Container'First, Container'Last);
162 end Ada.Containers.Generic_Constrained_Array_Sort;