- Sort Score
- Result 10 results
- Languages All
Results 181 - 190 of 814 for nexts (0.06 sec)
-
build-logic/documentation/src/main/groovy/gradlebuild/docs/BuildableDOMCategory.groovy
cl.delegate = builder cl.call() def parent = sibling.parentNode def next = sibling.nextSibling builder.elements.each { element -> parent.insertBefore(element, next) } return builder.elements.size() == 1 ? builder.elements[0] : builder.elements }
Registered: Wed Nov 06 11:36:14 UTC 2024 - Last Modified: Thu Aug 11 15:32:19 UTC 2022 - 2.8K bytes - Viewed (0) -
internal/grid/stream.go
} // Results returns the results from the remote server one by one. // If any error is returned by the callback, the stream will be canceled. // If the context is canceled, the stream will be canceled. func (s *Stream) Results(next func(b []byte) error) (err error) { done := false defer func() { if s.cancel != nil { s.cancel(err) } if !done { // Drain channel. for range s.responses { } } }()
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri Jun 07 15:51:52 UTC 2024 - 3.1K bytes - Viewed (0) -
internal/config/batch/batch.go
// would wait before working on next object. func (opts Config) ExpirationWait() time.Duration { configMu.RLock() defer configMu.RUnlock() return opts.ExpirationWorkersWait } // ReplicationWait returns the duration for which a batch replication worker // would wait before working on next object. func (opts Config) ReplicationWait() time.Duration { configMu.RLock()
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 4.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
Entry<? extends E> entry1 = iterator1.next(); E element = entry1.getElement(); int count = max(entry1.getCount(), multiset2.count(element)); return immutableEntry(element, count); } while (iterator2.hasNext()) { Entry<? extends E> entry2 = iterator2.next(); E element = entry2.getElement();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 41.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Streams.java
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 31 14:20:11 UTC 2024 - 37.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multisets.java
Entry<? extends E> entry1 = iterator1.next(); E element = entry1.getElement(); int count = max(entry1.getCount(), multiset2.count(element)); return immutableEntry(element, count); } while (iterator2.hasNext()) { Entry<? extends E> entry2 = iterator2.next(); E element = entry2.getElement();
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 41.5K bytes - Viewed (0) -
docs/en/docs/deployment/server-workers.md
/// info If you are using containers, for example with Docker or Kubernetes, I'll tell you more about that in the next chapter: [FastAPI in Containers - Docker](docker.md){.internal-link target=_blank}.
Registered: Sun Nov 03 07:19:11 UTC 2024 - Last Modified: Wed Sep 18 16:09:57 UTC 2024 - 8.7K bytes - Viewed (0) -
cmd/url_test.go
// the actual benchmark for PutObject starts here. Reset the benchmark timer. b.ResetTimer() if err := req.ParseForm(); err != nil { b.Fatal(err) } b.RunParallel(func(pb *testing.PB) { for pb.Next() { req.Form.Get("uploadId") } }) // Benchmark ends here. Stop timer. b.StopTimer() } // BenchmarkURLQuery - benchmark URL memory allocations func BenchmarkURLQuery(b *testing.B) {
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue Nov 16 17:28:29 UTC 2021 - 2K bytes - Viewed (0) -
internal/s3select/simdj/reader.go
} continue } i := in.Value.Iter() readloop: for { var next simdjson.Iter typ, err := i.AdvanceIter(&next) if err != nil { r.err = &err return } switch typ { case simdjson.TypeNone: break readloop case simdjson.TypeRoot: typ, obj, err := next.Root(nil) if err != nil { r.err = &err return }
Registered: Sun Nov 03 19:28:11 UTC 2024 - Last Modified: Tue May 30 17:02:22 UTC 2023 - 4.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedInts.java
*/ public static int min(int... array) { checkArgument(array.length > 0); int min = flip(array[0]); for (int i = 1; i < array.length; i++) { int next = flip(array[i]); if (next < min) { min = next; } } return flip(min); } /** * Returns the greatest value present in {@code array}, treating values as unsigned. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 21:17:54 UTC 2024 - 13.7K bytes - Viewed (0)