countNodes
for(uint32 n = 0; n < context->countNodes(); ++n) {
uint32 countNodes() const;
while((n = group->countNodes()) > 0) {
for(uint32 n = sourceGroup->countNodes(); n; --n) {
if(newGroup->countNodes() == 1)
if(oldGroup->countNodes() == 1)
uint32 countNodes() const;
for(int n = set.countNodes()-1; n >= 0; --n) {
int count = nodeSet.countNodes();
count = g->countNodes();