**
** \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
// assert(0);
}
-static void show_gradient(const Gradient::CPointList x) {
+static void show_gradient(const Gradient::CPointList x)
+{
int i = 0;
- for (Gradient::const_iterator iter = x.begin(); iter != x.end(); iter++) {
+ for (Gradient::const_iterator iter = x.begin(); iter != x.end(); iter++)
printf("%3d : %.3f %s\n", i++, (*iter).pos, (*iter).color.get_string().c_str());
- }
}
Gradient &
// if there are cpoints in both gradients run through both until one runs out
if (iter1 != end() && iter2 != rhs.end())
while(true)
- {
// if the left one has the first cpoint
if (left.pos < right.pos)
{
int tpos1 = pos1, tpos2 = pos2;
// skip past all cpoints at the same position
for(left_same = ++iter1; iter1 != end() && (*iter1).pos == left.pos; iter1++, pos1++)
- {
if (print) printf("skipping past pos %d in left\n", pos1);
- }
for(right_same = ++iter2; iter2 != rhs.end() && (*iter2).pos == right.pos; iter2++, pos2++)
- {
if (print) printf("skipping past pos %d in right\n", pos2);
- }
-
- // if the is only one cpoint at this position in each gradient,
+
+ // if there is only one cpoint at this position in each gradient,
// there's only one corresponding cpoint in the sum
- if (iter1 == left_same && iter2 == right_same) {
+ if (iter1 == left_same && iter2 == right_same)
+ {
if (print) printf("two singles at left %d and right %d\n", pos1++, pos2++);
ret.push_back(CPoint(left.pos, left.color + right.color));
}
if (print) printf(" copy front from left %d right %d\n", tpos1++, tpos2++);
ret.push_back(CPoint(left.pos, left.color + right.color));
- // merge the middle pairs points - each middle point merges with its counterpart
+ // merge the middle pairs of points - each middle point merges with its counterpart
while(left_same < iter1-1 && right_same < iter2-1)
{
old1 = *(left_same++);
right = *iter2;
if (iter1 == end()) break;
}
- }
// one of the gradients has run out of points
// does the left one have points left?
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;