From 0618ca3d8de58c05a16b459cc4c65b9116655e63 Mon Sep 17 00:00:00 2001 From: marcandre Date: Thu, 24 Sep 2009 18:56:22 +0000 Subject: [PATCH] * hash.c (Hash#each): Fix documentation to reflect insertion order. A patch by Run Paint Run Run [ruby-core:23644] and [ruby-core:21231] git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@25081 b2dd03c8-39d4-4d8f-98ff-823fe69b080e --- hash.c | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/hash.c b/hash.c index 78e208727e..713048f4c4 100644 --- a/hash.c +++ b/hash.c @@ -2604,9 +2604,8 @@ env_update(VALUE env, VALUE hash) /* * A Hash is a collection of key-value pairs. It is * similar to an Array, except that indexing is done via - * arbitrary keys of any object type, not an integer index. The order - * in which you traverse a hash by either key or value may seem - * arbitrary, and will generally not be in the insertion order. + * arbitrary keys of any object type, not an integer index. Hashes enumerate + * their values in the order that the corresponding keys were inserted. * * Hashes have a default value that is returned when accessing * keys that do not exist in the hash. By default, that value is