Search results

intersect :: forall a. Eq a => Array a -> Array a -> Array a

Calculate the intersection of two arrays, creating a new array. Note that duplicates in the first array are preserved while duplicates in the second array are removed.

intersect [1, 1, 2] [2, 2, 1] = [1, 1, 2]

intersect :: forall a. Eq a => NonEmptyArray a -> NonEmptyArray a -> Array a

intersect :: forall a. Eq a => List a -> List a -> List a

Calculate the intersection of two lists.

Running time: O(n^2)

intersect :: forall a. Eq a => List a -> List a -> List a

Calculate the intersection of two lists.

Running time: O(n^2)

intersect :: forall a. Eq a => NonEmptyList a -> NonEmptyList a -> NonEmptyList a

intersect :: forall a. Eq a => OSet a -> OSet a -> OSet a

intersect :: Option Tooltip Boolean

intersect :: forall a. Eq a => ArrayView a -> ArrayView a -> ArrayView a

intersect :: forall a. Eq a => NonEmptyArrayView a -> NonEmptyArrayView a -> ArrayView a

intersect :: forall a. Eq a => List a -> List a -> List a

Calculate the intersection of two lists, creating a new list. Note that duplicates in the first list are preserved while duplicates in the second list are removed.

Running time: O(n*m).

Intersect :: BinaryOperator

intersect' :: forall a. Eq a => NonEmptyArray a -> Array a -> Array a

intersects :: Range -> Range -> Effect Boolean

intersects :: LatLngBounds -> LatLngBounds -> Boolean

intersect' :: forall a. Eq a => NonEmptyArrayView a -> ArrayView a -> ArrayView a

intersect_ :: Number -> Number -> Number -> Number -> Rect_ -> Effect Rect_

intersects :: Relation

intersectBy :: forall a. (a -> a -> Boolean) -> Array a -> Array a -> Array a

Calculate the intersection of two arrays, using the specified equivalence relation to compare elements, creating a new array. Note that duplicates in the first array are preserved while duplicates in the second array are removed.

mod3eq a b = a `mod` 3 == b `mod` 3
intersectBy mod3eq [1, 2, 3] [4, 6, 7] = [1, 3]

intersectBy :: forall a. (a -> a -> Boolean) -> NonEmptyArray a -> NonEmptyArray a -> Array a

intersectBy :: forall a. (a -> a -> Boolean) -> List a -> List a -> List a

Calculate the intersection of two lists, using the specified function to determine equality of elements.

Running time: O(n^2)

intersectBy :: forall a. (a -> a -> Boolean) -> List a -> List a -> List a

Calculate the intersection of two lists, using the specified function to determine equality of elements.

Running time: O(n^2)

intersectBy :: forall a. (a -> a -> Boolean) -> NonEmptyList a -> NonEmptyList a -> NonEmptyList a

intersectBy :: forall a. (a -> a -> Boolean) -> OSet a -> OSet a -> OSet a

intersectBy :: forall a. (a -> a -> Boolean) -> ArrayView a -> ArrayView a -> ArrayView a

intersectBy :: forall a. (a -> a -> Boolean) -> NonEmptyArrayView a -> NonEmptyArrayView a -> ArrayView a

intersectBy :: forall a. (a -> a -> Boolean) -> List a -> List a -> List a

Calculate the intersection of two lists, using the specified equivalence relation to compare elements, creating a new list. Note that duplicates in the first list are preserved while duplicates in the second list are removed.

Running time: O(n*m).

intersects_ :: Number -> Number -> Number -> Number -> Rect_ -> Effect Boolean

intersects_ :: Number -> Number -> Number -> Number -> Number -> Number -> Number -> Number -> Boolean

intersectBy' :: forall a. (a -> a -> Boolean) -> NonEmptyArray a -> Array a -> Array a

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

IntersectAll :: BinaryOperator

intersectBy' :: forall a. (a -> a -> Boolean) -> NonEmptyArrayView a -> ArrayView a -> ArrayView a

intersectRect_ :: Rect_ -> Rect_ -> Effect Rect_

intersectsRect_ :: Rect_ -> Rect_ -> Effect Boolean

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