Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 75 for times (0.02 sec)

  1. src/test/java/jcifs/dcerpc/msrpc/lsarpcTest.java

            verify(mockDeferredNdrBuffer, times(9)).enc_ndr_long(anyInt()); // 3 enc_ndr_long for each of 3 unicode strings
            verify(mockDeferredNdrBuffer, times(3)).enc_ndr_long(0);
            verify(mockDeferredNdrBuffer, times(3)).advance(anyInt());
            verify(mockDeferredNdrBuffer, times(4)).derive(anyInt()); // 3 for strings + 1 for guid
            verify(mockDeferredNdrBuffer, times(18)).enc_ndr_short(0); // 5+6+7 shorts with value 0
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 60.8K bytes
    - Viewed (0)
  2. okhttp/src/jvmTest/kotlin/okhttp3/internal/http2/HttpOverHttp2Test.kt

            .build()
    
        // Stalling the socket will cause TWO requests to time out!
        server.enqueue(MockResponse.Builder().onRequestStart(Stall).build())
    
        // The 3rd request should be sent to a fresh connection.
        server.enqueue(
          MockResponse(body = "fresh connection"),
        )
    
        // The first call times out.
        val call1 = client.newCall(Request(server.url("/")))
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Sat Nov 01 12:18:11 UTC 2025
    - 67.4K bytes
    - Viewed (0)
  3. guava/src/com/google/common/collect/Iterators.java

       * is polled. This amortizes the sorting cost over the iteration and requires less memory than
       * sorting all elements at once.
       *
       * <p>Retrieving a single element takes approximately O(log(M)) time, where M is the number of
       * iterators. (Retrieving all elements takes approximately O(N*log(M)) time, where N is the total
       * number of elements.)
       */
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Tue Sep 16 12:42:11 UTC 2025
    - 51.4K bytes
    - Viewed (0)
  4. tests/query_test.go

    		}
    	}
    
    	var times []time.Time
    	if err := DB.Model(User{}).Where("name like ?", "pluck-user%").Pluck("created_at", &times).Error; err != nil {
    		t.Errorf("got error when pluck time: %v", err)
    	}
    
    	for idx, tv := range times {
    		AssertEqual(t, tv, users[idx].CreatedAt)
    	}
    
    	var ptrtimes []*time.Time
    Registered: Sun Dec 28 09:35:17 UTC 2025
    - Last Modified: Tue Jul 22 06:21:04 UTC 2025
    - 51K bytes
    - Viewed (0)
  5. docs/changelogs/changelog_3x.md

        regression that was introduced in OkHttp 3.14.5.
    
    
    ## Version 3.14.5
    
    _2020-01-03_
    
     *  Fix: Degrade HTTP/2 connections after a timeout. When an HTTP/2 stream times out it may impact
        the stream only or the entire connection. With this fix OkHttp will now send HTTP/2 pings after
        a stream timeout to determine whether the connection should remain eligible for pooling.
    
    
    Registered: Fri Dec 26 11:42:13 UTC 2025
    - Last Modified: Sun Feb 06 14:55:54 UTC 2022
    - 50.8K bytes
    - Viewed (0)
  6. android/guava/src/com/google/common/util/concurrent/Futures.java

       *
       * <p>The delegate future is interrupted and cancelled if it times out.
       *
       * @param delegate The future to delegate to.
       * @param time when to time out the future
       * @param unit the time unit of the time parameter
       * @param scheduledExecutor The executor service to enforce the timeout.
       * @since 19.0
       */
      @J2ktIncompatible
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 64.3K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/collect/Multimaps.java

       * {@code Set}.
       *
       * <p>The function is applied lazily, invoked when needed. This is necessary for the returned
       * multimap to be a view, but it means that the function will be applied many times for bulk
       * operations like {@link Multimap#containsValue} and {@code Multimap.toString()}. For this to
       * perform well, {@code function} should be fast. To avoid lazy evaluation when the returned
    Registered: Fri Dec 26 12:43:10 UTC 2025
    - Last Modified: Mon Sep 22 18:35:44 UTC 2025
    - 86.5K bytes
    - Viewed (0)
  8. cmd/xl-storage.go

    func (s *xlStorage) readMetadataWithDMTime(ctx context.Context, itemPath string) ([]byte, time.Time, error) {
    	if contextCanceled(ctx) {
    		return nil, time.Time{}, ctx.Err()
    	}
    
    	if err := checkPathLength(itemPath); err != nil {
    		return nil, time.Time{}, err
    	}
    
    	f, err := OpenFile(itemPath, readMode, 0o666)
    	if err != nil {
    		return nil, time.Time{}, err
    	}
    	defer f.Close()
    	stat, err := f.Stat()
    	if err != nil {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 91.7K bytes
    - Viewed (0)
  9. .bazelrc

    # See https://docs.bazel.build/versions/main/windows.html
    common:windows --features=compiler_param_file
    common:windows --features=archive_param_file
    
    # Speed Windows compile times. Available in VS 16.4 (we are on 16.11). See
    # https://groups.google.com/a/tensorflow.org/d/topic/build/SsW98Eo7l3o/discussion
    common:windows --copt=/d2ReducedOptimizeHugeFunctions
    Registered: Tue Dec 30 12:39:10 UTC 2025
    - Last Modified: Fri Dec 26 23:20:26 UTC 2025
    - 56.8K bytes
    - Viewed (0)
  10. src/main/webapp/css/font-awesome.min.css

    ore{content:"\f2c8"}.fa-think-peaks:before{content:"\f731"}.fa-thumbs-down:before{content:"\f165"}.fa-thumbs-up:before{content:"\f164"}.fa-thumbtack:before{content:"\f08d"}.fa-ticket-alt:before{content:"\f3ff"}.fa-times:before{content:"\f00d"}.fa-times-circle:before{content:"\f057"}.fa-tint:before{content:"\f043"}.fa-tint-slash:before{content:"\f5c7"}.fa-tired:before{content:"\f5c8"}.fa-toggle-off:before{content:"\f204"}.fa-toggle-on:before{content:"\f205"}.fa-toilet:before{content:"\f7d8"}.fa-t...
    Registered: Sat Dec 20 09:19:18 UTC 2025
    - Last Modified: Sat Dec 14 21:22:25 UTC 2019
    - 55.8K bytes
    - Viewed (2)
Back to top