Lines Matching defs:curDist

506                 double curDist;
538 curDist = dot(diff, diff);
542 delta += 0.3333 * (curDist + prevDist + midDist) * data.lk[i];
543 if ( curDist > worstD ) {
544 worstD = curDist;
546 } else if ( data.fk[i] && 2 * curDist > worstD ) {
547 worstD = 2*curDist;
552 prevDist = curDist;
561 double curDist;
577 curDist = dot(diff, diff);
578 delta += curDist;
580 if ( curDist > worstD ) {
581 worstD = curDist;
583 } else if ( data.fk[i] && 2 * curDist > worstD ) {
584 worstD = 2*curDist;
589 prevDist = curDist;
629 double curDist;
661 curDist = dot(diff, diff);
666 ndelta += 0.3333 * (curDist + prevDist + midDist) * data.lk[i];
668 if ( curDist > worstD ) {
669 worstD = curDist;
671 } else if ( data.fk[i] && 2 * curDist > worstD ) {
672 worstD = 2*curDist;
678 prevDist = curDist;
686 double curDist;
702 curDist = dot(diff, diff);
704 ndelta += curDist;
706 if ( curDist > worstD ) {
707 worstD = curDist;
709 } else if ( data.fk[i] && 2 * curDist > worstD ) {
710 worstD = 2 * curDist;
715 prevDist = curDist;
901 double curDist;
916 curDist = dot(diff,diff);
921 delta+=0.3333*(curDist+prevDist+midDist)/**lk[i]*/;
923 if ( curDist > worstD ) {
924 worstD = curDist;
926 } else if ( fk[i] && 2*curDist > worstD ) {
927 worstD = 2*curDist;
932 prevDist = curDist;
941 double curDist;
950 curDist = dot(diff,diff);
951 delta += curDist;
952 if ( curDist > worstD ) {
953 worstD = curDist;
955 } else if ( fk[i] && 2*curDist > worstD ) {
956 worstD = 2*curDist;
961 prevDist = curDist;
1020 double curDist;
1035 curDist = dot(diff,diff);
1039 ndelta+=0.3333*(curDist+prevDist+midDist)/**lk[i]*/;
1041 if ( curDist > worstD ) {
1042 worstD = curDist;
1044 } else if ( fk[i] && 2*curDist > worstD ) {
1045 worstD = 2*curDist;
1050 prevDist = curDist;
1059 double curDist;
1068 curDist=dot(diff,diff);
1069 ndelta+=curDist;
1071 if ( curDist > worstD ) {
1072 worstD=curDist;
1074 } else if ( fk[i] && 2*curDist > worstD ) {
1075 worstD=2*curDist;
1080 prevDist=curDist;