diff options
| author | charlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4> | 2010-09-09 13:38:12 +0000 |
|---|---|---|
| committer | charlet <charlet@138bc75d-0d04-0410-961f-82ee72b054a4> | 2010-09-09 13:38:12 +0000 |
| commit | 52307e9c388efd0d6bfd2ce2d3be23fdb42beb41 (patch) | |
| tree | 572dfe6b1fb775d2b68e68da8844450085547166 /gcc/ada/a-coorse.adb | |
| parent | 35f23bef978f17c6b341fe1e1f8d2cc5cfdf436b (diff) | |
| download | gcc-52307e9c388efd0d6bfd2ce2d3be23fdb42beb41.tar.gz | |
2010-09-09 Matthew Heaney <heaney@adacore.com>
* a-convec.adb, a-coinve.adb (Clear, Delete, Delete_Last, Finalize,
Merge, Insert, Insert_Space, Move, Reserve_Capacity, Generic_Sorting,
Replace_Element, Reverse_Elements, Swap): Change exception message to
correctly indicate kind of tampering (cursor or element).
* a-cdlili.adb, a-cidlli.adb (Clear, Delete, Delete_First, Delete_Last,
Merge, Generic_Sorting, Insert, Move, Reverse_Elements, Splice,
Swap_Links, Replace_Element, Swap): Ditto.
* a-coorse.adb, a-ciorse.adb (Include, Replace, Replace_Element): Ditto
* a-coorma.adb, a-ciorma.adb (Include, Replace, Replace_Element): Ditto
* a-coormu.adb, a-ciormu.adb (Replace_Element): Ditto
* a-chtgke.adb (Delete_Key_Sans_Free, Generic_Conditional_Insert,
Generic_Replace_Element): Ditto
* a-chtgop.adb (Clear, Move, Reserve_Capacity): Ditto
* a-cohama.adb, a-cihama.adb (Delete, Include, Replace,
Replace_Element): Ditto.
* a-cohase.adb, a-cihase.adb (Delete, Difference, Intersection,
Symmetric_Difference, Union, Include, Replace): Ditto
2010-09-09 Ed Schonberg <schonberg@adacore.com>
* sprint.adb (Write_Id): If the parent node is an expanded name, check
that its entity_or_associated_node is an entity before writing it out.
* exp_disp.adb (Make_Tags); if a type is declared in C++ and has no
constructors, there is no need for a dispatch table pointer because the
table is fully inherited from the C++ code.
2010-09-09 Thomas Quinot <quinot@adacore.com>
* projects.texi: Fix wrong identifiers on package end lines in project
files examples.
* exp_ch6.adb: Minor reformatting.
2010-09-09 Tristan Gingold <gingold@adacore.com>
* gnatcmd.adb, vms_conv.ads, vms_help.adb, vms_cmds.ads: Extract
Command_Type from vms_conv.ads.
2010-09-09 Eric Botcazou <ebotcazou@adacore.com>
* gnat_ugn.texi: Fix description of -O3 optimization level.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@164092 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ada/a-coorse.adb')
| -rw-r--r-- | gcc/ada/a-coorse.adb | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/gcc/ada/a-coorse.adb b/gcc/ada/a-coorse.adb index 2c02f2fd6a4..d4e73029b2a 100644 --- a/gcc/ada/a-coorse.adb +++ b/gcc/ada/a-coorse.adb @@ -6,7 +6,7 @@ -- -- -- B o d y -- -- -- --- Copyright (C) 2004-2009, Free Software Foundation, Inc. -- +-- Copyright (C) 2004-2010, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- @@ -855,7 +855,7 @@ package body Ada.Containers.Ordered_Sets is if not Inserted then if Container.Tree.Lock > 0 then raise Program_Error with - "attempt to tamper with cursors (set is locked)"; + "attempt to tamper with elements (set is locked)"; end if; Position.Node.Element := New_Item; @@ -1355,7 +1355,7 @@ package body Ada.Containers.Ordered_Sets is if Container.Tree.Lock > 0 then raise Program_Error with - "attempt to tamper with cursors (set is locked)"; + "attempt to tamper with elements (set is locked)"; end if; Node.Element := New_Item; @@ -1405,7 +1405,7 @@ package body Ada.Containers.Ordered_Sets is Result : Node_Access; Inserted : Boolean; - -- Start of processing for Insert + -- Start of processing for Replace_Element begin if Item < Node.Element @@ -1416,7 +1416,7 @@ package body Ada.Containers.Ordered_Sets is else if Tree.Lock > 0 then raise Program_Error with - "attempt to tamper with cursors (set is locked)"; + "attempt to tamper with elements (set is locked)"; end if; Node.Element := Item; @@ -1432,7 +1432,7 @@ package body Ada.Containers.Ordered_Sets is if Hint = Node then if Tree.Lock > 0 then raise Program_Error with - "attempt to tamper with cursors (set is locked)"; + "attempt to tamper with elements (set is locked)"; end if; Node.Element := Item; |