- Sort Score
- Result 10 results
- Languages All
Results 241 - 250 of 480 for Like (0.16 sec)
-
guava/src/com/google/common/collect/ComparisonChain.java
* <h4 id="java8">Java 8+ equivalents</h4> * * If you are using Java version 8 or greater, you should generally use the static methods in {@link * Comparator} instead of {@code ComparisonChain}. The example above can be implemented like this: * * {@snippet : * import static java.util.Comparator.comparing; * import static java.util.Comparator.nullsLast; * import static java.util.Comparator.naturalOrder; * * ...
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Mar 17 20:26:29 UTC 2025 - 11.1K bytes - Viewed (0) -
src/main/java/jcifs/netbios/NameServiceClientImpl.java
throw new RuntimeCIFSException(ignored); } } } /* * If a local hostname was not provided a name like * JCIFS34_172_A6 will be dynamically generated for the * client. This is primarily (exclusively?) used as a * CallingName during session establishment. */
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 30 05:58:03 UTC 2025 - 38.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFutureState.java
// * We are more responsive to completion than timeouts. This is because parkNanos depends on // system scheduling and as such we could either miss our deadline, or unpark() could be delayed // so that it looks like we timed out even though we didn't. For comparison FutureTask respects // completion preferably and AQS is non-deterministic (depends on where in the queue the waiter
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 33.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/MathTesting.java
// Add boundary values manually to avoid over/under flow (this covers 2^N for 0 and 31). intValues.add(Integer.MAX_VALUE - 1, Integer.MAX_VALUE); // Add values up to 40. This covers cases like "square of a prime" and such. for (int i = 1; i <= 40; i++) { intValues.add(i); } // Now add values near 2^N for lots of values of N. for (int exponent : asList(2, 3, 4, 9, 15, 16, 17, 24, 25, 30)) {
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sun Aug 10 19:54:19 UTC 2025 - 11.3K bytes - Viewed (0) -
fess-crawler/src/main/java/org/codelibs/fess/crawler/extractor/impl/AbstractXmlExtractor.java
import org.codelibs.fess.crawler.exception.ExtractException; /** * Abstract base class for XML extractors. * Provides common functionality for extracting text content from XML-like documents. * It handles encoding detection, HTML entity unescaping, and tag-based content extraction. * */ public abstract class AbstractXmlExtractor extends AbstractExtractor { /**Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Sun Nov 23 12:19:14 UTC 2025 - 8.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/AbstractStreamingHasher.java
* copying the CharSequence to a String and then calling getBytes(Charset) on that String, in * reality there are optimizations that make the getBytes(Charset) approach considerably faster, * at least for commonly used charsets like UTF-8. */ @Override @CanIgnoreReturnValue public final Hasher putByte(byte b) { buffer.put(b); munchIfFull(); return this; } @Override @CanIgnoreReturnValue
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sat Dec 21 03:10:51 UTC 2024 - 7.1K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt
val domainLabelsUtf8Bytes = Array(domainLabels.size) { i -> domainLabels[i].encodeUtf8() } // Start by looking for exact matches. We start at the leftmost label. For example, foo.bar.com // will look like: [foo, bar, com], [bar, com], [com]. The longest matching rule wins. var exactMatch: String? = null for (i in domainLabelsUtf8Bytes.indices) { val rule = publicSuffixList.bytes.binarySearch(domainLabelsUtf8Bytes, i)
Registered: Fri Dec 26 11:42:13 UTC 2025 - Last Modified: Mon Jul 28 07:33:49 UTC 2025 - 8.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ExecutionList.java
// contract. // This is somewhat annoying, but turns out to be very fast in practice. Alternatively, we could // drop the contract on the method that enforces this queue like behavior since depending on it // is likely to be a bug anyway. // N.B. All writes to the list and the next pointers must have happened before the aboveRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 6.9K bytes - Viewed (0) -
src/test/java/jcifs/smb/SecurityBlobTest.java
Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Thu Aug 14 05:31:44 UTC 2025 - 9.4K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractFutureState.java
// * We are more responsive to completion than timeouts. This is because parkNanos depends on // system scheduling and as such we could either miss our deadline, or unpark() could be delayed // so that it looks like we timed out even though we didn't. For comparison FutureTask respects // completion preferably and AQS is non-deterministic (depends on where in the queue the waiter
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 34.8K bytes - Viewed (0)