Compare commits

..

3 Commits

Author SHA1 Message Date
a1513be709 Get rvx bundle exec rake release functional... 2026-10-04 23:43:02 -05:00
d0d5bbac3a Bump version 2026-10-04 23:39:37 -05:00
0ae3ecc145 Fix up some errors with BFS and pathfinding grid 2026-10-04 19:30:58 -05:00
6 changed files with 57 additions and 24 deletions

View File

@@ -1,25 +1,37 @@
PATH PATH
remote: . remote: .
specs: specs:
cyberarm_engine (0.24.5) cyberarm_engine (0.30.0)
gosu (~> 1.1) gosu (~> 1.1)
GEM GEM
remote: https://rubygems.org/ remote: https://rubygems.org/
specs: specs:
gosu (1.4.6) ffi (1.17.4-x86_64-linux-gnu)
minitest (5.25.5) ffi (1.17.4-x86_64-linux-musl)
rake (13.2.1) gosu (1.5.0-x86_64-linux)
ffi (~> 1.12)
minitest (5.27.0)
rake (13.4.2)
PLATFORMS PLATFORMS
x64-mingw-ucrt x86_64-linux-gnu
x86_64-linux x86_64-linux-musl
DEPENDENCIES DEPENDENCIES
bundler (~> 2.2) bundler (~> 4)
cyberarm_engine! cyberarm_engine!
minitest (~> 5.0) minitest (~> 5.0)
rake (~> 13.0) rake (~> 13.0)
CHECKSUMS
bundler (4.1.0.beta1) sha256=8a2dac8ca276ff4eff5efc2c6457b0044080fc1e431534ad7c5cc6187232b800
cyberarm_engine (0.30.0)
ffi (1.17.4-x86_64-linux-gnu) sha256=9d3db14c2eae074b382fa9c083fe95aec6e0a1451da249eab096c34002bc752d
ffi (1.17.4-x86_64-linux-musl) sha256=3fdf9888483de005f8ef8d1cf2d3b20d86626af206cbf780f6a6a12439a9c49e
gosu (1.5.0-x86_64-linux)
minitest (5.27.0) sha256=2d3b17f8a36fe7801c1adcffdbc38233b938eb0b4966e97a6739055a45fa77d5
rake (13.4.2) sha256=cb825b2bd5f1f8e91ca37bddb4b9aaf345551b4731da62949be002fa89283701
BUNDLED WITH BUNDLED WITH
2.6.8 4.1.0.beta1

View File

@@ -28,9 +28,8 @@ Gem::Specification.new do |spec|
spec.require_paths = %w[lib assets] spec.require_paths = %w[lib assets]
spec.add_dependency "gosu", "~> 1.1" spec.add_dependency "gosu", "~> 1.1"
# spec.add_dependency "ffi", :platforms => [:mswin, :mingw] # Required by Clipboard on Windows
spec.add_development_dependency "bundler", "~> 2.2" spec.add_development_dependency "bundler", "~> 4"
spec.add_development_dependency "minitest", "~> 5.0" spec.add_development_dependency "minitest", "~> 5.0"
spec.add_development_dependency "rake", "~> 13.0" spec.add_development_dependency "rake", "~> 13.0"
end end

View File

@@ -12,7 +12,7 @@ module CyberarmEngine
@z = z @z = z
@cost = cost @cost = cost
@key = format(KEY_FORMAT, @x, @y, @z) @key = format(KEY_FORMAT, @x, @y, @z).freeze
@edge_nodes = [] @edge_nodes = []
end end
@@ -20,12 +20,10 @@ module CyberarmEngine
def add_edge_node(node) def add_edge_node(node)
index = @edge_nodes.find_index { |n| n.key == node.key } index = @edge_nodes.find_index { |n| n.key == node.key }
if index return if index
@edge_nodes[index] = node
else
@edge_nodes.push(node) @edge_nodes.push(node)
end end
end
def remove_edge_node(node) def remove_edge_node(node)
index = @edge_nodes.find_index { |n| n.key == node.key } index = @edge_nodes.find_index { |n| n.key == node.key }
@@ -34,12 +32,30 @@ module CyberarmEngine
@edge_nodes.delete(index) @edge_nodes.delete(index)
end end
def inspect
format "#<%<class>s:%<id>#018x @key=%<key>s @cost=%<cost>s @edge_nodes=%<edge_nodes>s>",
class: self.class,
id: object_id << 1,
key: key.inspect,
cost: cost.inspect,
edge_nodes: edge_nodes.map { |n| n&.key }
end
end end
def initialize(nodes: {}) def initialize(nodes: {})
@nodes = nodes @nodes = nodes
end end
def node(key)
@nodes[key]
end
def node_at(x, y, z = 0)
key = format(Node::KEY_FORMAT, x, y, z)
@nodes[key]
end
def neighbors(node) def neighbors(node)
node.edge_nodes node.edge_nodes
end end

View File

@@ -1,11 +1,11 @@
module CyberarmEngine module CyberarmEngine
module Pathfinding module Pathfinding
class BreadthFirstSearch < GraphSearch class BreadthFirstSearch < GraphSearch
def search(graph:, start:, goal: nil) def self.search(graph:, start:, goal: nil)
frontier = [] frontier = []
came_from = {} came_from = {}
frontier.put(start) frontier.push(start)
came_from[start.key] = start came_from[start.key] = start
while(current = frontier.shift) while(current = frontier.shift)
@@ -15,7 +15,7 @@ module CyberarmEngine
graph.neighbors(current).each do |neighbor| graph.neighbors(current).each do |neighbor|
next if came_from[neighbor.key] next if came_from[neighbor.key]
frontier.put(neighbor) frontier.push(neighbor)
came_from[neighbor.key] = current came_from[neighbor.key] = current
end end
end end

View File

@@ -1,10 +1,9 @@
module CyberarmEngine module CyberarmEngine
module Pathfinding module Pathfinding
class Grid < Graph class Grid < Graph
def add_node(x:, y:, z: 0, cost: 0, replace: false) def add_node(x:, y:, z: 0, cost: 0, replace: false)
key = format(Node::KEY_FORMAT, x, y, z) key = format(Node::KEY_FORMAT, x, y, z)
node = @node[key] node = @nodes[key]
raise "Node at: #{key} already exists! (#{node})" if node && !replace raise "Node at: #{key} already exists! (#{node})" if node && !replace
@@ -12,6 +11,7 @@ module CyberarmEngine
@nodes[key] = node @nodes[key] = node
update_node_edge_nodes(node) update_node_edge_nodes(node)
node
end end
def remove_node(node) def remove_node(node)
@@ -35,12 +35,18 @@ module CyberarmEngine
front = @nodes[format(Node::KEY_FORMAT, x, y, z - 1)] front = @nodes[format(Node::KEY_FORMAT, x, y, z - 1)]
back = @nodes[format(Node::KEY_FORMAT, x, y, z + 1)] back = @nodes[format(Node::KEY_FORMAT, x, y, z + 1)]
possible_edge_nodes = [left, right, top, bottom, front, back]
if remove_node if remove_node
[left, right, top, bottom, front, back].remove_edge_node(node) possible_edge_nodes.each { |n| n&.remove_edge_node(node) }
else else
[left, right, top, bottom, front, back].add_edge_node(node) possible_edge_nodes.each { |n| n&.add_edge_node(node) }
end end
end end
def update_edge_nodes
@nodes.each { |k, n| update_node_edge_nodes(n) }
end
end end
end end
end end

View File

@@ -1,4 +1,4 @@
module CyberarmEngine module CyberarmEngine
NAME = "InDev".freeze NAME = "InDev".freeze
VERSION = "0.25.1".freeze VERSION = "0.30.0".freeze
end end