Re: elisp optimization question

[Kevin Rodgers <kevin.d.rodgers@gmail.com>]

harven wrote:
> hi,
> you can save some typing by using an alist. Here is what i use to
> convert
> accented-letters into html and back.
> 
> (defun accent-html (prefix)
>  "Accented letter translation     é -> &eacute.
>   With an argument,  reverse    é <- &eacute.
>   Works on the whole buffer"
>  (interactive "P")
>  (save-excursion
>    (let ((association
>           '(("É" . "&Eacute;") ("á" . "&aacute;")  ("à" . "&agrave;")
>             ("â" . "&acirc;")  ("ä" . "&auml;")    (""" . "&atilde;")
>             ("é" . "&eacute;") ("è" . "&egrave;")  ("ê" . "&ecirc;")
>             ("ë" . "&euml;")   ("í" . "&iacute;")  ("ì" . "&igrave;")
>             ("î" . "&icirc;")  ("ï" . "&iuml;")    ("ñ" . "&ntilde;")
>             ("ó" . "&oacute;") ("ò" . "&ograve;")  ("ô" . "&ocirc;")
>             ("ö" . "&ouml;")   ("ı" . "&otilde;")  ("ú" .
> "&uacute;")
>             ("ù" . "&ugrave;") ("û" . "&ucirc;")   ("ü" . "&uuml;")
>             ("ç" . "&ccedil;")))
>         (case-fold-search nil))
>    (dolist (paire association)
>      (when prefix
>        (setq paire (cons (cdr paire) (car paire))))
>      (goto-char (point-min))
>      (while (search-forward (car paire) nil t)
>          (replace-match (cdr paire) nil t))))))

Even faster than an alist is a hash table.

-- 
Kevin Rodgers
Denver, Colorado, USA