Skip to content
This repository was archived by the owner on May 7, 2023. It is now read-only.

Files

Latest commit

 

History

History
24 lines (19 loc) · 645 Bytes

intersection-by.md

File metadata and controls

24 lines (19 loc) · 645 Bytes
title type tags cover dateModified
List intersection based on function
snippet
list
function
duck-plants
2020-11-02 19:28:05 +0200

Returns a list of elements that exist in both lists, after applying the provided function to each list element of both.

  • Create a set, using map() to apply fn to each element in b.
  • Use a list comprehension in combination with fn on a to 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]