darvin_functions 0.0.2 → 2.0.0

data/ext/darvin_functions.c

@@ -6,9 +6,6 @@
 
 VALUE mDarvinFunctions;
 
-/********************************************************************************
-* roundNumber
-********************************************************************************/
 long roundNumber(double value) {
 	if (value == 0.0) return (0);									// don't mess with zero
 	if (value > 0.0) return ((long)(value+.5));		// positive number
@@ -17,21 +14,23 @@ long roundNumber(double value) {
 
 /* vself is a reference to the module or itself
    varray is a Ruby array */
-VALUE mDarvinFunctions_workout_mmp(VALUE vself, VALUE varray) {
+VALUE mDarvinFunctions_nkmax(VALUE vself, VALUE varray) {
+  VALUE new_array;
+  int  i, j, trail, offset;
+	long  *tot;															      // total for specific interval
+	long  *maxTot;													      // current sum for (i-1)
+
+  (void)vself;                                  // silence unused variable warning message
+
   if (NIL_P(varray) || RARRAY_LEN(varray) == 0)
     return varray;
 
-  VALUE new_array = rb_ary_new2(RARRAY_LEN(varray));
-
-  int  i, j, trail, offset;
-	long  *tot;															// total for specific interval
-	long  *maxTot;														// current sum for (i-1)
+  new_array = rb_ary_new2(RARRAY_LEN(varray));
 
 	tot = ALLOCA_N(long, RARRAY_LEN(varray));			// allocate memory
 	maxTot = ALLOCA_N(long, RARRAY_LEN(varray));	// allocate memory
 
 	trail = 0;																		// trailing value
-	memset(maxTot, 	'\0', sizeof maxTot);					// init max totals by slot
 	
 	maxTot[0] = tot[0] = FIX2INT(RARRAY_PTR(varray)[0]);								// need first total (for single cell average), seed for others
 
@@ -45,25 +44,28 @@ VALUE mDarvinFunctions_workout_mmp(VALUE vself, VALUE varray) {
 	 *         ...
 	 *         slot4 is initialized to 1 + 2 + 3 + 4 + 5
 	 */
-	for (i=1; i<RARRAY_LEN(varray); i++) 											// loop thru all the numbers
+	for (i=1; i<RARRAY_LEN(varray); i++) 											          // loop thru all the numbers
 		maxTot[i] = tot[i] = (tot[i-1] + FIX2INT(RARRAY_PTR(varray)[i]));	// compute tot for subsequent cells (starting at cell 0)
 
-	for (offset=1; offset<RARRAY_LEN(varray); offset++) {			// loop starting at index 1 (index-1 is the value to subtract)
+	for (offset=1; offset<RARRAY_LEN(varray); offset++) {			          // loop starting at index 1 (index-1 is the value to subtract)
 		trail = FIX2INT(RARRAY_PTR(varray)[offset-1]);										// this is the value to subtract from the beginning of the list
-		for (i=offset; i<RARRAY_LEN(varray); i++) {							// first time subtract 1 from all (except n list)
-			j = i - offset;														// subtract trail and add next value
+    
+		for (i=offset; i<RARRAY_LEN(varray); i++) {							          // first time subtract 1 from all (except n list)
+			j = i - offset;														                      // subtract trail and add next value
 			tot[j] += (FIX2INT(RARRAY_PTR(varray)[i]) - trail);							// to temp variable
-			if (tot[j] > maxTot[j]) maxTot[j] = tot[j];// set maxTot for slot if larger
+			if (tot[j] > maxTot[j]) maxTot[j] = tot[j];                     // set maxTot for slot if larger
 		}
 	}
 	
-	for (i=0; i<RARRAY_LEN(varray); i++)											// first value divided by 1 (ignore it)
+	for (i=0; i<RARRAY_LEN(varray); i++) {
     rb_ary_push(new_array, INT2FIX(roundNumber((double)maxTot[i] / (double)(i+1))));
+  }
 
   return new_array;
 }
 
 void Init_darvin_functions(){
   mDarvinFunctions = rb_define_module("DarvinFunctions");
-  rb_define_module_function(mDarvinFunctions, "workout_mmp", mDarvinFunctions_workout_mmp, 1);
+  rb_define_module_function(mDarvinFunctions, "nkmax", mDarvinFunctions_nkmax, 1);
 }
+

data/test/benchmark_mmp.rb

@@ -0,0 +1,22 @@
+require 'benchmark'
+require 'darvin_functions'
+
+class BenchmarkMMP
+  MAX_POWER = 150000  # 1500.00 Watts as an integer
+  DURATION = 8 # 8 Hours
+
+  def run
+    data = []
+    (DURATION*3600).times do |i|
+      value = Math.sin(i % Math::PI / 2)
+      data << (value * MAX_POWER * 100 * rand).to_i / 100.0
+    end
+    
+    tms = Benchmark.bmbm(10) do |x|
+      DURATION.times do |i|
+        x.report("#{i+1} hour(s)") { DarvinFunctions::nkmax(data[0...i*3600]) }
+      end
+    end.last
+  end
+
+end

data/test/test_mmp.rb

@@ -1,44 +1,27 @@
-require 'helper'
+require 'test/unit'
 require 'benchmark'
+require 'darvin_functions'
 
 class TestMMP < Test::Unit::TestCase
-  MAX_POWER = 150000  # 1500.00 Watts as an integer
   
-  context "test case" do
-    should "handle an empty array" do
-      assert_equal [], DarvinFunctions::workout_mmp([])
-    end
+  def test_handle_an_empty_array
+    assert_equal [], DarvinFunctions::nkmax([])
+  end
 
-    should "handle an array of one" do
-      assert_equal [10], DarvinFunctions::workout_mmp([10])
-    end
+  def test_handle_an_array_of_one
+    assert_equal [10], DarvinFunctions::nkmax([10])
+  end
 
-    should "handle an array of two" do
-      assert_equal [10, 7], DarvinFunctions::workout_mmp([10, 4])
-    end
+  def test_handle_an_array_of_two
+    assert_equal [10, 7], DarvinFunctions::nkmax([10, 4])
+  end
 
-    should "handle an array of three" do
-      assert_equal [10, 7, 5], DarvinFunctions::workout_mmp([10, 4, 2])
-    end
+  def test_handle_an_array_of_three
+    assert_equal [10, 7, 5], DarvinFunctions::nkmax([10, 4, 2])
   end
-  
-  context "Benchmark" do
-    
-    setup do
-      @size = 14400
-      @data = []
-      @size.times do |i|
-        value = Math.sin(i % Math::PI / 2)
-        @data << (value * MAX_POWER * 100 * rand).to_i / 100.0
-      end
-    end
-    
-    should "run under a minute" do
-      tms = Benchmark.bmbm(10) do |x|
-        x.report { DarvinFunctions::workout_mmp(@data) }
-      end.last
-      assert tms.total < 60, "#{@size} array took too long: #{tms.total} seconds is too long" # seconds
-    end
+
+  def test_handle_an_array_of_three_the_other_way
+    assert_equal [10, 7, 5], DarvinFunctions::nkmax([2, 4, 10])
   end
 
 end

metadata

@@ -1,78 +1,52 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: darvin_functions
-version: !ruby/object:Gem::Version 
-  prerelease: false
-  segments: 
-  - 0
-  - 0
-  - 2
-  version: 0.0.2
+version: !ruby/object:Gem::Version
+  version: 2.0.0
+  prerelease: 
 platform: ruby
-authors: 
-- Darvin Bauer
+authors:
 - Matt Bauer
 autorequire: 
 bindir: bin
 cert_chain: []
-
-date: 2010-06-10 00:00:00 -05:00
-default_executable: 
-dependencies: 
-- !ruby/object:Gem::Dependency 
-  name: shoulda
-  prerelease: false
-  requirement: &id001 !ruby/object:Gem::Requirement 
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 0
-        version: "0"
-  type: :development
-  version_requirements: *id001
+date: 2012-07-06 00:00:00.000000000 Z
+dependencies: []
 description: Various functions for data processing, clean up and analysis
-email: info@pedalbrain.com
+email: bauer@pedalbrain.com
 executables: []
-
-extensions: 
+extensions:
 - ext/extconf.rb
-extra_rdoc_files: 
-- README.rdoc
-files: 
-- ext/darvin_functions.h
+extra_rdoc_files: []
+files:
 - ext/darvin_functions.c
+- ext/darvin_functions.h
 - ext/extconf.rb
-- README.rdoc
-has_rdoc: true
-homepage: http://github.com/pedalbrain/Darvin_Functions
+- test/benchmark_mmp.rb
+- test/test_mmp.rb
+homepage: http://github.com/pedalbrain/darvin_functions
 licenses: []
-
 post_install_message: 
-rdoc_options: 
-- --charset=UTF-8
-require_paths: 
+rdoc_options: []
+require_paths:
 - lib
-required_ruby_version: !ruby/object:Gem::Requirement 
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      segments: 
-      - 0
-      version: "0"
-required_rubygems_version: !ruby/object:Gem::Requirement 
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      segments: 
-      - 0
-      version: "0"
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
 requirements: []
-
 rubyforge_project: 
-rubygems_version: 1.3.6
+rubygems_version: 1.8.23
 signing_key: 
 specification_version: 3
-summary: Various functions for data processing, clean up and analysis
-test_files: 
-- test/helper.rb
+summary: Data Processing C Extenstions
+test_files:
+- test/benchmark_mmp.rb
 - test/test_mmp.rb

data/README.rdoc

@@ -1,7 +0,0 @@
-= Darvin_Functions
-
-Various functions for data processing, clean up and analysis
-
-== Copyright
-
-Copyright (c) 2010 Pedal Brain LLC.

data/test/helper.rb

@@ -1,10 +0,0 @@
-require 'rubygems'
-require 'test/unit'
-require 'shoulda'
-
-$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
-$LOAD_PATH.unshift(File.dirname(__FILE__))
-require 'darvin_functions'
-
-class Test::Unit::TestCase
-end