module Hpricot::Container::Trav

See Hpricot::Traverse#previous_node if you need to hunt out all kinds of nodes.
By "container" node, I mean: this method does not find text nodes or comments or cdata or any of that.
Returns the container node neighboring this node to the north: just above it.

def previous_sibling
  sib = parent.containers
  x = sib.index(self) - 1
  sib[x] if sib and x >= 0
end