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 |
|
package info.magnolia.imaging.util; |
35 |
|
|
36 |
|
import static org.junit.Assert.assertEquals; |
37 |
|
|
38 |
|
import org.junit.Test; |
39 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (103) |
Complexity: 18 |
Complexity Density: 0.21 |
|
40 |
|
public class PathSplitterTest { |
41 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
1PASS
|
|
42 |
1 |
@Test... |
43 |
|
public void emptyStringYieldsNoResults() { |
44 |
1 |
assertEquals(0, new PathSplitter("").count()); |
45 |
1 |
assertEquals("", new PathSplitter("").next()); |
46 |
1 |
assertEquals("", new PathSplitter("").skipTo(0)); |
47 |
1 |
assertEquals("", new PathSplitter("").remaining()); |
48 |
|
} |
49 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
1PASS
|
|
50 |
1 |
@Test... |
51 |
|
public void nullsAreHandledGracefullyCauseWeAreThatNice() { |
52 |
1 |
assertEquals(0, new PathSplitter(null).count()); |
53 |
1 |
assertEquals("", new PathSplitter(null).next()); |
54 |
1 |
assertEquals("", new PathSplitter(null).skipTo(0)); |
55 |
1 |
assertEquals("", new PathSplitter(null).remaining()); |
56 |
|
} |
57 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (12) |
Complexity: 1 |
Complexity Density: 0.08 |
1PASS
|
|
58 |
1 |
@Test... |
59 |
|
public void leadingAndTrailingSlashesAreIgnored() { |
60 |
1 |
PathSplitter ps = new PathSplitter("/foo/bar"); |
61 |
1 |
assertEquals(2, ps.count()); |
62 |
1 |
assertEquals("foo", ps.next()); |
63 |
1 |
assertEquals("bar", ps.next()); |
64 |
|
|
65 |
1 |
ps = new PathSplitter("/foo/bar/"); |
66 |
1 |
assertEquals(2, ps.count()); |
67 |
1 |
assertEquals("foo", ps.next()); |
68 |
1 |
assertEquals("bar", ps.next()); |
69 |
|
|
70 |
1 |
ps = new PathSplitter("foo/bar/"); |
71 |
1 |
assertEquals(2, ps.count()); |
72 |
1 |
assertEquals("foo", ps.next()); |
73 |
1 |
assertEquals("bar", ps.next()); |
74 |
|
} |
75 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1PASS
|
|
76 |
1 |
@Test... |
77 |
|
public void emptyElementsMatter() { |
78 |
1 |
final PathSplitter ps = new PathSplitter("/foo//bar/"); |
79 |
1 |
assertEquals(3, ps.count()); |
80 |
1 |
assertEquals("foo", ps.skipTo(0)); |
81 |
1 |
assertEquals("", ps.skipTo(1)); |
82 |
1 |
assertEquals("bar", ps.skipTo(2)); |
83 |
|
} |
84 |
|
|
85 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1PASS
|
|
86 |
1 |
@Test... |
87 |
|
public void emptyElementsBeforeTrailingSlashWorkToo() { |
88 |
1 |
final PathSplitter ps = new PathSplitter("/foo/bar//"); |
89 |
1 |
assertEquals(3, ps.count()); |
90 |
1 |
assertEquals("foo", ps.skipTo(0)); |
91 |
1 |
assertEquals("bar", ps.skipTo(1)); |
92 |
1 |
assertEquals("", ps.skipTo(2)); |
93 |
|
} |
94 |
|
|
95 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1PASS
|
|
96 |
1 |
@Test... |
97 |
|
public void emptyElementsAfterLeadingSlashWorkToo() { |
98 |
1 |
final PathSplitter ps = new PathSplitter("//foo/bar/"); |
99 |
1 |
assertEquals(3, ps.count()); |
100 |
1 |
assertEquals("", ps.skipTo(0)); |
101 |
1 |
assertEquals("foo", ps.skipTo(1)); |
102 |
1 |
assertEquals("bar", ps.skipTo(2)); |
103 |
|
} |
104 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1PASS
|
|
105 |
1 |
@Test... |
106 |
|
public void documentedExample() { |
107 |
1 |
final PathSplitter ps = new PathSplitter("/foo/bar/baz/a/b/c/d/e"); |
108 |
1 |
assertEquals(8, ps.count()); |
109 |
1 |
assertEquals("baz", ps.skipTo(2)); |
110 |
1 |
assertEquals("a", ps.next()); |
111 |
1 |
assertEquals("b/c/d/e", ps.remaining()); |
112 |
|
} |
113 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
1PASS
|
|
114 |
1 |
@Test... |
115 |
|
public void remainingCanBeCalledFromTheStartEvenIfThisSeemsQuiteUseless() { |
116 |
1 |
assertEquals("foo/bar/baz/a/b/c/d/e", new PathSplitter("/foo/bar/baz/a/b/c/d/e").remaining()); |
117 |
|
} |
118 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (3) |
Complexity: 1 |
Complexity Density: 0.33 |
1PASS
|
|
119 |
1 |
@Test... |
120 |
|
public void remainingCanBeCalledEvenIfWeAlreadyReachedTheLastElement() { |
121 |
1 |
final PathSplitter ps = new PathSplitter("/foo/bar"); |
122 |
1 |
assertEquals("bar", ps.skipTo(1)); |
123 |
1 |
assertEquals("", ps.remaining()); |
124 |
|
} |
125 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
1PASS
|
|
126 |
1 |
@Test... |
127 |
|
public void extensionIsTrimmedByDefault() { |
128 |
1 |
final PathSplitter ps = new PathSplitter("/foo/bar.html"); |
129 |
1 |
assertEquals(2, ps.count()); |
130 |
1 |
assertEquals("bar", ps.skipTo(1)); |
131 |
1 |
assertEquals("", ps.remaining()); |
132 |
|
} |
133 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1PASS
|
|
134 |
1 |
@Test... |
135 |
|
public void extensionCanBeKeptAndIsNotCountingAsAnElement() { |
136 |
1 |
final PathSplitter ps = new PathSplitter("/foo/bar.html", '/', false); |
137 |
1 |
assertEquals(2, ps.count()); |
138 |
1 |
assertEquals("foo", ps.next()); |
139 |
1 |
assertEquals("bar.html", ps.next()); |
140 |
1 |
assertEquals("", ps.remaining()); |
141 |
|
} |
142 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1PASS
|
|
143 |
1 |
@Test... |
144 |
|
public void dotsInPathNotAtTheEndAreNotTrimmed() { |
145 |
1 |
final PathSplitter ps = new PathSplitter("/foo.something/bar", '/', true); |
146 |
1 |
assertEquals(2, ps.count()); |
147 |
1 |
assertEquals("foo.something", ps.next()); |
148 |
1 |
assertEquals("bar", ps.next()); |
149 |
1 |
assertEquals("", ps.remaining()); |
150 |
|
} |
151 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1PASS
|
|
152 |
1 |
@Test... |
153 |
|
public void onlyOneToSplit() { |
154 |
1 |
final PathSplitter ps = new PathSplitter("foo", '/', true); |
155 |
1 |
assertEquals(1, ps.count()); |
156 |
1 |
assertEquals("foo", ps.next()); |
157 |
1 |
assertEquals("", ps.next()); |
158 |
1 |
assertEquals("", ps.remaining()); |
159 |
|
} |
160 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1PASS
|
|
161 |
1 |
@Test... |
162 |
|
public void dotsInPathOnlyOneToSplit() { |
163 |
1 |
final PathSplitter ps = new PathSplitter("/foo.ext", '/', false); |
164 |
1 |
assertEquals(1, ps.count()); |
165 |
1 |
assertEquals("foo.ext", ps.next()); |
166 |
1 |
assertEquals("", ps.next()); |
167 |
1 |
assertEquals("", ps.remaining()); |
168 |
|
} |
169 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (5) |
Complexity: 1 |
Complexity Density: 0.2 |
1PASS
|
|
170 |
1 |
@Test... |
171 |
|
public void dotsInPathOnlyOneToSplitTrimExtension() { |
172 |
1 |
final PathSplitter ps = new PathSplitter("foo.ext/", '/', true); |
173 |
1 |
assertEquals(1, ps.count()); |
174 |
1 |
assertEquals("foo", ps.next()); |
175 |
1 |
assertEquals("", ps.next()); |
176 |
1 |
assertEquals("", ps.remaining()); |
177 |
|
} |
178 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
1PASS
|
|
179 |
1 |
@Test... |
180 |
|
public void dotsInNames() { |
181 |
1 |
final PathSplitter ps = new PathSplitter("/foo.foo.foo/bar.ext", false); |
182 |
1 |
assertEquals("foo.foo.foo", ps.next()); |
183 |
1 |
assertEquals("bar.ext", ps.skipTo(1)); |
184 |
1 |
assertEquals("", ps.remaining()); |
185 |
|
} |
186 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
1PASS
|
|
187 |
1 |
@Test... |
188 |
|
public void nextAndSkipCallsDontOverlapEachOther() { |
189 |
1 |
final PathSplitter ps = new PathSplitter("/foo/bar"); |
190 |
1 |
assertEquals("foo", ps.next()); |
191 |
1 |
assertEquals("bar", ps.skipTo(1)); |
192 |
1 |
assertEquals("", ps.remaining()); |
193 |
|
} |
194 |
|
|
|
|
| 100% |
Uncovered Elements: 0 (4) |
Complexity: 1 |
Complexity Density: 0.25 |
1PASS
|
|
195 |
1 |
@Test... |
196 |
|
public void trimExtensionProperly() { |
197 |
1 |
final PathSplitter ps = new PathSplitter("/foo/bar.baz.extension", true); |
198 |
1 |
assertEquals("foo", ps.next()); |
199 |
1 |
assertEquals("bar.baz", ps.skipTo(1)); |
200 |
1 |
assertEquals("", ps.remaining()); |
201 |
|
} |
202 |
|
} |