| ;;; -*- mode: scheme; coding: utf-8; -*- | |
| ;;; SRFI-1. | |
| ;;; | |
| ;;; Copyright 2010, 2011 Free Software Foundation, Inc. | |
| ;;; | |
| ;;; This program is free software; you can redistribute it and/or | |
| ;;; modify it under the terms of the GNU Lesser General Public License | |
| ;;; as published by the Free Software Foundation; either version 3, or | |
| ;;; (at your option) any later version. | |
| ;;; | |
| ;;; This program 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 Lesser General Public License for more details. | |
| ;;; | |
| ;;; You should have received a copy of the GNU Lesser General Public | |
| ;;; License along with this software; see the file COPYING.LESSER. If | |
| ;;; not, write to the Free Software Foundation, Inc., 51 Franklin | |
| ;;; Street, Fifth Floor, Boston, MA 02110-1301 USA | |
| (define-module (benchmarks srfi-1) | |
| #:use-module (srfi srfi-1) | |
| #:use-module (benchmark-suite lib)) | |
| (define %big-list | |
| (iota 1000000)) | |
| (define %small-list | |
| (iota 10)) | |
| (with-benchmark-prefix "fold" | |
| (benchmark "big" 30 | |
| (fold (lambda (x y) y) #f %big-list)) | |
| (benchmark "small" 2000000 | |
| (fold (lambda (x y) y) #f %small-list))) | |
| (with-benchmark-prefix "drop-while" | |
| (benchmark "big" 30 | |
| (drop-while (lambda (n) #t) %big-list)) | |
| (benchmark "small" 2000000 | |
| (drop-while (lambda (n) #t) %small-list))) | |
| (with-benchmark-prefix "map" | |
| (benchmark "big" 30 | |
| (map (lambda (x) x) %big-list)) | |
| (benchmark "small" 2000000 | |
| (map (lambda (x) x) %small-list))) | |
| (with-benchmark-prefix "for-each" | |
| (benchmark "big" 30 | |
| (for-each (lambda (x) #f) %big-list)) | |
| (benchmark "small" 2000000 | |
| (for-each (lambda (x) #f) %small-list))) | |