Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 11 for nanoSeconds (0.15 sec)

  1. android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java

                "[^\\[]+\\[status=PENDING, info=\\[cause=\\[Because this test isn't done\\]\\]\\]");
        TimeoutException e =
            assertThrows(TimeoutException.class, () -> testFuture.get(1, TimeUnit.NANOSECONDS));
        assertThat(e.getMessage()).contains("1 nanoseconds");
        assertThat(e.getMessage()).contains("Because this test isn't done");
      }
    
      public void testToString_completesDuringToString() throws Exception {
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Tue Jun 11 16:13:05 UTC 2024
    - 46.7K bytes
    - Viewed (0)
  2. guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java

                "[^\\[]+\\[status=PENDING, info=\\[cause=\\[Because this test isn't done\\]\\]\\]");
        TimeoutException e =
            assertThrows(TimeoutException.class, () -> testFuture.get(1, TimeUnit.NANOSECONDS));
        assertThat(e.getMessage()).contains("1 nanoseconds");
        assertThat(e.getMessage()).contains("Because this test isn't done");
      }
    
      public void testToString_completesDuringToString() throws Exception {
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Tue Jun 11 16:13:05 UTC 2024
    - 46.7K bytes
    - Viewed (0)
  3. cmd/erasure-healing-common.go

    func commonTimeAndOccurrence(times []time.Time, group time.Duration) (maxTime time.Time, maxima int) {
    	timeOccurrenceMap := make(map[int64]int, len(times))
    	groupNano := group.Nanoseconds()
    	// Ignore the uuid sentinel and count the rest.
    	for _, t := range times {
    		if t.Equal(timeSentinel) || t.IsZero() {
    			continue
    		}
    		nano := t.UnixNano()
    		if group > 0 {
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Mon Jun 10 15:51:27 UTC 2024
    - 12.5K bytes
    - Viewed (0)
  4. android/guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java

     * uncompilable code).)
     */
    
    package com.google.common.util.concurrent;
    
    import static java.util.concurrent.TimeUnit.MILLISECONDS;
    import static java.util.concurrent.TimeUnit.NANOSECONDS;
    
    import java.io.ByteArrayInputStream;
    import java.io.ByteArrayOutputStream;
    import java.io.ObjectInputStream;
    import java.io.ObjectOutputStream;
    import java.security.CodeSource;
    import java.security.Permission;
    Registered: Wed Jun 12 16:38:11 UTC 2024
    - Last Modified: Mon Jun 10 19:21:11 UTC 2024
    - 37.7K bytes
    - Viewed (0)
  5. src/time/format.go

    	return (std >> stdArgShift) & 0xfff
    }
    
    func separator(std int) byte {
    	if (std >> stdSeparatorShift) == 0 {
    		return '.'
    	}
    	return ','
    }
    
    // appendNano appends a fractional second, as nanoseconds, to b
    // and returns the result. The nanosec must be within [0, 999999999].
    func appendNano(b []byte, nanosec int, std int) []byte {
    	trim := std&stdMask == stdFracSecond9
    	n := digitsLen(std)
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 11 17:09:28 UTC 2024
    - 49.3K bytes
    - Viewed (0)
  6. cmd/bucket-lifecycle.go

    			return
    		}
    
    		op := auditTierOp{
    			Tier:        tier,
    			OutputBytes: bytes,
    		}
    
    		if err == nil {
    			since := time.Since(startTime)
    			op.TimeToResponseNS = since.Nanoseconds()
    			globalTierMetrics.Observe(tier, since)
    			globalTierMetrics.logSuccess(tier)
    		} else {
    			op.Error = err.Error()
    			globalTierMetrics.logFailure(tier)
    		}
    
    Registered: Sun Jun 16 00:44:34 UTC 2024
    - Last Modified: Mon Jun 10 15:31:51 UTC 2024
    - 33.3K bytes
    - Viewed (0)
  7. src/os/exec_unix.go

    	return newHandleProcess(pid, h), nil
    }
    
    func (p *ProcessState) userTime() time.Duration {
    	return time.Duration(p.rusage.Utime.Nano()) * time.Nanosecond
    }
    
    func (p *ProcessState) systemTime() time.Duration {
    	return time.Duration(p.rusage.Stime.Nano()) * time.Nanosecond
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jun 10 22:06:47 UTC 2024
    - 4.1K bytes
    - Viewed (0)
  8. src/os/exec_windows.go

    		args = append(args, string(arg))
    	}
    	return args
    }
    
    func ftToDuration(ft *syscall.Filetime) time.Duration {
    	n := int64(ft.HighDateTime)<<32 + int64(ft.LowDateTime) // in 100-nanosecond intervals
    	return time.Duration(n*100) * time.Nanosecond
    }
    
    func (p *ProcessState) userTime() time.Duration {
    	return ftToDuration(&p.rusage.UserTime)
    }
    
    func (p *ProcessState) systemTime() time.Duration {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Jun 10 22:06:47 UTC 2024
    - 5K bytes
    - Viewed (0)
  9. src/time/tick_test.go

    func BenchmarkTicker(b *testing.B) {
    	benchmark(b, func(pb *testing.PB) {
    		ticker := NewTicker(Nanosecond)
    		for pb.Next() {
    			<-ticker.C
    		}
    		ticker.Stop()
    	})
    }
    
    func BenchmarkTickerReset(b *testing.B) {
    	benchmark(b, func(pb *testing.PB) {
    		ticker := NewTicker(Nanosecond)
    		for pb.Next() {
    			ticker.Reset(Nanosecond * 2)
    		}
    		ticker.Stop()
    	})
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 11 17:10:37 UTC 2024
    - 14.7K bytes
    - Viewed (0)
  10. src/cmd/go/alldocs.go

    //	    calling runtime.SetBlockProfileRate with n.
    //	    See 'go doc runtime.SetBlockProfileRate'.
    //	    The profiler aims to sample, on average, one blocking event every
    //	    n nanoseconds the program spends blocked. By default,
    //	    if -test.blockprofile is set without this flag, all blocking events
    //	    are recorded, equivalent to -test.blockprofilerate=1.
    //
    //	-coverprofile cover.out
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Jun 11 16:54:28 UTC 2024
    - 142.4K bytes
    - Viewed (0)
Back to top