projects / gcc.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 94f76dc) | patch
[Ada] Efficiency improvement in bounded ordered containers
authorBob Duff <duff@adacore.com>
Tue, 20 Aug 2019 09:49:07 +0000 (09:49 +0000)
committerPierre-Marie de Rodat <pmderodat@gcc.gnu.org>
Tue, 20 Aug 2019 09:49:07 +0000 (09:49 +0000)
commitcbdb0df117deb12a8e7d63e1cf2b53415b8e92e2
tree48fafff9537ec815f3c50814341616701dd5e90etree
parent94f76dc10cdbdfcd5255b0c0cf15ab9056c0c514commit | diff
[Ada] Efficiency improvement in bounded ordered containers

The Delete operations in the bounded ordered containers have been
substantially sped up.  No change in semantics, so no test.

2019-08-20  Bob Duff  <duff@adacore.com>

gcc/ada/

* libgnat/a-cborma.adb, libgnat/a-cborse.adb (Clear): Repeatedly
call Delete. This avoids clearing the free list, which
substantially speeds up future Delete operations.

From-SVN: r274724
gcc/ada/ChangeLog diff | blob | history
gcc/ada/libgnat/a-cborma.adb diff | blob | history
gcc/ada/libgnat/a-cborse.adb diff | blob | history