Lines Matching defs:cur_v
592 CvNode1D v0_head, v1_head, *cur_v, *prev_v;
627 for( found |= (cur_v = v1_head.next) != 0; cur_v != 0; cur_v = cur_v->next )
629 float cur_v_val = cur_v->val;
631 j = (int)(cur_v - v);
653 prev_v->next = cur_v->next;
673 for( cur_v = v0_head.next; cur_v != 0; )
675 j = (int)(cur_v - v);
679 cur_v->val = _cost[j] - cur_u_val;
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;
688 prev_v = cur_v;
689 cur_v = cur_v->next;
913 CvNode1D v_head, *cur_v, *prev_v;
981 for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next )
983 j = (int)(cur_v - v);
992 prev_v = cur_v;
1007 for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next )
1009 j = (int)(cur_v - v);
1010 if( cur_v->val == cost[min_i][j] ) /* column j needs updating */
1024 diff = max_val - cur_v->val;
1025 cur_v->val = max_val;
1044 for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next )
1046 float temp = cost[i][cur_v - v];
1058 for( cur_v = v_head.next; cur_v != 0; cur_v = cur_v->next )
1059 delta[i][cur_v - v] += diff;
