Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 247 for elts (0.59 sec)

  1. tensorflow/cc/client/client_session.h

    struct ThreadPoolOptions;
    }
    }  // namespace tsl
    
    namespace tensorflow {
    
    namespace thread {
    using tsl::thread::ThreadPoolOptions;
    }
    
    /// @addtogroup core
    /// @{
    
    /// A `ClientSession` object lets the caller drive the evaluation of the
    /// TensorFlow graph constructed with the C++ API.
    ///
    /// Example:
    ///
    ///     Scope root = Scope::NewRootScope();
    ///     auto a = Placeholder(root, DT_INT32);
    Registered: Sun Jun 16 05:45:23 UTC 2024
    - Last Modified: Tue Sep 20 08:11:46 UTC 2022
    - 6.1K bytes
    - Viewed (0)
  2. docs/pt/docs/tutorial/path-operation-configuration.md

        ```
    
    === "Python 3.10 and above"
    
        ```Python hl_lines="15  20  25"
        {!> ../../../docs_src/path_operation_configuration/tutorial002_py310.py!}
        ```
    
    Eles serão adicionados ao esquema OpenAPI e usados pelas interfaces de documentação automática:
    
    <img src="/img/tutorial/path-operation-configuration/image01.png">
    
    ### Tags com Enums
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Tue Oct 17 05:59:11 UTC 2023
    - 5.9K bytes
    - Viewed (0)
  3. src/cmd/compile/internal/ssagen/nowb.go

    }
    
    func (c *nowritebarrierrecChecker) check() {
    	// We walk the call graph as late as possible so we can
    	// capture all calls created by lowering, but this means we
    	// only get to see the obj.LSyms of calls. symToFunc lets us
    	// get back to the ODCLFUNCs.
    	symToFunc := make(map[*obj.LSym]*ir.Func)
    	// funcs records the back-edges of the BFS call graph walk. It
    	// maps from the ODCLFUNC of each function that must not have
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 15 17:29:46 UTC 2024
    - 5.9K bytes
    - Viewed (0)
  4. internal/jwt/parser.go

    	}
    	borrow.ReturnAll()
    
    	if claims.AccessKey == "" && claims.Subject == "" {
    		return jwtgo.NewValidationError("accessKey/sub missing",
    			jwtgo.ValidationErrorClaimsInvalid)
    	}
    
    	// Signature is valid, lets validate the claims for
    	// other fields such as expiry etc.
    	return claims.Valid()
    }
    
    // ParseUnverifiedStandardClaims - WARNING: Don't use this method unless you know what you're doing
    //
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Tue May 09 07:53:08 UTC 2023
    - 13.9K bytes
    - Viewed (0)
  5. docs/pt/docs/tutorial/background-tasks.md

    Eles tendem a exigir configurações mais complexas, um gerenciador de fila de mensagens/tarefas, como RabbitMQ ou Redis, mas permitem que você execute tarefas em segundo plano em vários processos e, especialmente, em vários servidores.
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Mon May 09 23:44:32 UTC 2022
    - 5.3K bytes
    - Viewed (0)
  6. src/runtime/memmove_386.s

    	// for large sizes. The cutover is approximately 1K.  We implement up to
    	// 128 because that is the maximum SSE register load (loading all data
    	// into registers lets us ignore copy direction).
    tail:
    	// BSR+branch table make almost all memmove/memclr benchmarks worse. Not worth doing.
    	TESTL	BX, BX
    	JEQ	move_0
    	CMPL	BX, $2
    	JBE	move_1or2
    	CMPL	BX, $4
    	JB	move_3
    	JE	move_4
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Nov 06 10:24:44 UTC 2021
    - 4.4K bytes
    - Viewed (0)
  7. staging/src/k8s.io/apiserver/pkg/admission/plugin/resourcequota/resource_access.go

    	// lister can list/get quota objects from a shared informer's cache
    	lister corev1listers.ResourceQuotaLister
    
    	// liveLookups holds the last few live lookups we've done to help ammortize cost on repeated lookup failures.
    	// This lets us handle the case of latent caches, by looking up actual results for a namespace on cache miss/no results.
    	// We track the lookup result here so that for repeated requests, we don't look it up very often.
    	liveLookupCache *lru.Cache
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Wed Apr 10 13:54:56 UTC 2024
    - 5.6K bytes
    - Viewed (0)
  8. docs/pt/docs/tutorial/schema-extra-example.md

    Mas quando você usa `example` ou `examples` com qualquer um dos outros utilitários (`Query()`, `Body()`, etc.) esses exemplos não são adicionados ao JSON Schema que descreve esses dados (nem mesmo para versão própria do OpenAPI do JSON Schema), eles são adicionados diretamente à declaração da *operação de rota* no OpenAPI (fora das partes do OpenAPI que usam o JSON Schema).
    
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Fri Mar 22 01:42:11 UTC 2024
    - 6.1K bytes
    - Viewed (0)
  9. docs/pt/docs/tutorial/handling-errors.md

    path -> item_id
      value is not a valid integer (type=type_error.integer)
    ```
    
    ### `RequestValidationError` vs `ValidationError`
    
    !!! warning "Aviso"
        Você pode pular estes detalhes técnicos caso eles não sejam importantes para você neste momento.
    
    `RequestValidationError` é uma subclasse do <a href="https://docs.pydantic.dev/latest/#error-handling" class="external-link" target="_blank">`ValidationError`</a> existente no Pydantic.
    Registered: Mon Jun 17 08:32:26 UTC 2024
    - Last Modified: Fri Mar 22 01:42:11 UTC 2024
    - 10K bytes
    - Viewed (0)
  10. pkg/scheduler/framework/plugins/noderesources/balanced_allocation.go

    			sum = sum + (fraction-mean)*(fraction-mean)
    		}
    		std = math.Sqrt(sum / float64(len(resourceToFractions)))
    	}
    
    	// STD (standard deviation) is always a positive value. 1-deviation lets the score to be higher for node which has least deviation and
    	// multiplying it with `MaxNodeScore` provides the scaling factor needed.
    	return int64((1 - std) * float64(framework.MaxNodeScore))
    Registered: Sat Jun 15 01:39:40 UTC 2024
    - Last Modified: Fri Dec 15 03:30:06 UTC 2023
    - 6.5K bytes
    - Viewed (0)
Back to top