Search Options

Results per page
Sort
Preferred Languages
Advance

Results 421 - 430 of 798 for NEXT (0.09 sec)

  1. mockwebserver/src/main/kotlin/mockwebserver3/MockWebServer.kt

          val openClientSocket = openClientSockets.iterator()
          while (openClientSocket.hasNext()) {
            openClientSocket.next().closeQuietly()
            openClientSocket.remove()
          }
    
          val httpConnection = openConnections.iterator()
          while (httpConnection.hasNext()) {
            httpConnection.next().closeQuietly()
            httpConnection.remove()
          }
          dispatcher.shutdown()
        }
      }
    
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Sun Mar 31 17:16:15 UTC 2024
    - 37.4K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/primitives/ImmutableIntArray.java

        }
        return builder().addAll(values).build();
      }
    
      /**
       * Returns an immutable array containing all the values from {@code stream}, in order.
       *
       * @since NEXT (but since 22.0 in the JRE flavor)
       */
      @SuppressWarnings("Java7ApiChecker")
      @IgnoreJRERequirement // Users will use this only if they're already using streams.
      public static ImmutableIntArray copyOf(IntStream stream) {
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Fri Oct 25 18:05:56 UTC 2024
    - 22.2K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/TreeRangeMap.java

              entriesInMergeRange.iterator();
          Cut<K> lowerBound = range.lowerBound;
          while (backingItr.hasNext()) {
            RangeMapEntry<K, V> entry = backingItr.next().getValue();
            Cut<K> upperBound = entry.getLowerBound();
            if (!lowerBound.equals(upperBound)) {
              gaps.put(lowerBound, new RangeMapEntry<K, V>(lowerBound, upperBound, value));
            }
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 26.7K bytes
    - Viewed (0)
  4. okhttp-testing-support/src/main/kotlin/okhttp3/RecordingConnectionListener.kt

            }
          }
        } catch (e: NoSuchElementException) {
          throw AssertionError("full event sequence: $fullEventSequence", e)
        }
      }
    
      /**
       * Remove and return the next event from the recorded sequence.
       *
       * @param eventClass a class to assert that the returned event is an instance of, or null to
       *     take any event class.
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 5.6K bytes
    - Viewed (0)
  5. okcurl/src/main/kotlin/okhttp3/curl/Main.kt

    import okhttp3.internal.platform.Platform
    import okhttp3.logging.HttpLoggingInterceptor
    import okhttp3.logging.LoggingEventListener
    
    class Main : CliktCommand(name = NAME, help = "A curl for the next-generation web.") {
      val method: String? by option("-X", "--request", help = "Specify request command to use")
    
      val data: String? by option("-d", "--data", help = "HTTP POST data")
    
    Registered: Fri Nov 01 11:42:11 UTC 2024
    - Last Modified: Mon Jan 08 01:13:22 UTC 2024
    - 5.7K bytes
    - Viewed (0)
  6. docs/en/docs/how-to/custom-request-and-route.md

    That way, the same route class can handle gzip compressed or uncompressed requests.
    
    {* ../../docs_src/custom_request_and_route/tutorial001.py hl[8:15] *}
    
    ### Create a custom `GzipRoute` class
    
    Next, we create a custom subclass of `fastapi.routing.APIRoute` that will make use of the `GzipRequest`.
    
    This time, it will overwrite the method `APIRoute.get_route_handler()`.
    
    Registered: Sun Nov 03 07:19:11 UTC 2024
    - Last Modified: Sun Oct 27 22:39:38 UTC 2024
    - 4.3K bytes
    - Viewed (0)
  7. src/main/java/jcifs/internal/smb1/trans2/Trans2FindFirst2Response.java

                 * or to the start of the entry containing the
                 * filename(e.g. NT). Ahhrg! In either case the
                 * lastNameOffset falls between the start of the
                 * entry and the next entry.
                 */
    
                if ( this.lastNameBufferIndex >= bufferIndex
                        && ( e.getNextEntryOffset() == 0 || this.lastNameBufferIndex < ( bufferIndex + e.getNextEntryOffset() ) ) ) {
    Registered: Sun Nov 03 00:10:13 UTC 2024
    - Last Modified: Sun Jul 01 13:12:10 UTC 2018
    - 5.7K bytes
    - Viewed (0)
  8. compat/maven-compat/src/main/java/org/apache/maven/artifact/deployer/DefaultArtifactDeployer.java

                    relatedMetadata.put(snapshotKey, (MergeableMetadata) metadata);
                }
            }
    
            artifact.setResolvedVersion(result.getArtifacts().iterator().next().getVersion());
        }
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 6.4K bytes
    - Viewed (0)
  9. compat/maven-compat/src/main/mdo/paramdoc.mdo

                {
                    for ( java.util.Iterator it = expressions.iterator(); it.hasNext(); )
                    {
                        Expression expr = (Expression) it.next();
    
                        expressionsBySyntax.put( expr.getSyntax(), expr );
                    }
                }
            }
    
            return expressionsBySyntax;
        }
    
        public void flushExpressionsBySyntax()
    Registered: Sun Nov 03 03:35:11 UTC 2024
    - Last Modified: Fri Oct 25 12:31:46 UTC 2024
    - 5.4K bytes
    - Viewed (0)
  10. utils/utils.go

    	// the third caller usually from gorm internal
    	len := runtime.Callers(3, pcs[:])
    	frames := runtime.CallersFrames(pcs[:len])
    	for i := 0; i < len; i++ {
    		// second return value is "more", not "ok"
    		frame, _ := frames.Next()
    		if (!strings.HasPrefix(frame.File, gormSourceDir) ||
    			strings.HasSuffix(frame.File, "_test.go")) && !strings.HasSuffix(frame.File, ".gen.go") {
    Registered: Sun Nov 03 09:35:10 UTC 2024
    - Last Modified: Thu Aug 22 11:03:42 UTC 2024
    - 4.1K bytes
    - Viewed (0)
Back to top