binary_decision_tree 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 61ea2ac1f016a28ef9c96ce8e61f08231876764a
+  data.tar.gz: a4bcc60c2d5df5ebdb587708fb659ab357fe3333
+SHA512:
+  metadata.gz: b15ee21a0e80ef48c4864159959f3916f17816c3d9148c6c9fb4c7b815b16d8bc580808846f291d97e600fbbeaf86478437e31565641b8bbcccd28fad9479710
+  data.tar.gz: 2fcec32b0ba97197c44db1446003f3dda074b164c4d68f3a1309f20527de0d25789c29e05bf7abb155217cb275ebc789c33bcfeef442533907a73b3132af6aa2

data/.gitignore

@@ -0,0 +1,17 @@
+*.gem
+*.rbc
+.bundle
+.config
+.yardoc
+Gemfile.lock
+InstalledFiles
+_yardoc
+coverage
+doc/
+lib/bundler/man
+pkg
+rdoc
+spec/reports
+test/tmp
+test/version_tmp
+tmp

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,22 @@
+Copyright (c) 2014 Jason Haruska
+
+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,32 @@
+# BinaryDecisionTree
+
+A binary tree designed to record decisions based on child nodes. This data structure is useful
+in things like single elimination tournaments. They can be marshalled and unmarshalled to two
+numbers.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+    gem 'binary_decision_tree'
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install binary_decision_tree
+
+## Usage
+
+This tree assumes a fix depth and fully populated (dense, not sparse.) It provides some nice
+properties around calulating parent and child node IDs based on the current node ID.
+
+## Contributing
+
+1. Fork it ( http://github.com/haruska/binary_decision_tree/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 new Pull Request

data/Rakefile

@@ -0,0 +1 @@
+require "bundler/gem_tasks"

data/binary_decision_tree.gemspec

@@ -0,0 +1,23 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'binary_decision_tree/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "binary_decision_tree"
+  spec.version       = BinaryDecisionTree::VERSION
+  spec.authors       = ["Jason Haruska"]
+  spec.email         = ["jason@haruska.com"]
+  spec.summary       = %q{A binary decision tree}
+  spec.description   = %q{A binary decision tree useful for brackets of single elimination tournaments.}
+  spec.homepage      = "http://github.com/haruska/binary_decision_tree"
+  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.5"
+  spec.add_development_dependency "rake"
+end

data/lib/binary_decision_tree.rb

@@ -0,0 +1,8 @@
+require "binary_decision_tree/version"
+require "binary_decision_tree/node"
+require "binary_decision_tree/tree"
+require "binary_decision_tree/marshalled_tree"
+
+module BinaryDecisionTree
+  # Your code goes here...
+end

data/lib/binary_decision_tree/marshalled_tree.rb

@@ -0,0 +1,45 @@
+class BinaryDecisionTree::MarshalledTree
+  attr_reader :depth
+  attr_reader :decisions
+  attr_reader :mask
+
+  def initialize(depth, decisions, mask)
+    @depth = depth
+    @decisions = decisions
+    @mask = mask
+  end
+
+  def self.from_tree(tree)
+    depth = tree.depth
+    decisions = 0
+    mask = 0
+
+    (2**tree.depth).times do |i|
+      next if i == 0
+      node = tree.at(i)
+      if !node.decision.nil?
+        mask |= 1 << i
+        decisions |= node.decision << i
+      end
+    end
+
+    new(depth, decisions, mask)
+  end
+
+  def to_tree
+    tree = Tree.new(depth)
+
+    (2**tree.depth).times do |i|
+      next if i == 0
+
+      current_position = 1 << i
+
+      if (mask & current_position) != 0
+        node = tree.at(i)
+        node.decision = (decisions & current_position) == 0 ? 0 : 1
+      end
+    end
+
+    tree
+  end
+end

data/lib/binary_decision_tree/node.rb

@@ -0,0 +1,43 @@
+class BinaryDecisionTree::Node
+  attr_accessor :decision #nil, 0, or 1
+
+  attr_reader :slot #bit position
+  attr_reader :tree
+
+  def initialize(tree, slot, decision: nil)
+    @tree = tree
+    @slot = slot
+    @decision = decision
+  end
+
+  def value
+    case decision
+      when 0
+        left.nil? ? left_position : left.value
+      when 1
+        right.nil? ? right_position : right.value
+      else
+        nil
+    end
+  end
+
+  def leaf?
+    left.nil? && right.nil?
+  end
+
+  def left_position
+    slot * 2
+  end
+
+  def right_position
+    left_position + 1
+  end
+
+  def left
+    tree.at(left_position)
+  end
+
+  def right
+    tree.at(right_position)
+  end
+end

data/lib/binary_decision_tree/tree.rb

@@ -0,0 +1,16 @@
+class BinaryDecisionTree::Tree
+  attr_reader :depth
+
+  def initialize(depth)
+    @depth = depth
+    @nodes = Array.new(2**depth) {|i| i == 0 ? nil : Node.new(self, i)}
+  end
+
+  def root
+    @nodes[1]
+  end
+
+  def at(position)
+    @nodes[position]
+  end
+end

data/lib/binary_decision_tree/version.rb

@@ -0,0 +1,3 @@
+module BinaryDecisionTree
+  VERSION = "0.0.1"
+end

metadata

@@ -0,0 +1,83 @@
+--- !ruby/object:Gem::Specification
+name: binary_decision_tree
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Jason Haruska
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-04-29 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.5'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.5'
+- !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'
+description: A binary decision tree useful for brackets of single elimination tournaments.
+email:
+- jason@haruska.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- binary_decision_tree.gemspec
+- lib/binary_decision_tree.rb
+- lib/binary_decision_tree/marshalled_tree.rb
+- lib/binary_decision_tree/node.rb
+- lib/binary_decision_tree/tree.rb
+- lib/binary_decision_tree/version.rb
+homepage: http://github.com/haruska/binary_decision_tree
+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.0.14
+signing_key: 
+specification_version: 4
+summary: A binary decision tree
+test_files: []