AbstractIndexedListIterator<E extends @Nullable Object> L36: extends UnmodifiableListIterator<E> { L37: private final int size; L38: private int position; L39: L40: /** Returns the element with the specified index. This method is called by {@link #next()}. */ L41: @ParametricNullness L42: protected abstract E get(int index); L43: L44: /** L45: * Constructs an iterator across a sequence of the given size whose initial position is 0. That L46: * is, the first call to {@link #next()} will...

collection, <i>in no particular L894: * order</i>. L895: * L896: * <p>The iterator is <i>fail-fast</i>: If the MinMaxPriorityQueue is modified at any time after L897: * the iterator is created, in any way except through the iterator's own remove method, the L898: * iterator will generally throw a {@link ConcurrentModificationException}. Thus, in the face of L899: * concurrent modification, the iterator fails quickly and cleanly, rather than risking arbitrary, L900: * non-deterministic behavior...

FutureCallback<V extends @Nullable Object> { L34: /** Invoked with the result of the {@code Future} computation when it is successful. */ L35: void onSuccess(@ParametricNullness V result); L36: L37: /** L38: * Invoked when a {@code Future} computation fails or is canceled. L39: * L40: * <p>If the future's {@link Future#get() get} method throws an {@link ExecutionException}, then L41: * the cause is passed to this method. Any other thrown object is passed unaltered. L42: */ L43: void onFailure(Throwable...

tearDown; L103: } L104: L105: // Features L106: L107: private final Set<Feature<?>> features = new LinkedHashSet<>(); L108: L109: /** L110: * Configures this builder to produce tests appropriate for the given features. This method may be L111: * called more than once to add features in multiple groups. L112: */ L113: @CanIgnoreReturnValue L114: public B withFeatures(Feature<?>... features) { L115: return withFeatures(asList(features)); L116: } L117: L118: @CanIgnoreReturnValue L119: public...

value); L267: } L268: }; L269: } L270: }, L271: "HashMap w/out null values", L272: ALLOWS_NULL_KEYS); L273: } L274: L275: /** L276: * Map generator that verifies that {@code setUp()} methods are called in all the test cases. The L277: * {@code setUpRan} parameter is set true by the {@code setUp} that every test case is supposed to L278: * have registered, and set false by the {@code tearDown}. We use a dynamic proxy to intercept all L279: ...

Ticker.systemTicker(); L144: } L145: L146: Stopwatch(Ticker ticker) { L147: this.ticker = checkNotNull(ticker, "ticker"); L148: } L149: L150: /** L151: * Returns {@code true} if {@link #start()} has been called on this stopwatch, and {@link #stop()} L152: * has not been called since the last call to {@code start()}. L153: */ L154: public boolean isRunning() { L155: return isRunning; L156: } L157: L158: /** L159: * Starts the stopwatch. L160: * L161: * @return this {@code Stopwatch}...

assertFalse( L85: "removeIf(Predicate) should return false or throw " + "UnsupportedOperationException", L86: collection.removeIf( L87: x -> { L88: throw new AssertionError("predicate should never be called"); L89: })); L90: } catch (UnsupportedOperationException tolerated) { L91: } L92: expectUnchanged(); L93: } L94: L95: @CollectionFeature.Require(absent = SUPPORTS_REMOVE) L96: @CollectionSize.Require(absent = ZERO) L97: public...

cache; L50: L51: int max; L52: L53: static AtomicLong requests = new AtomicLong(0); L54: static AtomicLong misses = new AtomicLong(0); L55: L56: @BeforeExperiment L57: void setUp() { L58: // random integers will be generated in this range, then raised to the L59: // power of (1/concentration) and floor()ed L60: max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration)); L61: L62: cache = L63: CacheBuilder.newBuilder() L64: .concurrencyLevel(segments) L65: ...

imeUnit; L29:import java.util.concurrent.atomic.AtomicLong; L30: L31:/** L32: * A Ticker whose value can be advanced programmatically in test. L33: * L34: * <p>The ticker can be configured so that the time is incremented whenever {@link #read} is called: L35: * see {@link #setAutoIncrementStep}. L36: * L37: * <p>This class is thread-safe. L38: * L39: * @author Jige Yu L40: * @since 10.0 L41: */ L42:@ElementTypesAreNonnullByDefault L43:@GwtCompatible L44:public class FakeTicker extends Ticker { L45:...

L28: fun cancel() L29: L30: fun interface Factory { L31: /** L32: * Creates a new event source and immediately returns it. Creating an event source initiates an L33: * asynchronous process to connect the socket. Once that succeeds or fails, `listener` will be L34: * notified. The caller must cancel the returned event source when it is no longer in use. L35: */ L36: fun newEventSource( L37: request: Request, L38: listener: EventSourceListener, L39: ): EventSource...