- Sort Score
- Result 10 results
- Languages All
Results 401 - 410 of 2,636 for All (0.07 sec)
-
android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java
abstract class AggregateFutureState<OutputT extends @Nullable Object> extends AbstractFuture.TrustedFuture<OutputT> { // Lazily initialized the first time we see an exception; not released until all the input futures // have completed and we have processed them all. @CheckForNull private volatile Set<Throwable> seenExceptions = null; private volatile int remaining; private static final AtomicHelper ATOMIC_HELPER;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue May 28 20:40:51 UTC 2024 - 8.4K bytes - Viewed (0) -
docs/en/docs/tutorial/static-files.md
/// ### What is "Mounting" "Mounting" means adding a complete "independent" application in a specific path, that then takes care of handling all the sub-paths. This is different from using an `APIRouter` as a mounted application is completely independent. The OpenAPI and docs from your main application won't include anything from the mounted application, etc.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Sun Oct 27 15:45:40 UTC 2024 - 1.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* (given by {@link #bits}). For example, {@link Hashing#sha1} produces a 160-bit number, * while {@link Hashing#murmur3_32()} yields only 32 bits. Because a {@code long} value is * clearly insufficient to hold all hash code values, this API represents a hash code as an * instance of {@link HashCode}. * <li><b>pure function:</b> the value produced must depend only on the input bytes, in the order
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
guava/src/com/google/common/hash/HashFunction.java
* (given by {@link #bits}). For example, {@link Hashing#sha1} produces a 160-bit number, * while {@link Hashing#murmur3_32()} yields only 32 bits. Because a {@code long} value is * clearly insufficient to hold all hash code values, this API represents a hash code as an * instance of {@link HashCode}. * <li><b>pure function:</b> the value produced must depend only on the input bytes, in the order
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue May 25 18:22:59 UTC 2021 - 10.9K bytes - Viewed (0) -
ci/official/containers/linux_arm64/builder.devtoolset/build_devtoolset.sh
#!/bin/bash -eu # Copyright 2016 The TensorFlow Authors. All Rights Reserved. # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # http://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS,
Registered: Tue Nov 05 12:39:12 UTC 2024 - Last Modified: Fri Sep 29 00:26:34 UTC 2023 - 6.1K bytes - Viewed (0) -
common/Makefile.common.mk
@$(or $(COMMONFILES_POSTPROCESS), true) check-clean-repo: @common/scripts/check_clean_repo.sh tidy-docker: @docker image prune --all --force --filter="label=io.istio.repo=https://github.com/istio/tools" --filter="label!=io.istio.version=$(IMAGE_VERSION)" # help works by looking over all Makefile includes matching `target: ## comment` regex and outputting them help: ## Show this help
Registered: Wed Nov 06 22:53:10 UTC 2024 - Last Modified: Wed Jun 12 14:37:27 UTC 2024 - 5.9K bytes - Viewed (0) -
doc/go_mem.html
unless all the accesses involved are atomic data accesses as provided by the <code>sync/atomic</code> package. As noted already, programmers are strongly encouraged to use appropriate synchronization to avoid data races. In the absence of data races, Go programs behave as if all the goroutines were multiplexed onto a single processor.
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Mon Mar 04 15:54:42 UTC 2024 - 26.6K bytes - Viewed (0) -
cmd/batch-handlers.go
if r.Flags.Filter.OlderThan > 0 && time.Since(oi.ModTime) < r.Flags.Filter.OlderThan.D() { // skip all objects that are newer than specified older duration return true } if r.Flags.Filter.NewerThan > 0 && time.Since(oi.ModTime) >= r.Flags.Filter.NewerThan.D() { // skip all objects that are older than specified newer duration return true }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Oct 18 15:32:09 UTC 2024 - 62.2K bytes - Viewed (0) -
guava/src/com/google/common/hash/BloomFilterStrategies.java
int combinedHash = hash1 + (i * hash2); // Flip all the bits if it's negative (guaranteed positive number) if (combinedHash < 0) { combinedHash = ~combinedHash; } if (!bits.get(combinedHash % bitSize)) { return false; } } return true; } }, /** * This strategy uses all 128 bits of {@link Hashing#murmur3_128} when hashing. It looks different
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 10.7K bytes - Viewed (0) -
guava-testlib/test/com/google/common/collect/testing/features/FeatureEnumTest.java
import java.lang.reflect.Method; import java.util.Locale; import junit.framework.TestCase; /** * Since annotations have some reusability issues that force copy and paste all over the place, it's * worth having a test to ensure that all our Feature enums have their annotations correctly set up. * * @author George van den Driessche */ public class FeatureEnumTest extends TestCase {
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 02:09:00 UTC 2024 - 4.3K bytes - Viewed (0)