903 |
|
else if (element > max) |
904 |
|
return -1; |
905 |
|
int result = bs.nextSetBit(element); |
906 |
< |
return result > max ? -1 : result; |
906 |
> |
return (result > max) ? -1 : result; |
907 |
|
} |
908 |
|
int higherAscending(int element) { |
909 |
|
return ceilingAscending(element + 1); |
910 |
|
} |
911 |
|
private int firstAscending() { |
912 |
|
int result = ceilingAscending(min); |
913 |
< |
return result > max ? -1 : result; |
913 |
> |
return (result > max) ? -1 : result; |
914 |
|
} |
915 |
|
private int lastAscending() { |
916 |
|
int result = floorAscending(max); |
917 |
< |
return result < min ? -1 : result; |
917 |
> |
return (result < min) ? -1 : result; |
918 |
|
} |
919 |
|
} |
920 |
|
ReferenceSet rs = new ReferenceSet(); |
975 |
|
} |
976 |
|
|
977 |
|
static boolean eq(Integer i, int j) { |
978 |
< |
return i == null ? j == -1 : i == j; |
978 |
> |
return (i == null) ? j == -1 : i == j; |
979 |
|
} |
980 |
|
|
981 |
|
} |