Set.md

Module Elm.Set

A set of unique values. The values can be any type with an Ord instance.

This is implemented in terms of Purescript's Data.Set, so you can also use functions from that module on a Set.

remove

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

Remove a value from a set. If the value is not found, no changes are made.

Equivalent to Purescript's delete.

intersect

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

Get the intersection of two sets. Keeps values that appear in both sets.

Equivalent to Purescript's intersection.

diff

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

Get the difference between the first set and the second. Keeps values that do not appear in the second set.

Equivalent to Purescript's difference.

filter

filter :: forall a. Ord a => (a -> Bool) -> Set a -> Set a

Create a new set consisting only of elements which satisfy a predicate.

partition

partition :: forall a. Ord a => (a -> Bool) -> Set a -> Tuple (Set a) (Set a)

Create two new sets; the first consisting of elements which satisfy a predicate, the second consisting of elements which do not.

map

map :: forall a b. Ord a => Ord b => (a -> b) -> Set a -> Set b

Map a function onto a set, creating a new set with no duplicates.

toList

toList :: forall a f. Unfoldable f => Ord a => Set a -> f a

Convert a set into a list, sorted from lowest to highest.

• Uses a polymorphic container type to accommodate List and Array, among others. *

fromList

fromList :: forall a f. Foldable f => Ord a => f a -> Set a

Convert a list into a set, removing any duplicates.

• Uses a polymorphic container type to accommodate List and `Array, among others. *

Re-exported from Data.Foldable:

foldr

foldr :: forall a b f. Foldable f => (a -> b -> b) -> b -> f a -> b

Re-exported from Data.Set:

Set

data Set a

Set a represents a set of values of type a

Instances

(Eq a) => Eq (Set a)
Eq1 Set
(Show a) => Show (Set a)
(Ord a) => Ord (Set a)
Ord1 Set
(Ord a) => Monoid (Set a)
(Ord a) => Semigroup (Set a)
Foldable Set

union

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

Form the union of two sets

Running time: O(n * log(m))

size

size :: forall a. Set a -> Int

Find the size of a set

singleton

singleton :: forall a. a -> Set a

Create a set with one element

member

member :: forall a. Ord a => a -> Set a -> Boolean

Test if a value is a member of a set

isEmpty

isEmpty :: forall a. Set a -> Boolean

Test if a set is empty

insert

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

Insert a value into a set

empty

empty :: forall a. Set a

An empty set

Re-exported from Elm.Foldable:

foldl

foldl :: forall a b f. Foldable f => (a -> b -> b) -> b -> f a -> b

Reduce a container from the left.

Equivalent to Purescript's foldl, but the function you supply is flipped.