- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 992 for lena (0.18 sec)
-
internal/grid/connection.go
continue } case toSend = <-c.outQueue: if len(toSend) == 0 { continue } } if len(queue) < maxMergeMessages && queueSize+len(toSend) < writeBufferSize-1024 && len(c.outQueue) > 0 { queue = append(queue, toSend) queueSize += len(toSend) continue } c.connChange.L.Lock() for { state := c.State()
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 42.6K bytes - Viewed (0) -
tensorflow/c/c_api.cc
size_t proto_len, TF_Status* status) { // shape.ParseFromArray takes an int as length, this function takes size_t, // make sure there is no information loss. if (proto_len > std::numeric_limits<int>::max()) { status->status = InvalidArgument( "proto_len (", proto_len, " bytes) is too large to be parsed by the protocol buffer library"); return;
C++ - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Mon Apr 15 03:35:10 GMT 2024 - 102.3K bytes - Viewed (0) -
cmd/bucket-replication-utils_gen_test.go
t.Fatal(err) } left, err := v.UnmarshalMsg(bts) if err != nil { t.Fatal(err) } if len(left) > 0 { t.Errorf("%d bytes left over after UnmarshalMsg(): %q", len(left), left) } left, err = msgp.Skip(bts) if err != nil { t.Fatal(err) } if len(left) > 0 { t.Errorf("%d bytes left over after Skip(): %q", len(left), left) } } func BenchmarkMarshalMsgBucketReplicationResyncStatus(b *testing.B) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Aug 22 23:53:06 GMT 2022 - 23K bytes - Viewed (0) -
src/bytes/bytes.go
func Join(s [][]byte, sep []byte) []byte { if len(s) == 0 { return []byte{} } if len(s) == 1 { // Just return a copy. return append([]byte(nil), s[0]...) } var n int if len(sep) > 0 { if len(sep) >= maxInt/(len(s)-1) { panic("bytes: Join output length overflow") } n += len(sep) * (len(s) - 1) } for _, v := range s { if len(v) > maxInt-n {
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Mon Feb 19 19:51:15 GMT 2024 - 33.8K bytes - Viewed (0) -
cmd/batch-rotate_gen_test.go
t.Fatal(err) } left, err := v.UnmarshalMsg(bts) if err != nil { t.Fatal(err) } if len(left) > 0 { t.Errorf("%d bytes left over after UnmarshalMsg(): %q", len(left), left) } left, err = msgp.Skip(bts) if err != nil { t.Fatal(err) } if len(left) > 0 { t.Errorf("%d bytes left over after Skip(): %q", len(left), left) } } func BenchmarkMarshalMsgBatchJobKeyRotateEncryption(b *testing.B) {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Tue Aug 29 18:27:23 GMT 2023 - 11.8K bytes - Viewed (0) -
docs/pt/docs/async.md
Isso é chamado de "assíncrono" porquê o computador / programa não tem que ser "sincronizado" com a tarefa lenta, esperando pelo exato momento que a tarefa finalize, enquanto não faz nada, para ser capaz de pegar o resultado da tarefa e dar continuidade ao trabalho.
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 22.2K bytes - Viewed (0) -
src/main/java/jcifs/util/Strings.java
*/ public static int findUNITermination ( byte[] buffer, int bufferIndex, int maxLen ) { int len = 0; while ( buffer[ bufferIndex + len ] != (byte) 0x00 || buffer[ bufferIndex + len + 1 ] != (byte) 0x00 ) { len += 2; if ( len > maxLen ) { if ( log.isDebugEnabled() ) { log.warn("Failed to find string termination with max length " + maxLen);
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Mon Mar 13 12:00:57 GMT 2023 - 4.9K bytes - Viewed (0) -
cmd/xl-storage-meta-inline.go
func (x *xlMetaInlineData) serialize(plSize int, keys [][]byte, vals [][]byte) { if len(keys) != len(vals) { panic(fmt.Errorf("xlMetaInlineData.serialize: keys/value number mismatch")) } if len(keys) == 0 { *x = nil return } if plSize <= 0 { plSize = 1 + msgp.MapHeaderSize for i := range keys { plSize += len(keys[i]) + len(vals[i]) + msgp.StringPrefixSize + msgp.ArrayHeaderSize } }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 9.5K 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) -
android/guava-tests/benchmark/com/google/common/base/StringsRepeatBenchmark.java
} } } private static String mikeRepeat(String string, int count) { final int len = string.length(); char[] strCopy = new char[len * Integer.highestOneBit(count)]; string.getChars(0, len, strCopy, 0); char[] array = new char[len * count]; int strCopyLen = len; int pos = 0; while (count != 0) { if ((count & 1) != 0) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Sep 17 20:24:24 GMT 2021 - 3.3K bytes - Viewed (0)