ruby-prof 0.4.0 → 0.4.1

data/test/duplicate_names_test.rb

@@ -0,0 +1,37 @@
+#!/usr/bin/env ruby
+
+require 'test/unit'
+require 'ruby-prof'
+require 'test_helper'
+
+class DuplicateNames < Test::Unit::TestCase
+  def test_names
+    result = RubyProf::profile do
+     	str = %{module Foo; class Bar; def foo; end end end}
+
+     	eval str
+			Foo::Bar.new.foo
+			DuplicateNames.class_eval {remove_const :Foo}
+
+			eval str
+			Foo::Bar.new.foo
+			DuplicateNames.class_eval {remove_const :Foo}
+
+			eval str
+			Foo::Bar.new.foo
+		end
+		print_results(result)
+		
+		# There should be 3 foo methods
+		methods = result.threads.values.first
+		
+		method_info = methods['DuplicateNames::Foo::Bar#foo']
+		assert_not_nil(method_info)
+		
+		method_info = methods['DuplicateNames::Foo::Bar#foo_1']
+		assert_not_nil(method_info)
+		
+		method_info = methods['DuplicateNames::Foo::Bar#foo_2']
+		assert_not_nil(method_info)
+	end
+end

data/test/module_test.rb

@@ -1,45 +1,45 @@
-#!/usr/bin/env ruby
-
-require 'test/unit'
-require 'ruby-prof'
-require 'test_helper'
-
-
-module Foo
-  def Foo::hello
-  end
-end
-
-module Bar
-  def Bar::hello
-    Foo::hello
-  end
-  
-  def hello
-    Bar::hello
-  end
-end
-
-include Bar
-
-class BasicTest < Test::Unit::TestCase
-  def test_nested_modules
-		result = RubyProf.profile do
-			hello
-		end
-
-		methods = result.threads.values.first
-	    
-  	# Length should be 4s
-  	assert_equal(4, methods.length)
-    
-  	method1 = methods['Bar#hello']
-  	assert_not_nil(method1)
-  	
-  	method1 = methods['<Module::Bar>#hello']
-  	assert_not_nil(method1)
-  	
-  	method1 = methods['<Module::Foo>#hello']
-  	assert_not_nil(method1)
-	end	
-end
+#!/usr/bin/env ruby
+
+require 'test/unit'
+require 'ruby-prof'
+require 'test_helper'
+
+
+module Foo
+  def Foo::hello
+  end
+end
+
+module Bar
+  def Bar::hello
+    Foo::hello
+  end
+  
+  def hello
+    Bar::hello
+  end
+end
+
+include Bar
+
+class BasicTest < Test::Unit::TestCase
+  def test_nested_modules
+		result = RubyProf.profile do
+			hello
+		end
+
+		methods = result.threads.values.first
+	    
+  	# Length should be 4s
+  	assert_equal(4, methods.length)
+    
+  	method1 = methods['Bar#hello']
+  	assert_not_nil(method1)
+  	
+  	method1 = methods['<Module::Bar>#hello']
+  	assert_not_nil(method1)
+  	
+  	method1 = methods['<Module::Foo>#hello']
+  	assert_not_nil(method1)
+	end	
+end

data/test/prime.rb

@@ -1,58 +1,58 @@
-# A silly little test program that finds prime numbers.  It
-# is intentionally badly designed to show off the use
-# or ruby-prof.
-# 
-# Source from http://people.cs.uchicago.edu/~bomb154/154/maclabs/profilers-lab/
-
-def make_random_array(length, maxnum)
-	result = Array.new(length)
-	result.each_index do |i|
-		result[i] = rand(maxnum)
-	end
-		
-	result
-end
- 
-def is_prime(x)
-	y = 2
-	y.upto(x-1) do |i|
-		return false if (x % i) == 0
-	end
-	true
-end
-
-def find_primes(arr)
-	result = arr.select do |value|
-		is_prime(value)
-	end
-	result
-end
-
-def find_largest(primes)
-	largest = primes.first
-
-	# Intentionally use upto for example purposes
-	# (upto is also called from is_prime)
-	0.upto(primes.length-1) do |i|
-    sleep(0.02)
-    prime = primes[i]
-		if prime > largest
-			largest = prime
-		end
-	end
-	largest
-end
-
-def run_primes
-	length = 500	
-  maxnum = 10000
-  
-  # Create random numbers
- 	random_array = make_random_array(length, maxnum)
- 	
- 	# Find the primes
-  primes = find_primes(random_array)
-  
-  # Find the largest primes
- 	largest = find_largest(primes)
-end
+# A silly little test program that finds prime numbers.  It
+# is intentionally badly designed to show off the use
+# or ruby-prof.
+# 
+# Source from http://people.cs.uchicago.edu/~bomb154/154/maclabs/profilers-lab/
+
+def make_random_array(length, maxnum)
+	result = Array.new(length)
+	result.each_index do |i|
+		result[i] = rand(maxnum)
+	end
+		
+	result
+end
+ 
+def is_prime(x)
+	y = 2
+	y.upto(x-1) do |i|
+		return false if (x % i) == 0
+	end
+	true
+end
+
+def find_primes(arr)
+	result = arr.select do |value|
+		is_prime(value)
+	end
+	result
+end
+
+def find_largest(primes)
+	largest = primes.first
+
+	# Intentionally use upto for example purposes
+	# (upto is also called from is_prime)
+	0.upto(primes.length-1) do |i|
+    sleep(0.02)
+    prime = primes[i]
+		if prime > largest
+			largest = prime
+		end
+	end
+	largest
+end
+
+def run_primes
+	length = 500	
+  maxnum = 10000
+  
+  # Create random numbers
+ 	random_array = make_random_array(length, maxnum)
+ 	
+ 	# Find the primes
+  primes = find_primes(random_array)
+  
+  # Find the largest primes
+ 	largest = find_largest(primes)
+end

data/test/prime_test.rb

@@ -1,24 +1,24 @@
-#!/usr/bin/env ruby
-
-require 'test/unit'
-require 'ruby-prof'
-require 'prime'
-require 'test_helper'
-
-
-# --  Tests ----
-class PrimeTest < Test::Unit::TestCase
-  def test_consistency
-    result = RubyProf.profile do
-			run_primes
-		end
-		
-	  result.threads.values.each do |methods|
-			methods.values.each do |method|
-    		check_parent_times(method)
-    		check_parent_calls(method)
-    		check_child_times(method)		
-			end
-  	end
-  end
+#!/usr/bin/env ruby
+
+require 'test/unit'
+require 'ruby-prof'
+require 'prime'
+require 'test_helper'
+
+
+# --  Tests ----
+class PrimeTest < Test::Unit::TestCase
+  def test_consistency
+    result = RubyProf.profile do
+			run_primes
+		end
+		
+	  result.threads.values.each do |methods|
+			methods.values.each do |method|
+    		check_parent_times(method)
+    		check_parent_calls(method)
+    		check_child_times(method)		
+			end
+  	end
+  end
 end

data/test/printers_test.rb

@@ -1,28 +1,28 @@
-#!/usr/bin/env ruby
-
-require 'test/unit'
-require 'ruby-prof'
-require 'prime'
-require 'test_helper'
-
-
-# --  Tests ----
-class PrintersTest < Test::Unit::TestCase
-  def test_printer
-    result = RubyProf.profile do
-			run_primes
-		end
-    
-		printer = RubyProf::FlatPrinter.new(result)
-    printer.print(STDOUT)
-
-		printer = RubyProf::GraphHtmlPrinter.new(result)
-    printer.print(STDOUT)
-        
-		printer = RubyProf::GraphPrinter.new(result)
-    printer.print(STDOUT)
-    
-    # we should get here
-    assert(true)
-  end
+#!/usr/bin/env ruby
+
+require 'test/unit'
+require 'ruby-prof'
+require 'prime'
+require 'test_helper'
+
+
+# --  Tests ----
+class PrintersTest < Test::Unit::TestCase
+  def test_printer
+    result = RubyProf.profile do
+			run_primes
+		end
+    
+		printer = RubyProf::FlatPrinter.new(result)
+    printer.print(STDOUT)
+
+		printer = RubyProf::GraphHtmlPrinter.new(result)
+    printer.print(STDOUT)
+        
+		printer = RubyProf::GraphPrinter.new(result)
+    printer.print(STDOUT)
+    
+    # we should get here
+    assert(true)
+  end
 end

data/test/recursive_test.rb

@@ -1,55 +1,55 @@
-#!/usr/bin/env ruby
-
-require 'test/unit'
-require 'ruby-prof'
-require 'timeout'
-require 'test_helper'
-
-
-def simple(n)
-  sleep(1)
-  n -= 1
-  return if n == 0
-  simple(n)
-end
-
-def factorial(n)
-  if n < 2 then
-    n
-  else 
-    n * factorial(n-1)
-  end
-end
-
-
-# --  Tests ----
-class RecursiveTest < Test::Unit::TestCase
-	def test_recursive
-    result = RubyProf.profile do
-  		simple(3)
-    end
-   
-    result.threads.values.each do |methods|
-			methods.values.each do |method|
-    		check_parent_times(method)
-    		check_parent_calls(method)
-    		check_child_times(method)		
-			end
-  	end
-  end
-  
-  def test_factorial
-    result = RubyProf.profile do
-      # Around 700 on windows causes "stack level too deep" error
-      factorial(650)
-    end
-   
-    result.threads.values.each do |methods|
-			methods.values.each do |method|
-    		check_parent_times(method)
-    		check_parent_calls(method)
-    		check_child_times(method)		
-			end
-  	end
-  end  	
-end
+#!/usr/bin/env ruby
+
+require 'test/unit'
+require 'ruby-prof'
+require 'timeout'
+require 'test_helper'
+
+
+def simple(n)
+  sleep(1)
+  n -= 1
+  return if n == 0
+  simple(n)
+end
+
+def factorial(n)
+  if n < 2 then
+    n
+  else 
+    n * factorial(n-1)
+  end
+end
+
+
+# --  Tests ----
+class RecursiveTest < Test::Unit::TestCase
+	def test_recursive
+    result = RubyProf.profile do
+  		simple(3)
+    end
+   
+    result.threads.values.each do |methods|
+			methods.values.each do |method|
+    		check_parent_times(method)
+    		check_parent_calls(method)
+    		check_child_times(method)		
+			end
+  	end
+  end
+  
+  def test_factorial
+    result = RubyProf.profile do
+      # Around 700 on windows causes "stack level too deep" error
+      factorial(650)
+    end
+   
+    result.threads.values.each do |methods|
+			methods.values.each do |method|
+    		check_parent_times(method)
+    		check_parent_calls(method)
+    		check_child_times(method)		
+			end
+  	end
+  end  	
+end