45     n->nchildren   = 0;  in tn_new()
79 	for (i = 0; i < n->nchildren; i++) {  in tn_delete()
80 	    ASSERT_BOUNDS (i, n->nchildren);  in tn_delete()
88 	n->nchildren   = 0;  in tn_delete()
198     n->desc  = n->nchildren; /* #direct children */  in tn_structure()
202     if (n->nchildren) {  in tn_structure()
206 	     i < n->nchildren;  in tn_structure()
208 	    ASSERT_BOUNDS (i, n->nchildren);  in tn_structure()
250     if (p->nchildren == 1) {  in tn_detach()
260 	p->nchildren   = 0;  in tn_detach()
275 	for (i = n->index; i < (p->nchildren-1); i++) {  in tn_detach()
277 	    ASSERT_BOUNDS (i,	p->nchildren);  in tn_detach()
278 	    ASSERT_BOUNDS (i+1, p->nchildren);  in tn_detach()
283 	p->nchildren --;  in tn_detach()
328     ASSERT (end <= p->nchildren, "tn_detachmany - tried to cut too many children");  in tn_detachmany()
331     if ((at == 0) && (end == p->nchildren)) {  in tn_detachmany()
342 	p->nchildren   = 0;  in tn_detachmany()
396 	    ASSERT_BOUNDS (k, p->nchildren);  in tn_detachmany()
402 	for (i = at, k = end; k < p->nchildren; i++, k++) {  in tn_detachmany()
404 	    ASSERT_BOUNDS (k, p->nchildren);  in tn_detachmany()
405 	    ASSERT_BOUNDS (i, p->nchildren);  in tn_detachmany()
411 	p->nchildren -= len;  in tn_detachmany()
433     *nc = n->nchildren;  in tn_detachchildren()
437     n->nchildren   = 0;  in tn_detachchildren()
452     int at = p->nchildren;  in tn_append()
458     p->nchildren ++;  in tn_append()
466     ASSERT_BOUNDS (at, p->nchildren);  in tn_append()
477 	ASSERT_BOUNDS (at-1, p->nchildren);  in tn_append()
496     int at = p->nchildren;  in tn_appendmany()
502     p->nchildren += nc;  in tn_appendmany()
512 	ASSERT_BOUNDS (at, p->nchildren);  in tn_appendmany()
524 	    ASSERT_BOUNDS (at, p->nchildren);  in tn_appendmany()
542     if (at >= p->nchildren) {  in tn_insert()
560     p->nchildren ++;  in tn_insert()
571     for (i = p->nchildren-1, k = i-1; i > at; i--, k--) {  in tn_insert()
573 	ASSERT_BOUNDS (i, p->nchildren);  in tn_insert()
574 	ASSERT_BOUNDS (k, p->nchildren);  in tn_insert()
589     ASSERT_BOUNDS (at+1, p->nchildren);  in tn_insert()
597 	ASSERT_BOUNDS (at-1, p->nchildren);  in tn_insert()
610     if (at >= p->nchildren) {  in tn_insertmany()
626     p->nchildren += nc;  in tn_insertmany()
637     for (i = p->nchildren-1, k = i-nc; k >= at; i--, k--) {  in tn_insertmany()
639 	ASSERT_BOUNDS (i, p->nchildren);  in tn_insertmany()
640 	ASSERT_BOUNDS (k, p->nchildren);  in tn_insertmany()
649 	ASSERT_BOUNDS (k, p->nchildren);  in tn_insertmany()
658 	    ASSERT_BOUNDS (k,	p->nchildren);  in tn_insertmany()
659 	    ASSERT_BOUNDS (k-1, p->nchildren);  in tn_insertmany()
665 	if (k < (p->nchildren-1)) {  in tn_insertmany()
666 	    ASSERT_BOUNDS (k,	p->nchildren);  in tn_insertmany()
667 	    ASSERT_BOUNDS (k+1, p->nchildren);  in tn_insertmany()
729     if (src->nchildren) {  in tn_dup()
732 	dstn->child	  = NALLOC (src->nchildren, TNPtr);  in tn_dup()
733 	dstn->maxchildren = src->nchildren;  in tn_dup()
734 	dstn->nchildren	  = 0;  in tn_dup()
736 	for (i = 0; i < src->nchildren; i++) {  in tn_dup()
738 	    ASSERT_BOUNDS (i, src->nchildren);  in tn_dup()
829     } else if (!n->nchildren) {  in tn_ndescendants()
866     if (!n->nchildren) {  in tn_getchildren()
873 	*nc = n->nchildren;  in tn_getchildren()
874 	lv  = NALLOC (n->nchildren, Tcl_Obj*);  in tn_getchildren()
876 	for (i = 0; i < n->nchildren; i++) {  in tn_getchildren()
878 	    ASSERT_BOUNDS (i, n->nchildren);  in tn_getchildren()
1070     if (tdn->nchildren) {  in tn_serialize()
1072 	for (i = 0; i < tdn->nchildren; i++) {  in tn_serialize()
1106 	for (i = 0; i < n->nchildren; i++) {  in fill_descendants()
1110 	    ASSERT_BOUNDS (i,  n->nchildren);  in fill_descendants()
1125     if (n->nchildren > n->maxchildren) {  in extend_children()
1127 	    n->child = NALLOC (n->nchildren, TNPtr);  in extend_children()
1129 	    int	   nc  = 2 * n->nchildren;  in extend_children()
1133 		nc  = n->nchildren;  in extend_children()