closest-fibonacci 0.1.0 → 0.1.1
Sign up to get free protection for your applications and to get access to all the features.
- data/Gemfile +2 -0
- data/README.rdoc +11 -2
- data/Rakefile +1 -1
- data/VERSION +1 -1
- data/closest-fibonacci.gemspec +6 -2
- data/lib/closest-fibonacci.rb +3 -4
- metadata +59 -19
data/Gemfile
CHANGED
@@ -3,6 +3,7 @@ source "http://rubygems.org"
|
|
3
3
|
# Example:
|
4
4
|
# gem "activesupport", ">= 2.3.5"
|
5
5
|
|
6
|
+
|
6
7
|
# Add dependencies to develop your gem here.
|
7
8
|
# Include everything needed to run rake, tests, features, etc.
|
8
9
|
group :development do
|
@@ -10,4 +11,5 @@ group :development do
|
|
10
11
|
gem "bundler", "~> 1.0.0"
|
11
12
|
gem "jeweler", "~> 1.6.4"
|
12
13
|
gem "rcov", ">= 0"
|
14
|
+
gem 'rdoc', "~> 2.5.8"
|
13
15
|
end
|
data/README.rdoc
CHANGED
@@ -1,6 +1,14 @@
|
|
1
1
|
= closest-fibonacci
|
2
2
|
|
3
|
-
|
3
|
+
Are you looking to find the closest Fibonacci number for any Fixnum? 'Course you are!
|
4
|
+
|
5
|
+
== Example
|
6
|
+
|
7
|
+
1. Install the "closest-fibonacci" gem.
|
8
|
+
2. Write some code! Try this in some ruby file:
|
9
|
+
n = 143
|
10
|
+
puts "Next Fibonacci number less than #{n} is " + n.closest_fibonacci.to_s
|
11
|
+
3. That's it!
|
4
12
|
|
5
13
|
== Contributing to closest-fibonacci
|
6
14
|
|
@@ -14,6 +22,7 @@ Description goes here.
|
|
14
22
|
|
15
23
|
== Copyright
|
16
24
|
|
17
|
-
Copyright (c) 2011 Kevin Dickerson. See LICENSE.txt for
|
25
|
+
Copyright (c) 2011 Kevin J. Dickerson. See LICENSE.txt for
|
18
26
|
further details.
|
19
27
|
|
28
|
+
Fibonacci computation code: en.literateprograms.org.
|
data/Rakefile
CHANGED
data/VERSION
CHANGED
@@ -1 +1 @@
|
|
1
|
-
0.1.
|
1
|
+
0.1.1
|
data/closest-fibonacci.gemspec
CHANGED
@@ -5,7 +5,7 @@
|
|
5
5
|
|
6
6
|
Gem::Specification.new do |s|
|
7
7
|
s.name = %q{closest-fibonacci}
|
8
|
-
s.version = "0.1.
|
8
|
+
s.version = "0.1.1"
|
9
9
|
|
10
10
|
s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
|
11
11
|
s.authors = ["Kevin J. Dickerson"]
|
@@ -31,10 +31,11 @@ Gem::Specification.new do |s|
|
|
31
31
|
s.homepage = %q{http://github.com/kevindickerson/closest-fibonacci}
|
32
32
|
s.licenses = ["MIT"]
|
33
33
|
s.require_paths = ["lib"]
|
34
|
-
s.rubygems_version = %q{1.
|
34
|
+
s.rubygems_version = %q{1.3.7}
|
35
35
|
s.summary = %q{Provides some methods to find a Fibonacci number less than a given N.}
|
36
36
|
|
37
37
|
if s.respond_to? :specification_version then
|
38
|
+
current_version = Gem::Specification::CURRENT_SPECIFICATION_VERSION
|
38
39
|
s.specification_version = 3
|
39
40
|
|
40
41
|
if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
|
@@ -42,17 +43,20 @@ Gem::Specification.new do |s|
|
|
42
43
|
s.add_development_dependency(%q<bundler>, ["~> 1.0.0"])
|
43
44
|
s.add_development_dependency(%q<jeweler>, ["~> 1.6.4"])
|
44
45
|
s.add_development_dependency(%q<rcov>, [">= 0"])
|
46
|
+
s.add_development_dependency(%q<rdoc>, ["~> 2.5.8"])
|
45
47
|
else
|
46
48
|
s.add_dependency(%q<shoulda>, [">= 0"])
|
47
49
|
s.add_dependency(%q<bundler>, ["~> 1.0.0"])
|
48
50
|
s.add_dependency(%q<jeweler>, ["~> 1.6.4"])
|
49
51
|
s.add_dependency(%q<rcov>, [">= 0"])
|
52
|
+
s.add_dependency(%q<rdoc>, ["~> 2.5.8"])
|
50
53
|
end
|
51
54
|
else
|
52
55
|
s.add_dependency(%q<shoulda>, [">= 0"])
|
53
56
|
s.add_dependency(%q<bundler>, ["~> 1.0.0"])
|
54
57
|
s.add_dependency(%q<jeweler>, ["~> 1.6.4"])
|
55
58
|
s.add_dependency(%q<rcov>, [">= 0"])
|
59
|
+
s.add_dependency(%q<rdoc>, ["~> 2.5.8"])
|
56
60
|
end
|
57
61
|
end
|
58
62
|
|
data/lib/closest-fibonacci.rb
CHANGED
@@ -2,6 +2,7 @@ require 'matrix'
|
|
2
2
|
|
3
3
|
class Fixnum
|
4
4
|
|
5
|
+
##
|
5
6
|
# Method to compute the next closest Fibonacci number F to a given integer N
|
6
7
|
# where F < N. For a Fixnumb, N = self's value.
|
7
8
|
#
|
@@ -15,10 +16,11 @@ class Fixnum
|
|
15
16
|
i = 0
|
16
17
|
prior_fib = 0
|
17
18
|
this_fib = 0
|
18
|
-
|
19
|
+
|
19
20
|
begin
|
20
21
|
prior_fib = this_fib
|
21
22
|
this_fib = get_fibonacci(i)
|
23
|
+
# puts "#{this_fib}\t\t#{this_fib - prior_fib}"
|
22
24
|
i = i + 1
|
23
25
|
end until this_fib >= self
|
24
26
|
|
@@ -33,6 +35,3 @@ private
|
|
33
35
|
end
|
34
36
|
end
|
35
37
|
|
36
|
-
n = 143
|
37
|
-
puts "Next Fibonacci number less than #{n} is " + n.closest_fibonacci.to_s
|
38
|
-
|
metadata
CHANGED
@@ -1,8 +1,13 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: closest-fibonacci
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
|
5
|
-
|
4
|
+
hash: 25
|
5
|
+
prerelease: false
|
6
|
+
segments:
|
7
|
+
- 0
|
8
|
+
- 1
|
9
|
+
- 1
|
10
|
+
version: 0.1.1
|
6
11
|
platform: ruby
|
7
12
|
authors:
|
8
13
|
- Kevin J. Dickerson
|
@@ -14,49 +19,81 @@ date: 2011-07-15 00:00:00 -07:00
|
|
14
19
|
default_executable:
|
15
20
|
dependencies:
|
16
21
|
- !ruby/object:Gem::Dependency
|
17
|
-
|
18
|
-
|
22
|
+
prerelease: false
|
23
|
+
version_requirements: &id001 !ruby/object:Gem::Requirement
|
19
24
|
none: false
|
20
25
|
requirements:
|
21
26
|
- - ">="
|
22
27
|
- !ruby/object:Gem::Version
|
28
|
+
hash: 3
|
29
|
+
segments:
|
30
|
+
- 0
|
23
31
|
version: "0"
|
32
|
+
name: shoulda
|
33
|
+
requirement: *id001
|
24
34
|
type: :development
|
25
|
-
prerelease: false
|
26
|
-
version_requirements: *id001
|
27
35
|
- !ruby/object:Gem::Dependency
|
28
|
-
|
29
|
-
|
36
|
+
prerelease: false
|
37
|
+
version_requirements: &id002 !ruby/object:Gem::Requirement
|
30
38
|
none: false
|
31
39
|
requirements:
|
32
40
|
- - ~>
|
33
41
|
- !ruby/object:Gem::Version
|
42
|
+
hash: 23
|
43
|
+
segments:
|
44
|
+
- 1
|
45
|
+
- 0
|
46
|
+
- 0
|
34
47
|
version: 1.0.0
|
48
|
+
name: bundler
|
49
|
+
requirement: *id002
|
35
50
|
type: :development
|
36
|
-
prerelease: false
|
37
|
-
version_requirements: *id002
|
38
51
|
- !ruby/object:Gem::Dependency
|
39
|
-
|
40
|
-
|
52
|
+
prerelease: false
|
53
|
+
version_requirements: &id003 !ruby/object:Gem::Requirement
|
41
54
|
none: false
|
42
55
|
requirements:
|
43
56
|
- - ~>
|
44
57
|
- !ruby/object:Gem::Version
|
58
|
+
hash: 7
|
59
|
+
segments:
|
60
|
+
- 1
|
61
|
+
- 6
|
62
|
+
- 4
|
45
63
|
version: 1.6.4
|
64
|
+
name: jeweler
|
65
|
+
requirement: *id003
|
46
66
|
type: :development
|
47
|
-
prerelease: false
|
48
|
-
version_requirements: *id003
|
49
67
|
- !ruby/object:Gem::Dependency
|
50
|
-
|
51
|
-
|
68
|
+
prerelease: false
|
69
|
+
version_requirements: &id004 !ruby/object:Gem::Requirement
|
52
70
|
none: false
|
53
71
|
requirements:
|
54
72
|
- - ">="
|
55
73
|
- !ruby/object:Gem::Version
|
74
|
+
hash: 3
|
75
|
+
segments:
|
76
|
+
- 0
|
56
77
|
version: "0"
|
78
|
+
name: rcov
|
79
|
+
requirement: *id004
|
57
80
|
type: :development
|
81
|
+
- !ruby/object:Gem::Dependency
|
58
82
|
prerelease: false
|
59
|
-
version_requirements:
|
83
|
+
version_requirements: &id005 !ruby/object:Gem::Requirement
|
84
|
+
none: false
|
85
|
+
requirements:
|
86
|
+
- - ~>
|
87
|
+
- !ruby/object:Gem::Version
|
88
|
+
hash: 11
|
89
|
+
segments:
|
90
|
+
- 2
|
91
|
+
- 5
|
92
|
+
- 8
|
93
|
+
version: 2.5.8
|
94
|
+
name: rdoc
|
95
|
+
requirement: *id005
|
96
|
+
type: :development
|
60
97
|
description: Get the closest value to N by calling Fibonacci.closest_to(n).
|
61
98
|
email: kevin.dickerson@gmail.com
|
62
99
|
executables: []
|
@@ -91,7 +128,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
|
|
91
128
|
requirements:
|
92
129
|
- - ">="
|
93
130
|
- !ruby/object:Gem::Version
|
94
|
-
hash:
|
131
|
+
hash: 3
|
95
132
|
segments:
|
96
133
|
- 0
|
97
134
|
version: "0"
|
@@ -100,11 +137,14 @@ required_rubygems_version: !ruby/object:Gem::Requirement
|
|
100
137
|
requirements:
|
101
138
|
- - ">="
|
102
139
|
- !ruby/object:Gem::Version
|
140
|
+
hash: 3
|
141
|
+
segments:
|
142
|
+
- 0
|
103
143
|
version: "0"
|
104
144
|
requirements: []
|
105
145
|
|
106
146
|
rubyforge_project:
|
107
|
-
rubygems_version: 1.
|
147
|
+
rubygems_version: 1.3.7
|
108
148
|
signing_key:
|
109
149
|
specification_version: 3
|
110
150
|
summary: Provides some methods to find a Fibonacci number less than a given N.
|