• Java

var y = x.stream().filter(p).collect(Collectors.toList());

• Ada

for Item of X loop
   if P (Item) then
      Y.Append (Item);
   end if;
end loop;

• Clojure

(def y (filter p x))

• C++

std::copy_if (x.begin (), x.end (), std::back_inserter(y), p);

• C#

var y = x.FindAll(p);

• D

auto y = x.filter!(p);

• D

auto y = [1, 2, 3, 4, 5].filter!(a => a%2==0);

• Dart

var y = x.where(p).toList();

• Elixir

y = Enum.filter(x, p)

y = for item <- x, p.(item), do: item

• Erlang

Y = [I || I <- X, P(X)].

• Erlang

Y = lists:filter(P, X).

• Fortran

y = pack(x,mask=p(x))

• Go

y := make([]T, 0, len(x))
for _, v := range x{
	if p(v){
		y = append(y, v)
	}
}

• Haskell

y = filter p x

• JS

y = x.filter(p);

• Kotlin

val y = x.filter(p)

• Lisp

(setf y (remove-if-not p x))

• Lua

y = {}
for _, v in ipairs(x) do
	if p(v) then y[#y+1] = v end
end

• PHP

function p($element) {  /* .... */ }

$y = array_filter ($x, "p");

• Pascal

function Filter(vv:integer):boolean;

begin
  result :=  vv mod 2= 0;
end;

type TFilter=function(v:integer):boolean;

function FilteredArray(const x:TBoundArray;p:TFilter):TBoundArray;
var
  Idx: Integer;
  v : Integer;

begin
  setlength(result,high(x)+1);
  Idx := 0;
  for v in x do
    if p(v) then
    begin
      result[Idx] := v;
      inc(Idx);
    end;
  setlength(result,Idx);
end;
[...]
  y := FilteredArray(x,@Filter);

• Perl

# You can use a subroutine as your predicate
@primes_less_than_100 = grep { is_prime($_) } 1 .. 99;

# You can also write your predicate inline
@odd_numbers = grep { $_%2 == 1 } 1 .. 99;

• Python

y = filter(p, x) 

• Python

y = [element for element in x if p(element)]

• Ruby

y = x.select(&:p)

• Rust

let y: Vec<_> = x.iter().filter(p).collect();

• Scala

val y = x.filter(p)

• Scheme

(define y (filter p x))