Lines Matching refs:step
19 private int step;
48 step = -2;
284 * Gets the id of the current step. Values are as follows:<br/>
293 return step;
360 protected void updateOverride(int step, int lastStep, boolean isIterationStep, float delta) {
365 step = -1;
373 step = repeatCnt*2 + 1;
383 protected boolean isReverse(int step) {
384 return isYoyo && Math.abs(step%4) == 2;
387 protected boolean isValid(int step) {
388 return (step >= 0 && step <= repeatCnt*2) || repeatCnt < 0;
437 step = 0;
446 if (!isIterationStep && repeatCnt >= 0 && step < 0 && currentTime+deltaTime >= 0) {
447 assert step == -1;
449 step = 0;
455 updateOverride(step, step-1, isIterationStep, delta);
457 } else if (!isIterationStep && repeatCnt >= 0 && step > repeatCnt*2 && currentTime+deltaTime < 0) {
458 assert step == repeatCnt*2 + 1;
460 step = repeatCnt*2;
466 updateOverride(step, step+1, isIterationStep, delta);
471 while (isValid(step)) {
474 step -= 1;
480 if (isReverse(step)) forceStartValues(); else forceEndValues();
482 updateOverride(step, step+1, isIterationStep, delta);
486 step += 1;
492 if (isReverse(step)) forceEndValues(); else forceStartValues();
494 updateOverride(step, step-1, isIterationStep, delta);
498 step -= 1;
504 updateOverride(step, step+1, isIterationStep, delta);
507 if (step < 0 && repeatCnt >= 0) callCallback(TweenCallback.BACK_COMPLETE);
512 step += 1;
518 updateOverride(step, step-1, isIterationStep, delta);
521 if (step > repeatCnt*2 && repeatCnt >= 0) callCallback(TweenCallback.COMPLETE);
528 updateOverride(step, step, isIterationStep, delta);
541 isFinished = repeatCnt >= 0 && (step > repeatCnt*2 || step < 0);
