1 /*******************************************************************************
2 * Copyright (c) 2016 Ericsson
4 * All rights reserved. This program and the accompanying materials
5 * are made available under the terms of the Eclipse Public License v1.0
6 * which accompanies this distribution, and is available at
7 * http://www.eclipse.org/legal/epl-v10.html
8 *******************************************************************************/
10 package org
.eclipse
.tracecompass
.internal
.analysis
.timing
.core
.store
;
12 import static org
.eclipse
.tracecompass
.common
.core
.NonNullUtils
.checkNotNull
;
14 import java
.util
.ArrayList
;
15 import java
.util
.Collection
;
16 import java
.util
.Collections
;
17 import java
.util
.Comparator
;
18 import java
.util
.Iterator
;
19 import java
.util
.List
;
20 import java
.util
.concurrent
.locks
.ReadWriteLock
;
21 import java
.util
.concurrent
.locks
.ReentrantReadWriteLock
;
22 import java
.util
.stream
.Collectors
;
24 import org
.eclipse
.jdt
.annotation
.NonNull
;
25 import org
.eclipse
.jdt
.annotation
.Nullable
;
26 import org
.eclipse
.tracecompass
.segmentstore
.core
.BasicSegment
;
27 import org
.eclipse
.tracecompass
.segmentstore
.core
.ISegment
;
28 import org
.eclipse
.tracecompass
.segmentstore
.core
.ISegmentStore
;
30 import com
.google
.common
.collect
.ImmutableList
;
33 * Implementation of an {@link ISegmentStore} using one in-memory
34 * {@link ArrayList}. This relatively simple implementation holds everything in
35 * memory, and as such cannot contain too much data.
37 * The ArrayListStore itself is {@link Iterable}, and its iteration order will
38 * be by ascending order of start times. For segments with identical start
39 * times, the secondary comparator will be the end time. If even those are
40 * equal, it will defer to the segments' natural ordering (
41 * {@link ISegment#compareTo}).
43 * The store's tree maps will not accept duplicate key-value pairs, which means
44 * that if you want several segments with the same start and end times, make
45 * sure their compareTo() differentiates them.
47 * Removal operations are not supported.
50 * The type of segment held in this store
52 * @author Matthew Khouzam
54 public class ArrayListStore
<@NonNull E
extends ISegment
> implements ISegmentStore
<E
> {
56 private final Comparator
<E
> COMPARATOR
= (o1
, o2
) -> {
57 int ret
= Long
.compare(o1
.getStart(), o2
.getStart());
59 return Long
.compare(o1
.getEnd(), o2
.getEnd());
64 private final ReadWriteLock fLock
= new ReentrantReadWriteLock(false);
66 private final List
<E
> fStore
;
68 private @Nullable transient Iterable
<E
> fLastSnapshot
= null;
73 public ArrayListStore() {
74 fStore
= new ArrayList
<>();
81 * an array of elements to wrap in the segment store
84 public ArrayListStore(Object
[] array
) {
85 fStore
= new ArrayList
<>();
86 for (int i
= 0; i
< array
.length
; i
++) {
87 if (array
[i
] instanceof ISegment
) {
88 fStore
.add((E
) array
[i
]);
91 fStore
.sort(COMPARATOR
);
93 // ------------------------------------------------------------------------
94 // Methods from Collection
95 // ------------------------------------------------------------------------
98 public Iterator
<E
> iterator() {
99 fLock
.readLock().lock();
101 Iterable
<E
> lastSnapshot
= fLastSnapshot
;
102 if (lastSnapshot
== null) {
103 lastSnapshot
= ImmutableList
.copyOf(fStore
);
104 fLastSnapshot
= lastSnapshot
;
106 return checkNotNull(lastSnapshot
.iterator());
108 fLock
.readLock().unlock();
113 public boolean add(@Nullable E val
) {
115 throw new IllegalArgumentException("Cannot add null value"); //$NON-NLS-1$
118 fLock
.writeLock().lock();
120 int insertPoint
= Collections
.binarySearch(fStore
, val
);
121 insertPoint
= insertPoint
>= 0 ? insertPoint
: -insertPoint
- 1;
122 fStore
.add(insertPoint
, val
);
123 fLastSnapshot
= null;
126 fLock
.writeLock().unlock();
132 return fStore
.size();
136 public boolean isEmpty() {
137 fLock
.readLock().lock();
139 return fStore
.isEmpty();
141 fLock
.readLock().unlock();
146 public boolean contains(@Nullable Object o
) {
147 fLock
.readLock().lock();
149 return fStore
.contains(o
);
151 fLock
.readLock().unlock();
156 public boolean containsAll(@Nullable Collection
<?
> c
) {
157 fLock
.readLock().lock();
159 return fStore
.containsAll(c
);
161 fLock
.readLock().unlock();
166 public Object
[] toArray() {
167 fLock
.readLock().lock();
169 return fStore
.toArray();
171 fLock
.readLock().unlock();
176 public <T
> T
[] toArray(T
[] a
) {
177 fLock
.readLock().lock();
179 return fStore
.toArray(a
);
181 fLock
.readLock().unlock();
186 public boolean remove(@Nullable Object o
) {
187 throw new UnsupportedOperationException();
191 public boolean addAll(@Nullable Collection
<?
extends E
> c
) {
193 throw new IllegalArgumentException();
196 fLock
.writeLock().lock();
198 boolean changed
= false;
200 if (this.add(elem
)) {
206 fLock
.writeLock().unlock();
211 public boolean removeAll(@Nullable Collection
<?
> c
) {
212 throw new UnsupportedOperationException();
216 public boolean retainAll(@Nullable Collection
<?
> c
) {
217 throw new UnsupportedOperationException();
221 public void clear() {
222 fLock
.writeLock().lock();
226 fLock
.writeLock().unlock();
230 // ------------------------------------------------------------------------
231 // Methods added by ISegmentStore
232 // ------------------------------------------------------------------------
235 public Iterable
<E
> getIntersectingElements(long position
) {
237 * The intervals intersecting 't' are those whose 1) start time is
238 * *lower* than 't' AND 2) end time is *higher* than 't'.
240 fLock
.readLock().lock();
243 * as fStore is sorted by start then end times, restrict sub array
244 * to elements whose start times <= t as stream.filter won't do it.
246 int index
= Collections
.binarySearch(fStore
, new BasicSegment(position
, Long
.MAX_VALUE
));
247 index
= (index
>= 0) ? index
: -index
- 1;
248 return fStore
.subList(0, index
).stream().filter(element
-> position
>= element
.getStart() && position
<= element
.getEnd()).collect(Collectors
.toList());
250 fLock
.readLock().unlock();
255 public Iterable
<E
> getIntersectingElements(long start
, long end
) {
256 fLock
.readLock().lock();
258 int index
= Collections
.binarySearch(fStore
, new BasicSegment(end
, Long
.MAX_VALUE
));
259 index
= (index
>= 0) ? index
: -index
- 1;
260 return fStore
.subList(0, index
).stream().filter(element
-> !(start
> element
.getEnd() || end
< element
.getStart())).collect(Collectors
.toList());
262 fLock
.readLock().unlock();
267 public void dispose() {
268 fLock
.writeLock().lock();
272 fLock
.writeLock().unlock();
This page took 0.039262 seconds and 5 git commands to generate.