Changeset 8346 in josm for trunk/src/org/openstreetmap/josm/tools
- Timestamp:
- 2015-05-11T13:34:53+02:00 (10 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/src/org/openstreetmap/josm/tools/Diff.java
r8342 r8346 16 16 * 17 17 * Revision 1.13 2009/12/07 17:43:17 stuart 18 * Compute equiv _max for int[] ctor18 * Compute equivMax for int[] ctor 19 19 * 20 20 * Revision 1.12 2009/12/07 17:34:46 stuart … … 102 102 /** 1 more than the maximum equivalence value used for this or its 103 103 sibling file. */ 104 private int equiv _max = 1;104 private int equivMax = 1; 105 105 106 106 /** When set to true, the comparison uses a heuristic to speed it up. … … 111 111 /** When set to true, the algorithm returns a guarranteed minimal 112 112 set of changes. This makes things slower, sometimes much slower. */ 113 public boolean no _discards = false;113 public boolean noDiscards = false; 114 114 115 115 private int[] xvec, yvec; /* Vectors being compared. */ … … 352 352 if (xoff == xlim) { 353 353 while (yoff < ylim) { 354 filevec[1].changed _flag[1+filevec[1].realindexes[yoff++]] = true;354 filevec[1].changedFlag[1+filevec[1].realindexes[yoff++]] = true; 355 355 } 356 356 } else if (yoff == ylim) { 357 357 while (xoff < xlim) { 358 filevec[0].changed _flag[1+filevec[0].realindexes[xoff++]] = true;358 filevec[0].changedFlag[1+filevec[0].realindexes[xoff++]] = true; 359 359 } 360 360 } else { … … 524 524 525 525 int diags = 526 filevec[0].nondiscarded _lines + filevec[1].nondiscarded_lines + 3;526 filevec[0].nondiscardedLines + filevec[1].nondiscardedLines + 3; 527 527 fdiag = new int[diags]; 528 fdiagoff = filevec[1].nondiscarded _lines + 1;528 fdiagoff = filevec[1].nondiscardedLines + 1; 529 529 bdiag = new int[diags]; 530 bdiagoff = filevec[1].nondiscarded _lines + 1;531 532 compareseq (0, filevec[0].nondiscarded _lines,533 0, filevec[1].nondiscarded _lines);530 bdiagoff = filevec[1].nondiscardedLines + 1; 531 532 compareseq (0, filevec[0].nondiscardedLines, 533 0, filevec[1].nondiscardedLines); 534 534 fdiag = null; 535 535 bdiag = null; … … 543 543 of `struct change's -- an edit script. */ 544 544 return bld.build_script( 545 filevec[0].changed _flag,546 filevec[0].buffered _lines,547 filevec[1].changed _flag,548 filevec[1].buffered _lines545 filevec[0].changedFlag, 546 filevec[0].bufferedLines, 547 filevec[1].changedFlag, 548 filevec[1].bufferedLines 549 549 ); 550 550 … … 607 607 Allocate an extra element, always zero, at each end of each vector. 608 608 */ 609 changed _flag = new boolean[buffered_lines + 2];609 changedFlag = new boolean[bufferedLines + 2]; 610 610 } 611 611 … … 615 615 */ 616 616 int[] equivCount() { 617 int[] equiv_count = new int[equiv _max];618 for (int i = 0; i < buffered _lines; ++i) {617 int[] equiv_count = new int[equivMax]; 618 for (int i = 0; i < bufferedLines; ++i) { 619 619 ++equiv_count[equivs[i]]; 620 620 } … … 658 658 */ 659 659 private byte[] discardable(final int[] counts) { 660 final int end = buffered _lines;660 final int end = bufferedLines; 661 661 final byte[] discards = new byte[end]; 662 662 final int[] equivs = this.equivs; … … 692 692 */ 693 693 private void filterDiscards(final byte[] discards) { 694 final int end = buffered _lines;694 final int end = bufferedLines; 695 695 696 696 for (int i = 0; i < end; i++) … … 808 808 */ 809 809 private void discard(final byte[] discards) { 810 final int end = buffered _lines;810 final int end = bufferedLines; 811 811 int j = 0; 812 812 for (int i = 0; i < end; ++i) 813 if (no _discards || discards[i] == 0)813 if (noDiscards || discards[i] == 0) 814 814 { 815 815 undiscarded[j] = equivs[i]; 816 816 realindexes[j++] = i; 817 817 } else { 818 changed _flag[1+i] = true;819 } 820 nondiscarded _lines = j;818 changedFlag[1+i] = true; 819 } 820 nondiscardedLines = j; 821 821 } 822 822 823 823 FileData(int length) { 824 buffered _lines = length;824 bufferedLines = length; 825 825 equivs = new int[length]; 826 undiscarded = new int[buffered _lines];827 realindexes = new int[buffered _lines];826 undiscarded = new int[bufferedLines]; 827 realindexes = new int[bufferedLines]; 828 828 } 829 829 … … 834 834 Integer ir = h.get(data[i]); 835 835 if (ir == null) { 836 h.put(data[i],equivs[i] = equiv _max++);836 h.put(data[i],equivs[i] = equivMax++); 837 837 } else { 838 838 equivs[i] = ir.intValue(); … … 855 855 856 856 void shift_boundaries(FileData f) { 857 final boolean[] changed = changed _flag;858 final boolean[] other_changed = f.changed _flag;857 final boolean[] changed = changedFlag; 858 final boolean[] other_changed = f.changedFlag; 859 859 int i = 0; 860 860 int j = 0; 861 int i_end = buffered _lines;861 int i_end = bufferedLines; 862 862 int preceding = -1; 863 863 int other_preceding = -1; … … 930 930 931 931 /** Number of elements (lines) in this file. */ 932 private final int buffered _lines;932 private final int bufferedLines; 933 933 934 934 /** Vector, indexed by line number, containing an equivalence code for … … 946 946 947 947 /** Total number of nondiscarded lines. */ 948 private int nondiscarded _lines;948 private int nondiscardedLines; 949 949 950 950 /** Array, indexed by real origin-1 line number, 951 951 containing true for a line that is an insertion or a deletion. 952 952 The results of comparison are stored here. */ 953 private boolean[] changed _flag;953 private boolean[] changedFlag; 954 954 } 955 955 }
Note:
See TracChangeset
for help on using the changeset viewer.