Be concise.
Be useful.
All contributions dictatorially edited by webmasters to match personal tastes.
Please do not paste any copyright violating material.
Please try to avoid dependencies to third-party libraries and frameworks.
(remove #{x} items)
items.remove(x);
items.removeWhere((y)=>y==x);
Enum.filter(items, fn v -> v != x end)
items = pack (items,items != x)
j := 0 for i, v := range items { if v != x { items[j] = items[i] j++ } } items = items[:j]
j := 0 for i, v := range items { if v != x { items[j] = items[i] j++ } } for k := j; k < len(items); k++ { items[k] = nil } items = items[:j]
items2 := make([]T, 0, len(items)) for _, v := range items { if v != x { items2 = append(items2, v) } }
filter (/= x) items
const newlist = items.filter(y => x !== y)
$newItems = array_diff($items, [$x]);
var i: integer; for i:= items.count-1 downto 0 do if items[i] = x then items.delete(i);
my @filtered = grep { $x ne $_ } @items;
newlist = [item for item in items if item != x]
items.delete(x)
items = items.into_iter().filter(|&item| item != x).collect();
items.retain(|&item| item != x);
items.filter(_ != x)
items reject: [: y | y = x ]