From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: poffice@blade.nagaokaut.ac.jp Delivered-To: poffice@blade.nagaokaut.ac.jp Received: from kankan.nagaokaut.ac.jp (kankan.nagaokaut.ac.jp [133.44.2.24]) by blade.nagaokaut.ac.jp (Postfix) with ESMTP id E701E17C2195 for ; Wed, 3 Aug 2011 10:16:51 +0900 (JST) Received: from funfun.nagaokaut.ac.jp (funfun.nagaokaut.ac.jp [133.44.2.201]) by kankan.nagaokaut.ac.jp (Postfix) with ESMTP id 02260EA6557 for ; Wed, 3 Aug 2011 10:32:14 +0900 (JST) Received: from localhost (localhost.nagaokaut.ac.jp [127.0.0.1]) by funfun.nagaokaut.ac.jp (Postfix) with ESMTP id 598D98FC5B for ; Wed, 3 Aug 2011 10:32:14 +0900 (JST) X-Virus-Scanned: amavisd-new at funfun.nagaokaut.ac.jp Received: from funfun.nagaokaut.ac.jp ([127.0.0.1]) by localhost (funfun.nagaokaut.ac.jp [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id BigqeTsSWBDC for ; Wed, 3 Aug 2011 10:32:14 +0900 (JST) Received: from voscc.nagaokaut.ac.jp (voscc.nagaokaut.ac.jp [133.44.1.100]) by funfun.nagaokaut.ac.jp (Postfix) with ESMTP id 38AFD8FC19 for ; Wed, 3 Aug 2011 10:32:14 +0900 (JST) Received: from carbon.ruby-lang.org (carbon.ruby-lang.org [221.186.184.68]) by voscc.nagaokaut.ac.jp (Postfix) with ESMTP id 9548F952421 for ; Wed, 3 Aug 2011 10:32:12 +0900 (JST) Received: from beryllium.ruby-lang.org (beryllium.ruby-lang.org [127.0.0.1]) by carbon.ruby-lang.org (Postfix) with ESMTP id C84D13C21E7AE; Wed, 3 Aug 2011 10:29:49 +0900 (JST) Received: from fluorine.ruby-lang.org (www.rubyist.net [210.251.121.216]) by carbon.ruby-lang.org (Postfix) with ESMTP id 1B62C3C21ED64 for ; Wed, 3 Aug 2011 10:29:41 +0900 (JST) Received: from ruby-lang.org (localhost [127.0.0.1]) by fluorine.ruby-lang.org (Postfix) with ESMTP id 02BCF3ED34 for ; Wed, 3 Aug 2011 10:29:41 +0900 (JST) Delivered-To: ruby-core@ruby-lang.org Date: Wed, 3 Aug 2011 10:29:44 +0900 Posted: Wed, 3 Aug 2011 10:29:40 +0900 From: Thomas Sawyer Reply-To: ruby-core@ruby-lang.org Subject: [ruby-core:38732] [Ruby 1.9 - Feature #5123] Alias Hash 1.9 as OrderedHash To: ruby-core@ruby-lang.org Message-Id: References: X-ML-Name: ruby-core X-Mail-Count: 38732 X-MLServer: fml [fml 4.0.3 release (20011202/4.0.3)]; post only (only members can post) X-ML-Info: If you have a question, send e-mail with the body "help" (without quotes) to the address ruby-core-ctl@ruby-lang.org; help= X-Mailer: Redmine X-Spam-Checker-Version: SpamAssassin 3.1.7-deb3 (2006-10-05) on carbon.ruby-lang.org X-Spam-Level: X-Spam-Status: No, score=0.1 required=7.0 tests=BAYES_50,CONTENT_TYPE_PRESENT, FORGED_RCVD_HELO,X_MAILER_PRESENT autolearn=disabled version=3.1.7-deb3 X-Redmine-Issue-Author: alexeymuranov X-Redmine-Issue-Assignee: matz X-Redmine-Issue-Id: 5123 X-Redmine-Mailinglistintegration-Message-Ids: 8286 X-Redmine-Project: ruby-19 Auto-Submitted: auto-generated X-Redmine-Site: Ruby Issue Tracking System X-Redmine-Host: redmine.ruby-lang.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8 Precedence: bulk List-Id: ruby-core.ruby-lang.org List-Software: fml [fml 4.0.3 release (20011202/4.0.3)] List-Post: List-Owner: List-Help: List-Unsubscribe: Issue #5123 has been updated by Thomas Sawyer. IWon't this break orderedhash gem? In any case, now that Hash preserves order, why would anyone ever think about changing it back and break old code? ---------------------------------------- Feature #5123: Alias Hash 1.9 as OrderedHash http://redmine.ruby-lang.org/issues/5123 Author: Alexey Muranov Status: Assigned Priority: Normal Assignee: Yukihiro Matsumoto Category: Target version: I read that it was a controversial decision to make Hash in Ruby 1.9 ordered. It is not clear if the present implementation is the best possible. I would like to express my thought. It would be nice if the ordered Hash in Ruby 1.9 was aliased as OrderedHash. That way people who rely on preserving the insertion order in some application (me, for example) could explicitly use OrderedHash, and developers of Ruby would be free to redefine Hash in future versions if a better implementation that a doubly-linked circular list is found. (I read something about a possibility of using "red–black tree".) Thanks. Alexey Muranov. -- http://redmine.ruby-lang.org