public class RunList<R extends Run> extends AbstractList<R>
modCount| Constructor and Description |
|---|
RunList() |
RunList(Collection<? extends Job> jobs) |
RunList(Job j) |
RunList(View view) |
| Modifier and Type | Method and Description |
|---|---|
RunList<R> |
byTimestamp(long start,
long end)
Filter the list by timestamp.
|
RunList<R> |
completedOnly()
Filter the list to completed builds.
|
RunList<R> |
failureOnly()
Filter the list to non-successful builds only.
|
RunList<R> |
filter(com.google.common.base.Predicate<R> predicate)
Returns elements that satisfy the given predicate.
|
static <R extends Run> |
fromRuns(Collection<? extends R> runs) |
R |
get(int index)
|
R |
getFirstBuild()
Deprecated.
see
size() for why this violates lazy-loading |
R |
getLastBuild() |
int |
indexOf(Object o) |
boolean |
isEmpty() |
Iterator<R> |
iterator() |
int |
lastIndexOf(Object o) |
RunList<R> |
limit(int n)
Return only the most recent builds.
|
RunList<R> |
newBuilds()
Reduce the size of the list by only leaving relatively new ones.
|
RunList<R> |
node(Node node)
Filter the list to builds on a single node only
Warning: this method mutates the original list and then returns it.
|
RunList<R> |
overThresholdOnly(Result threshold)
Filter the list to builds above threshold.
|
RunList<R> |
regressionOnly()
Filter the list to regression builds only.
|
int |
size()
|
List<R> |
subList(int fromIndex,
int toIndex)
AbstractList.subList(int, int) isn't very efficient on our Iterable based implementation. |
add, add, addAll, clear, equals, hashCode, listIterator, listIterator, remove, removeRange, setaddAll, contains, containsAll, remove, removeAll, retainAll, toArray, toArray, toStringclone, finalize, getClass, notify, notifyAll, wait, wait, waitaddAll, contains, containsAll, remove, removeAll, replaceAll, retainAll, sort, spliterator, toArray, toArrayparallelStream, removeIf, streampublic RunList()
public RunList(Job j)
public RunList(View view)
public RunList(Collection<? extends Job> jobs)
@Deprecated public int size()
@Deprecated public R get(int index)
public List<R> subList(int fromIndex, int toIndex)
AbstractList.subList(int, int) isn't very efficient on our Iterable based implementation.
In fact the range check alone would require us to iterate all the elements,
so we'd be better off just copying into ArrayList.public int indexOf(Object o)
public int lastIndexOf(Object o)
lastIndexOf in interface List<R extends Run>lastIndexOf in class AbstractList<R extends Run>public boolean isEmpty()
@Deprecated public R getFirstBuild()
size() for why this violates lazy-loadingpublic R getLastBuild()
public static <R extends Run> RunList<R> fromRuns(Collection<? extends R> runs)
public RunList<R> filter(com.google.common.base.Predicate<R> predicate)
public RunList<R> limit(int n)
n - a countpublic RunList<R> failureOnly()
public RunList<R> overThresholdOnly(Result threshold)
public RunList<R> completedOnly()
public RunList<R> node(Node node)
public RunList<R> regressionOnly()
public RunList<R> byTimestamp(long start, long end)
s<=;e.
Warning: this method mutates the original list and then returns it.Copyright © 2019. All rights reserved.