Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 101 - 110 of 162 for independente (0.08 seconds)

  1. internal/s3select/sql/evaluate.go

    	switch e.getFunctionName() {
    	case aggFnCount, aggFnAvg, aggFnMax, aggFnMin, aggFnSum:
    		return e.getAggregate()
    	default:
    		return e.evalSQLFnNode(r, tableAlias)
    	}
    }
    
    // evalNode on a literal value is independent of the node being an
    // aggregation or a row function - it always returns a value.
    func (e *LitValue) evalNode(_ Record) (res *Value, err error) {
    	switch {
    	case e.Int != nil:
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 12K bytes
    - Click Count (0)
  2. docs/es/docs/advanced/settings.md

    <div class="termy">
    
    ```console
    $ pip install "fastapi[all]"
    ---> 100%
    ```
    
    </div>
    
    /// info | Información
    
    En Pydantic v1 venía incluido con el paquete principal. Ahora se distribuye como este paquete independiente para que puedas elegir si instalarlo o no si no necesitas esa funcionalidad.
    
    ///
    
    ### Crear el objeto `Settings` { #create-the-settings-object }
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Dec 17 20:41:43 GMT 2025
    - 13.2K bytes
    - Click Count (0)
  3. src/test/java/org/codelibs/fess/suggest/analysis/SuggestAnalyzerTest.java

            assertEquals(13, tokens.get(2).getEndOffset());
        }
    
        @Test
        public void testMultipleAnalyzersIndependence() {
            // Test that multiple analyzer instances work independently
            SuggestAnalyzer analyzer1 = new TestSuggestAnalyzer();
            SuggestAnalyzer analyzer2 = new TestSuggestAnalyzer();
    
            String text = "test text";
            String field = "content";
    Created: Sat Dec 20 13:04:59 GMT 2025
    - Last Modified: Mon Sep 01 13:33:03 GMT 2025
    - 15.7K bytes
    - Click Count (0)
  4. internal/ioutil/ioutil.go

    // the function finishes executing, Run returns context.DeadlineExceeded to the caller.
    // channel so that the work function can attempt to exit gracefully.
    // Multiple calls to Run will run independently of each other.
    func (d *DeadlineWorker) Run(work func() error) error {
    	_, err := WithDeadline[struct{}](context.Background(), d.timeout, func(ctx context.Context) (struct{}, error) {
    		return struct{}{}, work()
    	})
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Feb 18 16:25:55 GMT 2025
    - 11.1K bytes
    - Click Count (0)
  5. docs/pt/docs/tutorial/dependencies/index.md

    ///
    
    ### Importando `Depends` { #import-depends }
    
    {* ../../docs_src/dependencies/tutorial001_an_py310.py hl[3] *}
    
    ### Declarando a dependência, no "dependente" { #declare-the-dependency-in-the-dependant }
    
    Da mesma forma que você utiliza `Body`, `Query`, etc. Como parâmetros de sua *função de operação de rota*, utilize `Depends` com um novo parâmetro:
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Wed Nov 12 16:23:57 GMT 2025
    - 10.7K bytes
    - Click Count (0)
  6. docs/changelogs/changelog_4x.md

        Previously OkHttp used its connection pool as a lock when making changes to connections and
        calls. With this change each connection is locked independently.
    
     *  Upgrade: [Okio 2.7.0][okio_2_7_0].
    
        ```kotlin
        implementation("com.squareup.okio:okio:2.7.0")
        ```
    
    Created: Fri Dec 26 11:42:13 GMT 2025
    - Last Modified: Wed Apr 17 13:25:31 GMT 2024
    - 25.2K bytes
    - Click Count (0)
  7. src/test/java/jcifs/internal/smb2/create/CreateContextRequestTest.java

                // Encode to different buffers
                int result1 = request.encode(buffer1, 0);
                int result2 = request.encode(buffer2, 50);
    
                // Both should succeed independently
                assertTrue(result1 > 0);
                assertTrue(result2 > 0);
    
                // Verify headers in both buffers
                for (int i = 0; i < 8; i++) {
    Created: Sat Dec 20 13:44:44 GMT 2025
    - Last Modified: Thu Aug 14 05:31:44 GMT 2025
    - 24.9K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/math/Quantiles.java

     * independent of N (but depends on the quantiles being computed). When calling {@link
     * ScaleAndIndex#computeInPlace computeInPlace} (in {@linkplain ScaleAndIndexes#computeInPlace
     * either form}), only the overhead is required. The number of object allocations is independent of
     * N in both cases.
     *
     * @author Pete Gillin
     * @since 20.0
     */
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Mar 17 20:26:29 GMT 2025
    - 30.1K bytes
    - Click Count (0)
  9. docs/sts/web-identity.md

    at startup that must be specified as a `RoleArn` API request parameter in the STS AssumeRoleWithWebIdentity API call. When using Role Policies, multiple OpenID providers and/or client applications (with unique client IDs) may be configured with independent role policies. Each configuration is assigned a unique RoleARN by the MinIO server and this is used to select the policies to apply to temporary credentials generated in the AssumeRoleWithWebIdentity call.
    
    2. `id_token` claims: When the...
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Tue Aug 12 18:20:36 GMT 2025
    - 18.9K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/collect/MultimapBuilder.java

    import java.util.Set;
    import java.util.SortedSet;
    import java.util.TreeMap;
    import java.util.TreeSet;
    import org.jspecify.annotations.Nullable;
    
    /**
     * An immutable builder for {@link Multimap} instances, letting you independently select the desired
     * behaviors (for example, ordering) of the backing map and value-collections. Example:
     *
     * {@snippet :
     * ListMultimap<UserId, ErrorResponse> errorsByUser =
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 18K bytes
    - Click Count (0)
Back to Top