gingham 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: f42bcf5cc471a76f91e679bdcc2d499e53af33d3
+  data.tar.gz: 6adc747300171b376782a7ea2cef200ac8bd5052
+SHA512:
+  metadata.gz: 92e86f127788c578e927d55330cf7be3fc0231f2227e98d3fa280655e8eb4abeca8246024acd00220392cf4ac84b5484ddf3f526828261a6daaa3ab8ce58bfc1
+  data.tar.gz: 3606fae484fd25c9621cc3ce5ead90193e48e10914a97d5850550e5cdd481789206026bb12b7cf319072c1ba23d9e5f95195da23baab403ac7551728f088b0a7

data/.gitignore

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

data/.rspec

@@ -0,0 +1,2 @@
+--format documentation
+--color

data/.travis.yml

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

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Cignoir
+
+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,38 @@
+# Gingham
+
+[![Build Status](https://travis-ci.org/cignoir/gingham.svg?branch=master)](https://travis-ci.org/cignoir/gingham)
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'gingham'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install gingham
+
+## Usage
+
+W.I.P
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake rspec` 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/cignoir/gingham. 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,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "gingham"
+
+# 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/gingham.gemspec

@@ -0,0 +1,26 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'gingham/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "gingham"
+  spec.version       = Gingham::VERSION
+  spec.authors       = ["cignoir"]
+  spec.email         = ["cignoir@gmail.com"]
+
+  spec.summary       = %q{Implementation of original pathfinding algorythm based on 3d grids.}
+  spec.description   = %q{R.I.P. StruGarden}
+  spec.homepage      = "https://github.com/cignoir/gingham"
+  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_runtime_dependency "activesupport", '~> 0'
+  spec.add_development_dependency "bundler", '~> 0'
+  spec.add_development_dependency "rake", '~> 0'
+  spec.add_development_dependency "rspec", '~> 0'
+end

data/lib/gingham/actor.rb

@@ -0,0 +1,19 @@
+module Gingham
+  class Actor
+    attr_accessor :waypoint, :weight
+    attr_accessor :move_steps
+    attr_accessor :team_id
+    attr_accessor :move_status
+
+    def initialize(waypoint, weight = 100, team_id = 0)
+      @waypoint = waypoint
+      @weight = weight
+      @team_id = team_id
+      @move_status = Gingham::MoveStatus::DEFAULT
+    end
+
+    def move_end?
+      @move_status == Gingham::MoveStatus::FINISHED || @move_status == Gingham::MoveStatus::STOPPED
+    end
+  end
+end

data/lib/gingham/cell.rb

@@ -0,0 +1,40 @@
+module Gingham
+  class Cell
+    attr_accessor :x, :y, :z, :is_occupied, :is_ground
+
+    def initialize(x = 0, y = 0, z = 0)
+      @x, @y, @z = x.to_i, y.to_i, z.to_i
+      @is_occupied = false
+      @is_ground = false
+    end
+
+    def ==(other)
+      other.is_a?(Gingham::Cell) && @x == other.x && @y == other.y && @z == other.z
+    end
+
+    #FIXME
+    def occupied?
+      @is_occupied
+    end
+
+    def passable?
+      !@is_occupied
+    end
+
+    def sky?
+      !@is_ground
+    end
+
+    def ground?
+      @is_ground
+    end
+
+    def to_s
+      "(#{x},#{y},#{z})"
+    end
+
+    def inspect
+      "(#{x},#{y},#{z})"
+    end
+  end
+end

data/lib/gingham/direction.rb

@@ -0,0 +1,13 @@
+module Gingham
+  module Direction
+    # D1 = 1
+    D2 = 2
+    # D3 = 3
+    D4 = 4
+    # D5 = 5
+    D6 = 6
+    # D7 = 7
+    D8 = 8
+    # D9 = 9
+  end
+end

data/lib/gingham/move_frame.rb

@@ -0,0 +1,11 @@
+module Gingham
+  class MoveFrame
+    attr_accessor :index, :actors
+
+    def initialize(index, actors)
+      @index = index
+      # deep_copy actors
+      @actors = Marshal.load Marshal.dump(actors)
+    end
+  end
+end

data/lib/gingham/move_simulator.rb

@@ -0,0 +1,66 @@
+module Gingham
+  class MoveSimulator
+    class << self
+      def next_step(current_step_index, actors)
+        actors.each do |actor|
+          actor.move_status = Gingham::MoveStatus::FINISHED unless actor.move_steps[current_step_index + 1]
+        end
+
+        grouped = actors.reject{ |actor| actor.move_end? }.group_by{ |actor| actor.move_steps[current_step_index + 1].cell }
+        grouped.each do |goal, group|
+          if actors.map{ |a| a.waypoint.cell }.include? goal
+            # ゴール地点に誰かいる場合
+            # 方向転換の場合、ゴール地点に自分自身がいることになることに注意
+            winner = actors.select{ |a| a.waypoint.cell == goal }.first
+            losers = group.reject{ |actor| actor.object_id == winner.object_id }
+            all_in_goal = [winner, losers].flatten.compact
+          else
+            # ゴール地点に誰もいない場合
+            max_weight = group.map(&:weight).max
+            winner = group.select{ |actor| actor.weight == max_weight }.sample
+            winner.waypoint = winner.move_steps[current_step_index + 1]
+            winner.move_status = Gingham::MoveStatus::DEFAULT
+            losers = group.reject{ |actor| actor.object_id == winner.object_id }
+            all_in_goal = [winner, losers].flatten.compact
+          end
+
+          if all_in_goal.map(&:team_id).uniq.size == 1
+            # 全員同じチームの場合
+            losers.each do |loser|
+              loser.move_status = Gingham::MoveStatus::STAY
+              # 足踏みステップを挿入
+              loser.move_steps = loser.move_steps.insert(current_step_index, loser.move_steps[current_step_index])
+            end
+          else
+            # 敵チームを含んでいる場合
+            winner.move_steps = winner.move_steps[0..(current_step_index + 1)]
+            winner.move_status = Gingham::MoveStatus::STOPPED
+            losers.each do |loser|
+              loser.move_status = Gingham::MoveStatus::STOPPED
+              loser.move_steps = loser.move_steps[0..current_step_index] # 以降のmove_stepsを削除
+            end
+          end
+        end
+        actors
+      end
+
+      def record(actors)
+        all_moved = actors.select(&:move_end?).size == actors.size
+        all_stayed = actors.reject(&:move_end?).map(&:move_status).uniq.first == Gingham::MoveStatus::STAY
+
+        index = 0
+        records = [MoveFrame.new(index, actors)]
+        until all_moved || all_stayed
+          actors = self.next_step(index, actors)
+          index += 1
+          records << MoveFrame.new(index, actors)
+
+          all_moved = actors.select(&:move_end?).size == actors.size
+          all_stayed = actors.reject(&:move_end?).map(&:move_status).uniq.first == Gingham::MoveStatus::STAY
+        end
+
+        records
+      end
+    end
+  end
+end

data/lib/gingham/move_status.rb

@@ -0,0 +1,8 @@
+module Gingham
+  module MoveStatus
+    DEFAULT = 0
+    STAY = 1
+    STOPPED = 2
+    FINISHED = 3
+  end
+end

data/lib/gingham/naterua.rb

@@ -0,0 +1,6 @@
+module Gingham
+  class Naterua
+    attr_accessor :turn
+    attr_accessor :step_index
+  end
+end

data/lib/gingham/path_finder.rb

@@ -0,0 +1,203 @@
+module Gingham
+  class PathFinder
+    class << self
+      def find_move_path(space, from, to, cost_limit = 999)
+        raise ArgumentError unless space && space.is_a?(Gingham::Space)
+        raise ArgumentError unless from && from.is_a?(Gingham::Waypoint) && to && to.is_a?(Gingham::Waypoint)
+
+        open_list = [from]
+        return open_list if from.cell == to.cell
+        close_list = []
+        loop_limit = 0
+
+        while open_list.size > 0 && loop_limit < 1000 do
+          current_wp = open_list.first
+          close_list << current_wp
+          open_list = open_list.drop 1
+
+          adjacent_waypoints = Gingham::PathFinder.find_adjacent_waypoints(space, current_wp)
+          adjacent_waypoints.each do |wp|
+            if wp.sum_cost < cost_limit
+              open_list << wp unless close_list.include? wp
+            end
+          end
+          loop_limit += 1
+        end
+
+        shortest_chains = [from]
+        end_points = close_list.select{ |closed| closed.cell == to.cell }
+
+        unless end_points.size.zero?
+          shortest_cost = 999
+          end_points.each do |end_wp|
+            if end_wp.sum_cost < shortest_cost
+              shortest_cost = end_wp.sum_cost
+              shortest_chains = end_wp.chains
+            end
+          end
+        end
+        shortest_chains
+      end
+
+      def find_skill_path(space, from, to, max_height = 10)
+        path = [from]
+        last_wp = path.last
+        should_move_y = from.direction == Gingham::Direction::D8 || from.direction == Gingham::Direction::D2
+
+        loop_limit = 0
+        while last_wp.cell.x != to.cell.x || last_wp.cell.y != to.cell.y
+          loop_limit += 1
+          break if loop_limit > 30
+
+          if should_move_y && last_wp.cell.y != to.cell.y
+            if last_wp.cell.y < to.cell.y
+              if last_wp.cell.y + 1 != space.depth
+                height = space.height_at(last_wp.cell.x, last_wp.cell.y + 1)
+                cell = space.cells[last_wp.cell.x][last_wp.cell.y + 1][height]
+                break unless cell.passable?
+
+                if last_wp.direction == 8
+                  break if cell.z > max_height
+                  wp = Gingham::Waypoint.new(cell, 8, last_wp)
+                  path << wp
+                  last_wp = wp
+                else
+                  tmp = Gingham::Waypoint.new(last_wp.cell, 8, last_wp)
+                  path << tmp
+                  break if cell.z > max_height
+                  tmp = Gingham::Waypoint.new(cell, 8, tmp)
+                  path << tmp
+                  last_wp = tmp
+                end
+              end
+            elsif last_wp.cell.y > to.cell.y
+              if last_wp.cell.y - 1 >= 0
+                height = space.height_at(last_wp.cell.x, last_wp.cell.y - 1)
+                cell = space.cells[last_wp.cell.x][last_wp.cell.y - 1][height]
+                break unless cell.passable?
+
+                if last_wp.direction == 2
+                  break if cell.z > max_height
+                  wp = Gingham::Waypoint.new(cell, 2, last_wp)
+                  path << wp
+                  last_wp = wp
+                else
+                  tmp = Gingham::Waypoint.new(last_wp.cell, 2, last_wp)
+                  path << tmp
+                  break if cell.z > max_height
+                  tmp = Gingham::Waypoint.new(cell, 2, tmp)
+                  path << tmp
+                  last_wp = tmp
+                end
+              end
+            end
+            should_move_y = false
+            next
+          else
+            should_move_y = false
+          end
+
+          if !should_move_y && last_wp.cell.x != to.cell.x
+            if last_wp.cell.x < to.cell.x
+              if last_wp.cell.x + 1 != space.width
+                height = space.height_at(last_wp.cell.x + 1, last_wp.cell.y)
+                cell = space.cells[last_wp.cell.x + 1][last_wp.cell.y][height]
+                break unless cell.passable?
+
+                if last_wp.direction == 6
+                  break if cell.z > max_height
+                  wp = Gingham::Waypoint.new(cell, 6, last_wp)
+                  path << wp
+                  last_wp = wp
+                else
+                  tmp = Gingham::Waypoint.new(last_wp.cell, 6, last_wp)
+                  path << tmp
+                  break if cell.z > max_height
+                  tmp = Gingham::Waypoint.new(cell, 6, tmp)
+                  path << tmp
+                  last_wp = tmp
+                end
+              end
+            elsif last_wp.cell.x > to.cell.x
+              if last_wp.cell.x - 1 >= 0
+                height = space.height_at(last_wp.cell.x - 1, last_wp.cell.y)
+                cell = space.cells[last_wp.cell.x - 1][last_wp.cell.y][height]
+                break unless cell.passable?
+
+                if last_wp.direction == 4
+                  break if cell.z > max_height
+                  wp = Gingham::Waypoint.new(cell, 4, last_wp)
+                  path << wp
+                  last_wp = wp
+                else
+                  tmp = Gingham::Waypoint.new(last_wp.cell, 4, last_wp)
+                  path << tmp
+                  break if cell.z > max_height
+                  tmp = Gingham::Waypoint.new(cell, 4, tmp)
+                  path << tmp
+                  last_wp = tmp
+                end
+              end
+            end
+            should_move_y = true
+            next
+          else
+            should_move_y = true
+          end
+        end
+
+        path.compact
+      end
+    end
+
+    def self.find_adjacent_waypoints(space, wp)
+      raise unless space && space.is_a?(Gingham::Space)
+      raise unless wp && wp.is_a?(Gingham::Waypoint)
+
+      adjacent_list = []
+      adjacent_cells = Gingham::PathFinder.find_adjacent_cells(space, wp.cell)
+      adjacent_cells.each do |cell|
+        move_direction = Gingham::Waypoint.detect_direction(wp, cell)
+        parent = wp
+        if move_direction != wp.direction
+          turn_wp = Gingham::Waypoint.new(wp.cell, move_direction, wp)
+          parent = turn_wp
+        end
+        move_to = Gingham::Waypoint.new(cell, move_direction, parent)
+        adjacent_list << move_to
+      end
+      adjacent_list
+    end
+
+    def self.find_adjacent_cells(space, cell)
+      raise unless space && space.is_a?(Gingham::Space)
+      raise unless cell && cell.is_a?(Gingham::Cell)
+
+      adjacent_list = []
+      w, d, h = space.width, space.depth, space.height
+      x, y, z = cell.x, cell.y, cell.z
+
+      if x + 1 < w
+        target_cell = space.cells[x + 1][y][z]
+        adjacent_list << target_cell unless target_cell && target_cell.occupied?
+      end
+
+      if x - 1 >= 0
+        target_cell = space.cells[x - 1][y][z]
+        adjacent_list << target_cell unless target_cell && target_cell.occupied?
+      end
+
+      if y + 1 < d
+        target_cell = space.cells[x][y + 1][z]
+        adjacent_list << target_cell unless target_cell && target_cell.occupied?
+      end
+
+      if y - 1 >= 0
+        target_cell = space.cells[x][y - 1][z]
+        adjacent_list << target_cell unless target_cell && target_cell.occupied?
+      end
+
+      adjacent_list
+    end
+  end
+end

data/lib/gingham/position.rb

@@ -0,0 +1,9 @@
+module Gingham
+  class Position
+    attr_accessor :x, :y, :z
+
+    def initialize(x, y, z)
+      @x, @y, @z = x, y, z
+    end
+  end
+end

data/lib/gingham/space.rb

@@ -0,0 +1,75 @@
+module Gingham
+  class Space
+    attr_accessor :width, :height, :depth, :cells
+
+    def initialize(width = 0, depth = 0, height = 0)
+      @width = width
+      @depth = depth
+      @height = height
+      @cells = Array.new(width){ |x| Array.new(depth){ |y| Array.new(height){ |z| Cell.new(x, y, z) } } }
+    end
+
+    # 指定した座標の高さを取得
+    def height_at(x, y)
+      return nil unless @cells[x][y]
+
+      ground_cells = @cells[x][y].select{ |cell| cell.ground? }
+      return 0 if ground_cells.blank?
+
+      z_list = ground_cells.map(&:z)
+      return 0 if z_list.blank?
+
+      [0, z_list.max].max
+    end
+
+    # 指定した座標の地表のセルを取得
+    def ground_at(x, y)
+      z = height_at(x, y)
+      is_illegal = z.nil? || x < 0 || y < 0 || z < 0 || x >= self.width || y >= self.depth || z >= self.height
+      is_illegal ? nil : cells[x][y][z]
+    end
+
+    # 中心セルを基準にtargetのセルを回転した位置のセルを取得
+    def rotate_right(center, target)
+      target ? ground_at(center.x + (target.y - center.y), center.y - (target.x - center.x)) : nil
+    end
+    def rotate_left(center, target)
+      target ? ground_at(center.x - (target.y - center.y), center.y + (target.x - center.x)) : nil
+    end
+    def rotate_reverse(center, target)
+      target ? ground_at(center.x - (target.x - center.x), center.y - (target.y - center.y)) : nil
+    end
+
+    def build_range_cell(waypoint, query)
+      x = waypoint.cell.x
+      y = waypoint.cell.y
+      query.to_s.split('').map(&:to_i).each do |n|
+        case n
+        when 8 then y += 1
+        when 2 then y -= 1
+        when 6 then x += 1
+        when 4 then x -= 1
+        end
+      end
+
+      target = self.ground_at(x, y)
+      result = case waypoint.direction
+      when Gingham::Direction::D2 then rotate_reverse(waypoint.cell, target)
+      when Gingham::Direction::D6 then rotate_right(waypoint.cell, target)
+      when Gingham::Direction::D4 then rotate_left(waypoint.cell, target)
+      else target
+      end
+
+      (result.nil? || result.occupied?) ? nil : result
+    end
+
+    def build_all_range_cells(waypoint, query_list)
+      result = []
+      query_list.each do |query|
+        range_cell = build_range_cell(waypoint, query)
+        result << range_cell unless range_cell.nil?
+      end
+      result.uniq
+    end
+  end
+end

data/lib/gingham/time_line.rb

@@ -0,0 +1,5 @@
+module Gingham
+  class TimeLine
+    attr_accessor :move_records, :action_records
+  end
+end

data/lib/gingham/version.rb

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

data/lib/gingham/waypoint.rb

@@ -0,0 +1,105 @@
+module Gingham
+  class Waypoint
+    attr_accessor :cell, :direction, :parent, :cost, :sum_cost, :chains
+
+    class << self
+      def detect_direction(from, target_cell)
+        raise if from.nil? || from.cell.nil? || from.direction.nil? || target_cell.nil?
+        raise unless from.cell.is_a?(Gingham::Cell) && target_cell.is_a?(Gingham::Cell)
+
+        diff_x = target_cell.x - from.cell.x
+        diff_y = target_cell.y - from.cell.y
+
+        direction = from.direction
+        direction = Gingham::Direction::D6 if diff_x > 0
+        direction = Gingham::Direction::D4 if diff_x < 0
+        direction = Gingham::Direction::D8 if diff_y > 0
+        direction = Gingham::Direction::D2 if diff_y < 0
+        direction
+      end
+    end
+
+    def initialize(cell = Cell.new, direction = Gingham::Direction::D8, parent = nil)
+      @cell = cell
+      @direction = direction
+      @parent = parent
+
+      update
+    end
+
+    def calc_cost
+      return 0 unless @parent
+
+      is_same_cell = @parent.cell == @cell
+      turn_cost = case @parent.direction
+        when Gingham::Direction::D8
+          case @direction
+          when Gingham::Direction::D8 then is_same_cell ? 5 : 0
+          when Gingham::Direction::D2 then 10
+          else 5
+          end
+        when Gingham::Direction::D2
+          case @direction
+          when Gingham::Direction::D2 then is_same_cell ? 5 : 0
+          when Gingham::Direction::D8 then 10
+          else 5
+          end
+        when Gingham::Direction::D6
+          case @direction
+          when Gingham::Direction::D6 then is_same_cell ? 5 : 0
+          when Gingham::Direction::D4 then 10
+          else 5
+          end
+        when Gingham::Direction::D4
+          case @direction
+          when Gingham::Direction::D4 then is_same_cell ? 5 : 0
+          when Gingham::Direction::D6 then 10
+          else 5
+          end
+        else 0
+        end
+      is_same_cell ? turn_cost : 10 + turn_cost
+    end
+
+    def pick_parents
+      result = []
+      result << @parent.chains if @parent
+      result << self
+      result.flatten.compact
+    end
+
+    def update
+      if @parent.nil?
+        @cost, @sum_cost = 0, 0
+        @chains = [self]
+      else
+        @cost = calc_cost
+        @chains = pick_parents
+        @sum_cost = @chains.map(&:cost).inject(:+)
+      end
+      self
+    end
+
+    def turning?
+      @parent ? @parent.cell == @cell : false
+    end
+
+    def moving?
+      @parent ? @parent.cell != @cell : false
+    end
+
+    def ==(other)
+      other.is_a?(Gingham::Waypoint) && @cell == other.cell && @direction == other.direction# && @cost == other.cost && @sum_cost == other.sum_cost
+    end
+
+    def to_s
+      base = "#{@cell}/#{@direction}" + ":#{@cost}/#{@sum_cost}"
+      @parent ? "#{@parent.cell}/#{@parent.direction}->" + base : base
+    end
+
+    def inspect
+      base = "#{@cell}/#{@direction}" + ":#{@cost}/#{@sum_cost}"
+      @parent ? "#{@parent.cell}/#{@parent.direction}->" + base : base
+    end
+  end
+end

data/lib/gingham.rb

@@ -0,0 +1,26 @@
+require 'active_support/dependencies'
+
+module Gingham
+  # Utility
+  autoload :VERSION, 'gingham/version'
+  autoload :PathFinder, 'gingham/path_finder'
+  autoload :MoveSimulator, 'gingham/move_simulator'
+  autoload :ActionSimulator, 'gingham/action_simulator'
+  autoload :MoveStatus, 'gingham/move_status'
+
+  # World
+  autoload :Naterua, 'gingham/naterua' # GameMaster
+  autoload :Space, 'gingham/space'
+  autoload :Cell, 'gingham/cell'
+  autoload :Position, 'gingham/position'
+  autoload :Direction, 'gingham/direction'
+  autoload :Waypoint, 'gingham/waypoint'
+
+  # Objects
+  autoload :Actor, 'gingham/actor'
+
+  # Timeline
+  autoload :TimeLine, 'gingham/time_line'
+  autoload :MoveFrame, 'gingham/move_frame'
+  autoload :ActionFrame, 'gingham/action_frame'
+end

metadata

@@ -0,0 +1,124 @@
+--- !ruby/object:Gem::Specification
+name: gingham
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- cignoir
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-04-14 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: activesupport
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  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'
+- !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'
+- !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: R.I.P. StruGarden
+email:
+- cignoir@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- gingham.gemspec
+- lib/gingham.rb
+- lib/gingham/actor.rb
+- lib/gingham/cell.rb
+- lib/gingham/direction.rb
+- lib/gingham/move_frame.rb
+- lib/gingham/move_simulator.rb
+- lib/gingham/move_status.rb
+- lib/gingham/naterua.rb
+- lib/gingham/path_finder.rb
+- lib/gingham/position.rb
+- lib/gingham/space.rb
+- lib/gingham/time_line.rb
+- lib/gingham/version.rb
+- lib/gingham/waypoint.rb
+homepage: https://github.com/cignoir/gingham
+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: Implementation of original pathfinding algorythm based on 3d grids.
+test_files: []