- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 198 for Reback (0.58 sec)
-
src/archive/zip/zip_test.go
var errDiscardedBytes = errors.New("ReadAt of discarded bytes") func (ss *suffixSaver) ReadAt(p []byte, off int64) (n int, err error) { back := ss.size - off if back > int64(ss.keep) { return 0, errDiscardedBytes } suf := ss.Suffix() n = copy(p, suf[len(suf)-int(back):]) if n != len(p) { err = io.EOF } return } func (ss *suffixSaver) Suffix() []byte { if len(ss.buf) < ss.keep {
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) -
cmd/bucket-listobjects-handlers.go
return } listObjectVersions := objectAPI.ListObjectVersions // Initiate a list object versions operation based on the input params. // On success would return back ListObjectsInfo object to be // marshaled into S3 compatible XML header. listObjectVersionsInfo, err := listObjectVersions(ctx, bucket, prefix, marker, versionIDMarker, delimiter, maxkeys) if err != nil {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Feb 22 06:26:06 GMT 2024 - 11.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
RateLimiter limiter = RateLimiter.create(2.0, 4000, MILLISECONDS, 3.0, stopwatch); for (int i = 0; i < 8; i++) { limiter.acquire(); // // #1 } stopwatch.sleepMillis(4500); // #2: back to cold state (warmup period + repay last acquire) for (int i = 0; i < 3; i++) { // only three steps, we're somewhere in the warmup period limiter.acquire(); // #3 }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
internal/grid/muxclient.go
h := xxh3.Hash(dst) dst = binary.LittleEndian.AppendUint32(dst, uint32(h)) } return m.parent.send(m.ctx, dst) } // RequestStateless will send a single payload request and stream back results. // req may not be read/written to after calling. // TODO: Not implemented func (m *muxClient) RequestStateless(h HandlerID, req []byte, out chan<- Response) { if m.init {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Thu Apr 04 12:04:40 GMT 2024 - 14.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/FuturesGetChecked.java
} /** * Provides a check of whether an exception type is valid for use with {@link * FuturesGetChecked#getChecked(Future, Class)}, possibly using caching. * * <p>Uses reflection to gracefully fall back to when certain implementations aren't available. */ @VisibleForTesting static class GetCheckedTypeValidatorHolder { static final GetCheckedTypeValidator BEST_VALIDATOR = getBestValidator();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 10.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
RateLimiter limiter = RateLimiter.create(2.0, 4000, MILLISECONDS, 3.0, stopwatch); for (int i = 0; i < 8; i++) { limiter.acquire(); // // #1 } stopwatch.sleepMillis(4500); // #2: back to cold state (warmup period + repay last acquire) for (int i = 0; i < 3; i++) { // only three steps, we're somewhere in the warmup period limiter.acquire(); // #3 }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0) -
docs/en/docs/async.md
So, during that time, the computer can go and do some other work, while "slow-file" 📝 finishes. Then the computer / program 🤖 will come back every time it has a chance because it's waiting again, or whenever it 🤖 finished all the work it had at that point. And it 🤖 will see if any of the tasks it was waiting for have already finished, doing whatever it had to do.
Plain Text - Registered: Sun May 05 07:19:11 GMT 2024 - Last Modified: Thu Apr 18 19:53:19 GMT 2024 - 23K bytes - Viewed (0) -
analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/references/KDocReferenceResolver.kt
} } /** * Finds the parent symbol of the given KtSymbol by traversing back up the symbol hierarchy a certain number of steps, * or until the containing class or object symbol is found. * * @param symbol The KtSymbol whose parent symbol needs to be found. * @param goBackSteps The number of steps to go back up the symbol hierarchy. * @param selectedFqName The fully qualified name of the selected package.
Plain Text - Registered: Fri Apr 26 08:18:10 GMT 2024 - Last Modified: Fri Apr 19 11:06:47 GMT 2024 - 22.6K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
if tok.ScanToken == scanner.EOF { p.errorf("missing right parenthesis") return } rname := tok.String() p.back() haveConstant = !p.atStartOfRegister(rname) if !haveConstant { p.back() // Put back the '('. } } if haveConstant { p.back() if p.have(scanner.Float) { if prefix != '$' { p.errorf("floating-point constant must be an immediate") }
Go - Registered: Tue Apr 30 11:13:12 GMT 2024 - Last Modified: Wed Feb 21 14:34:57 GMT 2024 - 36.9K bytes - Viewed (0) -
tensorflow/c/eager/gradients.cc
forward_op_->inputs.push_back(input); return absl::OkStatus(); } Status AddInputList(AbstractOperation* op_, absl::Span<AbstractTensorHandle* const> inputs, ForwardOperation* forward_op_) { TF_RETURN_IF_ERROR(op_->AddInputList(inputs)); for (auto input : inputs) { forward_op_->inputs.push_back(input); } return absl::OkStatus(); }
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)