Emu is a composable decoder and type coercion library. It can be used to
transform Rails' params
, the result of JSON.parse
or any other input type
to objects your business logic understands.
Its design is inspired by Elm's
Json.Decode
library in particular and parser
combinators in general.
The three main differences are:
Emu
is completely composable – there's no arbitrary difference between decoders which return objects and decoders which return simple types. All emus are equal!Emu
isn't restricted by a 1:1 relationship between input attributes and output attributes – you can transform the input structure in any way you desire.Emu
abstains from using a DSL. Everything can be accomplished by a combination of method definitions and variable assignments. In particular there's no need forLibrary.register_type
calls.
Add this line to your application's Gemfile:
gem 'emu'
And then execute:
$ bundle
Or install it yourself as:
$ gem install emu
Here's an example converting a Hash
with some wind speed and direction data into a single vector describing both
parameters at once.
require 'emu'
direction =
(Emu.match('N') > [0, -1]) |
(Emu.match('E') > [-1, 0]) |
(Emu.match('S') > [0, 1]) |
(Emu.match('W') > [1, 0])
speed = Emu.str_to_float
wind = Emu.map_n(
Emu.from_key(:direction, direction),
Emu.from_key(:speed, speed)) do |(x, y), speed|
[x * speed, y * speed]
end
params = {
direction: "W",
speed: "4.5"
}
wind.run!(params) # => [4.5, 0.0]
This small example highlights almost all the features of Emu
, hence there's a lot going on. So, let's break it down:
For a quick overview of the most common use cases, skip to TODO.
All methods defined on the module Emu
return a Emu::Decoder
. A Emu::Decoder
is a glorified lambda which can be run at a later time using run!
. A decoder can either succeed or fail with a Emu::DecodeError
exception:
decoder = Emu.str_to_int # a decoder converting strings to integers
decoder.run!("42") # => 42
decoder.run!("foo") # => raise DecodeError, '`"foo"` is not an Integer'
The individual decoders defined on Emu
can be split into two parts:
- Basic decoders, e.g.
str_to_int
which takes a String and tries to convert it into an Integer and - Higher order decoders which take other decoders and wrap/manipulate them.
string
integer
float
boolean
raw
Just like "higher order functions" describe functions which take other functions as input "higher order decoders" describe decoders which take other decoders as input.
fmap
- ...
For decoding a Hash you use a combination of from_key(x, d)
(to decode the value at key x
using the decoder d
) and map_n
to combine
multiple decoders into one:
decoder = Emu.map_n(
Emu.from_key(:x, Emu.str_to_int),
Emu.from_key(:y, Emu.str_to_int)
) do |x, y|
[x, y]
end
params = {
x: "32",
y: "2"
}
Emu.from_key(:x, Emu.str_to_int).run!(params) # => 32
decoder.run!(params) # => [32, 2]
This gives you full control over optional keys, how to handle nil
-values and makes it possible to map n
keys to y
values.
You can build any decoder you want out of a combination of raw
, #then
, succeed
and fail
. For example the following
describes a decoder which maps the input "foo"
to 123
and fails for any other input.
Emu.raw.then do |input|
if input == "foo"
Emu.succeed(123)
else
Emu.fail("bla")
end
end
Usually you want to make use of existing decoders which handle coercing instead of building one with raw
from scratch.
For example the decoder which converts a String to a positive integer can be expressed as follows:
Emu.str_to_int.then do |n|
if n > 0
Emu.succeed(n)
else
Emu.fail("#{int.inspect} must be positive")
end
end
Converting 0-based indices to 1-based ones, uppercasing some string, converting from one (physical) unit to another, ... are all
reasons where you want to run some function on a decoded value. That's what fmap
provides:
zero_based_index = Emu.str_to_int
one_based_index = zero_based_index.fmap { |i| i + 1}
zero_based_index.run!("12") # => 12
one_based_index.run!("12") # => 13
Note: You can't change the status of a decoder from success to failure by using only Decoder#fmap
. You need then
for that
When decoding recursive structures we quickly run into the issue of endless recursion:
{
name: 'Elvis Presley',
parent: {
name: 'R2D2',
parent: {
name: 'Barack Obama'
parent: nil
}
}
}
# person will be nil on the right-hand side => runtime error
person =
Emu.map_n(
Emu.from_key(:name, Emu.string),
Emu.from_key(:parent, Emu.nil | person)) do |name, parent|
Person.new(name, parent)
end
# person calls itself => infinite recursion
def person
Emu.map_n(
Emu.from_key(:name, Emu.string),
Emu.from_key(:parent, Emu.nil | person)) do |name, parent|
Person.new(name, parent)
end
end
This can be solved by wrapping the recursive call in lazy
:
person =
Emu.map_n(
Emu.from_key(:name, Emu.string),
Emu.from_key(:parent, Emu.nil | Emu.lazy { person })) do |name, parent|
Person.new(name, parent)
end
lazy
takes a block which is only evaluated once you call run
on the decoder. This avoids funky behavior when defining recursive decoders.
After checking out the repo, run bin/setup
to install dependencies. Then, run rake test
to run the tests. You can also run bin/console
for an interactive prompt that will allow you to experiment.
To install this gem onto your local machine, run bundle exec rake install
. To release a new version, update the version number in version.rb
, and then run bundle exec rake release
, which will create a git tag for the version, push git commits and tags, and push the .gem
file to rubygems.org.
Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/emu.
The gem is available as open source under the terms of the MIT License.