**
** \legal
** Copyright (c) 2002-2005 Robert B. Quattlebaum Jr., Adrian Bentley
+** Copyright (c) 2007 Chris Moore
**
** This package is free software; you can redistribute it and/or
** modify it under the terms of the GNU General Public License as
const_iterator iter,next;
/*
- //optimizize...
+ //optimize...
Real left = x-supersample/2, right = x+supersample/2;
if(left < front().pos) left = front().pos;
//return Color::blend(iterr->color,iterl->color,lambda,Color::BLEND_STRAIGHT);
}else
{
- //itegration madness
+ //integration madness
const_iterator i = iterl, ie = iterr+1;
Real wlast = left;
//! 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.