@GwtCompatible public abstract class TestUnhashableCollectionGenerator<T extends Collection<UnhashableObject>> extends Object implements TestCollectionGenerator<UnhashableObject>
Constructor and Description |
---|
TestUnhashableCollectionGenerator() |
Modifier and Type | Method and Description |
---|---|
T |
create(Object... elements)
Creates a new container containing the given elements.
|
protected abstract T |
create(UnhashableObject[] elements)
Creates a new collection containing the given elements; implement this method instead of
create(Object...) . |
UnhashableObject[] |
createArray(int length)
Helper method to create an array of the appropriate type used by this generator.
|
Iterable<UnhashableObject> |
order(List<UnhashableObject> insertionOrder)
Returns the iteration ordering of elements, given the order in which they were added to the
container.
|
SampleElements<UnhashableObject> |
samples()
Returns the sample elements that this generate populates its container with.
|
public TestUnhashableCollectionGenerator()
public SampleElements<UnhashableObject> samples()
TestContainerGenerator
samples
in interface TestContainerGenerator<Collection<UnhashableObject>,UnhashableObject>
public T create(Object... elements)
TestContainerGenerator
create
in interface TestContainerGenerator<Collection<UnhashableObject>,UnhashableObject>
protected abstract T create(UnhashableObject[] elements)
create(Object...)
.public UnhashableObject[] createArray(int length)
TestContainerGenerator
createArray
in interface TestContainerGenerator<Collection<UnhashableObject>,UnhashableObject>
public Iterable<UnhashableObject> order(List<UnhashableObject> insertionOrder)
TestContainerGenerator
If the order is non-deterministic, as with HashSet
, this method can return
its input unmodified. Provided that the test suite is built without CollectionFeature.KNOWN_ORDER
, the tests will look
only at the returned contents without regard for order.
order
in interface TestContainerGenerator<Collection<UnhashableObject>,UnhashableObject>
Copyright © 2010–2018. All rights reserved.