121 sum += d; 122 } 123 float cycles = phase / sum; 124 if (phase < 0.0f) { 125 if (-cycles >= MAX_CYCLES) { 126 phase = 0.0f; 127 } else { 128 int fullcycles = FloatMath.floor_int(-cycles); 129 if ((fullcycles & dash.length & 1) != 0) { 130 dashOn = !dashOn; 131 } 132 phase += fullcycles * sum; 133 while (phase < 0.0f) { 134 if (--sidx < 0) { 135 sidx = dash.length - 1; 136 } 137 phase += dash[sidx]; 138 dashOn = !dashOn; 139 } 140 } 141 } else if (phase > 0) { 142 if (cycles >= MAX_CYCLES) { 143 phase = 0.0f; 144 } else { 145 int fullcycles = FloatMath.floor_int(cycles); 146 if ((fullcycles & dash.length & 1) != 0) { 147 dashOn = !dashOn; 148 } 149 phase -= fullcycles * sum; 150 float d; 151 while (phase >= (d = dash[sidx])) { 152 phase -= d; 153 sidx = (sidx + 1) % dash.length; 154 dashOn = !dashOn; 155 } 156 } 157 } 158 159 this.dash = dash; 160 this.dashLen = dashLen; 161 this.startPhase = this.phase = phase; 162 this.startDashOn = dashOn; 163 this.startIdx = sidx; 164 this.starting = true; 165 needsMoveTo = false; 166 firstSegidx = 0; 167 168 this.recycleDashes = recycleDashes; 169 170 return this; // fluent API 171 } 172 173 /** 174 * Disposes this dasher: 175 * clean up before reusing this instance 176 */ 177 void dispose() { 178 if (DO_CLEAN_DIRTY) { 179 // Force zero-fill dirty arrays: 180 Arrays.fill(curCurvepts, 0.0f); 181 } 182 // Return arrays: 183 if (recycleDashes) { 184 dash = dashes_ref.putArray(dash); 185 } 186 firstSegmentsBuffer = firstSegmentsBuffer_ref.putArray(firstSegmentsBuffer); 187 } 188 189 public float[] copyDashArray(final float[] dashes) { 190 final int len = dashes.length; 191 final float[] newDashes; 192 if (len <= MarlinConst.INITIAL_ARRAY) { 193 newDashes = dashes_ref.initial; 194 } else { 195 if (DO_STATS) { 196 rdrCtx.stats.stat_array_dasher_dasher.add(len); 197 } 198 newDashes = dashes_ref.getArray(len); 199 } 200 System.arraycopy(dashes, 0, newDashes, 0, len); 201 return newDashes; 202 } 203 204 @Override 205 public void moveTo(float x0, float y0) { 206 if (firstSegidx > 0) { 207 out.moveTo(sx, sy); 208 emitFirstSegments(); 209 } 210 needsMoveTo = true; 211 this.idx = startIdx; 212 this.dashOn = this.startDashOn; 213 this.phase = this.startPhase; 214 this.sx = this.x0 = x0; 215 this.sy = this.y0 = y0; 216 this.starting = true; 217 } 218 219 private void emitSeg(float[] buf, int off, int type) { 220 switch (type) { 221 case 8: 222 out.curveTo(buf[off+0], buf[off+1], 223 buf[off+2], buf[off+3], 224 buf[off+4], buf[off+5]); 225 return; 226 case 6: 227 out.quadTo(buf[off+0], buf[off+1], 228 buf[off+2], buf[off+3]); 229 return; 230 case 4: 231 out.lineTo(buf[off], buf[off+1]); 232 return; 233 default: 234 } 235 } 236 237 private void emitFirstSegments() { 238 final float[] fSegBuf = firstSegmentsBuffer; 239 240 for (int i = 0; i < firstSegidx; ) { 241 int type = (int)fSegBuf[i]; 242 emitSeg(fSegBuf, i + 1, type); 243 i += (type - 1); 244 } 245 firstSegidx = 0; 246 } 247 // We don't emit the first dash right away. If we did, caps would be 248 // drawn on it, but we need joins to be drawn if there's a closePath() 249 // So, we store the path elements that make up the first dash in the 250 // buffer below. 251 private float[] firstSegmentsBuffer; // dynamic array 252 private int firstSegidx; 253 254 // precondition: pts must be in relative coordinates (relative to x0,y0) 255 private void goTo(float[] pts, int off, final int type) { 256 float x = pts[off + type - 4]; 257 float y = pts[off + type - 3]; 258 if (dashOn) { 259 if (starting) { 260 int len = type - 1; // - 2 + 1 261 int segIdx = firstSegidx; 262 float[] buf = firstSegmentsBuffer; 263 if (segIdx + len > buf.length) { 264 if (DO_STATS) { 265 rdrCtx.stats.stat_array_dasher_firstSegmentsBuffer 266 .add(segIdx + len); 267 } 268 firstSegmentsBuffer = buf 269 = firstSegmentsBuffer_ref.widenArray(buf, segIdx, 270 segIdx + len); 271 } 272 buf[segIdx++] = type; 273 len--; 274 // small arraycopy (2, 4 or 6) but with offset: 275 System.arraycopy(pts, off, buf, segIdx, len); 276 segIdx += len; 277 firstSegidx = segIdx; 278 } else { 279 if (needsMoveTo) { 280 out.moveTo(x0, y0); 281 needsMoveTo = false; 282 } 283 emitSeg(pts, off, type); 284 } 285 } else { 286 starting = false; 287 needsMoveTo = true; 288 } 289 this.x0 = x; 290 this.y0 = y; 291 } 292 293 @Override 294 public void lineTo(float x1, float y1) { 295 float dx = x1 - x0; 296 float dy = y1 - y0; 297 298 float len = dx*dx + dy*dy; 299 if (len == 0.0f) { 300 return; 301 } 302 len = (float) Math.sqrt(len); 303 304 // The scaling factors needed to get the dx and dy of the 305 // transformed dash segments. 306 final float cx = dx / len; 307 final float cy = dy / len; 308 309 final float[] _curCurvepts = curCurvepts; 310 final float[] _dash = dash; 311 312 float leftInThisDashSegment; 313 float dashdx, dashdy, p; 314 315 while (true) { 316 leftInThisDashSegment = _dash[idx] - phase; 317 318 if (len <= leftInThisDashSegment) { 319 _curCurvepts[0] = x1; 320 _curCurvepts[1] = y1; 321 goTo(_curCurvepts, 0, 4); 322 323 // Advance phase within current dash segment 324 phase += len; 325 // TODO: compare float values using epsilon: 326 if (len == leftInThisDashSegment) { 327 phase = 0.0f; 328 idx = (idx + 1) % dashLen; 329 dashOn = !dashOn; 330 } 331 return; 332 } 333 334 dashdx = _dash[idx] * cx; 335 dashdy = _dash[idx] * cy; 336 337 if (phase == 0.0f) { 338 _curCurvepts[0] = x0 + dashdx; 339 _curCurvepts[1] = y0 + dashdy; 340 } else { 341 p = leftInThisDashSegment / _dash[idx]; 342 _curCurvepts[0] = x0 + p * dashdx; 343 _curCurvepts[1] = y0 + p * dashdy; 344 } 345 346 goTo(_curCurvepts, 0, 4); 347 348 len -= leftInThisDashSegment; 349 // Advance to next dash segment 350 idx = (idx + 1) % dashLen; 351 dashOn = !dashOn; 352 phase = 0.0f; 353 } 354 } 355 356 // shared instance in Dasher 357 private final LengthIterator li = new LengthIterator(); 358 359 // preconditions: curCurvepts must be an array of length at least 2 * type, 360 // that contains the curve we want to dash in the first type elements 361 private void somethingTo(int type) { 362 if (pointCurve(curCurvepts, type)) { 363 return; 364 } 365 li.initializeIterationOnCurve(curCurvepts, type); 366 367 // initially the current curve is at curCurvepts[0...type] 368 int curCurveoff = 0; 369 float lastSplitT = 0.0f; 370 float t; 371 float leftInThisDashSegment = dash[idx] - phase; 372 373 while ((t = li.next(leftInThisDashSegment)) < 1.0f) { 374 if (t != 0.0f) { 375 Helpers.subdivideAt((t - lastSplitT) / (1.0f - lastSplitT), 376 curCurvepts, curCurveoff, 377 curCurvepts, 0, 378 curCurvepts, type, type); 379 lastSplitT = t; 380 goTo(curCurvepts, 2, type); 381 curCurveoff = type; 382 } 383 // Advance to next dash segment 384 idx = (idx + 1) % dashLen; 385 dashOn = !dashOn; 386 phase = 0.0f; 387 leftInThisDashSegment = dash[idx]; 388 } 389 goTo(curCurvepts, curCurveoff+2, type); 390 phase += li.lastSegLen(); 391 if (phase >= dash[idx]) { 392 phase = 0.0f; 393 idx = (idx + 1) % dashLen; 394 dashOn = !dashOn; 395 } 396 // reset LengthIterator: 397 li.reset(); 398 } 399 400 private static boolean pointCurve(float[] curve, int type) { 401 for (int i = 2; i < type; i++) { 402 if (curve[i] != curve[i-2]) { 403 return false; 404 } 405 } 406 return true; 407 } 408 409 // Objects of this class are used to iterate through curves. They return 410 // t values where the left side of the curve has a specified length. 411 // It does this by subdividing the input curve until a certain error 412 // condition has been met. A recursive subdivision procedure would 413 // return as many as 1<<limit curves, but this is an iterator and we 414 // don't need all the curves all at once, so what we carry out a 415 // lazy inorder traversal of the recursion tree (meaning we only move 416 // through the tree when we need the next subdivided curve). This saves 417 // us a lot of memory because at any one time we only need to store 418 // limit+1 curves - one for each level of the tree + 1. 419 // NOTE: the way we do things here is not enough to traverse a general 420 // tree; however, the trees we are interested in have the property that 421 // every non leaf node has exactly 2 children 422 static final class LengthIterator { 423 private enum Side {LEFT, RIGHT}; 424 // Holds the curves at various levels of the recursion. The root 425 // (i.e. the original curve) is at recCurveStack[0] (but then it 426 // gets subdivided, the left half is put at 1, so most of the time 427 // only the right half of the original curve is at 0) 428 private final float[][] recCurveStack; // dirty 429 // sides[i] indicates whether the node at level i+1 in the path from 430 // the root to the current leaf is a left or right child of its parent. 431 private final Side[] sides; // dirty 432 private int curveType; 433 // lastT and nextT delimit the current leaf. 434 private float nextT; 435 private float lenAtNextT; 436 private float lastT; 437 private float lenAtLastT; 438 private float lenAtLastSplit; 439 private float lastSegLen; 440 // the current level in the recursion tree. 0 is the root. limit 441 // is the deepest possible leaf. 442 private int recLevel; 443 private boolean done; 653 lastT = nextT; 654 lenAtLastT = lenAtNextT; 655 nextT += (1 << (REC_LIMIT - recLevel)) * MIN_T_INC; 656 lenAtNextT += len; 657 // invalidate caches 658 flatLeafCoefCache[2] = -1.0f; 659 cachedHaveLowAcceleration = -1; 660 } else { 661 Helpers.subdivide(recCurveStack[recLevel], 0, 662 recCurveStack[recLevel+1], 0, 663 recCurveStack[recLevel], 0, curveType); 664 sides[recLevel] = Side.LEFT; 665 recLevel++; 666 goLeft(); 667 } 668 } 669 670 // this is a bit of a hack. It returns -1 if we're not on a leaf, and 671 // the length of the leaf if we are on a leaf. 672 private float onLeaf() { 673 float[] curve = recCurveStack[recLevel]; 674 float polyLen = 0.0f; 675 676 float x0 = curve[0], y0 = curve[1]; 677 for (int i = 2; i < curveType; i += 2) { 678 final float x1 = curve[i], y1 = curve[i+1]; 679 final float len = Helpers.linelen(x0, y0, x1, y1); 680 polyLen += len; 681 curLeafCtrlPolyLengths[i/2 - 1] = len; 682 x0 = x1; 683 y0 = y1; 684 } 685 686 final float lineLen = Helpers.linelen(curve[0], curve[1], 687 curve[curveType-2], 688 curve[curveType-1]); 689 if ((polyLen - lineLen) < ERR || recLevel == REC_LIMIT) { 690 return (polyLen + lineLen) / 2.0f; 691 } 692 return -1.0f; 693 } 694 } 695 696 @Override 697 public void curveTo(float x1, float y1, 698 float x2, float y2, 699 float x3, float y3) 700 { 701 final float[] _curCurvepts = curCurvepts; 702 _curCurvepts[0] = x0; _curCurvepts[1] = y0; 703 _curCurvepts[2] = x1; _curCurvepts[3] = y1; 704 _curCurvepts[4] = x2; _curCurvepts[5] = y2; 705 _curCurvepts[6] = x3; _curCurvepts[7] = y3; 706 somethingTo(8); 707 } 708 709 @Override 710 public void quadTo(float x1, float y1, float x2, float y2) { 711 final float[] _curCurvepts = curCurvepts; 712 _curCurvepts[0] = x0; _curCurvepts[1] = y0; 713 _curCurvepts[2] = x1; _curCurvepts[3] = y1; 714 _curCurvepts[4] = x2; _curCurvepts[5] = y2; 715 somethingTo(6); 716 } 717 718 @Override 719 public void closePath() { 720 lineTo(sx, sy); 721 if (firstSegidx > 0) { 722 if (!dashOn || needsMoveTo) { 723 out.moveTo(sx, sy); 724 } 725 emitFirstSegments(); 726 } 727 moveTo(sx, sy); 728 } 729 730 @Override 731 public void pathDone() { 732 if (firstSegidx > 0) { 733 out.moveTo(sx, sy); 734 emitFirstSegments(); 735 } 736 out.pathDone(); 737 738 // Dispose this instance: 739 dispose(); 740 } 741 } 742 | 121 sum += d; 122 } 123 float cycles = phase / sum; 124 if (phase < 0.0f) { 125 if (-cycles >= MAX_CYCLES) { 126 phase = 0.0f; 127 } else { 128 int fullcycles = FloatMath.floor_int(-cycles); 129 if ((fullcycles & dash.length & 1) != 0) { 130 dashOn = !dashOn; 131 } 132 phase += fullcycles * sum; 133 while (phase < 0.0f) { 134 if (--sidx < 0) { 135 sidx = dash.length - 1; 136 } 137 phase += dash[sidx]; 138 dashOn = !dashOn; 139 } 140 } 141 } else if (phase > 0.0f) { 142 if (cycles >= MAX_CYCLES) { 143 phase = 0.0f; 144 } else { 145 int fullcycles = FloatMath.floor_int(cycles); 146 if ((fullcycles & dash.length & 1) != 0) { 147 dashOn = !dashOn; 148 } 149 phase -= fullcycles * sum; 150 float d; 151 while (phase >= (d = dash[sidx])) { 152 phase -= d; 153 sidx = (sidx + 1) % dash.length; 154 dashOn = !dashOn; 155 } 156 } 157 } 158 159 this.dash = dash; 160 this.dashLen = dashLen; 161 this.phase = phase; 162 this.startPhase = phase; 163 this.startDashOn = dashOn; 164 this.startIdx = sidx; 165 this.starting = true; 166 this.needsMoveTo = false; 167 this.firstSegidx = 0; 168 169 this.recycleDashes = recycleDashes; 170 171 return this; // fluent API 172 } 173 174 /** 175 * Disposes this dasher: 176 * clean up before reusing this instance 177 */ 178 void dispose() { 179 if (DO_CLEAN_DIRTY) { 180 // Force zero-fill dirty arrays: 181 Arrays.fill(curCurvepts, 0.0f); 182 } 183 // Return arrays: 184 if (recycleDashes) { 185 dash = dashes_ref.putArray(dash); 186 } 187 firstSegmentsBuffer = firstSegmentsBuffer_ref.putArray(firstSegmentsBuffer); 188 } 189 190 public float[] copyDashArray(final float[] dashes) { 191 final int len = dashes.length; 192 final float[] newDashes; 193 if (len <= MarlinConst.INITIAL_ARRAY) { 194 newDashes = dashes_ref.initial; 195 } else { 196 if (DO_STATS) { 197 rdrCtx.stats.stat_array_dasher_dasher.add(len); 198 } 199 newDashes = dashes_ref.getArray(len); 200 } 201 System.arraycopy(dashes, 0, newDashes, 0, len); 202 return newDashes; 203 } 204 205 @Override 206 public void moveTo(float x0, float y0) { 207 if (firstSegidx != 0) { 208 out.moveTo(sx, sy); 209 emitFirstSegments(); 210 } 211 needsMoveTo = true; 212 this.idx = startIdx; 213 this.dashOn = this.startDashOn; 214 this.phase = this.startPhase; 215 this.sx = x0; 216 this.sy = y0; 217 this.x0 = x0; 218 this.y0 = y0; 219 this.starting = true; 220 } 221 222 private void emitSeg(float[] buf, int off, int type) { 223 switch (type) { 224 case 8: 225 out.curveTo(buf[off+0], buf[off+1], 226 buf[off+2], buf[off+3], 227 buf[off+4], buf[off+5]); 228 return; 229 case 6: 230 out.quadTo(buf[off+0], buf[off+1], 231 buf[off+2], buf[off+3]); 232 return; 233 case 4: 234 out.lineTo(buf[off], buf[off+1]); 235 return; 236 default: 237 } 238 } 239 240 private void emitFirstSegments() { 241 final float[] fSegBuf = firstSegmentsBuffer; 242 243 for (int i = 0, len = firstSegidx; i < len; ) { 244 int type = (int)fSegBuf[i]; 245 emitSeg(fSegBuf, i + 1, type); 246 i += (type - 1); 247 } 248 firstSegidx = 0; 249 } 250 // We don't emit the first dash right away. If we did, caps would be 251 // drawn on it, but we need joins to be drawn if there's a closePath() 252 // So, we store the path elements that make up the first dash in the 253 // buffer below. 254 private float[] firstSegmentsBuffer; // dynamic array 255 private int firstSegidx; 256 257 // precondition: pts must be in relative coordinates (relative to x0,y0) 258 private void goTo(final float[] pts, final int off, final int type, final boolean on) { 259 final int index = off + type; 260 final float x = pts[index - 4]; 261 final float y = pts[index - 3]; 262 263 if (on) { 264 if (starting) { 265 goTo_starting(pts, off, type); 266 } else { 267 if (needsMoveTo) { 268 needsMoveTo = false; 269 out.moveTo(x0, y0); 270 } 271 emitSeg(pts, off, type); 272 } 273 } else { 274 if (starting) { 275 // low probability test (hotspot) 276 starting = false; 277 } 278 needsMoveTo = true; 279 } 280 this.x0 = x; 281 this.y0 = y; 282 } 283 284 private void goTo_starting(final float[] pts, final int off, final int type) { 285 int len = type - 1; // - 2 + 1 286 int segIdx = firstSegidx; 287 float[] buf = firstSegmentsBuffer; 288 289 if (segIdx + len > buf.length) { 290 if (DO_STATS) { 291 rdrCtx.stats.stat_array_dasher_firstSegmentsBuffer 292 .add(segIdx + len); 293 } 294 firstSegmentsBuffer = buf 295 = firstSegmentsBuffer_ref.widenArray(buf, segIdx, 296 segIdx + len); 297 } 298 buf[segIdx++] = type; 299 len--; 300 // small arraycopy (2, 4 or 6) but with offset: 301 System.arraycopy(pts, off, buf, segIdx, len); 302 firstSegidx = segIdx + len; 303 } 304 305 @Override 306 public void lineTo(float x1, float y1) { 307 final float dx = x1 - x0; 308 final float dy = y1 - y0; 309 310 float len = dx*dx + dy*dy; 311 if (len == 0.0f) { 312 return; 313 } 314 len = (float) Math.sqrt(len); 315 316 // The scaling factors needed to get the dx and dy of the 317 // transformed dash segments. 318 final float cx = dx / len; 319 final float cy = dy / len; 320 321 final float[] _curCurvepts = curCurvepts; 322 final float[] _dash = dash; 323 final int _dashLen = this.dashLen; 324 325 int _idx = idx; 326 boolean _dashOn = dashOn; 327 float _phase = phase; 328 329 float leftInThisDashSegment; 330 float d, dashdx, dashdy, p; 331 332 while (true) { 333 d = _dash[_idx]; 334 leftInThisDashSegment = d - _phase; 335 336 if (len <= leftInThisDashSegment) { 337 _curCurvepts[0] = x1; 338 _curCurvepts[1] = y1; 339 340 goTo(_curCurvepts, 0, 4, _dashOn); 341 342 // Advance phase within current dash segment 343 _phase += len; 344 345 // TODO: compare float values using epsilon: 346 if (len == leftInThisDashSegment) { 347 _phase = 0.0f; 348 _idx = (_idx + 1) % _dashLen; 349 _dashOn = !_dashOn; 350 } 351 352 // Save local state: 353 idx = _idx; 354 dashOn = _dashOn; 355 phase = _phase; 356 return; 357 } 358 359 dashdx = d * cx; 360 dashdy = d * cy; 361 362 if (_phase == 0.0f) { 363 _curCurvepts[0] = x0 + dashdx; 364 _curCurvepts[1] = y0 + dashdy; 365 } else { 366 p = leftInThisDashSegment / d; 367 _curCurvepts[0] = x0 + p * dashdx; 368 _curCurvepts[1] = y0 + p * dashdy; 369 } 370 371 goTo(_curCurvepts, 0, 4, _dashOn); 372 373 len -= leftInThisDashSegment; 374 // Advance to next dash segment 375 _idx = (_idx + 1) % _dashLen; 376 _dashOn = !_dashOn; 377 _phase = 0.0f; 378 } 379 } 380 381 // shared instance in Dasher 382 private final LengthIterator li = new LengthIterator(); 383 384 // preconditions: curCurvepts must be an array of length at least 2 * type, 385 // that contains the curve we want to dash in the first type elements 386 private void somethingTo(int type) { 387 if (pointCurve(curCurvepts, type)) { 388 return; 389 } 390 final LengthIterator _li = li; 391 final float[] _curCurvepts = curCurvepts; 392 final float[] _dash = dash; 393 final int _dashLen = this.dashLen; 394 395 _li.initializeIterationOnCurve(_curCurvepts, type); 396 397 int _idx = idx; 398 boolean _dashOn = dashOn; 399 float _phase = phase; 400 401 // initially the current curve is at curCurvepts[0...type] 402 int curCurveoff = 0; 403 float lastSplitT = 0.0f; 404 float t; 405 float leftInThisDashSegment = _dash[_idx] - _phase; 406 407 while ((t = _li.next(leftInThisDashSegment)) < 1.0f) { 408 if (t != 0.0f) { 409 Helpers.subdivideAt((t - lastSplitT) / (1.0f - lastSplitT), 410 _curCurvepts, curCurveoff, 411 _curCurvepts, 0, 412 _curCurvepts, type, type); 413 lastSplitT = t; 414 goTo(_curCurvepts, 2, type, _dashOn); 415 curCurveoff = type; 416 } 417 // Advance to next dash segment 418 _idx = (_idx + 1) % _dashLen; 419 _dashOn = !_dashOn; 420 _phase = 0.0f; 421 leftInThisDashSegment = _dash[_idx]; 422 } 423 goTo(_curCurvepts, curCurveoff + 2, type, _dashOn); 424 _phase += _li.lastSegLen(); 425 if (_phase >= _dash[_idx]) { 426 _phase = 0.0f; 427 _idx = (_idx + 1) % _dashLen; 428 _dashOn = !_dashOn; 429 } 430 // Save local state: 431 idx = _idx; 432 dashOn = _dashOn; 433 phase = _phase; 434 // reset LengthIterator: 435 _li.reset(); 436 } 437 438 private static boolean pointCurve(float[] curve, int type) { 439 for (int i = 2; i < type; i++) { 440 if (curve[i] != curve[i-2]) { 441 return false; 442 } 443 } 444 return true; 445 } 446 447 // Objects of this class are used to iterate through curves. They return 448 // t values where the left side of the curve has a specified length. 449 // It does this by subdividing the input curve until a certain error 450 // condition has been met. A recursive subdivision procedure would 451 // return as many as 1<<limit curves, but this is an iterator and we 452 // don't need all the curves all at once, so what we carry out a 453 // lazy inorder traversal of the recursion tree (meaning we only move 454 // through the tree when we need the next subdivided curve). This saves 455 // us a lot of memory because at any one time we only need to store 456 // limit+1 curves - one for each level of the tree + 1. 457 // NOTE: the way we do things here is not enough to traverse a general 458 // tree; however, the trees we are interested in have the property that 459 // every non leaf node has exactly 2 children 460 static final class LengthIterator { 461 private enum Side {LEFT, RIGHT} 462 // Holds the curves at various levels of the recursion. The root 463 // (i.e. the original curve) is at recCurveStack[0] (but then it 464 // gets subdivided, the left half is put at 1, so most of the time 465 // only the right half of the original curve is at 0) 466 private final float[][] recCurveStack; // dirty 467 // sides[i] indicates whether the node at level i+1 in the path from 468 // the root to the current leaf is a left or right child of its parent. 469 private final Side[] sides; // dirty 470 private int curveType; 471 // lastT and nextT delimit the current leaf. 472 private float nextT; 473 private float lenAtNextT; 474 private float lastT; 475 private float lenAtLastT; 476 private float lenAtLastSplit; 477 private float lastSegLen; 478 // the current level in the recursion tree. 0 is the root. limit 479 // is the deepest possible leaf. 480 private int recLevel; 481 private boolean done; 691 lastT = nextT; 692 lenAtLastT = lenAtNextT; 693 nextT += (1 << (REC_LIMIT - recLevel)) * MIN_T_INC; 694 lenAtNextT += len; 695 // invalidate caches 696 flatLeafCoefCache[2] = -1.0f; 697 cachedHaveLowAcceleration = -1; 698 } else { 699 Helpers.subdivide(recCurveStack[recLevel], 0, 700 recCurveStack[recLevel+1], 0, 701 recCurveStack[recLevel], 0, curveType); 702 sides[recLevel] = Side.LEFT; 703 recLevel++; 704 goLeft(); 705 } 706 } 707 708 // this is a bit of a hack. It returns -1 if we're not on a leaf, and 709 // the length of the leaf if we are on a leaf. 710 private float onLeaf() { 711 final float[] curve = recCurveStack[recLevel]; 712 final int _curveType = curveType; 713 float polyLen = 0.0f; 714 715 float x0 = curve[0], y0 = curve[1]; 716 for (int i = 2; i < _curveType; i += 2) { 717 final float x1 = curve[i], y1 = curve[i+1]; 718 final float len = Helpers.linelen(x0, y0, x1, y1); 719 polyLen += len; 720 curLeafCtrlPolyLengths[i/2 - 1] = len; 721 x0 = x1; 722 y0 = y1; 723 } 724 725 final float lineLen = Helpers.linelen(curve[0], curve[1], 726 curve[_curveType-2], 727 curve[_curveType-1]); 728 if ((polyLen - lineLen) < ERR || recLevel == REC_LIMIT) { 729 return (polyLen + lineLen) / 2.0f; 730 } 731 return -1.0f; 732 } 733 } 734 735 @Override 736 public void curveTo(float x1, float y1, 737 float x2, float y2, 738 float x3, float y3) 739 { 740 final float[] _curCurvepts = curCurvepts; 741 _curCurvepts[0] = x0; _curCurvepts[1] = y0; 742 _curCurvepts[2] = x1; _curCurvepts[3] = y1; 743 _curCurvepts[4] = x2; _curCurvepts[5] = y2; 744 _curCurvepts[6] = x3; _curCurvepts[7] = y3; 745 somethingTo(8); 746 } 747 748 @Override 749 public void quadTo(float x1, float y1, float x2, float y2) { 750 final float[] _curCurvepts = curCurvepts; 751 _curCurvepts[0] = x0; _curCurvepts[1] = y0; 752 _curCurvepts[2] = x1; _curCurvepts[3] = y1; 753 _curCurvepts[4] = x2; _curCurvepts[5] = y2; 754 somethingTo(6); 755 } 756 757 @Override 758 public void closePath() { 759 lineTo(sx, sy); 760 if (firstSegidx != 0) { 761 if (!dashOn || needsMoveTo) { 762 out.moveTo(sx, sy); 763 } 764 emitFirstSegments(); 765 } 766 moveTo(sx, sy); 767 } 768 769 @Override 770 public void pathDone() { 771 if (firstSegidx != 0) { 772 out.moveTo(sx, sy); 773 emitFirstSegments(); 774 } 775 out.pathDone(); 776 777 // Dispose this instance: 778 dispose(); 779 } 780 } 781 |