- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 19 for longOpt (0.06 seconds)
-
compat/maven-embedder/src/main/java/org/apache/maven/cli/CLIManager.java
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Wed Aug 06 04:56:48 GMT 2025 - 17.8K bytes - Click Count (0) -
impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/mvn/CommonsCliMavenOptions.java
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Thu Sep 25 17:39:57 GMT 2025 - 14.8K bytes - Click Count (0) -
impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/mvnup/CommonsCliUpgradeOptions.java
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Mon Sep 29 14:48:39 GMT 2025 - 7K bytes - Click Count (0) -
impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/CommonsCliOptions.java
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Wed Oct 08 07:36:42 GMT 2025 - 21.3K bytes - Click Count (0) -
impl/maven-cli/src/main/java/org/apache/maven/cling/invoker/mvnenc/CommonsCliEncryptOptions.java
Created: Sun Dec 28 03:35:09 GMT 2025 - Last Modified: Thu Sep 25 17:39:57 GMT 2025 - 4K bytes - Click Count (0) -
fess-crawler/src/main/java/org/codelibs/fess/crawler/entity/RobotsTxt.java
* </ul> * * <p>The class uses case-insensitive pattern matching for user agents and supports * wildcard characters (*) in user agent strings. When multiple directives match a user agent, * the most specific (longest) match is used.</p> * */ public class RobotsTxt { private static final String ALL_BOTS = "*"; /** Map of user agent patterns to their corresponding directives. */
Created: Sat Dec 20 11:21:39 GMT 2025 - Last Modified: Mon Nov 24 03:59:47 GMT 2025 - 18.5K bytes - Click Count (0) -
src/main/java/org/codelibs/fess/util/IpAddressUtil.java
normalized[i] = parts[i].replaceFirst("^0+(?!$)", ""); if (normalized[i].isEmpty()) { normalized[i] = "0"; } } // Find longest sequence of consecutive zeros int longestStart = -1; int longestLength = 0; int currentStart = -1; int currentLength = 0; for (int i = 0; i < 8; i++) {
Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Thu Nov 06 08:31:03 GMT 2025 - 9.4K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/-HostnamesCommon.kt
return b == addressOffset + 4 } /** Encodes an IPv6 address in canonical form according to RFC 5952. */ internal fun inet6AddressToAscii(address: ByteArray): String { // Go through the address looking for the longest run of 0s. Each group is 2-bytes. // A run must be longer than one group (section 4.2.2). // If there are multiple equal runs, the first one must be used (section 4.2.3). var longestRunOffset = -1
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Wed Mar 19 19:25:20 GMT 2025 - 11.2K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/RealConnectionPool.kt
* either it has exceeded the keep alive limit or the idle connections limit. * * Returns the duration in nanoseconds to sleep until the next scheduled call to this method. * Returns -1 if no further cleanups are required. */ fun closeConnections(now: Long): Long { // Find the longest-idle connections in 2 categories: //
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Wed Oct 08 03:50:05 GMT 2025 - 11.1K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/publicsuffix/PublicSuffixDatabase.kt
// 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) if (rule != null) {Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Mon Jul 28 07:33:49 GMT 2025 - 8.5K bytes - Click Count (0)