maroon 0.6.1 → 0.6.5

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: a2b4446ac84c36b68f710a04280f9488d116035c
+  data.tar.gz: 01322628719027b5cfc4b500f81063a23c326e5a
+SHA512:
+  metadata.gz: 8a6644383356d9c8939dd1fa94c89d0e89baa05d867a1c7f2229c335972c04c164d4e6deacbe0632a679453c60858eb3447914817c8d9bc1e6fd7b1a741dd2ae
+  data.tar.gz: ae022ce8665b2c78f963112be9a0635306dc6c47d64110dbde15508bdd690ba975ab3f14d2f1711c94e694d99fba2a19fa9af33a987fa484097992a94a57828d

data/Examples/Dijkstra/CalculateShortestDistance.rb

@@ -1,10 +1,14 @@
 Context::define :CalculateShortestDistance do
 
-  role :tentative_distance_values do end
-  role :path do end
+  role :tentative_distance_values do
+  end
+  role :path do
+  end
 
-  role :current do  end
-  role :destination do end
+  role :current do
+  end
+  role :destination do
+  end
 
 
   role :map do
@@ -44,14 +48,14 @@ Context::define :CalculateShortestDistance do
     @path = CalculateShortestPath.new(current, destination, map).path
     retval = 0
     previous_node = nil
-      path.reverse_each {|node|
-        if previous_node.nil?
-          retval = 0
-        else
-          retval += map.distance_between previous_node, node
-        end
-        previous_node = node
-      }
+    path.reverse_each { |node|
+      if previous_node.nil?
+        retval = 0
+      else
+        retval += map.distance_between previous_node, node
+      end
+      previous_node = node
+    }
     retval
   end
 

data/Examples/Dijkstra/calculate_shortest_path.rb

@@ -2,7 +2,7 @@
 #
 # Consider street corners on a Manhattan grid. We want to find the
 # minimal path from the most northeast city to the most
-# southeast city. Use Dijstra's algorithm
+# southeast city. Use Dijkstra's algorithm
 #
 
 
@@ -15,7 +15,6 @@
 #
 
 
-
 # There are eight roles in the algorithm:
 #
 # pathTo, which is the interface to whatever accumulates the path
@@ -39,7 +38,7 @@
 #
 # Map is a DCI role. The role in this example is played by an
 # object representing a particular Manhattan geometry
- ctx,source = Context::define :CalculateShortestPath do
+ctx, source = Context::define :CalculateShortestPath do
   role :distance_labeled_graph_node do
     # Access to roles and other Context data
     tentative_distance_values do
@@ -58,17 +57,17 @@
   role :map do
     distance_between do |a, b|
       dist = @map.distances[Edge.new(a, b)]
-     # p "distance between #{a.name} and #{b.name} is #{dist}"
+      # p "distance between #{a.name} and #{b.name} is #{dist}"
       dist
     end
     next_down_the_street_from do |x|
       n = east_neighbor_of x
-     # p "next down the street from #{x.name} is #{n.name}"
+      # p "next down the street from #{x.name} is #{n.name}"
       n
     end
     next_along_the_avenue_from do |x|
       n = south_neighbor_of x
-     # p "next along the avenue from #{x.name} is #{n.name}"
+      # p "next along the avenue from #{x.name} is #{n.name}"
       n
     end
     origin do
@@ -79,11 +78,11 @@
       selection = nil
       @unvisited.each_key {
           |intersection|
-        bind :intersection=>:distance_labeled_graph_node
+        bind :intersection => :distance_labeled_graph_node
         if @unvisited[intersection]
           tentative_distance = intersection.tentative_distance
           if tentative_distance < min
-           # p "min distance is updated from #{min} to #{tentative_distance}"
+            # p "min distance is updated from #{min} to #{tentative_distance}"
             min = tentative_distance
             selection = intersection
           end
@@ -106,12 +105,16 @@
     unvisited_neighbors do
       retval = Array.new
       if @south_neighbor != nil
-        if unvisited[@south_neighbor] then retval << @south_neighbor end
+        if unvisited[@south_neighbor] then
+          retval << @south_neighbor
+        end
       end
       if @east_neighbor != nil
-        if unvisited[@east_neighbor] then retval << @east_neighbor end
+        if unvisited[@east_neighbor] then
+          retval << @east_neighbor
+        end
       end
-     # p "unvisited neighbors #{retval}"
+      # p "unvisited neighbors #{retval}"
       retval
     end
     tentative_distance do
@@ -119,7 +122,8 @@
       @tentative_distance_values[current]
     end
   end
-  role :unvisited do  end
+  role :unvisited do
+  end
 
 
 # This module serves to provide the methods both for the
@@ -131,11 +135,11 @@
       raise "self can't be nil" unless @neighbor_node
 
       if x < neighbor_node.tentative_distance
-       # p "updated tentative distance from #{neighbor_node.tentative_distance} to #{x}"
+        # p "updated tentative distance from #{neighbor_node.tentative_distance} to #{x}"
         neighbor_node.set_tentative_distance_to x
         :distance_was_udated
       else
-       # p "left tentative distance at #{neighbor_node.tentative_distance} instead of #{x}"
+        # p "left tentative distance at #{neighbor_node.tentative_distance} instead of #{x}"
         :distance_was_not_udated
       end
     end
@@ -151,7 +155,7 @@
       tentative_distance_values[@neighbor_node] = x
     end
   end
-  # This is the method that starts the work. Called from initialize.
+# This is the method that starts the work. Called from initialize.
 
   execute do |path_vector, unvisited_hash, pathto_hash, tentative_distance_values_hash|
     do_inits(path_vector, unvisited_hash, pathto_hash,
@@ -161,7 +165,7 @@
     # Calculate tentative distances of unvisited neighbors
 
     unvisited_neighbors = current.unvisited_neighbors
-   # p "#{unvisited_neighbors}"
+    # p "#{unvisited_neighbors}"
     if unvisited_neighbors != nil
       unvisited_neighbors.each {
           |neighbor|
@@ -173,9 +177,9 @@
         net_distance = tentative_distance + distance_between
 
         if neighbor.relable_node_as(net_distance) == :distance_was_udated
-         # p "set path"
+          # p "set path"
           pathTo[neighbor] = @current
-         # p "path #{@pathTo}"
+          # p "path #{@pathTo}"
         end
       }
     end
@@ -218,7 +222,7 @@
           # These initializations are directly from the description of the algorithm
           map.nodes.each { |node| @unvisited[node] = true }
           @unvisited.delete(map.origin)
-          map.nodes.each { |node| bind :node=>:distance_labeled_graph_node; node.set_tentative_distance_to(infinity) }
+          map.nodes.each { |node| bind :node => :distance_labeled_graph_node; node.set_tentative_distance_to(infinity) }
           tentative_distance_values[map.origin] = 0
 
           # The path array is kept in the outermost context and serves to store the
@@ -244,6 +248,7 @@
           @pathTo = pathto_hash
         end
       end
+
       # Since path_vector isn't set up, this is the first iteration of the recursion
 
       @tentative_distance_values = Hash.new
@@ -257,11 +262,11 @@
       # These initializations are directly from the description of the algorithm
       map.nodes.each { |node| @unvisited[node] = true }
       @unvisited.delete(map.origin)
-     # p "map #{map.nodes}"
+      # p "map #{map.nodes}"
       map.nodes.each { |node|
         bind :node => :distance_labeled_graph_node;
         node.set_tentative_distance_to(infinity)
-       # p "initialized node #{node.name}"
+        # p "initialized node #{node.name}"
       }
       tentative_distance_values[map.origin] = 0
 
@@ -297,12 +302,26 @@ class CalculateShortestPath
   def pathTo
     @pathTo
   end
-  def east_neighbor; @east_neighbor end
-  def south_neighbor; @south_neighbor end
-  def path; @path end
 
-  def destination; @destination end
-  def tentative_distance_values; @tentative_distance_values end
+  def east_neighbor;
+    @east_neighbor
+  end
+
+  def south_neighbor;
+    @south_neighbor
+  end
+
+  def path;
+    @path
+  end
+
+  def destination;
+    @destination
+  end
+
+  def tentative_distance_values;
+    @tentative_distance_values
+  end
 
   # This is a shortcut to information that really belongs in the Map.
   # To keep roles stateless, we hold the Map's unvisited structure in the
@@ -333,6 +352,7 @@ class CalculateShortestPath
 
     execute(path_vector, unvisited_hash, pathto_hash, tentative_distance_values_hash)
   end
+
   def each
     path.each { |node| yield node }
   end
@@ -350,5 +370,5 @@ class CalculateShortestPath
   end
 end
 
-File.open('CalculateShortestPath_generated.rb', 'w') {|f| f.write(source) }
+File.open('CalculateShortestPath_generated.rb', 'w') { |f| f.write(source) }
 

data/Examples/Dijkstra/data.rb

@@ -1,10 +1,17 @@
-def infinity; (2**(0.size * 8 -2) -1) end
+def infinity;
+  (2**(0.size * 8 -2) -1)
+end
+
 # Data classes
 Edge = Struct.new(:from, :to)
 
 class Node
   attr_reader :name
-  def initialize(n); @name = n end
+
+  def initialize(n)
+    ; @name = n
+  end
+
   def eql? (another_node)
     # Nodes are == equal if they have the same name. This is explicitly
     # defined here to call out the importance of the differnce between
@@ -14,7 +21,6 @@ class Node
 end
 
 
-
 #
 # --- Geometry is the interface to the data class that has all
 # --- the information about the map. This is kind of silly in Ruby
@@ -25,14 +31,16 @@ class ManhattanGeometry
     @distances = Hash.new
   end
 
-  def nodes; @nodes end
+  def nodes;
+    @nodes
+  end
+
   def distances
     @distances
   end
 end
 
 
-
 #
 # --- Here are some test data
 #
@@ -49,7 +57,6 @@ class Geometry_1 < ManhattanGeometry
         nodes << Node.new(names[(i*3)+j])
       }
     }
-    
 
 
     # Aliases to help set up the grid. Grid is of Manhattan form:
@@ -114,11 +121,21 @@ class Geometry_1 < ManhattanGeometry
     @next_along_the_avenue_from.freeze
   end
 
-  def east_neighbor_of(a); @next_down_the_street_from[a] end
-  def south_neighbor_of(a); @next_along_the_avenue_from[a] end
+  def east_neighbor_of(a)
+    ; @next_down_the_street_from[a]
+  end
 
-  def root;  @node_a end
-  def destination;  @node_i end
+  def south_neighbor_of(a)
+    ; @next_along_the_avenue_from[a]
+  end
+
+  def root;
+    @node_a
+  end
+
+  def destination;
+    @node_i
+  end
 end
 
 
@@ -201,10 +218,20 @@ class ManhattanGeometry2 < ManhattanGeometry
     @next_along_the_avenue_from.freeze
   end
 
-  def east_neighbor_of(a); @next_down_the_street_from[a] end
-  def south_neighbor_of(a); @next_along_the_avenue_from[a] end
+  def east_neighbor_of(a)
+    ; @next_down_the_street_from[a]
+  end
+
+  def south_neighbor_of(a)
+    ; @next_along_the_avenue_from[a]
+  end
 
-  def root;  @node_a end
-  def destination;  @node_k end
+  def root;
+    @node_a
+  end
+
+  def destination;
+    @node_k
+  end
 end
 

data/Examples/Dijkstra/dijkstra.rb

@@ -57,7 +57,6 @@ require './Examples/Dijkstra/Calculate_Shortest_Path.rb'
 #       design
 
 
-
 # --- Main Program: test driver
 #
 geometries = Geometry_1.new
@@ -74,11 +73,13 @@ path = CalculateShortestPath.new(geometries.root, geometries.destination, geomet
 print 'Path is: '
 last_node = nil
 path.each do |node|
-  if last_node != nil; print " - #{geometries.distances[Edge.new(node, last_node)]} - " end
+  if last_node != nil;
+    print " - #{geometries.distances[Edge.new(node, last_node)]} - "
+  end
   print "#{node.name}"
   last_node = node
 end
 print "\n"
 
 geometries = ManhattanGeometry2.new
-puts "distance is #{CalculateShortestDistance.new(geometries.root,  geometries).distance }"
+puts "distance is #{CalculateShortestDistance.new(geometries.root, geometries).distance }"

data/Examples/MoneyTransfer.rb

@@ -1,61 +1,62 @@
-require './lib/maroon.rb'
-
-Context::define :MoneyTransfer do
-  role :source do
-    withdraw do |amount|
-      source.movement(amount)
-      source.log "withdrawal #{amount}"
-    end
-    log do |message|
-      p "#{@source} source #{message}"
-    end
-  end
-
-  role :destination do
-    deposit do |amount|
-      @destination.movement(amount)
-      @destination.log "deposit #{amount}"
-    end
-    logger do |message|
-      p "#{@source} destination #{message}"
-    end
-  end
-
-  role :amount do end
-
-  transfer do
-    source.withdraw -amount
-    destination.deposit amount
-  end
-end
-
-class MoneyTransfer
-  def initialize(source, destination, amount)
-    @source = source
-    @destination = destination
-    @amount  = amount
-  end
-end
-class Account
-  def initialize (amount, id)
-    @balance = amount
-    @account_id = id
-  end
-
-  def movement(amount)
-    log "Amount #{amount}"
-    @balance+=amount
-  end
-
-  def log(message)
-    (p s = "instance #{message}")
-  end
-
-  def to_s
-    "balance of #{@account_id}: #{@balance}"
-  end
-end
-
-account = Account.new 1000, "source"
-ctx = MoneyTransfer.new account, account, 100
+require './lib/maroon.rb'
+
+Context::define :MoneyTransfer do
+  role :source do
+    withdraw do |amount|
+      source.movement(amount)
+      source.log "withdrawal #{amount}"
+    end
+    log do |message|
+      p "#{@source} source #{message}"
+    end
+  end
+
+  role :destination do
+    deposit do |amount|
+      @destination.movement(amount)
+      @destination.log "deposit #{amount}"
+    end
+    logger do |message|
+      p "#{@source} destination #{message}"
+    end
+  end
+
+  role :amount do
+  end
+
+  transfer do
+    source.withdraw -amount
+    destination.deposit amount
+  end
+end
+
+class MoneyTransfer
+  def initialize(source, destination, amount)
+    @source = source
+    @destination = destination
+    @amount = amount
+  end
+end
+class Account
+  def initialize (amount, id)
+    @balance = amount
+    @account_id = id
+  end
+
+  def movement(amount)
+    log "Amount #{amount}"
+    @balance+=amount
+  end
+
+  def log(message)
+    (p s = "instance #{message}")
+  end
+
+  def to_s
+    "balance of #{@account_id}: #{@balance}"
+  end
+end
+
+account = Account.new 1000, "source"
+ctx = MoneyTransfer.new account, account, 100
 ctx.transfer