Commit | Line | Data |
---|---|---|
3dde9149 MK |
1 | /******************************************************************************* |
2 | * Copyright (c) 2016 Ericsson | |
3 | * | |
4 | * All rights reserved. This program and the accompanying materials are | |
5 | * made available under the terms of the Eclipse Public License v1.0 which | |
6 | * accompanies this distribution, and is available at | |
7 | * http://www.eclipse.org/legal/epl-v10.html | |
8 | *******************************************************************************/ | |
9 | ||
10 | package org.eclipse.tracecompass.analysis.timing.core.tests.store; | |
11 | ||
12 | import static org.eclipse.tracecompass.common.core.NonNullUtils.checkNotNull; | |
13 | import static org.junit.Assert.assertEquals; | |
14 | import static org.junit.Assert.assertFalse; | |
15 | import static org.junit.Assert.assertTrue; | |
16 | ||
17 | import java.util.Arrays; | |
18 | import java.util.List; | |
19 | ||
20 | import org.eclipse.jdt.annotation.NonNull; | |
21 | import org.eclipse.tracecompass.internal.analysis.timing.core.store.ArrayListStore; | |
22 | import org.eclipse.tracecompass.segmentstore.core.BasicSegment; | |
23 | import org.eclipse.tracecompass.segmentstore.core.ISegment; | |
24 | import org.eclipse.tracecompass.segmentstore.core.ISegmentStore; | |
25 | import org.eclipse.tracecompass.segmentstore.core.treemap.TreeMapStore; | |
26 | import org.junit.After; | |
27 | import org.junit.Before; | |
28 | import org.junit.Test; | |
29 | ||
30 | import com.google.common.collect.ImmutableList; | |
31 | import com.google.common.collect.Iterables; | |
32 | import com.google.common.collect.Lists; | |
33 | ||
34 | /** | |
35 | * Unit tests for intersecting elements in an ArrayListStore | |
36 | * | |
37 | * Originally the TreeMapStoreTest, copied for this internal implementation. The | |
38 | * test was barely changed as it tests the interface and not the internals. | |
39 | * | |
40 | * @author France Lapointe Nguyen | |
41 | * @author Matthew Khouzam | |
42 | */ | |
43 | public class ArrayListStoreTest { | |
44 | ||
45 | private ISegmentStore<@NonNull ISegment> fSegmentStore; | |
46 | ||
47 | private static final @NonNull ISegment SEGMENT_2_6 = new BasicSegment(2, 6); | |
48 | private static final @NonNull ISegment SEGMENT_4_6 = new BasicSegment(4, 6); | |
49 | private static final @NonNull ISegment SEGMENT_4_8 = new BasicSegment(4, 8); | |
50 | private static final @NonNull ISegment SEGMENT_6_8 = new BasicSegment(6, 8); | |
51 | private static final @NonNull ISegment SEGMENT_10_14 = new BasicSegment(10, 14); | |
52 | ||
53 | private static final List<ISegment> SEGMENTS = ImmutableList.of(SEGMENT_2_6, SEGMENT_4_6, SEGMENT_4_8, SEGMENT_6_8, SEGMENT_10_14); | |
54 | private static final List<ISegment> REVERSE_SEGMENTS = Lists.reverse(SEGMENTS); | |
55 | ||
56 | /** | |
57 | * Initialize data (test vector) that will be tested | |
58 | */ | |
59 | @Before | |
60 | public void setup() { | |
61 | fSegmentStore = new ArrayListStore<>(); | |
62 | for (ISegment segment : SEGMENTS) { | |
63 | fSegmentStore.add(checkNotNull(segment)); | |
64 | } | |
65 | } | |
66 | ||
67 | /** | |
68 | * Dispose of the segment store | |
69 | */ | |
70 | @After | |
71 | public void teardown() { | |
72 | fSegmentStore.dispose(); | |
73 | } | |
74 | ||
75 | /** | |
76 | * Testing method size() | |
77 | */ | |
78 | @Test | |
79 | public void testSize() { | |
80 | assertEquals(SEGMENTS.size(), fSegmentStore.size()); | |
81 | } | |
82 | ||
83 | /** | |
84 | * Test the contains() method. | |
85 | */ | |
86 | @Test | |
87 | public void testContains() { | |
88 | ISegment otherSegment = new BasicSegment(0, 20); | |
89 | ||
90 | assertTrue(fSegmentStore.contains(SEGMENT_2_6)); | |
91 | assertTrue(fSegmentStore.contains(SEGMENT_4_8)); | |
92 | assertFalse(fSegmentStore.contains(otherSegment)); | |
93 | } | |
94 | ||
95 | /** | |
96 | * Test the toArray() method. | |
97 | */ | |
98 | @Test | |
99 | public void testToObjectArray() { | |
100 | Object[] array = fSegmentStore.toArray(); | |
101 | ||
102 | assertEquals(SEGMENTS.size(), array.length); | |
103 | assertTrue(Arrays.asList(array).containsAll(SEGMENTS)); | |
104 | } | |
105 | ||
106 | /** | |
107 | * Test the toArray(T[]) method. | |
108 | */ | |
109 | @Test | |
110 | public void testToSpecificArray() { | |
111 | ISegment[] array = fSegmentStore.toArray(new ISegment[0]); | |
112 | ||
113 | assertEquals(SEGMENTS.size(), array.length); | |
114 | assertTrue(Arrays.asList(array).containsAll(SEGMENTS)); | |
115 | } | |
116 | ||
117 | /** | |
118 | * Test the toArray(T[]) method with a subtype of ISegment. | |
119 | */ | |
120 | @Test | |
121 | public void testToSpecifyArraySubtype() { | |
122 | TreeMapStore<@NonNull BasicSegment> tms2 = new TreeMapStore<>(); | |
123 | BasicSegment otherSegment = new BasicSegment(2, 6); | |
124 | tms2.add(otherSegment); | |
125 | BasicSegment[] array = tms2.toArray(new BasicSegment[0]); | |
126 | ||
127 | assertEquals(1, array.length); | |
128 | assertTrue(Arrays.asList(array).contains(otherSegment)); | |
129 | ||
130 | tms2.dispose(); | |
131 | } | |
132 | ||
133 | /** | |
134 | * Test the iteration order of the complete segment store. | |
135 | */ | |
136 | @Test | |
137 | public void testIterationOrder() { | |
138 | int i = 0; | |
139 | for (ISegment segment : fSegmentStore) { | |
140 | assertEquals(SEGMENTS.get(i++), segment); | |
141 | } | |
142 | } | |
143 | ||
144 | /** | |
145 | * Test the iteration order when the elements are not inserted in sorted | |
146 | * order. | |
147 | */ | |
148 | @Test | |
149 | public void testIterationOrderNonSortedInsertion() { | |
150 | /* Prepare the segment store, we don't use the 'fixture' in this test */ | |
151 | TreeMapStore<@NonNull ISegment> store = new TreeMapStore<>(); | |
152 | for (ISegment segment : REVERSE_SEGMENTS) { | |
153 | store.add(checkNotNull(segment)); | |
154 | } | |
155 | ||
156 | /* | |
157 | * Test each element one by one, the iteration order should follow the | |
158 | * start times, not the insertion order. | |
159 | */ | |
160 | int i = 0; | |
161 | for (ISegment segment : store) { | |
162 | assertEquals(SEGMENTS.get(i++), segment); | |
163 | } | |
164 | ||
165 | /* Manually dispose our own store */ | |
166 | store.dispose(); | |
167 | } | |
168 | ||
169 | /** | |
170 | * Testing method getIntersectingElements(long start, long end) | |
171 | */ | |
172 | @Test | |
173 | public void testGetIntersectingElementsRange() { | |
174 | ||
175 | Iterable<ISegment> intersectingElements; | |
176 | ||
177 | /* | |
178 | * Range that does not include any segment | |
179 | */ | |
180 | intersectingElements = fSegmentStore.getIntersectingElements(16, 20); | |
181 | assertEquals(0, Iterables.size(intersectingElements)); | |
182 | ||
183 | /* | |
184 | * Range start time : Before first segment start time Range end time : | |
185 | * After last segment end time | |
186 | */ | |
187 | intersectingElements = fSegmentStore.getIntersectingElements(1, 15); | |
188 | assertEquals(5, Iterables.size(intersectingElements)); | |
189 | ||
190 | /* | |
191 | * Range start time : On first segment start time Range end time : On | |
192 | * last segment end time | |
193 | */ | |
194 | intersectingElements = fSegmentStore.getIntersectingElements(2, 14); | |
195 | assertEquals(5, Iterables.size(intersectingElements)); | |
196 | ||
197 | /* | |
198 | * Range start time : After one segment start time Range end time : | |
199 | * Before one segment end time | |
200 | */ | |
201 | intersectingElements = fSegmentStore.getIntersectingElements(11, 13); | |
202 | assertEquals(1, Iterables.size(intersectingElements)); | |
203 | assertEquals(SEGMENT_10_14, Iterables.getOnlyElement(intersectingElements)); | |
204 | ||
205 | /* | |
206 | * Range start time : On one segment start time Range end time : On one | |
207 | * segment end time | |
208 | */ | |
209 | intersectingElements = fSegmentStore.getIntersectingElements(10, 14); | |
210 | assertEquals(1, Iterables.size(intersectingElements)); | |
211 | assertEquals(SEGMENT_10_14, Iterables.getOnlyElement(intersectingElements)); | |
212 | ||
213 | /* | |
214 | * Range start time : On last segment end time Range end time : After | |
215 | * last segment end time | |
216 | */ | |
217 | intersectingElements = fSegmentStore.getIntersectingElements(14, 18); | |
218 | assertEquals(1, Iterables.size(intersectingElements)); | |
219 | assertEquals(SEGMENT_10_14, Iterables.getOnlyElement(intersectingElements)); | |
220 | ||
221 | /* | |
222 | * Range start time : Before first segment start time Range end time : | |
223 | * On first segment start time | |
224 | */ | |
225 | intersectingElements = fSegmentStore.getIntersectingElements(1, 2); | |
226 | assertEquals(1, Iterables.size(intersectingElements)); | |
227 | assertEquals(SEGMENT_2_6, Iterables.getOnlyElement(intersectingElements)); | |
228 | } | |
229 | ||
230 | /** | |
231 | * Testing method getIntersectingElements(long start, long end) | |
232 | */ | |
233 | @Test | |
234 | public void testGetIntersectingElementsTime() { | |
235 | ||
236 | Iterable<ISegment> intersectingElements; | |
237 | ||
238 | /* | |
239 | * Time between segment start time and end time | |
240 | */ | |
241 | intersectingElements = fSegmentStore.getIntersectingElements(3); | |
242 | assertEquals(1, Iterables.size(intersectingElements)); | |
243 | assertEquals(SEGMENT_2_6, Iterables.getOnlyElement(intersectingElements)); | |
244 | ||
245 | /* | |
246 | * Time on segment start time | |
247 | */ | |
248 | intersectingElements = fSegmentStore.getIntersectingElements(2); | |
249 | assertEquals(1, Iterables.size(intersectingElements)); | |
250 | assertEquals(SEGMENT_2_6, Iterables.getOnlyElement(intersectingElements)); | |
251 | ||
252 | /* | |
253 | * Time on segment end time | |
254 | */ | |
255 | intersectingElements = fSegmentStore.getIntersectingElements(14); | |
256 | assertEquals(1, Iterables.size(intersectingElements)); | |
257 | assertEquals(SEGMENT_10_14, Iterables.getOnlyElement(intersectingElements)); | |
258 | ||
259 | /* | |
260 | * Time overlapping many segments | |
261 | */ | |
262 | intersectingElements = fSegmentStore.getIntersectingElements(6); | |
263 | assertEquals(4, Iterables.size(intersectingElements)); | |
264 | ||
265 | /* | |
266 | * Time between segments | |
267 | */ | |
268 | intersectingElements = fSegmentStore.getIntersectingElements(9); | |
269 | assertEquals(0, Iterables.size(intersectingElements)); | |
270 | ||
271 | /* | |
272 | * Time before all segment start time | |
273 | */ | |
274 | intersectingElements = fSegmentStore.getIntersectingElements(1); | |
275 | assertEquals(0, Iterables.size(intersectingElements)); | |
276 | ||
277 | /* | |
278 | * Time after all segment end time | |
279 | */ | |
280 | intersectingElements = fSegmentStore.getIntersectingElements(15); | |
281 | assertEquals(0, Iterables.size(intersectingElements)); | |
282 | } | |
283 | ||
284 | /** | |
285 | * Testing method getIntersectingElements(long start, long end) | |
286 | */ | |
287 | @Test | |
288 | public void testDispose() { | |
289 | TreeMapStore<@NonNull ISegment> store = new TreeMapStore<>(); | |
290 | store.add(SEGMENT_2_6); | |
291 | store.dispose(); | |
292 | assertEquals(0, store.size()); | |
293 | } | |
294 | } |