Parse a reachability graph and process it using Mustache templates. Example State 2/2398339604900326310: / steps = <<"TenantManager", "Loader">> / db_data = {} / now = 1 / pc = [ Tail |-> "tail_wait", TenantManager |-> "tenant_manager" ] / db_tenants = {"t1"} / input_data = { [tenant |-> "t1", data |-> "d1"], [tenant |-> "t2", data |-> "d2"] } Transition -8297134421408988195 --> 2398339604900326310

Required Ruby Version

~> 2

Authors

jarjuk

Versions

  1. 0.0.6

    1. source

      1. 0.0.6 source January 26, 2016 (14 KB)
  2. 0.0.5

    1. source

      1. 0.0.5 source December 25, 2015 (13.5 KB)
  3. 0.0.3

    1. source

      1. 0.0.3 source December 25, 2015 (13.5 KB)

SHA 256 checksum

← Previous version