cem 0.1.3 → 0.1.7

data/lib/cem/cruzzles.rb

@@ -7,10 +7,18 @@
 # - Some Numeric hackery
 #
 
-def min(a, b)
-  return a <= b ? a : b
+module Cem
+  def self.min(a, b)
+    return a <= b ? a : b
+  end
+
+  def self.max(a, b)
+    return a >= b ? a : b
+  end
 end
 
+extend Cem
+
 class Numeric
   # Make all methods in Math module available as methods for numeric (e.g. 3.sqrt instead of Math.sqrt(3))
   Math.methods(false).each do |method|
@@ -37,6 +45,14 @@ Point2D = Struct.new("Point2D", :x, :y) {
     end
   end
   
+  def -(other)
+    if other.is_a? Array
+      other.map { |o| self - o }
+    else
+      Point2D.new(x - other.x, y - other.y)
+    end
+  end
+  
   # Scalar multiplication
   def *(other)
     Point2D.new(x * other, y * other)    
@@ -51,6 +67,10 @@ Point2D = Struct.new("Point2D", :x, :y) {
     return ((x - other.x) ** 2 + (y - other.y) ** 2).sqrt
   end
   
+  def area
+    return x * y
+  end
+  
   def self.from_s(s)
   
     case s.upcase
@@ -67,30 +87,98 @@ Point2D = Struct.new("Point2D", :x, :y) {
     end
     
   end
+
+  # Returns the component-wise minimum as a new Point2D
+  #
+  #   Point2D.new(5,2).min(Point2D.new(1,3)) == Point2D.new(1,2) -> true
+  #
+  def min(other)
+    return self if !other
+    
+    if other.is_a? Array
+      other.reduce(self) { |min, o| min.min(o) }
+    else
+      Point2D.new(Cem.min(x, other.x), Cem.min(y, other.y))
+    end
+  end
+  
+  # Returns the component-wise maximum as a new Point2D
+  #
+  #   Point2D.new(5,2).min(Point2D.new(1,3)) == Point2D.new(5,3) -> true
+  #
+  def max(other)
+    return self if !other
+
+    if other.is_a? Array
+      other.reduce(self) { |max, o| max.max(o) }
+    else
+      Point2D.new(Cem.max(x, other.x), Cem.max(y, other.y))
+    end
+  end
+
+  # Returns the minimum and maximum coordinates of this and the given point/point array.  
+  def minmax(other)
+    [self.min(other), self.max(other)]
+  end
+  
+  # Returns the minimum and maximum coordinates of the point array. 
+  def self.minmax(array)
+    return [nil, nil] if !array || array.size == 0
+    
+    [array.reduce { |min, o| min.min(o) }, array.reduce { |max, o| max.max(o) } ]
+  end
+  
+  def add!(other)
+    self.x += other.x
+    self.y += other.y
+    return self
+  end
   
   def left 
-    return self + Dir2D.LEFT
+    self + Dir2D::LEFT
   end
   
   def left!
-    x += Dir2D.LEFT.x
-    y += Dir2D.LEFT.y
-    return self
+    add!(Dir2D::LEFT)
   end
 
+  def right 
+    self + Dir2D::RIGHT
+  end
   
+  def right!
+    add!(Dir2D::RIGHT)
+  end
+  
+  def up
+    self + Dir2D::UP
+  end
+  
+  def up!
+    add!(Dir2D::UP)
+  end
+  
+  def down
+    self + Dir2D::DOWN
+  end
+  
+  def down!
+    add!(Dir2D::DOWN)
+  end
+    
   def to_dir_bitmask 
   
-    if x == 0 && y == -1
+    case self
+    when Dir2D::N
       return 1
-    elsif x == 1 && y == 0
+    when Dir2D::E
       return 2
-    elsif x == 0 && y == 1
+    when Dir2D::S
       return 4
-    elsif x == -1 && y == 0
+    when Dir2D::W
       return 8
     else
-      raise self.p
+      raise "Only Dir2Ds can be converted to direction bitmask: #{self.inspect}"
     end
   end
       
@@ -98,25 +186,26 @@ Point2D = Struct.new("Point2D", :x, :y) {
   
     result = []
     if v & 1 > 0
-      result << Point2D.new(0, -1)
+      result << Dir2D::N
     end
     if v & 2 > 0
-      result << Point2D.new(1, 0)
+      result << Dir2D::E
     end
     if v & 4 > 0
-      result << Point2D.new(0, 1)
+      result << Dir2D::S
     end
     if v & 8 > 0
-      result << Point2D.new(-1, 0)
+      result << Dir2D::W
     end
     return result
   end
   
-  # def <=>(other)
-  #   y == other.y ? x <=> other.x : y <=> other.y
-  # end
+  def <=>(other)
+    y == other.y ? x <=> other.x : y <=> other.y
+  end
   
   def ==(other)
+    return false if !other.respond_to?(:x) || !other.respond_to?(:y)
     y == other.y && x == other.x
   end
 }
@@ -144,14 +233,14 @@ Seg2D = Struct.new("Seg2D", :p1, :p2) {
   
 }
 
-Dirs2D = [Point2D.new(0, -1), Point2D.new(1, 0), Point2D.new(0, 1), Point2D.new(-1, 0)]
-
 class Dir2D < Point2D
 
-  N = UP    = Dir2D.new( 0, -1)
-  E = RIGHT = Dir2D.new( 1,  0)
-  S = DOWN  = Dir2D.new( 0,  1)
-  W = LEFT  = Dir2D.new(-1,  0)
+  N = UP    = Dir2D.new( 0, -1).freeze
+  E = RIGHT = Dir2D.new( 1,  0).freeze
+  S = DOWN  = Dir2D.new( 0,  1).freeze
+  W = LEFT  = Dir2D.new(-1,  0).freeze
+  
+  All = [N, E, S, W]
   
   #
   # Dir2D * Range = array of Dir2D
@@ -176,13 +265,13 @@ class Dir2D < Point2D
   def self.x(length=1)
     return vert(length) + hori(length)
   end
-
 end
-  
+
+Dirs2D = Dir2D::All
 
 class Grid
 
-  attr_reader :data
+  attr_accessor :data
 
   def initialize(x, y, default=0, &block)
     
@@ -223,7 +312,7 @@ class Grid
       # @data = [[default] * x] * y
     end
   end
-  
+
   def initialize_copy(orig)
     super
     
@@ -231,6 +320,43 @@ class Grid
     # Do custom initialization for self
   end
   
+  #
+  # Given a list of Point2D, will create a Grid that contains all points.
+  #
+  # By default the grid will be recentered using the 'bottomleft'-most point.
+  # Set :bounding_box to false to get coordinates transferred as is.
+  #
+  # By default all cells for which points are found are marked with an 'x'. 
+  # Set :char to another character or supply a block which receives the point and should return the character to use.
+  #
+  # By default the empty cells are filled with spaces. Set :empty to something else to change this.
+  #  
+  def self.from_points(point_array, bounding_box=true, char='x', empty=' ', &block)
+    
+    min, max = Point2D.minmax(point_array)
+    if !bounding_box
+      min = Point2D.new(0,0)
+    end
+    
+    result = Grid.new(max.x - min.x + 1, max.y - min.y + 1, empty)
+    
+    point_array.each { |p|
+      result[p-min] = if block
+        block.call(p)
+      else
+        char
+      end
+    }
+    
+    return result
+  end
+  
+  # Mixin all methods which make sense:
+  #  - Searching if all/any/none/one value matches something
+  append_from(Enumerable, :any?, :all?, :include?, :member?, :none?, :one?, :tally, :count)
+  
+  
+  # Finds the top-left (min), bottom-right (max) coordinates of this Grid using the given value 'null' as an indicator for an empty field.
   def minmax(null=nil)
     min = nil
     max = nil
@@ -282,10 +408,11 @@ class Grid
     return @data[y][x] = assign
   end
   
-  def to_a
+  # Returns the underlying 2D array as a flattened array
+  def flatten
     return @data.flatten
-  end  
-  
+  end
+    
   #
   # Returns the Point2Ds in the directions NSEW as an array (no diagonals, see adja_index for this)
   #
@@ -345,7 +472,7 @@ class Grid
         result << Point2D.new(x-1,y-1)
       end
       result << Point2D.new(x-1,y)
-      if y + 1 < @data.size - 1
+      if y + 1 < @data.size
         result << Point2D.new(x-1, y+1)
       end
     end
@@ -355,15 +482,15 @@ class Grid
     
     # result << Point2D.new(x,y)
     
-    if y + 1 < @data.size - 1
+    if y + 1 < @data.size
       result << Point2D.new(x, y+1)
     end
-    if x + 1 < @data[0].size - 1
+    if x + 1 < @data[0].size
       if y > 0
         result << Point2D.new(x+1,y-1)
       end
       result << Point2D.new(x+1,y)
-      if y + 1 < @data.size - 1
+      if y + 1 < @data.size
         result << Point2D.new(x+1, y+1)
       end
     end
@@ -373,15 +500,14 @@ class Grid
   def to_s
     printBoard()
   end
-  
-  
-  #
+    
   # returns a copy of the underlying 2D array, with linking to the content (rather than dup the content also)
-  #
   def to_a
     @data.map { |row| row.dup }
   end
   
+  # Returns access to the underlying 2D array. 
+  # Caution: This is not a duplicate. Use to_a for this.
   def data
     @data
   end
@@ -391,24 +517,30 @@ class Grid
   #
   # If block has...
   #  - one parameter, passes the cell value
-  #  - two parameters, passes y and x
+  #  - two parameters, passes the coordinates as a Point2D and the cell value
   #  - three parameteres, passes y, x and the cell value
   #
+  # If the block returns nil, the original value is kept.
+  #
   def map_a(&block)
   
     case block.arity
       when 1 
-        @data.map { |row| row.map { |value| block.call(value) } }
+        @data.map { |row| row.map { |value| block.call(value) || value } }
       when 2 
-        @data.each_with_index.map { |row, y| row.each_index.map { |x| block.call(y,x) } }
+        @data.each_with_index.map { |row, y| row.each_with_index.map { |value, x| block.call(Point2D.new(x, y), value) || value } }
       when 3      
-        @data.each_with_index.map { |row, y| row.each_with_index.map { |cell, x| block.call(y,x,cell) } }
+        @data.each_with_index.map { |row, y| row.each_with_index.map { |value, x| block.call(y, x, value) || value} }
       else
         raise
     end
   
   end
   
+  def map_a!(&block)
+    @data = map_a(&block)
+  end
+  
   def each(&block)
     @data.each { |row|
       row.each { |cell|
@@ -451,10 +583,12 @@ class Grid
     @data.each_with_index { |l, y|
       l.each_with_index { |c, x|
        
-        pos = Point2D.new(x,y)
-        
-        if overlay && overlay.has_key?(pos)
-          result += overlay[pos] 
+        if overlay 
+          pos = Point2D.new(x,y)
+          if overlay.has_key?(pos)
+            result += overlay[pos]
+          end
+          next
         else
           result += c.to_s
         end
@@ -510,7 +644,21 @@ Point3D = Struct.new("Point3D", :x, :y, :z) {
     end
   end 
 }
-    
-    
 
-    
+Point4D = Struct.new("Point4D", :x, :y, :z, :w) {
+
+  def manhattan(other=nil)
+    if other != nil
+      return (self - other).manhattan
+    end
+    return x.abs + y.abs + z.abs + w.abs
+  end
+  
+  def -(other)
+    Point4D.new(x - other.x, y - other.y, z - other.z, w - other.w)
+  end
+  
+  def to_s
+    "#{x}, #{y}, #{z}, #{w}"
+  end
+}

data/lib/cem/version.rb

@@ -1,3 +1,3 @@
 module Cem
-  VERSION = "0.1.3"
+  VERSION = "0.1.7"
 end

data/lib/cem.rb

@@ -1,10 +1,4 @@
 
 require "cem/version"
 require "cem/ccommon"
-require "cem/cflame"
 require "cem/cruzzles"
-
-module Cem
-  class Error < StandardError; end
-  # Your code goes here...
-end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: cem
 version: !ruby/object:Gem::Version
-  version: 0.1.3
+  version: 0.1.7
 platform: ruby
 authors:
 - Christopher Özbek
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2020-06-10 00:00:00.000000000 Z
+date: 2021-12-07 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -16,28 +16,28 @@ dependencies:
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.17'
+        version: '2.1'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.17'
+        version: '2.1'
 - !ruby/object:Gem::Dependency
   name: rake
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '10.0'
+        version: '13.0'
   type: :development
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '10.0'
+        version: '13.0'
 - !ruby/object:Gem::Dependency
   name: rspec
   requirement: !ruby/object:Gem::Requirement
@@ -53,19 +53,19 @@ dependencies:
       - !ruby/object:Gem::Version
         version: '3.0'
 - !ruby/object:Gem::Dependency
-  name: flammarion
+  name: progress_bar
   requirement: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '0.3'
+        version: '1.3'
   type: :runtime
   prerelease: false
   version_requirements: !ruby/object:Gem::Requirement
     requirements:
     - - "~>"
       - !ruby/object:Gem::Version
-        version: '0.3'
+        version: '1.3'
 description: Christopher's Gem = My little helpers which I use in many projects.
 email:
 - christopher@oezbek.org
@@ -83,12 +83,93 @@ files:
 - bin/console
 - bin/setup
 - cem.gemspec
+- examples/aoc2018/.gitignore
+- examples/aoc2018/day1.rb
+- examples/aoc2018/day10.rb
+- examples/aoc2018/day11.rb
+- examples/aoc2018/day12.rb
+- examples/aoc2018/day13.rb
+- examples/aoc2018/day14.rb
+- examples/aoc2018/day14_2.rb
+- examples/aoc2018/day15.rb
+- examples/aoc2018/day16.rb
+- examples/aoc2018/day17.rb
+- examples/aoc2018/day18.rb
+- examples/aoc2018/day18_rspec.rb
+- examples/aoc2018/day19.rb
+- examples/aoc2018/day1_part2.rb
+- examples/aoc2018/day2.rb
+- examples/aoc2018/day20.rb
+- examples/aoc2018/day21.rb
+- examples/aoc2018/day21_v2.rb
+- examples/aoc2018/day21_v3.rb
+- examples/aoc2018/day21_v4.rb
+- examples/aoc2018/day22.rb
+- examples/aoc2018/day23.rb
+- examples/aoc2018/day24.rb
+- examples/aoc2018/day25.rb
+- examples/aoc2018/day2_2.rb
+- examples/aoc2018/day3.rb
+- examples/aoc2018/day4.rb
+- examples/aoc2018/day5.rb
+- examples/aoc2018/day5_part2.rb
+- examples/aoc2018/day6.rb
+- examples/aoc2018/day7.rb
+- examples/aoc2018/day8.rb
+- examples/aoc2018/day8_part2.rb
+- examples/aoc2018/day9.rb
+- examples/aoc2018/day9_circular.rb
+- examples/aoc2018/inputs/day10_input.txt
+- examples/aoc2018/inputs/day11_input.txt
+- examples/aoc2018/inputs/day12_input.txt
+- examples/aoc2018/inputs/day12_input2.txt
+- examples/aoc2018/inputs/day13_input.txt
+- examples/aoc2018/inputs/day13_test.txt
+- examples/aoc2018/inputs/day14_input.txt
+- examples/aoc2018/inputs/day15_input.txt
+- examples/aoc2018/inputs/day15_input10.txt
+- examples/aoc2018/inputs/day15_input11.txt
+- examples/aoc2018/inputs/day15_input12.txt
+- examples/aoc2018/inputs/day15_input13.txt
+- examples/aoc2018/inputs/day15_input14.txt
+- examples/aoc2018/inputs/day15_input2.txt
+- examples/aoc2018/inputs/day15_input3.txt
+- examples/aoc2018/inputs/day15_input4.txt
+- examples/aoc2018/inputs/day15_input5.txt
+- examples/aoc2018/inputs/day15_input6.txt
+- examples/aoc2018/inputs/day15_input7.txt
+- examples/aoc2018/inputs/day15_input8.txt
+- examples/aoc2018/inputs/day15_input9.txt
+- examples/aoc2018/inputs/day15_test.txt
+- examples/aoc2018/inputs/day16_input.txt
+- examples/aoc2018/inputs/day17_input.txt
+- examples/aoc2018/inputs/day17_input_test.txt
+- examples/aoc2018/inputs/day18_input.txt
+- examples/aoc2018/inputs/day18_test.txt
+- examples/aoc2018/inputs/day19_input.txt
+- examples/aoc2018/inputs/day1_input.txt
+- examples/aoc2018/inputs/day20_input.txt
+- examples/aoc2018/inputs/day21_input.txt
+- examples/aoc2018/inputs/day22_input.txt
+- examples/aoc2018/inputs/day23_input.txt
+- examples/aoc2018/inputs/day23_input2.txt
+- examples/aoc2018/inputs/day24_input.txt
+- examples/aoc2018/inputs/day25_input.txt
+- examples/aoc2018/inputs/day2_input.txt
+- examples/aoc2018/inputs/day3_input.txt
+- examples/aoc2018/inputs/day4_input.txt
+- examples/aoc2018/inputs/day5_input.txt
+- examples/aoc2018/inputs/day6_input.txt
+- examples/aoc2018/inputs/day7_input.txt
+- examples/aoc2018/inputs/day8_input.txt
+- examples/aoc2018/inputs/day9_input.txt
 - lib/cem.rb
 - lib/cem/ccommon.rb
 - lib/cem/cflame.rb
 - lib/cem/cflame/clickable_img.rb
 - lib/cem/cflame/missing_html.rb
 - lib/cem/cflame/p.rb
+- lib/cem/cflame/popen.rb
 - lib/cem/cflame/progress.rb
 - lib/cem/cruzzles.rb
 - lib/cem/version.rb
@@ -115,8 +196,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubyforge_project: 
-rubygems_version: 2.7.6
+rubygems_version: 3.1.4
 signing_key: 
 specification_version: 4
 summary: Cem = Christopher's Common Helper Gem for Ruby.