Search results

intersection :: forall k a b. Ord k => Map k a -> Map k b -> Map k a

Compute the intersection of two maps, preferring values from the first map in the case of duplicate keys.

intersection :: forall a. Ord a => Set a -> Set a -> Set a

The set of elements which are in both the first and second set

intersection :: forall a. Ord a => NonEmptySet a -> NonEmptySet a -> Maybe (NonEmptySet a)

The set of elements which are in both the first and second set. Nothing if the sets are disjoint.

intersection :: forall k v. Hashable k => HashMap k v -> HashMap k v -> HashMap k v

Intersect two maps.

intersection :: forall a. Hashable a => HashSet a -> HashSet a -> HashSet a

Intersect two sets.

intersection :: forall a. Ord a => OrdSeq a -> OrdSeq a -> OrdSeq a

O(n*log(n)), where n is the length of the longer sequence. Create a new sequence containing only elements which are common to both sequences.

intersection :: forall a. Hashable a => MultiSet a -> MultiSet a -> MultiSet a

intersection :: forall a. Ord a => Interval a -> Interval a -> Maybe (Interval a)

The overlapping portion of two intervals, if any.

intersectionWith :: forall k a b c. Ord k => (a -> b -> c) -> Map k a -> Map k b -> Map k c

Compute the intersection of two maps, using the specified function to combine values for duplicate keys.

intersectionWith :: forall k a b c. Hashable k => (a -> b -> c) -> HashMap k a -> HashMap k b -> HashMap k c

Intersect two maps, combining the values for keys that appear in both maps using the given function.

intersectionWith (-) (singleton 0 3) (singleton 0 2) == singleton 0 1