multiplicative_roman_numerals 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: c9a72b9d68de5fa39658ed9f7824de99595f5392
+  data.tar.gz: e6fffccdb9bb9c83e6ea1e281d6b469fcb825b39
+SHA512:
+  metadata.gz: 8f59f2c6c72df6cbe7c7b00b0a2184b29dcfd8abfe43ddc9a38d4fd97a4283643758d8b9246b69cee6dcc8ec5bd7df88dabe90fe9998a489db73dcbe2caff949
+  data.tar.gz: 53d4ac6c4d8a4a4a60d21891600407c483839c17d5d751d7edd27ab429ef5b9b5efc39dde83b7394bac705387befaddc85c9e329216f299a18ae977c106c07de

data/Tests/multiplicative_roman_numerals_tests.rb

@@ -0,0 +1,72 @@
+$LOAD_PATH << '.' << '../' << 'lib/'
+require 'test/unit'
+require 'multiplicative_roman_numerals'
+
+class MultRomanNumTests < Test::Unit::TestCase
+
+  attr_accessor :converter
+
+  def setup
+    @converter = MultRomanNum.new
+  end
+
+  def test_valid_token
+    random_nr = Random.rand(10000)
+    roman_nr = converter.int_to_roman(random_nr)
+
+    # Smells, but works
+    valid_token = !roman_nr.match(/[^IVXLCDM\*\s]+/i)
+    assert(valid_token)
+  end
+
+  def test_communtative
+    assert_equal(249, converter.roman_to_int("XLCCIX"))
+  end
+
+  def test_sanity_roman_int_roman
+    assert_equal("MMXIII",
+                 converter.int_to_roman(converter.roman_to_int("MMXIII")))
+  end
+
+  def test_sanity_int_roman_int
+    nr = 2013
+
+    assert_equal(nr,
+                 converter.roman_to_int(converter.int_to_roman(nr)))
+  end
+
+  def test_tokens_int_roman
+    assert_equal("", converter.int_to_roman(0))
+    assert_equal( "I", converter.int_to_roman(1))
+    assert_equal("IV", converter.int_to_roman(4))
+    assert_equal( "V", converter.int_to_roman(5))
+    assert_equal("IX", converter.int_to_roman(9))
+    assert_equal( "X", converter.int_to_roman(10))
+    assert_equal("XL", converter.int_to_roman(40))
+    assert_equal( "L", converter.int_to_roman(50))
+    assert_equal("XC", converter.int_to_roman(90))
+    assert_equal( "C", converter.int_to_roman(100))
+    assert_equal("CD", converter.int_to_roman(400))
+    assert_equal( "D", converter.int_to_roman(500))
+    assert_equal("CM", converter.int_to_roman(900))
+    assert_equal( "M", converter.int_to_roman(1000))
+  end
+
+  def test_tokens_roman_int
+    assert_equal(0, converter.roman_to_int(""))
+    assert_equal(1, converter.roman_to_int("I"))
+    assert_equal(4, converter.roman_to_int("IV"))
+    assert_equal(5, converter.roman_to_int("V"))
+    assert_equal(9, converter.roman_to_int("IX"))
+    assert_equal(10, converter.roman_to_int("X"))
+    assert_equal(40, converter.roman_to_int("XL"))
+    assert_equal(50, converter.roman_to_int("L"))
+    assert_equal(90, converter.roman_to_int("XC"))
+    assert_equal(100, converter.roman_to_int("C"))
+    assert_equal(400, converter.roman_to_int("CD"))
+    assert_equal(500, converter.roman_to_int("D"))
+    assert_equal(900, converter.roman_to_int("CM"))
+    assert_equal(1000, converter.roman_to_int("M"))
+  end
+
+end

data/lib/multiplicative_roman_numerals.rb

@@ -0,0 +1,62 @@
+class MultRomanNum
+  attr_reader :terminals, :special
+
+  def initialize
+    @special = [["CM", 900], ["CD" ,  400], ["XC" ,  90], ["XL" ,  40],
+      ["IX" ,  9], ["IV" ,  4]]
+    @terminals = [["M" ,  1000], ["D" ,  500], ["C" ,  100], ["L" ,  50],
+      ["X" ,  10], ["V" ,  5], ["I" ,  1]]
+    @multiplier = [["* " ,  0]]
+    @lang = @terminals.concat(@special).sort{ |x,y|
+      y[1] <=> x[1]
+    }
+  end
+
+  def roman_to_int(input)
+    result = 0
+    inputArr = input.split("")
+
+    lookahead = []
+    inputArr.each_with_index do |val, i|
+      if lookahead != []
+        lookahead = []
+        next
+      end
+
+      if input[i+1] != nil
+        conc = val + input[i+1]
+        lookahead = @special.select{
+          |s| s.include? conc
+        }
+      end
+
+      if lookahead != []
+        result += lookahead[0][1]
+      else
+        result += @terminals.select{
+          |s| s.include? val
+        }[0][1]
+      end
+    end
+
+    result
+  end
+
+  def int_to_roman(input)
+    result = ""
+
+    @lang.each_index{ |i|
+      val = @lang[i][1]
+      key = @lang[i][0]
+      x = input/val
+      if x > 0
+        x.times do
+          result += key.to_s
+        end
+        input -= x*val
+      end
+    }
+
+    result
+  end
+end

metadata

@@ -0,0 +1,47 @@
+--- !ruby/object:Gem::Specification
+name: multiplicative_roman_numerals
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- bentz, larmeh
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-02-13 00:00:00.000000000 Z
+dependencies: []
+description: |-
+  Roman numerals library capable of generating short numerals
+    for large numbers.
+email: larmeh@tzi.de
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- Tests/multiplicative_roman_numerals_tests.rb
+- lib/multiplicative_roman_numerals.rb
+homepage: http://rubygems.org/gems/multiplicative_roman_numerals
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.2.2
+signing_key: 
+specification_version: 4
+summary: Yet another roman numerals lib.
+test_files: []