while(tlevel <= level[i] && i<count)
while(i<count && tlevel <= level[i])
void flipThisRun(bidi_char *from, unsigned char *level, int max, int count){    int i, j, rcount, tlevel;    bidi_char temp;    j = i = 0;    while(i<count && j<count)    {	/* find the start of the run of level=max */	tlevel = max;	i = j = findIndexOfRun(level, i, count, max);	/* find the end of the run */	while(tlevel <= level[i] && i<count)	{	    i++;	}	rcount = i-j;	for(; rcount>((i-j)/2); rcount--)	{	    temp = from[j+rcount-1];	    from[j+rcount-1] = from[i-rcount];	    from[i-rcount] = temp;	}    }}