1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.GENERIC_CONSTRAINED_ARRAY_SORT --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004 Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- This unit has originally being developed by Matthew J Heaney. --
------------------------------------------------------------------------------
procedure Ada.Containers.Generic_Constrained_Array_Sort
(Container : in out Array_Type)
is
function Is_Less (I, J : Index_Type) return Boolean;
pragma Inline (Is_Less);
procedure Swap (I, J : Index_Type);
pragma Inline (Swap);
procedure Sort (First, Last : Index_Type'Base);
-------------
-- Is_Less --
-------------
function Is_Less (I, J : Index_Type) return Boolean is
begin
return Container (I) < Container (J);
end Is_Less;
----------
-- Sort --
----------
procedure Sort (First, Last : Index_Type'Base) is
Pivot, Lo, Mid, Hi : Index_Type;
begin
if Last <= First then
return;
end if;
Lo := First;
Hi := Last;
if Last = Index_Type'Succ (First) then
if not Is_Less (Lo, Hi) then
Swap (Lo, Hi);
end if;
return;
end if;
Mid := Index_Type'Val
(Index_Type'Pos (Lo) +
(Index_Type'Pos (Hi) - Index_Type'Pos (Lo)) / 2);
-- We need to figure out which case we have:
-- x < y < z
-- x < z < y
-- z < x < y
-- y < x < z
-- y < z < x
-- z < y < x
if Is_Less (Lo, Mid) then
if Is_Less (Lo, Hi) then
if Is_Less (Mid, Hi) then
Swap (Lo, Mid);
else
Swap (Lo, Hi);
end if;
else
null; -- lo is median
end if;
elsif Is_Less (Lo, Hi) then
null; -- lo is median
elsif Is_Less (Mid, Hi) then
Swap (Lo, Hi);
else
Swap (Lo, Mid);
end if;
Pivot := Lo;
Outer : loop
loop
exit Outer when not (Pivot < Hi);
if Is_Less (Hi, Pivot) then
Swap (Hi, Pivot);
Pivot := Hi;
Lo := Index_Type'Succ (Lo);
exit;
else
Hi := Index_Type'Pred (Hi);
end if;
end loop;
loop
exit Outer when not (Lo < Pivot);
if Is_Less (Lo, Pivot) then
Lo := Index_Type'Succ (Lo);
else
Swap (Lo, Pivot);
Pivot := Lo;
Hi := Index_Type'Pred (Hi);
exit;
end if;
end loop;
end loop Outer;
Sort (First, Index_Type'Pred (Pivot));
Sort (Index_Type'Succ (Pivot), Last);
end Sort;
----------
-- Swap --
----------
procedure Swap (I, J : Index_Type) is
EI : constant Element_Type := Container (I);
begin
Container (I) := Container (J);
Container (J) := EI;
end Swap;
-- Start of processing for Generic_Constrained_Array_Sort
begin
Sort (Container'First, Container'Last);
end Ada.Containers.Generic_Constrained_Array_Sort;
|
