- * int e_length = length-o; // new edit operation array length. // diff<0 -\r
- * can only happen before first insertion or match. - affects op and all\r
- * following // dif==0 - only when at first position of existing op - //\r
- * diff>0 - must preserve some existing operations int[] e_range = new\r
- * int[e_length]; System.arraycopy(this.range, o, e_range, 0, e_length);\r
- * char[] e_op = new char[e_length]; System.arraycopy(this.operation, o, e_op,\r
- * 0, e_length); length = o; // can now use add_operation to extend list. int\r
- * e_o=0; // current operation being edited. switch (op) { case M: switch\r
- * (e_op[e_o]) { case M: if (last_d && diff <= 0) { // reduce D's, if possible\r
- * if (range<=this.range[o-1]) { this.range[o - 1] -= range; } else {\r
- * this.range[o-1]=0; } if (this.range[o-1]==0) o--; // lose this op. }\r
- * e_range[e_o] += range; // just add more matched residues break; case I: //\r
- * change from insertion to match if (last_d && diff<=0) { // reduce D's, if\r
- * possible if (range<=this.range[o-1]) { this.range[o - 1] -= range; } else {\r
- * this.range[o-1]=0; } if (this.range[o-1]==0) o--; // lose this op. }\r
- * e_range[e_o] break; default: throw new Inp }\r
+ * int e_length = length-o; // new edit operation array length. //\r
+ * diff<0 - can only happen before first insertion or match. -\r
+ * affects op and all following // dif==0 - only when at first\r
+ * position of existing op - // diff>0 - must preserve some existing\r
+ * operations int[] e_range = new int[e_length];\r
+ * System.arraycopy(this.range, o, e_range, 0, e_length); char[] e_op\r
+ * = new char[e_length]; System.arraycopy(this.operation, o, e_op, 0,\r
+ * e_length); length = o; // can now use add_operation to extend\r
+ * list. int e_o=0; // current operation being edited. switch (op) {\r
+ * case M: switch (e_op[e_o]) { case M: if (last_d && diff <= 0) { //\r
+ * reduce D's, if possible if (range<=this.range[o-1]) { this.range[o\r
+ * - 1] -= range; } else { this.range[o-1]=0; } if\r
+ * (this.range[o-1]==0) o--; // lose this op. } e_range[e_o] +=\r
+ * range; // just add more matched residues break; case I: // change\r
+ * from insertion to match if (last_d && diff<=0) { // reduce D's, if\r
+ * possible if (range<=this.range[o-1]) { this.range[o - 1] -= range;\r
+ * } else { this.range[o-1]=0; } if (this.range[o-1]==0) o--; // lose\r
+ * this op. } e_range[e_o] break; default: throw new Inp }\r