If we wanted to make it faster for bigger lists, we could build a `HashSet` with the `items` list, which would provide a way to check if a given item from `list` is present in `items` in logarithm time http://blog.josephwilk.net/elixir/sets-in-elixir.html . That said, the complexity could be reduced to O(n * log m).

Is this `pull` operation usually implemented in standard libraries?