- Sort Score
- Result 10 results
- Languages All
Results 151 - 160 of 424 for Usage (0.01 sec)
-
docs/debugging/hash-set/main.go
// - SIPMOD func sipHashMod(key string, cardinality int, id [16]byte) int { if cardinality <= 0 { return -1 } // use the faster version as per siphash docs // https://github.com/dchest/siphash#usage k0, k1 := binary.LittleEndian.Uint64(id[0:8]), binary.LittleEndian.Uint64(id[8:16]) sum64 := siphash.Hash(k0, k1, []byte(key)) return int(sum64 % uint64(cardinality)) }
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Mon Sep 19 18:05:16 UTC 2022 - 3.7K bytes - Viewed (0) -
mockwebserver/src/test/java/mockwebserver3/internal/http2/Http2Server.kt
companion object { val logger: Logger = Logger.getLogger(Http2Server::class.java.name) @JvmStatic fun main(args: Array<String>) { if (args.size != 1 || args[0].startsWith("-")) { println("Usage: Http2Server <base directory>") return } val server = Http2Server( File(args[0]), localhost().sslContext().socketFactory, ) server.run()
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Thu Jul 31 04:18:40 UTC 2025 - 6.4K bytes - Viewed (0) -
ci/official/utilities/rename_and_verify_wheels.sh
# See the License for the specific language governing permissions and # limitations under the License. # ============================================================================== # # Usage: rename_and_verify_wheels.sh # This script is aware of TFCI_ variables, so it doesn't need any arguments. # Puts new wheel through auditwheel to rename and verify it, deletes the old
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Fri Apr 25 00:22:38 UTC 2025 - 4.7K bytes - Viewed (0) -
fess-crawler/src/main/java/org/codelibs/fess/crawler/util/CrawlingParameterUtil.java
* <li>{@link DataService} - The service for managing access results.</li> * </ul> * * <p>Each parameter is stored in a ThreadLocal variable to ensure thread safety.</p> * * <p>Usage example:</p> * <pre> * {@code * UrlQueue<?> urlQueue = CrawlingParameterUtil.getUrlQueue(); * CrawlingParameterUtil.setUrlQueue(newUrlQueue); * * CrawlerContext context = CrawlingParameterUtil.getCrawlerContext();
Registered: Sun Sep 21 03:50:09 UTC 2025 - Last Modified: Sat Mar 15 06:52:00 UTC 2025 - 6.4K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ParametricNullness.java
import com.google.common.annotations.GwtCompatible; import java.lang.annotation.Retention; import java.lang.annotation.Target; /** * Annotates a "top-level" type-variable usage that takes its nullness from the type argument * supplied by the user of the class. For example, {@code Multiset.Entry.getElement()} returns * {@code @ParametricNullness E}, which means: * * <ul>
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 16:20:21 UTC 2024 - 3.1K bytes - Viewed (0) -
src/test/java/jcifs/SmbSessionTest.java
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 15.1K bytes - Viewed (0) -
docs/distributed/DESIGN.md
This document explains the design, architecture and advanced use cases of the MinIO distributed server. ## Command-line ``` NAME: minio server - start object storage server USAGE: minio server [FLAGS] DIR1 [DIR2..] minio server [FLAGS] DIR{1...64} minio server [FLAGS] DIR{1...64} DIR{65...128} DIR: DIR points to a directory on a filesystem. When you want to combine
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Feb 26 09:25:50 UTC 2025 - 8K bytes - Viewed (1) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * topological sort) that only need a way of accessing the predecessors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: * * {@snippet : * public <N> someGraphAlgorithm(N startNode, PredecessorsFunction<N> predecessorsFunction); * } *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as * breadth first traversal) that only need a way of accessing the successors of a node in a graph. * * <h3>Usage</h3> * * Given an algorithm, for example: * * {@snippet : * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction); * } *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 4.2K bytes - Viewed (0) -
docs/es/docs/advanced/async-tests.md
/// warning | Advertencia Si tu aplicación depende de eventos de lifespan, el `AsyncClient` no activará estos eventos. Para asegurarte de que se activen, usa `LifespanManager` de <a href="https://github.com/florimondmanca/asgi-lifespan#usage" class="external-link" target="_blank">florimondmanca/asgi-lifespan</a>. /// ## Otras Llamadas a Funciones Asíncronas
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Mon Dec 30 18:26:57 UTC 2024 - 4K bytes - Viewed (0)