child_end
for (node::child_iterator i=n->child_begin(), e=n->child_end() ; i!=e ;
if (n->child_begin() == n->child_end())
std::sort(child_begin(), child_end(), cmp_children);
n = *(--(n->child_end()));
if (local_fixups->child_begin() != local_fixups->child_end())
child_iterator end() { return n.child_end(); }