- Sort Score
- Num 10 results
- Language All
Results 351 - 360 of 702 for BETWEEN (0.53 seconds)
-
helm-releases/minio-5.0.15.tgz
myminio $SCHEME://$MINIO_ENDPOINT:$MINIO_PORT $ACCESS $SECRET" $MC_COMMAND STATUS=$? until [ $STATUS = 0 ]; do ATTEMPTS=$(expr $ATTEMPTS + 1) echo \"Failed attempts: $ATTEMPTS\" if [ $ATTEMPTS -gt $LIMIT ]; then exit 1 fi sleep 2 # 1 second intervals between attempts $MC_COMMAND STATUS=$? done set -e # reset `e` as active return 0 } # checkBucketExists ($bucket) # Check if the bucket exists, by using the exit code of `mc ls` checkBucketExists() { BUCKET=$1 CMD=$(${MC} stat myminio/$BUCKET >/dev/null 2>&1)...
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Fri Jan 12 18:18:57 GMT 2024 - 20.8K bytes - Click Count (0) -
android/guava/src/com/google/common/net/InetAddresses.java
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Mar 19 18:53:45 GMT 2026 - 47.7K bytes - Click Count (0) -
src/main/webapp/WEB-INF/orig/view/chat/chat.jsp
<body> <jsp:include page="../header.jsp" /> <main class="container"> <div class="row"> <div class="col-12 col-lg-10 offset-lg-1"> <div class="card shadow-sm"> <div class="card-header d-flex justify-content-between align-items-center"> <div id="statusArea" class="status-lozenge status-ready" role="status" aria-live="polite"> <i class="fa fa-robot me-1" aria-hidden="true"></i>
Created: Tue Mar 31 13:07:34 GMT 2026 - Last Modified: Sun Mar 15 06:21:57 GMT 2026 - 10.4K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
putEdge(N2, N1); assertThat(graph.outDegree(N1)).isEqualTo(3); } // Stable order tests // Note: Stable order means that the ordering doesn't change between iterations and versions. // Ideally, the ordering in test should never be updated. @Test public void stableIncidentEdgeOrder_edges_returnsInStableOrder() {
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Oct 06 20:14:55 GMT 2025 - 13.2K bytes - Click Count (0) -
impl/maven-core/src/main/java/org/apache/maven/lifecycle/internal/concurrent/BuildPlanExecutor.java
Created: Sun Apr 05 03:35:12 GMT 2026 - Last Modified: Thu Oct 16 06:12:36 GMT 2025 - 55.1K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/Cache.kt
*/ @Throws(IOException::class) constructor(rawSource: Source) { rawSource.use { val source = rawSource.buffer() val urlLine = source.readUtf8LineStrict() // Choice here is between failing with a correct RuntimeException // or mostly silently with an IOException url = urlLine.toHttpUrlOrNull() ?: throw IOException("Cache corruption for $urlLine").also {Created: Fri Apr 03 11:42:14 GMT 2026 - Last Modified: Fri Mar 20 09:13:37 GMT 2026 - 26.9K bytes - Click Count (0) -
docs/en/docs/deployment/concepts.md
Created: Sun Apr 05 07:19:11 GMT 2026 - Last Modified: Thu Mar 05 18:13:19 GMT 2026 - 18.5K bytes - Click Count (1) -
cmd/signature-v4-utils.go
return cred, owner, ErrAccessKeyDisabled } if _, ok := claims[policy.SessionPolicyName]; ok { owner = false } return cred, owner, ErrNone } // sumHMAC calculate hmac between two input byte array. func sumHMAC(key []byte, data []byte) []byte { hash := hmac.New(sha256.New, key) hash.Write(data) return hash.Sum(nil) }
Created: Sun Apr 05 19:28:12 GMT 2026 - Last Modified: Mon Nov 25 17:10:22 GMT 2024 - 9.1K bytes - Click Count (0) -
ci/official/utilities/extract_resultstore_links.py
# Each bazel RBE invocation should produce two # 'Streaming build results to: ...' lines, one at the start, and one at the # end of the invocation. # If there's a failure message, it will be found in-between these two. if not current_url: url_lines['start'] = i elif current_url == url: url_lines['end'] = i else: result_store_links[current_url]['next_url'] = iCreated: Tue Apr 07 12:39:13 GMT 2026 - Last Modified: Wed Nov 08 17:50:27 GMT 2023 - 10.9K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* ThreadN: acquire(LockN) --X acquire(LockA) * </pre> * * <p>The implementation detects cycles by constructing a directed graph in which each lock * represents a node and each edge represents an acquisition ordering between two locks. * * <ul> * <li>Each lock adds (and removes) itself to/from a ThreadLocal Set of acquired locks when the * Thread acquires its first hold (and releases its last remaining hold).
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Apr 01 17:27:13 GMT 2026 - 36K bytes - Click Count (0)