finite_mdp 0.1.1 → 0.2.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 4dea8cd1de91ae04618cf3d04df9f84f9c3e1818
+  data.tar.gz: 09309d55f5d88bebf5d1a2c989f4ff403a7c5b75
+SHA512:
+  metadata.gz: f4bbba688034130bc37f7192c4a4073b246886b9e43398fa2a5f3bd85407d271b67579babd9573fbe97fcd452912765405bce2fc3a7d26760d7b3e69154dace3
+  data.tar.gz: 2745aa18e046181cd8f45f1cb956007be71a6dc02f3aee7a977d3607d9ae977cc7d75cbb5177b0c2e1bb330edd519c6fd59f69278cbcb6f1a300c9ebfb7a4332

data/lib/finite_mdp/hash_model.rb

@@ -51,7 +51,7 @@ class FiniteMDP::HashModel
   #
   # Possible successor states after taking the given action in the given state;
   # see {Model#next_states}.
-  # 
+  #
   # @param [state] state
   #
   # @param [action] action
@@ -60,7 +60,7 @@ class FiniteMDP::HashModel
   #
   def next_states state, action
     hash[state][action].keys
-  end 
+  end
 
   #
   # Probability of the given transition; see {Model#transition_probability}.
@@ -72,9 +72,9 @@ class FiniteMDP::HashModel
   # @param [state] next_state
   #
   # @return [Float] in [0, 1]; zero if the transition is not in the hash
-  # 
+  #
   def transition_probability state, action, next_state
-    probability, reward = hash[state][action][next_state]
+    probability, _reward = hash[state][action][next_state]
     probability || 0
   end
 
@@ -90,7 +90,7 @@ class FiniteMDP::HashModel
   # @return [Float, nil] nil if the transition is not in the hash
   #
   def reward state, action, next_state
-    probability, reward = hash[state][action][next_state]
+    _probability, reward = hash[state][action][next_state]
     reward
   end
 

data/lib/finite_mdp/version.rb

@@ -1,6 +1,6 @@
 module FiniteMDP
   VERSION_MAJOR = 0
-  VERSION_MINOR = 1
-  VERSION_PATCH = 1
+  VERSION_MINOR = 2
+  VERSION_PATCH = 0
   VERSION = [VERSION_MAJOR, VERSION_MINOR, VERSION_PATCH].join('.')
 end

data/test/finite_mdp/finite_mdp_test.rb

@@ -1,12 +1,8 @@
-# uncomment for coverage in ruby 1.9
-#require 'simplecov'
-#SimpleCov.start
-
-require 'test/unit'
+require 'minitest/autorun'
 require 'finite_mdp'
 require 'set'
 
-class TestFiniteMDP < Test::Unit::TestCase
+class TestFiniteMDP < MiniTest::Test
   include FiniteMDP
 
   def assert_close expected, actual, tol=1e-6
@@ -176,10 +172,10 @@ class TestFiniteMDP < Test::Unit::TestCase
 
     # can move north, east, south or west on the grid
     MOVES = {
-      '^' => [-1,  0], 
-      '>' => [ 0,  1], 
-      'v' => [ 1,  0], 
-      '<' => [ 0, -1]} 
+      '^' => [-1,  0],
+      '>' => [ 0,  1],
+      'v' => [ 1,  0],
+      '<' => [ 0, -1]}
 
     # agent can move north, south, east or west (unless it's in the :stop
     # state); if it tries to move off the grid or into an obstacle, it stays
@@ -277,7 +273,7 @@ class TestFiniteMDP < Test::Unit::TestCase
     # check policy against Figure 17.2(a)
     solver = check_grid_solutions model,
       ["> > >  ",
-       "^   ^  ", 
+       "^   ^  ",
        "^ < < <"]
 
     # check the actual (non-pretty) policy
@@ -305,9 +301,9 @@ class TestFiniteMDP < Test::Unit::TestCase
     model.check_transition_probabilities_sum
     assert_equal Set[], model.terminal_states # no actual terminals
 
-    check_grid_solutions model, 
+    check_grid_solutions model,
       ["> > >  ",
-       "^   >  ", 
+       "^   >  ",
        "> > > ^"]
   end
 
@@ -322,9 +318,9 @@ class TestFiniteMDP < Test::Unit::TestCase
     model.check_transition_probabilities_sum
     assert_equal Set[], model.terminal_states # no actual terminals
 
-    check_grid_solutions model, 
+    check_grid_solutions model,
       ["> > >  ",
-       "^   ^  ", 
+       "^   ^  ",
        "^ > ^ <"]
   end
 
@@ -339,13 +335,13 @@ class TestFiniteMDP < Test::Unit::TestCase
     model.check_transition_probabilities_sum
     assert_equal Set[], model.terminal_states # no actual terminals
 
-    check_grid_solutions model, 
+    check_grid_solutions model,
       ["> > >  ",
-       "^   <  ", 
+       "^   <  ",
        "^ < < v"]
   end
 
-  class MyPoint 
+  class MyPoint
     include FiniteMDP::VectorValued
 
     def initialize x, y

metadata

@@ -1,45 +1,48 @@
 --- !ruby/object:Gem::Specification
 name: finite_mdp
 version: !ruby/object:Gem::Version
-  version: 0.1.1
-  prerelease: 
+  version: 0.2.0
 platform: ruby
 authors:
 - John Lees-Miller
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-02-13 00:00:00.000000000 Z
+date: 2016-08-05 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: narray
-  requirement: &85251730 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: 0.5.9
+        version: '0.6'
   type: :runtime
   prerelease: false
-  version_requirements: *85251730
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.6'
 - !ruby/object:Gem::Dependency
   name: gemma
-  requirement: &85251480 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - ">"
       - !ruby/object:Gem::Version
-        version: 2.1.0
+        version: '2'
   type: :development
   prerelease: false
-  version_requirements: *85251480
-description: ! 'This library provides several ways of describing a
-
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">"
+      - !ruby/object:Gem::Version
+        version: '2'
+description: |-
+  This library provides several ways of describing a
   finite Markov Decision Process (MDP) model (see FiniteMDP::Model) and some
-
   reasonably efficient implementations of policy iteration and value iteration to
-
-  solve it (see FiniteMDP::Solver).'
+  solve it (see FiniteMDP::Solver).
 email:
 - jdleesmiller@gmail.com
 executables: []
@@ -47,49 +50,41 @@ extensions: []
 extra_rdoc_files:
 - README.rdoc
 files:
+- README.rdoc
 - lib/finite_mdp.rb
-- lib/finite_mdp/solver.rb
-- lib/finite_mdp/version.rb
-- lib/finite_mdp/table_model.rb
 - lib/finite_mdp/hash_model.rb
 - lib/finite_mdp/model.rb
+- lib/finite_mdp/solver.rb
+- lib/finite_mdp/table_model.rb
 - lib/finite_mdp/vector_valued.rb
-- README.rdoc
+- lib/finite_mdp/version.rb
 - test/finite_mdp/finite_mdp_test.rb
 homepage: http://github.com/jdleesmiller/finite_mdp
 licenses: []
+metadata: {}
 post_install_message: 
 rdoc_options:
-- --main
+- "--main"
 - README.rdoc
-- --title
-- finite_mdp-0.1.1 Documentation
+- "--title"
+- finite_mdp-0.2.0 Documentation
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
-      segments:
-      - 0
-      hash: -310962355
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
       version: '0'
-      segments:
-      - 0
-      hash: -310962355
 requirements: []
 rubyforge_project: finite_mdp
-rubygems_version: 1.8.10
+rubygems_version: 2.4.5.1
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: Solve small, finite Markov Decision Process models.
 test_files:
 - test/finite_mdp/finite_mdp_test.rb
-has_rdoc: