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.
Implementation edit is for fixing errors and enhancing with metadata.
Instead of changing the code of the snippet, consider creating another Go implementation.
(define (contains list x) (cond [(null? list) #f] [(equal? (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; }
# 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};
return list.indexOf(x) !== -1;
list.contains(&x);
in_array($x, $list, true);
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).
function contains(list, x) for _, v in pairs(list) do if v == x then return true end end return false end
list.contains(x)
return 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).
[list containsObject:x];
list.include? x
(member x list)
(some #{x} list)
List.mem x list
x in list
if (findloc (list, x, 1) != 0) then
member(X, [One]).
List.Contains(x)
if (any(x == list)) ...
find _ [] = False find n (x:xs) | x == n = True | otherwise = find n xs
x in list
list.contains(x)
list.contains(x)