• Clojure

(def y 
  (eduction (filter P)
            (map T))
            x)

• C++

template <typename SeqT>
auto transform_copy_if(const SeqT i, auto p, auto f)
{
 using namespace std;

 SeqT o;

 for_each(begin(i), end(i),
          [&](const auto& x) {
              if(p(x))
               o.push_back(f(x));
          }
         );

 return o;
}

• C#

var y = x.Where(P).Select(T).ToList();

• D

y = x.filter!(P).map!(T);

• Elixir

y = x
|> Enum.filter(&P/1)
|> Enum.map(&P(&T/1)

• Fortran

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

• Go

var y []Result
for _, e := range x {
	if P(e) {
		y = append(y, T(e))
	}
}

• Groovy

def y = x.findAll(p).collect(t)

• Haskell

y = (map t . filter p) x

• JS

y = x.filter(e => P(e)).map(e => T(e))

• Pascal

type
  TListPredicate = function(e: pointer): Boolean;
  TListElementFunc = function(e: pointer): pointer;

function NewList(X: TList; P: TListPredicate; T: TListElementFunc): TList;
var
  e: pointer;
begin
  Result := TList.Create;
  for e in X do
  begin
    if P(e) then
      Result.Add(T(e));
  end;
end;

• Perl

my @y = map { T($_) } grep { P($_) } @x;

• Python

y = [T(e) for e in x if P(e)]

• Python

y = list(map(T, filter(P, x)))

• Ruby

y = x.each_with_object([]){|e, ar| ar << t(e) if p(e)}

• Ruby

y = x.filter_map{|e| t(e) if p(e)}

• Rust

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

• Scala

list.collect { case x if p(x) => T(x) }