Package com.google.common.graph
Class ElementOrder<T>
java.lang.Object
com.google.common.graph.ElementOrder<T>
Used to represent the order of elements in a data structure that supports different options for
iteration order guarantees.
Example usage:
MutableGraph<Integer> graph =
GraphBuilder.directed().nodeOrder(ElementOrder.<Integer>natural()).build();
- Since:
- 20.0
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionstatic enum
The type of ordering that this object specifies. -
Method Summary
Modifier and TypeMethodDescriptionReturns theComparator
used.boolean
int
hashCode()
static <S> ElementOrder
<S> Returns an instance which specifies that insertion ordering is guaranteed.static <S extends Comparable<? super S>>
ElementOrder<S> natural()
Returns an instance which specifies that the natural ordering of the elements is guaranteed.static <S> ElementOrder
<S> sorted
(Comparator<S> comparator) Returns an instance which specifies that the ordering of the elements is guaranteed to be determined bycomparator
.toString()
type()
Returns the type of ordering used.static <S> ElementOrder
<S> Returns an instance which specifies that no ordering is guaranteed.
-
Method Details
-
unordered
Returns an instance which specifies that no ordering is guaranteed. -
insertion
Returns an instance which specifies that insertion ordering is guaranteed. -
natural
Returns an instance which specifies that the natural ordering of the elements is guaranteed. -
sorted
Returns an instance which specifies that the ordering of the elements is guaranteed to be determined bycomparator
. -
type
Returns the type of ordering used. -
comparator
Returns theComparator
used.- Throws:
UnsupportedOperationException
- if comparator is not defined
-
equals
-
hashCode
public int hashCode() -
toString
-