Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 291 - 300 of 609 for head (0.02 seconds)

  1. docs/en/docs/tutorial/request-files.md

    * `write(data)`: Writes `data` (`str` or `bytes`) to the file.
    * `read(size)`: Reads `size` (`int`) bytes/characters of the file.
    * `seek(offset)`: Goes to the byte position `offset` (`int`) in the file.
        * E.g., `await myfile.seek(0)` would go to the start of the file.
        * This is especially useful if you run `await myfile.read()` once and then need to read the contents again.
    * `close()`: Closes the file.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 7K bytes
    - Click Count (0)
  2. docs/kms/IAM.md

       change the cluster root credentials since they were used to en/decrypt the IAM data.
       So, both - the old and new credentials - had to be present at the same time during a rotation
       and the old credentials had to be removed once the rotation completed. This process is now gone.
       The root credentials can now be changed easily.
    
    > Does this mean I need an enterprise KMS setup to run MinIO (securely)?
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Thu Jan 18 07:03:17 GMT 2024
    - 5.3K bytes
    - Click Count (0)
  3. docs/bucket/lifecycle/README.md

    ```
    mc admin tier add s3 source S3TIER --bucket s3bucket --prefix testprefix/ --use-aws-role
    ```
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 9.1K bytes
    - Click Count (0)
  4. okhttp/src/jvmTest/kotlin/okhttp3/internal/connection/FastFallbackExchangeFinderTest.kt

        )
    
        taskFaker.assertNoMoreTasks()
      }
    
      /**
       * This test performs two races:
       *
       *  * The first race is between plan0 and plan1, with a 250 ms head start for plan0.
       *  * The second race is between plan2 and plan3, with a 250 ms head start for plan2.
       *
       * We get plan0 and plan1 from the route planner.
       * We get plan2 as a follow-up to plan1, typically retry the same IP but different TLS.
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Fri Dec 27 13:39:56 GMT 2024
    - 20.9K bytes
    - Click Count (0)
  5. helm-releases/minio-5.0.6.tgz

    EY_TMP|wc -l) -ne 2 ]];then echo "credentials file is invalid" rm -f $MINIO_ACCESSKEY_SECRETKEY_TMP return 1 fi SVCACCT=$(head -1 $MINIO_ACCESSKEY_SECRETKEY_TMP) # Create the svcacct if it does not exist if ! checkSvcacctExists ; then echo "Creating svcacct '$SVCACCT'" # Check if policy file is define if [ -z $FILENAME ]; then ${MC} admin user svcacct add --access-key $(head -1 $MINIO_ACCESSKEY_SECRETKEY_TMP) --secret-key $(tail -n1 $MINIO_ACCESSKEY_SECRETKEY_TMP) myminio $USER else ${MC} admin user...
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Mon Feb 13 06:53:06 GMT 2023
    - 20.3K bytes
    - Click Count (0)
  6. helm-releases/minio-5.2.0.tgz

    EY_TMP|wc -l) -ne 2 ]];then echo "credentials file is invalid" rm -f $MINIO_ACCESSKEY_SECRETKEY_TMP return 1 fi SVCACCT=$(head -1 $MINIO_ACCESSKEY_SECRETKEY_TMP) # Create the svcacct if it does not exist if ! checkSvcacctExists ; then echo "Creating svcacct '$SVCACCT'" # Check if policy file is define if [ -z $FILENAME ]; then ${MC} admin user svcacct add --access-key $(head -1 $MINIO_ACCESSKEY_SECRETKEY_TMP) --secret-key $(tail -n1 $MINIO_ACCESSKEY_SECRETKEY_TMP) myminio $USER else ${MC} admin user...
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Apr 28 10:14:37 GMT 2024
    - 21.7K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/eventbus/Dispatcher.java

        // 2. It's possible for subscribers to actually be dispatched to in a different order than they
        //    were added to the queue. It's easily possible for one thread to take the head of the
        //    queue, immediately followed by another thread taking the next element in the queue. That
        //    second thread can then dispatch to the subscriber it took before the first thread does.
        //
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue May 13 17:27:14 GMT 2025
    - 7.4K bytes
    - Click Count (0)
  8. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java

     * elements FIFO (first-in-first-out). The head of the queue is that element that has been
     * on the queue the longest time. The tail of the queue is that element that has been on
     * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue
     * retrieval operations obtain elements at the head of the queue.
     *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 22.4K bytes
    - Click Count (0)
  9. okhttp/src/jvmTest/kotlin/okhttp3/CacheTest.kt

          MockResponse
            .Builder()
            .addHeader("Allow: GET, HEAD")
            .addHeader("Last-Modified: " + formatDate(-1, TimeUnit.HOURS))
            .addHeader("Cache-Control: max-age=0")
            .body("A")
            .build(),
        )
        server.enqueue(
          MockResponse
            .Builder()
            .addHeader("Allow: GET, HEAD, PUT")
            .code(HttpURLConnection.HTTP_NOT_MODIFIED)
            .build(),
    Created: Fri Apr 03 11:42:14 GMT 2026
    - Last Modified: Fri Mar 20 09:13:37 GMT 2026
    - 121K bytes
    - Click Count (0)
  10. src/main/java/jcifs/smb1/http/NetworkExplorer.java

            out = resp.getWriter();
    
            resp.setContentType("text/html");
    
            out.println("<!DOCTYPE HTML PUBLIC \"-//W3C//DTD HTML 4.01 Transitional//EN\">");
            out.println("<html><head><title>Network Explorer</title>");
            out.println("<meta HTTP-EQUIV=\"Pragma\" CONTENT=\"no-cache\">");
            out.println("<style TYPE=\"text/css\">");
    
            out.println(style);
    
    Created: Sun Apr 05 00:10:12 GMT 2026
    - Last Modified: Sun Aug 31 08:00:57 GMT 2025
    - 22.6K bytes
    - Click Count (0)
Back to Top