Search Options

Results per page
Sort
Preferred Languages
Advance

Results 551 - 560 of 1,029 for Tout (0.02 sec)

  1. docs/site-replication/run-multi-site-oidc.sh

    sleep 30
    
    ./mc ls -r --versions minio1/newbucket >/tmp/minio1.txt
    ./mc ls -r --versions minio2/newbucket >/tmp/minio2.txt
    
    out=$(diff -qpruN /tmp/minio1.txt /tmp/minio2.txt)
    ret=$?
    if [ $ret -ne 0 ]; then
    	echo "BUG: expected no missing entries after replication resync: $out"
    	exit 1
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Sep 24 08:03:58 UTC 2024
    - 8.5K bytes
    - Viewed (0)
  2. helm/minio/templates/_helper_create_user.txt

      rm -f $MINIO_ACCESSKEY_SECRETKEY_TMP
    
      # set policy for user
      if [ ! -z $POLICY -a $POLICY != " " ] ; then
          echo "Adding policy '$POLICY' for '$USER'"
          set +e ; # policy already attach errors out, allow it.
          ${MC} admin policy attach myminio $POLICY --user=$USER
          set -e
      else
          echo "User '$USER' has no policy attached."
      fi
    }
    
    # Try connecting to MinIO instance
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Dec 12 23:43:32 UTC 2023
    - 3.2K bytes
    - Viewed (0)
  3. guava/src/com/google/common/math/LongMath.java

        a >>= aTwos; // divide out all 2s
        int bTwos = Long.numberOfTrailingZeros(b);
        b >>= bTwos; // divide out all 2s
        while (a != b) { // both a, b are odd
          // The key to the binary GCD algorithm is as follows:
          // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
          // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 09 16:39:37 UTC 2024
    - 45.2K bytes
    - Viewed (0)
  4. cmd/peer-rest-server.go

    				peersLogOnceIf(ctx, err, "event: Encode failed")
    				continue
    			}
    			out <- grid.NewBytesWithCopyOf(buf.Bytes())
    		}
    	}
    }
    
    // TraceHandler sends http trace messages back to peer rest client
    func (s *peerRESTServer) TraceHandler(ctx context.Context, payload []byte, _ <-chan []byte, out chan<- []byte) *grid.RemoteErr {
    	var traceOpts madmin.ServiceTraceOpts
    	err := json.Unmarshal(payload, &traceOpts)
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Oct 04 11:32:32 UTC 2024
    - 53.2K bytes
    - Viewed (0)
  5. okhttp/src/main/kotlin/okhttp3/internal/-HostnamesCommon.kt

        val c = this[i]
        // The WHATWG Host parsing rules accepts some character codes which are invalid by
        // definition for OkHttp's host header checks (and the WHATWG Host syntax definition). Here
        // we rule out characters that would cause problems in host headers.
        if (c <= '\u001f' || c >= '\u007f') {
          return true
        }
        // Check for the characters mentioned in the WHATWG Host parsing spec:
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 11.2K bytes
    - Viewed (0)
  6. okhttp/src/main/kotlin/okhttp3/Interceptor.kt

     * limitations under the License.
     */
    package okhttp3
    
    import java.io.IOException
    import java.util.concurrent.TimeUnit
    
    /**
     * Observes, modifies, and potentially short-circuits requests going out and the corresponding
     * responses coming back in. Typically interceptors add, remove, or transform headers on the request
     * or response.
     *
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 3.5K bytes
    - Viewed (0)
  7. apache-maven/src/assembly/maven/conf/toolchains.xml

     |
     |                 -it /path/to/installation/toolchains.xml
     |
     | The sections in this sample file are intended to give you a running start at
     | getting the most out of your Maven installation.
     |-->
    <toolchains xmlns="http://maven.apache.org/TOOLCHAINS/1.1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Thu Aug 22 14:47:43 UTC 2024
    - 3.6K bytes
    - Viewed (0)
  8. android/guava-testlib/src/com/google/common/collect/testing/testers/CollectionAddTester.java

      }
    
      /**
       * Returns the {@link Method} instance for {@link #testAdd_unsupportedNotPresent()} so that tests
       * can suppress it with {@code FeatureSpecificTestSuiteBuilder.suppressing()} while we figure out
       * what to do with <a
       * href="https://github.com/openjdk/jdk/blob/c25c4896ad9ef031e3cddec493aef66ff87c48a7/src/java.base/share/classes/java/util/concurrent/ConcurrentHashMap.java#L4830">{@code
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 5.9K bytes
    - Viewed (0)
  9. guava-testlib/src/com/google/common/collect/testing/testers/CollectionAddTester.java

      }
    
      /**
       * Returns the {@link Method} instance for {@link #testAdd_unsupportedNotPresent()} so that tests
       * can suppress it with {@code FeatureSpecificTestSuiteBuilder.suppressing()} while we figure out
       * what to do with <a
       * href="https://github.com/openjdk/jdk/blob/c25c4896ad9ef031e3cddec493aef66ff87c48a7/src/java.base/share/classes/java/util/concurrent/ConcurrentHashMap.java#L4830">{@code
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 5.9K bytes
    - Viewed (0)
  10. src/main/java/jcifs/smb1/smb1/SmbException.java

             * negative so it with NT_STATUS_SUCCESS (0) the binary search will not be
             * performed properly. The effect is that the code at index 1 is never found
             * (NT_STATUS_UNSUCCESSFUL). So here we factor out NT_STATUS_SUCCESS
             * as a special case (which it is).
             */
            if (errcode == 0) {
                return "NT_STATUS_SUCCESS";
            }
            if(( errcode & 0xC0000000 ) == 0xC0000000 ) {
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Fri Mar 22 21:10:40 UTC 2019
    - 5.5K bytes
    - Viewed (0)
Back to top