Home | History | Annotate | Download | only in src

Lines Matching defs:cur_u

591     CvNode1D u0_head, u1_head, *cur_u, *prev_u;
634 for( cur_u = u0_head.next; cur_u != 0; )
636 i = (int)(cur_u - u);
640 cur_u->val = cost[i][j] - cur_v_val;
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;
649 prev_u = cur_u;
650 cur_u = cur_u->next;
662 for( found |= (cur_u = u1_head.next) != 0; cur_u != 0; cur_u = cur_u->next )
664 float cur_u_val = cur_u->val;
668 i = (int)(cur_u - u);
692 prev_u->next = cur_u->next;
912 CvNode1D u_head, *cur_u, *prev_u;
975 for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next )
977 i = (int)(cur_u - u);
994 prev_u = cur_u;
1015 for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next )
1017 float temp = cost[cur_u - u][j];
1028 for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next )
1029 delta[cur_u - u][j] += diff;
1036 for( cur_u = u_head.next; cur_u != 0; cur_u = cur_u->next )
1038 i = (int)(cur_u - u);
1039 if( cur_u->val == cost[i][min_j] ) /* row i needs updating */
1053 diff = max_val - cur_u->val;
1054 cur_u->val = max_val;