fibonacci 0.1.3 → 0.1.4

data/ext/fibonacci/extconf.rb

@@ -0,0 +1,2 @@
+require 'mkmf'
+create_makefile('fibonacci/fibonacci')

data/ext/fibonacci/fibonacci.c

@@ -0,0 +1,350 @@
+/******************************************************************************
+ *
+ * Fibonacci Series
+ *
+ * Author: NagaChaitanya Vellanki
+ *
+ * ***************************************************************************/
+
+#include "ruby.h"
+
+#define ONE INT2NUM(1)
+#define ZERO INT2NUM(0)
+#define TWO INT2NUM(2)
+#define ARY_LEN 2L
+
+static VALUE cFibonacci;
+static ID id_plus;
+static ID id_lte;
+static ID id_gte;
+static ID id_lt;
+static ID id_pow;
+static ID id_minus;
+static ID id_fdiv;
+static ID id_div;
+static ID id_to_i;
+static ID id_log10;
+static ID id_floor;
+static ID id_sqrt;
+static ID id_mul;
+static ID id_eq;
+static ID id_not_eq;
+static ID id_mod;
+
+static VALUE
+fibonacci_init(VALUE self)
+{
+  return self;
+}
+
+static VALUE
+rb_print_num(VALUE num)
+{
+  VALUE num_str =  rb_funcall(num, rb_intern("to_s"), 0);
+  char *cptr = StringValuePtr(num_str);
+  printf("%s\n", cptr);
+  return Qnil;
+}
+
+static VALUE
+rb_matrix_mul(VALUE ary1, VALUE ary2)
+{
+  long i, j, k;
+  VALUE temp;
+  VALUE tmp_ary = rb_ary_new2(ARY_LEN);
+  VALUE zero_ary = rb_ary_new2(ARY_LEN);
+
+  rb_ary_push(zero_ary, ZERO);
+  rb_ary_push(zero_ary, ZERO);
+  rb_ary_push(tmp_ary, zero_ary);
+
+  zero_ary = rb_ary_new2(ARY_LEN);
+  rb_ary_push(zero_ary, ZERO);
+  rb_ary_push(zero_ary, ZERO);
+  rb_ary_push(tmp_ary, zero_ary);
+
+  for(i = 0; i < 2; i++)
+  {
+    for(j = 0; j < 2; j++)
+    {
+      for(k = 0; k < 2; k++)
+      {
+        //tmp[i][j] = (tmp[i][j] + ary1[i][k] * ary2[k][j]);
+        temp = rb_funcall(rb_ary_entry(rb_ary_entry(ary1, i), k), id_mul,
+            1, rb_ary_entry(rb_ary_entry(ary2, k), j));
+        rb_ary_store(rb_ary_entry(tmp_ary, i), j, rb_funcall(temp, id_plus, 1, rb_ary_entry(rb_ary_entry(tmp_ary, i), j)));
+      }
+    }
+  }
+
+  return tmp_ary;
+}
+
+static VALUE
+rb_matrix_form(VALUE self, VALUE n)
+{
+  VALUE base_ary;
+  VALUE res_ary;
+  VALUE tmp_ary;
+  long ary_len = 2;
+
+  if(TYPE(n) != T_FIXNUM)
+  {
+    rb_raise(rb_eArgError, "Invalid argument for type Fixnum");
+    return Qnil;
+  }
+
+  if(RTEST(rb_funcall(n, id_lt, 1, ZERO)))
+  {
+    rb_raise(rb_eArgError, "n cannot be negative");
+    return Qnil;
+  }
+  else
+  {
+    base_ary = rb_ary_new2(ARY_LEN);
+    res_ary =  rb_ary_new2(ARY_LEN);
+    tmp_ary = rb_ary_new2(ARY_LEN);
+
+    // base is {{1, 1}, {1, 0}}
+    rb_ary_push(tmp_ary, ONE);
+    rb_ary_push(tmp_ary, ONE);
+    rb_ary_push(base_ary, tmp_ary);
+
+    tmp_ary = rb_ary_new2(ARY_LEN);
+    rb_ary_push(tmp_ary, ONE);
+    rb_ary_push(tmp_ary, ZERO);
+    rb_ary_push(base_ary, tmp_ary);
+
+    /*// res is {{1, 0}, {0, 1}}*/
+    tmp_ary = rb_ary_new2(ARY_LEN);
+    rb_ary_push(tmp_ary, ONE);
+    rb_ary_push(tmp_ary, ZERO);
+    rb_ary_push(res_ary, tmp_ary);
+
+    tmp_ary = rb_ary_new2(ARY_LEN);
+    rb_ary_push(tmp_ary, ZERO);
+    rb_ary_push(tmp_ary, ONE);
+    rb_ary_push(res_ary, tmp_ary);
+
+    while(RTEST(rb_funcall(n, id_not_eq, 1, ZERO)))
+    {
+      if(RTEST(rb_funcall(rb_funcall(n, id_mod, 1, TWO), id_eq, 1, ZERO)))
+      {
+        n = rb_funcall(n, id_div, 1, TWO);
+        base_ary = rb_matrix_mul(base_ary, base_ary);
+      }
+      else
+      {
+        n = rb_funcall(n, id_minus, 1, ONE);
+        res_ary = rb_matrix_mul(res_ary, base_ary);
+      }
+    }
+  }
+
+  return res_ary;
+}
+
+static VALUE
+rb_iterative_val(VALUE self, VALUE n)
+{
+  VALUE start = ZERO;
+  VALUE fib_n_1 = ONE;
+  VALUE fib_n_2 = ZERO;
+  VALUE fib_n = ZERO;
+
+  if(TYPE(n) != T_FIXNUM)
+  {
+    rb_raise(rb_eArgError, "Invalid argument for type Fixnum");
+    return Qnil;
+  }
+
+  if(RTEST(rb_funcall(n, id_lt, 1, ZERO)))
+  {
+    rb_raise(rb_eArgError, "n cannot be negative");
+    return Qnil;
+  }
+  else
+  {
+
+    for(start; RTEST(rb_funcall(start, id_lte, 1, n)); start = rb_funcall(start, id_plus, 1, ONE))
+    {
+      if(RTEST(rb_funcall(start, id_eq, 1, ZERO)))
+      {
+        fib_n = ZERO;
+      }
+      else if(RTEST(rb_funcall(start, id_eq, 1, ONE)))
+      {
+        fib_n = ONE;
+      }
+      else
+      {
+        fib_n = rb_funcall(fib_n_1, id_plus, 1, fib_n_2);
+        fib_n_2 = fib_n_1;
+        fib_n_1 = fib_n;
+      }
+    }
+  }
+  return fib_n;
+}
+
+static VALUE
+terms(VALUE self, VALUE n)
+{
+  long ary_len = NUM2LONG(n);
+  long i;
+  VALUE ary = Qnil;
+
+  if(ary_len < 0)
+  {
+    rb_raise(rb_eArgError, "num terms cannot be negative");
+    return ary;
+  }
+
+  ary = rb_ary_new2(ary_len);
+
+  for(i=0; i < ary_len; i++)
+  {
+    if(i == 0)
+    {
+      rb_ary_store(ary, i, ZERO);
+    }
+    if((i > 0))
+    {
+      if(i <= 2)
+      {
+        rb_ary_store(ary, i, ONE);
+      }
+      else
+      {
+        rb_ary_store(ary, i, rb_funcall(rb_ary_entry(ary, i-1), id_plus, 1, rb_ary_entry(ary, i-2)));
+      }
+    }
+  }
+  return ary;
+}
+
+static VALUE
+print(VALUE self, VALUE n)
+{
+  VALUE start = ZERO;
+  VALUE fib_n_1 = ONE;
+  VALUE fib_n_2 = ZERO;
+  VALUE fib_n = ZERO;
+
+  if(TYPE(n) != T_FIXNUM)
+  {
+    rb_raise(rb_eArgError, "Invalid argument for type Fixnum");
+    return Qnil;
+  }
+
+  for(start; RTEST(rb_funcall(start, id_lt, 1, n)); start = rb_funcall(start, id_plus, 1, ONE))
+  {
+    if(RTEST(rb_funcall(start, id_eq, 1, ZERO)))
+    {
+      rb_print_num(ZERO);
+    }
+    else if(RTEST(rb_funcall(start, id_eq, 1, ONE)))
+    {
+      rb_print_num(ONE);
+    }
+    else
+    {
+      fib_n = rb_funcall(fib_n_1, id_plus, 1, fib_n_2);
+      fib_n_2 = fib_n_1;
+      fib_n_1 = fib_n;
+      rb_print_num(fib_n);
+    }
+  }
+
+  return Qnil;
+}
+
+static VALUE
+index_of(VALUE self, VALUE val)
+{
+  return Qnil;
+}
+
+static VALUE
+num_digits(VALUE self, VALUE n)
+{
+  if(TYPE(n) != T_FIXNUM)
+  {
+    rb_raise(rb_eArgError, "Invalid argument for type Fixnum");
+    return Qnil;
+  }
+
+  if(RTEST(rb_funcall(n, id_lt, 1, ZERO)))
+  {
+    rb_raise(rb_eArgError, "n cannot be negative");
+    return Qnil;
+  }
+  else
+  {
+    VALUE phi = ONE;
+    VALUE num_digits = ZERO;
+    VALUE log_sqrt_5 = ZERO;
+    VALUE sqrt_5;
+
+    if(RTEST(rb_funcall(n, id_eq, 1, ZERO)))
+    {
+      return ZERO;
+    }
+
+    /*  work around since the value log(phi/sqrt(5)) + 1 = 0.8595026380819693
+     *  converting to integer would be zero
+     */
+    if(RTEST(rb_funcall(n, id_eq, 1, ONE)))
+    {
+      return ONE;
+    }
+
+    if(RTEST(rb_funcall(n, id_gte, 1, TWO)))
+    {
+      sqrt_5 = rb_funcall(rb_mMath, id_sqrt, 1, INT2NUM(5));
+      log_sqrt_5 = rb_funcall(rb_mMath, id_log10, 1, sqrt_5);
+
+      phi = rb_funcall(phi, id_plus, 1, sqrt_5);
+      phi = rb_funcall(phi, id_fdiv, 1, TWO);
+
+      num_digits = rb_funcall(rb_mMath, id_log10, 1, phi);
+      num_digits = rb_funcall(num_digits, id_mul, 1, n);
+      num_digits = rb_funcall(num_digits, id_minus, 1, log_sqrt_5);
+
+      num_digits = rb_funcall(num_digits, id_floor, 0);
+      num_digits = rb_funcall(num_digits, id_plus, 1, ONE);
+      num_digits = rb_funcall(num_digits, id_to_i, 0);
+
+      return num_digits;
+    }
+  }
+}
+
+void
+Init_fibonacci(void)
+{
+  id_plus = rb_intern("+");
+  id_lte = rb_intern("<=");
+  id_lt = rb_intern("<");
+  id_gte = rb_intern(">=");
+  id_pow = rb_intern("**");
+  id_mul = rb_intern("*");
+  id_minus = rb_intern("-");
+  id_fdiv = rb_intern("fdiv");
+  id_div = rb_intern("/");
+  id_to_i = rb_intern("to_i");
+  id_log10 = rb_intern("log10");
+  id_floor = rb_intern("floor");
+  id_sqrt = rb_intern("sqrt");
+  id_eq = rb_intern("==");
+  id_not_eq = rb_intern("!=");
+  id_mod = rb_intern("!=");
+
+  cFibonacci = rb_define_class("Fibonacci", rb_cObject);
+  rb_define_method(cFibonacci, "initialize", fibonacci_init, 0);
+  rb_define_method(cFibonacci, "print", print, 1);
+  rb_define_method(cFibonacci, "terms", terms, 1);
+  rb_define_method(cFibonacci, "num_digits", num_digits, 1);
+  rb_define_method(cFibonacci, "[]", rb_iterative_val, 1);
+  rb_define_method(cFibonacci, "matrix", rb_matrix_form, 1);
+}

data/lib/fibonacci.rb

@@ -1,30 +1,2 @@
-class Fixnum
-  def closest_fibonacci
-    return self if self < 2
-
-    # If we were trying to find the "actual" closest number,
-    # we would use the inverse of Binet's formula to find the index:
-    # phi = (1 + 5**0.5) / 2
-    # index = ((Math.log(self * (5**0.5)) / Math.log(phi)).round)
-
-    cur_in_fib_seq = 2
-
-    number_0 = 0
-    number_1 = 1
-
-    while(number_0 <= self)
-      number_0 = 0
-      number_1 = 1
-
-      for i in 2..cur_in_fib_seq
-        new_number = number_0 + number_1
-        number_1 = number_0
-        number_0 = new_number
-      end
-
-      cur_in_fib_seq += 1
-    end
-
-    number_1
-  end
-end
+require 'fibonacci/fibonacci'
+require "fibonacci/version"

data/lib/fibonacci/version.rb

@@ -0,0 +1 @@
+VERSION = "0.1.4"

metadata

@@ -1,133 +1,50 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: fibonacci
-version: !ruby/object:Gem::Version 
-  prerelease: false
-  segments: 
-  - 0
-  - 1
-  - 3
-  version: 0.1.3
+version: !ruby/object:Gem::Version
+  version: 0.1.4
+  prerelease: 
 platform: ruby
-authors: 
-- Cody Johnston
+authors:
+- Chaitanya Vellanki
 autorequire: 
 bindir: bin
 cert_chain: []
-
-date: 2011-05-13 00:00:00 -07:00
-default_executable: 
-dependencies: 
-- !ruby/object:Gem::Dependency 
-  name: shoulda
-  requirement: &id001 !ruby/object:Gem::Requirement 
-    none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 0
-        version: "0"
-  type: :development
-  prerelease: false
-  version_requirements: *id001
-- !ruby/object:Gem::Dependency 
-  name: bundler
-  requirement: &id002 !ruby/object:Gem::Requirement 
-    none: false
-    requirements: 
-    - - ~>
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 1
-        - 0
-        - 0
-        version: 1.0.0
-  type: :development
-  prerelease: false
-  version_requirements: *id002
-- !ruby/object:Gem::Dependency 
-  name: jeweler
-  requirement: &id003 !ruby/object:Gem::Requirement 
-    none: false
-    requirements: 
-    - - ~>
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 1
-        - 6
-        - 0
-        version: 1.6.0
-  type: :development
-  prerelease: false
-  version_requirements: *id003
-- !ruby/object:Gem::Dependency 
-  name: rcov
-  requirement: &id004 !ruby/object:Gem::Requirement 
-    none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 0
-        version: "0"
-  type: :development
-  prerelease: false
-  version_requirements: *id004
-description: WOAH!
-email: cody@codegobl.in
+date: 2011-12-13 00:00:00.000000000 Z
+dependencies: []
+description: A Ruby gem for exploring Fibonacci series
+email:
+- me@chaitanyavellanki.com
 executables: []
-
-extensions: []
-
-extra_rdoc_files: 
-- LICENSE.txt
-- README.rdoc
-files: 
-- .Rakefile.swp
-- .document
-- Gemfile
-- Gemfile.lock
-- LICENSE.txt
-- README.rdoc
-- Rakefile
-- VERSION
-- example_usage/example.rb
-- fibonacci.gemspec
+extensions:
+- ext/fibonacci/extconf.rb
+extra_rdoc_files: []
+files:
 - lib/fibonacci.rb
-- test/helper.rb
-- test/test_fibonacci.rb
-has_rdoc: true
-homepage: http://github.com/codegoblin/closest_fibonacci
-licenses: 
-- MIT
+- lib/fibonacci/version.rb
+- ext/fibonacci/fibonacci.c
+- ext/fibonacci/extconf.rb
+homepage: http://github.com/chaitanyav/fibonacci
+licenses: []
 post_install_message: 
 rdoc_options: []
-
-require_paths: 
+require_paths:
 - lib
-required_ruby_version: !ruby/object:Gem::Requirement 
+required_ruby_version: !ruby/object:Gem::Requirement
   none: false
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      hash: 414973634195712941
-      segments: 
-      - 0
-      version: "0"
-required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      segments: 
-      - 0
-      version: "0"
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
 requirements: []
-
-rubyforge_project: 
-rubygems_version: 1.3.7
+rubyforge_project: fibonacci
+rubygems_version: 1.8.5
 signing_key: 
 specification_version: 3
-summary: extends fixnum so that you can find the largest value in the fibonacci sequence smaller than a given number
+summary: Fibonacci
 test_files: []
-

data/.document

@@ -1,5 +0,0 @@
-lib/**/*.rb
-bin/*
-- 
-features/**/*.feature
-LICENSE.txt

data/Gemfile

@@ -1,13 +0,0 @@
-source "http://rubygems.org"
-# Add dependencies required to use your gem here.
-# Example:
-#   gem "activesupport", ">= 2.3.5"
-
-# Add dependencies to develop your gem here.
-# Include everything needed to run rake, tests, features, etc.
-group :development do
-  gem "shoulda", ">= 0"
-  gem "bundler", "~> 1.0.0"
-  gem "jeweler", "~> 1.6.0"
-  gem "rcov", ">= 0"
-end

data/Gemfile.lock

@@ -1,20 +0,0 @@
-GEM
-  remote: http://rubygems.org/
-  specs:
-    git (1.2.5)
-    jeweler (1.6.0)
-      bundler (~> 1.0.0)
-      git (>= 1.2.5)
-      rake
-    rake (0.8.7)
-    rcov (0.9.9)
-    shoulda (2.11.3)
-
-PLATFORMS
-  ruby
-
-DEPENDENCIES
-  bundler (~> 1.0.0)
-  jeweler (~> 1.6.0)
-  rcov
-  shoulda

data/LICENSE.txt

@@ -1,20 +0,0 @@
-Copyright (c) 2011 Cody Johnston
-
-Permission is hereby granted, free of charge, to any person obtaining
-a copy of this software and associated documentation files (the
-"Software"), to deal in the Software without restriction, including
-without limitation the rights to use, copy, modify, merge, publish,
-distribute, sublicense, and/or sell copies of the Software, and to
-permit persons to whom the Software is furnished to do so, subject to
-the following conditions:
-
-The above copyright notice and this permission notice shall be
-included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
-EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
-MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
-NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
-LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
-OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
-WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.rdoc

@@ -1,19 +0,0 @@
-= fibonacci
-
-Description goes here.
-
-== Contributing to fibonacci
- 
-* Check out the latest master to make sure the feature hasn't been implemented or the bug hasn't been fixed yet
-* Check out the issue tracker to make sure someone already hasn't requested it and/or contributed it
-* Fork the project
-* Start a feature/bugfix branch
-* Commit and push until you are happy with your contribution
-* Make sure to add tests for it. This is important so I don't break it in a future version unintentionally.
-* Please try not to mess with the Rakefile, version, or history. If you want to have your own version, or is otherwise necessary, that is fine, but please isolate to its own commit so I can cherry-pick around it.
-
-== Copyright
-
-Copyright (c) 2011 Cody Johnston. See LICENSE.txt for
-further details.
-

data/Rakefile

@@ -1,52 +0,0 @@
-# encoding: utf-8
-
-require 'rubygems'
-require 'bundler'
-begin
-  Bundler.setup(:default, :development)
-rescue Bundler::BundlerError => e
-  $stderr.puts e.message
-  $stderr.puts "Run `bundle install` to install missing gems"
-  exit e.status_code
-end
-require 'rake'
-
-require 'jeweler'
-Jeweler::Tasks.new do |gem|
-  # gem is a Gem::Specification... see http://docs.rubygems.org/read/chapter/20 for more options
-  gem.name = "fibonacci"
-  gem.homepage = "http://github.com/codegoblin/closest_fibonacci"
-  gem.license = "MIT"
-  gem.summary = %Q{extends fixnum so that you can find the largest value in the fibonacci sequence smaller than a given number}
-  gem.description = %Q{WOAH!}
-  gem.email = "cody@codegobl.in"
-  gem.authors = ["Cody Johnston"]
-end
-Jeweler::RubygemsDotOrgTasks.new
-
-require 'rake/testtask'
-Rake::TestTask.new(:test) do |test|
-  test.libs << 'lib' << 'test'
-  test.pattern = 'test/**/test_*.rb'
-  test.verbose = true
-end
-
-require 'rcov/rcovtask'
-Rcov::RcovTask.new do |test|
-  test.libs << 'test'
-  test.pattern = 'test/**/test_*.rb'
-  test.verbose = true
-  test.rcov_opts << '--exclude "gems/*"'
-end
-
-task :default => :test
-
-require 'rake/rdoctask'
-Rake::RDocTask.new do |rdoc|
-  version = File.exist?('VERSION') ? File.read('VERSION') : ""
-
-  rdoc.rdoc_dir = 'rdoc'
-  rdoc.title = "fibonacci #{version}"
-  rdoc.rdoc_files.include('README*')
-  rdoc.rdoc_files.include('lib/**/*.rb')
-end

data/VERSION

@@ -1 +0,0 @@
-0.1.3

data/example_usage/example.rb

@@ -1,4 +0,0 @@
-require 'fibonacci'
-
-puts "#{156.closest_fibonacci}"
-puts "#{99.closest_fibonacci}"

data/fibonacci.gemspec

@@ -1,62 +0,0 @@
-# Generated by jeweler
-# DO NOT EDIT THIS FILE DIRECTLY
-# Instead, edit Jeweler::Tasks in Rakefile, and run 'rake gemspec'
-# -*- encoding: utf-8 -*-
-
-Gem::Specification.new do |s|
-  s.name = %q{fibonacci}
-  s.version = "0.1.3"
-
-  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
-  s.authors = ["Cody Johnston"]
-  s.date = %q{2011-05-13}
-  s.description = %q{WOAH!}
-  s.email = %q{cody@codegobl.in}
-  s.extra_rdoc_files = [
-    "LICENSE.txt",
-    "README.rdoc"
-  ]
-  s.files = [
-    ".Rakefile.swp",
-    ".document",
-    "Gemfile",
-    "Gemfile.lock",
-    "LICENSE.txt",
-    "README.rdoc",
-    "Rakefile",
-    "VERSION",
-    "example_usage/example.rb",
-    "fibonacci.gemspec",
-    "lib/fibonacci.rb",
-    "test/helper.rb",
-    "test/test_fibonacci.rb"
-  ]
-  s.homepage = %q{http://github.com/codegoblin/closest_fibonacci}
-  s.licenses = ["MIT"]
-  s.require_paths = ["lib"]
-  s.rubygems_version = %q{1.3.7}
-  s.summary = %q{extends fixnum so that you can find the largest value in the fibonacci sequence smaller than a given number}
-
-  if s.respond_to? :specification_version then
-    current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
-    s.specification_version = 3
-
-    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
-      s.add_development_dependency(%q<shoulda>, [">= 0"])
-      s.add_development_dependency(%q<bundler>, ["~> 1.0.0"])
-      s.add_development_dependency(%q<jeweler>, ["~> 1.6.0"])
-      s.add_development_dependency(%q<rcov>, [">= 0"])
-    else
-      s.add_dependency(%q<shoulda>, [">= 0"])
-      s.add_dependency(%q<bundler>, ["~> 1.0.0"])
-      s.add_dependency(%q<jeweler>, ["~> 1.6.0"])
-      s.add_dependency(%q<rcov>, [">= 0"])
-    end
-  else
-    s.add_dependency(%q<shoulda>, [">= 0"])
-    s.add_dependency(%q<bundler>, ["~> 1.0.0"])
-    s.add_dependency(%q<jeweler>, ["~> 1.6.0"])
-    s.add_dependency(%q<rcov>, [">= 0"])
-  end
-end
-

data/test/helper.rb

@@ -1,18 +0,0 @@
-require 'rubygems'
-require 'bundler'
-begin
-  Bundler.setup(:default, :development)
-rescue Bundler::BundlerError => e
-  $stderr.puts e.message
-  $stderr.puts "Run `bundle install` to install missing gems"
-  exit e.status_code
-end
-require 'test/unit'
-require 'shoulda'
-
-$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
-$LOAD_PATH.unshift(File.dirname(__FILE__))
-require 'fibonacci'
-
-class Test::Unit::TestCase
-end

data/test/test_fibonacci.rb

@@ -1,7 +0,0 @@
-require 'helper'
-
-class TestFibonacci < Test::Unit::TestCase
-  should "probably rename this file and start testing for real" do
-    flunk "hey buddy, you should probably rename this file and start testing for real"
-  end
-end