gastar 1.0.1 → 1.0.2

checksums.yaml

@@ -1,15 +1,15 @@
 ---
 !binary "U0hBMQ==":
   metadata.gz: !binary |-
-    MDJkOTcxNGZiMDYxZmJjYTI3MmYyZWZjZmEwMTNmZmFjZGZlNGE3OA==
+    YjVmNGZmMWU5OTA0NWJjZmJjNzRhZmZjNjcwMjdlOTM0ZTE5NmJiYQ==
   data.tar.gz: !binary |-
-    MzA4Mjc5MGQyM2I3ZDUxOWE5NTBmNjliNzBkNGRiZDA4NDhiNjZiNw==
-!binary "U0hBNTEy":
+    YWZhODVlMjIwYmFiNTQxOGE2ZWE5ODM1MzBjYWMyYWE5ZDY2NTA0Nw==
+SHA512:
   metadata.gz: !binary |-
-    ZTkyMzQ5NTdlYjQwZTNjYzhlMTQwMjQ4MjBkZGNhNDVlODJkZWZkZDFhMjYy
-    YjVmY2Y3YWJhNjQ0MDFlNWQ4OWY1ODBmNmQ1MDM1N2EwMDI1OTg5NTI2ZTBl
-    YTIyODI3ZTNlZDBmODZhMzczYjJlNzQ0MzMzNTk4NTIxMjE3NWY=
+    YTg0ZDkwZmYyMzMzOTgwMGI3NjFiZWZkNzlmMTcxMmNkM2VmMmQ4ZGFiYjcz
+    YjYyMDM4MDRjMmMwMGEzOWFkOGZiMjlkYzdhZTM2ZjhlMmI3MmIwMjkxYzlj
+    M2ZkMmYzNjI5ZmE2MzQ0YzJhZTkzZjgyZDE5MTg0ODhkNzVkMTA=
   data.tar.gz: !binary |-
-    Y2NkNDMzMjc4OTJkYTkzNzU1YjAyNjJjYmNjNDdlNGJjMzcwMjUzOTc4ZTE2
-    ZDc5YWUxYjBmM2MxNGFmNzM2YTRlYzRhYzhkNDdkYWYxNWE0MGZjNjI1ZDI0
-    ZWJiZjY0ZmNjNjEzMzdmZWE3YWQyODJiOGQ1NDk3MmZlZGQ3NWQ=
+    M2Q5YmMzNzgxNzRkZWUwZmNkN2E5ZWQ5NGUyN2Y1OGJjNWMyYmI4NzEwMzFk
+    ZjIwY2JlN2UyZjQzYTc1YjQwZTJmOWZjNDNmYTQyZDk0Yzk1NzM5YTBlMGQ2
+    OTM4MmE1YzlhNWVjNWQ3OGIwOTVjN2I4MTQzZmE3NWNkY2MzZWQ=

data/example/example_runner.rb

@@ -1,79 +1,79 @@
-require_relative "../lib/gastar"
-
-##########################################################
-# Example implementations
-##########################################################
-
-class AStarGrid < AStar
-  def heuristic(node, start, goal)
-    Math.sqrt((goal.x - node.x)**2 + (goal.y - node.y)**2)
-  end
-end
-
-class AStarGridNode < AStarNode
-  attr_reader :x, :y
-  def initialize(x, y)
-    super()
-    @x, @y = x, y
-  end
-  def move_cost(other)
-    diagonal = (self.x - other.x).abs == 1 and (self.y - other.y).abs == 1
-    diagonal ? 14 : 10
-  end
-  def to_s
-    "(%d,%d)" % [x,y]
-  end
-end
-
-##########################################################
-# Example graph generator and use of the search algoritm
-##########################################################
-
-def make_graph(width, height)
-  nodes = width.times.map{|x| height.times.map{|y| AStarGridNode.new(x, y) } }
-  graph = {}
-  width.times.to_a.product(height.times.to_a).each do |x, y|
-    node = nodes[x][y]
-    graph[node] = []
-    [-1, 0, 1].product([-1, 0, 1]).each do |i, j|
-      next unless 0 <= x + i && x + i < width
-      next unless 0 <= y + j && y + j < height
-      graph[nodes[x][y]] << nodes[x+i][y+j]
-    end
-  end
-  [graph, nodes]
-end
-
-def render(width,height,start, goal, path)
-  vertices = path.map{|step| [step.x, step.y] }
-  height.times.each do |y|
-    width.times.each do |x|
-      if [start.x, start.y] == [x,y]
-        print "S"
-      elsif [goal.x, goal.y] == [x,y]
-        print "G"
-      elsif vertices.include?([x,y])
-        print "+"
-      else
-        print "."
-      end
-    end
-    puts
-  end
-end
-
-def main
-  width, height = 16,10
-  graph, nodes = make_graph(width, height)
-  paths = AStarGrid.new(graph)
-  start, goal = nodes[1][2], nodes[ 12][7]
-  path = paths.search(start, goal)
-  unless path
-    puts "No path found"
-  else
-    puts "Path found:", path.join(" ")
-    render(width,height,start, goal, path)
-  end
-end
-
-main if __FILE__ == $0  
+require_relative "../lib/gastar"
+
+##########################################################
+# Example implementations
+##########################################################
+
+class AStarGrid < AStar
+  def heuristic(node, start, goal)
+    Math.sqrt((goal.x - node.x)**2 + (goal.y - node.y)**2)
+  end
+end
+
+class AStarGridNode < AStarNode
+  attr_reader :x, :y
+  def initialize(x, y)
+    super()
+    @x, @y = x, y
+  end
+  def move_cost(other)
+    diagonal = (self.x - other.x).abs == 1 and (self.y - other.y).abs == 1
+    diagonal ? 14 : 10
+  end
+  def to_s
+    "(%d,%d)" % [x,y]
+  end
+end
+
+##########################################################
+# Example graph generator and use of the search algoritm
+##########################################################
+
+def make_graph(width, height)
+  nodes = width.times.map{|x| height.times.map{|y| AStarGridNode.new(x, y) } }
+  graph = {}
+  width.times.to_a.product(height.times.to_a).each do |x, y|
+    node = nodes[x][y]
+    graph[node] = []
+    [-1, 0, 1].product([-1, 0, 1]).each do |i, j|
+      next unless 0 <= x + i && x + i < width
+      next unless 0 <= y + j && y + j < height
+      graph[nodes[x][y]] << nodes[x+i][y+j]
+    end
+  end
+  [graph, nodes]
+end
+
+def render(width,height,start, goal, path)
+  vertices = path.map{|step| [step.x, step.y] }
+  height.times.each do |y|
+    width.times.each do |x|
+      if [start.x, start.y] == [x,y]
+        print "S"
+      elsif [goal.x, goal.y] == [x,y]
+        print "G"
+      elsif vertices.include?([x,y])
+        print "+"
+      else
+        print "."
+      end
+    end
+    puts
+  end
+end
+
+def main
+  width, height = 16,10
+  graph, nodes = make_graph(width, height)
+  paths = AStarGrid.new(graph)
+  start, goal = nodes[1][2], nodes[ 12][7]
+  path = paths.search(start, goal)
+  unless path
+    puts "No path found"
+  else
+    puts "Path found:", path.join(" ")
+    render(width,height,start, goal, path)
+  end
+end
+
+main if __FILE__ == $0  

data/lib/gastar/version.rb

@@ -1,3 +1,3 @@
-module Gastar
-  VERSION = "1.0.1"
-end
+module Gastar
+  VERSION = "1.0.2"
+end

data/spec/gastar_spec.rb

@@ -1,67 +1,66 @@
-require_relative '../lib/gastar'
-
-class Node < AStarNode
-  attr_reader :name, :x, :y
-  def initialize(name, x, y)
-    super()
-    @name, @x, @y = name, x, y
-  end
-  def move_cost(other) 1 end
-  def to_s() name end
-end
-
-class Space < AStar
-  def heuristic(node, start, goal)
-    Math.sqrt( (goal.x - node.x)**2 + (goal.y - node.y)**2 )
-  end
-end
-
-describe "AStar implementation" do
-
-  it "finds the shorted path between cities" do
-
-    sun = Node.new "Sundsvall",  9, 10
-    upp = Node.new "Uppsala",    9,  6
-    sth = Node.new "Stockholm", 10,  5
-    jon = Node.new "Jonkoping",  4,  3
-    got = Node.new "Gothenburg", 1,  3
-    mal = Node.new "Malmo",      2,  1
-
-    cities = {
-      sun => [upp],
-      sth => [sun,jon,upp],
-      jon => [sth,got,mal],
-      upp => [sth,sun],
-      mal => [jon],
-      got => [jon]
-    }
-
-    expected = [sun, upp, sth, jon, mal]
-    actual   = Space.new(cities).search(sun, mal)
-
-    actual.should eql(expected)
-
-  end
-
-  it "finds the longest path between cities" do
-
-    a = Node.new "C1",  1, 1
-    b = Node.new "C2",  2, 2
-    c = Node.new "C3",  1, 3
-    d = Node.new "C4",  1, 4
-
-
-    cities = {
-      a => [b,c],
-      b => [c],
-      c => [d],
-      d => [c],
-    }
-
-    Space.new(cities, false).search(a, d).should eql([a,c,d])
-    Space.new(cities, true).search(a, d).should eql([a,b,c,d])
-
-  end
-
-end
-  
+require_relative '../lib/gastar'
+
+class Node < AStarNode
+  attr_reader :name, :x, :y
+  def initialize(name, x, y)
+    super()
+    @name, @x, @y = name, x, y
+  end
+  def move_cost(other) 1 end
+  def to_s() name end
+end
+
+class Space < AStar
+  def heuristic(node, start, goal)
+    Math.sqrt( (goal.x - node.x)**2 + (goal.y - node.y)**2 )
+  end
+end
+
+describe "AStar implementation" do
+
+  it "finds the shorted path between cities" do
+
+    sun = Node.new "Sundsvall",  9, 10
+    upp = Node.new "Uppsala",    9,  6
+    sth = Node.new "Stockholm", 10,  5
+    jon = Node.new "Jonkoping",  4,  3
+    got = Node.new "Gothenburg", 1,  3
+    mal = Node.new "Malmo",      2,  1
+
+    cities = {
+      sun => [upp],
+      sth => [sun,jon,upp],
+      jon => [sth,got,mal],
+      upp => [sth,sun],
+      mal => [jon],
+      got => [jon]
+    }
+
+    expected = [sun, upp, sth, jon, mal]
+    actual   = Space.new(cities).search(sun, mal)
+
+    expect(actual).to eql(expected)
+
+  end
+
+  it "finds the longest path between cities" do
+
+    a = Node.new "C1",  1, 1
+    b = Node.new "C2",  2, 2
+    c = Node.new "C3",  1, 3
+    d = Node.new "C4",  1, 4
+
+
+    cities = {
+      a => [b,c],
+      b => [c],
+      c => [d],
+      d => [c],
+    }
+
+    expect( Space.new(cities, false).search(a, d) ).to eql([a,c,d])
+    expect( Space.new(cities, true ).search(a, d) ).to eql([a,b,c,d])
+
+  end
+
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: gastar
 version: !ruby/object:Gem::Version
-  version: 1.0.1
+  version: 1.0.2
 platform: ruby
 authors:
 - Jonas Tingeborn
@@ -45,17 +45,28 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- .gitignore
-- .rspec
-- Gemfile
-- LICENSE.txt
-- README.md
-- Rakefile
-- example/example_runner.rb
-- gastar.gemspec
-- lib/gastar.rb
-- lib/gastar/version.rb
-- spec/gastar_spec.rb
+- !binary |-
+  LmdpdGlnbm9yZQ==
+- !binary |-
+  LnJzcGVj
+- !binary |-
+  R2VtZmlsZQ==
+- !binary |-
+  TElDRU5TRS50eHQ=
+- !binary |-
+  UkVBRE1FLm1k
+- !binary |-
+  UmFrZWZpbGU=
+- !binary |-
+  ZXhhbXBsZS9leGFtcGxlX3J1bm5lci5yYg==
+- !binary |-
+  Z2FzdGFyLmdlbXNwZWM=
+- !binary |-
+  bGliL2dhc3Rhci5yYg==
+- !binary |-
+  bGliL2dhc3Rhci92ZXJzaW9uLnJi
+- !binary |-
+  c3BlYy9nYXN0YXJfc3BlYy5yYg==
 homepage: https://github.com/jojje/gastar
 licenses:
 - MIT
@@ -76,10 +87,10 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.0.6
+rubygems_version: 2.2.2
 signing_key: 
 specification_version: 4
 summary: A generic A* implementation
 test_files:
-- spec/gastar_spec.rb
-has_rdoc: 
+- !binary |-
+  c3BlYy9nYXN0YXJfc3BlYy5yYg==