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
|
/*******************************************************************************
* Copyright (c) 2004, 2005 IBM Corporation and others.
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors:
* IBM Corporation - initial API and implementation
*******************************************************************************/
package org.eclipse.jst.jsp.ui.internal.text;
import java.io.IOException;
import org.eclipse.jface.text.BadLocationException;
import org.eclipse.jface.text.IDocument;
import org.eclipse.jface.text.IRegion;
import org.eclipse.jface.text.Region;
import org.eclipse.jface.text.source.ICharacterPairMatcher;
/**
* Helper class for match pairs of characters.
*
* Copied from org.eclipse.jdt.internal.ui.text so we don't have to
* depend on the org.eclipse.jdt.ui plugin.
*
* No modifications were made.
*/
class JavaPairMatcher implements ICharacterPairMatcher {
protected char[] fPairs;
protected IDocument fDocument;
protected int fOffset;
protected int fStartPos;
protected int fEndPos;
protected int fAnchor;
protected JavaCodeReader fReader = new JavaCodeReader();
public JavaPairMatcher(char[] pairs) {
fPairs = pairs;
}
/* (non-Javadoc)
* @see org.eclipse.jface.text.source.ICharacterPairMatcher#match(org.eclipse.jface.text.IDocument, int)
*/
public IRegion match(IDocument document, int offset) {
fOffset = offset;
if (fOffset < 0)
return null;
fDocument = document;
if (fDocument != null && matchPairsAt() && fStartPos != fEndPos)
return new Region(fStartPos, fEndPos - fStartPos + 1);
return null;
}
/* (non-Javadoc)
* @see org.eclipse.jface.text.source.ICharacterPairMatcher#getAnchor()
*/
public int getAnchor() {
return fAnchor;
}
/* (non-Javadoc)
* @see org.eclipse.jface.text.source.ICharacterPairMatcher#dispose()
*/
public void dispose() {
clear();
fDocument = null;
fReader = null;
}
/*
* @see org.eclipse.jface.text.source.ICharacterPairMatcher#clear()
*/
public void clear() {
if (fReader != null) {
try {
fReader.close();
}
catch (IOException x) {
// ignore
}
}
}
protected boolean matchPairsAt() {
int i;
int pairIndex1 = fPairs.length;
int pairIndex2 = fPairs.length;
fStartPos = -1;
fEndPos = -1;
// get the chars preceding and following the start position
try {
char prevChar = fDocument.getChar(Math.max(fOffset - 1, 0));
// modified behavior for http://dev.eclipse.org/bugs/show_bug.cgi?id=16879
// char nextChar= fDocument.getChar(fOffset);
// search for opening peer character next to the activation point
for (i = 0; i < fPairs.length; i = i + 2) {
// if (nextChar == fPairs[i]) {
// fStartPos= fOffset;
// pairIndex1= i;
// } else
if (prevChar == fPairs[i]) {
fStartPos = fOffset - 1;
pairIndex1 = i;
}
}
// search for closing peer character next to the activation point
for (i = 1; i < fPairs.length; i = i + 2) {
if (prevChar == fPairs[i]) {
fEndPos = fOffset - 1;
pairIndex2 = i;
}
// else if (nextChar == fPairs[i]) {
// fEndPos= fOffset;
// pairIndex2= i;
// }
}
if (fEndPos > -1) {
fAnchor = RIGHT;
fStartPos = searchForOpeningPeer(fEndPos, fPairs[pairIndex2 - 1], fPairs[pairIndex2], fDocument);
if (fStartPos > -1)
return true;
else
fEndPos = -1;
}
else if (fStartPos > -1) {
fAnchor = LEFT;
fEndPos = searchForClosingPeer(fStartPos, fPairs[pairIndex1], fPairs[pairIndex1 + 1], fDocument);
if (fEndPos > -1)
return true;
else
fStartPos = -1;
}
}
catch (BadLocationException x) {
}
catch (IOException x) {
}
return false;
}
protected int searchForClosingPeer(int offset, int openingPeer, int closingPeer, IDocument document) throws IOException {
fReader.configureForwardReader(document, offset + 1, document.getLength(), true, true);
int stack = 1;
int c = fReader.read();
while (c != JavaCodeReader.EOF) {
if (c == openingPeer && c != closingPeer)
stack++;
else if (c == closingPeer)
stack--;
if (stack == 0)
return fReader.getOffset();
c = fReader.read();
}
return -1;
}
protected int searchForOpeningPeer(int offset, int openingPeer, int closingPeer, IDocument document) throws IOException {
fReader.configureBackwardReader(document, offset, true, true);
int stack = 1;
int c = fReader.read();
while (c != JavaCodeReader.EOF) {
if (c == closingPeer && c != openingPeer)
stack++;
else if (c == openingPeer)
stack--;
if (stack == 0)
return fReader.getOffset();
c = fReader.read();
}
return -1;
}
}
|
