153 super.redo(); 154 this.object.restoreState(postState); 155 } 156 157 /** 158 * Gets the presentation name for this edit 159 */ 160 public String getPresentationName() { 161 return this.undoRedoName; 162 } 163 164 165 // 166 // Internal support 167 // 168 169 /** 170 * Remove redundant key/values in state hashtables. 171 */ 172 protected void removeRedundantState() { 173 Vector<Object> uselessKeys = new Vector<Object>(); 174 Enumeration myKeys = preState.keys(); 175 176 // Locate redundant state 177 while (myKeys.hasMoreElements()) { 178 Object myKey = myKeys.nextElement(); 179 if (postState.containsKey(myKey) && 180 postState.get(myKey).equals(preState.get(myKey))) { 181 uselessKeys.addElement(myKey); 182 } 183 } 184 185 // Remove redundant state 186 for (int i = uselessKeys.size()-1; i >= 0; i--) { 187 Object myKey = uselessKeys.elementAt(i); 188 preState.remove(myKey); 189 postState.remove(myKey); 190 } 191 } 192 193 } // End of class StateEdit | 153 super.redo(); 154 this.object.restoreState(postState); 155 } 156 157 /** 158 * Gets the presentation name for this edit 159 */ 160 public String getPresentationName() { 161 return this.undoRedoName; 162 } 163 164 165 // 166 // Internal support 167 // 168 169 /** 170 * Remove redundant key/values in state hashtables. 171 */ 172 protected void removeRedundantState() { 173 Vector<Object> uselessKeys = new Vector<>(); 174 Enumeration<Object> myKeys = preState.keys(); 175 176 // Locate redundant state 177 while (myKeys.hasMoreElements()) { 178 Object myKey = myKeys.nextElement(); 179 if (postState.containsKey(myKey) && 180 postState.get(myKey).equals(preState.get(myKey))) { 181 uselessKeys.addElement(myKey); 182 } 183 } 184 185 // Remove redundant state 186 for (int i = uselessKeys.size()-1; i >= 0; i--) { 187 Object myKey = uselessKeys.elementAt(i); 188 preState.remove(myKey); 189 postState.remove(myKey); 190 } 191 } 192 193 } // End of class StateEdit |