- Sort Score
- Result 10 results
- Languages All
Results 1591 - 1600 of 2,579 for zone (0.02 sec)
-
api/maven-api-spi/src/main/java/org/apache/maven/api/spi/TypeProvider.java
/* * Licensed to the Apache Software Foundation (ASF) under one * or more contributor license agreements. See the NOTICE file * distributed with this work for additional information * regarding copyright ownership. The ASF licenses this file * to you 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 *
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Thu Apr 03 13:33:59 UTC 2025 - 2.1K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/sso/SsoManager.java
*/ public boolean available() { final String ssoType = getSsoType(); if (logger.isDebugEnabled()) { logger.debug("sso.type: {}", ssoType); } return !Constants.NONE.equals(ssoType); } /** * Attempts to obtain login credentials using the configured SSO authenticator. * * @return The login credential from SSO authentication, or null if SSO is not available
Registered: Thu Sep 04 12:52:25 UTC 2025 - Last Modified: Thu Jul 17 08:28:31 UTC 2025 - 5.1K bytes - Viewed (0) -
docs/distributed/decom-encrypted.sh
./mc admin decom start myminio/ http://localhost:9000/tmp/xl/{1...10}/disk{0...1} until $(./mc admin decom status myminio/ | grep -q Complete); do echo "waiting for decom to finish..." sleep 1 done kill $pid_1 kill $pid_2 sleep 5 (minio server --address ":9001" http://localhost:9001/tmp/xl/{11...30}/disk{0...3} 2>&1 >/tmp/removed.log) & pid=$!
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Mon May 27 19:17:46 UTC 2024 - 4.1K bytes - Viewed (0) -
.teamcity/src/main/kotlin/model/FunctionalTestBucketGenerator.kt
determineSubProjectClassTimes(testCoverage, buildProjectClassTimes)?.toMutableMap() ?: return validSubprojects.map { SmallSubprojectBucket(it, ParallelizationMethod.None) } validSubprojects.forEach { if (!subProjectToClassTimes.containsKey(it.name)) { subProjectToClassTimes[it.name] = emptyList() } }
Registered: Wed Sep 10 11:36:15 UTC 2025 - Last Modified: Thu Apr 10 15:09:32 UTC 2025 - 7.3K bytes - Viewed (0) -
.teamcity/src/main/kotlin/model/FunctionalTestBucketProvider.kt
): FunctionalTest { val parallelizationMethod = when (testCoverage.os) { Os.LINUX -> ParallelizationMethod.TestDistribution else -> ParallelizationMethod.None } return FunctionalTest( model, testCoverage.getBucketUuid(model, bucketIndex), "${testCoverage.asName()} ($startInclusive <= gradle <$endExclusive)",
Registered: Wed Sep 10 11:36:15 UTC 2025 - Last Modified: Thu Jul 10 05:08:24 UTC 2025 - 8.2K bytes - Viewed (0) -
android/guava/src/com/google/common/eventbus/EventBus.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 12.7K bytes - Viewed (0) -
cmd/kms-handlers_test.go
"Action": ["kms:KeyStatus"] }`, wantStatusCode: http.StatusOK, wantResp: []string{"abc-test-key"}, }, { name: "key status as user set policy to allow only one key", method: http.MethodGet, path: kmsKeyStatusPath, query: map[string]string{"key-id": "abc-test-key"}, asRoot: false, policy: `{"Effect": "Allow", "Action": ["kms:KeyStatus"],
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Apr 09 14:28:39 UTC 2025 - 22.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
* @since 20.0 */ @Beta public final class Graphs extends GraphsBridgeMethods { private Graphs() {} // Graph query methods /** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. *
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
* @since 20.0 */ @Beta public final class Graphs extends GraphsBridgeMethods { private Graphs() {} // Graph query methods /** * Returns true if {@code graph} has at least one cycle. A cycle is defined as a non-empty subset * of edges in a graph arranged to form a path (a sequence of adjacent outgoing edges) starting * and ending with the same node. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Aug 01 00:26:14 UTC 2025 - 23.3K bytes - Viewed (0) -
cmd/erasure-healing-common_test.go
fourNanoSecs := time.Unix(4, 0).UTC() modTimesThreeNone := make([]time.Time, 16) modTimesThreeFour := make([]time.Time, 16) for i := range 16 { // Have 13 good xl.meta, 12 for default parity count = 4 (EC:4) and one // to be tampered with. if i > 12 { modTimesThreeFour[i] = fourNanoSecs modTimesThreeNone[i] = timeSentinel continue } modTimesThreeFour[i] = threeNanoSecs
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 22.4K bytes - Viewed (0)