synvert-core 1.4.0 → 1.6.0

data/lib/synvert/core/node_query/parser.racc.rb

@@ -1,306 +0,0 @@
-#
-# DO NOT MODIFY!!!!
-# This file is automatically generated by Racc 1.6.0
-# from Racc grammar file "".
-#
-
-require 'racc/parser.rb'
-module Synvert
-  module Core
-    module NodeQuery
-      class Parser < Racc::Parser
-
-    def initialize
-      @lexer = Lexer.new
-    end
-
-    def parse string
-      @lexer.parse string
-      do_parse
-    end
-
-    def next_token
-      @lexer.next_token
-    end
-##### State transition tables begin ###
-
-racc_action_table = [
-     7,     7,     6,     8,    10,    34,    14,     4,     5,    15,
-    26,    18,    24,    19,    20,    21,    14,    38,    39,    27,
-    28,    29,    30,    31,    32,    33,     7,    41,     7,     6,
-   nil,    34,   nil,     7,     4,     5,    26,   nil,    34,    35,
-   nil,   nil,   nil,    26,   nil,    27,    28,    29,    30,    31,
-    32,    33,    27,    28,    29,    30,    31,    32,    33,     7,
-     6,     7,     6,     7,     6,     4,     5,     4,     5,     4,
-     5 ]
-
-racc_action_check = [
-    21,     0,     0,     1,     4,    21,     7,     0,     0,     8,
-    21,    14,    21,    16,    17,    18,    20,    26,    36,    21,
-    21,    21,    21,    21,    21,    21,    24,    38,     2,     2,
-   nil,    24,   nil,    37,     2,     2,    24,   nil,    37,    24,
-   nil,   nil,   nil,    37,   nil,    24,    24,    24,    24,    24,
-    24,    24,    37,    37,    37,    37,    37,    37,    37,     5,
-     5,     6,     6,    10,    10,     5,     5,     6,     6,    10,
-    10 ]
-
-racc_action_pointer = [
-    -1,     3,    26,   nil,   -12,    57,    59,    -4,     9,   nil,
-    61,   nil,   nil,   nil,     6,   nil,    -4,     3,    -3,   nil,
-     6,    -2,   nil,   nil,    24,   nil,    -3,   nil,   nil,   nil,
-   nil,   nil,   nil,   nil,   nil,   nil,     3,    31,    14,   nil,
-   nil,   nil ]
-
-racc_action_default = [
-   -26,   -26,    -2,    -3,   -26,   -26,   -26,    -7,   -26,    -1,
-   -26,    -5,    -6,    -8,   -26,    42,   -26,   -26,   -26,    -4,
-   -10,   -26,    -9,   -11,   -26,   -16,   -26,   -18,   -19,   -20,
-   -21,   -22,   -23,   -24,   -25,   -12,   -26,   -15,   -26,   -13,
-   -14,   -17 ]
-
-racc_goto_table = [
-    25,    13,    36,    25,    11,    12,     1,    17,     9,    16,
-    23,   nil,   nil,   nil,    22,    40,    25 ]
-
-racc_goto_check = [
-     3,     4,     7,     3,     2,     2,     1,     5,     1,     2,
-     6,   nil,   nil,   nil,     4,     7,     3 ]
-
-racc_goto_pointer = [
-   nil,     6,    -1,   -21,    -6,    -7,   -11,   -22 ]
-
-racc_goto_default = [
-   nil,   nil,     2,     3,   nil,   nil,    37,   nil ]
-
-racc_reduce_table = [
-  0, 0, :racc_error,
-  2, 29, :_reduce_1,
-  1, 29, :_reduce_2,
-  1, 30, :_reduce_3,
-  4, 30, :_reduce_4,
-  2, 30, :_reduce_5,
-  2, 30, :_reduce_6,
-  1, 31, :_reduce_7,
-  2, 31, :_reduce_8,
-  4, 32, :_reduce_9,
-  3, 32, :_reduce_10,
-  3, 33, :_reduce_11,
-  4, 33, :_reduce_12,
-  5, 33, :_reduce_13,
-  2, 35, :_reduce_14,
-  1, 35, :_reduce_15,
-  1, 34, :_reduce_none,
-  3, 34, :_reduce_17,
-  1, 34, :_reduce_18,
-  1, 34, :_reduce_19,
-  1, 34, :_reduce_20,
-  1, 34, :_reduce_21,
-  1, 34, :_reduce_22,
-  1, 34, :_reduce_23,
-  1, 34, :_reduce_24,
-  1, 34, :_reduce_25 ]
-
-racc_reduce_n = 26
-
-racc_shift_n = 42
-
-racc_token_table = {
-  false => 0,
-  :error => 1,
-  :tNODE_TYPE => 2,
-  :tGOTO_SCOPE => 3,
-  :tATTRIBUTE => 4,
-  :tKEY => 5,
-  :tIDENTIFIER => 6,
-  :tIDENTIFIER_VALUE => 7,
-  :tPSEUDO_CLASS => 8,
-  :tRELATIONSHIP => 9,
-  :tOPEN_ATTRIBUTE => 10,
-  :tCLOSE_ATTRIBUTE => 11,
-  :tOPEN_DYNAMIC_ATTRIBUTE => 12,
-  :tCLOSE_DYNAMIC_ATTRIBUTE => 13,
-  :tOPEN_ARRAY => 14,
-  :tCLOSE_ARRAY => 15,
-  :tOPEN_SELECTOR => 16,
-  :tCLOSE_SELECTOR => 17,
-  :tOPERATOR => 18,
-  :tARRAY_VALUE => 19,
-  :tDYNAMIC_ATTRIBUTE => 20,
-  :tBOOLEAN => 21,
-  :tFLOAT => 22,
-  :tINTEGER => 23,
-  :tNIL => 24,
-  :tREGEXP => 25,
-  :tSTRING => 26,
-  :tSYMBOL => 27 }
-
-racc_nt_base = 28
-
-racc_use_result_var = false
-
-Racc_arg = [
-  racc_action_table,
-  racc_action_check,
-  racc_action_default,
-  racc_action_pointer,
-  racc_goto_table,
-  racc_goto_check,
-  racc_goto_default,
-  racc_goto_pointer,
-  racc_nt_base,
-  racc_reduce_table,
-  racc_token_table,
-  racc_shift_n,
-  racc_reduce_n,
-  racc_use_result_var ]
-
-Racc_token_to_s_table = [
-  "$end",
-  "error",
-  "tNODE_TYPE",
-  "tGOTO_SCOPE",
-  "tATTRIBUTE",
-  "tKEY",
-  "tIDENTIFIER",
-  "tIDENTIFIER_VALUE",
-  "tPSEUDO_CLASS",
-  "tRELATIONSHIP",
-  "tOPEN_ATTRIBUTE",
-  "tCLOSE_ATTRIBUTE",
-  "tOPEN_DYNAMIC_ATTRIBUTE",
-  "tCLOSE_DYNAMIC_ATTRIBUTE",
-  "tOPEN_ARRAY",
-  "tCLOSE_ARRAY",
-  "tOPEN_SELECTOR",
-  "tCLOSE_SELECTOR",
-  "tOPERATOR",
-  "tARRAY_VALUE",
-  "tDYNAMIC_ATTRIBUTE",
-  "tBOOLEAN",
-  "tFLOAT",
-  "tINTEGER",
-  "tNIL",
-  "tREGEXP",
-  "tSTRING",
-  "tSYMBOL",
-  "$start",
-  "expression",
-  "selector",
-  "basic_selector",
-  "attribute_list",
-  "attribute",
-  "value",
-  "array_value" ]
-
-Racc_debug_parser = false
-
-##### State transition tables end #####
-
-# reduce 0 omitted
-
-def _reduce_1(val, _values)
- Compiler::Expression.new(selector: val[0], rest: val[1])
-end
-
-def _reduce_2(val, _values)
- Compiler::Expression.new(selector: val[0])
-end
-
-def _reduce_3(val, _values)
- Compiler::Selector.new(basic_selector: val[0])
-end
-
-def _reduce_4(val, _values)
- Compiler::Selector.new(pseudo_class: val[0], pseudo_selector: val[2])
-end
-
-def _reduce_5(val, _values)
- Compiler::Selector.new(relationship: val[0], rest: val[1])
-end
-
-def _reduce_6(val, _values)
- Compiler::Selector.new(goto_scope: val[0], rest: val[1])
-end
-
-def _reduce_7(val, _values)
- Compiler::BasicSelector.new(node_type: val[0])
-end
-
-def _reduce_8(val, _values)
- Compiler::BasicSelector.new(node_type: val[0], attribute_list: val[1])
-end
-
-def _reduce_9(val, _values)
- Compiler::AttributeList.new(attribute: val[1], rest: val[3])
-end
-
-def _reduce_10(val, _values)
- Compiler::AttributeList.new(attribute: val[1])
-end
-
-def _reduce_11(val, _values)
- Compiler::Attribute.new(key: val[0], value: val[2], operator: val[1])
-end
-
-def _reduce_12(val, _values)
- Compiler::Attribute.new(key: val[0], value: Compiler::Array.new, operator: val[1])
-end
-
-def _reduce_13(val, _values)
- Compiler::Attribute.new(key: val[0], value: val[3], operator: val[1])
-end
-
-def _reduce_14(val, _values)
- Compiler::Array.new(value: val[0], rest: val[1])
-end
-
-def _reduce_15(val, _values)
- Compiler::Array.new(value: val[0])
-end
-
-# reduce 16 omitted
-
-def _reduce_17(val, _values)
- Compiler::DynamicAttribute.new(value: val[1])
-end
-
-def _reduce_18(val, _values)
- Compiler::Boolean.new(value: val[0])
-end
-
-def _reduce_19(val, _values)
- Compiler::Float.new(value: val[0])
-end
-
-def _reduce_20(val, _values)
- Compiler::Integer.new(value: val[0])
-end
-
-def _reduce_21(val, _values)
- Compiler::Nil.new(value: val[0])
-end
-
-def _reduce_22(val, _values)
- Compiler::Regexp.new(value: val[0])
-end
-
-def _reduce_23(val, _values)
- Compiler::String.new(value: val[0])
-end
-
-def _reduce_24(val, _values)
- Compiler::Symbol.new(value: val[0])
-end
-
-def _reduce_25(val, _values)
- Compiler::Identifier.new(value: val[0])
-end
-
-def _reduce_none(val, _values)
-  val[0]
-end
-
-      end   # class Parser
-    end   # module NodeQuery
-  end   # module Core
-end   # module Synvert

data/lib/synvert/core/node_query/parser.y

@@ -1,60 +0,0 @@
-class Synvert::Core::NodeQuery::Parser
-options no_result_var
-token tNODE_TYPE tGOTO_SCOPE tATTRIBUTE tKEY tIDENTIFIER tIDENTIFIER_VALUE tPSEUDO_CLASS tRELATIONSHIP
-      tOPEN_ATTRIBUTE tCLOSE_ATTRIBUTE tOPEN_DYNAMIC_ATTRIBUTE tCLOSE_DYNAMIC_ATTRIBUTE
-      tOPEN_ARRAY tCLOSE_ARRAY tOPEN_SELECTOR tCLOSE_SELECTOR
-      tOPERATOR tARRAY_VALUE tDYNAMIC_ATTRIBUTE tBOOLEAN tFLOAT tINTEGER tNIL tREGEXP tSTRING tSYMBOL
-rule
-  expression
-    : selector expression { Compiler::Expression.new(selector: val[0], rest: val[1]) }
-    | selector { Compiler::Expression.new(selector: val[0]) }
-
-  selector
-    : basic_selector { Compiler::Selector.new(basic_selector: val[0]) }
-    | tPSEUDO_CLASS tOPEN_SELECTOR selector tCLOSE_SELECTOR { Compiler::Selector.new(pseudo_class: val[0], pseudo_selector: val[2]) }
-    | tRELATIONSHIP selector { Compiler::Selector.new(relationship: val[0], rest: val[1]) }
-    | tGOTO_SCOPE selector { Compiler::Selector.new(goto_scope: val[0], rest: val[1]) }
-
-  basic_selector
-    : tNODE_TYPE { Compiler::BasicSelector.new(node_type: val[0]) }
-    | tNODE_TYPE attribute_list { Compiler::BasicSelector.new(node_type: val[0], attribute_list: val[1]) }
-
-  attribute_list
-    : tOPEN_ATTRIBUTE attribute tCLOSE_ATTRIBUTE attribute_list { Compiler::AttributeList.new(attribute: val[1], rest: val[3]) }
-    | tOPEN_ATTRIBUTE attribute tCLOSE_ATTRIBUTE { Compiler::AttributeList.new(attribute: val[1]) }
-
-  attribute
-    : tKEY tOPERATOR value { Compiler::Attribute.new(key: val[0], value: val[2], operator: val[1]) }
-    | tKEY tOPERATOR tOPEN_ARRAY tCLOSE_ARRAY { Compiler::Attribute.new(key: val[0], value: Compiler::Array.new, operator: val[1]) }
-    | tKEY tOPERATOR tOPEN_ARRAY array_value tCLOSE_ARRAY { Compiler::Attribute.new(key: val[0], value: val[3], operator: val[1]) }
-
-  array_value
-    : value array_value { Compiler::Array.new(value: val[0], rest: val[1]) }
-    | value { Compiler::Array.new(value: val[0]) }
-
-  value
-    : basic_selector
-    | tOPEN_DYNAMIC_ATTRIBUTE tDYNAMIC_ATTRIBUTE tCLOSE_DYNAMIC_ATTRIBUTE { Compiler::DynamicAttribute.new(value: val[1]) }
-    | tBOOLEAN { Compiler::Boolean.new(value: val[0]) }
-    | tFLOAT { Compiler::Float.new(value: val[0]) }
-    | tINTEGER { Compiler::Integer.new(value: val[0])}
-    | tNIL { Compiler::Nil.new(value: val[0]) }
-    | tREGEXP { Compiler::Regexp.new(value: val[0]) }
-    | tSTRING { Compiler::String.new(value: val[0]) }
-    | tSYMBOL { Compiler::Symbol.new(value: val[0]) }
-    | tIDENTIFIER_VALUE { Compiler::Identifier.new(value: val[0]) }
-end
-
----- inner
-    def initialize
-      @lexer = Lexer.new
-    end
-
-    def parse string
-      @lexer.parse string
-      do_parse
-    end
-
-    def next_token
-      @lexer.next_token
-    end

data/lib/synvert/core/node_query.rb

@@ -1,36 +0,0 @@
-# frozen_string_literal: true
-
-# NodeQuery defines a node query language, which is a css like syntax for matching nodes.
-#
-# It supports the following selectors:
-#
-# * AST node type: +.class+, +.send+
-# * attribute value: +.send[receiver = nil]+, +.send[message = create]+
-# * attribute regex: <code>.send[key=~/\A:([^'"]+)\z/]</code>, <code>.send[key!~/\A:([^'"]+)\z/]</code>
-# * attribute conditions: +.send[message != nil]+, +.send[value > 1]+, +.send[value >= 1]+, +.send[value < 1]+, +.send[value <= 1]+
-# * nested attribute: +.send[caller.message = map]+, +.send[arguments.size = 2]+
-# * descendant: +.class .send+
-# * child: +.class > .def+
-# * following sibling: <code>.def + .def</code>
-# * subsequnt sibling: +.def ~ .def+
-# * has: +.class:has(.def)+
-#
-# It also supports some custom selectors:
-#
-# * not_has: +.class:not_has(.def)+, it's same as +:not(:has())+ in css, just to make implementation easy.
-# * nested selector: +.send[arguments = [size = 2][first = .sym][last = .hash]]+
-# * array value: +.send[arguments = (a b)]+
-# * IN operator: +.send[message IN (try try!)]+
-# * NOT IN operator: +.send[message NOT IN (create build)]+
-# * INCLUDES operator: +.send[arguments INCLUDES &block]+
-# * dynamic attribute value: +.hash > .pair[key={{value}}]+
-# * goto scope: +.class body > .def+
-#
-# @example
-#   # it matches methods call nodes, like `puts message` or `p message`
-#   Synvert::Core::NodeQuery::Parser.parse('.send[receiver = nil][message IN (puts, p)]').query_nodes(node)
-module Synvert::Core::NodeQuery
-  autoload :Compiler, 'synvert/core/node_query/compiler'
-  autoload :Lexer, 'synvert/core/node_query/lexer.rex'
-  autoload :Parser, 'synvert/core/node_query/parser.racc'
-end

data/lib/synvert/core/rewriter/action/append_action.rb

@@ -1,28 +0,0 @@
-# frozen_string_literal: true
-
-module Synvert::Core
-  # AppendAction appends code to the bottom of node body.
-  class Rewriter::AppendAction < Rewriter::Action
-    private
-
-    END_LENGTH = "\nend".length
-
-    # Calculate the begin the end positions.
-    def calculate_position
-      @begin_pos = :begin == @node.type ? @node.loc.expression.end_pos : @node.loc.expression.end_pos - @node.column - END_LENGTH
-      @end_pos = @begin_pos
-    end
-
-    # Indent of the node.
-    #
-    # @param node [Parser::AST::Node]
-    # @return [String] n times whitesphace
-    def indent(node)
-      if %i[block class def defs].include? node.type
-        ' ' * (node.column + DEFAULT_INDENT)
-      else
-        ' ' * node.column
-      end
-    end
-  end
-end

data/lib/synvert/core/rewriter/action/delete_action.rb

@@ -1,34 +0,0 @@
-# frozen_string_literal: true
-
-module Synvert::Core
-  # DeleteAction deletes child nodes.
-  class Rewriter::DeleteAction < Rewriter::Action
-    # Initialize a DeleteAction.
-    #
-    # @param instance [Synvert::Core::Rewriter::Instance]
-    # @param selectors [Array<Symbol, String>] used to select child nodes
-    # @option and_comma [Boolean] delete extra comma.
-    def initialize(instance, *selectors, and_comma: false)
-      super(instance, nil)
-      @selectors = selectors
-      @and_comma = and_comma
-    end
-
-    # The rewritten code, always empty string.
-    def rewritten_code
-      ''
-    end
-
-    private
-
-    # Calculate the begin and end positions.
-    def calculate_position
-      @begin_pos = @selectors.map { |selector| @node.child_node_range(selector) }
-                             .compact.map(&:begin_pos).min
-      @end_pos = @selectors.map { |selector| @node.child_node_range(selector) }
-                           .compact.map(&:end_pos).max
-      squeeze_spaces
-      remove_comma if @and_comma
-    end
-  end
-end

data/lib/synvert/core/rewriter/action/insert_action.rb

@@ -1,34 +0,0 @@
-# frozen_string_literal: true
-
-module Synvert::Core
-  # InsertAction to add code to the node.
-  class Rewriter::InsertAction < Rewriter::Action
-    # Initialize an InsertAction.
-    #
-    # @param instance [Synvert::Core::Rewriter::Instance]
-    # @param code [String] to be inserted
-    # @param at [String] position to insert, beginning or end
-    # @param to [<Symbol|String>] name of child node
-    def initialize(instance, code, at: 'end', to: nil)
-      super(instance, code)
-      @at = at
-      @to = to
-    end
-
-    # The rewritten source code.
-    #
-    # @return [String] rewritten code.
-    def rewritten_code
-      rewritten_source
-    end
-
-    private
-
-    # Calculate the begin and end positions.
-    def calculate_position
-      node_range = @to ? @node.child_node_range(@to) : @node.loc.expression
-      @begin_pos = @at == 'end' ? node_range.end_pos : node_range.begin_pos
-      @end_pos = @begin_pos
-    end
-  end
-end

data/lib/synvert/core/rewriter/action/insert_after_action.rb

@@ -1,22 +0,0 @@
-# frozen_string_literal: true
-
-module Synvert::Core
-  # InsertAfterAction to insert code next to the node.
-  class Rewriter::InsertAfterAction < Rewriter::Action
-    private
-
-    # Calculate the begin and end positions.
-    def calculate_position
-      @begin_pos = @node.loc.expression.end_pos
-      @end_pos = @begin_pos
-    end
-
-    # Indent of the node.
-    #
-    # @param node [Parser::AST::Node]
-    # @return [String] n times whitesphace
-    def indent(node)
-      ' ' * node.column
-    end
-  end
-end

data/lib/synvert/core/rewriter/action/prepend_action.rb

@@ -1,44 +0,0 @@
-# frozen_string_literal: true
-
-module Synvert::Core
-  # PrependAction to prepend code to the top of node body.
-  class Rewriter::PrependAction < Rewriter::Action
-    private
-
-    DO_LENGTH = ' do'.length
-
-    # Calculate the begin and end positions.
-    def calculate_position
-      @begin_pos =
-        case @node.type
-        when :block
-          if @node.children[1].children.empty?
-            @node.children[0].loc.expression.end_pos + DO_LENGTH
-          else
-            @node.children[1].loc.expression.end_pos
-          end
-        when :class
-          @node.children[1] ? @node.children[1].loc.expression.end_pos : @node.children[0].loc.expression.end_pos
-        when :def
-          @node.children[1].empty? ? @node.loc.name.end_pos : @node.children[1].loc.expression.end_pos
-        when :defs
-          @node.children[2].empty? ? @node.loc.name.end_pos : @node.children[2].loc.expression.end_pos
-        else
-          @node.children.last.loc.expression.end_pos
-        end
-      @end_pos = @begin_pos
-    end
-
-    # Indent of the node.
-    #
-    # @param node [Parser::AST::Node]
-    # @return [String] n times whitesphace
-    def indent(node)
-      if %i[block class def defs].include?(node.type)
-        ' ' * (node.column + DEFAULT_INDENT)
-      else
-        ' ' * node.column
-      end
-    end
-  end
-end

data/lib/synvert/core/rewriter/action/remove_action.rb

@@ -1,56 +0,0 @@
-# frozen_string_literal: true
-
-module Synvert::Core
-  # RemoveAction to remove current node.
-  class Rewriter::RemoveAction < Rewriter::Action
-    # Initialize a RemoveAction.
-    #
-    # @param instance [Synvert::Core::Rewriter::RemoveAction]
-    # @param options [Hash] options.
-    # @option and_comma [Boolean] delete extra comma.
-    def initialize(instance, and_comma: false)
-      super(instance, nil)
-      @and_comma = and_comma
-    end
-
-    # The rewritten code, always empty string.
-    def rewritten_code
-      ''
-    end
-
-    private
-
-    # Calculate the begin the end positions.
-    def calculate_position
-      if take_whole_line?
-        @begin_pos = start_index
-        @end_pos = end_index
-        squeeze_lines
-      else
-        @begin_pos = @node.loc.expression.begin_pos
-        @end_pos = @node.loc.expression.end_pos
-        squeeze_spaces
-        remove_comma if @and_command
-      end
-    end
-
-    # Check if the source code of current node takes the whole line.
-    #
-    # @return [Boolean]
-    def take_whole_line?
-      @node.to_source == file_source[start_index...end_index].strip
-    end
-
-    # Get the start position of the line
-    def start_index
-      index = file_source[0..@node.loc.expression.begin_pos].rindex("\n")
-      index ? index + "\n".length : @node.loc.expression.begin_pos
-    end
-
-    # Get the end position of the line
-    def end_index
-      index = file_source[@node.loc.expression.end_pos..-1].index("\n")
-      index ? @node.loc.expression.end_pos + index + "\n".length : @node.loc.expression.end_pos
-    end
-  end
-end

data/lib/synvert/core/rewriter/action/replace_action.rb

@@ -1,33 +0,0 @@
-# frozen_string_literal: true
-
-module Synvert::Core
-  # ReplaceAction to replace child node with code.
-  class Rewriter::ReplaceAction < Rewriter::Action
-    # Initailize a ReplaceAction.
-    #
-    # @param instance [Synvert::Core::Rewriter::Instance]
-    # @param selectors [Array<Symbol|String>] used to select child nodes
-    # @param with [String] the new code
-    def initialize(instance, *selectors, with:)
-      super(instance, with)
-      @selectors = selectors
-    end
-
-    # The rewritten source code.
-    #
-    # @return [String] rewritten code.
-    def rewritten_code
-      rewritten_source
-    end
-
-    private
-
-    # Calculate the begin the end positions.
-    def calculate_position
-      @begin_pos = @selectors.map { |selector| @node.child_node_range(selector).begin_pos }
-                             .min
-      @end_pos = @selectors.map { |selector| @node.child_node_range(selector).end_pos }
-                           .max
-    end
-  end
-end

data/lib/synvert/core/rewriter/action/replace_with_action.rb

@@ -1,36 +0,0 @@
-# frozen_string_literal: true
-
-module Synvert::Core
-  # ReplaceWithAction to replace code.
-  class Rewriter::ReplaceWithAction < Rewriter::Action
-    # The rewritten source code with proper indent.
-    #
-    # @return [String] rewritten code.
-    def rewritten_code
-      if rewritten_source.include?("\n")
-        new_code = []
-        rewritten_source.split("\n").each_with_index do |line, index|
-          new_code << (index == 0 ? line : indent + line)
-        end
-        new_code.join("\n")
-      else
-        rewritten_source
-      end
-    end
-
-    private
-
-    # Calculate the begin the end positions.
-    def calculate_position
-      @begin_pos = @node.loc.expression.begin_pos
-      @end_pos = @node.loc.expression.end_pos
-    end
-
-    # Indent of the node
-    #
-    # @return [String] n times whitesphace
-    def indent
-      ' ' * @node.column
-    end
-  end
-end