Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 471 - 480 of 595 for EQUAL (0.02 seconds)

  1. docs/fr/docs/tutorial/path-params-numeric-validations.md

    {* ../../docs_src/path_params_numeric_validations/tutorial003_an_py310.py hl[10] *}
    
    ## Validations numériques : supérieur ou égal { #number-validations-greater-than-or-equal }
    
    Avec `Query` et `Path` (et d'autres que vous verrez plus tard) vous pouvez déclarer des contraintes numériques.
    
    Ici, avec `ge=1`, `item_id` devra être un nombre entier « `g`reater than or `e`qual » à `1`.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:37:13 GMT 2026
    - 7.1K bytes
    - Click Count (0)
  2. docs/pt/docs/tutorial/path-params-numeric-validations.md

    {* ../../docs_src/path_params_numeric_validations/tutorial003_an_py310.py hl[10] *}
    
    ## Validações numéricas: maior que ou igual { #number-validations-greater-than-or-equal }
    
    Com `Query` e `Path` (e outras que você verá depois) você pode declarar restrições numéricas.
    
    Aqui, com `ge=1`, `item_id` precisará ser um número inteiro “`g`reater than or `e`qual” a `1`.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 18:20:43 GMT 2026
    - 6.7K bytes
    - Click Count (0)
  3. tensorflow/c/c_api.h

    //  status - Set to OK on success and an appropriate error on failure.
    //
    // Note that when the same TF_Output is listed as both an input and an output,
    // the corresponding function's output will equal to this input,
    // instead of the original node's output.
    //
    // Callers must also satisfy the following constraints:
    // - `inputs` cannot refer to TF_Outputs within a control flow context. For
    Created: Tue Apr 07 12:39:13 GMT 2026
    - Last Modified: Thu Oct 26 21:08:15 GMT 2023
    - 82.3K bytes
    - Click Count (0)
  4. android/guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java

        Random random = new Random(0);
        Multiset<Integer> elements = HashMultiset.create();
        MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create();
        int range = 10_000; // range should be small enough that equal elements occur semi-frequently
        for (int iter = 0; iter < reduceIterationsIfGwt(1000); iter++) {
          for (int i = 0; i < 100; i++) {
            Integer element = random.nextInt(range);
            elements.add(element);
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 36.2K bytes
    - Click Count (0)
  5. cmd/erasure-healing-common.go

    	timeOccurrenceMap := make(map[int64]int, len(times))
    	groupNano := group.Nanoseconds()
    	// Ignore the uuid sentinel and count the rest.
    	for _, t := range times {
    		if t.Equal(timeSentinel) || t.IsZero() {
    			continue
    		}
    		nano := t.UnixNano()
    		if group > 0 {
    			for k := range timeOccurrenceMap {
    				if k == nano {
    					// We add to ourself later
    					continue
    				}
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 12K bytes
    - Click Count (0)
  6. internal/s3select/simdj/reader_amd64_test.go

    				}
    				err = rec.WriteCSV(&gotB, opts)
    				if err != nil {
    					t.Error(err)
    				}
    				err = want.WriteCSV(&wantB, opts)
    				if err != nil {
    					t.Error(err)
    				}
    
    				if !bytes.Equal(gotB.Bytes(), wantB.Bytes()) {
    					t.Errorf("CSV output mismatch.\nwant: %s(%x)\ngot:  %s(%x)", wantB.String(), wantB.Bytes(), gotB.String(), gotB.Bytes())
    				}
    				gotB.Reset()
    				wantB.Reset()
    
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 3.9K bytes
    - Click Count (0)
  7. src/archive/zip/writer_test.go

    	idx := bytes.Index(b, sig[:])
    	if idx == -1 {
    		t.Fatal("file header not found")
    	}
    	b = b[idx:]
    
    	if !bytes.Equal(b[6:10], []byte{0, 0, 0, 0}) { // FileHeader.Flags: 0, FileHeader.Method: 0
    		t.Errorf("unexpected method and flags: %v", b[6:10])
    	}
    
    	if !bytes.Equal(b[14:26], make([]byte, 12)) { // FileHeader.{CRC32,CompressSize,UncompressedSize} all zero.
    Created: Tue Apr 07 11:13:11 GMT 2026
    - Last Modified: Tue Jan 28 04:20:09 GMT 2025
    - 14.4K bytes
    - Click Count (0)
  8. tests/test_path.py

        assert response.json() == {
            "detail": [
                {
                    "type": "greater_than_equal",
                    "loc": ["path", "item_id"],
                    "msg": "Input should be greater than or equal to 3",
                    "input": "2",
                    "ctx": {"ge": 3.0},
                }
            ]
        }
    
    
    def test_path_param_lt_42():
        response = client.get("/path/param-lt/42")
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Sat Dec 27 18:19:10 GMT 2025
    - 20.5K bytes
    - Click Count (2)
  9. cmd/bitrot.go

    	if algo != HighwayHash256S {
    		h := algo.New()
    		if n, err := io.Copy(h, r); err != nil || n != wantSize {
    			// Premature failure in reading the object, file is corrupt.
    			return errFileCorrupt
    		}
    		if !bytes.Equal(h.Sum(nil), want) {
    			return errFileCorrupt
    		}
    		return nil
    	}
    
    	h := algo.New()
    	hashBuf := make([]byte, h.Size())
    	left := wantSize
    
    	// Calculate the size of the bitrot file and compare
    Created: Sun Apr 05 19:28:12 GMT 2026
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 7.7K bytes
    - Click Count (0)
  10. docs/de/docs/tutorial/path-params-numeric-validations.md

    {* ../../docs_src/path_params_numeric_validations/tutorial003_an_py310.py hl[10] *}
    
    ## Validierung von Zahlen: Größer oder gleich { #number-validations-greater-than-or-equal }
    
    Mit `Query` und `Path` (und anderen, die Sie später sehen werden) können Sie Zahlenbeschränkungen deklarieren.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 19 17:58:09 GMT 2026
    - 7.1K bytes
    - Click Count (0)
Back to Top