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
| | ;; -*- lexical-binding: t; -*-
;; Copyright (C) 2019 Free Software Foundation, Inc.
;; This file is part of GNU Emacs.
;; GNU Emacs is free software: you can redistribute it and/or modify
;; it under the terms of the GNU General Public License as published by
;; the Free Software Foundation, either version 3 of the License, or
;; (at your option) any later version.
;; GNU Emacs is distributed in the hope that it will be useful,
;; but WITHOUT ANY WARRANTY; without even the implied warranty of
;; MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
;; GNU General Public License for more details.
;; You should have received a copy of the GNU General Public License
;; along with GNU Emacs. If not, see <https://www.gnu.org/licenses/>.
;;; Commentary:
;; Compute the length of a list tail recursively.
(require 'cl-lib)
(defvar elb-listlen-tc-len 300)
(defvar elb-listlen-tc-list
(mapcar #'random (make-list elb-listlen-tc-len 100)))
(defun elb-listlen-tc (l n)
(if (null l)
n
(cl-incf n)
(elb-listlen-tc (cdr l) n)))
(defun elb-listlen-tc-entry ()
(let ((l (copy-sequence elb-listlen-tc-list)))
(cl-loop repeat 350000
do (elb-listlen-tc l 0))))
(provide 'listlen-tc)
|