RubMat 2.1.5 → 2.1.6

data/README.md

@@ -0,0 +1,9 @@
+   RubMat  
+============
+
+Docs link is http://github.com/regularlambda/RubMat/doc/index.html
+
+Special thanks for Emirhan Aksu for his contributions
+Special thanks for Martin Watson for his contributions
+
+Works like a charm!

data/Rakefile

@@ -8,15 +8,14 @@ require 'rake/testtask'
 
 spec = Gem::Specification.new do |s|
   s.name = 'RubMat'
-  s.version = '2.1.5'
-  s.has_rdoc = true
-  s.extra_rdoc_files = ['README', 'LICENSE', 'gplv3.png', 'RubMat.png']
+  s.version = '2.1.6'
+  s.extra_rdoc_files = ['README.md', 'LICENSE', 'gplv3.png', 'RubMat.png']
   s.summary = 'Discrete Mathematics solver and Usable Library'
   s.description = s.summary
-  s.author = 'Matthew Manahan'
+  s.author = 'Mahmut Bulut'
   s.email = 'scienceblock@gmail.com'
-  # s.executables = ['your_executable_here']
-  s.files = %w(LICENSE README Rakefile gplv3.png RubMat.png) + Dir.glob("{bin,lib,spec}/**/*")
+  s.executables = ['rubmat.rb']
+  s.files = %w(LICENSE README.md Rakefile gplv3.png RubMat.png) + Dir.glob("{bin,lib,spec}/**/*")
   s.require_path = "lib"
   s.bindir = "bin"
   s.homepage = 'http://regularlambda.github.com/RubMat'
@@ -28,14 +27,14 @@ Rake::GemPackageTask.new(spec) do |p|
   p.need_zip = true
 end
 
-Rake::RDocTask.new do |rdoc|
-  files =['README', 'LICENSE', 'lib/**/*.rb', 'lib/**/*.yml']
-  rdoc.rdoc_files.add(files)
-  rdoc.main = "README" # page to start on
-  rdoc.title = "RubMat Docs"
-  rdoc.rdoc_dir = 'doc/rdoc' # rdoc output folder
-  rdoc.options << '--line-numbers'
-end
+#Rake::RDocTask.new do |rdoc|
+#  files =['README.md', 'LICENSE', 'lib/**/*.rb', 'lib/**/*.yml']
+#  rdoc.rdoc_files.add(files)
+#  rdoc.main = "README" # page to start on
+#  rdoc.title = "RubMat Docs"
+#  rdoc.rdoc_dir = 'doc/rdoc' # rdoc output folder
+#  rdoc.options << '--line-numbers'
+#end
 
 Rake::TestTask.new do |t|
   t.test_files = FileList['test/**/*.rb']

data/bin/rubmat.rb

@@ -0,0 +1,124 @@
+#!/usr/bin/env ruby
+
+# AUTHOR: Mahmut Bulut
+require 'rubygems'
+require 'yaml'
+require 'librbdiscrete.rb'
+require 'fixnumexpand.rb'
+require 'commander'
+require 'help'
+
+puts "===RubMat===
+    Copyright (C) <2011>  <Mahmut Bulut>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type 'help'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `certain' for details."
+puts ""
+begin
+command = ask(">=> ")
+#command = commn.chomp!
+  # Read arguments and defines commands
+  # Will handle command line whitespaces
+  
+  if (command == 'help')
+    puts help()
+  end
+  if (command == 'certain')
+    puts "To see certain conditions please visit http://www.gnu.org/licenses/gpl-2.0.html#SEC3"
+  end
+  if (command == 'factorial')
+    n = ask("Enter N value: ", Integer)
+    puts factorial(n)
+  end
+  if (command == 'binsearch')
+    begin
+    binary = ask("Enter array name with [ & ] suffix: ")
+    size = ask("Enter size of search range: ", Integer)
+    search_key = ask("Enter search delimiter key", Integer)
+    low = ask("Lower limit: ", Integer)
+    middle = ask("Medium limit: ", Integer)
+    high = ask("High limit: ", Integer)
+    puts binary_search(binary, size, search_key, low, middle, high)
+    rescue => error
+    puts error
+    end
+  end
+  if (command == 'birdseye')
+    n = ask("Enter workspace mass number: ", Integer)
+    k = ask("Enter selection mass number: ", Integer)
+    puts birds_eye(n, k)
+  end
+  if (command == 'combinatorial')
+    glb = ask("Enter global set objects number: ", Integer)
+    ksb = ask("Enter k-subset objects number: ", Integer)
+    puts combinatorial(glb, ksb)
+  end
+  if (command == 'distpres')
+    presnum = ask("Present number: ", Integer)
+    puts dist_pres(presnum)
+  end
+  if (command == 'eagleview')
+    m = ask("Enter m value: ", Integer)
+    t = ask("Enter t value: ", Integer)
+    puts eagle_view(m, t)
+  end
+  if (command == 'fermatlittle')
+    p = ans("Enter power number: ", Integer)
+    a = ans("Enter base number:", Integer)
+    puts fermat_little(p, a)
+  end
+  if (command == 'fib')
+    n = ans("Enter the last incremental number: ", Integer)
+    puts fib(n)
+  end
+  if (command == 'isprime')
+    raise RuntimeError.new("Have some critical issues closed to next minor version")
+#    nb = ask("Control number: ", Integer)
+#    puts is_prime(nb)
+  end
+  if (command == 'iterativefact')
+    begin
+      itrtnum = ask("Enter the factorial input: ", Integer)
+      throw :ball if (itrtnum >= MAX_INTEGER)
+      puts iterative_fact(itrtnum)
+    end
+    catch(:ball) do
+      raise ArgumentError.new("iterative factorial couldn't take this value's load. Terminated.")
+    end
+  end
+  if (command == 'sigma')
+    inta = ask("Enter a value: ", Integer)
+    intx = ask("Enter x value: ", Integer)
+    intb = ask("Enter b value: ", Integer)
+    pw = ask("Enter power value: ", Integer)
+    puts sigma(inta, intx, intb, pw)
+  end
+  if (command == 'stirling')
+    begin
+    strln = ask("Enter stirling procedure value: ", Integer)
+    throw :glass if (strln >= MAX_INTEGER)
+    puts stirling(strln)
+    end
+    catch(:glass) do
+      raise ArgumentError.new("stirling couldn't take this value's load. Terminated.")
+    end
+  end
+  if (command == 'subset')
+    gen = ask("Enter mass objects number: ", Integer)
+    zerosbst = agree("Include zero subset?")
+    puts subset(gen, zerosbst)
+  end
+  if (command == 'fibsum')
+    n = ask("Enter n value: ", Integer)
+    puts sum_of_fib(n)
+  end
+  if (command == 'twinprdx')
+    mass = ask("Enter mass number: ", Integer)
+    puts twin_prdx(mass)
+  end
+  if (command == 'uipow')
+    base = ask("Enter base value: ", Integer)
+    exp = ask("Enter power value: ", Integer)
+    puts ui_pow(base, exp)
+  end
+end until(command == 'exit')

data/lib/help.rb

@@ -0,0 +1,40 @@
+#!/usr/bin/env ruby
+def help
+puts "
+Valid Commands
+===============
+help              Show this manpage
+certain           Show certain conditions page
+factorial         Recursive definition of factorial
+                  'n' is the number which will calculated in procedure
+binsearch         *binary => array
+                  *size => binary array's size
+                  *search_key => Compare string
+                    *General values
+                        *low => low value representation
+                        *middle => middle value representation
+                        *high => high value representation
+birdseye          Bird's Eye View Procedure
+combinatorial     'glb' represents is General mass of combinatorial approach
+                  'klb' represents is Selection mass of combinatorial approach
+distpres          'presnum' value represents Present count.
+eagleview         Eagle View Procedure
+fermatlittle      Fermat Little Theorem's Procedural Representation
+fib               Additive recursive definition of Fibonacci
+isprime           Is Prime Procedure
+                  'nb' is the input argument number of procedure
+iterativefact     Iterative factorial of procedural representation
+sigma             Sigma procedure's simple procedure is rely on '(ax+b)^pw'
+                  a represented by inta;
+                  b represented by intb;
+                  x represented by intx;
+                  power represented by pw.
+stirling          'strln' is the stirling number in stirling formula
+subset            'zerosbst' variable, decision mechanism of zero subset is included or not included
+                  'gen' is the general mass elements(objects) number
+fibsum            Fibonacci Sum Procedure
+twinprdx          Twin Paradox Lemma Solution Procedure
+                  Selection mass represented by 'mass' value
+uipow             Non-balanced power calculation procedure
+"
+end

data/lib/librbdiscrete.rb

@@ -5,6 +5,7 @@ require 'yaml'
 
 EVALUE = 2.718281828459045235360287471352662497757247093
 PIVALUE = 3.141592653589793238462643383279502884197169399
+MAX_INTEGER = 1073741823
 
 err = "An error occured during during procedure"
 
@@ -20,7 +21,7 @@ factorial(n)
 Iterative factorial definition
 =end
 def factorial( n )
-    if n <= 1
+    if (n <= 1)
         return 1
     else
         return n*factorial( n-1 ).to_i
@@ -78,21 +79,19 @@ Subset Procedure v1.1.3
 = SYNOPSIS
 subset(gen, zerosbst)
 'zerosbst' variable, decision mechanism of zero subset is included or not included
-'gen' is the 
+'gen' is the general mass elements(objects) number
 
 = DESCRIPTION
 Calculate subset number of input arguments
 =end
 def subset(gen, zerosbst)
     main = case (zerosbst)
-    when zerosbst == 'y'
+    when zerosbst == true
             rslt = ui_pow(2, gen) - 1
             return rslt
-    when zerosbst == 'n'
+    when zerosbst == false
             rslt = ui_pow(2, gen)
             return rslt
-    else
-            puts "Enter 'y' or 'n' char"
     end
     return main
 end
@@ -247,7 +246,7 @@ Additive recursive definition of Fibonacci
 def fib(n)
     if (n <= 1) 
         return n;
-    elsif 
+    else
         return fib(n-1)+fib(n-2);
     end
 end
@@ -286,11 +285,11 @@ end
 Binary Search Spec. Procedure v1.5.9
 
 = SYNOPSIS
-binary_search(binary, size, searchKey, low, middle, high)
+binary_search(binary, size, search_key, low, middle, high)
 == Binary search
 *binary => array
 *size => binary array's size
-*searchKey => Compare string
+*search_key => Compare string
 *General values
   *low => low value representation
   *middle => middle value representation
@@ -299,13 +298,13 @@ binary_search(binary, size, searchKey, low, middle, high)
 = DESCRIPTION
 Binary search
 =end
-def binary_search(binary, size, searchKey, low, middle, high)
+def binary_search(binary, size, search_key, low, middle, high)
     while (low <= high)
         middle=(low+high)/2;
         print_row(binary, size, low, middle, high);
-        if (searchKey == binary[middle])
+        if (search_key == binary[middle])
             return middle;
-        elsif (searchKey <= binary[middle])
+        elsif (search_key <= binary[middle])
             high=middle-1
         else 
             low=middle+1
@@ -351,7 +350,7 @@ sum_of_fib(n)
 Basic reps
 
 = DESCRIPTION
-Bird's Eye View Procedure
+Fibonacci Sum Procedure
 =end
 def sum_of_fib(n)
    return fib(n+2)-1;
@@ -375,18 +374,18 @@ Is Prime Procedure
 =end
 def is_prime(nb)
     test = count = 0
-    if (nb != 1)
+    if (nb == 1)
         return -1
     end
     for i in 2..nb-1
         count++
         if (nb % i == 0)
-            test = 1
+            test = false
         end
     end
     if (!test)
         return 1
-    elsif
+    else
         return 0
     end
 end
@@ -404,9 +403,34 @@ Fermat Little Theorem's Procedural Representation
 (('WARNING'))((-Modular representation maybe couldn't evaluated-))
 =end
 def fermat_little(p, a)
+  begin
     if(p%(ui_pow(a, (p-1))-1) == 0)
         return 0
-    elsif
+    else
         return 1
     end
+  end
+rescue
+  begin
+    ArgumentError.new("High load. Terminated.")
+  end
+end
+
+=begin
+= NAME
+to_bool v.0.0.1
+
+=SYNOPSIS
+to_bool(void)
+=DESCRIPTION
+to bool is convert integer valus to string boolean
+=end
+def to_bool
+  if (self.to_bool == 1)
+    puts "TRUE"
+  elsif (self.to_bool == 0)
+    puts "FALSE"
+  elsif (self.to_bool == -1)
+    puts "NaN"
+  end
 end

data/lib/rubmat.rb

@@ -0,0 +1,124 @@
+#!/usr/bin/env ruby
+
+# AUTHOR: Mahmut Bulut
+require 'rubygems'
+require 'yaml'
+require 'librbdiscrete.rb'
+require 'fixnumexpand.rb'
+require 'commander'
+require 'help'
+
+puts "===RubMat===
+    Copyright (C) <2011>  <Mahmut Bulut>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type 'help'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `certain' for details."
+puts ""
+begin
+command = ask(">=> ")
+#command = commn.chomp!
+  # Read arguments and defines commands
+  # Will handle command line whitespaces
+  
+  if (command == 'help')
+    puts help()
+  end
+  if (command == 'certain')
+    puts "To see certain conditions please visit http://www.gnu.org/licenses/gpl-2.0.html#SEC3"
+  end
+  if (command == 'factorial')
+    n = ask("Enter N value: ", Integer)
+    puts factorial(n)
+  end
+  if (command == 'binsearch')
+    begin
+    binary = ask("Enter array name with [ & ] suffix: ")
+    size = ask("Enter size of search range: ", Integer)
+    search_key = ask("Enter search delimiter key", Integer)
+    low = ask("Lower limit: ", Integer)
+    middle = ask("Medium limit: ", Integer)
+    high = ask("High limit: ", Integer)
+    puts binary_search(binary, size, search_key, low, middle, high)
+    rescue => error
+    puts error
+    end
+  end
+  if (command == 'birdseye')
+    n = ask("Enter workspace mass number: ", Integer)
+    k = ask("Enter selection mass number: ", Integer)
+    puts birds_eye(n, k)
+  end
+  if (command == 'combinatorial')
+    glb = ask("Enter global set objects number: ", Integer)
+    ksb = ask("Enter k-subset objects number: ", Integer)
+    puts combinatorial(glb, ksb)
+  end
+  if (command == 'distpres')
+    presnum = ask("Present number: ", Integer)
+    puts dist_pres(presnum)
+  end
+  if (command == 'eagleview')
+    m = ask("Enter m value: ", Integer)
+    t = ask("Enter t value: ", Integer)
+    puts eagle_view(m, t)
+  end
+  if (command == 'fermatlittle')
+    p = ans("Enter power number: ", Integer)
+    a = ans("Enter base number:", Integer)
+    puts fermat_little(p, a)
+  end
+  if (command == 'fib')
+    n = ans("Enter the last incremental number: ", Integer)
+    puts fib(n)
+  end
+  if (command == 'isprime')
+    raise RuntimeError.new("Have some critical issues closed to next minor version")
+#    nb = ask("Control number: ", Integer)
+#    puts is_prime(nb)
+  end
+  if (command == 'iterativefact')
+    begin
+      itrtnum = ask("Enter the factorial input: ", Integer)
+      throw :ball if (itrtnum >= MAX_INTEGER)
+      puts iterative_fact(itrtnum)
+    end
+    catch(:ball) do
+      raise ArgumentError.new("iterative factorial couldn't take this value's load. Terminated.")
+    end
+  end
+  if (command == 'sigma')
+    inta = ask("Enter a value: ", Integer)
+    intx = ask("Enter x value: ", Integer)
+    intb = ask("Enter b value: ", Integer)
+    pw = ask("Enter power value: ", Integer)
+    puts sigma(inta, intx, intb, pw)
+  end
+  if (command == 'stirling')
+    begin
+    strln = ask("Enter stirling procedure value: ", Integer)
+    throw :glass if (strln >= MAX_INTEGER)
+    puts stirling(strln)
+    end
+    catch(:glass) do
+      raise ArgumentError.new("stirling couldn't take this value's load. Terminated.")
+    end
+  end
+  if (command == 'subset')
+    gen = ask("Enter mass objects number: ", Integer)
+    zerosbst = agree("Include zero subset?")
+    puts subset(gen, zerosbst)
+  end
+  if (command == 'fibsum')
+    n = ask("Enter n value: ", Integer)
+    puts sum_of_fib(n)
+  end
+  if (command == 'twinprdx')
+    mass = ask("Enter mass number: ", Integer)
+    puts twin_prdx(mass)
+  end
+  if (command == 'uipow')
+    base = ask("Enter base value: ", Integer)
+    exp = ask("Enter power value: ", Integer)
+    puts ui_pow(base, exp)
+  end
+end until(command == 'exit')

data/lib/statics.yml

@@ -1,4 +1,4 @@
-## AUTHOR : Matthew Manahan
+## AUTHOR : Mahmut Bulut
 ---
 EVALUE: 2.718281828459045235360287471352662497757247093
 PIVALUE: 3.141592653589793238462643383279502884197169399

metadata

@@ -1,43 +1,45 @@
 --- !ruby/object:Gem::Specification 
 name: RubMat
 version: !ruby/object:Gem::Version 
-  hash: 1
+  hash: 7
   prerelease: 
   segments: 
   - 2
   - 1
-  - 5
-  version: 2.1.5
+  - 6
+  version: 2.1.6
 platform: ruby
 authors: 
-- Matthew Manahan
+- Mahmut Bulut
 autorequire: 
 bindir: bin
 cert_chain: []
 
-date: 2011-06-20 00:00:00 Z
+date: 2011-07-08 00:00:00 Z
 dependencies: []
 
 description: Discrete Mathematics solver and Usable Library
 email: scienceblock@gmail.com
-executables: []
-
+executables: 
+- rubmat.rb
 extensions: []
 
 extra_rdoc_files: 
-- README
+- README.md
 - LICENSE
 - gplv3.png
 - RubMat.png
 files: 
 - LICENSE
-- README
+- README.md
 - Rakefile
 - gplv3.png
 - RubMat.png
+- bin/rubmat.rb
 - lib/fixnumexpand.rb
+- lib/help.rb
 - lib/librbdiscrete.rb
-- lib/main.rb
+- lib/rubmat.rb
 - lib/statics.yml
 homepage: http://regularlambda.github.com/RubMat
 licenses: []

data/README

@@ -1,4 +0,0 @@
-== RubMat ==
-============
-
-DOCUMENTATION OF PROJECT

data/lib/main.rb

@@ -1,13 +0,0 @@
-#!/usr/bin/ruby
-
-# AUTHOR: Matthew Manahan
-
-require 'yaml'
-require 'librbdiscrete.rb'
-require 'fixnumexpand.rb'
-
-puts "===RubMat===
-    Copyright (C) <2011>  <Matthew Manahan>
-    This program comes with ABSOLUTELY NO WARRANTY; for details type 'help'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `certain' for details."