[Ada] Efficiency improvement in bounded ordered containers

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

diff --git a/gcc/ada/libgnat/a-cborse.adb b/gcc/ada/libgnat/a-cborse.adb
index 363351a4933bdba8b17363cec3e7ee34d544ecf9..9fdba269d2813ce7a6d28ac784cba762cb4ac1d0 100644 (file)
--- a/gcc/ada/libgnat/a-cborse.adb
+++ b/gcc/ada/libgnat/a-cborse.adb
@@ -374,7 +374,9 @@ package body Ada.Containers.Bounded_Ordered_Sets is
 
    procedure Clear (Container : in out Set) is
    begin
-      Tree_Operations.Clear_Tree (Container);
+      while not Container.Is_Empty loop
+         Container.Delete_Last;
+      end loop;
    end Clear;
 
    -----------