# (a, b) -> b

Extract the second component of a pair.

uncurry converts a curried function to a function on pairs.
Extract the first component of a pair.

True if the graph has any edges of the form (A, A).
*O(n)*. Build a map from a list of key/value pairs are in ascending order.
> fromAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")]
> fromAscList [(3,"b"), (5,"a"), (5,"b")] == fromList [(3, "b"), (5, "b")]

*O(n)*. Build a map from a list of key/value pairs are in ascending order and all distinct. *The precondition (input list is strictly ascending) is not checked.*
> fromDistinctAscList [(3,"b"), (5,"a")] == fromList [(3, "b"), (5, "a")]

*O(n*min(n,W))*. Create a map from a list of key/value pairs.
> fromList [] == empty
> fromList [(5,"a"), (3,"b"), (5, "c")] == fromList [(5,"c"), (3,"b")]
> fromList [(5,"c"), (3,"b"), (5, "a")] == fromList [(5,"a"), (3,"b")]

> { if | g1 -> e1 | g2 -> e2 }

lookup key assocs looks up a key in an association list.
Show more results