- for(int i=0; i<hiddenColumns.size(); i++)
- {
- int[] region = (int[]) hiddenColumns.elementAt(i);
- if(region[0] >= start)
- {
- region[0] -= change;
- }
- if (region[1]>= start) {
- region[1] -=change;
- }
- if (region[1]<region[0]) {
- hiddenColumns.removeElementAt(i--);
- }
-
- if(region[0]<0)
- region[0] = 0;
- if(region[1] <0)
- region[1] = 0;
- }
- }
- }
- /**
- * Adjust hidden column boundaries based on a series of column
- * additions or deletions in visible regions.
- * @param shiftrecord
- * @return
- */
- public ShiftList compensateForEdits(ShiftList shiftrecord) {
- if (shiftrecord!=null) {
- Vector shifts = shiftrecord.shifts;
- if (shifts!=null && shifts.size()>0) {
- int shifted=0;
- for (int i=0,j=shifts.size(); i<j; i++) {
- int[] sh = (int[]) shifts.elementAt(i);
- //compensateForEdit(shifted+sh[0], sh[1]);
- compensateForDelEdits(shifted+sh[0], sh[1]);
- shifted-=sh[1];
- }
- }
- return shiftrecord.getInverse();
- }
- return null;
- }
- /**
- * removes intersection of position,length ranges in deletions
- * from the start,end regions marked in intervals.
- * @param deletions
- * @param intervals
- * @return
- */
- private boolean pruneIntervalVector(Vector deletions, Vector intervals) {
- boolean pruned=false;
- int i=0,j=intervals.size()-1, s=0, t=deletions.size()-1;
- int hr[]=(int[]) intervals.elementAt(i);
- int sr[]=(int[]) deletions.elementAt(s);
- while (i<=j && s<=t) {
- boolean trailinghn=hr[1]>=sr[0];
- if (!trailinghn) {
- if (i<j)
- hr=(int[]) intervals.elementAt(++i);
- else
- i++;
- continue;
- }
- int endshift=sr[0]+sr[1]; // deletion ranges - -ve means an insert
- if (endshift<hr[0] || endshift<sr[0]) { // leadinghc disjoint or not a deletion
- if (s<t)
- sr=(int[]) deletions.elementAt(++s);
- else
- s++;
- continue;
- }
- boolean leadinghn=hr[0]>=sr[0];
- boolean leadinghc=hr[0]<endshift;
- boolean trailinghc=hr[1]<endshift;
- if (leadinghn) {
- if (trailinghc) {// deleted hidden region.
- intervals.removeElementAt(i);
- pruned=true;