public inbox for gcc-patches@gcc.gnu.org
 help / color / mirror / Atom feed
* [Ada] Remove contract duplication in formal doubly linked lists
@ 2022-05-30  8:33 Pierre-Marie de Rodat
  0 siblings, 0 replies; only message in thread
From: Pierre-Marie de Rodat @ 2022-05-30  8:33 UTC (permalink / raw)
  To: gcc-patches; +Cc: Julien Bortolussi

[-- Attachment #1: Type: text/plain, Size: 199 bytes --]

Remove a minor duplication in Post of a function of formal doubly linked
lists.

Tested on x86_64-pc-linux-gnu, committed on trunk

gcc/ada/

	* libgnat/a-cfdlli.ads (Insert): Remove the duplication.

[-- Attachment #2: patch.diff --]
[-- Type: text/x-diff, Size: 829 bytes --]

diff --git a/gcc/ada/libgnat/a-cfdlli.ads b/gcc/ada/libgnat/a-cfdlli.ads
--- a/gcc/ada/libgnat/a-cfdlli.ads
+++ b/gcc/ada/libgnat/a-cfdlli.ads
@@ -543,15 +543,7 @@ is
                        Lst       => Length (Container),
                        Item      => New_Item))
 
-            --  Container contains Count times New_Item at the end
-
-            and M.Constant_Range
-                  (Container => Model (Container),
-                   Fst       => Length (Container)'Old + 1,
-                   Lst       => Length (Container),
-                   Item      => New_Item)
-
-            --  A Count cursors have been inserted at the end of Container
+            --  Count cursors have been inserted at the end of Container
 
             and P_Positions_Truncated
                   (Positions (Container)'Old,



^ permalink raw reply	[flat|nested] only message in thread

only message in thread, other threads:[~2022-05-30  8:33 UTC | newest]

Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2022-05-30  8:33 [Ada] Remove contract duplication in formal doubly linked lists Pierre-Marie de Rodat

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).