Binary ``and'' returns the logical conjunction of the two surrounding
expressions. It's equivalent to && except for the very low
precedence. This means that it short-circuits: i.e., the right expression
is evaluated only if the left expression is true.