summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorsvn <svn@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>2015-03-18 09:02:46 +0000
committersvn <svn@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>2015-03-18 09:02:46 +0000
commitd2bfccd22dfa090a38f1c41ff839301d6eaa4510 (patch)
treebdb635362c2a83936d3dd105169ded8e2852b983
parentec4624b0f47ee6a99036b1711bd5746cdd99da33 (diff)
* remove trailing spaces.
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@50007 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
-rw-r--r--ChangeLog2
1 files changed, 1 insertions, 1 deletions
diff --git a/ChangeLog b/ChangeLog
index f1cbb54bca..7d1aec1b8a 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -11,7 +11,7 @@ Wed Mar 18 17:21:12 2015 Koichi Sasada <ko1@atdot.net>
"new objects referred from old objects are maybe long-lived old
objects".
- Disadvantage of added algorithm is we may promote unwilling
+ Disadvantage of added algorithm is we may promote unwilling
short-lived objects. For example, consider many new objects push and
pop to an old stack object. All of new objects (short-lived objects)
promote to old objects unexpectedly.