tiny_fill 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 44282db4bd5db3aaf1eb05ae7542b3f370c3eb66fbd4cd5b6a4d434b10c1cb53
+  data.tar.gz: 46b4933fc5872d7d1522a5bebe4bbc93fb3464ada38f4ac393714e09f008ed75
+SHA512:
+  metadata.gz: 7e43f65e6b020ea212853dd5bceee05093dafcefd549c6fa35ce5f4ebb18bcd8180d672f7b13140b6da59b3407faf65dd952a31b3fd3520a5eaf06e7ba08d4f2
+  data.tar.gz: 651d493412514612ab858485e857f5fecd78a5f79df961b33c8dc1cc35d5de7bfa9674d4039df6a7bfbe65b57905664b521b68f8d0b7942ab6d7b37ceab10503

data/lib/tiny_fill.rb

@@ -0,0 +1,46 @@
+module TinyFill
+  def self.fill(map:, start_x:, start_y:, max_search:)
+    wid = map.first.length
+    hgt = map.length
+    return nil unless start_x >= 0
+    return nil unless start_y >= 0
+    return nil unless start_x < wid
+    return nil unless start_y < hgt
+    return nil if max_search <= 0
+
+    return nil if map[start_y][start_x]   # starting point is already on a border
+    search_queue = [[start_x, start_y]]
+    map[start_y][start_x] = true
+    cells_checked = 1
+
+    loop do
+      break nil if cells_checked > max_search
+      break map if search_queue.length == 0
+
+      cx, cy = search_queue.shift
+
+      [
+        [cx    , cy - 1],
+        [cx + 1, cy - 1],
+        [cx + 1, cy    ],
+        [cx + 1, cy + 1],
+        [cx    , cy + 1],
+        [cx - 1, cy + 1],
+        [cx - 1, cy    ],
+        [cx - 1, cy - 1],
+      ].each do |next_cell|
+        nx, ny = next_cell
+
+        next if nx < 0
+        next if ny < 0
+        next if nx >= wid
+        next if ny >= hgt
+        next if map[ny][nx]
+
+        map[ny][nx] = true
+        cells_checked += 1
+        search_queue << [nx, ny]
+      end
+    end
+  end
+end

metadata

@@ -0,0 +1,40 @@
+--- !ruby/object:Gem::Specification
+name: tiny_fill
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- Jeff Lunt
+bindir: bin
+cert_chain: []
+date: 1980-01-02 00:00:00.000000000 Z
+dependencies: []
+description: flood fill algo for detecting enclosed areas on a 2d array
+email: jefflunt@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/tiny_fill.rb
+homepage: https://github.com/jefflunt/tiny_fill
+licenses:
+- MIT
+metadata: {}
+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: []
+rubygems_version: 3.6.9
+specification_version: 4
+summary: flood fill algo for detecting enclosed areas on a 2d array
+test_files: []