Skip to content

Implemented Stable Marriage in Ruby #534

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 3 commits into from
Dec 24, 2018
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion CONTRIBUTORS.md
Original file line number Diff line number Diff line change
Expand Up @@ -39,4 +39,5 @@ This file lists everyone, who contributed to this repo and wanted to show up her
- nic-hartley
- crafter312
- Christopher Milan
- Vexatos
- Vexatos
- Björn Heinrichs
84 changes: 84 additions & 0 deletions contents/stable_marriage_problem/code/ruby/stable_marriage.rb
Original file line number Diff line number Diff line change
@@ -0,0 +1,84 @@
class Person
def initialize(id, name, prefs)
@id = id
@name = name
@prefs = prefs
@partner = nil
@choices = 0
end

def lonely?
@partner.nil?
end

def propose(partners)
unless self.lonely?
raise '%s is not lonely!' % self.name
end
choice = @prefs[@choices]
partners[choice].onPropose(self)
@choices += 1
end

def to_s
"#{@name.rjust(20)}: #{self.lonely? && "Lonely" || @partner.name}"
end

def self.generate(size, prefix, r)
Array.new(size){|i|
Person.new(
i,
"#{prefix} #{i}",
(0 ... size).to_a.shuffle(random: r)
)
}
end

protected
attr_reader :id, :name
attr_writer :partner

# Acts upon a given Proposal
def onPropose(partner)
unless self.lonely?
offer = score(partner)
current = score(@partner)
return unless offer > current
@partner.partner = nil
end
@partner = partner
partner.partner = self
end

private
# Determines the preference of a given partner
def score(partner)
return 0 if partner.nil?
@prefs.size - @prefs.index(partner.id)
end
end

# Deterministic Output, feel free to change seed
r = Random.new(42)

# Determines Output Columns
men = Person.generate(4, "Man", r)
women = Person.generate(4, "Woman", r)

# Assume no Name is longer than 20 characters
spacer = '-' * (20 * 2 + 2)

# Solve the Problem
1.step do |round|
singles = men.select(&:lonely?)
singles.each do |m|
m.propose(women)
end

break if singles.empty?

puts "Round #{round}"
puts spacer
puts men, women
puts spacer
end
2 changes: 2 additions & 0 deletions contents/stable_marriage_problem/stable_marriage_problem.md
Original file line number Diff line number Diff line change
Expand Up @@ -21,6 +21,8 @@ I am incredibly interested to see what you guys do and how you implement the alg
## Example Code

{% method %}
{% sample lang="ruby" %}
[import, lang:"ruby"](code/ruby/stable_marriage.rb)
{% sample lang="jl" %}
[import, lang:"julia"](code/julia/stable_marriage.jl)
{% sample lang="py" %}
Expand Down