diff options
| author | Bob Duff <duff@adacore.com> | 2019-08-20 09:49:07 +0000 |
|---|---|---|
| committer | Pierre-Marie de Rodat <pmderodat@gcc.gnu.org> | 2019-08-20 09:49:07 +0000 |
| commit | cbdb0df117deb12a8e7d63e1cf2b53415b8e92e2 (patch) | |
| tree | 48fafff9537ec815f3c50814341616701dd5e90e /gcc/ada/adaint.c | |
| parent | 94f76dc10cdbdfcd5255b0c0cf15ab9056c0c514 (diff) | |
| download | gcc-cbdb0df117deb12a8e7d63e1cf2b53415b8e92e2.zip gcc-cbdb0df117deb12a8e7d63e1cf2b53415b8e92e2.tar.gz gcc-cbdb0df117deb12a8e7d63e1cf2b53415b8e92e2.tar.bz2 | |
[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
Diffstat (limited to 'gcc/ada/adaint.c')
0 files changed, 0 insertions, 0 deletions