tktreectrl/generic/tkTreeItem.c

25     Column *next;	/* Column to the right of this one */
253 	    column = column->next;
369 	column = column->next;
414  *	The next Column in the linked list, or NULL.
428     return (TreeItemColumn) ((Column *) column)->next;
439  *	The next Column in the linked list, or NULL.
453     Column *next = self->next;
462     return next;
831 	column = column->next;
840 	/* NOTE: These next 2 lines must have 'static' to work around a
952 	column = column->next;
963  *	Determine whether an item should have a button displayed next to
1185  *	Return the next sibling of an Item.
1188  *	Token for next sibling Item, or NULL.
1352  *	  b) the next sibling, or
1353  *	  c) the next sibling of an ancestor, or
1392  *	  b) the next ReallyVisible() sibling, or
1393  *	  c) the next ReallyVisible() sibling of an ancestor, or
1798  *   next QUALIFIERS
1873 	"descendants", "firstchild", "lastchild", "left", "leftmost", "next",
2484  *	Returns the first item to iterate over. If an error occurs
2485  *	then ItemForEach.error is set to 1.
2510     iter->error = 0;
2521 	    iter->error = 1;
2538  *	Returns the next item to iterate over. Keep calling this until
2542  *	Returns the next item to iterate over or NULL.
2758  *	an error message is left in the interpreter result.
3085     Column *prev = NULL, *next = NULL;
3089 	next = column->next;
3097 	column = next;
3100 	prev->next = next;
3102 	item->columns = next;
3129 	Column *next = column->next;
3131 	column = next;
3174 	if (column->next == NULL) {
3175 	    column->next = Column_Alloc(tree);
3178 	column = column->next;
3230 	if (walk->next == NULL)
3233 	walk = walk->next;
3246 	    item->columns = move->next;
3248 	    prevM->next = move->next;
3251 	last->next = move;
3252 	move->next = NULL;
3257 	    prevB->next = move;
3258 	move->next = before;
3373 	column = column->next;
3493 	column = column->next;
3841 	    itemColumn = itemColumn->next;
3980 		goto next;
3985 next:
3989 	    column = column->next;
4279     /* NOTE: The next three checks do not call TreeItem_ReallyVisible()
4292     /* Check for ReallyVisible next sibling */
4302     /* Vertical line to parent and/or previous/next sibling */
4344     /* Vertical lines from ancestors to their next siblings */
4354 	/* Check for ReallyVisible next sibling */
4608 	column = column->next;
4758  *	returned, then the interp's result contains an error message.
4775     int error;
4781     for (error = 0; error <= 1; error++) {
4782 	if (error == 0) {
4997     /* Do it here so I don't have to free it above if an error occurs. */
5392 		 * to the next separator (but not including that separator). */
5649 			column = column->next;
5806     int diff, zeros;
5839 	    diff = 0;
5841 		if (diff == 0) {
5842 		    diff = UCHAR(*left) - UCHAR(*right);
5855 			if (diff != 0) {
5856 			    return diff;
5885 	    diff = UCHAR(*left) - UCHAR(*right);
5889 	diff = uniLeftLower - uniRightLower;
5890 	if (diff) {
5891 	    return diff;
5902     if (diff == 0) {
5903 	diff = secondaryDiff;
5905     return diff;
6028 	/* -command returned error */
6253     /* If the item has no children, then nothing is done and no error
6913 	    if (iter.error)
8038 			column = column->next;
8145 			column = column->next;
8658 	data->result = -1; /* error */
8692  *	error is left in the interpreter result and the return value is -1.
8699  *	the objv[] elements in not in the style, an error is left in the
8739     clientData.result = 0; /* -1 error, 0 no rects, 1+ success */