class SyntaxTree::FndPtn

def ===(other)
  other.is_a?(FndPtn) && constant === other.constant &&
    left === other.left && ArrayMatch.call(values, other.values) &&
    right === other.right
end

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

def child_nodes
  [constant, left, *values, right]
end

def copy(constant: nil, left: nil, values: nil, right: nil, location: nil)
  node =
    FndPtn.new(
      constant: constant || self.constant,
      left: left || self.left,
      values: values || self.values,
      right: right || self.right,
      location: location || self.location
    )
  node.comments.concat(comments.map(&:copy))
  node
end

def deconstruct_keys(_keys)
  {
    constant: constant,
    left: left,
    values: values,
    right: right,
    location: location,
    comments: comments
  }
end

def format(q)
  q.format(constant) if constant
  q.group do
    q.text("[")
    q.indent do
      q.breakable_empty
      q.text("*")
      q.format(left)
      q.comma_breakable
      q.seplist(values) { |value| q.format(value) }
      q.comma_breakable
      q.text("*")
      q.format(right)
    end
    q.breakable_empty
    q.text("]")
  end
end

def initialize(constant:, left:, values:, right:, location:)
  @constant = constant
  @left = left
  @values = values
  @right = right
  @location = location
  @comments = []
end