Data.LinkedHashSet

Documentation

data LinkedHashSet a

A set of values. A set cannot contain duplicate values.

Instances

Show a => Show (LinkedHashSet a)

NFData a => NFData (LinkedHashSet a)

Construction

empty :: LinkedHashSet a

O(1) Construct an empty set.

singleton :: (Eq a, Hashable a) => a -> LinkedHashSet a

O(1) Construct a set with a single element.

Combine

Basic interface

null :: LinkedHashSet a -> Bool

O(1) Return True if this set is empty, False otherwise.

size :: LinkedHashSet a -> Int

O(1) Return the number of elements in this set.

member :: (Eq a, Hashable a) => a -> LinkedHashSet a -> Bool

O(min(n,W)) Return True if the given value is present in this set, False otherwise.

insert :: (Eq a, Hashable a) => a -> LinkedHashSet a -> LinkedHashSet a

O(min(n,W)) Add the specified value to this set.

delete :: (Eq a, Hashable a) => a -> LinkedHashSet a -> LinkedHashSet a

O(min(n,W)) Remove the specified value from this set if present.

Transformations

Difference and intersection

Folds

Filter

Lists

toList :: LinkedHashSet a -> [a]

O(n) Return a list of this set's elements. The list is produced lazily.

fromList :: (Eq a, Hashable a) => [a] -> LinkedHashSet a

O(n*min(W, n)) Construct a set from a list of elements.