D idom for removing array elements

[albert-j via Digitalmars-d-learn]

What is the D idiom for removing array elements that are present 
in another array?

Is this the right/fastest way?

int[] a = [1, 2, 3, 4, 5, 6, 7, 4];
int[] b = [3, 4, 6];
auto c = a.remove!(x => b.canFind(x));
assert(c == [1, 2, 5, 7]);