private final int k; L108: private final Comparator<? super T> comparator; L109: L110: /* L111: * We are currently considering the elements in buffer in the range [0, bufferSize) as candidates L112: * for the top k elements. Whenever the buffer is filled, we quickselect the top k elements to the L113: * range [0, k) and ignore the remaining elements. L114: */ L115: private final @Nullable T[] buffer; L116: private int bufferSize; L117: L118: /** L119: * The largest of the lowest k elements...

arbitraryConstantInstanceOrNull(Class<T> type) { L397: Field[] fields = type.getDeclaredFields(); L398: Arrays.sort(fields, BY_FIELD_NAME); L399: for (Field field : fields) { L400: if (Modifier.isPublic(field.getModifiers()) L401: && Modifier.isStatic(field.getModifiers()) L402: && Modifier.isFinal(field.getModifiers())) { L403: if (field.getGenericType() == field.getType() && type.isAssignableFrom(field.getType())) { L404: field.setAccessible(true);...

Traverser.forGraph(createDirectedGraph()).breadthFirst('a')); L317: } L318: L319: /** L320: * Checks that the elements of the iterable are calculated on the fly. Concretely, that means that L321: * {@link SuccessorsFunction#successors(Object)} can only be called for a subset of all nodes. L322: */ L323: @Test L324: public void forGraph_breadthFirstIterable_emptyGraph() { L325: assertEqualCharNodes( L326: Traverser.forGraph(createDirectedGraph()).breadthFirst(charactersOf("")), ""); L327: ...

Traverser.forGraph(createDirectedGraph()).breadthFirst('a')); L317: } L318: L319: /** L320: * Checks that the elements of the iterable are calculated on the fly. Concretely, that means that L321: * {@link SuccessorsFunction#successors(Object)} can only be called for a subset of all nodes. L322: */ L323: @Test L324: public void forGraph_breadthFirstIterable_emptyGraph() { L325: assertEqualCharNodes( L326: Traverser.forGraph(createDirectedGraph()).breadthFirst(charactersOf("")), ""); L327: ...

Objects; L28:import java.io.Serializable; L29:import java.nio.ByteBuffer; L30:import java.nio.ByteOrder; L31:import javax.annotation.CheckForNull; L32: L33:/** L34: * An immutable value object capturing some basic statistics about a collection of paired double L35: * values (e.g. points on a plane). Build instances with {@link PairedStatsAccumulator#snapshot}. L36: * L37: * @author Pete Gillin L38: * @since 20.0 L39: */ L40:@J2ktIncompatible L41:@GwtIncompatible L42:@ElementTypesAreNonnullByDefault...

} else if (length == 0) { L462: return of(); L463: } else if (length == 1) { L464: return of(get(fromIndex)); L465: } else { L466: return subListUnchecked(fromIndex, toIndex); L467: } L468: } L469: L470: /** L471: * Called by the default implementation of {@link #subList} when {@code toIndex - fromIndex > 1}, L472: * after index validation has already been performed. L473: */ L474: ImmutableList<E> subListUnchecked(int fromIndex, int toIndex) { L475: return...

InetAddress representing the address in {@code hostAddr} L603: * @throws IllegalArgumentException if {@code hostAddr} is not a valid IPv4 address, or IPv6 L604: * address surrounded by square brackets, or if the address has a scope id that fails L605: * validation against interfaces on the machine L606: */ L607: public static InetAddress forUriString(String hostAddr) { L608: InetAddress addr = forUriStringOrNull(hostAddr, /* parseScope= */ true); L609: if (addr == null) { L610:...

node.next) { L844: action.accept(node); L845: } L846: } L847: } L848: return new EntriesImpl(); L849: } L850: L851: @Override L852: Iterator<Entry<K, V>> entryIterator() { L853: throw new AssertionError("should never be called"); L854: } L855: L856: @Override L857: Map<K, Collection<V>> createAsMap() { L858: return new Multimaps.AsMap<>(this); L859: } L860: L861: /** L862: * @serialData the number of distinct keys, and then for each distinct key: the first key,...

@Override L478: public boolean removeAll(Collection<?> c) { L479: return standardRemoveAll(c); L480: } L481: }; L482: } L483: L484: @Override L485: Iterator<E> elementIterator() { L486: throw new AssertionError("should never be called"); L487: } L488: L489: /** @deprecated Internal method, use {@link #entrySet()}. */ L490: @Deprecated L491: @Override L492: public Set<Multiset.Entry<E>> createEntrySet() { L493: return new EntrySet(); L494: } L495: L496: @Override L497:...

ault:t}}var l=function(t){function o(t,e){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,o);var n=function(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}(this,(o.__proto__||Object.getPrototypeOf(o)).call(this));return n.resolveOptions(e),n.listenClick(t),n}return function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression...