L55: * {@code Nullable}, {@code CheckForNull}, {@code NullableType}, or {@code NullableDecl}. L56: * L57: * <p>The tested methods and constructors are invoked -- each time with one parameter being null and L58: * the rest not null -- and the test fails if no expected exception is thrown. {@code L59: * NullPointerTester} uses best effort to pick non-null default values for many common JDK and Guava L60: * types, and also for interfaces and public classes that have public parameter-less constructors....

resilient to overflow. L972: * L973: * @since 14.0 L974: */ L975: public static long mean(long x, long y) { L976: // Efficient method for computing the arithmetic mean. L977: // The alternative (x + y) / 2 fails for large values. L978: // The alternative (x + y) >>> 1 fails for negative values. L979: return (x & y) + ((x ^ y) >> 1); L980: } L981: L982: /* L983: * This bitmask is used as an optimization for cheaply testing for divisibility by 2, 3, or 5. L984: * Each bit is set...

a <i>separator</i> sequence. This separator can be specified as a single {@linkplain #on(char) L36: * character}, fixed {@linkplain #on(String) string}, {@linkplain #onPattern regular expression} or L37: * {@link #on(CharMatcher) CharMatcher} instance. Or, instead of using a separator at all, a L38: * splitter can extract adjacent substrings of a given {@linkplain #fixedLength fixed length}. L39: * L40: * <p>For example, this expression: L41: * L42: * <pre>{@code L43: * Splitter.on(',').split("foo,bar,qux")...

this range and {@code L587: * other}. For example, the span of {@code [1..3]} and {@code (5..7)} is {@code [1..7)}. L588: * L589: * <p><i>If</i> the input ranges are {@linkplain #isConnected connected}, the returned range can L590: * also be called their <i>union</i>. If they are not, note that the span might contain values L591: * that are not contained in either input range. L592: * L593: * <p>Like {@link #intersection(Range) intersection}, this operation is commutative, associative...

given an element that doesn't satisfy the predicate, the L68: * collection's {@code add()} and {@code addAll()} methods throw an {@link L69: * IllegalArgumentException}. When methods such as {@code removeAll()} and {@code clear()} are L70: * called on the filtered collection, only elements that satisfy the filter will be removed from L71: * the underlying collection. L72: * L73: * <p>The returned collection isn't threadsafe or serializable, even if {@code unfiltered} is. L74: * L75:...

L388: L389: /** L390: * Returns an iterator that cycles indefinitely over the elements of {@code iterable}. L391: * L392: * <p>The returned iterator supports {@code remove()} if the provided iterator does. After {@code L393: * remove()} is called, subsequent cycles omit the removed element, which is no longer in {@code L394: * iterable}. The iterator's {@code hasNext()} method returns {@code true} until {@code iterable} L395: * is empty. L396: * L397: * <p><b>Warning:</b> Typical uses...

org.junit.jupiter.api.Test L45: L46:class Http2Test { L47: val frame = Buffer() L48: val reader = Http2Reader(frame, false) L49: val expectedStreamId = 15 L50: L51: @Test fun unknownFrameTypeSkipped() { L52: writeMedium(frame, 4) // has a 4-byte field L53: frame.writeByte(99) // type 99 L54: frame.writeByte(FLAG_NONE) L55: frame.writeInt(expectedStreamId) L56: frame.writeInt(111111111) // custom data L57: reader.nextFrame(requireSettings = false, BaseTestHandler()) // Should not callback....

<li>Access to all collection-based utilities via {@link #asList} (though at the cost of L52: * allocating garbage). L53: * </ul> L54: * L55: * <p>Disadvantages compared to {@code int[]}: L56: * L57: * <ul> L58: * <li>Memory footprint has a fixed overhead (about 24 bytes per instance). L59: * <li><i>Some</i> construction use cases force the data to be copied (though several construction L60: * APIs are offered that don't). L61: * <li>Can't be passed directly to methods that expect...

java.util.HashSet}, iteration is only proportional to the actual {@code size()}, L64: * which is optimal, and <i>not</i> the size of the internal hashtable, which could be much larger L65: * than {@code size()}. Furthermore, this structure only depends on a fixed number of arrays; {@code L66: * add(x)} operations <i>do not</i> create objects for the garbage collector to deal with, and for L67: * every element added, the garbage collector will have to traverse {@code 1.5} references on L68: * average, in the...

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...