- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 392 for zeros (0.19 sec)
-
tensorflow/c/eager/tape.h
return absl::OkStatus(); } // 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;
C - Registered: Tue Apr 23 12:39:09 GMT 2024 - Last Modified: Tue Apr 02 12:40:29 GMT 2024 - 47.2K bytes - Viewed (1) -
src/archive/tar/reader.go
if _, err := io.ReadFull(tr.r, tr.blk[:]); err != nil { return nil, nil, err // EOF is okay here; exactly 1 block of zeros read } if bytes.Equal(tr.blk[:], zeroBlock[:]) { return nil, nil, io.EOF // normal EOF; exactly 2 block of zeros read } return nil, nil, ErrHeader // Zero block and then non-zero block } // Verify the header matches a known format. format := tr.blk.getFormat()
Go - Registered: Tue Apr 23 11:13:09 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 23 11:13:09 GMT 2024 - Last Modified: Wed Mar 27 18:23:49 GMT 2024 - 19.5K bytes - Viewed (0) -
common-protos/k8s.io/api/networking/v1alpha1/generated.proto
// An IP address can be represented in different formats, to guarantee the uniqueness of the IP, // the name of the object is the IP address in canonical format, four decimal digits separated // by dots suppressing leading zeros for IPv4 and the representation defined by RFC 5952 for IPv6. // Valid: 192.168.1.5 or 2001:db8::1 or 2001:db8:aaaa:bbbb:cccc:dddd:eeee:1 // Invalid: 10.01.2.3 or 2001:db8:0:0:0::1 message IPAddress {
Plain Text - Registered: Wed Apr 24 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/LittleEndianByteArray.java
static long load64Safely(byte[] input, int offset, int length) { long result = 0; // Due to the way we shift, we can stop iterating once we've run out of data, the rest // of the result already being filled with zeros. // This loop is critical to performance, so please check HashBenchmark if altering it. int limit = Math.min(length, 8); for (int i = 0; i < limit; i++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 9.7K bytes - Viewed (0) -
tensorflow/c/experimental/gradients/array_grad_test.cc
}; TEST_P(CppGradients, TestIdentityNGrad) { // This test is interesting because the current implementation of GradientTape // would return [0, 1] whereas we use build_default_zeros_grads=false here // so we get back [nullptr, 1]. AbstractTensorHandlePtr x1; { AbstractTensorHandle* x1_raw = nullptr; status_ = TestScalarTensorHandle<float, TF_FLOAT>(
C++ - Registered: Tue Mar 26 12:39:09 GMT 2024 - Last Modified: Wed Feb 28 13:53:47 GMT 2024 - 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 Apr 26 11:42:10 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 31.7K bytes - Viewed (0) -
src/archive/zip/reader_test.go
// // import ( // "archive/zip" // "bytes" // "io" // "log" // "os" // ) // // type zeros struct{} // // func (zeros) Read(b []byte) (int, error) { // clear(b) // return len(b), nil // } // // func main() { // bigZip := makeZip("big.file", io.LimitReader(zeros{}, 1<<32-1)) // if err := os.WriteFile("/tmp/big.zip", bigZip, 0666); err != nil { // log.Fatal(err) // } //
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Wed Mar 27 18:23:49 GMT 2024 - 55.3K 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 Apr 28 19:28:10 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)