/usr/share/doc/libghc-unordered-containers-doc/html/Data-HashSet.html is in libghc-unordered-containers-doc 0.2.5.0-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 | <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"><html xmlns="http://www.w3.org/1999/xhtml"><head><meta http-equiv="Content-Type" content="text/html; charset=UTF-8" /><title>Data.HashSet</title><link href="ocean.css" rel="stylesheet" type="text/css" title="Ocean" /><script src="haddock-util.js" type="text/javascript"></script><script type="text/javascript">//<![CDATA[
window.onload = function () {pageLoad();setSynopsis("mini_Data-HashSet.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-HashSet.html">Source</a></li><li><a href="index.html">Contents</a></li><li><a href="doc-index.html">Index</a></li></ul><p class="caption">unordered-containers-0.2.5.0: Efficient hashing-based container types</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Portability</th><td>portable</td></tr><tr><th>Stability</th><td>provisional</td></tr><tr><th>Maintainer</th><td>johan.tibell@gmail.com</td></tr><tr><th>Safe Haskell</th><td>None</td></tr></table><p class="caption">Data.HashSet</p></div><div id="table-of-contents"><p class="caption">Contents</p><ul><li><a href="#g:1">Construction
</a></li><li><a href="#g:2">Combine
</a></li><li><a href="#g:3">Basic interface
</a></li><li><a href="#g:4">Transformations
</a></li><li><a href="#g:5">Difference and intersection
</a></li><li><a href="#g:6">Folds
</a></li><li><a href="#g:7">Filter
</a><ul><li><a href="#g:8">Lists
</a></li></ul></li></ul></div><div id="description"><p class="caption">Description</p><div class="doc"><p>A set of <em>hashable</em> values. A set cannot contain duplicate items.
A <code><a href="Data-HashSet.html#t:HashSet">HashSet</a></code> makes no guarantees as to the order of its elements.
</p><p>The implementation is based on <em>hash array mapped trie</em>. A
<code><a href="Data-HashSet.html#t:HashSet">HashSet</a></code> is often faster than other tree-based set types,
especially when value comparison is expensive, as in the case of
strings.
</p><p>Many operations have a average-case complexity of <em>O(log n)</em>. The
implementation uses a large base (i.e. 16) so in practice these
operations are constant time.
</p></div></div><div id="synopsis"><p id="control.syn" class="caption expander" onclick="toggleSection('syn')">Synopsis</p><ul id="section.syn" class="hide" onclick="toggleSection('syn')"><li class="src short"><span class="keyword">data</span> <a href="#t:HashSet">HashSet</a> a</li><li class="src short"><a href="#v:empty">empty</a> :: <a href="Data-HashSet.html#t:HashSet">HashSet</a> a</li><li class="src short"><a href="#v:singleton">singleton</a> :: <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a => a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a</li><li class="src short"><a href="#v:union">union</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a</li><li class="src short"><a href="#v:unions">unions</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => [<a href="Data-HashSet.html#t:HashSet">HashSet</a> a] -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a</li><li class="src short"><a href="#v:null">null</a> :: <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bool.html#t:Bool">Bool</a></li><li class="src short"><a href="#v:size">size</a> :: <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a></li><li class="src short"><a href="#v:member">member</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bool.html#t:Bool">Bool</a></li><li class="src short"><a href="#v:insert">insert</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a</li><li class="src short"><a href="#v:delete">delete</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a</li><li class="src short"><a href="#v:map">map</a> :: (<a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> b) => (a -> b) -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> b</li><li class="src short"><a href="#v:difference">difference</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a</li><li class="src short"><a href="#v:intersection">intersection</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a</li><li class="src short"><a href="#v:foldl-39-">foldl'</a> :: (a -> b -> a) -> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> b -> a</li><li class="src short"><a href="#v:foldr">foldr</a> :: (b -> a -> a) -> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> b -> a</li><li class="src short"><a href="#v:filter">filter</a> :: (a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bool.html#t:Bool">Bool</a>) -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a</li><li class="src short"><a href="#v:toList">toList</a> :: <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> [a]</li><li class="src short"><a href="#v:fromList">fromList</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => [a] -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><span class="keyword">data</span> <a name="t:HashSet" class="def">HashSet</a> a <a href="src/Data-HashSet.html#HashSet" class="link">Source</a></p><div class="doc"><p>A set of values. A set cannot contain duplicate values.
</p></div><div class="subs instances"><p id="control.i:HashSet" class="caption collapser" onclick="toggleSection('i:HashSet')">Instances</p><div id="section.i:HashSet" class="show"><table><tr><td class="src"><a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Typeable-Internal.html#t:Typeable1">Typeable1</a> <a href="Data-HashSet.html#t:HashSet">HashSet</a></td><td class="doc empty"> </td></tr><tr><td class="src"><a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Foldable.html#t:Foldable">Foldable</a> <a href="Data-HashSet.html#t:HashSet">HashSet</a></td><td class="doc empty"> </td></tr><tr><td class="src">(<a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a) => <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> (<a href="Data-HashSet.html#t:HashSet">HashSet</a> a)</td><td class="doc empty"> </td></tr><tr><td class="src">(<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Data.html#t:Data">Data</a> a, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Data.html#t:Data">Data</a> (<a href="Data-HashSet.html#t:HashSet">HashSet</a> a)</td><td class="doc empty"> </td></tr><tr><td class="src">(<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Text-Read.html#t:Read">Read</a> a) => <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Text-Read.html#t:Read">Read</a> (<a href="Data-HashSet.html#t:HashSet">HashSet</a> a)</td><td class="doc empty"> </td></tr><tr><td class="src"><a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Text-Show.html#t:Show">Show</a> a => <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Text-Show.html#t:Show">Show</a> (<a href="Data-HashSet.html#t:HashSet">HashSet</a> a)</td><td class="doc empty"> </td></tr><tr><td class="src">(<a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a) => <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Monoid.html#t:Monoid">Monoid</a> (<a href="Data-HashSet.html#t:HashSet">HashSet</a> a)</td><td class="doc empty"> </td></tr><tr><td class="src"><a href="/usr/share/doc/ghc-doc/html/libraries/deepseq-1.3.0.1/Control-DeepSeq.html#t:NFData">NFData</a> a => <a href="/usr/share/doc/ghc-doc/html/libraries/deepseq-1.3.0.1/Control-DeepSeq.html#t:NFData">NFData</a> (<a href="Data-HashSet.html#t:HashSet">HashSet</a> a)</td><td class="doc empty"> </td></tr></table></div></div></div><h1 id="g:1">Construction
</h1><div class="top"><p class="src"><a name="v:empty" class="def">empty</a> :: <a href="Data-HashSet.html#t:HashSet">HashSet</a> a<a href="src/Data-HashSet.html#empty" class="link">Source</a></p><div class="doc"><p><em>O(1)</em> Construct an empty set.
</p></div></div><div class="top"><p class="src"><a name="v:singleton" class="def">singleton</a> :: <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a => a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a<a href="src/Data-HashSet.html#singleton" class="link">Source</a></p><div class="doc"><p><em>O(1)</em> Construct a set with a single element.
</p></div></div><h1 id="g:2">Combine
</h1><div class="top"><p class="src"><a name="v:union" class="def">union</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a<a href="src/Data-HashSet.html#union" class="link">Source</a></p><div class="doc"><p><em>O(n+m)</em> Construct a set containing all elements from both sets.
</p><p>To obtain good performance, the smaller set must be presented as
the first argument.
</p></div></div><div class="top"><p class="src"><a name="v:unions" class="def">unions</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => [<a href="Data-HashSet.html#t:HashSet">HashSet</a> a] -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a<a href="src/Data-HashSet.html#unions" class="link">Source</a></p><div class="doc"><p>Construct a set containing all elements from a list of sets.
</p></div></div><h1 id="g:3">Basic interface
</h1><div class="top"><p class="src"><a name="v:null" class="def">null</a> :: <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bool.html#t:Bool">Bool</a><a href="src/Data-HashSet.html#null" class="link">Source</a></p><div class="doc"><p><em>O(1)</em> Return <code><a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bool.html#v:True">True</a></code> if this set is empty, <code><a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bool.html#v:False">False</a></code> otherwise.
</p></div></div><div class="top"><p class="src"><a name="v:size" class="def">size</a> :: <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Int.html#t:Int">Int</a><a href="src/Data-HashSet.html#size" class="link">Source</a></p><div class="doc"><p><em>O(n)</em> Return the number of elements in this set.
</p></div></div><div class="top"><p class="src"><a name="v:member" class="def">member</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bool.html#t:Bool">Bool</a><a href="src/Data-HashSet.html#member" class="link">Source</a></p><div class="doc"><p><em>O(min(n,W))</em> Return <code><a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bool.html#v:True">True</a></code> if the given value is present in this
set, <code><a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bool.html#v:False">False</a></code> otherwise.
</p></div></div><div class="top"><p class="src"><a name="v:insert" class="def">insert</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a<a href="src/Data-HashSet.html#insert" class="link">Source</a></p><div class="doc"><p><em>O(min(n,W))</em> Add the specified value to this set.
</p></div></div><div class="top"><p class="src"><a name="v:delete" class="def">delete</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a<a href="src/Data-HashSet.html#delete" class="link">Source</a></p><div class="doc"><p><em>O(min(n,W))</em> Remove the specified value from this set if
present.
</p></div></div><h1 id="g:4">Transformations
</h1><div class="top"><p class="src"><a name="v:map" class="def">map</a> :: (<a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> b) => (a -> b) -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> b<a href="src/Data-HashSet.html#map" class="link">Source</a></p><div class="doc"><p><em>O(n)</em> Transform this set by applying a function to every value.
The resulting set may be smaller than the source.
</p></div></div><h1 id="g:5">Difference and intersection
</h1><div class="top"><p class="src"><a name="v:difference" class="def">difference</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a<a href="src/Data-HashSet.html#difference" class="link">Source</a></p><div class="doc"><p><em>O(n)</em> Difference of two sets. Return elements of the first set
not existing in the second.
</p></div></div><div class="top"><p class="src"><a name="v:intersection" class="def">intersection</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a<a href="src/Data-HashSet.html#intersection" class="link">Source</a></p><div class="doc"><p><em>O(n)</em> Intersection of two sets. Return elements present in both
the first set and the second.
</p></div></div><h1 id="g:6">Folds
</h1><div class="top"><p class="src"><a name="v:foldl-39-" class="def">foldl'</a> :: (a -> b -> a) -> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> b -> a<a href="src/Data-HashSet.html#foldl%27" class="link">Source</a></p><div class="doc"><p><em>O(n)</em> Reduce this set by applying a binary operator to all
elements, using the given starting value (typically the
left-identity of the operator). Each application of the operator
is evaluated before before using the result in the next
application. This function is strict in the starting value.
</p></div></div><div class="top"><p class="src"><a name="v:foldr" class="def">foldr</a> :: (b -> a -> a) -> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> b -> a<a href="src/Data-HashSet.html#foldr" class="link">Source</a></p><div class="doc"><p><em>O(n)</em> Reduce this set by applying a binary operator to all
elements, using the given starting value (typically the
right-identity of the operator).
</p></div></div><h1 id="g:7">Filter
</h1><div class="top"><p class="src"><a name="v:filter" class="def">filter</a> :: (a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Bool.html#t:Bool">Bool</a>) -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a<a href="src/Data-HashSet.html#filter" class="link">Source</a></p><div class="doc"><p><em>O(n)</em> Filter this set by retaining only elements satisfying a
predicate.
</p></div></div><h2 id="g:8">Lists
</h2><div class="top"><p class="src"><a name="v:toList" class="def">toList</a> :: <a href="Data-HashSet.html#t:HashSet">HashSet</a> a -> [a]<a href="src/Data-HashSet.html#toList" class="link">Source</a></p><div class="doc"><p><em>O(n)</em> Return a list of this set's elements. The list is
produced lazily.
</p></div></div><div class="top"><p class="src"><a name="v:fromList" class="def">fromList</a> :: (<a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Eq.html#t:Eq">Eq</a> a, <a href="/usr/share/doc/libghc-hashable-doc/html/Data-Hashable.html#t:Hashable">Hashable</a> a) => [a] -> <a href="Data-HashSet.html#t:HashSet">HashSet</a> a<a href="src/Data-HashSet.html#fromList" class="link">Source</a></p><div class="doc"><p><em>O(n*min(W, n))</em> Construct a set from a list of elements.
</p></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.13.2</p></div></body></html>
|