Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://ruby-syntax-tree.github.io/syntax_tree/SyntaxTree/IfNode.html below:

class SyntaxTree::IfNode - RDoc Documentation

1. SyntaxTree::
2. IfNode

If represents the first clause in an if chain.

if predicate
end

nil | Elsif | Else

the next clause in the chain

Node

the expression to be checked

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

def ===(other)
  other.is_a?(IfNode) && predicate === other.predicate &&
    statements === other.statements && consequent === other.consequent
end

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

def child_nodes
  [predicate, statements, consequent]
end

def copy(predicate: nil, statements: nil, consequent: nil, location: nil)
  node =
    IfNode.new(
      predicate: predicate || self.predicate,
      statements: statements || self.statements,
      consequent: consequent || self.consequent,
      location: location || self.location
    )

  node.comments.concat(comments.map(&:copy))
  node
end

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

def format(q)
  ConditionalFormatter.new("if", self).format(q)
end

def modifier?
  predicate.location.start_char > statements.location.start_char
end

Checks if the node was originally found in the modifier form.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4