 fast paths and build operators for exactly that condition.  This worked
OK but there are just a lot of possible interactions we couldn't optimize for.  So
we decided to build an addressing operator by first producing an Abstract Syntax
Tree (AST) implementation of the reduced dimension pathway and then producing an
implementation using purely java bytecode.</p>
<p>This reduces the special case pathway to a set of general conditions that we can
test much more thoroughly as well as producing objects that are