BinarySearchk 0.0.2

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 858b852537424054e0f43ea1e38c882800914064
+  data.tar.gz: ec7199d8791374402d6ddb8061b0407173a3c3ab
+SHA512:
+  metadata.gz: c8997b23a4e67090afaa30ad789f175672cfd23768345453dcdb9876dbeab69f4232fd8e8d0279cc45319a397958ceedc1d37d6cecd744c16bca17e8ca888fbc
+  data.tar.gz: 888077c978156150984763aa65d15418da28fe09530cab295c002754385bf95841b746e85d6adfc04acf2c7e73db40d068501da51b193ab337840383039be94c

data/.gitignore

@@ -0,0 +1,14 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.bundle
+*.so
+*.o
+*.a
+mkmf.log

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--require spec_helper

data/BinarySearchk.gemspec

@@ -0,0 +1,24 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'BinarySearchk/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "BinarySearchk"
+  spec.version       = BinarySearchk::VERSION
+  spec.authors       = ["Kayode Adeniyi"]
+  spec.email         = ["kayode.adeniyi@andela.co"]
+  spec.summary       = %q{This gem builds a tree when an array is supplied and employs either DFS or BFS to search for any child}
+  spec.description   = %q{This gem employs Breadth-First-Search or Depth-First-Search to search whether an element is in a tree. }
+  spec.homepage      = ""
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0")
+  spec.executables   = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
+  spec.test_files    = spec.files.grep(%r{^(test|spec|features)/})
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.7"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec"
+end

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in BinarySearchk.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2015 Kayode Adeniyi
+
+MIT License
+
+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,31 @@
+# BinarySearchk
+
+TODO: Write a gem description
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'BinarySearchk'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install BinarySearchk
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Contributing
+
+1. Fork it ( https://github.com/[my-github-username]/BinarySearchk/fork )
+2. Create your feature branch (`git checkout -b my-new-feature`)
+3. Commit your changes (`git commit -am 'Add some feature'`)
+4. Push to the branch (`git push origin my-new-feature`)
+5. Create a new Pull Request

data/Rakefile

@@ -0,0 +1,5 @@
+require "bundler/gem_tasks"
+require 'rspec/core/rake_task'
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/lib/BinarySearchk/BinarySearchk.rb

@@ -0,0 +1,81 @@
+module BinarySearchk
+    class Node
+        attr_accessor :left, :right, :value
+
+        def initialize(v=nil)
+            @value = v
+            @left = nil
+            @right = nil
+        end
+
+        def insert(v)
+            case value <=> v
+            when 1 then insert_left(v)
+            when -1 then insert_right(v)
+            when 0 then false
+            end
+        end
+
+        def insert_left(v)
+            if left.nil?
+                self.left = Node.new(v)
+            else
+                left.insert(v)
+            end
+        end
+
+        def insert_right(v)
+            if right.nil?
+                self.right = Node.new(v)
+            else
+                right.insert(v)
+            end
+        end
+
+      def self.build_tree(array)
+          right = array.length-1
+          left=0
+
+          index_mid = (left + (right-left)) / 2
+          @node = Node.new(array[index_mid])
+          array.each {|v| @node.insert(v) }
+
+          @node
+      end
+
+      def self.breadth_first_search(target_value, node)
+          queue = [node]
+          until queue.empty?
+              current_node = queue.shift
+              return "Found #{current_node.value}" if current_node.value == target_value
+              queue.push current_node.left unless current_node.left.nil?
+              queue.push current_node.right unless current_node.right.nil?
+          end
+          nil
+      end
+
+      def self.depth_first_search(target_value, node)
+          stack = [node]
+          until stack.empty?
+              current_node = stack.pop
+              return "Found #{current_node.value}" if current_node.value == target_value
+              stack.push current_node.right unless current_node.right.nil?
+              stack.push current_node.left unless current_node.left.nil?
+          end
+          nil
+      end
+
+      def self.dfs_rec(target_value, node)
+          if node.nil?
+              return nil
+          else
+              return "Found #{node.value}" if node.value == target_value
+              search_left_child = dfs_rec(target_value, node.left)
+              search_right_child = dfs_rec(target_value, node.right)
+          end
+          #return any of the two that is not nil
+          return (search_right_child or search_left_child)
+          nil
+	end
+  end
+end

data/lib/BinarySearchk/version.rb

@@ -0,0 +1,3 @@
+module BinarySearchk
+  VERSION = "0.0.2"
+end

data/lib/BinarySearchk.rb

@@ -0,0 +1,2 @@
+require "BinarySearchk/version"
+require 'BinarySearchk/BinarySearchk'

data/spec/binarysearchk_spec.rb

@@ -0,0 +1,41 @@
+require 'spec_helper'
+
+describe BinarySearchk do
+    it 'creates a node with value 10' do
+        tree = BinarySearchk::Node.new(10)
+        expect(tree.value).to eq(10)
+    end
+
+    it 'creates a tree with children' do
+        arr = [1, 7, 4, 23, 8, 9, 4, 3, 5, 7, 9, 67, 6345, 324]
+        tree = BinarySearchk::Node.build_tree(arr)
+        expect(tree.value).to eq(4)
+        expect("#{tree.left.value if !tree.left.nil?}").to eq("1")
+        expect("#{tree.right.value unless tree.right.nil?}").to eq("7")
+        expect("#{tree.left.left.value unless tree.left.left.nil?}").to eq("")
+        expect("#{tree.left.right.value unless tree.left.right.nil?}").to eq("3")
+        expect("#{tree.right.left.value unless tree.right.left.nil?}").to eq("5")
+        expect("#{tree.right.right.value unless tree.right.right.nil?}").to eq("23")
+        expect("#{tree.right.right.left.value unless tree.right.right.left.nil?}").to eq("8")
+    end
+
+    it 'Uses BFS to search for a number' do
+        arr = [1, 7, 4, 23, 8, 9, 4, 3, 5, 7, 9, 67, 6345, 324]
+        tree = BinarySearchk::Node.build_tree(arr)
+        expect(BinarySearchk::Node.breadth_first_search(7, tree)).to eq("Found 7")
+    end
+
+    it 'Uses DFS to search for a number' do
+        arr = [1, 7, 4, 23, 8, 9, 4, 3, 5, 7, 9, 67, 6345, 324]
+        tree = BinarySearchk::Node.build_tree(arr)
+        expect(BinarySearchk::Node.depth_first_search(6345, tree)).to eq("Found 6345")
+    end
+
+    it 'Uses recursive DFS to search for a number' do
+        arr = [1, 7, 4, 23, 8, 9, 4, 3, 5, 7, 9, 67, 6345, 324]
+        tree = BinarySearchk::Node.build_tree(arr)
+        expect(BinarySearchk::Node.dfs_rec(9, tree)).to eq("Found 9")
+    end
+
+
+end

data/spec/spec_helper.rb

@@ -0,0 +1,97 @@
+require 'BinarySearchk'
+# This file was generated by the `rspec --init` command. Conventionally, all
+# specs live under a `spec` directory, which RSpec adds to the `$LOAD_PATH`.
+# The generated `.rspec` file contains `--require spec_helper` which will cause
+# this file to always be loaded, without a need to explicitly require it in any
+# files.
+#
+# Given that it is always loaded, you are encouraged to keep this file as
+# light-weight as possible. Requiring heavyweight dependencies from this file
+# will add to the boot time of your test suite on EVERY test run, even for an
+# individual file that may not need all of that loaded. Instead, consider making
+# a separate helper file that requires the additional dependencies and performs
+# the additional setup, and require it from the spec files that actually need
+# it.
+#
+# The `.rspec` file also contains a few flags that are not defaults but that
+# users commonly want.
+#
+# See http://rubydoc.info/gems/rspec-core/RSpec/Core/Configuration
+RSpec.configure do |config|
+  # rspec-expectations config goes here. You can use an alternate
+  # assertion/expectation library such as wrong or the stdlib/minitest
+  # assertions if you prefer.
+  config.expect_with :rspec do |expectations|
+    # This option will default to `true` in RSpec 4. It makes the `description`
+    # and `failure_message` of custom matchers include text for helper methods
+    # defined using `chain`, e.g.:
+    #     be_bigger_than(2).and_smaller_than(4).description
+    #     # => "be bigger than 2 and smaller than 4"
+    # ...rather than:
+    #     # => "be bigger than 2"
+    expectations.include_chain_clauses_in_custom_matcher_descriptions = true
+  end
+
+  # rspec-mocks config goes here. You can use an alternate test double
+  # library (such as bogus or mocha) by changing the `mock_with` option here.
+  config.mock_with :rspec do |mocks|
+    # Prevents you from mocking or stubbing a method that does not exist on
+    # a real object. This is generally recommended, and will default to
+    # `true` in RSpec 4.
+    mocks.verify_partial_doubles = true
+  end
+
+# The settings below are suggested to provide a good initial experience
+# with RSpec, but feel free to customize to your heart's content.
+=begin
+  # These two settings work together to allow you to limit a spec run
+  # to individual examples or groups you care about by tagging them with
+  # `:focus` metadata. When nothing is tagged with `:focus`, all examples
+  # get run.
+  config.filter_run :focus
+  config.run_all_when_everything_filtered = true
+
+  # Allows RSpec to persist some state between runs in order to support
+  # the `--only-failures` and `--next-failure` CLI options. We recommend
+  # you configure your source control system to ignore this file.
+  config.example_status_persistence_file_path = "spec/examples.txt"
+
+  # Limits the available syntax to the non-monkey patched syntax that is
+  # recommended. For more details, see:
+  #   - http://myronmars.to/n/dev-blog/2012/06/rspecs-new-expectation-syntax
+  #   - http://www.teaisaweso.me/blog/2013/05/27/rspecs-new-message-expectation-syntax/
+  #   - http://myronmars.to/n/dev-blog/2014/05/notable-changes-in-rspec-3#new__config_option_to_disable_rspeccore_monkey_patching
+  config.disable_monkey_patching!
+
+  # This setting enables warnings. It's recommended, but in some cases may
+  # be too noisy due to issues in dependencies.
+  config.warnings = true
+
+  # Many RSpec users commonly either run the entire suite or an individual
+  # file, and it's useful to allow more verbose output when running an
+  # individual spec file.
+  if config.files_to_run.one?
+    # Use the documentation formatter for detailed output,
+    # unless a formatter has already been configured
+    # (e.g. via a command-line flag).
+    config.default_formatter = 'doc'
+  end
+
+  # Print the 10 slowest examples and example groups at the
+  # end of the spec run, to help surface which specs are running
+  # particularly slow.
+  config.profile_examples = 10
+
+  # Run specs in random order to surface order dependencies. If you find an
+  # order dependency and want to debug it, you can fix the order by providing
+  # the seed, which is printed after each run.
+  #     --seed 1234
+  config.order = :random
+
+  # Seed global randomization in this process using the `--seed` CLI option.
+  # Setting this allows you to use `--seed` to deterministically reproduce
+  # test failures related to randomization by passing the same `--seed` value
+  # as the one that triggered the failure.
+  Kernel.srand config.seed
+=end
+end

metadata

@@ -0,0 +1,102 @@
+--- !ruby/object:Gem::Specification
+name: BinarySearchk
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+platform: ruby
+authors:
+- Kayode Adeniyi
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-08-24 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.7'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.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'
+description: 'This gem employs Breadth-First-Search or Depth-First-Search to search
+  whether an element is in a tree. '
+email:
+- kayode.adeniyi@andela.co
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- BinarySearchk.gemspec
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- lib/BinarySearchk.rb
+- lib/BinarySearchk/BinarySearchk.rb
+- lib/BinarySearchk/version.rb
+- spec/binarysearchk_spec.rb
+- spec/spec_helper.rb
+homepage: ''
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.4.3
+signing_key: 
+specification_version: 4
+summary: This gem builds a tree when an array is supplied and employs either DFS or
+  BFS to search for any child
+test_files:
+- spec/binarysearchk_spec.rb
+- spec/spec_helper.rb