1 /*******************************************************************************
2 * Copyright (c) 2015 Ericsson
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 *******************************************************************************/
10 package org
.eclipse
.tracecompass
.segmentstore
.core
.tests
.treemap
;
12 import static org
.eclipse
.tracecompass
.common
.core
.NonNullUtils
.checkNotNull
;
13 import static org
.junit
.Assert
.assertEquals
;
15 import java
.util
.List
;
17 import org
.eclipse
.tracecompass
.segmentstore
.core
.BasicSegment
;
18 import org
.eclipse
.tracecompass
.segmentstore
.core
.ISegment
;
19 import org
.eclipse
.tracecompass
.segmentstore
.core
.treemap
.TreeMapStore
;
20 import org
.junit
.After
;
21 import org
.junit
.Before
;
22 import org
.junit
.Test
;
24 import com
.google
.common
.collect
.ImmutableList
;
25 import com
.google
.common
.collect
.Iterables
;
26 import com
.google
.common
.collect
.Lists
;
29 * Unit tests for intersecting elements in a TreeMapStore
31 * @author France Lapointe Nguyen
33 public class TreeMapStoreTest
{
35 private TreeMapStore
<ISegment
> fSegmentStore
;
37 private static final ISegment SEGMENT_2_6
= new BasicSegment(2, 6);
38 private static final ISegment SEGMENT_4_6
= new BasicSegment(4, 6);
39 private static final ISegment SEGMENT_4_8
= new BasicSegment(4, 8);
40 private static final ISegment SEGMENT_6_8
= new BasicSegment(6, 8);
41 private static final ISegment SEGMENT_10_14
= new BasicSegment(10, 14);
43 private static final List
<ISegment
> SEGMENTS
= ImmutableList
.of(SEGMENT_2_6
, SEGMENT_4_6
, SEGMENT_4_8
, SEGMENT_6_8
, SEGMENT_10_14
);
44 private static final List
<ISegment
> REVERSE_SEGMENTS
= Lists
.reverse(SEGMENTS
);
47 * Initialize data (test vector) that will be tested
51 fSegmentStore
= new TreeMapStore
<>();
52 for (ISegment segment
: SEGMENTS
) {
53 fSegmentStore
.addElement(checkNotNull(segment
));
58 * Dispose of the segment store
61 public void teardown() {
62 fSegmentStore
.dispose();
66 * Testing method getNbElements
69 public void testGetNbElements() {
70 assertEquals(SEGMENTS
.size(), fSegmentStore
.getNbElements());
74 * Try adding duplicate elements, they should be ignored
77 public void testNoDuplicateElements() {
78 for (ISegment segment
: SEGMENTS
) {
79 fSegmentStore
.addElement(new BasicSegment(segment
.getStart(), segment
.getEnd()));
81 assertEquals(SEGMENTS
.size(), fSegmentStore
.getNbElements());
85 * Test the iteration order of the complete segment store.
88 public void testIterationOrder() {
90 for (ISegment segment
: fSegmentStore
) {
91 assertEquals(SEGMENTS
.get(i
++), segment
);
96 * Test the iteration order when the elements are not inserted in sorted
100 public void testIterationOrderNonSortedInsertion() {
101 /* Prepare the segment store, we don't use the 'fixture' in this test */
102 TreeMapStore
<ISegment
> store
= new TreeMapStore
<>();
103 for (ISegment segment
: REVERSE_SEGMENTS
) {
104 store
.addElement(checkNotNull(segment
));
108 * Test each element one by one, the iteration order should follow the
109 * start times, not the insertion order.
112 for (ISegment segment
: store
) {
113 assertEquals(SEGMENTS
.get(i
++), segment
);
116 /* Manually dispose our own store */
121 * Testing method getIntersectingElements(long start, long end)
124 public void testGetIntersectingElementsRange() {
126 Iterable
<ISegment
> intersectingElements
;
129 * Range that does not include any segment
131 intersectingElements
= fSegmentStore
.getIntersectingElements(16, 20);
132 assertEquals(0, Iterables
.size(intersectingElements
));
135 * Range start time : Before first segment start time
136 * Range end time : After last segment end time
138 intersectingElements
= fSegmentStore
.getIntersectingElements(1, 15);
139 assertEquals(5, Iterables
.size(intersectingElements
));
142 * Range start time : On first segment start time
143 * Range end time : On last segment end time
145 intersectingElements
= fSegmentStore
.getIntersectingElements(2, 14);
146 assertEquals(5, Iterables
.size(intersectingElements
));
149 * Range start time : After one segment start time
150 * Range end time : Before one segment end time
152 intersectingElements
= fSegmentStore
.getIntersectingElements(11, 13);
153 assertEquals(1, Iterables
.size(intersectingElements
));
154 assertEquals(SEGMENT_10_14
, Iterables
.getOnlyElement(intersectingElements
));
157 * Range start time : On one segment start time
158 * Range end time : On one segment end time
160 intersectingElements
= fSegmentStore
.getIntersectingElements(10, 14);
161 assertEquals(1, Iterables
.size(intersectingElements
));
162 assertEquals(SEGMENT_10_14
, Iterables
.getOnlyElement(intersectingElements
));
165 * Range start time : On last segment end time
166 * Range end time : After last segment end time
168 intersectingElements
= fSegmentStore
.getIntersectingElements(14, 18);
169 assertEquals(1, Iterables
.size(intersectingElements
));
170 assertEquals(SEGMENT_10_14
, Iterables
.getOnlyElement(intersectingElements
));
173 * Range start time : Before first segment start time
174 * Range end time : On first segment start time
176 intersectingElements
= fSegmentStore
.getIntersectingElements(1, 2);
177 assertEquals(1, Iterables
.size(intersectingElements
));
178 assertEquals(SEGMENT_2_6
, Iterables
.getOnlyElement(intersectingElements
));
182 * Testing method getIntersectingElements(long start, long end)
185 public void testGetIntersectingElementsTime() {
187 Iterable
<ISegment
> intersectingElements
;
190 * Time between segment start time and end time
192 intersectingElements
= fSegmentStore
.getIntersectingElements(3);
193 assertEquals(1, Iterables
.size(intersectingElements
));
194 assertEquals(SEGMENT_2_6
, Iterables
.getOnlyElement(intersectingElements
));
197 * Time on segment start time
199 intersectingElements
= fSegmentStore
.getIntersectingElements(2);
200 assertEquals(1, Iterables
.size(intersectingElements
));
201 assertEquals(SEGMENT_2_6
, Iterables
.getOnlyElement(intersectingElements
));
204 * Time on segment end time
206 intersectingElements
= fSegmentStore
.getIntersectingElements(14);
207 assertEquals(1, Iterables
.size(intersectingElements
));
208 assertEquals(SEGMENT_10_14
, Iterables
.getOnlyElement(intersectingElements
));
211 * Time overlapping many segments
213 intersectingElements
= fSegmentStore
.getIntersectingElements(6);
214 assertEquals(4, Iterables
.size(intersectingElements
));
217 * Time between segments
219 intersectingElements
= fSegmentStore
.getIntersectingElements(9);
220 assertEquals(0, Iterables
.size(intersectingElements
));
223 * Time before all segment start time
225 intersectingElements
= fSegmentStore
.getIntersectingElements(1);
226 assertEquals(0, Iterables
.size(intersectingElements
));
229 * Time after all segment end time
231 intersectingElements
= fSegmentStore
.getIntersectingElements(15);
232 assertEquals(0, Iterables
.size(intersectingElements
));
236 * Testing method getIntersectingElements(long start, long end)
239 public void testDispose() {
240 TreeMapStore
<ISegment
> store
= new TreeMapStore
<>();
241 store
.addElement(checkNotNull(SEGMENT_2_6
));
243 assertEquals(0, store
.getNbElements());
This page took 0.03737 seconds and 6 git commands to generate.