Logo

Programming-Idioms

This language bar is your friend. Select your favorite languages!
  • Scheme

Idiom #12 Check if list contains a value

Check if the list contains the value x.
list is an iterable finite container.

Is this x item contained in this list? 
(member x list)
(define (contains list x)
	(cond [(null? list) #f]
		[(equal? (car list) x) #t]
		[else (contains (cdr list) x)]))

This is a custom implementation, use it if no built-in predicate is available in your Scheme environment.
with Ada.Containers.Vectors;
Result := List.Contains (X);
New implementation...
< > ⌨
programming-idioms.org 
(member x list)
(define (contains list x)
	(cond [(null? list) #f]
		[(equal? (car list) x) #t]
		[else (contains (cdr list) x)]))
Result := List.Contains (X);
bool contains(int x, int* list, size_t list_len) {
    for (int i=0 ; i<list_len ; i++)
        if (list[i] == x)
            return true;
    return false;
}
List.mem x list
(some #{x} list)
(some (partial = x) list)
bool Contains(const std::vector<int> &list, int x)
{
	return std::find(list.begin(), list.end(), x) != list.end();
}
auto contains(auto list, auto x) -> bool {
  return std::ranges::find(list, x) != std::ranges::end(list);
}
list.Contains(item);
bool here = canFind(items, x);
list.contains(x);
x in list
Enum.member?(list, x)
member(_, []) -> false;
member(Value, [H|T]) -> 
  case H of
    Value -> true;
    _ -> member(T)
  end.
member(_, []) -> false;
member(Value, [H|_]) where Value =:= H -> true;
member(Value, [_|T]) -> member(Value, T).
lists:member(X, List).
if (any(x == list)) ...
if (findloc (list, x, 1) != 0) then
slices.Contains(list, x)
func Contains(list []T, x T) bool {
	for _, item := range list {
		if item == x {
			return true
		}
	}
	return false
}
list.contains(x)
x `elem` list
find _ [] = False
find n (x:xs)
  | x == n = True
  | otherwise = find n xs
return list.indexOf(x) !== -1;
return list.includes(x);
boolean contains(int[] list, int x){
  for(int y:list)
    if( y==x )
      return true;
  return false;
}
boolean <T> contains(T[] list, T x){
  if( x==null){
    for(T y:list)
      if( y==null )
        return true;
  }else{
    for(T y:list)
      if( x.equals(y) )
        return true;
  }
  return false;
}
list.contains(x)
asList(list).contains(x);
list.contains(x)
x in list
(member x list)
(find x list :test #'equal)
function contains(list, x)
	for _, v in ipairs(list) do
		if v == x then return true end
	end
	return false
end
[list containsObject:x];
in_array($x, $list, true);
result := false;
for e in list do 
	if e=x then
		begin
			result := true;
			break;
		end

p := list;
while (p <> nil) and (p^.key = x) do p := p^.next;
found := p.key = x
result := list.IndexOf(x) <> -1;
print "ok\n" if first {$_ eq $x} @list;
print "Found 'foo'\n" if grep {$_ eq $x} @list;
member(X, [One]).
x in list
list.include? x
list.iter().any(|v| v == &x)
list.contains(&x);
(&list).into_iter().any(|v| v == &x)
list.binary_search(&x).is_ok()
list.contains(x)

list includes: x.
List.Contains(x)