summaryrefslogtreecommitdiff
path: root/gcc/ada/a-cgaaso.adb
diff options
context:
space:
mode:
authorcharlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4>2005-02-09 11:14:42 +0000
committercharlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4>2005-02-09 11:14:42 +0000
commit7ce1e9473ed905b0abcbe66b2fef2c81c8e3cffa (patch)
treefc2c56125c477bf3312555b0de2bc5a1860ba895 /gcc/ada/a-cgaaso.adb
parent661a91eca8edc1eb8d2516f867db70a441df2bcf (diff)
downloadgcc-7ce1e9473ed905b0abcbe66b2fef2c81c8e3cffa.tar.gz
* a-rbtgso.adb, a-crbtgo.ads, a-crbtgo.adb, a-crbtgk.ads,
a-crbtgk.adb, a-crbltr.ads, a-coprnu.ads, a-coprnu.adb, a-coorse.ads, a-coorse.adb, a-convec.ads, a-convec.adb, a-contai.ads, a-coinve.ads, a-coinve.adb, a-cohata.ads, a-cohama.ads, a-cohama.adb, a-ciorse.ads, a-ciorse.adb, a-cihama.ads, a-cihama.adb, a-cidlli.ads, a-cidlli.adb, a-chtgop.ads, a-chtgop.adb, a-cgcaso.ads, a-cgcaso.adb, a-cgarso.ads, a-cgarso.adb, a-cdlili.ads, a-cdlili.adb, a-cgaaso.adb, a-coormu.adb, a-ciormu.adb, a-cihase.adb, a-cihase.ads, a-cohase.adb, a-cohase.ads, a-ciorma.ads, a-coorma.ads, a-swunha.ads, a-stunha.ads, a-ciormu.ads, a-coormu.ads, a-rbtgso.ads, a-swunha.adb, a-stunha.adb, a-cgaaso.ads, a-ciorma.adb, a-coorma.adb, a-secain.adb, a-secain.ads, a-slcain.ads, a-slcain.adb, a-shcain.ads, a-shcain.adb, a-chtgke.ads, a-chtgke.adb, a-stwiha.ads, a-stwiha.adb, a-strhas.ads, a-strhas.adb, a-chzla1.ads, a-chzla9.ads, a-lfztio.ads, a-liztio.ads, a-llfzti.ads, a-llizti.ads, a-sfztio.ads, a-siztio.ads, a-ssizti.ads, a-stzbou.adb, a-stzbou.ads, a-stzfix.adb, a-stzfix.ads, a-stzhas.adb, a-stzhas.ads, a-stzmap.adb, a-stzmap.ads, a-stzsea.adb, a-stzsea.ads, a-stzsup.adb, a-stzsup.ads, a-stzunb.adb, a-stzunb.ads, a-swunau.adb, a-swunau.ads, a-szmzco.ads, a-szunau.adb, a-szunau.ads, a-szunha.adb, a-szunha.ads, a-szuzti.adb, a-szuzti.ads, a-tiunio.ads, a-wwunio.ads, a-ztcoau.adb, a-ztcoau.ads, a-ztcoio.adb, a-ztcoio.ads, a-ztcstr.adb, a-ztcstr.ads, a-ztdeau.adb, a-ztdeau.ads, a-ztdeio.adb, a-ztdeio.ads, a-ztedit.adb, a-ztedit.ads, a-ztenau.adb, a-ztenau.ads, a-ztenio.adb, a-ztenio.ads, a-ztexio.adb, a-ztexio.ads, a-ztfiio.adb, a-ztfiio.ads, a-ztflau.adb, a-ztflau.ads, a-ztflio.adb, a-ztflio.ads, a-ztgeau.adb, a-ztgeau.ads, a-ztinau.adb, a-ztinau.ads, a-ztinio.adb, a-ztinio.ads, a-ztmoau.adb, a-ztmoau.ads, a-ztmoio.adb, a-ztmoio.ads, a-zttest.adb, a-zttest.ads, a-zzunio.ads: New files. Part of new Ada 2005 library. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@94764 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ada/a-cgaaso.adb')
-rw-r--r--gcc/ada/a-cgaaso.adb125
1 files changed, 125 insertions, 0 deletions
diff --git a/gcc/ada/a-cgaaso.adb b/gcc/ada/a-cgaaso.adb
new file mode 100644
index 00000000000..1fc24fcf672
--- /dev/null
+++ b/gcc/ada/a-cgaaso.adb
@@ -0,0 +1,125 @@
+------------------------------------------------------------------------------
+-- --
+-- GNAT LIBRARY COMPONENTS --
+-- --
+-- ADA.CONTAINERS.GENERIC_ANONYMOUS_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 was originally developed by Matthew J Heaney. --
+------------------------------------------------------------------------------
+
+procedure Ada.Containers.Generic_Anonymous_Array_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 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 Less (Lo, Mid) then
+ if Less (Lo, Hi) then
+ if Less (Mid, Hi) then
+ Swap (Lo, Mid);
+
+ else
+ Swap (Lo, Hi);
+
+ end if;
+
+ else
+ null; -- lo is median
+ end if;
+
+ elsif Less (Lo, Hi) then
+ null; -- lo is median
+
+ elsif 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 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 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;
+
+ Generic_Anonymous_Array_Sort (First, Index_Type'Pred (Pivot));
+ Generic_Anonymous_Array_Sort (Index_Type'Succ (Pivot), Last);
+
+end Ada.Containers.Generic_Anonymous_Array_Sort;