summary | shortlog | log | commit | commitdiff | tree
raw | patch | inline | side by side (parent: d0ad7f2)
raw | patch | inline | side by side (parent: d0ad7f2)
author | Johan Engelen <goejendaagh@zonnet.nl> | |
Wed, 16 Dec 2009 22:00:09 +0000 (23:00 +0100) | ||
committer | Johan Engelen <goejendaagh@zonnet.nl> | |
Wed, 16 Dec 2009 22:00:09 +0000 (23:00 +0100) |
src/2geom/path-intersection.cpp | patch | blob | history |
index b2d5ceabb7a79d63f275f6805f6377e69c1c2c77..f883f8c63da48bbb8eb85b1aae0f2fbc23561e45 100644 (file)
double x = p.initialPoint()[X];
Cmp res = cmp(p[0].finalPoint()[Y], y);
goto doh;
- for(unsigned i = 1; i <= p.size(); i++) {
+ for(unsigned i = 1; i < p.size(); i++) {
Cmp final_to_ray = cmp(p[i].finalPoint()[Y], y);
Cmp initial_to_ray = cmp(p[i].initialPoint()[Y], y);
// if y is included, these will have opposite values, giving order.
if(p.empty()) return ret;
bool pdx=2, pdy=2; //Previous derivative direction
- for(unsigned i = 0; i <= p.size(); i++) {
+ for(unsigned i = 0; i < p.size(); i++) {
std::vector<double> spl = offset_doubles(curve_mono_splits(p[i]), i);
bool dx = p[i].initialPoint()[X] > (spl.empty()? p[i].finalPoint()[X] :
p.valueAt(spl.front(), X));