bstree 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: be629fde9b9a51b3385a18a0e82d401da42de797
+  data.tar.gz: aad0c3c375cdc02016c6a6058bc7c17a11681607
+SHA512:
+  metadata.gz: 8249258d0547310bb15ae995b5d0d66b6eb616e712891998e97abfb2b20df29bd137ea0c63c97ac493692397b7cbb576dfc489bd6e97e30bc51299b3b374247b
+  data.tar.gz: 9256f8434479e471e329097c5ccf733c536661a0b4259894e8ad1d047b886197e06927aaeaa3a603a2e71102b49008bb2d3b4d20544626f11a40b693b82af8a5

data/.gitignore

@@ -0,0 +1,11 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+/.idea/**/*
+/vendor/**/*

data/.travis.yml

@@ -0,0 +1,4 @@
+language: ruby
+rvm:
+  - 2.3.0
+before_install: gem install bundler -v 1.10.6

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,74 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as
+contributors and maintainers pledge to making participation in our project and
+our community a harassment-free experience for everyone, regardless of age, body
+size, disability, ethnicity, gender identity and expression, level of experience,
+nationality, personal appearance, race, religion, or sexual identity and
+orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment
+include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or
+advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic
+  address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable
+behavior and are expected to take appropriate and fair corrective action in
+response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community. Examples of
+representing a project or community include using an official project e-mail
+address, posting via an official social media account, or acting as an appointed
+representative at an online or offline event. Representation of a project may be
+further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting the project team at james@conant.io. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. The project team is
+obligated to maintain confidentiality with regard to the reporter of an incident.
+Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good
+faith may face temporary or permanent repercussions as determined by other
+members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
+available at [http://contributor-covenant.org/version/1/4][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/4/

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 James Conant
+
+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,77 @@
+# Bstree
+
+Yet another binary search tree implemented in ruby. _Yabstree_, however, just didn't have quite the right ring to it.
+
+While this lib is currently implemented for with integers and floats in mind, any objects that implement comparability `<=>` (and are comparable) should just work.
+
+Check out the wikipedia article on [binary search trees](https://en.wikipedia.org/wiki/Binary_search_tree) to learn more.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'bstree'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install bstree
+
+## Usage
+
+```ruby
+require 'bstree'
+=> true
+
+# create a new tree, with the root value of 5
+tree = Bstree::Node.new(5)
+=> #<Bstree::Node:0x007f6747aeb888 @val=5, @parent=nil, @left=nil, @right=nil>
+
+# insert a new value into the tree
+tree.insert(3)
+=> #<Bstree::Node:0x007f6747a434f8 @val=3, @parent=#<Bstree::Node:0x007f6747a9d7a0 @val=5, @parent=nil, @left=#<Bstree::Node:0x007f6747a434f8 ...>, @right=nil>, @left=nil, @right=nil>
+
+# insert yet another new value into the tree
+tree.insert(8)
+=> #<Bstree::Node:0x007f6747a3d800 @val=8, @parent=#<Bstree::Node:0x007f6747a9d7a0 @val=5, @parent=nil, @left=#<Bstree::Node:0x007f6747a434f8 @val=3, @parent=#<Bstree::Node:0x007f6747a9d7a0 ...>, @left=nil, @right=nil>, @right=#<Bstree::Node:0x007f6747a3d800 ...>>, @left=nil, @right=nil>
+
+# search tree for a value
+tree.search(-2)
+=> nil
+
+# derp -- search tree for an ~existing~ value
+tree.search(3)
+=> #<Bstree::Node:0x007f6747a434f8 @val=3, @parent=#<Bstree::Node:0x007f6747a9d7a0 @val=5, @parent=nil, @left=#<Bstree::Node:0x007f6747a434f8 ...>, @right=#<Bstree::Node:0x007f6747a3d800 @val=8, @parent=#<Bstree::Node:0x007f6747a9d7a0 ...>, @left=nil, @right=nil>>, @left=nil, @right=nil>
+
+# convert tree into an in-order array
+tree.to_in_order_array
+=> [3, 5, 8]
+
+# remove a value from the tree
+tree.remove(3)
+=> true
+
+# gaze smugly at the work of your cruel value removal.
+=> [5, 8]
+```
+
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake test` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/jamesconant/bstree. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](contributor-covenant.org) code of conduct.
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1,10 @@
+require "bundler/gem_tasks"
+require "rake/testtask"
+
+Rake::TestTask.new(:test) do |t|
+  t.libs << "spec"
+  t.libs << "lib"
+  t.test_files = FileList['spec/**/*_spec.rb']
+end
+
+task :default => :test

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "bstree"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start

data/bin/setup

@@ -0,0 +1,7 @@
+#!/bin/bash
+set -euo pipefail
+IFS=$'\n\t'
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/bstree.gemspec

@@ -0,0 +1,25 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'bstree/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "bstree"
+  spec.version       = Bstree::VERSION
+  spec.authors       = ["James Conant"]
+  spec.email         = ["james@conant.io"]
+
+  spec.summary       = "A ruby implementation of a binary search tree"
+  spec.description   = "A ruby implementation of a binary search tree"
+  spec.homepage      = "https://github.com/jamesconant/bstree"
+  spec.license       = "MIT"
+
+  spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.10"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "minitest"
+end

data/lib/bstree.rb

@@ -0,0 +1,5 @@
+require "bstree/version"
+
+module Bstree
+  require 'bstree/node'
+end

data/lib/bstree/node.rb

@@ -0,0 +1,98 @@
+module Bstree
+  class Node
+    attr_accessor :left, :parent, :right, :val
+
+    def initialize(val, parent=nil)
+      @val = val
+      @parent = parent
+      @left = nil
+      @right = nil
+    end
+
+    def insert(new_val)
+      if new_val > val
+        if right
+          right.insert(new_val)
+        else
+          @right = Bstree::Node.new(new_val, self)
+        end
+      elsif new_val < val
+        if left
+          left.insert(new_val)
+        else
+          @left = Bstree::Node.new(new_val, self)
+        end
+      end
+    end
+
+    def search(search_val)
+      if val == search_val
+        self
+      else
+        if search_val > val && right
+          right.search(search_val)
+        elsif search_val < val && left
+          left.search(search_val)
+        end
+      end
+    end
+
+    def remove(rem_val)
+      node = search(rem_val)
+
+      if node
+        if node.left && node.right
+          swap_val = node.right.minimum_val
+          node.right.remove(swap_val)
+          node.val = swap_val
+          true
+
+        elsif node.left
+          node.left.parent = node.parent
+          node.parent.left = node.left
+          true
+
+        elsif node.right
+          node.right.parent = node.parent
+          node.parent.right = node.right
+          true
+
+        else
+          if node.val > node.parent.val
+            node.parent.right = nil
+            true
+          elsif node.val < node.parent.val
+            node.parent.left = nil
+            true
+          end
+        end
+      else
+        false
+      end
+    end
+
+    def to_in_order_array(vals = [])
+      if left
+        left.to_in_order_array(vals)
+      end
+
+      vals << val
+
+      if right
+        right.to_in_order_array(vals)
+      end
+
+      vals
+    end
+
+    protected
+
+    def minimum_val
+      if left
+        left.minimum_val
+      else
+        val
+      end
+    end
+  end
+end

data/lib/bstree/version.rb

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

metadata

@@ -0,0 +1,99 @@
+--- !ruby/object:Gem::Specification
+name: bstree
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- James Conant
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-12-06 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.10'
+- !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: minitest
+  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: A ruby implementation of a binary search tree
+email:
+- james@conant.io
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- bstree.gemspec
+- lib/bstree.rb
+- lib/bstree/node.rb
+- lib/bstree/version.rb
+homepage: https://github.com/jamesconant/bstree
+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.5.1
+signing_key: 
+specification_version: 4
+summary: A ruby implementation of a binary search tree
+test_files: []