Lines Matching full:eliminate
65 // if (i < 0) { array[i] = 1; // Can't eliminate. }
66 // else if (i >= array.length) { array[i] = 1; // Can't eliminate. }
67 // else { array[i] = 1; // Can eliminate. }
163 // if (j < array.length) array[j] = 1; // Can't eliminate.
227 // if (j > 0) array[j] = 1; // Can't eliminate.
290 // array[6] = 1; // Can't eliminate.
291 // array[5] = 1; // Can eliminate.
292 // array[4] = 1; // Can eliminate.
430 // for (int i=0; i<array.length; i++) { array[i] = 10; // Can eliminate with gvn. }
437 // for (int i=1; i<array.length; i++) { array[i] = 10; // Can eliminate. }
444 // for (int i=-1; i<array.length; i++) { array[i] = 10; // Can't eliminate. }
451 // for (int i=0; i<=array.length; i++) { array[i] = 10; // Can't eliminate. }
459 // array[i] = 10; // Can't eliminate due to overflow concern. }
466 // for (int i=1; i<array.length; i += 2) { array[i] = 10; // Can eliminate. }
547 // for (int i=array.length; i>0; i--) { array[i-1] = 10; // Can eliminate with gvn. }
554 // for (int i=array.length; i>1; i--) { array[i-1] = 10; // Can eliminate. }
561 // for (int i=array.length; i>-1; i--) { array[i-1] = 10; // Can't eliminate. }
568 // for (int i=array.length; i>=0; i--) { array[i-1] = 10; // Can't eliminate. }
575 // for (int i=array.length; i>0; i-=2) { array[i-1] = 10; // Can eliminate. }
656 // for (int i=0; i<10; i++) { array[i] = 10; // Can eliminate. }
664 // for (int i=1; i<10; i++) { array[i] = 10; // Can eliminate. }
672 // for (int i=0; i<=10; i++) { array[i] = 10; // Can't eliminate. }
680 // for (int i=1; i<10; i+=8) { array[i] = 10; // Can eliminate. }
762 // for (int i=0; i<array.length; i++) { array[array.length-i-1] = 10; // Can eliminate with gvn. }
769 // for (int i=1; i<array.length; i++) { array[array.length-i-1] = 10; // Can eliminate. }
776 // for (int i=0; i<=array.length; i++) { array[array.length-i] = 10; // Can't eliminate. }
