1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
|
/************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2008 by Sun Microsystems, Inc.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* $RCSfile: ObjectArrayIterator.java,v $
* $Revision: 1.3 $
*
* 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
}
}
|
