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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
|
/* StringContent.java --
Copyright (C) 2005 Free Software Foundation, Inc.
This file is part of GNU Classpath.
GNU Classpath is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
GNU Classpath 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
General Public License for more details.
You should have received a copy of the GNU General Public License
along with GNU Classpath; see the file COPYING. If not, write to the
Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA.
Linking this library statically or dynamically with other modules is
making a combined work based on this library. Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.
As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module. An independent module is a module which is not derived from
or based on this library. If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so. If you do not wish to do so, delete this
exception statement from your version. */
package javax.swing.text;
import java.io.Serializable;
import java.util.Iterator;
import java.util.Vector;
import javax.swing.undo.AbstractUndoableEdit;
import javax.swing.undo.CannotRedoException;
import javax.swing.undo.CannotUndoException;
import javax.swing.undo.UndoableEdit;
/**
* An implementation of the <code>AbstractDocument.Content</code>
* interface useful for small documents or debugging. The character
* content is a simple character array. It's not really efficient.
*
* <p>Do not use this class for large size.</p>
*/
public final class StringContent implements AbstractDocument.Content, Serializable
{
// This is package-private to avoid an accessor method.
char[] content;
private int count;
private Vector positions = new Vector();
private class InsertUndo extends AbstractUndoableEdit
{
private int start;
private int length;
private String redoContent;
public InsertUndo(int start, int length)
{
super();
this.start = start;
this.length = length;
}
public void undo()
{
super.undo();
try
{
StringContent.this.checkLocation(this.start, this.length);
this.redoContent = new String(StringContent.this.content, this.start, this.length);
StringContent.this.remove(this.start, this.length);
}
catch (BadLocationException b)
{
throw new CannotUndoException();
}
}
public void redo()
{
super.redo();
try
{
StringContent.this.insertString(this.start, this.redoContent);
}
catch (BadLocationException b)
{
throw new CannotRedoException();
}
}
}
private class RemoveUndo extends AbstractUndoableEdit
{
private int start;
private String undoString;
public RemoveUndo(int start, String str)
{
super();
this.start = start;
this.undoString = str;
}
public void undo()
{
super.undo();
try
{
StringContent.this.insertString(this.start, this.undoString);
}
catch (BadLocationException bad)
{
throw new CannotUndoException();
}
}
public void redo()
{
super.redo();
try
{
int end = this.undoString.length();
StringContent.this.remove(this.start, end);
}
catch (BadLocationException bad)
{
throw new CannotRedoException();
}
}
}
private class StickyPosition implements Position
{
private int offset = -1;
public StickyPosition(int offset)
{
this.offset = offset;
}
// This is package-private to avoid an accessor method.
void setOffset(int offset)
{
this.offset = this.offset >= 0 ? offset : -1;
}
/**
* Should be >=0.
*/
public int getOffset()
{
return offset < 0 ? 0 : offset;
}
}
public StringContent()
{
this(1);
}
public StringContent(int initialLength)
{
super();
if (initialLength < 1)
initialLength = 1;
this.content = new char[initialLength];
this.content[0] = '\n';
this.count = 1;
}
protected Vector getPositionsInRange(Vector v,
int offset,
int length)
{
Vector refPos = new Vector();
Iterator iter = this.positions.iterator();
while(iter.hasNext())
{
Position p = (Position)iter.next();
if ((offset <= p.getOffset())
&& (p.getOffset() <= (offset + length)))
refPos.add(p);
}
return refPos;
}
public Position createPosition(int offset) throws BadLocationException
{
if (offset < this.count || offset > this.count)
checkLocation(offset, 0);
StickyPosition sp = new StickyPosition(offset);
this.positions.add(sp);
return sp;
}
public int length()
{
return this.count;
}
public UndoableEdit insertString(int where, String str)
throws BadLocationException
{
checkLocation(where, 0);
if (where == this.count)
throw new BadLocationException("Invalid location", 1);
if (str == null)
throw new NullPointerException();
char[] insert = str.toCharArray();
char[] temp = new char[this.content.length + insert.length];
this.count += insert.length;
// Copy array and insert the string.
if (where > 0)
System.arraycopy(this.content, 0, temp, 0, where);
System.arraycopy(insert, 0, temp, where, insert.length);
System.arraycopy(this.content, where, temp, (where + insert.length), (temp.length - where - insert.length));
if (this.content.length < temp.length)
this.content = new char[temp.length];
// Copy the result in the original char array.
System.arraycopy(temp, 0, this.content, 0, temp.length);
// Move all the positions.
Vector refPos = getPositionsInRange(this.positions, where, temp.length - where);
Iterator iter = refPos.iterator();
while (iter.hasNext())
{
StickyPosition p = (StickyPosition)iter.next();
p.setOffset(p.getOffset() + str.length());
}
InsertUndo iundo = new InsertUndo(where, insert.length);
return iundo;
}
public UndoableEdit remove(int where, int nitems) throws BadLocationException
{
checkLocation(where, nitems);
char[] temp = new char[(this.content.length - nitems)];
this.count = this.count - nitems;
RemoveUndo rundo = new RemoveUndo(where, new String(this.content, where, nitems));
// Copy array.
System.arraycopy(this.content, 0, temp, 0, where);
System.arraycopy(this.content, where + nitems, temp, where, this.content.length - where - nitems);
this.content = new char[temp.length];
// Then copy the result in the original char array.
System.arraycopy(temp, 0, this.content, 0, this.content.length);
// Move all the positions.
Vector refPos = getPositionsInRange(this.positions, where, this.content.length + nitems - where);
Iterator iter = refPos.iterator();
while (iter.hasNext())
{
StickyPosition p = (StickyPosition)iter.next();
int result = p.getOffset() - nitems;
p.setOffset(result);
if (result < 0)
this.positions.remove(p);
}
return rundo;
}
public String getString(int where, int len) throws BadLocationException
{
checkLocation(where, len);
return new String (this.content, where, len);
}
public void getChars(int where, int len, Segment txt) throws BadLocationException
{
checkLocation(where, len);
if (txt != null)
{
txt.array = this.content;
txt.offset = where;
txt.count = len;
}
}
// This is package-private to avoid an accessor method.
void checkLocation(int where, int len) throws BadLocationException
{
if (where < 0)
throw new BadLocationException("Invalid location", 1);
else if (where > this.count)
throw new BadLocationException("Invalid location", this.count);
else if ((where + len)>this.count)
throw new BadLocationException("Invalid range", this.count);
}
}
|