Commit 5ec0b2e5 by Arnaud Charlet

Minor reformatting.

Update comments.

From-SVN: r107028
parent 089aaefe
...@@ -6,7 +6,7 @@ ...@@ -6,7 +6,7 @@
-- -- -- --
-- S p e c -- -- S p e c --
-- -- -- --
-- Copyright (C) 1992,1993,1994 Free Software Foundation, Inc. -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- -- -- --
-- GNAT is free software; you can redistribute it and/or modify it under -- -- 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- -- -- terms of the GNU General Public License as published by the Free Soft- --
......
...@@ -6,7 +6,7 @@ ...@@ -6,7 +6,7 @@
-- -- -- --
-- B o d y -- -- B o d y --
-- -- -- --
-- Copyright (C) 1998-2005 Free Software Foundation, Inc. -- -- Copyright (C) 1998-2005, Free Software Foundation, Inc. --
-- -- -- --
-- GNAT is free software; you can redistribute it and/or modify it under -- -- 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- -- -- terms of the GNU General Public License as published by the Free Soft- --
......
...@@ -37,16 +37,19 @@ ...@@ -37,16 +37,19 @@
-- subprogram parameters, so that it can be used with different types with -- subprogram parameters, so that it can be used with different types with
-- shared sorting code. -- shared sorting code.
-- See also GNAT.Heap_Sort_G and GNAT.Heap_Sort_A. These are older versions
-- of this routine. In some cases GNAT.Heap_Sort_G may be a little faster
-- than GNAT.Heap_Sort, at the expense of generic code duplication and a
-- less convenient interface. The generic version also has the advantage
-- of being Pure, while this unit can only be Preelaborate.
-- This heapsort algorithm uses approximately N*log(N) compares in the -- This heapsort algorithm uses approximately N*log(N) compares in the
-- worst case and is in place with no additional storage required. See -- worst case and is in place with no additional storage required. See
-- the body for exact details of the algorithm used. -- the body for exact details of the algorithm used.
-- See also GNAT.Heap_Sort_G which is a generic version that will be faster
-- since the overhead of the indirect calls is avoided, at the expense of
-- generic code duplication and less convenient interface. The generic version
-- also has the advantage of being Pure, while this unit can only be
-- Preelaborate, because of the access types.
-- Note: GNAT.Heap_Sort replaces and obsoletes GNAT.Heap_Sort_A, which is
-- retained in the GNAT library for backwards compatibility.
package GNAT.Heap_Sort is package GNAT.Heap_Sort is
pragma Preelaborate; pragma Preelaborate;
......
...@@ -6,7 +6,7 @@ ...@@ -6,7 +6,7 @@
-- -- -- --
-- S p e c -- -- S p e c --
-- -- -- --
-- Copyright (C) 1992,1993,1994 Free Software Foundation, Inc. -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- -- -- --
-- GNAT is free software; you can redistribute it and/or modify it under -- -- 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- -- -- terms of the GNU General Public License as published by the Free Soft- --
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment