Lines Matching defs:k2
1008 int i=0, i1=0, j=0, jp=0, j1=0, k1=0, k2=0;
1047 k2 = k1+2;
1048 if( k2 > n )
1049 k2 = n;
1054 k2 = n - j1 - 1;
1055 if( k2 == 0 )
1058 k2 = n - j1;
1060 else if( array[k2] && array[k2-1] )
1063 k1 = k2 + 1;
1071 k2 = k1 + 1;
1078 k2 = k1+2;
1079 if( k2 > n )
1080 k2 = n;
1093 k2 = n - j1;
1098 k2 = n + 1 - j1;
1104 k2 = n + 1 - m;
1109 array[k2-1] = !array[k2-1];