lib/haml_lint/linter.rb
# Gets the next node following this node, ascending up the ancestor chain
# recursively if this node has no siblings.
#
# @param node [HamlLint::Tree::Node]
# @return [HamlLint::Tree::Node,nil]
Gets the next node following this node, ascending up the ancestor chain
recursively if this node has no siblings.
Gets the next node following this node ascending up the ancestor chain recursively if this node has no siblings .
def next_node(node)
      return unless node
      siblings = node.parent ? node.parent.children : [node]
      next_sibling = siblings[siblings.index(node) + 1] if siblings.count > 1
      return next_sibling if next_sibling
      next_node(node.parent)
    end
def next_node ( node ) return unless node siblings = node . parent ? node . parent . children : [ node ] next_sibling = siblings [ siblings . index ( node ) + 1 ] if siblings . count > 1 return next_sibling if next_sibling next_node ( node . parent ) end
Gets the next node following this node, ascending up the ancestor chain
recursively if this node has no siblings.
Gets the next node following this node ascending up the ancestor chain recursively if this node has no siblings .
None
HamlLint::Tree::Node,nil
node
None