From b426f8ebb5510af095852dfd4fa9c9f41ea99358 Mon Sep 17 00:00:00 2001
From: knu <knu@b2dd03c8-39d4-4d8f-98ff-823fe69b080e>
Date: Wed, 31 Jul 2013 05:58:14 +0000
Subject: [PATCH] * lib/set.rb: [DOC] Fix example result.  Hash is now ordered.

git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@42264 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
---
 ChangeLog  | 4 ++++
 lib/set.rb | 2 +-
 2 files changed, 5 insertions(+), 1 deletion(-)

diff --git a/ChangeLog b/ChangeLog
index 285065f9f0..cfa874042c 100644
--- a/ChangeLog
+++ b/ChangeLog
@@ -1,3 +1,7 @@
+Wed Jul 31 14:38:52 2013  Akinori MUSHA  <knu@iDaemons.org>
+
+	* lib/set.rb: [DOC] Fix example result.  Hash is now ordered.
+
 Wed Jul 31 14:38:10 2013  Akinori MUSHA  <knu@iDaemons.org>
 
 	* lib/set.rb: [DOC] Use the term "sorted" instead "ordered" when
diff --git a/lib/set.rb b/lib/set.rb
index 2e28b027ba..d98cc0b0be 100644
--- a/lib/set.rb
+++ b/lib/set.rb
@@ -49,7 +49,7 @@
 #   s2 = [1, 2].to_set                    # -> #<Set: {1, 2}>
 #   s1 == s2                              # -> true
 #   s1.add("foo")                         # -> #<Set: {1, 2, "foo"}>
-#   s1.merge([2, 6])                      # -> #<Set: {6, 1, 2, "foo"}>
+#   s1.merge([2, 6])                      # -> #<Set: {1, 2, "foo", 6}>
 #   s1.subset? s2                         # -> false
 #   s2.subset? s1                         # -> true
 #