- Sort Score
- Result 10 results
- Languages All
Results 221 - 230 of 258 for BIT (0.01 sec)
-
guava/src/com/google/common/math/BigIntegerMath.java
* * <p>For the case of {@link RoundingMode#HALF_EVEN}, this implementation uses the IEEE 754 * default rounding mode: if the two nearest representable values are equally near, the one with * the least significant bit zero is chosen. (In such cases, both of the nearest representable * values are even integers; this method returns the one that is a multiple of a greater power of * two.) *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 18.8K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFutureState.java
// Timed Get // There are a few design constraints to consider // * We want to be responsive to small timeouts, unpark() has non trivial latency overheads (I // have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the // timeout is small we shouldn't park(). This needs to be traded off with the cpu overhead of
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 33.2K bytes - Viewed (0) -
src/main/java/jcifs/netbios/NameServiceClientImpl.java
} NbtAddress doNameQuery(final Name name, InetAddress svr) throws UnknownHostException { NbtAddress addr; if (name.hexCode == 0x1d && svr == null) { svr = this.baddr; // bit of a hack but saves a lookup } name.srcHashCode = svr != null ? svr.hashCode() : 0; addr = getCachedAddress(name); /* * This is almost exactly like InetAddress.java. See the
Registered: Sun Sep 07 00:10:21 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 38.5K bytes - Viewed (0) -
docs/en/docs/contributing.md
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sat Jul 26 11:35:42 UTC 2025 - 14.9K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractFutureState.java
// Timed Get // There are a few design constraints to consider // * We want to be responsive to small timeouts, unpark() has non trivial latency overheads (I // have observed 12 micros on 64-bit linux systems to wake up a parked thread). So if the // timeout is small we shouldn't park(). This needs to be traded off with the cpu overhead of
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 34.8K bytes - Viewed (0) -
docs/en/docs/python-types.md
**FastAPI** is all based on these type hints, they give it many advantages and benefits. But even if you never use **FastAPI**, you would benefit from learning a bit about them. /// note If you are a Python expert, and you already know everything about type hints, skip to the next chapter. /// ## Motivation { #motivation } Let's start with a simple example:
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Sun Aug 31 09:15:41 UTC 2025 - 17.1K bytes - Viewed (0) -
cmd/admin-router.go
if err != nil { // Static params, so this is very unlikely. logger.Fatal(err, "Unable to initialize server") } return gz }() // Set of handler options as bit flags type hFlag uint8 const ( // this flag disables gzip compression of responses noGZFlag = 1 << iota // this flag enables tracing body and headers instead of just headers traceAllFlag
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Wed Apr 16 07:34:24 UTC 2025 - 26.7K bytes - Viewed (0) -
android/guava/src/com/google/common/base/CharMatcher.java
* negation is cheaper to precompute than the matcher itself; it tries to build small hash tables * for matchers that only match a few characters, and so on. In the worst-case scenario, it * constructs an eight-kilobyte bit array and queries that. In many situations this produces a * matcher which is faster to query than the original. */ @GwtIncompatible // SmallCharMatcher CharMatcher precomputedInternal() {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 53.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Streams.java
* nulls in the stream. This means that the method can safely be used with a stream that contains * nulls as long as the *last* element is *not* null. * * (To "go out of its way," the method tracks a `set` bit so that it can distinguish "the final * split has a last element of null, so throw NPE" from "the final split was empty, so look for an * element in the prior one.") */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 37K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
accum /= i + 1; } return accum; } @GwtIncompatible // java.math.BigInteger public void testIsPowerOfTwo() { for (long x : ALL_LONG_CANDIDATES) { // Checks for a single bit set. BigInteger bigX = BigInteger.valueOf(x); boolean expected = (bigX.signum() > 0) && (bigX.bitCount() == 1); assertEquals(expected, LongMath.isPowerOfTwo(x)); } }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 31.4K bytes - Viewed (0)