- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 15 for longdesc (0.17 sec)
-
okhttp/src/main/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
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 11.2K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/connection/RealConnectionPool.kt
for (policy in addressStates.values) { policy.scheduleOpener() } } /** * Performs maintenance on this pool, evicting the connection that has been idle the longest if * 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.
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Sat Apr 20 17:03:43 GMT 2024 - 16.2K bytes - Viewed (0) -
cni/pkg/repair/netns.go
// We want the pause container, as the istio-validation one may exit before we are done. // We do this by detecting the longest running process. We could look at `cmdline`, but is likely more reliable to weird platforms. for _, p := range procs { ns := getPidNamespace(p.PID) fd, err := unix.Open(ns, unix.O_RDONLY, 0) if err != nil {
Go - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Wed Dec 20 22:14:13 GMT 2023 - 4.8K bytes - Viewed (0) -
okhttp/src/main/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 = publicSuffixListBytes.binarySearch(domainLabelsUtf8Bytes, i) if (rule != null) {
Plain Text - Registered: Fri May 03 11:42:14 GMT 2024 - Last Modified: Mon Jan 08 01:13:22 GMT 2024 - 11.7K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
/** * A bounded {@linkplain BlockingQueue blocking queue} backed by an array. This queue orders * elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
/** * A bounded {@linkplain BlockingQueue blocking queue} backed by an array. This queue orders * elements FIFO (first-in-first-out). The head of the queue is that element that has been * on the queue the longest time. The tail of the queue is that element that has been on * the queue the shortest time. New elements are inserted at the tail of the queue, and the queue * retrieval operations obtain elements at the head of the queue.
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
src/main/java/jcifs/smb/DfsImpl.java
log.trace("No match for domain based root, checking standalone " + domain); } /* * We did not match a domain based root. Now try to match the * longest path in the list of stand-alone referrals. */ CacheEntry<DfsReferralDataInternal> refs; synchronized ( this.referralsLock ) { refs = this.referrals;
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Thu Jan 05 13:07:29 GMT 2023 - 29.1K bytes - Viewed (0) -
common-protos/k8s.io/apimachinery/pkg/apis/meta/v1/generated.proto
// This is to help clients reach servers in the most network-efficient way possible. // Clients can use the appropriate server address as per the CIDR that they match. // In case of multiple matches, clients should use the longest matching CIDR. // The server returns only those CIDRs that it thinks that the client can match. // For example: the master will return an internal IP CIDR only, if the client reaches the server using an internal IP.
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 53.3K bytes - Viewed (0) -
analysis/analysis-api-fir/src/org/jetbrains/kotlin/analysis/api/fir/components/KtFirReferenceShortener.kt
return createElementToShorten(qualifierElement, qualifierClassId.asSingleFqName(), importAllInParent) } } return null } /** * Finds the longest qualifier in [wholeQualifierElement] which can be safely shortened in the [positionScopes]. * [wholeQualifierClassId] is supposed to reflect the class which is referenced by the [wholeQualifierElement]. *
Plain Text - Registered: Fri Apr 26 08:18:10 GMT 2024 - Last Modified: Thu Apr 25 18:51:33 GMT 2024 - 69.5K bytes - Viewed (0) -
android/guava/src/com/google/common/net/InetAddresses.java
} compressLongestRunOfZeroes(hextets); return hextetsToIPv6String(hextets); } /** * Identify and mark the longest run of zeroes in an IPv6 address. * * <p>Only runs of two or more hextets are considered. In case of a tie, the leftmost run wins. If * a qualifying run is found, its hextets are replaced by the sentinel value -1.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 44K bytes - Viewed (1)