Lines Matching defs:i2

340         int i1 = 0, i2 = 0;
342 while (i1 < N1 && i2 < N2) {
343 if (DEBUG) Log.d(TAG, "Step: target @ " + i1 + " of " + N1 + ", other @ " + i2
345 if (uids2[i2] == uids1[i1]) {
346 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1
351 i2++;
352 } else if (uids2[i2] > uids1[i1]) {
353 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip i1");
356 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip i2");
357 i2++;
374 int i1 = 0, i2 = 0;
376 while (i1 < N1 && i2 < N2) {
377 if (DEBUG) Log.d(TAG, "Step: target @ " + i1 + " of " + N1 + ", other @ " + i2
379 if (uids2[i2] == uids1[i1] && names2[i2].equals(names1[i1])) {
380 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1
388 i2++;
389 } else if (uids2[i2] > uids1[i1]
390 || (uids2[i2] == uids1[i1] && names2[i2].compareTo(names1[i1]) > 0)) {
391 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip i1");
394 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip i2");
395 i2++;
434 int i1 = 0, i2 = 0;
437 while (i1 < N1 || i2 < N2) {
438 if (DEBUG) Log.d(TAG, "Step: target @ " + i1 + " of " + N1 + ", other @ " + i2
440 if (i1 >= N1 || (i2 < N2 && uids2[i2] < uids1[i1])) {
442 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1
443 + ": insert " + uids2[i2]);
447 uids1[0] = uids2[i2];
453 uids1[i1] = uids2[i2];
456 uids1[i1] = uids2[i2];
459 sNewbWork = addWork(sNewbWork, uids2[i2]);
463 i2++;
467 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip");
468 if (i2 < N2 && uids2[i2] == uids1[i1]) {
469 i2++;
475 while (i1 < N1 && (i2 >= N2 || uids2[i2] > uids1[i1])) {
476 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + ": remove " + uids1[i1]);
486 if (i1 < N1 && i2 < N2 && uids2[i2] == uids1[i1]) {
487 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + N1 + ": skip");
489 i2++;
504 private int compare(WorkSource other, int i1, int i2) {
505 final int diff = mUids[i1] - other.mUids[i2];
509 return mNames[i1].compareTo(other.mNames[i2]);
525 int i1 = 0, i2 = 0;
528 while (i1 < mNum || i2 < N2) {
529 if (DEBUG) Log.d(TAG, "Step: target @ " + i1 + " of " + mNum + ", other @ " + i2
532 if (i1 >= mNum || (i2 < N2 && (diff=compare(other, i1, i2)) > 0)) {
535 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + mNum
536 + ": insert " + uids2[i2] + " " + names2[i2]);
537 insert(i1, uids2[i2], names2[i2]);
539 sNewbWork = addWork(sNewbWork, uids2[i2], names2[i2]);
542 i2++;
545 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + mNum + ": skip");
546 if (i2 < N2 && diff == 0) {
547 i2++;
554 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + ": remove " + mUids[i1]
561 diff = i2 < N2 ? compare(other, i1, i2) : -1;
571 if (DEBUG) Log.d(TAG, "i1=" + i1 + " i2=" + i2 + " N1=" + mNum + ": skip");
573 i2++;