1 ------------------------------------------------------------------------------
3 -- GNAT RUNTIME COMPONENTS --
5 -- G N A T . H E A P _ S O R T _ A --
10 -- Copyright (C) 1995-2000 Ada Core Technologies, Inc. --
12 -- GNAT is free software; you can redistribute it and/or modify it under --
13 -- terms of the GNU General Public License as published by the Free Soft- --
14 -- ware Foundation; either version 2, or (at your option) any later ver- --
15 -- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
16 -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
17 -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
18 -- for more details. You should have received a copy of the GNU General --
19 -- Public License distributed with GNAT; see file COPYING. If not, write --
20 -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
21 -- MA 02111-1307, USA. --
23 -- As a special exception, if other files instantiate generics from this --
24 -- unit, or you link this unit with other files to produce an executable, --
25 -- this unit does not by itself cause the resulting executable to be --
26 -- covered by the GNU General Public License. This exception does not --
27 -- however invalidate any other reasons why the executable file might be --
28 -- covered by the GNU Public License. --
30 -- GNAT is maintained by Ada Core Technologies Inc (http://www.gnat.com). --
32 ------------------------------------------------------------------------------
34 -- Heapsort using access to procedure parameters
36 -- This package provides a heapsort routine that works with access to
37 -- subprogram parameters, so that it can be used with different types with
38 -- shared sorting code. See also GNAT.Heap_Sort_G, the generic version,
39 -- which is a little more efficient but does not allow code sharing.
40 -- The generic version is also Pure, while the access version can
41 -- only be Preelaborate.
43 package GNAT
.Heap_Sort_A
is
44 pragma Preelaborate
(Heap_Sort_A
);
46 -- The data to be sorted is assumed to be indexed by integer values from
47 -- 1 to N, where N is the number of items to be sorted. In addition, the
48 -- index value zero is used for a temporary location used during the sort.
50 type Move_Procedure
is access procedure (From
: Natural; To
: Natural);
51 -- A pointer to a procedure that moves the data item with index From to
52 -- the data item with index To. An index value of zero is used for moves
53 -- from and to the single temporary location used by the sort.
55 type Lt_Function
is access function (Op1
, Op2
: Natural) return Boolean;
56 -- A pointer to a function that compares two items and returns True if
57 -- the item with index Op1 is less than the item with index Op2, and False
58 -- if the Op1 item is greater than or equal to the Op2 item.
60 procedure Sort
(N
: Natural; Move
: Move_Procedure
; Lt
: Lt_Function
);
61 -- This procedures sorts items in the range from 1 to N into ascending
62 -- order making calls to Lt to do required comparisons, and Move to move
63 -- items around. Note that, as described above, both Move and Lt use a
64 -- single temporary location with index value zero. This sort is not
65 -- stable, i.e. the order of equal elements in the input is not preserved.