difference -package:dhall

Difference between two maps (based on keys).

difference (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 3 "b"

Difference between two sets.

Difference of two maps. Return elements of the first map not existing in the second map.

difference (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 3 "b"

Difference of two sets. Return elements of the first set not existing in the second set.

difference (fromList [5, 3]) (fromList [5, 7]) == singleton 3

Difference of two maps. Return elements of the first map not existing in the second.

Difference of two maps. Return elements of the first map not existing in the second.

Difference of two sets. Return elements of the first set not existing in the second.

>>> HashSet.difference (HashSet.fromList [1,2,3]) (HashSet.fromList [2,3,4])
fromList [1]

Difference between two maps (based on keys).

difference (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 3 "b"

Difference between two sets.

O(m*log(n/m + 1)), m <= n. Difference of two maps. Return elements of the first map not existing in the second map.

difference (fromList [(5, "a"), (3, "b")]) (fromList [(5, "A"), (7, "C")]) == singleton 3 "b"

O(m*log(n/m + 1)), m <= n. Difference of two sets.

Get the difference of two containers.

O(m * log (n/m + 1)), m <= n. Difference of two maps. Return elements of the first map not existing in the second map.

O(n+m). Difference of two multisets. The implementation uses an efficient hedge algorithm comparable with hedge-union.

O(n+m). Difference of two multisets. The implementation uses an efficient hedge algorithm comparable with hedge-union.

difference sActed sOrig is the element m such that sActed = m `act' sOrig.

Difference between a set of primes and a set of integers.