caiyu/solvespace
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

NFC replace 2 nested loops with 1 loop and a lookup for speed improvement.

Browse Source
This commit is contained in:
phkahler 2020-08-15 17:47:40 -04:00
parent bc4924ae47
commit d974615d0e
1 changed files with 38 additions and 39 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
src/srf/boolean.cpp
View File

@ -454,16 +454,16 @@ SSurface SSurface::MakeCopyTrimAgainst(SShell *parent,
SEdgeList inter = {}; SEdgeList inter = {};
SSurface *ss; SSurface *ss;
for(ss = agnst->surface.First(); ss; ss = agnst->surface.NextAfter(ss)) {
SCurve *sc; SCurve *sc;
for(sc = into->curve.First(); sc; sc = into->curve.NextAfter(sc)) { for(sc = into->curve.First(); sc; sc = into->curve.NextAfter(sc)) {
if(sc->source != SCurve::Source::INTERSECTION) continue; if(sc->source != SCurve::Source::INTERSECTION) continue;
if(opA) { if(opA) {
if(sc->surfA != h || sc->surfB != ss->h) continue; if(sc->surfA != h) continue;
ss = shb->surface.FindById(sc->surfB);
} else { } else {
if(sc->surfB != h || sc->surfA != ss->h) continue; if(sc->surfB != h) continue;
ss = sha->surface.FindById(sc->surfA);
} }
int i; int i;
for(i = 1; i < sc->pts.n; i++) { for(i = 1; i < sc->pts.n; i++) {
Vector a = sc->pts[i-1].p, Vector a = sc->pts[i-1].p,
@ -500,7 +500,6 @@ SSurface SSurface::MakeCopyTrimAgainst(SShell *parent,
} }
} }
} }
}
// Record all the points where more than two edges join, which I will call // Record all the points where more than two edges join, which I will call
// the choosing points. If two edges join at a non-choosing point, then // the choosing points. If two edges join at a non-choosing point, then