summaryrefslogtreecommitdiff
path: root/doc
diff options
context:
space:
mode:
authornobu <nobu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>2012-02-01 00:50:17 +0000
committernobu <nobu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>2012-02-01 00:50:17 +0000
commit01d54bc2c7f9baaa86b5444e799f9c00cd9cabe7 (patch)
treee3b7cea7b3aef6e0cdebc326ecfbe1044dbc8fbd /doc
parent25cd6d14e43ad1835adb73f83c8bc71f35223b80 (diff)
* doc/re.rdoc (Repetition): fix typo. reported by Ori Avtalion
and patched by Zachary Scott. [Bug #5947] git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@34411 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
Diffstat (limited to 'doc')
-rw-r--r--doc/re.rdoc2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/re.rdoc b/doc/re.rdoc
index 602775d95d..4e943571a8 100644
--- a/doc/re.rdoc
+++ b/doc/re.rdoc
@@ -179,7 +179,7 @@ contrast, <i>lazy</i> matching makes the minimal amount of matches
necessary for overall success. A greedy metacharacter can be made lazy by
following it with <tt>?</tt>.
- # Both patterns below match the string. The fist uses a greedy
+ # Both patterns below match the string. The first uses a greedy
# quantifier so '.+' matches '<a><b>'; the second uses a lazy
# quantifier so '.+?' matches '<a>'.
/<.+>/.match("<a><b>") #=> #<MatchData "<a><b>">