Daily bump.
[official-gcc.git] / gcc / ada / g-bubsor.ads
blobd88a1753ec911154f485f5e358825b24fd803d26
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT RUN-TIME COMPONENTS --
4 -- --
5 -- G N A T . B U B B L E _ S O R T --
6 -- --
7 -- S p e c --
8 -- --
9 -- Copyright (C) 1995-2006, AdaCore --
10 -- --
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. --
21 -- --
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. --
28 -- --
29 -- GNAT was originally developed by the GNAT team at New York University. --
30 -- Extensive contributions were provided by Ada Core Technologies Inc. --
31 -- --
32 ------------------------------------------------------------------------------
34 -- Sort Utility (Using Bubblesort Algorithm)
36 -- This package provides a bubblesort routine that works with access to
37 -- subprogram parameters, so that it can be used with different types with
38 -- shared sorting code.
40 -- See also GNAT.Bubble_Sort_G and GNAT.Bubble_Sort_A. These are older
41 -- versions of this routine. In some cases GNAT.Bubble_Sort_G may be a
42 -- little faster than GNAT.Bubble_Sort, at the expense of generic code
43 -- duplication and a less convenient interface. The generic version also
44 -- has the advantage of being Pure, while this unit can only be Preelaborate.
46 package GNAT.Bubble_Sort is
47 pragma Pure;
49 -- The data to be sorted is assumed to be indexed by integer values from
50 -- 1 to N, where N is the number of items to be sorted.
52 type Xchg_Procedure is access procedure (Op1, Op2 : Natural);
53 -- A pointer to a procedure that exchanges the two data items whose
54 -- index values are Op1 and Op2.
56 type Lt_Function is access function (Op1, Op2 : Natural) return Boolean;
57 -- A pointer to a function that compares two items and returns True if
58 -- the item with index value Op1 is less than the item with Index value
59 -- Op2, and False if the Op1 item is greater than or equal to the Op2
60 -- item.
62 procedure Sort (N : Natural; Xchg : Xchg_Procedure; Lt : Lt_Function);
63 -- This procedures sorts items in the range from 1 to N into ascending
64 -- order making calls to Lt to do required comparisons, and calls to
65 -- Xchg to exchange items. The sort is stable, that is the order of
66 -- equal items in the input is preserved.
68 end GNAT.Bubble_Sort;