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 BBF8019E0025 for ; Wed, 16 Dec 2015 02:20:33 +0900 (JST) Received: from voscc.nagaokaut.ac.jp (voscc.nagaokaut.ac.jp [133.44.1.100]) by kankan.nagaokaut.ac.jp (Postfix) with ESMTP id D7030B5D8B0 for ; Wed, 16 Dec 2015 02:52:34 +0900 (JST) Received: from neon.ruby-lang.org (neon.ruby-lang.org [221.186.184.75]) by voscc.nagaokaut.ac.jp (Postfix) with ESMTP id D3DB818CC7B1 for ; Wed, 16 Dec 2015 02:52:34 +0900 (JST) Received: from [221.186.184.76] (localhost [IPv6:::1]) by neon.ruby-lang.org (Postfix) with ESMTP id 87BD9120486; Wed, 16 Dec 2015 02:52:33 +0900 (JST) X-Original-To: ruby-core@ruby-lang.org Delivered-To: ruby-core@ruby-lang.org Received: from o10.shared.sendgrid.net (o10.shared.sendgrid.net [173.193.132.135]) by neon.ruby-lang.org (Postfix) with ESMTPS id 9FE4B12047B for ; Wed, 16 Dec 2015 02:52:29 +0900 (JST) DKIM-Signature: v=1; a=rsa-sha1; c=relaxed; d=sendgrid.me; h=from:to:references:subject:mime-version:content-type:content-transfer-encoding:list-id; s=smtpapi; bh=L/9BhwrY4u4uiqw9esDZWcCE5Ws=; b=H8sKlZrVpo/iK/ljgU F87bjCizvm+Z5Iljbg39p4VxpsMSjAJwAK/1iKjXSt/uSc2dXiIkNqCFGyfVZtCl p5CJkreyifFcdJKta/DldxMB4f/9ouhNozIS3FB/1Bxfc65wyfUGFXELtNWjFM6D xpkei9EpUWx0D/S4HPFX+q6D8= Received: by filter0901p1mdw1.sendgrid.net with SMTP id filter0901p1mdw1.26202.5670533A58 2015-12-15 17:51:54.82545939 +0000 UTC Received: from herokuapp.com (ec2-23-22-62-61.compute-1.amazonaws.com [23.22.62.61]) by ismtpd0003p1iad1.sendgrid.net (SG) with ESMTP id 8sZnABlZRzWhxmn-ZjYIPQ for ; Tue, 15 Dec 2015 17:52:21.764 +0000 (UTC) Date: Tue, 15 Dec 2015 17:52:21 +0000 From: 6ftdan@gmail.com To: ruby-core@ruby-lang.org Message-ID: References: Mime-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 7bit X-Redmine-MailingListIntegration-Message-Ids: 46863 X-Redmine-Project: ruby-trunk X-Redmine-Issue-Id: 11815 X-Redmine-Issue-Author: CaryInVictoria X-Redmine-Sender: danielpclark X-Mailer: Redmine X-Redmine-Host: bugs.ruby-lang.org X-Redmine-Site: Ruby Issue Tracking System X-Auto-Response-Suppress: All Auto-Submitted: auto-generated X-SG-EID: ync6xU2WACa70kv/Ymy4QrNMhiuLXJG8OTL2vJD1yS6g18btLOHD+Rw/uApVln5pBDYgjbw570S/Q1 /4RobSy+NqwHGN4fPZQFe70//1GfDfmAihMluBgkOe+xxB0VFAZWK1+ztz8atPOeTj+ibYNINTMvqc t+z6UYdGUA2yfzS+vcfKrEzucwD/ZKGiK+Fp X-ML-Name: ruby-core X-Mail-Count: 72154 Subject: [ruby-core:72154] [Ruby trunk - Feature #11815] Proposal for method `Array#difference` X-BeenThere: ruby-core@ruby-lang.org X-Mailman-Version: 2.1.15 Precedence: list Reply-To: Ruby developers List-Id: Ruby developers List-Unsubscribe: , List-Post: List-Help: List-Subscribe: , Errors-To: ruby-core-bounces@ruby-lang.org Sender: "ruby-core" Issue #11815 has been updated by Daniel P. Clark. Yeah. Ideally, in my opinion, there would be an `Enumerator#difference` and an `Array#difference` as an alias to `Enumerator#difference.send :to_a` One thing I really don't like about my Enumerator example is the duplication of an entire Array with `other.dup`. I would like a more memory efficient way to iterate over "other" with one reference at a time and still have the destructive Array#delete_at methodology. It would probably work best if the Array was implemented as a singly linked list and for every occurrence of delete we could create a new "single" reference with the pointer skipping that deleted item. ---------------------------------------- Feature #11815: Proposal for method `Array#difference` https://bugs.ruby-lang.org/issues/11815#change-55566 * Author: Cary Swoveland * Status: Open * Priority: Normal * Assignee: ---------------------------------------- I propose that a method `Array#difference` be added to the Ruby core. It is similar to [Array#-](http://ruby-doc.org/core-2.2.0/Array.html#method-i-2D) but for each element of the (array) argument it removes only one matching element from the receiver. For example: a = [1,2,3,4,3,2,2,4] b = [2,3,4,4,4] a - b #=> [1] c = a.difference b #=> [1, 3, 2, 2] As you see, `a` contains three `2`'s and `b` contains `1`, so the first `2` in `a` has been removed from `a` in constructing `c`. When `b` contains as least as many instances of an element as does `a`, `c` contains no instances of that element. It could be implemented as follows: class Array def difference(other) dup.tap do |cpy| other.each do |e| ndx = cpy.index(e) cpy.delete_at(ndx) if ndx end end end end Here are a few examples of its use: *Identify an array's unique elements* a = [1,3,2,4,3,4] u = a.uniq #=> [1, 2, 3, 4] u - a.difference(u) #=> [1, 2] *Determine if two words of the same size are anagrams of each other* w1, w2 = "stop", "pots" w1.chars.difference(w2.chars).empty? #=> true *Identify a maximal number of 1-1 matches between the elements of two arrays and return an array of all elements from both arrays that were not matched* a = [1, 2, 4, 2, 1, 7, 4, 2, 9] b = [4, 7, 3, 2, 2, 7] a.difference(b).concat(b.difference(a)) #=> [1, 1, 4, 2, 9, 3, 7] To remove elements from `a` starting at the end (rather the beginning) of `a`: a = [1,2,3,4,3,2,2,4] b = [2,3,4,4,4] a.reverse.difference(b).reverse #=> [1,2,3,2] `Array#difference!` could be defined in the obvious way. -- https://bugs.ruby-lang.org/