Created
February 25, 2012 01:15
-
-
Save stevenyxu/1905081 to your computer and use it in GitHub Desktop.
Array#uniq in Ruby 1.8.7
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ~~ [EqualA, EqualB].uniq ~~ | |
| EqualA: hash | |
| EqualB: hash | |
| [EqualA, EqualB] | |
| ~~ [EqualA, EqualB, EqualC].uniq ~~ | |
| EqualA: hash | |
| EqualB: hash | |
| EqualC: hash | |
| [EqualA, EqualB, EqualC] | |
| ~~ [EqualHashA, EqualHashB].uniq ~~ | |
| EqualHashA: hash | |
| EqualHashB: hash | |
| EqualHashB: eql? against EqualHashA | |
| [EqualHashA, EqualHashB] | |
| ~~ [EqualHashA, EqualHashB, EqualHashC].uniq ~~ | |
| EqualHashA: hash | |
| EqualHashB: hash | |
| EqualHashB: eql? against EqualHashA | |
| EqualHashC: hash | |
| EqualHashC: eql? against EqualHashB | |
| EqualHashC: eql? against EqualHashA | |
| [EqualHashA, EqualHashB, EqualHashC] | |
| ~~ [EqualHashAndEqlA, EqualHashAndEqlB].uniq ~~ | |
| EqualHashAndEqlA: hash | |
| EqualHashAndEqlB: hash | |
| EqualHashAndEqlB: eql? against EqualHashAndEqlA | |
| EqualHashAndEqlA: hash | |
| EqualHashAndEqlB: hash | |
| [EqualHashAndEqlA] | |
| ~~ [EqualHashAndEqlA, EqualHashAndEqlB, EqualHashAndEqlC].uniq ~~ | |
| EqualHashAndEqlA: hash | |
| EqualHashAndEqlB: hash | |
| EqualHashAndEqlB: eql? against EqualHashAndEqlA | |
| EqualHashAndEqlC: hash | |
| EqualHashAndEqlC: eql? against EqualHashAndEqlA | |
| EqualHashAndEqlA: hash | |
| EqualHashAndEqlB: hash | |
| EqualHashAndEqlC: hash | |
| [EqualHashAndEqlA] | |
| ~~ [EqualHashAndEqlA, EqualHashAndEqlB, EqualHashAndEqlC, EqualHashAndEqlD].uniq ~~ | |
| EqualHashAndEqlA: hash | |
| EqualHashAndEqlB: hash | |
| EqualHashAndEqlB: eql? against EqualHashAndEqlA | |
| EqualHashAndEqlC: hash | |
| EqualHashAndEqlC: eql? against EqualHashAndEqlA | |
| EqualHashAndEqlD: hash | |
| EqualHashAndEqlD: eql? against EqualHashAndEqlA | |
| EqualHashAndEqlA: hash | |
| EqualHashAndEqlB: hash | |
| EqualHashAndEqlC: hash | |
| EqualHashAndEqlD: hash | |
| [EqualHashAndEqlA] |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| class Equal | |
| attr_accessor :name | |
| def initialize(name) | |
| @name = name | |
| end | |
| def inspect | |
| @name | |
| end | |
| def hash | |
| puts "#{name}: hash" | |
| super | |
| end | |
| def eql?(co) | |
| puts "#{name}: eql? against #{co.name}" | |
| super | |
| end | |
| def ==(co) | |
| puts "#{name}: == against #{co.name}" | |
| super | |
| end | |
| end | |
| EqualA = Equal.new('EqualA') | |
| EqualB = Equal.new('EqualB') | |
| EqualC = Equal.new('EqualC') | |
| puts | |
| def run(cmd) | |
| puts "~~ #{cmd} ~~" | |
| puts eval(cmd).inspect | |
| puts | |
| end | |
| run '[EqualA, EqualB].uniq' | |
| run '[EqualA, EqualB, EqualC].uniq' | |
| class EqualHash < Equal | |
| def hash | |
| puts "#{name}: hash" | |
| 1000 | |
| end | |
| end | |
| EqualHashA = EqualHash.new('EqualHashA') | |
| EqualHashB = EqualHash.new('EqualHashB') | |
| EqualHashC = EqualHash.new('EqualHashC') | |
| puts | |
| run '[EqualHashA, EqualHashB].uniq' | |
| run '[EqualHashA, EqualHashB, EqualHashC].uniq' | |
| class EqualHashAndEql < EqualHash | |
| def eql?(co) | |
| puts "#{name}: eql? against #{co.name}" | |
| true | |
| end | |
| end | |
| EqualHashAndEqlA = EqualHashAndEql.new('EqualHashAndEqlA') | |
| EqualHashAndEqlB = EqualHashAndEql.new('EqualHashAndEqlB') | |
| EqualHashAndEqlC = EqualHashAndEql.new('EqualHashAndEqlC') | |
| EqualHashAndEqlD = EqualHashAndEql.new('EqualHashAndEqlD') | |
| puts | |
| run '[EqualHashAndEqlA, EqualHashAndEqlB].uniq' | |
| run '[EqualHashAndEqlA, EqualHashAndEqlB, EqualHashAndEqlC].uniq' | |
| run '[EqualHashAndEqlA, EqualHashAndEqlB, EqualHashAndEqlC, EqualHashAndEqlD].uniq' |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment