1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- A D A . C O N T A I N E R S . --
6 -- G E N E R I C _ C O N S T R A I N E D _ A R R A Y _ S O R T --
10 -- Copyright (C) 2004-2005 Free Software Foundation, Inc. --
12 -- This specification is derived from the Ada Reference Manual for use with --
13 -- GNAT. The copyright notice above, and the license provisions that follow --
14 -- apply solely to the contents of the part following the private keyword. --
16 -- GNAT is free software; you can redistribute it and/or modify it under --
17 -- terms of the GNU General Public License as published by the Free Soft- --
18 -- ware Foundation; either version 2, or (at your option) any later ver- --
19 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
20 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
21 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
22 -- for more details. You should have received a copy of the GNU General --
23 -- Public License distributed with GNAT; see file COPYING. If not, write --
24 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
25 -- Boston, MA 02110-1301, USA. --
27 -- As a special exception, if other files instantiate generics from this --
28 -- unit, or you link this unit with other files to produce an executable, --
29 -- this unit does not by itself cause the resulting executable to be --
30 -- covered by the GNU General Public License. This exception does not --
31 -- however invalidate any other reasons why the executable file might be --
32 -- covered by the GNU Public License. --
34 -- This unit has originally being developed by Matthew J Heaney. --
35 ------------------------------------------------------------------------------
37 procedure Ada.Containers.Generic_Constrained_Array_Sort
38 (Container : in out Array_Type)
40 function Is_Less (I, J : Index_Type) return Boolean;
41 pragma Inline (Is_Less);
43 procedure Swap (I, J : Index_Type);
46 procedure Sort (First, Last : Index_Type'Base);
52 function Is_Less (I, J : Index_Type) return Boolean is
54 return Container (I) < Container (J);
61 procedure Sort (First, Last : Index_Type'Base) is
62 Pivot, Lo, Mid, Hi : Index_Type;
72 if Last = Index_Type'Succ (First) then
73 if not Is_Less (Lo, Hi) then
81 (Index_Type'Pos (Lo) +
82 (Index_Type'Pos (Hi) - Index_Type'Pos (Lo)) / 2);
84 -- We need to figure out which case we have:
92 if Is_Less (Lo, Mid) then
93 if Is_Less (Lo, Hi) then
94 if Is_Less (Mid, Hi) then
101 null; -- lo is median
104 elsif Is_Less (Lo, Hi) then
105 null; -- lo is median
107 elsif Is_Less (Mid, Hi) then
118 exit Outer when not (Pivot < Hi);
120 if Is_Less (Hi, Pivot) then
123 Lo := Index_Type'Succ (Lo);
126 Hi := Index_Type'Pred (Hi);
131 exit Outer when not (Lo < Pivot);
133 if Is_Less (Lo, Pivot) then
134 Lo := Index_Type'Succ (Lo);
138 Hi := Index_Type'Pred (Hi);
144 Sort (First, Index_Type'Pred (Pivot));
145 Sort (Index_Type'Succ (Pivot), Last);
152 procedure Swap (I, J : Index_Type) is
153 EI : constant Element_Type := Container (I);
155 Container (I) := Container (J);
159 -- Start of processing for Generic_Constrained_Array_Sort
162 Sort (Container'First, Container'Last);
163 end Ada.Containers.Generic_Constrained_Array_Sort;