cem 0.1.2 → 0.1.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 7d56d8ba91aab41f5e12070a9f821516b8f69d626d3ffd7261dca402c41768ba
-  data.tar.gz: 513114a63b34c7375339e4eb17d931bc7925bb068495c4726a6577e98c0ebc7a
+  metadata.gz: eb4683b5fc26b935c95d45b05a77e44c859880c4b0eb6b9424555fb55819582c
+  data.tar.gz: 3183e62b7576af9229f1a6c3315df529b19655b5ace714d8ba0e8ce32769ac60
 SHA512:
-  metadata.gz: 55106e14c662cec3b4ffc68c6e0bb5775405fadbb61d1fd2d4611becd38d7cf55445e8a7872107797df5aaa4da18656419dbf0ed37eb676dc10a2184aa7168f1
-  data.tar.gz: f8f56d39752badb44074162e20452814937bd40ee44bd0e22ea777bd775f5c830e25768ec21ca104310efa84bb3679e868d99af9a674a907807e479efc43cdf8
+  metadata.gz: bb4a8e8b37769607711c2747fdaf975a3abfa04793ad5739bc5067a215953b113aa8ecb96f4ed603113c5e32d193853a5fd1be680e637c4ad6e40a3d82619d70
+  data.tar.gz: bc6f46c74b61524113bb6071e635eb71eb3799d1888a2f78879441e73aebaaa7d301f785b9a48d9bc9a2eebeb134c35e129a981bca327bc1f6a59fe5e69b6849

data/.gitignore

@@ -54,4 +54,5 @@ Gemfile.lock
 .rvmrc
 
 # Used by RuboCop. Remote config files pulled in from inherit_from directive.
-# .rubocop-https?--*
+# .rubocop-https?--
+.idea/

data/README.md

@@ -4,18 +4,6 @@ This gem is an assorted collection of common helpers that I use in a lot of proj
 
 ## Installation
 
-Add this line to your application's Gemfile:
-
-```ruby
-gem 'cem'
-```
-
-And then execute:
-
-    $ bundle
-
-Or install it yourself as:
-
     $ gem install cem
 
 ## Usage
@@ -26,19 +14,19 @@ Key things includes:
 
 ### crequire
 
-crequire is a replacement for require for situations where bundler would be overkill. It solves the frustration of having to manually install gems to run a particular ruby script which requires other gems. 
+`crequire` is a replacement for `require` for situations where bundler would be overkill. It solves the frustration of having to manually install gems to run a particular ruby script which requires other gems. 
 
-For example when you want to require 'qml' from the 'ruby-qml' gem, use the following line:
+For example when you want to require `qml` from the `ruby-qml` gem, use the following line:
 
 ```
 crequire 'qml', 'ruby-qml'
 ```
 
-This will attempt to require qml and if it can't be found in the local RubyGems, then it will try to `gem install ruby-qml`
+This will attempt to require `qml` and if it can't be found in the local RubyGems, then it will try to `gem install ruby-qml`
 
 ### Array::with_progress
 
-Monkey patches array to return an enumeration which prints progress while lazy evaluating the enumeration.
+Monkey patches `Array` to return an enumeration which prints progress while lazy evaluating the enumeration.
 
 ```
 require 'cem'
@@ -59,7 +47,7 @@ Defines integer based `Point2D`, `Seg2D` (line segment), `Dir2D` (relative direc
 
 ## Development
 
-After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rspec` to run the tests. 
 
 To install this gem onto your local machine, run `bundle exec rake install`. 
 
@@ -71,7 +59,7 @@ Bug reports and pull requests are welcome on GitHub at https://github.com/coezbe
 
 ## License
 
-The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
+The gem is available as permissive open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
 
 ## What's with the name?
 

data/cem.gemspec

@@ -35,9 +35,10 @@ Gem::Specification.new do |spec|
   spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
   spec.require_paths = ["lib"]
 
-  spec.add_development_dependency "bundler", "~> 1.17"
-  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "bundler", "~> 2.1" # Was   1.17
+  spec.add_development_dependency "rake", "~> 13.0"   # Was: 10.0
   spec.add_development_dependency "rspec", "~> 3.0"
   
-  spec.add_runtime_dependency 'flammarion', '~> 0.3'
+  # Flammarion is not a runtime dependency, but rather optional
+  # spec.add_runtime_dependency 'flammarion', '~> 0.3'
 end

data/examples/aoc2018/.gitignore

@@ -0,0 +1,2 @@
+problems/ 
+temps/

data/examples/aoc2018/day1.rb

@@ -0,0 +1,13 @@
+
+#
+# https://adventofcode.com/2018/day/1 Part 1
+#
+# Does not use any cem functions \o/
+#
+
+result = 0
+File.read("inputs/day1_input.txt").each_line { |line|
+  result += line.to_i 
+}
+
+puts result

data/examples/aoc2018/day10.rb

@@ -0,0 +1,61 @@
+
+#
+# https://adventofcode.com/2018/day/10 part 1 and part 2
+#
+# Demonstrates use of 
+#  - Point2D#area returns x*y as if the given point was a representing a rectangle starting at 0,0
+#  - Point2D#+ and #- allow to use normal vector math on points
+#  - Grid.from_points allows to build a Grid view of a set of points
+#
+# Also did you know that:
+#   - Numeric#step can receive a block directly to implement an infinite for loop?
+#   - Array#minmax => Find min and max from an array 
+#
+
+require 'cem'
+
+input = File.readlines("inputs/day10_input.txt", chomp: true)
+
+data = []
+
+input.each { |line|
+
+  if line =~ /^position=<\s*(-?\d+),\s*(-?\d+)> velocity=<\s*(-?\d+),\s*(-?\d+)>$/
+    p1 = $1.to_i
+    p2 = $2.to_i
+    v1 = $3.to_i
+    v2 = $4.to_i
+    
+    data << [Point2D.new(p1,p2), Point2D.new(v1,v2)]
+  else 
+    raise line
+  end
+}
+
+lastSize = nil
+
+# Count iterations from 0, because we need to return the iteration number preceeding the last.
+0.step { |iter|
+
+  # Apply velocity to all points
+  data.map! { |p, v| [p + v, v] }
+  
+  min, max = data.map { |p, v| p }.minmax 
+    
+  size = (max - min).area
+  
+  # Terminate the search when the area of all points starts growing again.
+  if lastSize && size > lastSize
+    
+    # Go back one iteration
+    puts "Word:\n" + Grid.from_points(data.map { |p, v| p - v }).to_s
+    
+    puts "Iterations until word: #{iter}"
+    
+    return
+    
+  end
+  
+  lastSize = size
+}
+

data/examples/aoc2018/day11.rb

@@ -0,0 +1,66 @@
+
+#
+# https://adventofcode.com/2018/day/11 part 1 and part 2
+#
+# Does not use any cem functions \o/ 
+#
+
+input = 5177
+
+levels = [0] * (300 * 300)
+
+(1..300).each { |x|
+  (1..300).each { |y|
+    
+    rackId = ( x) + 10
+    powerLevel = rackId * ( y)
+    powerLevel += input
+    powerLevel *= rackId
+    powerLevel /= 100
+    powerLevel -= powerLevel / 10 * 10
+    powerLevel -= 5
+    
+    levels[y * 300 + x] = powerLevel
+  }
+}
+
+max = 0     
+(1..300).each { |gridsize|
+
+  local_max = nil
+  local = nil
+  (1..300-gridsize).each { |x|
+    (1..300-gridsize).each { |y|
+
+      sum = 0
+      
+      (0..gridsize-1).each { |dx|
+        (0..gridsize-1).each { |dy|
+        
+          sum += levels[(dy + y) * 300 + dx + x]
+        }
+      }
+      
+      if !local_max || sum > local_max
+        local = "#{x}, #{y}, #{gridsize}: #{sum}"
+        local_max = sum
+      end     
+    }
+  }
+  
+  if gridsize == 3
+    puts "Part 1 result:"
+  end
+  
+  print local  
+
+  if local_max > max  
+    puts "***"
+    max = local_max
+  else
+    puts 
+    puts "Previous data is max"
+    exit
+  end
+}
+    

data/examples/aoc2018/day12.rb

@@ -0,0 +1,61 @@
+
+#
+# https://adventofcode.com/2018/day/12 part 1 and part 2
+#
+# Does not use any cem functions \o/ 
+#
+
+input = {}
+
+start = ""
+File.readlines("inputs/day12_input.txt", chomp: true).each { |line|
+
+  if line =~ /^initial state\: (.*)$/
+    start = $1
+  end    
+
+  if line =~ /^(.....) => (.)$/
+    input[$1] = $2
+  end    
+
+}
+
+result = ''
+previous_score = nil
+delta = nil
+offset = 0
+max_gen = 50000000000
+
+(1..max_gen).each { |gen|
+
+  start = "...." + start + "...."
+  offset -= 2
+  
+  result = ''
+  (0...start.length - 4).each { |i|
+    result += input.has_key?(start[i,5]) ? input[start[i,5]] : '.'
+  }
+
+  score = 0
+  (0...result.length).each { |i|  
+    score += i + offset if result[i] == '#'
+  }
+
+  # puts score
+  if gen == 20 
+    puts "Part 1: Generation #{gen} has score #{score}" 
+  end
+  
+  if delta && (score - previous_score == delta)
+    puts 
+    puts "Part 2: Generation #{gen} has score #{score} with same delta as before (#{delta})."
+    puts "If continued to gen #{max_gen} the score would be #{(max_gen - gen) * delta + score}"
+    exit
+  end
+  
+  delta = score - previous_score if previous_score
+  previous_score = score
+  
+  start = result
+}
+

data/examples/aoc2018/day13.rb

@@ -0,0 +1,167 @@
+
+#
+# https://adventofcode.com/2018/day/13 part 1 and 2
+#
+# Demonstrates Point2D. Certainly could use Grid!
+
+require 'cem'
+  
+Cart = Struct.new("Cart", :dir, :pos, :history)
+carts = []
+lines = []
+
+# Read board
+File.readlines("inputs/day13_input.txt", chomp: true).each { |line|
+  lines << line.rstrip
+}
+
+# Read carts
+lines.each_with_index { |l, y|
+  l.chars.each_with_index { |c, x|
+    case c
+      when '^', 'v'
+        lines[y][x] = '|'
+        carts << Cart.new(c, Point2D.new(x,y), 2)
+      when '>', '<'
+        lines[y][x] = '-'
+        carts << Cart.new(c, Point2D.new(x,y), 2)
+    end
+  }
+}
+
+def printBoard(lines, carts)
+
+  lines.each_with_index { |l, y|
+    l.chars.each_with_index { |c, x|
+     
+      a = carts.find { |cart| cart.pos == Point2D.new(x,y) } 
+      if a 
+        print a.dir
+      else
+        print c
+      end
+    }
+    print "\n"
+  }
+end
+
+generation = 0
+first = true
+
+loop do 
+
+  generation += 1
+  
+  if carts.size == 1
+    puts "Last crash at: #{carts[0].pos}"
+    exit
+  end
+  
+  # system "cls"
+  # puts generation
+  # puts carts.inspect
+  # printBoard(lines, carts)
+  # gets  
+  
+  carts.sort_by { |cart| cart.pos.y * 10000 + cart.pos.x }.each { |cart|
+    
+    cart.pos += Point2D.from_s(cart.dir)
+        
+    if crash = carts.find { |c2| cart != c2 && cart.pos == c2.pos }
+      if first
+        puts "First crash at: #{cart.pos}"
+        first = false
+      end
+  
+      carts.delete(crash)
+      carts.delete(cart)
+      
+    end
+        
+    track = lines[cart.pos.y][cart.pos.x]
+      
+    case cart.dir
+      
+      when '>'      
+        
+        case track
+          when '\\'
+            cart.dir = 'v'
+          when '/'
+            cart.dir = '^'
+          when '+'
+            
+            cart.history = (cart.history + 1) % 3
+            case cart.history 
+              when 1
+                # nothing
+              when 2
+                cart.dir = 'v'
+              when 0
+                cart.dir = '^'
+            end
+          
+        end
+            
+      when '<'        
+        case track
+        when '\\'          
+          cart.dir = '^'
+        when '/'
+          cart.dir = 'v'
+        when '+'
+          
+          cart.history = (cart.history + 1) % 3
+          case cart.history
+            when 1
+              # nothing
+            when 2
+              cart.dir = '^'
+            when 0
+              cart.dir = 'v'
+          end
+        
+      end 
+      when '^'      
+        case track
+          when '\\'          
+            cart.dir = '<'
+          when '/'
+            cart.dir = '>'
+          when '+'
+            
+            cart.history = (cart.history + 1) % 3
+            case cart.history
+              when 1
+                # nothing
+              when 2
+                cart.dir = '>'
+              when 0
+                cart.dir = '<'
+            end
+          
+        end 
+      when 'v'        
+        case track
+          when '\\'          
+            cart.dir = '>'
+          when '/'
+            cart.dir = '<'
+          when '+'
+            
+            cart.history = (cart.history + 1) % 3
+            case cart.history
+              when 1
+                # nothing
+              when 2
+                cart.dir = '<'
+              when 0
+                cart.dir = '>'
+            end
+          
+        end 
+    end    
+  }
+    
+  
+end

data/examples/aoc2018/day14.rb

@@ -0,0 +1,31 @@
+
+#
+# https://adventofcode.com/2018/day/14 part 1 
+#
+# Does not use any cem functions \o/
+
+recipes = 30121
+
+nexta = 3
+storage = [3, 7] 
+elves = [0, 1]
+
+i = 2
+while i < recipes + 10
+
+  r = storage[elves[0]] + storage[elves[1]]
+  
+  r.to_s.chars.each { |c|
+    storage << c.to_i
+    i += 1
+    
+    if i == recipes + 10
+      break;
+    end
+  }  
+    
+  elves[0] = (1 + elves[0] + storage[elves[0]]) % storage.size
+  elves[1] = (1 + elves[1] + storage[elves[1]]) % storage.size
+end
+
+puts storage[-10,15].map { |i| i.to_s}.join 

data/examples/aoc2018/day14_2.rb

@@ -0,0 +1,71 @@
+
+#
+# https://adventofcode.com/2018/day/14 part 2 
+#
+# Does not use any cem functions \o/
+
+
+#recipes = "51589"
+#recipes = "59414"
+#recipes = "652601"
+
+recipes =  "030121"
+
+r2 = recipes.chars.map {|c| c.to_i}
+
+storage = [0] * 100000000
+storage[0] = 3
+storage[1] = 7
+
+e0 = 0
+e1 = 1
+
+comp = [0] * r2.length
+
+i = 2
+while true
+
+  puts i if i % 100000 == 0
+
+  s0 = storage[e0]
+  s1 = storage[e1]
+    
+  r = s0 + s1
+    
+  if r >= 10
+    storage[i] = 1
+    i+=1
+    
+    comp << 1
+    comp = comp.drop(1)   
+    
+    if comp == r2
+      puts i - recipes.length
+      exit
+    end
+    storage[i] = r - 10
+    i+=1
+    comp << r - 10
+    comp = comp.drop(1)   
+
+    if comp == r2
+      puts i - recipes.length
+      exit
+    end
+  else
+    storage[i] = r
+    i+=1
+    comp << r
+    comp = comp.drop(1)  
+
+    if comp == r2
+      puts i - recipes.length
+      exit
+    end
+    
+  end
+  
+  e0 = (1 + e0 + s0) % i
+  e1 = (1 + e1 + s1) % i
+end
+