- Sort Score
- Num 10 results
- Language All
Results 111 - 120 of 160 for dump (0.02 seconds)
-
CHANGELOG/CHANGELOG-1.10.md
### Other notable changes * [fluentd-gcp-scaler addon] Bump fluentd-gcp-scaler to 0.4 to pick up security fixes. ([#67691](https://github.com/kubernetes/kubernetes/pull/67691), [@loburm](https://github.com/loburm)) * [prometheus-to-sd addon] Bump prometheus-to-sd to 0.3.1 to pick up security fixes, bug fixes and new features. * [event-exporter addon] Bump event-exporter to 0.2.3 to pick up security fixes.Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Thu May 05 13:44:43 GMT 2022 - 341.8K bytes - Click Count (0) -
src/cmd/api/main_test.go
f := strings.Join(w.scope, ", ") + ", " + fmt.Sprintf(format, args...) if strings.Contains(f, "\n") { panic("feature contains newlines: " + f) } if _, dup := w.features[f]; dup { panic("duplicate feature inserted: " + f) } w.features[f] = true if verbose { log.Printf("feature: %s", f) } } func needApproval(filename string) bool {
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Feb 20 03:25:33 GMT 2025 - 31.4K bytes - Click Count (0) -
CHANGELOG/CHANGELOG-1.9.md
* [fluentd-gcp-scaler addon] Bump fluentd-gcp-scaler to 0.4 to pick up security fixes. ([#67691](https://github.com/kubernetes/kubernetes/pull/67691), [@loburm](https://github.com/loburm)) * [prometheus-to-sd addon] Bump prometheus-to-sd to 0.3.1 to pick up security fixes, bug fixes and new features. * [event-exporter addon] Bump event-exporter to 0.2.3 to pick up security fixes.Created: Fri Dec 26 09:05:12 GMT 2025 - Last Modified: Tue Nov 16 10:46:27 GMT 2021 - 313.7K bytes - Click Count (0) -
src/cmd/asm/internal/asm/parse.go
ctxt *obj.Link firstProg *obj.Prog lastProg *obj.Prog dataAddr map[string]int64 // Most recent address for DATA for this symbol. isJump bool // Instruction being assembled is a jump. allowABI bool // Whether ABI selectors are allowed. pkgPrefix string // Prefix to add to local symbols. errorWriter io.Writer } type Patch struct { addr *obj.Addr
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Wed Nov 12 03:59:40 GMT 2025 - 37.3K bytes - Click Count (0) -
guava-tests/test/com/google/common/hash/BloomFilterTest.java
// False negative should *never* happen. assertThat(bloomFilter.mightContain(key)).isTrue(); // If this check ever fails, that means we need to either bump the // number of expected insertions or don't run the test for so long. // Don't forget, the bloom filter slowly saturates over time and the // expected false positive probability goes up!Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 28 18:19:59 GMT 2025 - 22.1K bytes - Click Count (0) -
CONTRIBUTING.md
 ### Contributor License Agreements We'd love to accept your patches! Before we can take them, we have to jump a couple of legal hurdles. Please fill out either the individual or corporate Contributor License Agreement (CLA).
Created: Tue Dec 30 12:39:10 GMT 2025 - Last Modified: Sat Jan 11 04:47:59 GMT 2025 - 15.9K bytes - Click Count (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFutureState.java
if (remainingNanos < SPIN_THRESHOLD_NANOS) { // Remove the waiter, one way or another we are done parking this thread. removeWaiter(node); break long_wait_loop; // jump down to the busy wait loop } } } oldHead = waitersField; // re-read and loop. } while (oldHead != Waiter.TOMBSTONE); }
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 33.2K bytes - Click Count (0) -
doc/asm.html
that follow form the body of the function. The last instruction in a <code>TEXT</code> block must be some sort of jump, usually a <code>RET</code> (pseudo-)instruction. (If it's not, the linker will append a jump-to-itself instruction; there is no fallthrough in <code>TEXTs</code>.) After the symbol, the arguments are flags (see below) and the frame size, a constant (but see below): </p>
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Fri Nov 14 19:09:46 GMT 2025 - 36.5K bytes - Click Count (0) -
android/guava/src/com/google/common/hash/Hashing.java
checkArgument(buckets > 0, "buckets must be positive: %s", buckets); LinearCongruentialGenerator generator = new LinearCongruentialGenerator(input); int candidate = 0; int next; // Jump from bucket to bucket until we go out of range while (true) { next = (int) ((candidate + 1) / generator.nextDouble()); if (next >= 0 && next < buckets) { candidate = next; } else {
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Jul 17 15:26:41 GMT 2025 - 29.8K bytes - Click Count (0) -
guava/src/com/google/common/util/concurrent/AbstractFutureState.java
if (remainingNanos < SPIN_THRESHOLD_NANOS) { // Remove the waiter, one way or another we are done parking this thread. removeWaiter(node); break long_wait_loop; // jump down to the busy wait loop } } } oldHead = waitersField; // re-read and loop. } while (oldHead != Waiter.TOMBSTONE); }
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Aug 07 16:05:33 GMT 2025 - 34.8K bytes - Click Count (0)