FindReplaceOptions optionsWhile = new FindReplaceOptions();
optionsWhile.setReplacingCallback(new ReplaceHandler());
WordDoc.getRange().replace(Pattern.compile("[tag(.+?)](.+?)[/tag]"), "", optionsWhile);
in ReplaceHandler we can use args.getMatchNode() to gets the node that contains the beginning of the match, how to gets the node that contains the end of the match?
or how to get the all node from match and repeat in the document?
thanks
You can meet this requirement by using the following code of Aspose.Words for Java:
Document doc = new Document("C:\\temp\\find replace test.docx");
ReplaceHandler handler = new ReplaceHandler();
FindReplaceOptions opts = new FindReplaceOptions();
opts.setDirection(FindReplaceDirection.BACKWARD);
opts.setReplacingCallback(handler);
doc.getRange().replace("pattern", "", opts);
doc.save("C:\\temp\\SuperscriptIssue\\awjava-20.11.docx");
static class ReplaceHandler implements IReplacingCallback {
public int replacing(ReplacingArgs e) throws Exception {
// This is a Run node that contains either the beginning or the complete match.
Node currentNode = e.getMatchNode();
// The first (and may be the only) run can contain text before the match,
// in this case it is necessary to split the run.
if (e.getMatchOffset() > 0)
currentNode = splitRun((Run) currentNode, e.getMatchOffset());
ArrayList runs = new ArrayList();
// Find all runs that contain parts of the match string.
int remainingLength = e.getMatch().group().length();
while ((remainingLength > 0) && (currentNode != null) && (currentNode.getText().length() <= remainingLength)) {
runs.add(currentNode);
remainingLength = remainingLength - currentNode.getText().length();
// Select the next Run node.
// Have to loop because there could be other nodes such as BookmarkStart etc.
do {
currentNode = currentNode.getNextSibling();
} while ((currentNode != null) && (currentNode.getNodeType() != NodeType.RUN));
}
// Split the last run that contains the match if there is any text left.
if ((currentNode != null) && (remainingLength > 0)) {
splitRun((Run) currentNode, remainingLength);
runs.add(currentNode);
}
Run lastNode = (Run) runs.get(runs.size() - 1);
System.out.println(lastNode.getText());
for (int i = 0; i < runs.size(); i++)
System.out.print(((Run) runs.get(i)).getText());
// Signal to the replace engine to do nothing because we have already done all what we wanted.
return ReplaceAction.SKIP;
}
/**
* Splits text of the specified run into two runs. Inserts the new run just
* after the specified run.
*/
private Run splitRun(Run run, int position) throws Exception {
Run afterRun = (Run) run.deepClone(true);
afterRun.setText(run.getText().substring(position));
run.setText(run.getText().substring((0), (0) + (position)));
run.getParentNode().insertAfter(afterRun, run);
return afterRun;
}
}Hi Awais, this code does not work when the matched text spans multiple different text styles.
Here is my Replacing Callback:
private class MyReplaceEvaluator implements IReplacingCallback {
int a = 0;
/**
* \* This is called during a replace operation each time a match is found.
* \* This method appends a number to the match string and returns it as a
* replacement string.
* \
*/
public int replacing(ReplacingArgs e) throws Exception {
Node currentNode = e.getMatchNode();
if (e.getMatchOffset() > 0)
currentNode = SplitRun((Run) currentNode, e.getMatchOffset());
ArrayList<Run> runs = new ArrayList<Run>();
int remainingLength = e.getMatch().group().length();
System.out.println(e.getMatch().group());
while ((remainingLength > 0) &&
(currentNode != null) &&
(currentNode.getText().length() <= remainingLength)) {
runs.add((Run) currentNode);
remainingLength = remainingLength - currentNode.getText().length();
do {
currentNode = currentNode.getNextSibling();
} while ((currentNode != null) && (currentNode.getNodeType() != NodeType.RUN));
}
if ((currentNode != null) && (remainingLength > 0)) {
SplitRun((Run) currentNode, remainingLength);
runs.add((Run) currentNode);
}
Document doc = (Document) e.getMatchNode().getDocument();
BookmarkCollection bookmark1 = doc.getRange().getBookmarks();
ArrayList<String> bookmarknames = new ArrayList<String>();
for (Bookmark myBookmark : bookmark1) {
bookmarknames.add(myBookmark.getName());
}
String bmname = "MyBookmark" + Integer.toString(a++);
while (bookmarknames.contains(bmname)) {
bmname = "MyBookmark" + Integer.toString(a++);
}
// Encapsulate matched string inside a Bookmark
DocumentBuilder builder = new DocumentBuilder(doc);
builder.moveTo((Run) runs.get(0));
builder.startBookmark(bmname);
BookmarkEnd bmEnd = builder.endBookmark(bmname);
Run lastRun = (Run) runs.get(runs.size() - 1);
lastRun.getParentNode().insertAfter(bmEnd, lastRun);
// Now remove all runs in the sequence.
// for (Run run : runs.listIterator()) {
// run.remove();
// }
// Signal to the replace engine to do nothing because we have already done all
// what we wanted.
return ReplaceAction.SKIP;
}
private Run splitRun(Run run, int position) throws Exception {
Run afterRun = (Run) run.deepClone(true);
afterRun.setText(run.getText().substring(position));
run.setText(run.getText().substring((0), (0) + (position)));
run.getParentNode().insertAfter(afterRun, run);
return afterRun;
}
}
From the test document, here is the text logged by System.out.println(e.getMatch().group()):
BEGIN BOOKMARK This will be included?This will also be included.?This is the next section. ?This report summarizes the testing that was performed per the protocol.?S.2.5 Test ANOTHER SECTION?All of this text should be included in the bookmark. ??Here is the end. END BOOKMARK
testbk.docx (14.7 KB)
response1.docx (11.9 KB)
@want5 Could you please provide the pattern you use in your code? It looks like the problem occurs because the the searched text is spanned to several paragraphs, but the code searches the matched Run nodes among the siblings. So the code stops searching one the last Run node in the current paragraph is encountered. It would be much easier if your document has markers for start and end of bookmark and search for these markers not for the whole text between them.
Here is the regex I have used:
"(BEGIN BOOKMARK ONE[\\s\\S]*?END BOOKMARK ONE)|(BEGIN BOOKMARK[\\s\\S]*?END BOOKMARK)"
The problem I am encountering is that my document has multiple types of markers that may have overlapping words, so I have to search for pairs. If it would be possible, I would like to have the IReplacingCallback add startBookmark and endBookmark at the beginning and end of the matches.
@hlgao As I have mentioned the matched content is spanned several paragraph:
ReplacingArgs.MatchNode returns the node that contains the beginning of the match. I think we can consider providing an additional property to ReplacingArgs that will return the node that contains the end of the match. but currently you can only traverse the document tree to find the end of the match. This might be quite complex task depending on the document tree complexity.
We have opened the following new ticket(s) in our internal issue tracking system and will deliver their fixes according to the terms mentioned in Free Support Policies.
Issue ID(s): WORDSNET-28070
You can obtain Paid Support Services if you need support on a priority basis, along with the direct access to our Paid Support management team.