polaris 0.0.1

data/spec/helper.rb

@@ -0,0 +1,4 @@
+here = File.dirname(__FILE__)
+polaris_root = File.expand_path(File.join(here, '..', 'lib'))
+
+$: << polaris_root

data/spec/line_of_site_spec.rb

@@ -0,0 +1,12 @@
+require File.join(File.dirname(__FILE__),'helper')
+require 'line_of_site'
+require 'two_d_grid_map'
+
+describe 'A new LineOfSite' do
+  before do
+    @map = TwoDGridMap.new 10, 20
+    @los = LineOfSite.new @map
+  end
+
+  it 'should be sane'
+end

data/spec/polaris_spec.rb

@@ -0,0 +1,193 @@
+require File.join(File.dirname(__FILE__),'helper')
+require 'polaris'
+require 'two_d_grid_map'
+
+describe 'A new polaris' do
+  before do
+    @map = TwoDGridMap.new 10, 20
+    @pather = Polaris.new @map
+  end
+
+  it 'should return an empty path if destination is not valid' do
+    from = TwoDGridLocation.new @map.w-1, @map.h-1
+    to = TwoDGridLocation.new @map.w, @map.h
+    @pather.guide(from,to).should be_nil
+
+    to = TwoDGridLocation.new(-1, -1)
+    @pather.guide(from,to).should be_nil
+  end
+
+  it 'should return an empty path if start is not valid' do
+    from = TwoDGridLocation.new @map.w, @map.h
+    to = TwoDGridLocation.new @map.w-1, @map.h-1
+    @pather.guide(from,to).should be_nil
+    
+    from = TwoDGridLocation.new -1, -1
+    @pather.guide(from,to).should be_nil
+  end
+  
+  it 'should return the path of "to" for accessible neighbor' do
+    from = TwoDGridLocation.new 0, 0
+    to = TwoDGridLocation.new 1, 0
+    
+    path = @pather.guide(from,to)
+    path.should_not be_nil
+    path.size.should equal(1)
+    
+    path.first.cost_to.should equal(TwoDGridMap::TRAVEL_COST_STRAIGHT)
+    path.first.dist_from.should equal(0)
+    path.first.location.x.should equal(to.x)
+    path.first.location.y.should equal(to.y)
+  end
+  
+  it 'should return the right horizontal path of length 2' do
+    from = TwoDGridLocation.new 0, 0
+    to = TwoDGridLocation.new 2, 0
+    
+    path = @pather.guide(from,to)
+    
+    path.should_not be_nil
+    path.size.should equal(2)
+    
+    path.first.location.x.should equal(1)
+    path.first.location.y.should equal(0)
+    path.last.location.should == to
+  end
+
+  it 'should return the left horizontal path of length 2' do
+    from = TwoDGridLocation.new 2, 0
+    to = TwoDGridLocation.new 0, 0
+    
+    path = @pather.guide(from,to)
+    
+    path.should_not be_nil
+    path.size.should equal(2)
+    
+    path.first.location.x.should equal(1)
+    path.first.location.y.should equal(0)
+    path.last.location.should == to
+  end  
+  
+
+  it 'should return the left up diag path of length 2' do
+    from = TwoDGridLocation.new 2, 2
+    to = TwoDGridLocation.new 0, 0
+    
+    path = @pather.guide(from,to)
+    
+    path.should_not be_nil
+    path.size.should equal(2)
+    
+    path.first.location.x.should equal(1)
+    path.first.location.y.should equal(1)
+    path.last.location.should == to
+  end  
+  
+  it 'should return the right up diag path of length 2' do
+    from = TwoDGridLocation.new 2, 2
+    to = TwoDGridLocation.new 4, 0
+    
+    path = @pather.guide(from,to)
+    
+    path.should_not be_nil
+    path.size.should equal(2)
+    
+    path.first.location.x.should equal(3)
+    path.first.location.y.should equal(1)
+    path.last.location.should == to
+  end
+  
+  it 'should return the right down diag path of length 2' do
+    from = TwoDGridLocation.new 2, 2
+    to = TwoDGridLocation.new 4, 4
+    
+    path = @pather.guide(from,to)
+    
+    path.should_not be_nil
+    path.size.should equal(2)
+    
+    path.first.location.x.should equal(3)
+    path.first.location.y.should equal(3)
+    path.last.location.should == to
+  end   
+  
+  it 'should return the left down diag path of length 2' do
+    from = TwoDGridLocation.new 2, 2
+    to = TwoDGridLocation.new 0, 4
+    
+    path = @pather.guide(from,to)
+    
+    path.should_not be_nil
+    path.size.should equal(2)
+    
+    path.first.location.x.should equal(1)
+    path.first.location.y.should equal(3)
+    path.last.location.should == to
+  end  
+  
+  it 'should return go around an obstacle' do
+    from = TwoDGridLocation.new 0, 0
+    to = TwoDGridLocation.new 2, 0
+    
+    in_the_way = TwoDGridLocation.new 1, 0
+    @map.place in_the_way, "ME"
+    
+    path = @pather.guide(from,to)
+    
+    path.should_not be_nil
+    path.size.should equal(2)
+    
+    path.first.location.x.should equal(1)
+    path.first.location.y.should equal(1)
+    path.last.location.should == to
+  end
+  
+  it 'should return shortest path of horizontal and diag length 5' do
+    from = TwoDGridLocation.new 0, 0
+    to = TwoDGridLocation.new 5, 4
+    
+    path = @pather.guide(from,to)
+    
+    path.should_not be_nil
+    path.size.should equal(5)
+    
+    # make sure that all elements of the path are neighbors
+    prev_el = PathElement.new from, nil
+    path.each do |path_el|
+      @map.neighbors(prev_el.location).include?(path_el.location).should be_true
+      prev_el = path_el
+    end
+    
+    path.last.location.should == to
+  end
+  
+  it 'should return nil when the shortest path is longer than the max step passed in' do
+    from = TwoDGridLocation.new 0, 0
+    to = TwoDGridLocation.new 5, 4
+    
+    path = @pather.guide(from,to,nil,4)
+    path.should == nil
+  end  
+
+  it 'should return nil when the path does not exist for unit type' do
+    from = TwoDGridLocation.new 0, 0
+    to = TwoDGridLocation.new 2, 0
+    
+    path = @pather.guide(from,to,:blocked)
+    path.should == nil
+  end  
+
+  it 'should return nil when the path does not exist' do
+    from = TwoDGridLocation.new 0, 0
+    to = TwoDGridLocation.new 2, 0
+    
+    # put up a wall
+    @map.h.times do |i|
+      @map.place TwoDGridLocation.new(1, i), "ME"
+    end
+    
+    path = @pather.guide(from,to)
+    path.should == nil
+    @pather.nodes_considered.should == @map.h
+  end
+end

metadata

@@ -0,0 +1,99 @@
+--- !ruby/object:Gem::Specification 
+name: polaris
+version: !ruby/object:Gem::Version 
+  prerelease: false
+  segments: 
+  - 0
+  - 0
+  - 1
+  version: 0.0.1
+platform: ruby
+authors: 
+- Shawn Anderson
+autorequire: 
+bindir: bin
+cert_chain: []
+
+date: 2010-02-27 00:00:00 -05:00
+default_executable: 
+dependencies: 
+- !ruby/object:Gem::Dependency 
+  name: rspec
+  prerelease: false
+  requirement: &id001 !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  version_requirements: *id001
+- !ruby/object:Gem::Dependency 
+  name: jeweler
+  prerelease: false
+  requirement: &id002 !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :development
+  version_requirements: *id002
+- !ruby/object:Gem::Dependency 
+  name: algorithms
+  prerelease: false
+  requirement: &id003 !ruby/object:Gem::Requirement 
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        segments: 
+        - 0
+        version: "0"
+  type: :runtime
+  version_requirements: *id003
+description: A* pathfinding in Ruby, using C datastructures to speed things up.
+email: shawn42@gmail.com
+executables: []
+
+extensions: []
+
+extra_rdoc_files: []
+
+files: []
+
+has_rdoc: true
+homepage: http://github.com/shawn42/polaris
+licenses: []
+
+post_install_message: 
+rdoc_options: 
+- --charset=UTF-8
+require_paths: 
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+required_rubygems_version: !ruby/object:Gem::Requirement 
+  requirements: 
+  - - ">="
+    - !ruby/object:Gem::Version 
+      segments: 
+      - 0
+      version: "0"
+requirements: []
+
+rubyforge_project: polaris
+rubygems_version: 1.3.6
+signing_key: 
+specification_version: 3
+summary: A* pathfinding in ruby.
+test_files: 
+- spec/helper.rb
+- spec/line_of_site_spec.rb
+- spec/polaris_spec.rb