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
|
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
package ifc.util;
import lib.MultiMethodTest;
import com.sun.star.util.SearchAlgorithms;
import com.sun.star.util.SearchFlags;
import com.sun.star.util.SearchOptions;
import com.sun.star.util.SearchResult;
import com.sun.star.util.XTextSearch;
/**
* Testing <code>com.sun.star.util.XTextSearch</code>
* interface methods :
* <ul>
* <li><code> setOptions()</code></li>
* <li><code> searchForward()</code></li>
* <li><code> searchBackward()</code></li>
* </ul> <p>
* Test is <b> NOT </b> multithread compilant. <p>
* @see com.sun.star.util.XTextSearch
*/
public class _XTextSearch extends MultiMethodTest {
// oObj filled by MultiMethodTest
public XTextSearch oObj = null ;
protected final String str = "acababaabcababadcdaa" ;
protected final int startPos = 2 , endPos = 20 ;
protected final String searchStr = "(ab)*a(c|d)+" ;
protected final int fStartRes = 10, fEndRes = 18 ;
protected final int bStartRes = 18, bEndRes = 14 ;
/**
* Sets options for searching regular expression in a string,
* ignoring case. <p>
* Has <b>OK</b> status if no runtime exceptions occurred.
*/
public void _setOptions() {
SearchOptions opt = new SearchOptions() ;
opt.algorithmType = SearchAlgorithms.REGEXP ;
opt.searchFlag = SearchFlags.ALL_IGNORE_CASE ;
opt.searchString = searchStr ;
oObj.setOptions(opt) ;
tRes.tested("setOptions()", true) ;
}
/**
* Tries to find a substring matching regular expression. <p>
* Has <b>OK</b> if the correct substring position returned.
*/
public void _searchForward() {
requiredMethod("setOptions()") ;
SearchResult res = oObj.searchForward(str, startPos, endPos) ;
log.println("Result of searching '" + searchStr + "' substring in \n'" +
str + "' string (" + res.subRegExpressions + " matches):") ;
for (int i = 0; i < res.subRegExpressions; i++)
log.println(" (" + res.startOffset[i] + ", " + res.endOffset[i] + ")") ;
tRes.tested("searchForward()", res.subRegExpressions > 0 &&
res.startOffset[0] == fStartRes && res.endOffset[0] == fEndRes) ;
}
/**
* Tries to find a substring matching regular expression walking
* backward. <p>
* Has <b>OK</b> if the correct substring position returned.
*/
public void _searchBackward() {
requiredMethod("setOptions()") ;
SearchResult res = oObj.searchBackward(str, endPos, startPos) ;
log.println("Result of searching '" + searchStr + "' substring in \n'" +
str + "' string (" + res.subRegExpressions + " matches):") ;
for (int i = 0; i < res.subRegExpressions; i++)
log.println(" (" + res.startOffset[i] + ", " + res.endOffset[i] + ")") ;
tRes.tested("searchBackward()", res.subRegExpressions > 0 &&
res.startOffset[0] == bStartRes && res.endOffset[0] == bEndRes) ;
}
}
|
