- Sort Score
- Result 10 results
- Languages All
Results 171 - 180 of 1,140 for Take (0.01 sec)
-
android/guava/src/com/google/common/base/Converter.java
* Given that we declare this method as accepting and returning non-nullable values (because we * implement Function<A, B>, as discussed in a class-level comment), it would make some sense to * perform runtime null checks on the input and output. (That would also make NullPointerTester * happy!) However, since we didn't do that for many years, we're not about to start now.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jun 18 21:43:06 UTC 2025 - 22.8K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/NullPointerTester.java
} } return args; } private <T> @Nullable T getDefaultValue(TypeToken<T> type) { // We assume that all defaults are generics-safe, even if they aren't, // we take the risk. @SuppressWarnings("unchecked") T defaultValue = (T) defaults.getInstance(type.getRawType()); if (defaultValue != null) { return defaultValue; }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Jul 14 14:44:08 UTC 2025 - 24.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multiset.java
* throw an exception in response to any of {@code elements} being null or of the wrong type. * * <p><b>Note:</b> this method does not take into account the occurrence count of an element in * the two collections; it may still return {@code true} even if {@code elements} contains several
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 19.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
/** * Determines whether an edge has already been used during traversal. In the directed case a cycle * is always detected before reusing an edge, so no special logic is required. In the undirected * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going * from B to A). */ private static boolean canTraverseWithoutReusingEdge(
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 22.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/Graphs.java
/** * Determines whether an edge has already been used during traversal. In the directed case a cycle * is always detected before reusing an edge, so no special logic is required. In the undirected * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going * from B to A). */ private static boolean canTraverseWithoutReusingEdge(
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
okhttp/src/jvmTest/kotlin/okhttp3/CallTest.kt
throw AssertionError() } } }, ) val response = responseRef.take() assertThat(response.code).isEqualTo(200) assertThat(response.body.string()).isEqualTo("abc") // Make another request just to confirm that that connection can be reused... executeSynchronously("/").assertBody("def") // New connection.
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Thu Jul 31 04:18:40 UTC 2025 - 146.6K bytes - Viewed (0) -
api/maven-api-settings/src/main/mdo/settings.mdo
</association> </field> <field> <name>properties</name> <description> Extended configuration specific to this profile goes here. Contents take the form of {@code <property.name>property.value</property.name>} </description> <type>Properties</type> <association xml.mapStyle="inline"> <type>String</type>
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Sun May 18 09:15:56 UTC 2025 - 33.8K bytes - Viewed (0) -
README.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 15:19:49 UTC 2025 - 24.3K bytes - Viewed (0) -
cmd/iam-store.go
UpdatedAt time.Time `json:"updatedAt"` } // mappedPoliciesToMap copies the map of mapped policies to a regular map. func mappedPoliciesToMap(m *xsync.MapOf[string, MappedPolicy]) map[string]MappedPolicy { policies := make(map[string]MappedPolicy, m.Size()) m.Range(func(k string, v MappedPolicy) bool { policies[k] = v return true }) return policies } // converts a mapped policy into a slice of distinct policies
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 86.7K bytes - Viewed (0) -
cmd/metacache-set.go
return -1 } // defaults to 'strict' return driveCount } func calcCommonWritesDeletes(infos []DiskInfo, readQuorum int) (commonWrite, commonDelete uint64) { deletes := make([]uint64, len(infos)) writes := make([]uint64, len(infos)) for index, di := range infos { deletes[index] = di.Metrics.TotalDeletes writes[index] = di.Metrics.TotalWrites } filter := func(list []uint64) (commonCount uint64) {
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 30.7K bytes - Viewed (0)