1 ------------------------------------------------------------------------------
3 -- GNAT LIBRARY COMPONENTS --
5 -- ADA.CONTAINERS.GENERIC_ANONYMOUS_ARRAY_SORT --
9 -- Copyright (C) 2004-2007, Free Software Foundation, Inc. --
11 -- GNAT is free software; you can redistribute it and/or modify it under --
12 -- terms of the GNU General Public License as published by the Free Soft- --
13 -- ware Foundation; either version 2, or (at your option) any later ver- --
14 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
15 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
16 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
17 -- for more details. You should have received a copy of the GNU General --
18 -- Public License distributed with GNAT; see file COPYING. If not, write --
19 -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
20 -- Boston, MA 02110-1301, USA. --
22 -- As a special exception, if other files instantiate generics from this --
23 -- unit, or you link this unit with other files to produce an executable, --
24 -- this unit does not by itself cause the resulting executable to be --
25 -- covered by the GNU General Public License. This exception does not --
26 -- however invalidate any other reasons why the executable file might be --
27 -- covered by the GNU Public License. --
29 -- This unit was originally developed by Matthew J Heaney. --
30 ------------------------------------------------------------------------------
32 -- This algorithm was adapted from GNAT.Heap_Sort (see g-heasor.ad[sb])
36 procedure Ada.Containers.Generic_Anonymous_Array_Sort
37 (First, Last : Index_Type'Base)
39 type T is range System.Min_Int .. System.Max_Int;
41 function To_Index (J : T) return Index_Type;
42 pragma Inline (To_Index);
44 function Lt (J, K : T) return Boolean;
47 procedure Xchg (J, K : T);
50 procedure Sift (S : T);
56 function To_Index (J : T) return Index_Type is
57 K : constant T'Base := Index_Type'Pos (First) + J - T'(1);
59 return Index_Type'Val (K);
66 function Lt (J, K : T) return Boolean is
68 return Less (To_Index (J), To_Index (K));
75 procedure Xchg (J, K : T) is
77 Swap (To_Index (J), To_Index (K));
80 Max : T := Index_Type'Pos (Last) - Index_Type'Pos (First) + T'(1);
86 procedure Sift (S : T) is
96 if Lt (Son, Son + 1) then
110 if Lt (Father, C) then
119 -- Start of processing for Generic_Anonymous_Array_Sort
122 for J in reverse 1 .. Max / 2 loop
131 end Ada.Containers.Generic_Anonymous_Array_Sort;