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
|
/* ====================================================================
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
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==================================================================== */
package org.apache.poi;
import java.util.Collection;
import junit.framework.TestCase;
/**
* Parent class for POI JUnit TestCases, which provide additional
* features
*/
public class POITestCase extends TestCase {
public static void assertContains(String haystack, String needle) {
assertTrue(
"Unable to find expected text '" + needle + "' in text:\n" + haystack,
haystack.contains(needle)
);
}
public static void assertNotContained(String haystack, String needle) {
assertFalse(
"Unexpectedly found text '" + needle + "' in text:\n" + haystack,
haystack.contains(needle)
);
}
public static <T> void assertEquals(T[] expected, T[] actual)
{
assertEquals("Non-matching lengths", expected.length, actual.length);
for (int i=0; i<expected.length; i++) {
assertEquals("Mis-match at offset " + i, expected[i], actual[i]);
}
}
public static void assertEquals(byte[] expected, byte[] actual)
{
assertEquals("Non-matching lengths", expected.length, actual.length);
for (int i=0; i<expected.length; i++) {
assertEquals("Mis-match at offset " + i, expected[i], actual[i]);
}
}
public static <T> void assertContains(T needle, T[] haystack)
{
// Check
for (T thing : haystack) {
if (thing.equals(needle)) {
return;
}
}
// Failed, try to build a nice error
StringBuilder sb = new StringBuilder();
sb.append("Unable to find ").append(needle).append(" in [");
for (T thing : haystack) {
sb.append(" ").append(thing.toString()).append(" ,");
}
sb.setCharAt(sb.length()-1, ']');
fail(sb.toString());
}
public static <T> void assertContains(T needle, Collection<T> haystack) {
if (haystack.contains(needle)) {
return;
}
fail("Unable to find " + needle + " in " + haystack);
}
}
|
