public static final long nanoTimeThread() { return NanoTimer.nativeNanoTime(NativeCalls.CLOCKID_THREAD_CPUTIME_ID, true); }
public static final long nanoTimeThread() { return NanoTimer.nativeNanoTime(NativeCalls.CLOCKID_THREAD_CPUTIME_ID, true); }
public static final long nanoTimeThread() { return NanoTimer.nativeNanoTime(NativeCalls.CLOCKID_THREAD_CPUTIME_ID, true); }
/** * * This function was added because the call to {@link #nativeNanoTime(int, boolean)} with * CLOCKID_PROCESS_CPUTIME_ID is taking few milliseconds. With this, EXPLAIN query * scenarios are terribly slow because there can be millions of calls to nanoTime. * java.lang.System.nanoTime() should be perfect in most of the cases because the * timer resolution is 1 ns and timer speed is few tens of nano seconds. Making it * as the default behavior. If {@link #NATIVETIMER_TYPE_PROPERTY} is set then * native timer of the specified type is used. */ public static final long nanoTime() { return CLOCKID_USE_SYSNANOTIME ? java.lang.System.nanoTime() : nativeNanoTime(nativeTimerType, true); }
final String[] sortedSet = new String[numItems]; long start = NanoTimer .nativeNanoTime(NativeCalls.CLOCKID_THREAD_CPUTIME_ID, true); for (int i = 0; i < numItems; i++) { sortedSet[i] = values[i]; + randInts.toString()); long end = NanoTimer.nativeNanoTime(NativeCalls.CLOCKID_THREAD_CPUTIME_ID, true); System.out.println("Time taken for testArraySorting: " + ((end - start) / 1000000) + " millis, cmp calls = " + numCmpCalls);
.nativeNanoTime(NativeCalls.CLOCKID_THREAD_CPUTIME_ID, true); int n; for (int i = 0; i < numItems; i++) { .numOverflowedElements() + " for total = " + numItems); long end = NanoTimer.nativeNanoTime(NativeCalls.CLOCKID_THREAD_CPUTIME_ID, true); System.out.println("Time taken for " + testName + ": " + ((end - start) / 1000000) + " millis, cmp calls = " + numCmpCalls);