PR c++/11509
[official-gcc.git] / gcc / ada / g-hesora.ads
blob019da39514185a793ead54c62c532d6f09f4d9ee
1 ------------------------------------------------------------------------------
2 -- --
3 -- GNAT RUNTIME COMPONENTS --
4 -- --
5 -- G N A T . H E A P _ S O R T _ A --
6 -- --
7 -- S p e c --
8 -- --
9 -- Copyright (C) 1995-2000 Ada Core Technologies, Inc. --
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, 59 Temple Place - Suite 330, Boston, --
20 -- MA 02111-1307, 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 is maintained by Ada Core Technologies Inc (http://www.gnat.com). --
30 -- --
31 ------------------------------------------------------------------------------
33 -- Heapsort using access to procedure parameters
35 -- This package provides a heapsort routine that works with access to
36 -- subprogram parameters, so that it can be used with different types with
37 -- shared sorting code. See also GNAT.Heap_Sort_G, the generic version,
38 -- which is a little more efficient but does not allow code sharing.
39 -- The generic version is also Pure, while the access version can
40 -- only be Preelaborate.
42 package GNAT.Heap_Sort_A is
43 pragma Preelaborate (Heap_Sort_A);
45 -- The data to be sorted is assumed to be indexed by integer values from
46 -- 1 to N, where N is the number of items to be sorted. In addition, the
47 -- index value zero is used for a temporary location used during the sort.
49 type Move_Procedure is access procedure (From : Natural; To : Natural);
50 -- A pointer to a procedure that moves the data item with index From to
51 -- the data item with index To. An index value of zero is used for moves
52 -- from and to the single temporary location used by the sort.
54 type Lt_Function is access function (Op1, Op2 : Natural) return Boolean;
55 -- A pointer to a function that compares two items and returns True if
56 -- the item with index Op1 is less than the item with index Op2, and False
57 -- if the Op1 item is greater than or equal to the Op2 item.
59 procedure Sort (N : Natural; Move : Move_Procedure; Lt : Lt_Function);
60 -- This procedures sorts items in the range from 1 to N into ascending
61 -- order making calls to Lt to do required comparisons, and Move to move
62 -- items around. Note that, as described above, both Move and Lt use a
63 -- single temporary location with index value zero. This sort is not
64 -- stable, i.e. the order of equal elements in the input is not preserved.
66 end GNAT.Heap_Sort_A;