Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1011 - 1020 of 1,427 for appends (0.15 sec)

  1. cmd/streaming-signature-v4_test.go

    		{"10000000000000000", 0, "http chunk length too large"},
    		{"00000000000000001", 0, "http chunk length too large"}, // could accept if we wanted
    	}
    	for i := uint64(0); i <= 1234; i++ {
    		tests = append(tests, testCase{in: fmt.Sprintf("%x", i), want: i})
    	}
    	for _, tt := range tests {
    		got, err := parseHexUint([]byte(tt.in))
    		if tt.wantErr != "" {
    			if err != nil && !strings.Contains(err.Error(), tt.wantErr) {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Fri Apr 23 18:58:53 UTC 2021
    - 5.7K bytes
    - Viewed (0)
  2. cmd/erasure-sets_test.go

    		// so that newErasureSets initializes non existing paths
    		// and successfully returns initialized object layer.
    		disk := filepath.Join(globalTestTmpDir, "minio-"+nextSuffix())
    		erasureDisks = append(erasureDisks, disk)
    		defer os.RemoveAll(disk)
    	}
    
    	endpoints := mustGetNewEndpoints(0, 16, erasureDisks...)
    	_, _, err := waitForFormatErasure(true, endpoints, 1, 0, 16, "")
    	if err != errInvalidArgument {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Mon Feb 12 07:21:56 UTC 2024
    - 6.9K bytes
    - Viewed (0)
  3. android/guava/pom.xml

      <build>
        <resources>
          <resource>
            <directory>..</directory>
            <includes>
              <include>LICENSE</include> <!-- copied from the parent pom because I couldn't figure out a way to make combine.children="append" work -->
              <include>proguard/*</include>
            </includes>
            <targetPath>META-INF</targetPath>
          </resource>
        </resources>
        <plugins>
          <plugin>
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Jul 24 18:53:31 UTC 2024
    - 9.1K bytes
    - Viewed (0)
  4. docs/fr/docs/tutorial/index.md

    Il existe également un **Guide d'utilisation avancé** que vous pouvez lire plus tard après ce **Tutoriel - Guide d'utilisation**.
    
    Le **Guide d'utilisation avancé**, qui s'appuie sur cette base, utilise les mêmes concepts et vous apprend quelques fonctionnalités supplémentaires.
    
    Mais vous devez d'abord lire le **Tutoriel - Guide d'utilisation** (ce que vous êtes en train de lire en ce moment).
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Tue Aug 06 04:48:30 UTC 2024
    - 3K bytes
    - Viewed (0)
  5. architecture/networking/pilot.md

    This caching depends on declaring all inputs to the given generator as part of the cache key. This is extremely error-prone, as there is nothing preventing generators from consuming inputs that are *not* part of the key. When this happens, different clients will non-deterministically get incorrect configuration. This type of bug has historically resulted in CVEs.
    
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Wed Feb 07 17:53:24 UTC 2024
    - 19.1K bytes
    - Viewed (0)
  6. docs/pt/docs/tutorial/security/first-steps.md

    Pode ser chamada de:
    
    ```Python
    oauth2_scheme(some, parameters)
    ```
    
    Então, pode ser usado com `Depends`.
    
    ## Use-o
    
    Agora você pode passar aquele `oauth2_scheme` em uma dependência com `Depends`.
    
    ```Python hl_lines="10"
    {!../../docs_src/security/tutorial001.py!}
    ```
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 06 20:36:54 UTC 2024
    - 8.4K bytes
    - Viewed (0)
  7. src/archive/tar/reader.go

    			if (len(sparseMap)%2 == 0 && key != paxGNUSparseOffset) ||
    				(len(sparseMap)%2 == 1 && key != paxGNUSparseNumBytes) ||
    				strings.Contains(value, ",") {
    				return nil, ErrHeader
    			}
    			sparseMap = append(sparseMap, value)
    		default:
    			paxHdrs[key] = value
    		}
    	}
    	if len(sparseMap) > 0 {
    		paxHdrs[paxGNUSparseMap] = strings.Join(sparseMap, ",")
    	}
    	return paxHdrs, nil
    }
    
    Registered: Tue Nov 05 11:13:11 UTC 2024
    - Last Modified: Fri Mar 08 01:59:14 UTC 2024
    - 26.8K bytes
    - Viewed (0)
  8. android/guava-tests/test/com/google/common/hash/SipHashFunctionTest.java

          for (int j = 0; j < i; ++j) {
            msg[j] = (byte) j;
          }
          assertSip(msg, EXPECTED[i]);
        }
      }
    
      // This test data comes from "SipHash: a fast short-input PRF", "Appendix A: Test values".
      // It can be downloaded here: https://131002.net/siphash/siphash.pdf
      public void test15ByteStringFromSipHashPaper() {
        byte[] message =
            new byte[] {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 23 14:22:54 UTC 2024
    - 6.6K bytes
    - Viewed (0)
  9. guava-tests/test/com/google/common/hash/SipHashFunctionTest.java

          for (int j = 0; j < i; ++j) {
            msg[j] = (byte) j;
          }
          assertSip(msg, EXPECTED[i]);
        }
      }
    
      // This test data comes from "SipHash: a fast short-input PRF", "Appendix A: Test values".
      // It can be downloaded here: https://131002.net/siphash/siphash.pdf
      public void test15ByteStringFromSipHashPaper() {
        byte[] message =
            new byte[] {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Tue Jul 23 14:22:54 UTC 2024
    - 6.6K bytes
    - Viewed (0)
  10. common-protos/k8s.io/api/node/v1/generated.proto

      // with a pod's existing nodeSelector. Any conflicts will cause the pod to
      // be rejected in admission.
      // +optional
      // +mapType=atomic
      map<string, string> nodeSelector = 1;
    
      // tolerations are appended (excluding duplicates) to pods running with this
      // RuntimeClass during admission, effectively unioning the set of nodes
      // tolerated by the pod and the RuntimeClass.
      // +optional
      // +listType=atomic
    Registered: Wed Nov 06 22:53:10 UTC 2024
    - Last Modified: Mon Mar 11 18:43:24 UTC 2024
    - 4.4K bytes
    - Viewed (0)
Back to top