Searched defs:nn (Results 1 - 6 of 6) sorted by relevance
/inkscape/src/live_effects/ |
H A D | lpe-dynastroke.cpp | 146 Piecewise<D2<SBasis> > nn = unitVector(v * ( rot * slant ) ); local 149 nn = nn * (slant * rot ); 151 n1 = nn*double(width);
|
/inkscape/src/livarot/ |
H A D | float-line.cpp | 412 int nn=bords[no].other; 413 sum+=bords[nn].val+(at-bords[nn].pos)*bords[nn].pente; 414 // sum+=((at-bords[nn].pos)*bords[no].val+(bords[no].pos-at)*bords[nn].val)/(bords[no].pos-bords[nn].pos); 415 // sum+=ValAt(at,bords[nn].pos,bords[no].pos,bords[nn].val,bords[no].val); 424 int const nn local [all...] |
H A D | int-line.cpp | 86 int nn = bords[no].other; local 87 sum += ValAt(at, bords[nn].pos, bords[no].pos, bords[nn].val, bords[no].val);
|
/inkscape/src/2geom/ |
H A D | bezier.cpp | 57 unsigned nn = n_derivs + 1; local 59 nn = order()+1; // only calculate the non zero derivs 61 for(unsigned di = 0; di < nn; di++) {
|
H A D | intersection-graph.cpp | 208 ILIter nn = _getNeighbor(n); local 209 IntersectionList &oxl = _getPathData(nn).xlist; 216 if (cyclic_prior(nn, oxl)->next_edge != nn->next_edge) { 219 nn->defective = true; 224 oxl.erase(nn);
|
H A D | elliptical-arc.cpp | 261 unsigned int nn = n+1; // nn represents the size of the result vector. local 263 result.reserve(nn); 267 unsigned int m = std::min(nn, 4u); 274 m = nn / 4; 280 m = nn - 4 * m; 285 if ( !result.empty() ) // nn != 0
|
Completed in 154 milliseconds