- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 487 for Int64 (0.15 sec)
-
tensorflow/c/eager/tape.h
// Map from tensor ID to how many references still exist for this tensor in // the tape. std::unordered_map<int64_t, int64_t> tensor_usage_counts; // Maps from op ID to how many output tensors of this op still need to have // their gradients computed. std::unordered_map<int64_t, int64_t> op_missing_tensor; }; // If `persistent_tape` is true, op_tape is not changed and none of the
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) -
cmd/bucket-stats_gen_test.go
bts, _ = v.MarshalMsg(bts[0:0]) b.SetBytes(int64(len(bts))) b.ReportAllocs() b.ResetTimer() for i := 0; i < b.N; i++ { bts, _ = v.MarshalMsg(bts[0:0]) } } func BenchmarkUnmarshalBucketReplicationStat(b *testing.B) { v := BucketReplicationStat{} bts, _ := v.MarshalMsg(nil) b.ReportAllocs() b.SetBytes(int64(len(bts))) b.ResetTimer() for i := 0; i < b.N; i++ {
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Wed Aug 30 08:00:59 GMT 2023 - 20.5K bytes - Viewed (0) -
cmd/erasure-encode_test.go
{dataBlocks: 4, onDisks: 8, offDisks: 2, blocksize: int64(blockSizeV2), data: oneMiByte, offset: 2, algorithm: DefaultBitrotAlgorithm, shouldFail: false, shouldFailQuorum: false}, // 2
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Tue Jan 30 20:43:25 GMT 2024 - 11.9K bytes - Viewed (0) -
cmd/erasure-server-pool-rebalance_gen_test.go
bts := make([]byte, 0, v.Msgsize()) bts, _ = v.MarshalMsg(bts[0:0]) b.SetBytes(int64(len(bts))) b.ReportAllocs() b.ResetTimer() for i := 0; i < b.N; i++ { bts, _ = v.MarshalMsg(bts[0:0]) } } func BenchmarkUnmarshalrebalanceInfo(b *testing.B) { v := rebalanceInfo{} bts, _ := v.MarshalMsg(nil) b.ReportAllocs() b.SetBytes(int64(len(bts))) b.ResetTimer() for i := 0; i < b.N; i++ {
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Tue Oct 25 19:36:57 GMT 2022 - 11K bytes - Viewed (0) -
cmd/bitrot-streaming.go
type streamingBitrotReader struct { disk StorageAPI data []byte rc io.Reader volume string filePath string tillOffset int64 currOffset int64 h hash.Hash shardSize int64 hashBytes []byte } func (b *streamingBitrotReader) Close() error { if b.rc == nil { return nil } if closer, ok := b.rc.(io.Closer); ok {
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Wed Jan 31 02:11:45 GMT 2024 - 5.8K bytes - Viewed (0) -
src/bytes/reader.go
} r.i = int64(r.prevRune) r.prevRune = -1 return nil } // Seek implements the [io.Seeker] interface. func (r *Reader) Seek(offset int64, whence int) (int64, error) { r.prevRune = -1 var abs int64 switch whence { case io.SeekStart: abs = offset case io.SeekCurrent: abs = r.i + offset case io.SeekEnd: abs = int64(len(r.s)) + offset default:
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Fri Oct 13 17:10:31 GMT 2023 - 3.9K bytes - Viewed (0) -
misc/cgo/gmp/pi.go
denom = big.NewInt(1) ten = big.NewInt(10) ) func extractDigit() int64 { if big.CmpInt(numer, accum) > 0 { return -1 } tmp1.Lsh(numer, 1).Add(tmp1, numer).Add(tmp1, accum) big.DivModInt(tmp1, tmp2, tmp1, denom) tmp2.Add(tmp2, numer) if big.CmpInt(tmp2, denom) >= 0 { return -1 } return tmp1.Int64() } func nextTerm(k int64) { y2 := k*2 + 1 accum.Add(accum, tmp1.Lsh(numer, 1))
Go - Registered: Tue Apr 23 11:13:09 GMT 2024 - Last Modified: Mon Apr 10 22:32:35 GMT 2023 - 1.3K bytes - Viewed (0) -
schema/field.go
case int32: field.ReflectValueOf(ctx, value).SetInt(int64(data)) case uint: field.ReflectValueOf(ctx, value).SetInt(int64(data)) case uint8: field.ReflectValueOf(ctx, value).SetInt(int64(data)) case uint16: field.ReflectValueOf(ctx, value).SetInt(int64(data)) case uint32: field.ReflectValueOf(ctx, value).SetInt(int64(data)) case uint64:
Go - Registered: Sun Apr 21 09:35:09 GMT 2024 - Last Modified: Mon Apr 15 03:20:20 GMT 2024 - 32K bytes - Viewed (1) -
cmd/site-replication-metrics_gen_test.go
bts := make([]byte, 0, v.Msgsize()) bts, _ = v.MarshalMsg(bts[0:0]) b.SetBytes(int64(len(bts))) b.ReportAllocs() b.ResetTimer() for i := 0; i < b.N; i++ { bts, _ = v.MarshalMsg(bts[0:0]) } } func BenchmarkUnmarshalRStat(b *testing.B) { v := RStat{} bts, _ := v.MarshalMsg(nil) b.ReportAllocs() b.SetBytes(int64(len(bts))) b.ResetTimer() for i := 0; i < b.N; i++ { _, err := v.UnmarshalMsg(bts)
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Wed Aug 30 08:00:59 GMT 2023 - 12.9K bytes - Viewed (0) -
cmd/erasure-heal_test.go
badDisks, badStaleDisks int blocksize, size int64 algorithm BitrotAlgorithm shouldFail bool }{ {dataBlocks: 2, disks: 4, offDisks: 1, badDisks: 0, badStaleDisks: 0, blocksize: int64(blockSizeV2), size: oneMiByte, algorithm: SHA256, shouldFail: false}, // 0
Go - Registered: Sun Apr 21 19:28:08 GMT 2024 - Last Modified: Tue Jan 30 20:43:25 GMT 2024 - 7.9K bytes - Viewed (0)