Set -is:module

A set of values a.

Invariant preserving version of Set from the containers packages, suitable for use with Uniplate. Use toSet to construct values, and fromSet to deconstruct values.

This is a variation on Data.Set.Set that remembers the original order of elements. This ensures that ordering is not lost when formatting Dhall code

A hash set, based on an STM-specialized hash array mapped trie.

A set of values a.

Set the value to a new value.

Set its value to the provided one

Lists representing sets. The Listable tiers enumeration will not have repeated sets.

> take 6 (list :: [Set Nat])
[Set [],Set [0],Set [1],Set [0,1],Set [2],Set [0,2]]

The abstract type of a Set. Its interface is a suitable subset of IntSet.

Type tag for normal aggregatings set

A set of unique elements. The element type needs to be an instance of the same Key typeclass that is used for keys in the Map type above. Instances are already provided for many common element types. Set implements Foldable, Monoid, etc so many common operations such as foldr to walk the elements and reduce them, length to return the size of the collection, null to test whether is empty, and (<>) to take the union of two sets are available. To convert to other collection types see fromSet below. (this is a thin wrapper around unordered-containers's HashSet, but if you use the conversion functions to extract a list the list will be ordered according to the elements' Ord instance)

Associate a trait attribute on a response

#{a set}