class SyntaxTree::In

def ===(other)
  other.is_a?(In) && pattern === other.pattern &&
    statements === other.statements && consequent === other.consequent
end

def accept(visitor)
  visitor.visit_in(self)
end

def child_nodes
  [pattern, statements, consequent]
end

def copy(pattern: nil, statements: nil, consequent: nil, location: nil)
  node =
    In.new(
      pattern: pattern || self.pattern,
      statements: statements || self.statements,
      consequent: consequent || self.consequent,
      location: location || self.location
    )
  node.comments.concat(comments.map(&:copy))
  node
end

def deconstruct_keys(_keys)
  {
    pattern: pattern,
    statements: statements,
    consequent: consequent,
    location: location,
    comments: comments
  }
end

def format(q)
  keyword = "in "
  pattern = self.pattern
  consequent = self.consequent
  q.group do
    q.text(keyword)
    q.nest(keyword.length) { q.format(pattern) }
    q.text(" then") if pattern.is_a?(RangeNode) && pattern.right.nil?
    unless statements.empty?
      q.indent do
        q.breakable_force
        q.format(statements)
      end
    end
    if consequent
      q.breakable_force
      q.format(consequent)
    end
  end
end

def initialize(pattern:, statements:, consequent:, location:)
  @pattern = pattern
  @statements = statements
  @consequent = consequent
  @location = location
  @comments = []
end