Cross Reference: /inkscape/src/livarot/ShapeSweep.cpp

Lines Matching defs:cc
2185       int cb, cc;
2187       cc = getPoint(i).incidentEdge[LAST];
2189       if ((getEdge(cb).st == getEdge(cc).st && getEdge(cb).en == getEdge(cc).en)
2190           || (getEdge(cb).st == getEdge(cc).en && getEdge(cb).en == getEdge(cc).en)) doublon=true;
2193           if ( ebData[cb].pathID > ebData[cc].pathID ) {
2194             cc = getPoint(i).incidentEdge[FIRST]; // on swappe pour enlever cc
2196           } else if ( ebData[cb].pathID == ebData[cc].pathID ) {
2197             if ( ebData[cb].pieceID > ebData[cc].pieceID ) {
2198               cc = getPoint(i).incidentEdge[FIRST]; // on swappe pour enlever cc
2200             } else if ( ebData[cb].pieceID == ebData[cc].pieceID ) { 
2201               if ( ebData[cb].tSt > ebData[cc].tSt ) {
2202                 cc = getPoint(i).incidentEdge[FIRST]; // on swappe pour enlever cc
2208         if ( doublon ) eData[cc].weight = 0;
2212         if (getEdge(cb).st == getEdge(cc).st) {
2213           eData[cb].weight += eData[cc].weight;
2215           eData[cb].weight -= eData[cc].weight;
2217  	      eData[cc].weight = 0;
2219 	      if (swsData[cc].firstLinkedPoint >= 0) {
2220           int cp = swsData[cc].firstLinkedPoint;
2226             swsData[cb].firstLinkedPoint = swsData[cc].firstLinkedPoint;
2232             pData[ncp].nextLinkedPoint = swsData[cc].firstLinkedPoint;
2236 	      DisconnectStart (cc);
2237 	      DisconnectEnd (cc);
2241             pData[cp].askForWindingB = cc;
2245 	      SwapEdges (cc, numberOfEdges() - 1);
2247           cb = cc;
2256 	      int cc;
2257 	      cc = getPoint(i).incidentEdge[FIRST];
2258 	      while (cc >= 0 && cc < numberOfEdges()) {
2259           int ncc = NextAt (i, cc);
2261           if (cc != cb && Other (i, cc) == other ) doublon=true;
2264               if ( ebData[cb].pathID > ebData[cc].pathID ) {
2266               } else if ( ebData[cb].pathID == ebData[cc].pathID ) {
2267                 if ( ebData[cb].pieceID > ebData[cc].pieceID ) {
2269                 } else if ( ebData[cb].pieceID == ebData[cc].pieceID ) { 
2270                   if ( ebData[cb].tSt > ebData[cc].tSt ) {
2276             if ( doublon ) eData[cc].weight = 0;
2280 //            if (cc != cb && Other (i, cc) == other) {
2282             if (getEdge(cb).st == getEdge(cc).st) {
2283               eData[cb].weight += eData[cc].weight;
2285               eData[cb].weight -= eData[cc].weight;
2287             eData[cc].weight = 0;
2289             if (swsData[cc].firstLinkedPoint >= 0) {
2290               int cp = swsData[cc].firstLinkedPoint;
2296                 swsData[cb].firstLinkedPoint = swsData[cc].firstLinkedPoint;
2302                 pData[ncp].nextLinkedPoint = swsData[cc].firstLinkedPoint;
2306             DisconnectStart (cc);
2307             DisconnectEnd (cc);
2311                 pData[cp].askForWindingB = cc;
2315             SwapEdges (cc, numberOfEdges() - 1);
2317               cb = cc;
2320               ncc = cc;
2324           cc = ncc;