- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 16 for Legros (0.16 sec)
-
tensorflow/c/eager/tape.h
} // We may need to allocate zero inputs for trainable dtypes we don't have JVPs // for. Make sure they get cleaned up. std::vector<Gradient*> new_zeros; auto delete_new_zeros = gtl::MakeCleanup([&new_zeros, this] { for (Gradient* tensor : new_zeros) { this->vspace_.DeleteGradient(tensor); } }); std::vector<Gradient*> in_grads; in_grads.reserve(input_tensors.size());
C - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Tue Apr 02 12:40:29 GMT 2024 - 47.2K bytes - Viewed (1) -
docs/pt/docs/tutorial/handling-errors.md
Os status codes na faixa dos 400 significam que houve um erro por parte do cliente. Você se lembra de todos aqueles erros (e piadas) a respeito do "**404 Not Found**"? ## Use o `HTTPException` Para retornar ao cliente *responses* HTTP com erros, use o `HTTPException`. ### Import `HTTPException` ```Python hl_lines="1" {!../../../docs_src/handling_errors/tutorial001.py!} ```
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Fri Mar 22 01:42:11 GMT 2024 - 10K bytes - Viewed (0) -
src/archive/tar/reader.go
// // The err will be set to io.EOF only when one of the following occurs: // - Exactly 0 bytes are read and EOF is hit. // - Exactly 1 block of zeros is read and EOF is hit. // - At least 2 blocks of zeros are read. func (tr *Reader) readHeader() (*Header, *block, error) { // Two blocks of zero bytes marks the end of the archive. if _, err := io.ReadFull(tr.r, tr.blk[:]); err != nil {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Fri Mar 08 01:59:14 GMT 2024 - 26.8K bytes - Viewed (0) -
src/archive/zip/zip_test.go
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Mar 27 18:23:49 GMT 2024 - 19.5K bytes - Viewed (0) -
okhttp-tls/src/test/java/okhttp3/tls/internal/der/DerTest.kt
assertThat(Adapters.INTEGER_AS_LONG.fromDer(bytes)).isEqualTo(-549755813887L) assertThat(Adapters.INTEGER_AS_LONG.toDer(-549755813887L)).isEqualTo(bytes) } @Test fun `eight zeros`() { val bytes = "020200ff".decodeHex() assertThat(Adapters.INTEGER_AS_LONG.fromDer(bytes)).isEqualTo(255) assertThat(Adapters.INTEGER_AS_LONG.toDer(255)).isEqualTo(bytes) }
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 31.7K bytes - Viewed (0) -
docs/pt/docs/index.md
* **Rápido para codar**: Aumenta a velocidade para desenvolver recursos entre 200% a 300%. * * **Poucos bugs**: Reduz cerca de 40% de erros induzidos por humanos (desenvolvedores). * * **Intuitivo**: Grande suporte a _IDEs_. <abbr title="também conhecido como _auto-complete_, _autocompletion_, _IntelliSense_">_Auto-Complete_</abbr> em todos os lugares. Menos tempo debugando.
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Mon Apr 29 05:18:04 GMT 2024 - 18.6K bytes - Viewed (0) -
docs/pt/docs/features.md
* Se você conhece os tipos do Python, você sabe como usar o Pydantic. * Vai bem com o/a seu/sua **<abbr title="Ambiente de Desenvolvimento Integrado, similar a um editor de código">IDE</abbr>/<abbr title="Um programa que confere erros de código">linter</abbr>/cérebro**: * Como as estruturas de dados do Pydantic são apenas instâncias de classes que você define, a auto completação, _linting_, _mypy_ e a sua intuição devem funcionar corretamente com seus dados validados.
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 10.4K bytes - Viewed (0) -
docs/debugging/xl-meta/main.go
if err := json.Unmarshal(buf.Bytes(), &ei); err == nil && ei.V2Obj != nil { verID := uuid.UUID(header.VersionID).String() if verID == "00000000-0000-0000-0000-000000000000" { // If the version ID is all zeros, use the signature as version ID. verID = fmt.Sprintf("null/%08x", header.Signature) v0 = verID } idx := ei.V2Obj.EcIndex
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed Apr 24 17:56:22 GMT 2024 - 20.2K bytes - Viewed (1) -
android/guava/src/com/google/common/math/IntMath.java
} private static int log10Floor(int x) { /* * Based on Hacker's Delight Fig. 11-5, the two-table-lookup, branch-free implementation. * * The key idea is that based on the number of leading zeros (equivalently, floor(log2(x))), we * can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6, * then 64 <= x < 128, so floor(log10(x)) is either 1 or 2. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
tensorflow/c/eager/gradients.cc
} } TF_RETURN_IF_ERROR(GradientTape::ComputeGradient( vspace, target_tensor_ids, source_tensor_ids, sources_that_are_targets, output_gradients, result, /*build_default_zeros_grads*/ false)); return absl::OkStatus(); } // Helper functions which delegate to `AbstractOperation`, update // the state of the ForwardOperation and call the tape as appropriate.
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Thu Feb 15 09:49:45 GMT 2024 - 19.3K bytes - Viewed (0)