- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 208 for Mover (0.14 sec)
-
guava-tests/test/com/google/common/io/FileBackedOutputStreamTest.java
write(out, data, 0, chunk1, singleByte); assertTrue(ByteSource.wrap(data).slice(0, chunk1).contentEquals(source)); } File file = out.getFile(); assertNull(file); // Write data to go over the threshold if (chunk2 > 0) { if (JAVA_IO_TMPDIR.value().equals("/sdcard")) { assertThrows(IOException.class, () -> write(out, data, chunk1, chunk2, singleByte)); return; }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 5.5K bytes - Viewed (0) -
android/guava/src/com/google/common/io/Closeables.java
public final class Closeables { @VisibleForTesting static final Logger logger = Logger.getLogger(Closeables.class.getName()); private Closeables() {} /** * Closes a {@link Closeable}, with control over whether an {@code IOException} may be thrown. * This is primarily useful in a finally block, where a thrown exception needs to be logged but * not propagated (otherwise the original exception will be lost). *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed May 17 14:35:11 GMT 2023 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
// Since views are returned, we need to copy the predecessors that will be removed. // Thus we avoid modifying the underlying view while iterating over it. for (N predecessor : ImmutableList.copyOf(connections.predecessors())) { // requireNonNull is safe because the node is a predecessor. checkState(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedMultiset.java
/** * A {@link Multiset} which maintains the ordering of its elements, according to either their * natural order or an explicit {@link Comparator}. This order is reflected when iterating over the * sorted multiset, either directly, or through its {@code elementSet} or {@code entrySet} views. In * all cases, this implementation uses {@link Comparable#compareTo} or {@link Comparator#compare}
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterables.java
return ((Set<?>) iterable).contains(element) ? 1 : 0; } return Iterators.frequency(iterable.iterator(), element); } /** * Returns an iterable whose iterators cycle indefinitely over the elements of {@code iterable}. * * <p>That iterator supports {@code remove()} if {@code iterable.iterator()} does. After {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 42.8K bytes - Viewed (0) -
guava/src/com/google/common/base/Throwables.java
throwable.printStackTrace(new PrintWriter(stringWriter)); return stringWriter.toString(); } /** * Returns the stack trace of {@code throwable}, possibly providing slower iteration over the full * trace but faster iteration over parts of the trace. Here, "slower" and "faster" are defined in * comparison to the normal way to access the stack trace, {@link Throwable#getStackTrace()
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Throwables.java
throwable.printStackTrace(new PrintWriter(stringWriter)); return stringWriter.toString(); } /** * Returns the stack trace of {@code throwable}, possibly providing slower iteration over the full * trace but faster iteration over parts of the trace. Here, "slower" and "faster" are defined in * comparison to the normal way to access the stack trace, {@link Throwable#getStackTrace()
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* consumption at the price of moderately increased constant factors of CPU. Only use this class * when there is a specific reason to prioritize memory over CPU. * * @author Louis Wasserman */ @J2ktIncompatible // no support for access-order mode in LinkedHashMap delegate @GwtIncompatible // not worth using in GWT for now @ElementTypesAreNonnullByDefault
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/TimeLimiter.java
* object behaves appropriately when its thread is interrupted. * * <p>For example, to return the value of {@code target.someMethod()}, but substitute {@code * DEFAULT_VALUE} if this method call takes over 50 ms, you can use this code: * * <pre> * TimeLimiter limiter = . . .; * TargetType proxy = limiter.newProxy( * target, TargetType.class, 50, TimeUnit.MILLISECONDS); * try {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 18:32:03 GMT 2023 - 8.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* <p><b>Warning:</b> a new random seed for these functions is chosen each time the {@code * Hashing} class is loaded. <b>Do not use this method</b> if hash codes may escape the current * process in any way, for example being sent over RPC, or saved to disk. For a general-purpose, * non-cryptographic hash function that will never change behavior, we suggest {@link * #murmur3_128}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0)