>
> (defun predicate-collect (list &rest predicates)
> (let ((table (make-hash-table))
> (preds (append predicates
> (list (constantly t)))))
> (dolist (elem list)
> (loop for pred in preds
> until (funcall pred elem)
> finally (push elem (gethash pred table))))
> (mapcar (lambda (pred)
> (nreverse (gethash pred table)))
> preds)))
>
>
> ? (predicate-collect
> '(-5 -4 -3 -2 -1 0 1 2 3 4 5)
> (function evenp)
> (lambda (n) (< n 0))
> (lambda (n) (> n 3)))
>
> ((-4 -2 0 2 4) (-5 -3 -1) (5) (1 3))

Gauche Scheme or Racket:

(define (predicate-collect items . preds)
(if (null? preds)
(list items)
(let-values (((yes no) (partition (car preds) items)))
(cons yes (apply predicate-collect no (cdr preds))))))

(predicate-collect
'(-5 -4 -3 -2 -1 0 1 2 3 4 5)
even?
(lambda (n) (< n 0))
(lambda (n) (> n 3)))

===>
((-4 -2 0 2 4) (-5 -3 -1) (5) (1 3))