Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 91 for earlier (0.45 sec)

  1. okhttp/src/androidMain/kotlin/okhttp3/internal/platform/android/Android10SocketAdapter.kt

    import okhttp3.internal.platform.Platform
    import okhttp3.internal.platform.Platform.Companion.isAndroid
    
    /**
     * Simple non-reflection SocketAdapter for Android Q+.
     *
     * These API assumptions make it unsuitable for use on earlier Android versions.
     */
    @SuppressLint("NewApi")
    @SuppressSignatureCheck
    class Android10SocketAdapter : SocketAdapter {
      override fun matchesSocket(sslSocket: SSLSocket): Boolean = SSLSockets.isSupportedSocket(sslSocket)
    
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed Mar 19 19:25:20 UTC 2025
    - 2.8K bytes
    - Viewed (0)
  2. compat/maven-compat/src/main/java/org/apache/maven/toolchain/java/JavaToolchainFactory.java

            if (model == null) {
                return null;
            }
    
            // use DefaultJavaToolChain for compatibility with maven 3.2.3 and earlier
    
            @SuppressWarnings("deprecation")
            JavaToolchainImpl jtc = new DefaultJavaToolChain(model, logger);
    
            // populate the provides section
            Properties provides = model.getProvides();
    Registered: Sun Sep 07 03:35:12 UTC 2025
    - Last Modified: Fri Jun 06 14:28:57 UTC 2025
    - 4.1K bytes
    - Viewed (0)
  3. okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/concurrent/TaskQueue.kt

        recurrence: Boolean,
      ): Boolean {
        task.initQueue(this)
    
        val now = taskRunner.backend.nanoTime()
        val executeNanoTime = now + delayNanos
    
        // If the task is already scheduled, take the earlier of the two times.
        val existingIndex = futureTasks.indexOf(task)
        if (existingIndex != -1) {
          if (task.nextExecuteNanoTime <= executeNanoTime) {
            taskRunner.logger.taskLog(task, this) { "already scheduled" }
    Registered: Fri Sep 05 11:42:10 UTC 2025
    - Last Modified: Wed May 28 23:28:25 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  4. guava/src/com/google/common/collect/RegularImmutableMap.java

        int mask = tableSize - 1;
        // If duplicates are allowed, this IdentityHashMap will record the final Entry for each
        // duplicated key. We will use this final Entry to overwrite earlier slots in the entries array
        // that have the same key. Then a second pass will remove all but the first of the slots that
        // have this Entry. The value in the map becomes false when this first entry has been copied, so
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sat Aug 09 01:14:59 UTC 2025
    - 15.8K bytes
    - Viewed (0)
  5. android/guava/src/com/google/common/collect/ImmutableSortedSet.java

       * IllegalArgumentException} if passed a {@code fromElement} smaller than an earlier {@code
       * fromElement}. However, this method doesn't throw an exception in that situation, but instead
       * keeps the original {@code fromElement}. Similarly, this method keeps the original {@code
       * toElement}, instead of throwing an exception, if passed a {@code toElement} greater than an
       * earlier {@code toElement}.
       */
      @Override
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 36.8K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/graph/EndpointPair.java

            // Why? The second half of condition2 requires that nodeV equals other.nodeU.
            // We already know that nodeU equals other.nodeU. Combined with the earlier statement,
            // and the transitive property of equality, this implies that nodeU equals nodeV.
            // If nodeU equals nodeV, condition1 == condition2, so checking condition1 is sufficient.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 8.1K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java

        if (seenExceptionsLocal == null) {
          // TODO(cpovirk): Should we use a simpler (presumably cheaper) data structure?
          /*
           * Using weak references here could let us release exceptions earlier, but:
           *
           * 1. On Android, querying a WeakReference blocks if the GC is doing an otherwise-concurrent
           * pass.
           *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 8.5K bytes
    - Viewed (0)
  8. guava/src/com/google/common/graph/EndpointPair.java

            // Why? The second half of condition2 requires that nodeV equals other.nodeU.
            // We already know that nodeU equals other.nodeU. Combined with the earlier statement,
            // and the transitive property of equality, this implies that nodeU equals nodeV.
            // If nodeU equals nodeV, condition1 == condition2, so checking condition1 is sufficient.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 8.1K bytes
    - Viewed (0)
  9. src/main/java/org/codelibs/fess/helper/IntervalControlHelper.java

             *
             * @param h1 the first hour
             * @param m1 the first minute
             * @param h2 the second hour
             * @param m2 the second minute
             * @return positive if first time is earlier, 0 if equal, negative if later
             */
            protected int compareTime(final int h1, final int m1, final int h2, final int m2) {
                if (h1 < h2) {
                    return 1;
                }
    Registered: Thu Sep 04 12:52:25 UTC 2025
    - Last Modified: Thu Jul 17 08:28:31 UTC 2025
    - 9.9K bytes
    - Viewed (0)
  10. guava/src/com/google/common/hash/Murmur3_32HashFunction.java

                return hashBytes(input.toString().getBytes(charset));
              }
              i++;
              buffer |= codePointToFourUtf8Bytes(codePoint) << shift;
              if (supplementaryPlaneFix) { // bug compatibility: earlier versions did not have this add
                shift += 32;
              }
              len += 4;
            }
    
            if (shift >= 32) {
              int k1 = mixK1((int) buffer);
              h1 = mixH1(h1, k1);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Apr 14 16:36:11 UTC 2025
    - 11.8K bytes
    - Viewed (0)
Back to top