The following procedures search lists for particular elements. They use
different comparison predicates for comparing list elements with the
object to be searched. When they fail, they return `#f`

, otherwise
they return the sublist whose car is equal to the search object, where
equality depends on the equality predicate used.

— Scheme Procedure: **memq**` x lst`

— C Function:**scm_memq** (`x, lst`)

— C Function:

Return the first sublist of

lstwhose car is`eq?`

toxwhere the sublists oflstare the non-empty lists returned by`(list-tail`

lstk`)`

forkless than the length oflst. Ifxdoes not occur inlst, then`#f`

(not the empty list) is returned.

— Scheme Procedure: **memv**` x lst`

— C Function:**scm_memv** (`x, lst`)

— C Function:

Return the first sublist of

lstwhose car is`eqv?`

toxwhere the sublists oflstare the non-empty lists returned by`(list-tail`

lstk`)`

forkless than the length oflst. Ifxdoes not occur inlst, then`#f`

(not the empty list) is returned.

— Scheme Procedure: **member**` x lst`

— C Function:**scm_member** (`x, lst`)

— C Function:

Return the first sublist of

lstwhose car is`equal?`

toxwhere the sublists oflstare the non-empty lists returned by`(list-tail`

lstk`)`

forkless than the length oflst. Ifxdoes not occur inlst, then`#f`

(not the empty list) is returned.See also SRFI-1 which has an extended

`member`

function (SRFI-1 Searching).