Lines Matching refs:next
69 struct CvNode1D *next;
77 struct CvNode2D *next[2]; /* next row & next column */
595 u0_head.next = u;
598 u[i].next = u + i + 1;
600 u[ssize - 1].next = 0;
601 u1_head.next = 0;
603 v0_head.next = ssize > 1 ? v + 1 : 0;
606 v[i].next = v + i + 1;
608 v[dsize - 1].next = 0;
609 v1_head.next = 0;
614 v1_head.next = v;
615 v1_head.next->next = 0;
627 for( found |= (cur_v = v1_head.next) != 0; cur_v != 0; cur_v = cur_v->next )
634 for( cur_u = u0_head.next; cur_u != 0; )
642 prev_u->next = cur_u->next;
643 cur_u->next = u1_head.next;
644 u1_head.next = cur_u;
645 cur_u = prev_u->next;
650 cur_u = cur_u->next;
653 prev_v->next = cur_v->next;
662 for( found |= (cur_u = u1_head.next) != 0; cur_u != 0; cur_u = cur_u->next )
673 for( cur_v = v0_head.next; cur_v != 0; )
681 prev_v->next = cur_v->next;
682 cur_v->next = v1_head.next;
683 v1_head.next = cur_v;
684 cur_v = prev_v->next;
689 cur_v = cur_v->next;
692 prev_u->next = cur_u->next;
762 enter_x->next[0] = state->rows_x[i];
763 enter_x->next[1] = state->cols_x[j];
801 head.next[0] = state->rows_x[i];
803 while( (next_x = cur_x->next[0]) != leave_x )
808 cur_x->next[0] = next_x->next[0];
809 state->rows_x[i] = head.next[0];
811 head.next[1] = state->cols_x[j];
813 while( (next_x = cur_x->next[1]) != leave_x )
818 cur_x->next[1] = next_x->next[1];
819 state->cols_x[j] = head.next[1];
854 new_x = new_x->next[0];
861 new_x = new_x->next[1];
866 if( new_x != 0 ) /* found the next x */
872 else /* didn't find the next x */
881 new_x = new_x->next[i];
922 u_head.next = u;
925 u[i].next = u + i + 1;
927 u[ssize - 1].next = 0;
929 v_head.next = v;
933 v[i].next = v + i + 1;
935 v[dsize - 1].next = 0;
975 for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next )
981 for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next )
1001 remember = prev_u_min_i->next;
1005 if( remember == prev_u_min_i->next ) /* line min_i was deleted */
1007 for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next )
1015 for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next )
1028 for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next )
1036 for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next )
1044 for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next )
1058 for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next )
1065 while( u_head.next != 0 || v_head.next != 0 );
1100 end_x->next[0] = state->rows_x[min_i];
1101 end_x->next[1] = state->cols_x[min_j];
1107 if( state->s[min_i] == 0 && u_head->next->next != 0 )
1108 prev_u_min_i->next = prev_u_min_i->next->next; /* remove row from list */
1110 prev_v_min_j->next = prev_v_min_j->next->next; /* remove column from list */
