Mercurial > hg > xemacs-beta
view lisp/hash-table.el @ 5502:5b08be74bb53
Be better about recognising side-effect-free forms, byte-optimize.el.
2011-05-07 Aidan Kehoe <kehoea@parhasard.net>
* byte-optimize.el:
* byte-optimize.el (byte-optimize-form-code-walker):
Call #'byte-optimize-side-effect-free-p on the form, rather than
just checking the plist of the form's car.
* byte-optimize.el (side-effect-free-fns):
Move the CL functions into their alphabetical place in the list.
* byte-optimize.el (function):
* byte-optimize.el (byte-optimize-side-effect-free-p): New.
Function returning non-nil if a funcall has no side-effects, which
handles things like (remove* item list :key 'car) and
(remove-if-not #'integerp list).
author | Aidan Kehoe <kehoea@parhasard.net> |
---|---|
date | Sat, 07 May 2011 11:45:20 +0100 |
parents | 308d34e9f07d |
children |
line wrap: on
line source
;;; hash-table.el --- hash-table utility functions ;; Copyright (C) 2000 Ben Wing. ;; Author: Ben Wing ;; Maintainer: XEmacs Development Team ;; Keywords: internal, dumped ;; This file is part of XEmacs. ;; XEmacs 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. ;; XEmacs 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 XEmacs. If not, see <http://www.gnu.org/licenses/>. ;;; Synched up with: Not in FSF. ;;; Authorship: ;; Created July 2000 by Ben Wing. ;;; Commentary: ;; This file is dumped with XEmacs. ;;; Code: (defun hash-table-key-list (hash-table) "Return a list of all keys in HASH-TABLE." (let (list) (maphash #'(lambda (key value) (push key list)) hash-table) list)) (defun hash-table-value-list (hash-table) "Return a list of all values in HASH-TABLE." (let (list) (maphash #'(lambda (key value) (push value list)) hash-table) list)) (defun hash-table-key-value-alist (hash-table) "Return an alist of (KEY . VALUE) for all keys and values in HASH-TABLE." (let (list) (maphash #'(lambda (key value) (setq list (acons key value list))) hash-table) list)) (defun hash-table-key-value-plist (hash-table) "Return a plist for all keys and values in HASH-TABLE. A plist is a simple list containing alternating keys and values." (let (list) (maphash #'(lambda (key value) (setq list (list* key value list))) hash-table) list))