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 3C51017CA7BC for ; Thu, 22 Nov 2012 10:49:44 +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 8F4AAEA6D55 for ; Thu, 22 Nov 2012 10:48:50 +0900 (JST) Received: from funfun.nagaokaut.ac.jp (localhost.nagaokaut.ac.jp [127.0.0.1]) by funfun.nagaokaut.ac.jp (Postfix) with ESMTP id 7DBFC97A832 for ; Thu, 22 Nov 2012 10:48:50 +0900 (JST) X-Virus-Scanned: amavisd-new at nagaokaut.ac.jp Received: from funfun.nagaokaut.ac.jp ([127.0.0.1]) by funfun.nagaokaut.ac.jp (funfun.nagaokaut.ac.jp [127.0.0.1]) (amavisd-new, port 10024) with ESMTP id 0zulhO4OdFz1 for ; Thu, 22 Nov 2012 10:48:50 +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 5CAEA97A82B for ; Thu, 22 Nov 2012 10:48:50 +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 2E30195242C for ; Thu, 22 Nov 2012 10:48:49 +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 565C53C0C69B1; Thu, 22 Nov 2012 10:47:25 +0900 (JST) Received: from fluorine.ruby-lang.org (www.rubyist.net [210.251.121.216]) by carbon.ruby-lang.org (Postfix) with ESMTP id 956803C0C69AF for ; Thu, 22 Nov 2012 10:47:23 +0900 (JST) Received: from ruby-lang.org (localhost [127.0.0.1]) by fluorine.ruby-lang.org (Postfix) with ESMTP id 865CF3ED29 for ; Thu, 22 Nov 2012 10:47:23 +0900 (JST) Delivered-To: ruby-core@ruby-lang.org Date: Thu, 22 Nov 2012 10:47:24 +0900 Posted: Thu, 22 Nov 2012 10:47:23 +0900 From: "lancel (lancel lancel)" Reply-To: ruby-core@ruby-lang.org Subject: [ruby-core:49847] [ruby-trunk - 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: 49847 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-Redmine-Issue-Author: alexeymuranov X-Redmine-Issue-Assignee: matz X-Auto-Response-Suppress: OOF X-Redmine-Issue-Id: 5123 X-Redmine-Mailinglistintegration-Message-Ids: 22359 X-Redmine-Project: ruby-trunk Auto-Submitted: auto-generated X-Redmine-Site: Ruby Issue Tracking System X-Redmine-Host: bugs.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 lancel (lancel lancel). =begin All of us have read the stories of excite people's (()) mind, the hero of the story to live only for a very limited time, sometimes up to a year, sometimes as short as one day. But we always want to know, the doomed choose how to spend their (()) last days. Of course, I say is of free men who have a choice, not whose sphere of activities is strictly.458gyu854 =end ---------------------------------------- Feature #5123: Alias Hash 1.9 as OrderedHash https://bugs.ruby-lang.org/issues/5123#change-33432 Author: alexeymuranov (Alexey Muranov) Status: Assigned Priority: Normal Assignee: matz (Yukihiro Matsumoto) Category: core Target version: next minor 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://bugs.ruby-lang.org/