File Coverage

blib/lib/Erlang/Parser/Node/BinOp.pm

Criterion	Covered	Total	%
statement	12	12	100.0
branch			n/a
condition	2	2	100.0
subroutine	2	2	100.0
pod	1	1	100.0
total	17	17	100.0

# Copyright 2011-2012 Yuki Izumi. ( anneli AT cpan DOT org )
# This is free software; you can redistribute it and/or modify it under the
# same terms as Perl itself.

package Erlang::Parser::Node::BinOp;

use Moose;
with 'Erlang::Parser::Node';

has 'op' => (is => 'rw', required => 1, isa => 'Str');
has 'a'  => (is => 'rw', required => 1, does => 'Erlang::Parser::Node');
has 'b'  => (is => 'rw', required => 1, does => 'Erlang::Parser::Node');

sub print {
	my ($self, $fh, $depth) = @_;
	$depth ||= 0;

	print $fh '(';
	$self->a->print($fh, $depth);

	print $fh ' ';
	print $fh $self->op;
	print $fh ' ';

	$self->b->print($fh, $depth);
	print $fh ')';
}

__PACKAGE__->meta->make_immutable;

=head1 NAME

Erlang::Parser::Node::BinOp - a binary operation

=head1 DESCRIPTION

An infix binary operation.

=head2 Accessors

=over 4

=item C<op>

The operation as a string (i.e. '+' for addition, '--' for list difference).

=item C<a>, C<b>

The first and second L<Erlang::Parser::Node> arguments to the operation.

=back

=head2 Methods

=over 4

=item C<print>

Pretty-prints the node to its filehandle argument.

=back

=head1 EXAMPLE

	1 + 1

=cut

1;

# vim: set sw=4 ts=4: