multiroot_tree 0.0.0

data/.document

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

data/.rspec

@@ -0,0 +1 @@
+--color

data/.travis.yml

@@ -0,0 +1,14 @@
+language: ruby
+rvm:
+  - "1.8.7"
+  - "1.9.2"
+  - "1.9.3"
+  - jruby-18mode # JRuby in 1.8 mode
+  - jruby-19mode # JRuby in 1.9 mode
+  - rbx-18mode
+  - rbx-19mode
+  - ruby-head
+  - jruby-head
+  - ree
+# uncomment this line if your project needs to run something other than `rake`:
+# script: bundle exec rspec spec

data/Gemfile

@@ -0,0 +1,14 @@
+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 "rspec", "~> 2.8.0"
+  #gem "rdoc", "~> 3.12"
+  gem "bundler"
+  gem "jeweler", "~> 1.8.4"
+  #gem "rcov", ">= 0"
+end

data/Gemfile.lock

@@ -0,0 +1,30 @@
+GEM
+  remote: http://rubygems.org/
+  specs:
+    diff-lcs (1.1.3)
+    git (1.2.5)
+    jeweler (1.8.4)
+      bundler (~> 1.0)
+      git (>= 1.2.5)
+      rake
+      rdoc
+    json (1.7.5)
+    rake (10.0.2)
+    rdoc (3.12)
+      json (~> 1.4)
+    rspec (2.8.0)
+      rspec-core (~> 2.8.0)
+      rspec-expectations (~> 2.8.0)
+      rspec-mocks (~> 2.8.0)
+    rspec-core (2.8.0)
+    rspec-expectations (2.8.0)
+      diff-lcs (~> 1.1.2)
+    rspec-mocks (2.8.0)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler
+  jeweler (~> 1.8.4)
+  rspec (~> 2.8.0)

data/LICENSE.txt

@@ -0,0 +1,20 @@
+Copyright (c) 2012 dp
+
+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,4 @@
+multiroot_tree
+==========
+
+Multiroot_tree is a tree data structure that allows for an arbitrary number of roots/parents and an arbitrary number of children.

data/README.rdoc

@@ -0,0 +1,19 @@
+= multiroot_tree
+
+Multiroot_tree is tree data structure that can have an arbitrary number of roots and arbitrary number of children.
+
+== Contributing to multiroot_tree
+ 
+* 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) 2012 dp. See LICENSE.txt for
+further details.
+

data/Rakefile

@@ -0,0 +1,48 @@
+# 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 = "multiroot_tree"
+  gem.homepage = "http://github.com/phamdt/multiroot_tree"
+  gem.license = "MIT"
+  gem.summary = "Tree data structure with arbitrary number of roots"
+  gem.description = "Multiroot_tree has some of the functions of a typical tree data structure. It can be used to model process, dependencies, and prerequisites."
+  gem.authors = ["dp"]
+  # dependencies defined in Gemfile
+end
+Jeweler::RubygemsDotOrgTasks.new
+
+require 'rspec/core'
+require 'rspec/core/rake_task'
+RSpec::Core::RakeTask.new(:spec) do |spec|
+  spec.pattern = FileList['spec/**/*_spec.rb']
+end
+
+# RSpec::Core::RakeTask.new(:rcov) do |spec|
+#   spec.pattern = 'spec/**/*_spec.rb'
+#   spec.rcov = true
+# end
+
+task :default => :spec
+
+require 'rdoc/task'
+Rake::RDocTask.new do |rdoc|
+  version = File.exist?('VERSION') ? File.read('VERSION') : ""
+
+  rdoc.rdoc_dir = 'rdoc'
+  rdoc.title = "multiroot_tree #{version}"
+  rdoc.rdoc_files.include('README*')
+  rdoc.rdoc_files.include('lib/**/*.rb')
+end

data/VERSION

@@ -0,0 +1 @@
+0.0.0

data/lib/multiroot_tree.rb

@@ -0,0 +1,101 @@
+##
+# Beginning implementation of a tree data structure with multiple
+# and arbitrary number of roots or N roots. Structure can be used
+# to model business logic, sequence of events, or ingredients.
+##
+
+  ##
+  # Danny Pham
+  # 12/10/12
+  ##
+
+class MultirootTree
+  include Enumerable
+  attr_reader :content, :children, :parents
+
+  def initialize(content)
+    @content = content
+    @children = []
+    @parents = []
+  end
+
+  #add a child to the children array, instance variable
+  def add_child(child)
+    if child.instance_of? MultirootTree
+      @children << child unless @children.include? child
+      child.add_parent(self) unless child.parents.include?(self)
+    end
+  end
+
+  #adds a list of MultirootTrees with each successive 
+  #MultirootTree being the child of the previous
+  def add_descendant_line(*descendants)
+    max = descendants.size
+    num = 0
+    first = self
+    second = descendants[num]
+    
+    while (num < descendants.size)
+      first.add_child(second)
+      first = second
+      second = descendants[num + 1]
+      num += 1
+    end
+  end
+
+  #severs tree connections going down descendant line
+  def disowns(child)
+    if child.is_a? MultirootTree
+      @children -= [child]
+      child.emancipates_from(self) if child.parents.include?(self)
+    end
+  end
+
+  #severs tree connections going up the ancestry
+  def emancipates_from(parent)
+    @parents -= [parent]
+    parent.disowns(self) if parent.children.include?(self) 
+  end
+
+  #adding parents is particularly necessary because any one 
+  #node can have N parents, not just one
+  def add_parent(parent)
+    @parents << parent unless @parents.include? parent
+    parent.add_child(self) unless parent.children.include?(self)
+  end
+
+  #adds immediate parents, not an ancestor line
+  def add_parents(*parents)
+    parents.each do |parent| 
+      self.add_parent(parent)
+      parent.add_child(self) unless parent.children.include?(self)
+    end
+  end
+
+  #returns roots/greatest parents
+  def roots
+    roots ||= []
+    if @parents.flatten.size == 0
+      roots << self
+    else
+      @parents.each {|parent| roots << parent.roots}
+    end
+    roots.flatten
+  end
+
+  #returns "youngest" children
+  def floor
+    floor = []
+    if @children.flatten.size == 0
+      floor << MultirootTree.new(self.content)
+    else
+      @children.each {|child| floor << child.floor}
+    end
+    floor.flatten
+  end
+
+  #returns value of node
+  def inspect
+    @content.inspect
+  end
+end

data/multiroot_tree.gemspec

@@ -0,0 +1,59 @@
+# 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 = "multiroot_tree"
+  s.version = "0.0.0"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["dp"]
+  s.date = "2012-12-11"
+  s.description = "Multiroot_tree has some of the functions of a typical tree data structure. It can be used to model process, dependencies, and prerequisites."
+  s.extra_rdoc_files = [
+    "LICENSE.txt",
+    "README.md",
+    "README.rdoc"
+  ]
+  s.files = [
+    ".document",
+    ".rspec",
+    ".travis.yml",
+    "Gemfile",
+    "Gemfile.lock",
+    "LICENSE.txt",
+    "README.md",
+    "README.rdoc",
+    "Rakefile",
+    "VERSION",
+    "lib/multiroot_tree.rb",
+    "multiroot_tree.gemspec",
+    "spec/multiroot_tree_spec.rb",
+    "spec/spec_helper.rb"
+  ]
+  s.homepage = "http://github.com/phamdt/multiroot_tree"
+  s.licenses = ["MIT"]
+  s.require_paths = ["lib"]
+  s.rubygems_version = "1.8.24"
+  s.summary = "Tree data structure with arbitrary number of roots"
+
+  if s.respond_to? :specification_version then
+    s.specification_version = 3
+
+    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
+      s.add_development_dependency(%q<rspec>, ["~> 2.8.0"])
+      s.add_development_dependency(%q<bundler>, [">= 0"])
+      s.add_development_dependency(%q<jeweler>, ["~> 1.8.4"])
+    else
+      s.add_dependency(%q<rspec>, ["~> 2.8.0"])
+      s.add_dependency(%q<bundler>, [">= 0"])
+      s.add_dependency(%q<jeweler>, ["~> 1.8.4"])
+    end
+  else
+    s.add_dependency(%q<rspec>, ["~> 2.8.0"])
+    s.add_dependency(%q<bundler>, [">= 0"])
+    s.add_dependency(%q<jeweler>, ["~> 1.8.4"])
+  end
+end
+

data/spec/multiroot_tree_spec.rb

@@ -0,0 +1,151 @@
+require File.expand_path(File.dirname(__FILE__) + '/spec_helper')
+##
+# This spec uses college courses and their prerequisites as
+# the content to test the MultirootTree structure
+##
+
+	##
+	# Danny Pham
+	# 12/10/12
+	##
+
+describe MultirootTree do
+	it "adds a child" do
+		e0 = MultirootTree.new("ENGL 073")
+		e1 = MultirootTree.new("ENGL 092")
+
+		e0.add_child(e1)
+
+		e0.children.should include(e1)
+	end
+
+	it "adds a child then the child adds its own child" do
+		f0 = MultirootTree.new("FRCH 121")
+		f1 = MultirootTree.new("FRCH 122")
+		f2 = MultirootTree.new("FRCH 123")
+
+		f0.add_child(f1)
+		f1.add_child(f2)
+
+		(f0.children.should include(f1)) && (f1.children.should include(f2))
+	end
+
+	it "adds a child and the child has it as a parent" do
+		f0 = MultirootTree.new("FRCH 121")
+		f1 = MultirootTree.new("FRCH 122")
+
+		f0.add_child(f1)
+
+		f1.parents.should include(f0)
+	end
+
+	it "adds line of descendants" do 
+		p0 = MultirootTree.new("PROG 110")
+		p1 = MultirootTree.new("PROG 118")
+		p2 = MultirootTree.new("PROG 120")
+		p3 = MultirootTree.new("PROG 140")
+		p4 = MultirootTree.new("PROG 210")
+		p5 = MultirootTree.new("PROG 225")
+
+		p0.add_descendant_line(p1, p2, p3, p4, p5)
+
+		((p0.children.should include(p1)) && \
+		(p1.children.should include(p2)) && \
+		(p2.children.should include(p3)) && \
+		(p3.children.should include(p4)) && \
+		(p4.children.should include(p5))) == true
+	end
+
+	it "adds a parent" do
+		d1 = MultirootTree.new("BUSIT 103")
+		d2 = MultirootTree.new("DBA 130")
+
+		d2.add_parent(d1)
+
+		d2.parents.should include(d1)
+	end
+
+	it "adds multiple parents" do
+		p3 = MultirootTree.new("PROG 140")
+		
+		m3 = MultirootTree.new("MATH 099")
+		e1 = MultirootTree.new("ENGL 101")
+		d2 = MultirootTree.new("DBA 130")
+
+		p3.add_parents(m3, e1, d2)
+		p3.parents.should include(m3, e1, d2)
+	end
+
+	it "adds a parent and the parent adds it as a child" do
+		d1 = MultirootTree.new("BUSIT 103")
+		d2 = MultirootTree.new("DBA 130")
+
+		d2.add_parent(d1)	
+		
+		d1.children.should include(d2)	
+	end
+
+	it "adds children then returns itself when finding roots (greatest parents)" do
+		m0 = MultirootTree.new("MATH 075")
+		m1 = MultirootTree.new("MATH 097")
+		m2 = MultirootTree.new("MATH 098")
+		m3 = MultirootTree.new("MATH 099")
+
+		m0.add_child(m1)
+		m1.add_child(m2)
+		m2.add_child(m3)
+
+		(m3.roots.inspect == m0.inspect && m0.roots.inspect == m0.inspect)
+	end
+
+	it "adds parents then returns the last parent as the root" do
+		m0 = MultirootTree.new("MATH 075")
+		m1 = MultirootTree.new("MATH 097")
+		m2 = MultirootTree.new("MATH 098")
+		m3 = MultirootTree.new("MATH 099")
+
+		m3.add_parent(m2)
+		m2.add_parent(m1)
+		m1.add_parent(m0)
+
+		(m3.roots.inspect == m0.inspect && m0.roots.inspect == m0.inspect)
+	end
+
+	it "finds floor (youngest children)" do
+		m0 = MultirootTree.new("MATH 075")
+		m1 = MultirootTree.new("MATH 097")
+		m2 = MultirootTree.new("MATH 098")
+		m3 = MultirootTree.new("MATH 099")
+
+		m3.add_parent(m2)
+		m2.add_parent(m1)
+		m1.add_parent(m0)
+
+		m0.floor.inspect == m3.inspect
+	end
+
+	it "disowns a child" do
+		m0 = MultirootTree.new("MATH 075")
+		m1 = MultirootTree.new("MATH 097")
+
+		m0.add_child(m1)
+
+		m0.disowns(m1)
+
+		(m1.parents.size == 0 && m0.children.size == 0)
+	end
+
+	it "emancipates from a parent" do
+		m0 = MultirootTree.new("MATH 075")
+		m1 = MultirootTree.new("MATH 097")
+
+		m0.add_child(m1)
+
+		m1.emancipates_from(m0)
+
+		(m1.parents.size == 0 && m0.children.size == 0)		
+	end
+end
+
+
+

data/spec/spec_helper.rb

@@ -0,0 +1,12 @@
+$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
+$LOAD_PATH.unshift(File.dirname(__FILE__))
+require 'rspec'
+require 'multiroot_tree'
+
+# Requires supporting files with custom matchers and macros, etc,
+# in ./support/ and its subdirectories.
+Dir["#{File.dirname(__FILE__)}/support/**/*.rb"].each {|f| require f}
+
+RSpec.configure do |config|
+  
+end

metadata

@@ -0,0 +1,104 @@
+--- !ruby/object:Gem::Specification 
+name: multiroot_tree
+version: !ruby/object:Gem::Version 
+  prerelease: 
+  version: 0.0.0
+platform: ruby
+authors: 
+- dp
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2012-12-11 00:00:00 Z
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: rspec
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ~>
+      - !ruby/object:Gem::Version 
+        version: 2.8.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 
+        version: "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 
+        version: 1.8.4
+  type: :development
+  prerelease: false
+  version_requirements: *id003
+description: Multiroot_tree has some of the functions of a typical tree data structure. It can be used to model process, dependencies, and prerequisites.
+email: 
+executables: []
+
+extensions: []
+
+extra_rdoc_files: 
+- LICENSE.txt
+- README.md
+- README.rdoc
+files: 
+- .document
+- .rspec
+- .travis.yml
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- README.rdoc
+- Rakefile
+- VERSION
+- lib/multiroot_tree.rb
+- multiroot_tree.gemspec
+- spec/multiroot_tree_spec.rb
+- spec/spec_helper.rb
+homepage: http://github.com/phamdt/multiroot_tree
+licenses: 
+- MIT
+post_install_message: 
+rdoc_options: []
+
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      hash: 523468993
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  none: false
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      version: "0"
+requirements: []
+
+rubyforge_project: 
+rubygems_version: 1.8.24
+signing_key: 
+specification_version: 3
+summary: Tree data structure with arbitrary number of roots
+test_files: []
+