RubMat 2.1.5

data/LICENSE

@@ -0,0 +1,17 @@
+== RubMat ==
+
+    RubMat == Discrete Mathematics solver and Usable Library
+    Copyright (C) <2011>  <Mahmut Bulut>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.

data/README

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

data/Rakefile

@@ -0,0 +1,42 @@
+
+require 'rubygems'
+require 'rake'
+require 'rake/clean'
+require 'rake/gempackagetask'
+require 'rake/rdoctask'
+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.summary = 'Discrete Mathematics solver and Usable Library'
+  s.description = s.summary
+  s.author = 'Matthew Manahan'
+  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.require_path = "lib"
+  s.bindir = "bin"
+  s.homepage = 'http://regularlambda.github.com/RubMat'
+end
+
+Rake::GemPackageTask.new(spec) do |p|
+  p.gem_spec = spec
+  p.need_tar = true
+  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::TestTask.new do |t|
+  t.test_files = FileList['test/**/*.rb']
+end

data/lib/fixnumexpand.rb

@@ -0,0 +1,35 @@
+#!/usr/bin/ruby
+
+=begin
+= NAME
+Fixnum Expandation Code v1.2.0
+
+= SYNOPSIS
+.seconds =1
+.minutes =60
+.hours =3600
+.days =86400
+.weeks =604800
+
+= DESCRIPTION
+This snippet expands Fixnum class and convert
+time counts to (('string'))((-Object ending string-))
+=end
+
+class Fixnum
+  def seconds
+    self
+  end
+  def minutes
+    self * 60
+  end
+  def hours
+    self * 60 * 60
+  end
+  def days
+    self * 60 * 60 * 24
+  end
+  def weeks
+    self * 60 * 60 * 24 * 7
+  end
+end

data/lib/librbdiscrete.rb

@@ -0,0 +1,412 @@
+#!/usr/bin/ruby
+
+require 'yaml'
+#constants1 = YAML::load_file('statics.yml')
+
+EVALUE = 2.718281828459045235360287471352662497757247093
+PIVALUE = 3.141592653589793238462643383279502884197169399
+
+err = "An error occured during during procedure"
+
+=begin
+= NAME
+Recursive Factorial Procedure Definition v1.1.3
+
+= SYNOPSIS
+factorial(n)
+'n' is the number which will calculated in procedure
+
+= DESCRIPTION
+Iterative factorial definition
+=end
+def factorial( n )
+    if n <= 1
+        return 1
+    else
+        return n*factorial( n-1 ).to_i
+    end
+end
+
+=begin
+= NAME
+Power procedure of two input arguments v2.1.3
+
+= SYNOPSIS
+ui_pow(base, exp)
+'base' argument is the base of power procedure
+'exp' argument is the upscript of power procedure
+
+= DESCRIPTION
+Wide representation of power procedure
+=end
+def ui_pow(base, exp)
+    result = 1;
+    while (exp)
+        if (exp & 1)
+            result *= base
+        end
+        exp >>= 1;
+        base *= base
+    end
+    if(exp==0)
+        result=base
+    end
+    return result
+end
+
+=begin
+= NAME
+Iterative Factorial Procedure v1.0.3
+
+= SYNOPSIS
+Get input arguments from simple argument
+
+= DESCRIPTION
+Iterative factorial of procedural representation
+=end
+def iterative_fact(itrtnum)
+    itrtnum.downto(1) do
+        total *= factorial(itrtnum)
+    end
+    return total
+end
+
+=begin
+= NAME
+Subset Procedure v1.1.3
+
+= SYNOPSIS
+subset(gen, zerosbst)
+'zerosbst' variable, decision mechanism of zero subset is included or not included
+'gen' is the 
+
+= DESCRIPTION
+Calculate subset number of input arguments
+=end
+def subset(gen, zerosbst)
+    main = case (zerosbst)
+    when zerosbst == 'y'
+            rslt = ui_pow(2, gen) - 1
+            return rslt
+    when zerosbst == 'n'
+            rslt = ui_pow(2, gen)
+            return rslt
+    else
+            puts "Enter 'y' or 'n' char"
+    end
+    return main
+end
+
+#/*
+#int subset(void){
+#    char zerosbst;
+#    float rslt=0;int gen=0;
+#    printf("Enter the mass elements number: ");
+#    scanf("%d", &gen);
+#    //Dönmeleri düzelt formatlamaları düzelt, cast ı düzelt
+#    //Elemanları binary string olarak döndür
+#    printf("Want to get  subsets?(y/n)\n");
+#    zerosbst=getchar();
+#    switch (zerosbst){
+#        
+#        case 'y':
+#            rslt = ui_pow(2, gen) - 1;
+#            int rslt = rslt;
+#            printf("%d", rslt);
+#            break;
+#        case 'n':
+#            rslt = ui_pow(2, gen);
+#            //printf("%f", rslt);
+#            break;
+#        default:
+#            puts("Enter y or n char");
+#            break;
+#    }
+#    return EXIT_SUCCESS;
+#}
+#*/
+
+## Combinatorial problems solver
+# 
+# 
+
+=begin
+= NAME
+Combinatorial Procedure v1.1.5
+
+= SYNOPSIS
+combinatorial(glb, ksb)
+'glb' represents is General mass of combinatorial approach
+'klb' represents is Selection mass of combinatorial approach
+
+= DESCRIPTION
+Combinatorial selection number of a input argument mass
+=end
+def combinatorial(glb, ksb)
+    if(glb < ksb)
+        raise RuntimeError.new("Global set cannot be greater than k-subsets")
+    end
+    sbst_given_size = factorial(glb)/(factorial(ksb)*factorial(glb-ksb)).to_f
+    return sbst_given_size
+end
+
+=begin
+= NAME
+Sigma Procedure v1.1.5
+
+= SYNOPSIS
+sigma(inta, intx, intb, pw)
+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.
+
+= DESCRIPTION
+'Sigma of the one unknowned equation' procedure
+=end
+
+def sigma(inta, intx, intb, pw)
+    ttl = 0
+    for i in 1..intx
+        ttl += (inta*intx+intb)
+    end
+    if(pw == 1)
+      return ttl
+    end
+    if(pw > 1)
+        ttl=ui_pow(ttl, pw)
+      return ttl
+    end
+    if(pw == 0)
+      return 1
+    end
+end
+
+=begin
+= NAME
+Stirling Procedure v1.1.5
+
+= SYNOPSIS
+stirling(strln)
+'strln' is the stirling number in stirling formula
+
+= DESCRIPTION
+Stirling Procedure for Stirling Lemma
+=end
+def stirling(strln)
+  return (strln/constants1.EVALUE**strln)*Math.sqrt(2*constants1.PIVALUE*strln);
+end
+
+=begin
+= NAME
+Twin Paradox Lemma Solver v1.1.5
+
+= SYNOPSIS
+twin_prdx(mass)
+Selection mass represented by 'mass' value
+
+= DESCRIPTION
+Twin Paradox Lemma Solution Procedure
+=end
+def twin_prdx(mass)
+    top=1
+    for i in 366..366-mass
+        top *= i
+    end
+    return top/ui_pow(366, mass)
+end
+
+=begin
+= NAME
+Distrubuting Presents Procedure v1.1.3
+
+= SYNOPSIS
+dist_pres(presnum)
+'presnum' value represents Present count.
+
+= DESCRIPTION
+Use of Sequence of factorial and iterative_fact procedures for
+distributing presents.
+=end
+def dist_pres(presnum)
+    return factorial(presnum)/iterative_fact(presnum);
+end
+
+=begin
+= NAME
+Recursive adding of procedure fibonacci
+
+= SYNOPSIS
+fib(n)
+'n' represents recursive definition
+
+= DESCRIPTION
+Additive recursive definition of Fibonacci
+=end
+def fib(n)
+    if (n <= 1) 
+        return n;
+    elsif 
+        return fib(n-1)+fib(n-2);
+    end
+end
+
+=begin
+= NAME
+Printing Row v1.5.5
+
+= SYNOPSIS
+print_row(binary, size, low, mid, high)
+'binary' represents binary array
+'size' represents general size
+'low' represents minimum value of binary array
+'mid' represents middle value of binary array
+'high' represents maximum value of binary array
+
+= DESCRIPTION
+Underly array for printing.
+=end
+def print_row(binary, size, low, mid, high)
+    for i in 0..size-1
+        if (i <low || i > high)
+            print ("     ")
+        end
+        if(i == mid)
+            puts binary[i]
+        end
+        if(nil)
+            puts binary[i]
+        end
+    end
+end
+
+=begin
+= NAME
+Binary Search Spec. Procedure v1.5.9
+
+= SYNOPSIS
+binary_search(binary, size, searchKey, low, middle, high)
+== Binary search
+*binary => array
+*size => binary array's size
+*searchKey => Compare string
+*General values
+  *low => low value representation
+  *middle => middle value representation
+  *high => high value representation
+
+= DESCRIPTION
+Binary search
+=end
+def binary_search(binary, size, searchKey, low, middle, high)
+    while (low <= high)
+        middle=(low+high)/2;
+        print_row(binary, size, low, middle, high);
+        if (searchKey == binary[middle])
+            return middle;
+        elsif (searchKey <= binary[middle])
+            high=middle-1
+        else 
+            low=middle+1
+        end
+    end
+end
+
+=begin
+= NAME
+Bird's Eye View v1.1.3
+
+= SYNOPSIS
+Basic rep.s
+
+= DESCRIPTION
+Bird's Eye View Procedure
+=end
+def birds_eye(n, k)
+    return ((n-k)/(k+1));
+end
+
+=begin
+= NAME
+Eagle View v1.1.3
+
+= SYNOPSIS
+Basic rep.s
+
+= DESCRIPTION
+Eagle View Procedure
+=end
+def eagle_view(m, t)
+    return (EVALUE**((t*t)/m));
+end
+
+=begin
+= NAME
+Sum of Fibonacci Procedure v1.1.1
+
+= SYNOPSIS
+sum_of_fib(n)
+'n' is the number
+Basic reps
+
+= DESCRIPTION
+Bird's Eye View Procedure
+=end
+def sum_of_fib(n)
+   return fib(n+2)-1;
+end
+
+#
+#def fibFormula(long int n)
+#    return (1/Math.sqrt(5))*(powl(((1+sqrt(5))/2), n)-powl(((1-sqrt(5))/2), n));
+#end
+
+=begin
+= NAME
+Is Prime Procedure v1.1.5
+
+= SYNOPSIS
+is_prime(nb)
+'nb' is the input argument number of procedure
+
+= DESCRIPTION
+Is Prime Procedure
+=end
+def is_prime(nb)
+    test = count = 0
+    if (nb != 1)
+        return -1
+    end
+    for i in 2..nb-1
+        count++
+        if (nb % i == 0)
+            test = 1
+        end
+    end
+    if (!test)
+        return 1
+    elsif
+        return 0
+    end
+end
+
+=begin
+= NAME
+Fermat's Little Theorem v1.1.3
+
+= SYNOPSIS
+fermat_little(p, a)
+
+= DESCRIPTION
+Fermat Little Theorem's Procedural Representation
+
+(('WARNING'))((-Modular representation maybe couldn't evaluated-))
+=end
+def fermat_little(p, a)
+    if(p%(ui_pow(a, (p-1))-1) == 0)
+        return 0
+    elsif
+        return 1
+    end
+end

data/lib/main.rb

@@ -0,0 +1,13 @@
+#!/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."

data/lib/statics.yml

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

metadata

@@ -0,0 +1,76 @@
+--- !ruby/object:Gem::Specification 
+name: RubMat
+version: !ruby/object:Gem::Version 
+  hash: 1
+  prerelease: 
+  segments: 
+  - 2
+  - 1
+  - 5
+  version: 2.1.5
+platform: ruby
+authors: 
+- Matthew Manahan
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2011-06-20 00:00:00 Z
+dependencies: []
+
+description: Discrete Mathematics solver and Usable Library
+email: scienceblock@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: 
+- README
+- LICENSE
+- gplv3.png
+- RubMat.png
+files: 
+- LICENSE
+- README
+- Rakefile
+- gplv3.png
+- RubMat.png
+- lib/fixnumexpand.rb
+- lib/librbdiscrete.rb
+- lib/main.rb
+- lib/statics.yml
+homepage: http://regularlambda.github.com/RubMat
+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: 
+rubygems_version: 1.7.2
+signing_key: 
+specification_version: 3
+summary: Discrete Mathematics solver and Usable Library
+test_files: []
+