shadchan 0.0.1

data/.gitignore

@@ -0,0 +1,3 @@
+pkg/*
+*.gem
+.bundle

data/Gemfile

@@ -0,0 +1,4 @@
+source "http://rubygems.org"
+
+# Specify your gem's dependencies in shadchan.gemspec
+gemspec

data/Rakefile

@@ -0,0 +1,2 @@
+require 'bundler'
+Bundler::GemHelper.install_tasks

data/lib/shadchan.rb

@@ -0,0 +1,4 @@
+module Shadchan
+  libdir = File.join(File.dirname(File.expand_path(__FILE__)), self.name.downcase, '')
+  require libdir + 'shadchan.rb' # Your code goes here...
+end

data/lib/shadchan/shadchan.rb

@@ -0,0 +1,131 @@
+module Shadchan
+  class Shadchan
+=begin rdoc
+Create a new instance of stable marriage problem.
+Instance will be imediately solved and object can be queried for results.
+
+parameters - preference lists.
+accepts arrays of preferences ('women' first), which contain integers. Length
+of preference list must correspond with their number.
+There must be equal number of men and women and lists must be valid.
+
+Example:
+  Shadchan.new [0, 1], [1, 0], [0, 1], [0, 1]
+
+Woman no.0 prefers Man 0 before Man 1.
+Woman no.1 prefers Man 1 before Man 0.
+Man no.0 prefers Woman 0 before Woman 1.
+Man no.1 prefers Woman 0 before Woman 1.
+=end
+    def initialize *args
+      check_input args
+      @women = args.shift(args.size/2)
+      @men = args
+      @size = @men.size
+      stable_matching
+      raise(StandardError, 'Found solution not stable') unless check_solution
+      self
+    end
+=begin rdoc
+Returns matched pairs [woman, man].
+=end
+    def match
+      result = []
+      @matches.each_with_index do |m, w|
+        result << [w, m]
+      end
+      return result
+    end
+=begin rdoc
+Returns matches for men
+Match of man 0 -
+  s.match_men[0]
+=end
+    def match_men
+      result = match
+      match.sort_by(&:last).map(&:first)
+    end
+=begin rdoc
+Returnes matches for women
+Match of woman 0 -
+  s.match_men[0]
+=end
+    def match_women
+      @matches.dup
+    end
+    private
+    def stable_matching
+      men_preferences = @men.map(&:dup)
+      matches = Array.new(@size)
+      while m = free_man_proposable(men_preferences, matches, @size)
+        w = men_preferences[m].shift
+        unless matches[w] then
+          matches[w] = m
+          next
+        end
+        if @women[w].find_index(m) < @women[w].find_index(matches[w]) then
+        # if the men is better match then current match
+          matches[w] = m
+        end
+      end
+      @matches = matches
+    end
+
+    def free_man_proposable m, matches, size
+      @size.times do |i|
+        free = !matches.include?(i)
+        proposable = !m[i].empty?
+        if free and proposable then
+          return i
+        end
+      end
+      return nil
+    end
+
+=begin rdoc
+Checks argument if they are valid SM problem.
+It should not be empty.
+It should have equal number of men and women
+It should state preference for all women and for all men.
+It should not state preference twice for one men/women.
+=end
+    def check_input args
+      raise ArgumentError, 'No arguments given' if args.empty?
+      size = args.first.size
+      
+      unless args.all?{|w| w.size == size} then
+        raise ArgumentError, 'Incorrectly specified input - inconsistent preference list size. Check your input.'
+      end
+      
+      unless args.size == size*2 then
+        raise ArgumentError, 'Incorrect number of men or women. Check your input.'
+      end
+
+      args.each do |w|
+        size.times do |i|
+          raise ArgumentError, 'Error in input - it must be 0..number of men' unless w.include? i
+        end
+      end
+    end
+
+
+=begin rdoc
+Checks if the found solution is valid. It should always be, but better safe then sorry.
+Tries to find blocking pairs (m, w), (m', w') such that
+w' >m w AND m >w' m'
+=end
+    def check_solution
+      @matches.each_with_index do |m, w|
+        #check woman
+        w_better_candidates = @women[w].take(@women[w].find_index(m))
+        # all these are prefered over current spouse. If they prefer her over their current spouse, matching is not stable.
+        w_better_candidates.each do |better_man|
+          spouse = @matches.find_index(better_man)
+          m_better_spouses = @men[better_man].take(@men[better_man].find_index(spouse))
+          return false if m_better_spouses.include? w
+        end
+      end
+      true
+    end
+  end
+end

data/lib/shadchan/version.rb

@@ -0,0 +1,3 @@
+module Shadchan
+  VERSION = "0.0.1"
+end

data/shadchan.gemspec

@@ -0,0 +1,21 @@
+# -*- encoding: utf-8 -*-
+$:.push File.expand_path("../lib", __FILE__)
+require "shadchan/version"
+
+Gem::Specification.new do |s|
+  s.name        = "shadchan"
+  s.version     = Shadchan::VERSION
+  s.platform    = Gem::Platform::RUBY
+  s.authors     = ["Vojtech Salbaba"]
+  s.email       = ["darktatka@gmail.com"]
+  s.homepage    = ""
+  s.summary     = %q{Solves a stable marriage problem}
+  s.description = %q{Solves a stable marriage problem}
+
+  s.rubyforge_project = "shadchan"
+
+  s.files         = `git ls-files`.split("\n")
+  s.test_files    = `git ls-files -- {test,spec,features}/*`.split("\n")
+  s.executables   = `git ls-files -- bin/*`.split("\n").map{ |f| File.basename(f) }
+  s.require_paths = ["lib"]
+end

metadata

@@ -0,0 +1,74 @@
+--- !ruby/object:Gem::Specification 
+name: shadchan
+version: !ruby/object:Gem::Version 
+  hash: 29
+  prerelease: false
+  segments: 
+  - 0
+  - 0
+  - 1
+  version: 0.0.1
+platform: ruby
+authors: 
+- Vojtech Salbaba
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2011-01-15 00:00:00 +01:00
+default_executable: 
+dependencies: []
+
+description: Solves a stable marriage problem
+email: 
+- darktatka@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: 
+- .gitignore
+- Gemfile
+- Rakefile
+- lib/shadchan.rb
+- lib/shadchan/shadchan.rb
+- lib/shadchan/version.rb
+- shadchan.gemspec
+has_rdoc: true
+homepage: ""
+licenses: []
+
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 3
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: shadchan
+rubygems_version: 1.3.7
+signing_key: 
+specification_version: 3
+summary: Solves a stable marriage problem
+test_files: []
+