free_mutant/lib/mutant/mutator/node.rb

179 lines
4 KiB
Ruby
Raw Normal View History

# frozen_string_literal: true
2018-09-12 13:15:43 +00:00
module Mutant
2013-07-29 17:34:02 -07:00
# Generator for mutations
class Mutator
2013-07-29 17:34:02 -07:00
# Abstract base class for node mutators
class Node < self
include AbstractType, Unparser::Constants
include AST::NamedChildren, AST::NodePredicates, AST::Sexp, AST::Nodes
TAUTOLOGY = ->(_input) { true }
# Helper to define a named child
#
# @param [Parser::AST::Node] node
2013-06-21 15:02:47 +02:00
#
# @param [Integer] index
2013-06-21 15:02:47 +02:00
#
# @return [undefined]
def self.define_named_child(name, index)
super
2013-06-21 15:02:47 +02:00
define_method(:"emit_#{name}_mutations") do |&block|
mutate_child(index, &block)
2013-06-21 15:02:47 +02:00
end
define_method(:"emit_#{name}") do |node|
2013-06-21 15:02:47 +02:00
emit_child_update(index, node)
end
end
2014-07-14 13:46:55 +00:00
private_class_method :define_named_child
2013-06-21 15:02:47 +02:00
private
# Node to mutate
#
# @return [Parser::AST::Node]
alias_method :node, :input
# Duplicate of original
#
# @return [Parser::AST::Node]
alias_method :dup_node, :dup_input
# Original nodes children
#
# @return [Array<Parser::AST::Node>]
def children
node.children
end
# Dispatch on child index
#
# @param [Integer] index
#
# @return [undefined]
def mutate_child(index, &block)
block ||= TAUTOLOGY
Mutator.mutate(children.fetch(index), self).each do |mutation|
2014-06-08 13:01:26 +00:00
next unless block.call(mutation)
emit_child_update(index, mutation)
end
end
2013-06-14 18:22:34 +02:00
# Emit delete child mutation
#
# @param [Integer] index
2013-06-14 18:22:34 +02:00
#
# @return [undefined]
def delete_child(index)
dup_children = children.dup
dup_children.delete_at(index)
2014-06-03 03:51:22 +00:00
emit_type(*dup_children)
2013-06-14 18:22:34 +02:00
end
# Emit updated child
#
# @param [Integer] index
2013-07-05 03:01:59 +02:00
# @param [Parser::AST::Node] node
#
# @return [undefined]
2013-07-05 03:01:59 +02:00
def emit_child_update(index, node)
new_children = children.dup
new_children[index] = node
2014-06-03 03:51:22 +00:00
emit_type(*new_children)
end
# Emit a new AST node with same class as wrapped node
#
# @param [Array<Parser::AST::Node>] children
#
2013-06-15 16:37:43 +02:00
# @return [undefined]
2014-06-03 03:51:22 +00:00
def emit_type(*children)
emit(::Parser::AST::Node.new(node.type, children))
end
# Emit propagation if node can stand alone
#
# @return [undefined]
def emit_propagation(node)
emit(node) unless AST::Types::NOT_STANDALONE.include?(node.type)
end
# Emit singleton literals
#
# @return [undefined]
def emit_singletons
emit_nil
emit_self
end
# Emit a literal self
#
# @return [undefined]
def emit_self
emit(N_SELF)
end
# Emit a literal nil
#
2013-06-25 00:33:28 -07:00
# @return [undefined]
def emit_nil
2014-04-04 14:35:42 -04:00
emit(N_NIL) unless asgn_left?
end
# Parent node
2014-06-10 13:42:47 +00:00
#
# @return [Parser::AST::Node] node
2014-08-07 09:35:30 -07:00
# if parent with node is present
2014-06-10 13:42:47 +00:00
#
# @return [nil]
# otherwise
def parent_node
parent&.node
2014-06-10 13:42:47 +00:00
end
# Parent type
#
# @return [Symbol] type
# if parent with type is present
#
# @return [nil]
# otherwise
def parent_type
parent_node&.type
end
# Test if the node is the left of an or_asgn or op_asgn
#
# @return [Boolean]
2014-04-04 14:35:42 -04:00
def asgn_left?
AST::Types::OP_ASSIGN.include?(parent_type) && parent.node.children.first.equal?(node)
end
# Children indices
#
# @param [Range] range
#
# @return [Enumerable<Integer>]
def children_indices(range)
range.begin.upto(children.length + range.end)
end
# Emit single child mutation
#
# @return [undefined]
def mutate_single_child
children.each_with_index do |child, index|
mutate_child(index)
yield child, index unless children.one?
end
end
end # Node
end # Mutator
end # Mutant