Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for longText (0.25 sec)

  1. 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 Apr 26 11:42:10 GMT 2024
    - Last Modified: Sat Apr 20 17:03:43 GMT 2024
    - 16.2K bytes
    - Viewed (0)
  2. 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 Apr 26 11:42:10 GMT 2024
    - Last Modified: Mon Jan 08 01:13:22 GMT 2024
    - 11.7K bytes
    - Viewed (0)
  3. 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 Apr 26 11:42:10 GMT 2024
    - Last Modified: Mon Jan 08 01:13:22 GMT 2024
    - 11.2K bytes
    - Viewed (0)
Back to top