Lines Matching defs:childCount
939 int childCount;
968 node->children[node->childCount++] = index;
969 node->children[node->childCount++] = index + 1;
979 node->children[node->childCount++] = i;
982 assert( node->childCount == n );
994 node->childCount = n;
1059 else if( node->childIndex < node->childCount )
1240 int childCount;
1280 const bool isLast = parentState->childIndex == parentState->childCount;
1291 const bool isLast = ++parentState->childIndex == parentState->childCount;
1313 parentState->childCount = benc->val.l.count;