rational_number 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: cc867843cd407372129d0e3090f47476e499295b
+  data.tar.gz: 54595ccb8d94685801bec59fd2412ba9b9e4f920
+SHA512:
+  metadata.gz: 7967627fae4440914f62fce3031c00fb6879642137f339a4c53e747c452f54edb6ad9f1729f8f6de36f63e82eda028185b2b06cf4b47cf2a7e3429baa621d319
+  data.tar.gz: d0de1d59035256db00f326c701f20d6af1fb30b4d44e7b08e1b426d46913f39cec54f28464fd0d154c4eab4218db1c038fa2a01f191483db1b6054b0f1d851ab

data/.gitignore

@@ -0,0 +1,45 @@
+# OSX
+
+.DS_Store
+.AppleDouble
+.LSOverride
+Icon
+
+# Thumbnails
+._*
+
+# Files that might appear on external disk
+.Spotlight-V100
+.Trashes
+
+# Windows
+# Windows image file caches
+Thumbs.db
+ehthumbs.db
+
+# Folder config file
+Desktop.ini
+
+# Recycle Bin used on file shares
+$RECYCLE.BIN/
+
+#Ruby standard
+
+*.gem
+*.rbc
+.bundle
+.config
+coverage
+InstalledFiles
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp
+
+# YARD artifacts
+.yardoc
+_yardoc
+doc/

data/.rspec

@@ -0,0 +1 @@
+--colour

data/.ruby-gemset

@@ -0,0 +1 @@
+rails_4_gem_devel

data/.ruby-version

@@ -0,0 +1 @@
+ruby-2.0.0-p195

data/.travis.yml

@@ -0,0 +1,7 @@
+language: ruby
+rvm:
+  - 1.9.3
+  - 2.0.0
+notifications:
+  email: false
+bundler_args: --without development

data/Gemfile

@@ -0,0 +1,12 @@
+source 'http://rubygems.org'
+
+gem 'rake'
+gem 'coveralls', :require => false
+gem 'simplecov', :require => false
+
+group :test do
+  gem 'rspec'
+  gem 'shoulda',           '>= 3.5.0'
+end
+
+gemspec

data/Gemfile.lock

@@ -0,0 +1,67 @@
+PATH
+  remote: .
+  specs:
+    rational_number (0.1.0)
+
+GEM
+  remote: http://rubygems.org/
+  specs:
+    activesupport (4.0.0)
+      i18n (~> 0.6, >= 0.6.4)
+      minitest (~> 4.2)
+      multi_json (~> 1.3)
+      thread_safe (~> 0.1)
+      tzinfo (~> 0.3.37)
+    atomic (1.1.13)
+    colorize (0.5.8)
+    coveralls (0.6.7)
+      colorize
+      multi_json (~> 1.3)
+      rest-client
+      simplecov (>= 0.7)
+      thor
+    diff-lcs (1.2.4)
+    i18n (0.6.5)
+    mime-types (1.24)
+    minitest (4.7.5)
+    multi_json (1.7.9)
+    rake (10.1.0)
+    rest-client (1.6.7)
+      mime-types (>= 1.16)
+    rspec (2.14.1)
+      rspec-core (~> 2.14.0)
+      rspec-expectations (~> 2.14.0)
+      rspec-mocks (~> 2.14.0)
+    rspec-core (2.14.5)
+    rspec-expectations (2.14.2)
+      diff-lcs (>= 1.1.3, < 2.0)
+    rspec-mocks (2.14.3)
+    shoulda (3.5.0)
+      shoulda-context (~> 1.0, >= 1.0.1)
+      shoulda-matchers (>= 1.4.1, < 3.0)
+    shoulda-context (1.1.5)
+    shoulda-matchers (2.3.0)
+      activesupport (>= 3.0.0)
+    simplecov (0.7.1)
+      multi_json (~> 1.0)
+      simplecov-html (~> 0.7.1)
+    simplecov-gem-adapter (1.0.1)
+      simplecov
+    simplecov-html (0.7.1)
+    thor (0.18.1)
+    thread_safe (0.1.2)
+      atomic
+    tzinfo (0.3.37)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (>= 1.3.0)
+  coveralls
+  rake
+  rational_number!
+  rspec
+  shoulda (>= 3.5.0)
+  simplecov
+  simplecov-gem-adapter

data/LICENSE

@@ -0,0 +1,20 @@
+Copyright (c) 2013 Leif Ringstad
+
+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.md

@@ -0,0 +1,76 @@
+# rational_number
+[![Build Status](https://travis-ci.org/leifcr/rational_number.png?branch=master)](https://travis-ci.org/leifcr/rational_number) [![Coverage Status](https://coveralls.io/repos/leifcr/rational_number/badge.png?branch=master)](https://coveralls.io/r/leifcr/rational_number?branch=master)
+
+This implements basic rational numbers in Ruby. It can be used in tree implementations and provides a really fast way of looking up a sorted tree.
+
+Read about rational numbers in tree structures here: http://arxiv.org/pdf/0806.3115v1.pdf
+
+Note: This is NOT a tree implementation, it is only a wrapper of rational numbers in ruby.
+
+For a proper tree implementation see e.g. [mm-tree](https://github.com/leifcr/mm-tree)
+
+## Installation
+
+### Using bundler
+
+Latest stable release:
+
+```ruby
+gem 'rational_number'
+```
+
+For latest edge version:
+
+```ruby
+gem 'rational_number', :git => 'https://github.com/leifcr/rational_number.git'
+```
+
+This gem *only* supports the following versions:
+
+   * mongomapper >= 0.13
+   * ruby >= 2.0
+   * rails >= 3.2
+
+_Note: If you are using mongo\_mapper < 0.13, ruby < 2.0 or rails < 3.2 you have to use version 0.1.4.
+
+### Without bundler
+
+gem install rational_number
+
+## Usage
+
+```ruby
+a = RationalNumber.new # Root
+b = a.child_from_position(1) # Get child of root in position 1
+b.next_sibling # Get next sibling of b
+b.sibling_from_position(5) #Get sibling in position 5 on the current "level"
+
+# More advanced
+b.rational_number_from_ancestor_and_position(b,5) # Get a specific rational number from a given ancestor and position
+
+# check if rational numbers are related
+a.has_child?(b) # true
+b.is_child_of?(root) # true
+
+b.has_ancestor?(a) # true
+a.is_ancestor_of?(b) # true
+```
+
+For more examples see the spec in spec/rational\_number\_spec.rb
+
+## Note on Patches/Pull Requests
+
+* Fork the project.
+* Make your feature addition or bug fix.
+* Add tests for it. This is important so I don't break it in a future version unintentionally.
+* Send me a pull request, if you have features you like to see implemented.
+
+## Thanks
+
+_Dan Hazel_: For his paper on rational numbers
+
+## Copyright
+
+Original ideas are Copyright Jakob Vidmar and Joel Junström. Please see their github repositories for details
+Copyright (c) 2013 Leif Ringstad.
+See LICENSE for details.

data/Rakefile

@@ -0,0 +1,47 @@
+# 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 'bundler/setup'
+require "bundler/gem_tasks"
+require 'rake'
+
+begin
+  require 'rspec/core/rake_task'
+  RSpec::Core::RakeTask.new(:spec) do |spec|
+    spec.pattern = 'spec/*_spec.rb'
+    spec.rspec_opts = ['--color']
+  end
+  task :default => :spec
+rescue LoadError
+  nil
+end
+
+# # Ignore LoadError for jeweler when running on e.g. Travis-CI
+# begin
+#   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        = "rational_number"
+#     gem.homepage    = "https://github.com/leifcr/rational_number"
+#     gem.license     = "MIT"
+#     gem.summary     = %Q{Rational Number basic class for Ruby}
+#     gem.description = %Q{Provide basic rational numbers for ruby}
+#     gem.email       = "leifcr@gmail.com"
+#     gem.authors     = ["Leif Ringstad"]
+#     gem.files.exclude [".ruby-*", ".travis.yml"]
+#     # dependencies defined in Gemfile
+#   end
+#   Jeweler::RubygemsDotOrgTasks.new
+# rescue LoadError
+#   nil
+# end

data/lib/rational_number/version.rb

@@ -0,0 +1,3 @@
+module RationalNumberGem
+  VERSION = "0.1.0"
+end

data/lib/rational_number.rb

@@ -0,0 +1,264 @@
+##
+# Rational Numbers (tree) in ruby
+#
+# Read about rational numbers in tree structures here: http://arxiv.org/pdf/0806.3115v1.pdf
+#
+# Please note that sibling and child will be identical if you are start at "root" level, with the default values
+# (nv = 0, dv = 1, snv = 1, sdv = 0)
+#
+# Rational numbers always require a "root" at the bottom of the tree
+#
+# You can find child values, sibling values, see if a value is parent or child of a given rational number.
+# It is possible to verify child/parent relationships without even checking with a database.
+#
+
+class RationalNumber # < Object
+  include Comparable
+  attr :nv, :dv, :snv, :sdv, :number
+
+  ##
+  # Compare to other (Comparable)
+  #
+  def <=>(other)
+    return 0 if (@nv === other.nv) and (@dv === other.dv) and (@snv == other.snv) and (@sdv == other.sdv)
+    if @number < other.number
+      -1
+    elsif @number > other.number
+      1
+    else
+      0
+    end
+  end
+
+  ##
+  # Convert to string
+  #
+  # @return [String] String describing the rational number.
+  #
+  def to_s
+    "RationalNumber: number: #{@number} nv: #{@nv} dv: #{@dv} snv: #{@snv} sdv: #{@sdv}"
+  end
+
+  ##
+  # Convert to Hash
+  #
+  # @return [Hash] hash containing the rational numbers
+  #
+  def to_hash
+    {
+      :nv => @nv,
+      :dv => @dv,
+      :snv => @snv,
+      :sdv => @sdv,
+      :number => @number
+    }
+  end
+
+  ##
+  # Initialize rational number
+  #
+  # @param [Integer] The nominator value
+  # @param [Integer] The denomitaor value
+  # @param [Integer] The SNV value
+  # @param [Integer] The SDV Value
+  #
+  # @return [undefined]
+  #
+  def initialize(nv = 0, dv = 1, snv = 1, sdv = 0)
+    set_values(nv, dv, snv, sdv)
+    #super()
+  end
+
+  ##
+  # Set the values of nv,dv,snv and sdv directly
+  #
+  # @param [Integer] The nominator value
+  # @param [Integer] The denomitaor value
+  # @param [Integer] The SNV value
+  # @param [Integer] The SDV Value
+  #
+  def set_values(nv, dv, snv, sdv)
+    @nv = nv
+    @dv = dv
+    @snv = snv
+    @sdv = sdv
+    @number = Float(nv)/Float(dv)
+  end
+
+  ##
+  # Will set the values from another RationalNumber
+  #
+  # @param [RationalNumber]
+  #
+  # @return [undefined]
+  #
+  def set_from_other(other)
+    set_values(other.nv, other.dv, other.snv, other.sdv)
+  end
+
+  ##
+  # See if rational number is root
+  #
+  def root?
+    (@nv === 0) and (@dv === 1) and (@snv === 1) and (@sdv === 0)
+  end
+
+  ##
+  # Get the calculated postion at the current "level" for this rational number in a "tree"
+  #
+  # @return [Integer] The position
+  #
+  def position
+    _parent = self.parent
+    ((@nv - _parent.nv) / _parent.snv)
+  end
+
+  ##
+  # Returns parent as a rational number
+  #
+  # @return [RationalNumber] The parent
+  #
+  def parent
+    raise NoParentRationalNumberIsRootError if root?
+    numerator   = @nv
+    denominator = @dv
+    _parent    = RationalNumber.new
+    compare_key  = RationalNumber.new
+    # make sure we break if we get root values! (numerator == 0 + denominator == 0)
+    while ((compare_key.nv < @nv) && (compare_key.dv < @dv)) && ((numerator > 0) && (denominator > 0))
+      div = numerator / denominator
+      mod = numerator % denominator
+      # set return values to previous values, as they are the parent values
+      _parent.set_from_other(compare_key)
+
+      # temporary calculations (needed)
+      parent_nv = _parent.nv + (div * _parent.snv)
+      parent_dv = _parent.dv + (div * _parent.sdv)
+
+      compare_key.set_values( parent_nv ,  #nv
+                              parent_dv ,  #dv
+                              parent_nv + _parent.snv, #snv
+                              parent_dv + _parent.sdv) #sdv
+      numerator = mod
+      if (numerator != 0)
+        denominator = denominator % mod
+        denominator = 1 if denominator == 0
+      end
+    end
+    _parent
+  end
+
+  ##
+  # Return the next sibling rational number
+  #
+  # Uses this RationalNumber parent values
+  #
+  # @return [RationalNumber] The sibling
+  #
+  def next_sibling
+    # Raise error in case we are root
+    raise RationalNumberIsRootNoSiblingsError if root?
+
+    _parent = self.parent # Get parent already to avoid duplicate calculations
+    _position = ((@nv - _parent.nv) / _parent.snv) + 1
+    value_from_parent_and_position(_parent, _position)
+  end
+
+  ##
+  # Return the sibling rational number from a given position.
+  #
+  # Uses this RationalNumber parent values
+  #
+  # @param [Integer] The position
+  #
+  # @return [RationalNumber] The sibling
+  #
+  def sibling_from_position(_position)
+    raise RationalNumberIsRootNoSiblingsError if root?
+    _parent = self.parent
+    value_from_parent_and_position(_parent, _position)
+  end
+
+  ##
+  # Return the rational number from parent and position
+  #
+  # @param [RationalNumber] The parents RationalNumber for a given RationalNumber and the new sibling
+  # @param [Integer] The position
+  #
+  # @return [RationalNumber] The rational number
+  #
+  def value_from_parent_and_position(_parent, _position)
+    sibling = RationalNumber.new(
+      _parent.nv + (_position * _parent.snv), # nv
+      _parent.dv + (_position * _parent.sdv), # dv
+      _parent.nv + ((_position + 1) * _parent.snv), # snv
+      _parent.dv + ((_position + 1) * _parent.sdv)  # sdv
+      )
+  end
+
+  ##
+  # Return the child rational number from given position
+  #
+  # @param [Integer] The position
+  #
+  # @return [RationalNumber] The child rational number
+  #
+  def child_from_position(_position)
+    value_from_parent_and_position(self, _position)
+  end
+
+  ##
+  # Check if the child is a immediate child of an parent
+  #
+  # @param [RationalNumber] The parents to verify against
+  #
+  # @return [Boolean] true if the parent to verify against is the same as the childs parent
+  #
+  def is_child_of?(_parent)
+    return false if (self == _parent) or self.root?
+    _parent == self.parent
+  end
+
+  ##
+  # Check if the parent is a immediate parent of a child
+  #
+  # @param [RationalNumber] The parents to verify against
+  #
+  # @return [Boolean] true if the parent to verify against is the same as the childs parent
+  #
+  def is_parent_of?(_child)
+    return false if self == _child
+    _child.is_child_of?(self)
+  end
+
+  ##
+  # Check if the child is a descendant of an parent (at any level)
+  #
+  # @param [RationalNumber] The parents to verify against
+  #
+  # @return [Boolean] true if the parent is any parent above in the hierarchy
+  #
+  def is_descendant_of?(_parent)
+    return false if (self == _parent) or self.root?
+    verify_parent = self # start with beeing self
+    while !verify_parent.root? do
+      verify_parent = verify_parent.parent
+      return true if _parent == verify_parent
+    end
+    false
+  end
+
+end # class RationalNumber
+
+
+##
+# The rational number is root and therefore has no siblings
+#
+class RationalNumberIsRootNoSiblingsError < StandardError
+end
+
+##
+# The rational number is root and therefore has no parent
+#
+class NoParentRationalNumberIsRootError < StandardError
+end

data/rational_number.gemspec

@@ -0,0 +1,44 @@
+# -*- encoding: utf-8 -*-
+$:.push File.expand_path("../lib", __FILE__)
+require "rational_number/version"
+
+Gem::Specification.new do |s|
+  s.name = "rational_number"
+  s.version = RationalNumberGem::VERSION
+
+  s.platform    = Gem::Platform::RUBY
+  s.required_ruby_version = ">= 1.9.2"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Leif Ringstad"]
+  s.date = "2013-08-21"
+  s.summary = "Rational Numbers for trees"
+  s.description = "Provide basic rational numbers for trees"
+  s.email = "leifcr@gmail.com"
+  s.extra_rdoc_files = [ "README.md" ]
+  s.files         = `git ls-files`.split("\n")
+  s.test_files    = `git ls-files -- {test,spec,features}/*`.split("\n")
+
+  s.homepage = "https://github.com/leifcr/rational_number"
+  s.licenses = ["MIT"]
+  s.require_paths = ["lib"]
+  s.rubygems_version = "2.0.3"
+
+  s.add_development_dependency("rake")
+  s.add_development_dependency("rspec")
+  s.add_development_dependency("simplecov")
+  s.add_development_dependency("simplecov-gem-adapter")
+
+  if s.respond_to? :specification_version then
+    s.specification_version = 4
+
+    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
+      s.add_development_dependency(%q<bundler>, [">= 1.3.0"])
+    else
+      s.add_dependency(%q<bundler>, [">= 1.3.0"])
+    end
+  else
+    s.add_dependency(%q<bundler>, [">= 1.3.0"])
+  end
+end
+

data/spec/rational_number_spec.rb

@@ -0,0 +1,165 @@
+require 'spec_helper'
+describe "RationalNumber" do
+  before(:each) do
+    @root = RationalNumber.new
+    @first_child = @root.child_from_position(1)
+  end
+
+  it "should verify that @root is @root" do
+    @root.root?.should == true
+  end
+
+  it "should raise an error when trying to get parent rational number on @root" do
+    expect {@root.parent}.to raise_error(NoParentRationalNumberIsRootError)
+  end
+
+  it "should raise an error when trying to get a sibling on @root" do
+    expect {@root.next_sibling}.to raise_error(RationalNumberIsRootNoSiblingsError)
+    expect {@root.sibling_from_position(0)}.to raise_error(RationalNumberIsRootNoSiblingsError)
+  end
+
+  it "should verify values" do
+    @root.nv.should ==  0
+    @root.dv.should ==  1
+    @root.snv.should == 1
+    @root.sdv.should == 0
+  end
+
+  it "should get the first child values" do
+    @first_child.nv.should  == 1
+    @first_child.dv.should  == 1
+    @first_child.snv.should == 2
+    @first_child.sdv.should == 1
+    @first_child.number.should == Float(@first_child.nv)/Float(@first_child.dv)
+  end
+
+  it "should verify the parent values of the first child" do
+    parent = @first_child.parent
+    child = @first_child
+    parent.should == child.parent
+  end
+
+  it "should verify the parent values of a child of the first child" do
+    parent = @first_child
+    child = @first_child.child_from_position(5)
+    parent.should == child.parent
+  end
+
+  it "should get the child values from a given position" do
+    fifth_child = @root.child_from_position(5)
+    fifth_child.nv.should  == 5
+    fifth_child.dv.should  == 1
+    fifth_child.snv.should == 6
+    fifth_child.sdv.should == 1
+    fifth_child.number.should == Float(fifth_child.nv)/Float(fifth_child.dv)
+  end
+
+  it "should get the next sibling from first child" do
+    next_sibling = @first_child.next_sibling
+    next_sibling.nv.should  == 2
+    next_sibling.dv.should  == 1
+    next_sibling.snv.should == 3
+    next_sibling.sdv.should == 1
+    next_sibling.number.should == Float(next_sibling.nv)/Float(next_sibling.dv)
+  end
+
+  it "should get fifth sibling from first child" do
+    fifth_sibling = @first_child.sibling_from_position(5)
+    fifth_sibling.nv.should  == 5
+    fifth_sibling.dv.should  == 1
+    fifth_sibling.snv.should == 6
+    fifth_sibling.sdv.should == 1
+    fifth_sibling.number.should == Float(fifth_sibling.nv)/Float(fifth_sibling.dv)
+  end
+
+  it "should verify two children of the first child" do
+    child_1_1 = @first_child.child_from_position(1)
+    child_1_1.nv.should  == 3
+    child_1_1.dv.should  == 2
+    child_1_1.snv.should == 5
+    child_1_1.sdv.should == 3
+    child_1_1.number.should == Float(child_1_1.nv)/Float(child_1_1.dv)
+
+    child_1_3 = @first_child.child_from_position(3)
+
+    child_1_3.nv.should  == 7
+    child_1_3.dv.should  == 4
+    child_1_3.snv.should == 9
+    child_1_3.sdv.should == 5
+    child_1_3.number.should == Float(child_1_3.nv)/Float(child_1_3.dv)
+  end
+
+  it "should verify the position of three rational numbers" do
+    child_1_1 = @first_child.child_from_position(1)
+    child_1_1.position.should == 1
+    child_1_3 = @first_child.child_from_position(3)
+    child_1_3.position.should == 3
+    fifth_child = @root.child_from_position(5)
+    fifth_child.position.should == 5
+  end
+
+  it "should verify comparison of rational numbers" do
+    child_1   = @first_child
+    child_1_1 = @first_child.child_from_position(1)
+    child_1_3 = @first_child.child_from_position(3)
+    child_2   = @first_child.next_sibling
+
+    child_1.should   < child_1_1
+    child_1_1.should < child_1_3
+    child_1_3.should < child_2
+    child_2.should   > child_1
+    child_2.should   > child_1_1
+    child_2.should   > child_1_3
+    child_1_1.should == child_1_1
+  end
+
+  it "should set values directoy" do
+    a = RationalNumber.new
+    b = @first_child.child_from_position(3)
+    a.set_from_other(b)
+    b.should == a
+  end
+
+  it "should set values from other RationalNumber" do
+    a = RationalNumber.new
+    b = @first_child.child_from_position(3)
+    a.set_values(b.nv,b.dv,b.snv,b.sdv)
+    b.should == a
+  end
+
+  it "should check if the RationalNumber resonds to being a child of an given parent" do
+    child_1_4 = @first_child.child_from_position(4)
+    @first_child.is_child_of?(@root).should     == true
+    child_1_4.is_child_of?(@root).should        == false
+    child_1_4.is_child_of?(@first_child).should == true
+    child_1_4.is_child_of?(child_1_4).should    == false # should return false for same object
+  end
+
+  it "should check if the RationalNumber responds to being a parent of a given child" do
+    child_1_4 = @first_child.child_from_position(4)
+    @root.is_parent_of?(@first_child).should     == true
+    @root.is_parent_of?(child_1_4).should        == false
+    @first_child.is_parent_of?(child_1_4).should == true
+    child_1_4.is_parent_of?(child_1_4).should    == false # should return false for same object
+  end
+
+  it "should respons if the RationalNumber is a descendant of given parent" do
+    child_1_4   = @first_child.child_from_position(4)
+    child_1_4_9 = child_1_4.child_from_position(9)
+    child_1_4_9.is_descendant_of?(@root).should        == true
+    child_1_4_9.is_descendant_of?(@first_child).should == true
+    child_1_4_9.is_descendant_of?(child_1_4).should    == true
+
+    child_1_4.is_descendant_of?(@root).should          == true
+    child_1_4.is_descendant_of?(@first_child).should   == true
+    child_1_4.is_descendant_of?(child_1_4_9).should    == false
+
+    @first_child.is_descendant_of?(@root).should       == true
+    @first_child.is_descendant_of?(child_1_4).should   == false
+
+    @root.is_descendant_of?(@root).should               == false
+    @first_child.is_descendant_of?(@first_child).should == false
+    @root.is_descendant_of?(child_1_4_9).should         == false
+  end
+
+end

data/spec/spec_helper.rb

@@ -0,0 +1,24 @@
+$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
+$LOAD_PATH.unshift(File.dirname(__FILE__))
+
+require 'rubygems'
+require 'bundler/setup'
+require 'fileutils'
+
+if ENV['TRAVIS']
+  require 'coveralls'
+  Coveralls.wear!
+elsif ENV['COVERAGE'] && RUBY_VERSION > "1.8"
+  require 'simplecov'
+  SimpleCov.start do
+    add_filter 'spec'
+  end
+end
+
+require 'rational_number'
+
+Bundler.require(:default, :test)
+
+RSpec.configure do |c|
+
+end

metadata

@@ -0,0 +1,131 @@
+--- !ruby/object:Gem::Specification
+name: rational_number
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Leif Ringstad
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-08-21 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: simplecov-gem-adapter
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: 1.3.0
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: 1.3.0
+description: Provide basic rational numbers for trees
+email: leifcr@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files:
+- README.md
+files:
+- .gitignore
+- .rspec
+- .ruby-gemset
+- .ruby-version
+- .travis.yml
+- Gemfile
+- Gemfile.lock
+- LICENSE
+- README.md
+- Rakefile
+- lib/rational_number.rb
+- lib/rational_number/version.rb
+- rational_number.gemspec
+- spec/rational_number_spec.rb
+- spec/spec_helper.rb
+homepage: https://github.com/leifcr/rational_number
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: 1.9.2
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.0.3
+signing_key: 
+specification_version: 4
+summary: Rational Numbers for trees
+test_files:
+- spec/rational_number_spec.rb
+- spec/spec_helper.rb