cem 0.1.3 → 0.1.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 014d136cae33adc2f8715b45c280fb55f11242f7c70940d040bce1e545b97e7b
-  data.tar.gz: fbbd2a832bbf96fa5f18c48557b4f081902657faeb57106e6a5227d73f409952
+  metadata.gz: a12790b597c9fd5c63fc14b855b964d32aeda5f968d612806e8d80697bbb37c4
+  data.tar.gz: 0acf18fd6f7dafe94553e55dca0e89c3304066b5ec85d1413187eb4afe6d7774
 SHA512:
-  metadata.gz: c3a7fa8ba025117c5035abe10a58004d03d3db9741cd1b1c10d22d976112b7c94ad9e0807d0bf930d411768060ac8eb6c5a34718125fac8be1eb3c2dc5103ea3
-  data.tar.gz: 2ac9b662fe5ef2aaf459d5c93dd7a5da5cbecb23260ae21bc201b75a294ec0defe121cbf39ccd9978af2595c9c116e756aac6edf68be64e4986923474ba9652a
+  metadata.gz: 4b8f6e808871a8b4197126f576940ca6a98daff481339ab4f9830316fecf2b4cab2d3bf7000b18ed39276731d2a431408dccfd799fc4ec784ac3901ade4f27eb
+  data.tar.gz: 142741554b2f214d0af5cbffbc0ecb9860ef9e7870697863af38eab01c3a811b3ac459cad093cc1b372962d7ba224beeb8c86a2bd58dc7f96c460e93bcbb4c43

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/cem.gemspec

@@ -35,8 +35,8 @@ 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'

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/day1_part2.rb

@@ -0,0 +1,30 @@
+
+#
+# https://adventofcode.com/2018/day/1 Part 2
+#
+# Does not use any cem functions \o/ but did you know:
+#
+#   - Set provides #[] as a class method: Set[1,2,3] is the same as Set.new() and then Set.add(...)
+#   - Set provides #add?() to add and check if the object added was already in the Set (returns nil in case).
+#
+#   For example: Set[0,1].add?(1) => nil
+#
+
+require 'set'
+
+cur = 0
+seen_before = Set[0]
+
+while true
+  File.read("inputs/day1_input.txt").each_line { |line|
+
+    cur += line.to_i
+    
+    if !seen_before.add?(cur)
+      puts cur
+      exit
+    end
+  }
+end 
+  
+# Unreachable!

data/examples/aoc2018/day2.rb

@@ -0,0 +1,20 @@
+
+#
+# https://adventofcode.com/2018/day/2
+#
+# Does not use any cem functions \o/ 
+#
+twice = 0
+thrice = 0
+
+chars = [*'a'..'z', *'A'..'Z']
+
+File.read("inputs/day2_input.txt").each_line { |l|
+
+  twice += 1 if chars.any? { |c| l.count(c) == 2 }
+  thrice += 1 if chars.any? { |c| l.count(c) == 3 }
+
+}
+
+puts "1st star: #{twice * thrice}"
+

data/examples/aoc2018/day2_2.rb

@@ -0,0 +1,27 @@
+
+#
+# https://adventofcode.com/2018/day/2 part 2
+#
+# Does not use any cem functions \o/
+
+previous = ''
+File.readlines("inputs/day2_input.txt").sort.each { |l|
+
+  mismatch = 0
+  s = ''
+  if previous != ''
+    l.split("").each_with_index { |c, i|
+      if previous[i] != c 
+        mismatch += 1 
+      else
+        s += c
+      end      
+    }  
+  end
+  
+  if mismatch == 1
+    puts s
+  end
+  
+  previous = l
+}

data/examples/aoc2018/day3.rb

@@ -0,0 +1,71 @@
+
+#
+# https://adventofcode.com/2018/day/3 part 1 and 2
+#
+# Demonstrates: Point2D, min(a,b), Array::with_progress
+#
+# Areas for improvement: Rect intersection
+
+require 'set'
+require 'cem'
+
+claims = []
+intersections = Set.new
+doesIntersect = Set.new
+
+Claim = Struct.new("Claim", :x, :y, :width, :height, :claimId)
+
+File.readlines("inputs/day3_input.txt").with_progress.each { |l|
+
+  if l =~ /^\#(\d+) \@ (\d+),(\d+)\: (\d+)x(\d+)$/
+
+    claim = Claim.new($2.to_i, $3.to_i, $4.to_i, $5.to_i, $1.to_i)
+    
+    claims.each { |other|
+      
+      x = claim.x
+      y = claim.y
+      w = claim.width
+      h = claim.height
+      
+      x2 = other.x
+      y2 = other.y
+      w2 = other.width
+      h2 = other.height
+      
+      if x2 < x 
+        x, x2 = x2, x
+        w, w2 = w2, w
+      end
+      
+      if y2 < y
+        y, y2 = y2, y
+        h, h2 = h2, h
+      end
+      
+      # puts "#{claim} - #{other}"
+      
+      if x + w >= x2 && y + h >= y2
+            
+        width = min(x2 + w2, x + w)
+        height = min(y2 + h2, y + h)
+        
+        doesIntersect.add(other)
+        doesIntersect.add(claim)
+      
+        for a in x2...width
+          for b in y2...height
+            # puts "#{a} #{b}"
+            intersections.add(Point2D.new(a,b))
+          end
+        end        
+        
+      end
+    }
+    
+    claims << claim
+  end  
+}
+
+puts "Part 1: #{intersections.size}"
+puts "Part 2: #{claims.to_set.subtract(doesIntersect).first.claimId}"

data/examples/aoc2018/day4.rb

@@ -0,0 +1,46 @@
+
+#
+# https://adventofcode.com/2018/day/4
+#
+# Does not use any cem functions \o/
+
+Guard = Struct.new("Guard", :id, :total, :minutes)
+
+guards = {}
+guard = nil
+asleep = nil
+
+File.readlines("inputs/day4_input.txt", chomp: true).sort.each { |l|
+
+  if l =~ /Guard \#(\d+) begins shift$/
+  
+    id = $1.to_i
+    guard = guards[id] ||= Guard.new(id, 0, [0] * 60)
+  
+  elsif / 00:(?<minute>\d+)\] falls asleep$/ =~ l
+  
+    asleep = minute.to_i 
+  
+  elsif l =~ / 00:(\d+)\] wakes up$/
+  
+    awake = $1.to_i
+    
+    guard.total += awake - asleep
+    (asleep...awake).each { |min|
+      guard.minutes[min] += 1
+    }
+    
+  end
+}
+
+guard = (guards.values.sort_by {|g| g.total}).last
+puts "Part1: #{guard.id * guard.minutes.each_with_index.max[1]}"
+
+guard = (guards.values.sort_by {|g| g.minutes.each_with_index.max[0] }).last
+puts "Part2: #{guard.id * guard.minutes.each_with_index.max[1]}"
+
+
+
+
+
+

data/examples/aoc2018/day5.rb

@@ -0,0 +1,23 @@
+
+#
+# https://adventofcode.com/2018/day/5 Part 1
+#
+# Does not use any cem functions \o/ but did you know:
+#
+#  - String#swapcase turns "Hello" into "hELLO"?
+# 
+
+out = []
+
+File.read("inputs/day5_input.txt").each_char { |c|
+  
+  if out.empty? || out.last != c.swapcase
+    out << c
+  else
+    out.pop
+  end
+
+}
+
+puts out.join.size
+

data/examples/aoc2018/day5_part2.rb

@@ -0,0 +1,29 @@
+
+#
+# https://adventofcode.com/2018/day/5 Part 2
+#
+# Does not use any cem functions \o/ but did you know:
+#
+#  - String#swapcase turns a Hello into hELLO?
+#  - Regex support 'i' for insensitive matches?
+# 
+
+File.readlines("inputs/day5_input.txt").each { |line|
+
+  puts [*'a'..'z'].map { |delete|
+            
+    out = []
+    
+    line.gsub(/#{delete}/i, '').each_char { |c|    
+      if out.empty? || out.last != c.swapcase
+        out << c
+      else
+        out.pop
+      end
+    }
+    
+    out.join.size
+  }.min
+}
+
+

data/examples/aoc2018/day6.rb

@@ -0,0 +1,53 @@
+
+#
+# https://adventofcode.com/2018/day/6 Part 1 and 2
+#
+# Uses Point2D from cem
+
+require 'cem'
+
+out = {}
+points = []
+largestRegion = 0
+
+File.readlines("inputs/day6_input.txt", chomp: true).each { |line|
+  if line =~ /^(\d+), (\d+)$/
+    v1 = $1.to_i
+    v2 = $2.to_i
+    
+    points << Point2D.new(v1, v2)
+  end
+}
+
+minX, maxX = points.map { |p| p.x }.minmax
+minY, maxY = points.map { |p| p.y }.minmax
+
+(minX..maxX).each { |x|
+  (minY..maxY).each { |y|
+  
+    coord = Point2D.new(x,y)
+  
+    nearest = points.group_by { |p| p.manhattan(coord) }.min_by { |k,v| k } 
+        
+    # puts nearest.inspect
+    if nearest.last.size == 1
+      (out[nearest.last.first] ||= []) << coord
+    end
+    
+    if points.sum { |p| p.manhattan(coord) } < 10000
+      largestRegion += 1
+    end
+  }
+}
+
+puts "Part 1"
+puts out.max_by { |k,v|
+  if v.select { |coord| (coord.x == maxX || coord.x == minX || coord.y == maxY || coord.y == minY) }.empty?
+    v.size
+  else
+    0 # don't care about infinite
+  end
+}.last.size
+
+puts "Part 2"
+puts largestRegion 

data/examples/aoc2018/day7.rb

@@ -0,0 +1,110 @@
+
+#
+# https://adventofcode.com/2018/day/7 part 1 and 2
+#
+# Does not use any cem functions \o/ 
+# 
+
+require 'set'
+
+Worker = Struct.new("Worker", :readyAt, :workingOn)
+
+def read
+  input = File.readlines("inputs/day7_input.txt", chomp: true)
+
+  @edges = {}
+  @chars = Set.new
+
+  input.each { |line|
+
+    if line =~ /^Step (.+) must be finished before step (.+) can begin.$/
+      to   = $1
+      from = $2    
+      
+      @chars.add(to)
+      @chars.add(from)
+      
+      (@edges[from] ||= []) << to
+    end    
+    
+    @chars.each { |c| @edges[c] ||= [] }
+  }
+end
+
+def anyWorkerReady 
+  return @idleWorkers.size > 0
+end
+
+def availableWork
+  return @chars.select { |c| @edges.include?(c) && @edges[c].size == 0 }.sort
+end
+
+def anyWorkAvailable
+  return availableWork.size > 0
+end
+
+def timeStep
+  
+  puts "#{@timeNow}: #{@busyWorkers.inspect}" if $DEBUG
+  
+  w = @busyWorkers.min_by { |w| w.readyAt }
+  @timeNow = w.readyAt
+  @busyWorkers -= [w]
+  @idleWorkers += [w]
+  
+  c = w.workingOn
+    
+  @result += c  
+    
+  @edges.update(@edges) { |k,v|
+    v - [c]
+  }
+end
+  
+def scheduleWork
+
+  nextTask = availableWork.first
+  
+  w = @idleWorkers.pop
+  @busyWorkers += [w]
+  w.workingOn = nextTask
+  w.readyAt = @timeNow + 61 + nextTask.ord - 'A'.ord
+  @edges.delete(nextTask)
+
+  puts "Scheduling #{nextTask} to be ready at #{w.readyAt}" if $DEBUG
+  
+end
+  
+def process(parallelism)
+
+  read()
+
+  @timeNow = 0
+  @result = ""
+
+  @busyWorkers = []
+  @idleWorkers = []
+  parallelism.times { @idleWorkers << Worker.new(0, '') }
+
+  loop do
+
+    while (!anyWorkerReady || !anyWorkAvailable) && @busyWorkers.size > 0
+      timeStep
+    end
+    
+    if !anyWorkAvailable
+      break
+    end
+    
+    scheduleWork 
+    
+  end
+    
+  puts "Parallelism: #{parallelism}"
+  puts @result
+  puts @timeNow
+  
+end
+
+process(1)
+process(5)