- Sort Score
- Result 10 results
- Languages All
Results 1 - 5 of 5 for undesireable (0.08 sec)
-
src/main/java/jcifs/smb1/smb1/SmbFile.java
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 112.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionSequencer.java
* hashmaps. Using a static ThreadLocal to avoid that overhead would mean that different * ExecutionSequencer objects interfere with each other, which would be undesirable, in addition * to increasing the memory footprint of every thread that interacted with it. In order to release * entries in thread-specific maps when the ThreadLocal object itself is no longer referenced,
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Jul 23 15:26:56 UTC 2025 - 22.1K bytes - Viewed (0) -
src/main/java/jcifs/smb/SmbFile.java
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 103.2K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.18.md
### Serverside Apply - Beta 2
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Wed Jun 16 17:18:28 UTC 2021 - 373.2K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
an "Almost Montgomery // Multiplication" by subtracting only in the overflow case, but the // cost is very similar since the constant time subtraction tells us if // x >= m as a side effect, and taking care of the broken invariant is // highly undesirable (see https://go.dev/issue/13907). copy(x.reset(n).limbs, T[n:]) x.maybeSubtractModulus(choice(c), m) // The following specialized cases follow the exact same algorithm, but // optimized for the sizes most used in RSA. addMulVVW is implemented in...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0)