Lines Matching defs:i2
363 int i1 = 0, i2 = 0;
365 while (i1 < N1 && i2 < N2) {
366 if (DEBUG) Log.d(TAG, "Step: target @ " + i1 + " of " + N1 + ", other @ " + i2
368 if (uids2[i2] == uids1[i1]) {
369 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1
374 i2++;
375 } else if (uids2[i2] > uids1[i1]) {
376 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip i1");
379 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip i2");
380 i2++;
397 int i1 = 0, i2 = 0;
399 while (i1 < N1 && i2 < N2) {
400 if (DEBUG) Log.d(TAG, "Step: target @ " + i1 + " of " + N1 + ", other @ " + i2
402 if (uids2[i2] == uids1[i1] && names2[i2].equals(names1[i1])) {
403 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1
411 i2++;
412 } else if (uids2[i2] > uids1[i1]
413 || (uids2[i2] == uids1[i1] && names2[i2].compareTo(names1[i1]) > 0)) {
414 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip i1");
417 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip i2");
418 i2++;
457 int i1 = 0, i2 = 0;
460 while (i1 < N1 || i2 < N2) {
461 if (DEBUG) Log.d(TAG, "Step: target @ " + i1 + " of " + N1 + ", other @ " + i2
463 if (i1 >= N1 || (i2 < N2 && uids2[i2] < uids1[i1])) {
465 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1
466 + ": insert " + uids2[i2]);
470 uids1[0] = uids2[i2];
476 uids1[i1] = uids2[i2];
479 uids1[i1] = uids2[i2];
482 sNewbWork = addWork(sNewbWork, uids2[i2]);
486 i2++;
490 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip");
491 if (i2 < N2 && uids2[i2] == uids1[i1]) {
492 i2++;
498 while (i1 < N1 && (i2 >= N2 || uids2[i2] > uids1[i1])) {
499 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + ": remove " + uids1[i1]);
509 if (i1 < N1 && i2 < N2 && uids2[i2] == uids1[i1]) {
510 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip");
512 i2++;
527 private int compare(WorkSource other, int i1, int i2) {
528 final int diff = mUids[i1] - other.mUids[i2];
532 return mNames[i1].compareTo(other.mNames[i2]);
548 int i1 = 0, i2 = 0;
551 while (i1 < mNum || i2 < N2) {
552 if (DEBUG) Log.d(TAG, "Step: target @ " + i1 + " of " + mNum + ", other @ " + i2
555 if (i1 >= mNum || (i2 < N2 && (diff=compare(other, i1, i2)) > 0)) {
558 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + mNum
559 + ": insert " + uids2[i2] + " " + names2[i2]);
560 insert(i1, uids2[i2], names2[i2]);
562 sNewbWork = addWork(sNewbWork, uids2[i2], names2[i2]);
565 i2++;
568 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + mNum + ": skip");
569 if (i2 < N2 && diff == 0) {
570 i2++;
577 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + ": remove " + mUids[i1]
584 diff = i2 < N2 ? compare(other, i1, i2) : -1;
594 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + mNum + ": skip");
596 i2++;