void pop()
{
assert (individual.size() > 1);
individual.pop_back();
Transform result = scale(1);
for (Transforms::reverse_iterator it = individual.rbegin(),
end = individual.rend(); it != end; ++it)
result = multiply(result, *it);
makeCurrent(result);
}
void popTransform()
{
assert (individualTransforms.size() > 1);
individualTransforms.pop_back();
// TODO: If currentTransform() wouldn't have to be .back(), then I think
// this could be optimized away and just be pop_back too. Or not?
Transform result = scale(1);
for (Transforms::reverse_iterator it = individualTransforms.rbegin(),
end = individualTransforms.rend(); it != end; ++it)
result = multiply(result, *it);
makeCurrentTransform(result);
}