A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://www.gnu.org/software/emacs/manual/html_node/elisp/Speed-of-Byte_002dCode.html below:

Speed of Byte-Code (GNU Emacs Lisp Reference Manual)

Next: Byte-Compilation Functions, Up: Byte Compilation   [Contents][Index]

17.1 Performance of Byte-Compiled Code

A byte-compiled function is not as efficient as a primitive function written in C, but runs much faster than the version written in Lisp. Here is an example:

(defun silly-loop (n)
  "Return the time, in seconds, to run N iterations of a loop."
  (let ((t1 (float-time)))
    (while (> (setq n (1- n)) 0))
    (- (float-time) t1)))
⇒ silly-loop



(silly-loop 50000000)
⇒ 5.200886011123657





(byte-compile 'silly-loop)
⇒ [Compiled code not shown]





(silly-loop 50000000)
⇒ 0.6239290237426758



In this example, the interpreted code required more than 5 seconds to run, whereas the byte-compiled code required less than 1 second. These results are representative, but actual results may vary.






RetroSearch is an open source project built by @garambo
| Open a GitHub Issue




    Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo




    
        HTML:
        3.2
        | Encoding:
        UTF-8
        | Version:
        0.7.4