Time a function: Difference between revisions

This task is intended as a subtask for [[Measure relative performance of sorting algorithms implementations]].

<br><br>

 

=={{header|8051 Assembly}}==

is (256^x - 1) * 2^(-p).

 

TSTART EQU 08h ; first register of timer counter

TEND EQU TSTART + TC - 1 ; end register of timer counter

 

END

 

=={{header|ACL2}}==

 

 

Output (for Clozure):

; (160,001,648 bytes allocated).

(NIL)</pre>

 

=={{header|Ada}}==

with Ada.Text_Io; use Ada.Text_Io;

 

Put_Line("Identity(4) takes" & Duration'Image(Time_It(Id_Access, 4)) & " seconds.");

Put_Line("Sum(4) takes:" & Duration'Image(Time_It(Sum_Access, 4)) & " seconds.");

===Example===

Identity(4) takes 0.000001117 seconds.

 

=={{header|Aime}}==

identity(integer x)

{

 

0;

=={{header|ARM Assembly}}==

{{works with|as|Raspberry Pi}}

/* ARM assembly Raspberry PI */

/* program fcttime.s */

pop {r2-r4}

bx lr @ return

{{out}}

<pre>

=={{header|Arturo}}==

 

 

{{out}}

 

 

=={{header|AutoHotkey}}==

===System time===

Uses system time, not process time

Return

 

%function%(parameter)

Return ElapsedTime := A_TickCount - StartTime . " milliseconds"

=== Using QueryPerformanceCounter ===

QueryPerformanceCounter allows even more precision:

 

}

 

 

=={{header|BaCon}}==

The BaCon '''TIMER''' function keeps track of time spent running, in milliseconds (which is also the time unit used by '''SLEEP'''). This is not process specific, but a wall clock time counter which starts at 0 during process initialization. As BaCon can easily use external C libraries, process specific ''CLOCK_PROCESS_CPUTIME_ID'' '''clock_gettime''' could also be used.

 

SUB timed()

SLEEP 7000

timed()

et = TIMER

 

{{out}}

=={{header|BASIC}}==

{{works with|QBasic}}

 

timestart = TIMER

'midnight check:

IF timedone < timestart THEN timedone = timedone + 86400

 

See also: [[#BBC BASIC|BBC BASIC]], [[#PureBasic|PureBasic]].

 

=={{header|Batch File}}==

Granularity: hundredths of second.

@echo off

Setlocal EnableDelayedExpansion

)

goto:eof

 

=={{header|BBC BASIC}}==

REM perform processing

 

=={{header|Bracmat}}==

= fun funarg t0 ret

. !arg:(?fun.?funarg)

)

& time$(fib.30)

Output:

<pre>1346269.5,141*10E0 s</pre>

<code>CLOCK_PROCESS_CPUTIME_ID</code> is preferred when available (eg. Linux kernel 2.6.12 up), being CPU time used by the current process. (<code>CLOCK_MONOTONIC</code> generally includes CPU time of unrelated processes, and may be drifted by <code>adjtime()</code>.)

 

#include <time.h>

 

printf("sum (4) takes %lf s\n", time_it(sum, 4));

return 0;

 

=={{header|C sharp|C#}}==

Using Stopwatch.

 

using System.Linq;

using System.Threading;

Enumerable.Range(1, 10000).Where(x => x % 2 == 0).Sum(); // Sum even numers from 1 to 10000

}

 

Using DateTime.

 

using System.Linq;

using System.Threading;

Enumerable.Range(1, 10000).Where(x => x % 2 == 0).Sum(); // Sum even numers from 1 to 10000

}

 

Output:

DoSomething() took 1071,5408ms

 

=={{header|Clojure}}==

(defn fib []

(map first

 

(time (take 100 (fib)))

 

Output:

Common Lisp provides a standard utility for performance measurement, [http://www.lispworks.com/documentation/HyperSpec/Body/m_time.htm time]:

 

Evaluation took:

0.151 seconds of real time

0 calls to %EVAL

0 page faults and

 

(The example output here is from [[SBCL]].)

The functions [http://www.lispworks.com/documentation/HyperSpec/Body/f_get__1.htm get-internal-run-time] and [http://www.lispworks.com/documentation/HyperSpec/Body/f_get_in.htm get-internal-real-time] may be used to get time information programmatically, with at least one-second granularity (and usually more). Here is a function which uses them to measure the time taken for one execution of a provided function:

 

(let ((real-base (get-internal-real-time))

(run-base (get-internal-run-time)))

CL-USER> (timings (lambda () (reduce #'+ (make-list 100000 :initial-element 1))))

17/500

 

=={{header|D}}==

 

int identity(int x) {

writefln("identity(4) takes %f6 seconds.", timeIt(&identity, 4));

writefln("sum(4) takes %f seconds.", timeIt(&sum, 4));

Output:<pre>identity(4) takes 0.0000016 seconds.

sum(4) takes 0.522065 seconds.</pre>

===Using Tango===

import tango.io.Stdout;

import tango.time.Clock;

Stdout.format("Sum(4) takes {:f6} seconds",timeIt(&sum,4)).newline;

}

 

=={{header|E}}==

{{trans|Java}} — E has no ''standardized'' facility for CPU time measurement; this {{works with|E-on-Java}}.

 

println("Counting...")

for _ in 1..x {}

def finish := threadMX.getCurrentThreadCpuTime()

println(`Counting to $count takes ${(finish-start)//1000000}ms`)

=={{header|Elena}}==

{{trans|C#}}

import system'routines;

import system'threading;

threadControl.sleep(1000);

}

console.printLine("Time elapsed in msec:",(end - start).Milliseconds)

{{out}}

<pre>

{{trans|Erlang}}

'''tc/1'''

'''tc/2'''

'''tc/3'''

{224000,

[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,

23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41,

 

=={{header|Erlang}}==

 

'''tc/1''' takes a 0-arity function and executes it:

5> {Time,Result} = timer:tc(fun () -> lists:foreach(fun(X) -> X*X end, lists:seq(1,100000)) end).

{226391,ok}

0.226391

7> % Time is in microseconds.

'''tc/2''' takes an n-arity function and its arguments:

9> timer:tc(fun (X) -> lists:foreach(fun(Y) -> Y*Y end, lists:seq(1,X)) end, [1000000]).

{2293844,ok}

'''tc/3''' takes a module name, function name and the list of arguments to the function:

8> timer:tc(lists,seq,[1,1000000]).

{62370,

[1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,

23,24,25,26,27|...]}

=={{header|Euphoria}}==

t = time()

some_procedure()

t = time() - t

 

=={{header|F Sharp|F#}}==

The .Net framework provides a Stopwatch class which provides a performance counter.

open System.Diagnostics

let myfunc data =

printf "elapsed %d ms" timer.ElapsedMilliseconds

result

 

=={{header|Factor}}==

 

=={{header|Forth}}==

{{works with|GNU Forth}}

utime 2>R ' EXECUTE

utime 2R> D-

<# # # # # # # [CHAR] . HOLD #S #> TYPE ." seconds" ;

 

 

=={{header|Fortran}}==

{{works with|Gfortran}} version 4.4.5 (Debian 4.4.5-8) on x86_64-linux-gnu

 

c The subroutine to analyze

subroutine do_something()

return

end

 

=={{header|FreeBASIC}}==

 

Function sumToLimit(limit As UInteger) As UInteger

Print

Print "Press any key to quit"

 

{{out}}

 

=={{header|GAP}}==

 

=={{header|Go}}==

The Go command line tool <code>go test</code> includes [http://golang.org/pkg/testing/#hdr-Benchmarks benchmarking support].

Given a package with functions:

 

func Empty() {}

for i := 0; i < 1e6; i++ {

}

the following code, placed in a file whose name ends in <tt>_test.go</tt>, will time them:

 

import "testing"

Count()

}

<code>go test</code> varies <code>b.N</code> to get meaningful resolution.

Example:

===testing.Benchmark===

The benchmarking features of the <code>testing</code> package are exported for use within a Go program.

 

import (

fmt.Printf("Empty: %12.4f\n", float64(e.T.Nanoseconds())/float64(e.N))

fmt.Printf("Count: %12.4f\n", float64(c.T.Nanoseconds())/float64(c.N))

{{out}}

<pre>

 

As the first line of the function you wish to time, use <tt>defer</tt> with an argument of <tt>time.Now()</tt> to print the elapsed time to the return of any function. For example, define the function <tt>from</tt> as shown below. It works because defer evaluates its function's arguments at the time the function is deferred, so the current time gets captured at the point of the defer. When the function containing the defer returns, the deferred <tt>from</tt> function runs, computes the elapsed time as a <tt>time.Duration</tt>, and prints it with standard formatting, which adds a nicely scaled unit suffix.

 

import (

empty()

count()

Output:

<pre>

{{trans|Java}}

===CPU Timing===

import java.lang.management.ThreadMXBean

 

c.call()

(threadMX.currentThreadCpuTime - start)/1000000

 

===Wall Clock Timing===

def start = System.currentTimeMillis()

c.call()

System.currentTimeMillis() - start

 

Test:

long i = 0; while(i < n) { i += 1L }

}

println "Counting to ${testSize} takes ${measuredTime}ms of ${measurementType}"

}

 

Output:

 

=={{header|Halon}}==

 

sleep(1);

 

 

=={{header|Haskell}}==

 

-- We assume the function we are timing is an IO monad computation

-- Version for use with evaluating regular non-monadic functions

timeIt_ :: (Fractional c) => (a -> b) -> a -> IO c

 

===Example===

 

=={{header|HicEst}}==

SYSTEM(WAIT = 1234) ! wait 1234 milliseconds

t_end = TIME()

 

 

=={{header|Icon}} and {{header|Unicon}}==

The function 'timef' takes as argument a procedure name and collects performance and timing information including run time (in milliseconds), garbage collection, and memory usage by region.

 

local gcol,alloc,used,size,runtime,header,x,i

 

write("Note: static region values should be zero and may not be meaningful.")

return

 

timef(perfectnumbers)

end

 

procedure perfectnumbers()

 

Sample output (from the [[Perfect_numbers#Icon_and_Unicon|Perfect Numbers]] task):

current size: N/A 0 0 0

Note: static region values should be zero and may not be meaningful.

 

=={{header|Ioke}}==

 

func = method((1..50000) reduce(+))

 

 

=={{header|J}}==

Time and space requirements are tested using verbs obtained through the Foreign conjunction (<code>!:</code>). <code>6!:2</code> returns time required for execution, in floating-point measurement of seconds. <code>7!:2</code> returns a measurement of space required to execute. Both receive as input a sentence for execution. The verb <code>timespacex</code> combines these and is available in the standard library.

===Example===

 

=={{header|Java}}==

{{works with|Java|1.5+}}

import java.lang.management.ThreadMXBean;

 

System.out.println("Done!");

}

 

Measures real time rather than CPU time:

{{works with|Java|(all versions)}}

 

long start, end;

start = System.currentTimeMillis();

System.out.println("Counting to 1000000000 takes "+(end-start)+"ms");

 

Output:

Counting...

 

=={{header|JavaScript}}==

function test() {

let n = 0

 

console.log('test() took ' + ((end - start) / 1000) + ' seconds') // test() took 0.001 seconds

 

=={{header|Julia}}==

 

function countto(n::Integer)

 

@time countto(10 ^ 5)

 

{{out}}

=={{header|Kotlin}}==

{{trans|Java}}

// need to enable runtime assertions with JVM -ea option

 

println("Counting to $count takes ${(end-start)/1000000}ms")

}

This is a typical result (sometimes the second figure is only about 1400ms - no idea why)

{{out}}

 

=={{header|Lasso}}==

loop(100000) => {

'nothing is outout because no autocollect'

}

 

=={{header|Lingo}}==

repeat with i = 1 to 1000000

x = sqrt(log(i))

end repeat

 

testFunc()

ms = _system.milliseconds - ms

put "Execution time in ms:" && ms

 

=={{header|Logo}}==

This is not an ideal method; Logo does not expose a timer (except for the WAIT command) so we use the Unix "date" command to get a second timer.

 

output first first shell "|date +%s|

end

end

 

 

=={{header|Lua}}==

for i = 1, 10000000 do

local s = math.log( i )

t2 = os.clock()

 

 

=={{header|M2000 Interpreter}}==

10000 is Double (default)

 

Module Checkit {

Module sumtolimit (limit) {

sum=limit-limit

n=sum

n++

while limit {sum+=limit*n:limit--:n-!}

}

Cls ' clear screen

Profiler

sumtolimit 10000

Print TimeCount

}

 

=={{header|Maple}}==

The built-in command CodeTools:-Usage can compute the "real" time for the length of the computation or the "cpu" time for the computation. The following examples find the real time and cpu time for computing the integer factors for 32!+1.

 

where x is an operation. Example calculating a million digits of Sqrt[3]:

First elements if the time in seconds, second elements if the result from the operation. Note that I truncated the result.

 

=={{header|Maxima}}==

 

/* First solution, call the time function with an output line number, it gives the time taken to compute that line.

f(24);

Evaluation took 0.9400 seconds (0.9400 elapsed)

 

=={{header|MiniScript}}==

for i in range(1,100000)

end for

duration = time - start

{{out}}

<pre>

 

=={{header|Nim}}==

var n = x

for i in 0..10000000:

n += i

let t0 = cpuTime()

cpuTime() - t0

 

 

=={{header|OCaml}}==

let start_time = Sys.time () in

ignore (action arg);

let finish_time = Sys.time () in

 

===Example===

 

=={{header|Oz}}==

%% returns milliseconds

fun {TimeIt Proc}

{FoldL {List.number 1 1000000 1} Number.'+' 4 _}

end}

 

=={{header|PARI/GP}}==

This version, by default, returns just the CPU time used by gp, not the delta of wall times. PARI can be compiled to use wall time if you prefer: configure with <code>--time=ftime</code> instead of <code>--time=

getrusage</code>, <code>--time=clock_gettime</code>, or <code>--time=times</code>. See Appendix A, section 2.2 of the User's Guide to PARI/GP.

foo();

gettime();

 

Alternate version:

{{works with|PARI/GP|2.6.2+}}

my(start=getabstime());

foo();

getabstime()-start;

 

=={{header|Perl}}==

Example of using the built-in Benchmark core module - it compares two versions of recursive factorial functions:

use Memoize;

 

'fac2' => sub { fac2(50) },

});

Output:

Benchmark: timing 100000 iterations of fac1, fac2...

 

Example without using Benchmark:

my ($user,$system,$cuser,$csystem) = times;

$user + $system

 

printf "Sum(4) takes %f seconds.\n", time_it(\&sum, 4);

 

=={{header|Phix}}==

 

=={{header|Phixmonti}}==

for drop endfor

enddef

 

10000000 count

 

=={{header|PicoLisp}}==

There is another function, '[http://software-lab.de/doc/refT.html#tick tick]', which

also measures user time, and is used by the profiling tools.

0.080 sec

 

=={{header|Pike}}==

function gauge(), but it could also be done manually with

gethrvtime() in ms or ns resolution.

void get_some_primes()

{

write("Wasted %f CPU seconds calculating primes\n", time_wasted);

}

{{Out}}

<pre>

 

=={{header|PL/I}}==

 

start_time = secs();

 

/* Note: using the SECS function takes into account the clock */

 

=={{header|PowerShell}}==

function fun($n){

$res = 0

}

"$((Measure-Command {fun 10000}).TotalSeconds) Seconds"

<b>Output:</b>

<pre>

0.820712 Seconds

</pre>

 

=={{header|PureBasic}}==

===Built in timer===

This version uses the built in timer, on Windows it has an accuracy of ~10-15 msec.

Protected i, palindromic, String$

For i=0 To Limit

PrintN("and "+Str(cnt)+" are palindromic.")

Print("Press ENTER to exit."): Input()

 

Starting timing of a calculation,

 

This version uses a hi-res timer, but it is Windows only.

Define Timed.f, cnt

PrintN("Starting timing of a calculation,")

PrintN("and "+Str(cnt)+" are palindromic.")

Print("Press ENTER to exit."): Input()

 

Starting timing of a calculation,

 

This version still relies on the Windows API but does not make use of any additional libraries.

Static maxfreq.q

Protected T.q

PrintN("and " + Str(cnt) + " are palindromic.")

Print("Press ENTER to exit."): Input()

 

Sample output:

 

'''Note:''' There is an overhead in executing a function that does nothing.

def usec(function, arguments):

modname, funcname = __name__, function.__name__

from math import pow

def nothing(): pass

 

===Example===

[2.7, 2.8, 31.4, 38.1, 58.0, 76.2, 100.5, 130.0, 149.3, 180.0]

using ''qsort()'' from [[Quicksort#Python|Quicksort]]. Timings show that the implementation of ''qsort()'' has quadratic dependence on sequence length ''N'' for already sorted sequences (instead of ''O(N*log(N))'' in average).

 

=={{header|R}}==

R has a built-in function, system.time, to calculate this.

foo <- function()

{

timer <- system.time(foo())

# Extract the processing time

For a breakdown of processing time by function, there is Rprof.

foo()

Rprof(NULL)

 

=={{header|Racket}}==

 

#lang racket

(define (fact n) (if (zero? n) 1 (* n (fact (sub1 n)))))

(time (fact 5000))

 

=={{header|Raven}}==

$x dup * $x /

 

42 "doId" timeFunc

12 2 "doPower" timeFunc

{{out}}

<pre>2.193e-05 secs for NULL

Retro has a '''time''' function returning the current time in seconds. This can be used to build a simple timing function:

 

 

: test 20000 [ putn space ] iterd ;

 

Finer measurements are not possible with the standard implementation.

<br>there's a way to easily query the host (VM/CP) to indicate how much &nbsp; ''true'' &nbsp; CPU time was used by

<br>(normally) your own userID.&nbsp; The result can then be placed into a REXX variable (as an option).

arg reps . /*obtain an optional argument from C.L.*/

if reps=='' then reps=100000 /*Not specified? No, then use default.*/

@.j=random() date() time() digits() fuzz() form() xrange() queued()

end /*j*/

'''output''' &nbsp; when using a personal computer built in the 20th century:

<pre>

<br>being measured is essentially the same as the wall clock time (duration) of the function execution; &nbsp; the

<br>overhead of the invocation is minimal compared to the overall time used.

arg reps . /*obtain an optional argument from C.L.*/

if reps=='' then reps=100000 /*Not specified? No, then use default.*/

@.j=random() date() time() digits() fuzz() form() xrange() queued()

end /*j*/

'''output''' &nbsp; is essentially identical to the previous examples.

<br><br>

 

=={{header|Ring}}==

beginTime = TimeList()[13]

for n = 1 to 10000000

elapsedTime = endTime - beginTime

see "Elapsed time = " + elapsedTime + nl

 

=={{header|Ruby}}==

Ruby's Benchmark module provides a way to generate nice reports (numbers are in seconds):

 

Benchmark.bm(8) do |x|

x.report("nothing:") { }

x.report("sum:") { (1..1_000_000).inject(4) {|sum, x| sum + x} }

Output:

user system total real

 

You can get the total time as a number for later processing like this:

 

=={{header|Scala}}==

Define a <code>time</code> function that returns the elapsed time (in ms) to execute a block of code.

def time(f: => Unit)={

val s = System.currentTimeMillis

System.currentTimeMillis - s

}

Can be called with a code block:

println(time {

for(i <- 1 to 10000000) {}

})

Or with a function:

def count(i:Int) = for(j <- 1 to i){}

println(time (count(10000000)))

 

=={{header|Scheme}}==

 

=={{header|Seed7}}==

include "time.s7i";

include "duration.s7i";

writeln("Identity(4) takes " <& timeIt(identity(4)));

writeln("Sum(4) takes " <& timeIt(sum(4)));

 

{{out}} of interpreted program:

 

=={{header|Sidef}}==

 

func fac_rec(n) {

))

 

{{out}}

<pre>

 

=={{header|Slate}}==

[inform: 2000 factorial] timeToRun.

 

=={{header|Smalltalk}}==

 

=={{header|Standard ML}}==

val timer = Timer.startCPUTimer ()

val _ = action arg

in

Time.+ (#usr times, #sys times)

 

===Example===

Stata can track up to 100 timers. See '''[http://www.stata.com/help.cgi?timer timer]''' in Stata help.

 

timer clear 1

timer on 1

 

. timer_test 1000

 

=={{header|Swift}}==

Using the 2-term ackermann function for demonstration.

 

 

public struct TimeResult {

let (n2, t2) = ClockTimer.time { ackermann(m: 4, n: 1) }

 

 

{{out}}

The Tcl <code>time</code> command returns the real time elapsed

averaged over a number of iterations.

for {set i 1; set sum 0.0} {$i <= $n} {incr i} {set sum [expr {$sum + $i}]}

return [expr {wide($sum)}]

 

puts [time {sum_n 1e6} 100]

{{out}}

163551.0 microseconds per iteration

 

Returns average time elapsed from many iterations.

function benchmark(%times,%function,%a,%b,%c,%d,%e,%f,%g,%h,%i,%j,%k,%l,%m,%n,%o)

{

return %result;

}

 

{{out|Example}}

function exampleFunction(%var1,%var2)

{

==> BENCHMARKING RESULT FOR exampleFunction:

==> 13.257

 

=={{header|TUSCRIPT}}==

$$ MODE TUSCRIPT

SECTION test

PRINT "'test' ends at ",time_end

PRINT "'test' takes ",interval," seconds"

{{out}}

'test' start at 2011-01-15 14:38:22

 

=={{header|UNIX Shell}}==

 

real 0m1.074s

 

=={{header|VBA}}==

Private Function identity(x As Long) As Long

For j = 0 To 1000

finis_time = GetTickCount

Debug.Print "1000 times Sum(1) takes "; (finis_time - start_time); " milliseconds"

1000 times Sum(1) takes 296 seconds</pre>

=={{header|Wart}}==

30000/1000000 # in microseconds

 

=={{header|XPL0}}==

and thus the two values can be out of sync.

 

int T0, T1, I;

[T0:= GetTime;

T1:= GetTime;

IntOut(0, T1-T0); Text(0, " microseconds^M^J");

 

{{out|Example output}} for a Duron 850 running DOS 5.0:

 

=={{header|Yabasic}}==

local i

t0 = peek("millisrunning")

count(10000000)

 

=={{header|zkl}}==

In order to be as OS independent as possible, only system time is available.

{{out}}

<pre>3</pre>