Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating resource.
Please try to avoid dependencies to third-party libraries and frameworks.
func Contains(list []T, x T) bool { for _, item := range list { if item == x { return true } } return false }
#include <vector>
bool Contains(vector<T> list, T x) { for (vector<T>::iterator it = list.begin() ; it != list.end() ; ++it) { if (*it == x) return true; } return false; }
#include <vector> #include <algorithm>
bool Contains(const std::vector<int> &list, int x) { return std::find(list.begin(), list.end(), x) != list.end(); }
list.include?( x )
(define (contains list x) (cond ((null? list) #f) ((eq? (car list) x) #t) (else (contains (cdr list) x))))
x in list
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; }
import java.util.List;
list.contains(x)
# To check an array for a value: print "Found 'foo'\n" if grep { $_ eq 'foo' } @a_list; # To check a map for a value: print "Found 'bar'\n" if exists $map{bar};
list.indexOf(x) !== -1
list.contains(&x);
in_array ($x, $list, true);
import std.algorithm.searching;
bool here = canFind(items, x);
list.contains(x);
result := false; for e in list do if e=x then begin result := true; break; end
x `elem` list
(some (partial = x) list)
Enum.member?(list, x)
lists:member(X, List).
#include <stdbool.h>
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; }
function contains(list, x) for _, v in pairs(list) do if v == x then return true end end return false end
with Ada.Containers.Vectors;
Result := Items.Contains (X);
System.Collections.Generic
list.Contains(item);
val items: Seq[String] = List("a", "b", "c") items.contains("a")
list.includes(x)
list.iter().any(|v| v == &x)
(&list).into_iter().any(|v| v == &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).