- Sort Score
- Result 10 results
- Languages All
Results 371 - 380 of 491 for How (0.01 sec)
-
android/guava/src/com/google/common/base/Throwables.java
* throwable} followed by its cause hierarchy. Note that this is a snapshot of the cause chain and * will not reflect any subsequent changes to the cause chain. * * <p>Here's an example of how it can be used to find specific types of exceptions in the cause * chain: * * <pre> * Iterables.filter(Throwables.getCausalChain(e), IOException.class)); * </pre> *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 20.6K bytes - Viewed (0) -
android/pom.xml
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Sep 04 21:35:58 UTC 2025 - 24.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableCollection.java
* is modified. * <li><b>Null-hostility.</b> This collection will never contain a null element. * <li><b>Deterministic iteration.</b> The iteration order is always well-defined, depending on * how the collection was created. Typically this is insertion order unless an explicit * ordering is otherwise specified (e.g. {@link ImmutableSortedSet#naturalOrder}). See the
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 18.7K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableListMultimap.java
* Builder} constructor. */ public static <K, V> Builder<K, V> builder() { return new Builder<>(); } /** * Returns a new builder with a hint for how many distinct keys are expected to be added. The * generated builder is equivalent to that returned by {@link #builder}, but may perform better if * {@code expectedKeys} is a good estimate. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 18.8K bytes - Viewed (0) -
pom.xml
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Sep 04 21:35:58 UTC 2025 - 23.9K bytes - Viewed (0) -
docs/changelogs/changelog_3x.md
_2019-02-04_ * **This release bumps our minimum requirements to Java 8+ or Android 5+.** Cutting off old devices is a serious change and we don't do it lightly! [This post][require_android_5] explains why we're doing this and how to upgrade. The OkHttp 3.12.x branch will be our long-term branch for Android 2.3+ (API level 9+) and Java 7+. These platforms lack support for TLS 1.2 and should not be used. But because upgrading is
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Sun Feb 06 14:55:54 UTC 2022 - 50.8K bytes - Viewed (0) -
.bazelrc
# Do not do this. If enabled protobuf's core internal target # @com_google_protobuf//python:protobuf_python will start depending on a bunch # of cc_binary shared libraries artifacts, which will mess with how we link # protobuf dependencies ourselves. By default this value is false, but some # projects enable it, which we don't want here. # build --define=use_fast_cpp_protos=true
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Fri Aug 22 21:03:34 UTC 2025 - 56K bytes - Viewed (0) -
src/bytes/buffer.go
// Cap returns the capacity of the buffer's underlying byte slice, that is, the // total space allocated for the buffer's data. func (b *Buffer) Cap() int { return cap(b.buf) } // Available returns how many bytes are unused in the buffer. func (b *Buffer) Available() int { return cap(b.buf) - len(b.buf) } // Truncate discards all but the first n unread bytes from the buffer // but continues to use the same allocated storage.
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon May 19 17:38:56 UTC 2025 - 16K bytes - Viewed (0) -
api/maven-api-model/src/main/mdo/maven.mdo
<version>4.0.0+</version> <description>How to handle downloading of releases from this repository.</description> <association> <type>RepositoryPolicy</type> </association> </field> <field> <name>snapshots</name> <version>4.0.0+</version> <description>How to handle downloading of snapshots from this repository.</description>
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Thu Aug 07 14:32:16 UTC 2025 - 132.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Chars.java
if (array.length <= 1) { return; } int length = toIndex - fromIndex; // Obtain m = (-distance mod length), a non-negative value less than "length". This is how many // places left to rotate. int m = -distance % length; m = (m < 0) ? m + length : m; // The current index of what will become the first element of the rotated section.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 24.2K bytes - Viewed (0)