Iterable<PackageDependency>
, Collection<PackageDependency>
, List<PackageDependency>
, RandomAccess
public class PackageDependencyCycle extends AbstractList<PackageDependency> implements RandomAccess
Package Dependencies can form a cycle if the chain of package dependencies somehow 'return' to the
initial package. For example if you have three packages a
, b
and c
and the following
dependencies: a -> b
, b -> c
, they will form a cycle if you somehow create a dependency back to
a
, e.g. b -> a
or c -> a
.
modCount
Constructor | Description |
---|---|
PackageDependencyCycle(PackageDependency... dependencies) |
Modifier and Type | Method | Description |
---|---|---|
static Set<PackageDependencyCycle> |
detectCycles(Iterable<PackageDependency> dependencies) |
|
PackageDependency |
get(int index) |
|
int |
size() |
|
String |
toString() |
addAll, contains, containsAll, isEmpty, remove, removeAll, retainAll, toArray, toArray
add, add, addAll, clear, equals, hashCode, indexOf, iterator, lastIndexOf, listIterator, listIterator, remove, removeRange, set, subList
parallelStream, removeIf, stream
public PackageDependencyCycle(PackageDependency... dependencies)
public static Set<PackageDependencyCycle> detectCycles(Iterable<PackageDependency> dependencies)
public PackageDependency get(int index)
get
in interface List<PackageDependency>
get
in class AbstractList<PackageDependency>
public int size()
size
in interface Collection<PackageDependency>
size
in interface List<PackageDependency>
size
in class AbstractCollection<PackageDependency>
public String toString()
toString
in class AbstractCollection<PackageDependency>
Copyright © 2016–2020 Talsma ICT. All rights reserved.