diff options
Diffstat (limited to 'xmerge/java/org/openoffice/xmerge/merger/diff/ObjectArrayIterator.java')
| -rw-r--r-- | xmerge/java/org/openoffice/xmerge/merger/diff/ObjectArrayIterator.java | 210 |
1 files changed, 0 insertions, 210 deletions
diff --git a/xmerge/java/org/openoffice/xmerge/merger/diff/ObjectArrayIterator.java b/xmerge/java/org/openoffice/xmerge/merger/diff/ObjectArrayIterator.java deleted file mode 100644 index e69a3714871a..000000000000 --- a/xmerge/java/org/openoffice/xmerge/merger/diff/ObjectArrayIterator.java +++ /dev/null @@ -1,210 +0,0 @@ -/************************************************************************ - * - * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. - * - * Copyright 2000, 2010 Oracle and/or its affiliates. - * - * OpenOffice.org - a multi-platform office productivity suite - * - * This file is part of OpenOffice.org. - * - * OpenOffice.org is free software: you can redistribute it and/or modify - * it under the terms of the GNU Lesser General Public License version 3 - * only, as published by the Free Software Foundation. - * - * OpenOffice.org is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU Lesser General Public License version 3 for more details - * (a copy is included in the LICENSE file that accompanied this code). - * - * You should have received a copy of the GNU Lesser General Public License - * version 3 along with OpenOffice.org. If not, see - * <http://www.openoffice.org/license.html> - * for a copy of the LGPLv3 License. - * - ************************************************************************/ - -package org.openoffice.xmerge.merger.diff; - -import org.openoffice.xmerge.merger.Iterator; - -/** - * <p>This is an implementation of the <code>Iterator</code> interface. - * It is based upon a simple <code>Object</code> array.</p> - * - * <p>Note: this class is not thread safe for performance reasons.</p> - * - * @author smak - */ -public final class ObjectArrayIterator implements Iterator { - - - /** - * The <code>Object</code> array. - */ - private Object [] objArray; - private int currentPosition; - - - /** - * Private default constructor. - */ - private ObjectArrayIterator() { - // do not allow user new a ObjectArrayIterator without argument - } - - - /** - * Standard constructor. - * - * @param objArray The <code>Object</code> array. - */ - public ObjectArrayIterator(Object [] objArray) { - if (objArray != null) { - this.objArray = new Object[objArray.length]; - System.arraycopy(objArray, 0, this.objArray, 0, objArray.length); - currentPosition = 0; - } else { - this.objArray = new Object[0]; - } - } - - - public Object next() { - if (currentPosition < objArray.length - 1) { - currentPosition++; - return currentElement(); - } else { - return null; - } - - } - - - public Object previous() { - if (currentPosition > 0) { - currentPosition--; - return currentElement(); - } else { - return null; - } - } - - - public Object start() { - currentPosition = 0; - return currentElement(); - } - - - public Object end() { - if (objArray.length > 0) { - currentPosition = objArray.length - 1; - } - return currentElement(); - } - - - public Object currentElement() { - if (objArray.length > 0) { - return objArray[currentPosition]; - } else { - return null; - } - } - - - /** - * Replace current <code>Object</code>. - * - * @param object <code>Object</code> to replace. - */ - public void replace(Object object) { - objArray[currentPosition] = object; - } - - - /** - * Insert <code>Object</code> after current <code>Object</code>. - * - * @param object <code>Object</code> to insert. - */ - public void insert(Object object) { - Object [] objArray2 = new Object[objArray.length+1]; - - // copy the array content up before the currentposition - if (currentPosition > 0) { - System.arraycopy(objArray, 0, objArray2, 0, currentPosition); - } - - objArray2[currentPosition] = object; - - // copy the array content up after the currentposition - System.arraycopy(objArray, currentPosition, objArray2, - currentPosition + 1, objArray.length - currentPosition); - - objArray = objArray2; - currentPosition++; - } - - /** - * Append <code>Object</code> after current <code>Object</code>. - * - * @param object <code>Object</code> to append. - */ - public void append(Object object) { - Object [] objArray2 = new Object[objArray.length + 1]; - - int newPosition = currentPosition + 1; - - // copy the array content up to the currentposition - System.arraycopy(objArray, 0, objArray2, 0, newPosition); - - objArray2[newPosition] = object; - - // copy the array content up after the currentposition - if (currentPosition < objArray.length - 1) { - System.arraycopy(objArray, newPosition, objArray2, - newPosition + 1, objArray.length - newPosition); - } - - objArray = objArray2; - } - - /** - * Remove current <code>Object</code>. - */ - public void remove() { - Object [] objArray2 = new Object[objArray.length - 1]; - - // copy the array content up before the currentposition - if (currentPosition > 0) { - System.arraycopy(objArray, 0, objArray2, 0, currentPosition); - } - - // copy the array content up after the currentposition - if (currentPosition < objArray.length - 1) { - System.arraycopy(objArray, currentPosition + 1, objArray2, - currentPosition, objArray.length - currentPosition - 1); - } - - objArray = objArray2; - - if (currentPosition == objArray.length) - currentPosition--; - } - - public int elementCount() { - return objArray.length; - } - - public boolean equivalent(Object obj1, Object obj2) { - return obj1.equals(obj2); - } - - public void refresh() { - // do nothing - } -} - |