summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
cc91f4f)
//! using a binary search.
for(;iter<end();iter=next++)
{
//! using a binary search.
for(;iter<end();iter=next++)
{
- if(next==end() || x>=iter->pos && x<next->pos && iter->pos!=next->pos)
+ if(next==end() || (x>=iter->pos && x<next->pos && iter->pos!=next->pos))
{
// If the supersample region falls square in between
// two CPoints, then we don't have to do anything special.
{
// If the supersample region falls square in between
// two CPoints, then we don't have to do anything special.