summaryrefslogtreecommitdiff
path: root/gcc/ada/a-crbtgk.adb
diff options
context:
space:
mode:
authorrwild <rwild@138bc75d-0d04-0410-961f-82ee72b054a4>2008-09-14 06:21:12 +0000
committerrwild <rwild@138bc75d-0d04-0410-961f-82ee72b054a4>2008-09-14 06:21:12 +0000
commitbf3e1520c00cff0abcd998aac1c85f084f162d3e (patch)
tree9fe2cc226a29d0bfa287d42cd8fd7d4d8038268a /gcc/ada/a-crbtgk.adb
parent5128a0d3da163d4743b9ecb2d0e262cc4b6b2a4f (diff)
downloadgcc-bf3e1520c00cff0abcd998aac1c85f084f162d3e.tar.gz
gcc/ada/
* a-crbtgk.adb, a-direct.ads, a-tasatt.adb, ali.ads, bindgen.adb, checks.adb, einfo.ads, exp_aggr.adb, exp_ch11.adb, exp_ch3.adb, exp_ch4.adb, exp_ch6.adb, exp_ch7.adb, exp_ch9.adb, exp_dbug.ads, exp_disp.adb, exp_dist.adb, exp_pakd.adb, exp_util.adb, g-alveop.ads, g-comlin.adb, g-comlin.ads, g-diopit.adb, g-socket.ads, gcc-interface/decl.c, gcc-interface/gigi.h, gcc-interface/trans.c, lib-load.adb, lib-xref.ads, make.adb, mlib-prj.adb, nlists.ads, opt.ads, par-ch10.adb, par-ch5.adb, par.adb, s-os_lib.ads, s-oscons-tmplt.c, s-parint.ads, s-regpat.ads, s-shasto.ads, s-stausa.ads, s-taprop-vms.adb, sem.adb, sem_ch10.adb, sem_ch11.adb, sem_ch12.adb, sem_ch13.adb, sem_ch3.adb, sem_ch3.ads, sem_ch4.adb, sem_ch6.adb, sem_ch7.adb, sem_ch8.adb, sem_elim.adb, sem_prag.adb, sem_util.adb, sem_util.ads, sem_warn.adb, sinfo.ads, styleg.adb, vms_data.ads: Fix typos in comments. * gnathtml.pl: Fix typos. git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@140356 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/ada/a-crbtgk.adb')
-rw-r--r--gcc/ada/a-crbtgk.adb2
1 files changed, 1 insertions, 1 deletions
diff --git a/gcc/ada/a-crbtgk.adb b/gcc/ada/a-crbtgk.adb
index f3f8e07dae4..a8acc40c94d 100644
--- a/gcc/ada/a-crbtgk.adb
+++ b/gcc/ada/a-crbtgk.adb
@@ -205,7 +205,7 @@ package body Ada.Containers.Red_Black_Trees.Generic_Keys is
pragma Assert (Tree.Length > 0);
-- A hint can either name the node that immediately follows Key,
- -- or immediately precedes Key. We first test whether Key is is
+ -- or immediately precedes Key. We first test whether Key is
-- less than the hint, and if so we compare Key to the node that
-- precedes the hint. If Key is both less than the hint and
-- greater than the hint's preceding neighbor, then we're done;