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 _ A N O N Y M O U S _ 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, 59 Temple Place - Suite 330, Boston, --
25 -- MA 02111-1307, 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 was originally developed by Matthew J Heaney. --
35 ------------------------------------------------------------------------------
37 procedure Ada.Containers.Generic_Anonymous_Array_Sort
38 (First, Last : Index_Type'Base)
40 Pivot, Lo, Mid, Hi : Index_Type;
50 if Last = Index_Type'Succ (First) then
51 if not Less (Lo, Hi) then
59 (Index_Type'Pos (Lo) +
60 (Index_Type'Pos (Hi) - Index_Type'Pos (Lo)) / 2);
62 -- We need to figure out which case we have:
70 if Less (Lo, Mid) then
72 if Less (Mid, Hi) then
84 elsif Less (Lo, Hi) then
87 elsif Less (Mid, Hi) then
97 exit Outer when not (Pivot < Hi);
99 if Less (Hi, Pivot) then
102 Lo := Index_Type'Succ (Lo);
105 Hi := Index_Type'Pred (Hi);
110 exit Outer when not (Lo < Pivot);
112 if Less (Lo, Pivot) then
113 Lo := Index_Type'Succ (Lo);
117 Hi := Index_Type'Pred (Hi);
123 Generic_Anonymous_Array_Sort (First, Index_Type'Pred (Pivot));
124 Generic_Anonymous_Array_Sort (Index_Type'Succ (Pivot), Last);
126 end Ada.Containers.Generic_Anonymous_Array_Sort;