com.google.common.collect.Ordering; L28:import com.google.errorprone.annotations.Immutable; L29:import java.util.Comparator; L30:import java.util.Map; L31:import javax.annotation.CheckForNull; L32: L33:/** L34: * Used to represent the order of elements in a data structure that supports different options for L35: * iteration order guarantees. L36: * L37: * <p>Example usage: L38: * L39: * <pre>{@code L40: * MutableGraph<Integer> graph = L41: * GraphBuilder.directed().nodeOrder(ElementOrder.<Integer>natural()).build();...

com.google.common.collect.Ordering; L28:import com.google.errorprone.annotations.Immutable; L29:import java.util.Comparator; L30:import java.util.Map; L31:import javax.annotation.CheckForNull; L32: L33:/** L34: * Used to represent the order of elements in a data structure that supports different options for L35: * iteration order guarantees. L36: * L37: * <p>Example usage: L38: * L39: * <pre>{@code L40: * MutableGraph<Integer> graph = L41: * GraphBuilder.directed().nodeOrder(ElementOrder.<Integer>natural()).build();...

real code. L78: assertEquals( L79: fingerprint(stringA.getBytes(ISO_8859_1)), fingerprint(stringB.getBytes(ISO_8859_1))); L80: } L81: L82: public void testPutNonChars() { L83: Hasher hasher = HASH_FN.newHasher(); L84: // Expected data is 0x0100010100000000 L85: hasher L86: .putBoolean(true) L87: .putBoolean(true) L88: .putBoolean(false) L89: .putBoolean(true) L90: .putBoolean(false) L91: .putBoolean(false) L92: .putBoolean(false)...

call, to append L332: * more values and build again. L333: * L334: * <p><b>Performance note:</b> the returned array is backed by the same array as the builder, so L335: * no data is copied as part of this step, but this may occupy more memory than strictly L336: * necessary. To copy the data to a right-sized backing array, use {@code .build().trimmed()}. L337: */ L338: public ImmutableDoubleArray build() { L339: return count == 0 ? EMPTY : new ImmutableDoubleArray(array,...

e L235: boolean setCount(@ParametricNullness E element, int oldCount, int newCount); L236: L237: // Views L238: L239: /** L240: * Returns the set of distinct elements contained in this multiset. The element set is backed by L241: * the same data as the multiset, so any change to either is immediately reflected in the other. L242: * The order of the elements in the element set is unspecified. L243: * L244: * <p>If the element set supports any removal operations, these necessarily cause...

* while {@code ImmutableSortedSet.of(s)} returns an {@code ImmutableSortedSet<Set<String>>} L200: * containing one element (the given set itself). L201: * L202: * <p>Despite the method name, this method attempts to avoid actually copying the data when it is L203: * safe to do so. The exact circumstances under which a copy will or will not be performed are L204: * undocumented and subject to change. L205: * L206: * <p>This method is not type-safe, as it may be called on elements that...

fficiently splittable</a> L448: * if and only if {@code stream} was efficiently splittable and its underlying spliterator L449: * reported {@link Spliterator#SUBSIZED}. This is generally the case if the underlying stream L450: * comes from a data structure supporting efficient indexed random access, typically an array or L451: * list. L452: * L453: * <p>The order of the resulting stream is defined if and only if the order of the original stream L454: * was defined. L455: */ L456:...

* L40: * multipartReader.use { L41: * while (true) { L42: * val part = multipartReader.nextPart() ?: break L43: * process(part.headers, part.body) L44: * } L45: * } L46: * ``` L47: * L48: * Note that [nextPart] will skip any unprocessed data from the preceding part. If the preceding L49: * part is particularly large or if the underlying source is particularly slow, the [nextPart] call L50: * may be slow! L51: * L52: * Closing a part **does not** close this multipart reader; callers must...

replacement L30: * array contains information about special ASCII characters such as {@code \\t} and {@code \\n} L31: * while {@link #escapeUnsafe} is overridden to handle general escaping of the form {@code \\uxxxx}. L32: * L33: * <p>The size of the data structure used by {@link ArrayBasedCharEscaper} is proportional to the L34: * highest valued character that requires escaping. For example a replacement map containing the L35: * single character '{@code \}{@code u1000}' will require approximately...

UnsignedLong.valueOf("12313169684067793560").longValue(), L113: Fingerprint2011.murmurHash64WithSeed(bytes, 0, bytes.length, 1)); L114: } L115: L116: public void testPutNonChars() { L117: Hasher hasher = HASH_FN.newHasher(); L118: // Expected data is 0x0100010100000000 L119: hasher L120: .putBoolean(true) L121: .putBoolean(true) L122: .putBoolean(false) L123: .putBoolean(true) L124: .putBoolean(false) L125: .putBoolean(false) L126: .putBoolean(false)...