665 B
665 B
title, tags, cover, firstSeen, lastUpdated
| title | tags | cover | firstSeen | lastUpdated |
|---|---|---|---|---|
| List intersection based on function | list,function | duck-plants | 2019-08-20T15:16:27+03:00 | 2020-11-02T19:28:05+02:00 |
Returns a list of elements that exist in both lists, after applying the provided function to each list element of both.
- Create a
set, usingmap()to applyfnto each element inb. - Use a list comprehension in combination with
fnonato only keep values contained in both lists.
def intersection_by(a, b, fn):
_b = set(map(fn, b))
return [item for item in a if fn(item) in _b]
from math import floor
intersection_by([2.1, 1.2], [2.3, 3.4], floor) # [2.1]