summaryrefslogtreecommitdiff
path: root/gcc/ada/a-crbtgk.adb
diff options
context:
space:
mode:
authorrwild <rwild@138bc75d-0d04-0410-961f-82ee72b054a4>2008-03-24 17:48:07 +0000
committerrwild <rwild@138bc75d-0d04-0410-961f-82ee72b054a4>2008-03-24 17:48:07 +0000
commit36b938a343910149d31789c8939924f90daa69a6 (patch)
tree89b2171703528d83f5a20ddb5bbf2e0adb78a9ad /gcc/ada/a-crbtgk.adb
parentbe42496cde4eb1a974bd8f595417a03a8a171364 (diff)
downloadgcc-36b938a343910149d31789c8939924f90daa69a6.tar.gz
2008-03-24 Ralf Wildenhues <Ralf.Wildenhues@gmx.de>
* 9drpc.adb, a-caldel-vms.adb, a-caldel.adb, a-calend-vms.adb, a-calend.adb, a-calend.ads, a-calfor.adb, a-chahan.ads, a-chtgke.adb, a-cihama.ads, a-ciorse.adb, a-clrefi.ads, a-cohama.ads, a-comlin.ads, a-coorse.adb, a-crbtgk.adb, a-direct.adb, a-except-2005.adb, a-except-2005.ads, a-except.adb, a-except.ads, a-exexda.adb, a-exexpr-gcc.adb, a-exexpr.adb, a-exextr.adb, a-filico.ads, a-finali.ads, a-intnam-aix.ads, a-intnam-solaris.ads, a-ngcefu.adb, a-ngelfu.adb, a-numaux-darwin.adb, a-numeri.ads, a-sequio.ads, a-strbou.ads, a-strfix.adb, checks.adb, exp_ch3.adb, exp_ch4.adb, exp_ch4.ads, exp_ch5.adb, exp_ch6.adb, exp_ch6.ads, exp_ch7.adb, exp_ch7.ads, exp_ch9.adb, exp_ch9.ads, exp_dbug.adb, exp_dbug.ads, exp_disp.adb, exp_dist.adb, exp_dist.ads, exp_fixd.adb, exp_fixd.ads: Fix comment typos. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@133483 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ada/a-crbtgk.adb')
-rw-r--r--gcc/ada/a-crbtgk.adb4
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/ada/a-crbtgk.adb b/gcc/ada/a-crbtgk.adb
index 0fb78beb366..022232c5218 100644
--- a/gcc/ada/a-crbtgk.adb
+++ b/gcc/ada/a-crbtgk.adb
@@ -184,7 +184,7 @@ package body Ada.Containers.Red_Black_Trees.Generic_Keys is
-- is not a search and the only comparisons that occur are with
-- the hint and its neighbor.
- -- If Position is null, this is intepreted to mean that Key is
+ -- If Position is null, this is interpreted to mean that Key is
-- large relative to the nodes in the tree. If the tree is empty,
-- or Key is greater than the last node in the tree, then we're
-- done; otherwise the hint was "wrong" and we must search.
@@ -506,7 +506,7 @@ package body Ada.Containers.Red_Black_Trees.Generic_Keys is
-- equivalent node. That wouldn't break any container invariants,
-- but our rule above says that new nodes always get inserted
-- after equivalent nodes. So here we test whether Key is both
- -- less than the hint and and equal to or greater than the hint's
+ -- less than the hint and equal to or greater than the hint's
-- previous neighbor, and if so insert it before the hint.
if Is_Less_Key_Node (Key, Hint) then