- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 104 for decrement (0.04 sec)
-
doc/go_spec.html
and the type of the value to be sent must be assignable to that element type. </p> <h3 id="IncDec_statements">IncDec statements</h3> <p> The "++" and "--" statements increment or decrement their operands by the untyped <a href="#Constants">constant</a> <code>1</code>. As with an assignment, the operand must be <a href="#Address_operators">addressable</a> or a map index expression. </p>
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue May 06 19:12:15 UTC 2025 - 286.2K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/FakeTicker.java
checkArgument(autoIncrementStep >= 0, "May not auto-increment by a negative amount"); this.autoIncrementStepNanos = timeUnit.toNanos(autoIncrementStep); return this; } /** * Sets the increment applied to the ticker whenever it is queried. * * <p>The default behavior is to auto increment by zero. i.e: The ticker is left unchanged when * queried. * * @since 28.0
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Apr 14 15:16:19 UTC 2025 - 3.4K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/FakeTicker.java
checkArgument(autoIncrementStep >= 0, "May not auto-increment by a negative amount"); this.autoIncrementStepNanos = timeUnit.toNanos(autoIncrementStep); return this; } /** * Sets the increment applied to the ticker whenever it is queried. * * <p>The default behavior is to auto increment by zero. i.e: The ticker is left unchanged when * queried. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Apr 14 15:16:19 UTC 2025 - 4.1K bytes - Viewed (0) -
src/main/java/jcifs/internal/smb2/multichannel/ChannelInfo.java
} /** * Increment requests sent counter */ public void incrementRequestsSent() { requestsSent.incrementAndGet(); } /** * Increment requests received counter */ public void incrementRequestsReceived() { requestsReceived.incrementAndGet(); } /** * Increment error counter */
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Thu Aug 21 11:13:46 UTC 2025 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleUtils.java
* >= 0.5 and signifFloor is odd (which is true if both the 0.5 bit and the 1 bit are set). */ boolean increment = (twiceSignifFloor & 1) != 0 && ((signifFloor & 1) != 0 || absX.getLowestSetBit() < shift); long signifRounded = increment ? signifFloor + 1 : signifFloor; long bits = (long) (exponent + EXPONENT_BIAS) << SIGNIFICAND_BITS; bits += signifRounded; /*
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 5.1K bytes - Viewed (0) -
guava/src/com/google/common/cache/LongAddable.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 885 bytes - Viewed (0) -
cmd/namespace-lock_test.go
}() runtime.Gosched() // unlock the manual lock nsLk.lockMapMutex.Unlock() // To trigger the race: // 1) lk3 or lk4 need to advance and increment the ref on the existing resource, // successfully acquiring the lock. // 2) lk2 then needs to advance and remove the resource from lockMap. // 3) lk3 or lk4 (whichever didn't execute in step 1) then executes and creates
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/LongAddable.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Jan 18 02:54:30 UTC 2025 - 816 bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AtomicLongMap.java
*/ @CanIgnoreReturnValue public long incrementAndGet(K key) { return addAndGet(key, 1); } /** * Decrements by one the value currently associated with {@code key}, and returns the new value. */ @CanIgnoreReturnValue public long decrementAndGet(K key) { return addAndGet(key, -1); } /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 11.7K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/idn/Punycode.kt
var bias = INITIAL_BIAS var h = b while (h < input.size) { val m = input.minBy { if (it >= n) it else Int.MAX_VALUE } val increment = (m - n) * (h + 1) if (delta > Int.MAX_VALUE - increment) return false // Prevent overflow. delta += increment n = m for (c in input) { if (c < n) { if (delta == Int.MAX_VALUE) return false // Prevent overflow.
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Dec 27 13:39:56 UTC 2024 - 8.5K bytes - Viewed (0)