l = m; } else if( found == 1 ) { bisectionRoot(l,m,startIndex + root++); l = m; u = lastUpper = allUpper; lastFound = 0;
l = m; } else if( found == 1 ) { bisectionRoot(l,m,startIndex + root++); l = m; u = lastUpper = allUpper; lastFound = 0;
l = m; } else if( found == 1 ) { bisectionRoot(l,m,startIndex + root++); l = m; u = lastUpper = allUpper; lastFound = 0;
l = m; } else if( found == 1 ) { bisectionRoot(l,m,startIndex + root++); l = m; u = lastUpper = allUpper; lastFound = 0;