- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 64 for Todd (0.18 sec)
-
guava/src/com/google/common/collect/CompactHashMap.java
} /** Resizes the entries storage if necessary. */ private void resizeMeMaybe(int newSize) { int entriesSize = requireEntries().length; if (newSize > entriesSize) { // 1.5x but round up to nearest odd (this is optimal for memory consumption on Android) int newCapacity = Math.min(CompactHashing.MAX_SIZE, (entriesSize + Math.max(1, entriesSize >>> 1)) | 1); if (newCapacity != entriesSize) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 39.8K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesTest.java
} private static double expectedLargeDatasetPercentile(int index) { // We have q=100, k=index, and N=9951. Therefore k*(N-1)/q is 99.5*index. If index is even, that // is an integer 199*index/2. If index is odd, that is halfway between floor(199*index/2) and // ceil(199*index/2). if (index % 2 == 0) { int position = IntMath.divide(199 * index, 2, UNNECESSARY); return PSEUDORANDOM_DATASET_SORTED.get(position);
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 29.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesTest.java
} private static double expectedLargeDatasetPercentile(int index) { // We have q=100, k=index, and N=9951. Therefore k*(N-1)/q is 99.5*index. If index is even, that // is an integer 199*index/2. If index is odd, that is halfway between floor(199*index/2) and // ceil(199*index/2). if (index % 2 == 0) { int position = IntMath.divide(199 * index, 2, UNNECESSARY); return PSEUDORANDOM_DATASET_SORTED.get(position);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 29.7K bytes - Viewed (0) -
src/archive/tar/common.go
// zero value of sparseHoles logically represents a normal file (i.e., there are // no holes in it). On the other hand, the zero value of sparseDatas implies // that the file has no data in it, which is rather odd. // // As an example, if the underlying raw file contains the 10-byte data: // // var compactFile = "abcdefgh" // // And the sparse map has the following entries: // // var spd sparseDatas = []sparseEntry{
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 15 16:01:50 GMT 2024 - 24.7K bytes - Viewed (2) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
// confusing. It's nice for the finally block to look as close as // possible to the thing right before the try. You could have // guard.leave(), but that's a little odd as well because the // guard doesn't have anything to do with leaving. You can't // really enforce that the guard you're leaving is the same one // you entered with, and it doesn't actually matter. //
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
* Exception thrown by a {@link Ordering#explicit(List)} or {@link Ordering#explicit(Object, * Object[])} comparator when comparing a value outside the set of values it can compare. * Extending {@link ClassCastException} may seem odd, but it is required. */ @VisibleForTesting static class IncomparableValueException extends ClassCastException { final Object value; IncomparableValueException(Object value) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactHashMap.java
} /** Resizes the entries storage if necessary. */ private void resizeMeMaybe(int newSize) { int entriesSize = requireEntries().length; if (newSize > entriesSize) { // 1.5x but round up to nearest odd (this is optimal for memory consumption on Android) int newCapacity = Math.min(CompactHashing.MAX_SIZE, (entriesSize + Math.max(1, entriesSize >>> 1)) | 1); if (newCapacity != entriesSize) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jun 26 21:02:13 GMT 2023 - 35.8K bytes - Viewed (0) -
tensorflow/c/eager/tape.h
int64_t tensor_id = output_tensors[i].GetID(); auto existing = accumulated_gradients_.find(tensor_id); if (existing != accumulated_gradients_.end()) { // This is a somewhat odd case to be in, since it means we have two // operations which supposedly both created the same Tensor. It comes up // in recompute_grad, where the gradients have the same value. However,
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Apr 02 12:40:29 GMT 2024 - 47.2K bytes - Viewed (1) -
operator/cmd/mesh/manifest-generate_test.go
{legacyLabel, empty, "istiod"}, {legacyLabel, objEnabled, "istiod"}, {legacyAndRevLabel, empty, "istiod"}, {legacyAndRevLabel, objEnabled, "istiod"}, // The behavior of these is a bit odd; they are explicitly selecting a revision but getting // the default Unfortunately, the legacy webhook selectors would select these, cause // duplicate injection, so we defer to the namespace label.
Go - Registered: Wed Mar 20 22:53:08 GMT 2024 - Last Modified: Thu Feb 22 08:32:23 GMT 2024 - 42K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/CacheLoadingTest.java
* the exception thrown. * * <p>As we iterate from {@code 0} to {@code nThreads}, threads with an even index will call * {@code getUnchecked}, and threads with an odd index will call {@code get}. If the cache throws * exceptions, this difference may be visible in the returned List. */ private static <K> List<Object> doConcurrentGet( final LoadingCache<K, ?> cache,
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 86.2K bytes - Viewed (0)