[Ada] Efficiency improvement in bounded ordered containers

[thirdparty/gcc.git] / gcc / ada / libgnat / a-cborma.adb

diff --git a/gcc/ada/libgnat/a-cborma.adb b/gcc/ada/libgnat/a-cborma.adb
index a7969fe8a0dd26df284499b4c8975963d3331588..55be7ad0327882b2f661863f647aeae907d0d05a 100644 (file)
--- a/gcc/ada/libgnat/a-cborma.adb
+++ b/gcc/ada/libgnat/a-cborma.adb
@@ -374,7 +374,9 @@ package body Ada.Containers.Bounded_Ordered_Maps is
 
    procedure Clear (Container : in out Map) is
    begin
-      Tree_Operations.Clear_Tree (Container);
+      while not Container.Is_Empty loop
+         Container.Delete_Last;
+      end loop;
    end Clear;
 
    -----------