Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 168 for productif (0.06 sec)

  1. docs/fr/docs/async.md

    ///
    
    ---
    
    Imaginez que vous êtes l'ordinateur / le programme 🤖 dans cette histoire.
    
    Pendant que vous faites la queue, vous être simplement inactif 😴, attendant votre tour, ne faisant rien de "productif". Mais la queue est rapide car le serveur 💁 prend seulement les commandes (et ne les prépare pas), donc tout va bien.
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:56:21 UTC 2025
    - 25.4K bytes
    - Viewed (0)
  2. tests/hooks_test.go

    	DB.Model(&product).Updates(Product3{Code: "L1214"})
    	if product.Price != 270 || product.Code != "L1214" {
    		t.Errorf("invalid data after update, got %+v", product)
    	}
    
    	// Code changed, price should changed
    	DB.Model(&product).Select("Name", "Code", "Price").Updates(Product3{Name: "Product New4", Code: ""})
    	if product.Name != "Product New4" || product.Price != 320 || product.Code != "" {
    		t.Errorf("invalid data after update, got %+v", product)
    	}
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Mon Jun 17 03:59:06 UTC 2024
    - 16.7K bytes
    - Viewed (0)
  3. schema/schema_test.go

    	}
    
    	product, err := schema.Parse(&Product{}, &sync.Map{}, schema.NamingStrategy{})
    	if err != nil {
    		t.Fatalf("failed to parse product struct with composite primary key, got error %v", err)
    	}
    
    	prioritizedPrimaryField := schema.Field{
    Registered: Sun Sep 07 09:35:13 UTC 2025
    - Last Modified: Thu Aug 28 02:57:17 UTC 2025
    - 13.3K bytes
    - Viewed (0)
  4. guava/src/com/google/common/math/BigIntegerMath.java

          // If it won't fit in a long, then we store off the intermediate product.
          if (normalizedBits + productBits >= Long.SIZE) {
            bignums.add(BigInteger.valueOf(product));
            product = 1;
            productBits = 0;
          }
          product *= normalizedNum;
          productBits = LongMath.log2(product, FLOOR) + 1;
        }
        // Check for leftovers.
        if (product > 1) {
          bignums.add(BigInteger.valueOf(product));
        }
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 18.8K bytes
    - Viewed (0)
  5. cmd/veeam-sos-api.go

    //     that gets offloaded). The same registry key setting overwrites the storage-defined setting.
    //     Optional value, default 64, range: 1-unlimited
    //
    //   - <S3MultiObjectDeleteLimit>
    //     Some of the Veeam products use Multi Delete operations. This setting can reduce how many objects are included in one
    //     multi-delete operation. The same registry key setting overwrites the storage-defined setting.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Thu Aug 15 00:34:56 UTC 2024
    - 8.8K bytes
    - Viewed (0)
  6. docs/en/docs/index.md

    ## Opinions { #opinions }
    
    "_[...] I'm using **FastAPI** a ton these days. [...] I'm actually planning to use it for all of my team's **ML services at Microsoft**. Some of them are getting integrated into the core **Windows** product and some **Office** products._"
    
    <div style="text-align: right; margin-right: 10%;">Kabir Khan - <strong>Microsoft</strong> <a href="https://github.com/fastapi/fastapi/pull/26" target="_blank"><small>(ref)</small></a></div>
    
    ---
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 21.3K bytes
    - Viewed (0)
  7. guava/src/com/google/common/math/PairedStatsAccumulator.java

        // vol. 2, Knuth, 4.2.2, (16) to the two-variable case. We have two value series x_i and y_i.
        // We define the arithmetic means X_n = 1/n \sum_{i=1}^n x_i, and Y_n = 1/n \sum_{i=1}^n y_i.
        // We also define the sum of the products of the differences from the means
        //           C_n = \sum_{i=1}^n x_i y_i - n X_n Y_n
        // for all n >= 1. Then for all n > 1:
        //       C_{n-1} = \sum_{i=1}^{n-1} x_i y_i - (n-1) X_{n-1} Y_{n-1}
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 16:36:11 UTC 2025
    - 10.4K bytes
    - Viewed (0)
  8. README.md

    ## Opinions { #opinions }
    
    "_[...] I'm using **FastAPI** a ton these days. [...] I'm actually planning to use it for all of my team's **ML services at Microsoft**. Some of them are getting integrated into the core **Windows** product and some **Office** products._"
    
    <div style="text-align: right; margin-right: 10%;">Kabir Khan - <strong>Microsoft</strong> <a href="https://github.com/fastapi/fastapi/pull/26" target="_blank"><small>(ref)</small></a></div>
    
    ---
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 15:19:49 UTC 2025
    - 24.3K bytes
    - Viewed (0)
  9. README.md

    - Test all upgrades in a lower environment (DEV, QA, UAT) before applying to production. Performing blind upgrades in production environments carries significant risk.
    - Read the release notes for MinIO *before* performing any upgrade, there is no forced requirement to upgrade to latest release upon every release. Some release may not be relevant to your setup, avoid upgrading production environments unnecessarily.
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Tue Aug 12 18:20:36 UTC 2025
    - 18.7K bytes
    - Viewed (0)
  10. docs/hu/docs/index.md

    ## Vélemények
    
    "_[...] I'm using **FastAPI** a ton these days. [...] I'm actually planning to use it for all of my team's **ML services at Microsoft**. Some of them are getting integrated into the core **Windows** product and some **Office** products._"
    
    <div style="text-align: right; margin-right: 10%;">Kabir Khan - <strong>Microsoft</strong> <a href="https://github.com/fastapi/fastapi/pull/26" target="_blank"><small>(ref)</small></a></div>
    
    ---
    
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 10:49:48 UTC 2025
    - 20.2K bytes
    - Viewed (0)
Back to top