micromachine 1.0.4 → 1.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 707ffde016887ae675ddd25388e8ca9376cb1547
+  data.tar.gz: 301bcfd9f251f538dbc5b170660e022f1aa6089c
+SHA512:
+  metadata.gz: 2f2c63e4af76fe25a6aa7ecf16d3731f9513745a8fe74fb626961340edb63be2f5ded471194d0334b0c2f0581e7151e961ef98ad858c9b9e43ad37c54e2fc549
+  data.tar.gz: 8acbe242c04c4f96b6e981a8ef15275dbf6fdb5297dbb6120d7d55d0432ebe9e2f1a91f2f4bb5b6485bd71bde66ccc2b85b5db03d301e8bab5bc3586e2ffa290

data/lib/micromachine.rb

@@ -38,6 +38,10 @@ class MicroMachine
     transitions_for.keys
   end
 
+  def states
+    events.map { |e| transitions_for[e].to_a }.flatten.uniq
+  end
+
   def ==(some_state)
     state == some_state
   end

data/micromachine.gemspec

@@ -1,6 +1,6 @@
 Gem::Specification.new do |s|
   s.name = 'micromachine'
-  s.version = '1.0.4'
+  s.version = '1.1.0'
   s.summary = %{Minimal Finite State Machine.}
   s.description = %Q{There are many finite state machine implementations for Ruby, and they all provide a nice DSL for declaring events, exceptions, callbacks, and all kinds of niceties in general.\n\nBut if all you want is a finite state machine, look no further: this has less than 50 lines of code and provides everything a finite state machine must have, and nothing more.}
   s.author = "Michel Martens"

metadata

@@ -1,35 +1,33 @@
 --- !ruby/object:Gem::Specification
 name: micromachine
 version: !ruby/object:Gem::Version
-  version: 1.0.4
-  prerelease: 
+  version: 1.1.0
 platform: ruby
 authors:
 - Michel Martens
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-05-15 00:00:00.000000000 Z
+date: 2013-08-08 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: contest
-  requirement: &2152016720 !ruby/object:Gem::Requirement
-    none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *2152016720
-description: ! 'There are many finite state machine implementations for Ruby, and
-  they all provide a nice DSL for declaring events, exceptions, callbacks, and all
-  kinds of niceties in general.
-
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: |-
+  There are many finite state machine implementations for Ruby, and they all provide a nice DSL for declaring events, exceptions, callbacks, and all kinds of niceties in general.
 
-  But if all you want is a finite state machine, look no further: this has less than
-  50 lines of code and provides everything a finite state machine must have, and nothing
-  more.'
+  But if all you want is a finite state machine, look no further: this has less than 50 lines of code and provides everything a finite state machine must have, and nothing more.
 email: michel@soveran.com
 executables: []
 extensions: []
@@ -42,26 +40,25 @@ files:
 - micromachine.gemspec
 homepage: http://github.com/soveran/micromachine
 licenses: []
+metadata: {}
 post_install_message: 
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 1.8.11
+rubygems_version: 2.0.3
 signing_key: 
-specification_version: 3
+specification_version: 4
 summary: Minimal Finite State Machine.
 test_files: []