From Newsgroup: comp.lang.lisp
B. Pym wrote:
Pascal Costanza wrote:
(defun count (element list)
(loop for x in list
count (eql x element)))
Scheme
(count (cut eqv? <> 'm) '(m n o p m a k m o))
===>
3
Using "is":
(count (is 'm) '(m n o p m a k m o))
Given:
(define is
(case-lambda
[(x) (lambda(y) (equal? y x))]
[(pred x) (lambda(y) (pred y x))]
[(key pred x) (lambda(y) (pred (key y) x))]))
--- Synchronet 3.21d-Linux NewsLink 1.2