/usr/share/doc/libghc-unordered-containers-doc/html/src/Data-HashSet.html is in libghc-unordered-containers-doc 0.2.3.0-3build2.
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 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 | <?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html>
<head>
<!-- Generated by HsColour, http://code.haskell.org/~malcolm/hscolour/ -->
<title>Data/HashSet.hs</title>
<link type='text/css' rel='stylesheet' href='hscolour.css' />
</head>
<body>
<pre><a name="line-1"></a><span class='hs-comment'>{-# LANGUAGE CPP, DeriveDataTypeable #-}</span>
<a name="line-2"></a>
<a name="line-3"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-4"></a><span class='hs-comment'>-- |</span>
<a name="line-5"></a><span class='hs-comment'>-- Module : Data.HashSet</span>
<a name="line-6"></a><span class='hs-comment'>-- Copyright : 2011 Bryan O'Sullivan</span>
<a name="line-7"></a><span class='hs-comment'>-- License : BSD-style</span>
<a name="line-8"></a><span class='hs-comment'>-- Maintainer : johan.tibell@gmail.com</span>
<a name="line-9"></a><span class='hs-comment'>-- Stability : provisional</span>
<a name="line-10"></a><span class='hs-comment'>-- Portability : portable</span>
<a name="line-11"></a><span class='hs-comment'>--</span>
<a name="line-12"></a><span class='hs-comment'>-- A set of /hashable/ values. A set cannot contain duplicate items.</span>
<a name="line-13"></a><span class='hs-comment'>-- A 'HashSet' makes no guarantees as to the order of its elements.</span>
<a name="line-14"></a><span class='hs-comment'>--</span>
<a name="line-15"></a><span class='hs-comment'>-- The implementation is based on /hash array mapped trie/. A</span>
<a name="line-16"></a><span class='hs-comment'>-- 'HashSet' is often faster than other tree-based set types,</span>
<a name="line-17"></a><span class='hs-comment'>-- especially when value comparison is expensive, as in the case of</span>
<a name="line-18"></a><span class='hs-comment'>-- strings.</span>
<a name="line-19"></a><span class='hs-comment'>--</span>
<a name="line-20"></a><span class='hs-comment'>-- Many operations have a average-case complexity of /O(log n)/. The</span>
<a name="line-21"></a><span class='hs-comment'>-- implementation uses a large base (i.e. 16) so in practice these</span>
<a name="line-22"></a><span class='hs-comment'>-- operations are constant time.</span>
<a name="line-23"></a>
<a name="line-24"></a><span class='hs-keyword'>module</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>HashSet</span>
<a name="line-25"></a> <span class='hs-layout'>(</span>
<a name="line-26"></a> <span class='hs-conid'>HashSet</span>
<a name="line-27"></a>
<a name="line-28"></a> <span class='hs-comment'>-- * Construction</span>
<a name="line-29"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>empty</span>
<a name="line-30"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>singleton</span>
<a name="line-31"></a>
<a name="line-32"></a> <span class='hs-comment'>-- * Combine</span>
<a name="line-33"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>union</span>
<a name="line-34"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>unions</span>
<a name="line-35"></a>
<a name="line-36"></a> <span class='hs-comment'>-- * Basic interface</span>
<a name="line-37"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>null</span>
<a name="line-38"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>size</span>
<a name="line-39"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>member</span>
<a name="line-40"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>insert</span>
<a name="line-41"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>delete</span>
<a name="line-42"></a>
<a name="line-43"></a> <span class='hs-comment'>-- * Transformations</span>
<a name="line-44"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>map</span>
<a name="line-45"></a>
<a name="line-46"></a> <span class='hs-comment'>-- * Difference and intersection</span>
<a name="line-47"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>difference</span>
<a name="line-48"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>intersection</span>
<a name="line-49"></a>
<a name="line-50"></a> <span class='hs-comment'>-- * Folds</span>
<a name="line-51"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>foldl'</span>
<a name="line-52"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>foldr</span>
<a name="line-53"></a>
<a name="line-54"></a> <span class='hs-comment'>-- * Filter</span>
<a name="line-55"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>filter</span>
<a name="line-56"></a>
<a name="line-57"></a> <span class='hs-comment'>-- ** Lists</span>
<a name="line-58"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>toList</span>
<a name="line-59"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>fromList</span>
<a name="line-60"></a> <span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-61"></a>
<a name="line-62"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Control</span><span class='hs-varop'>.</span><span class='hs-conid'>DeepSeq</span> <span class='hs-layout'>(</span><span class='hs-conid'>NFData</span><span class='hs-layout'>(</span><span class='hs-keyglyph'>..</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-63"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>HashMap</span><span class='hs-varop'>.</span><span class='hs-conid'>Base</span> <span class='hs-layout'>(</span><span class='hs-conid'>HashMap</span><span class='hs-layout'>,</span> <span class='hs-varid'>foldrWithKey</span><span class='hs-layout'>)</span>
<a name="line-64"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Hashable</span> <span class='hs-layout'>(</span><span class='hs-conid'>Hashable</span><span class='hs-layout'>)</span>
<a name="line-65"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Monoid</span> <span class='hs-layout'>(</span><span class='hs-conid'>Monoid</span><span class='hs-layout'>(</span><span class='hs-keyglyph'>..</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-66"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Prelude</span> <span class='hs-varid'>hiding</span> <span class='hs-layout'>(</span><span class='hs-varid'>filter</span><span class='hs-layout'>,</span> <span class='hs-varid'>foldr</span><span class='hs-layout'>,</span> <span class='hs-varid'>map</span><span class='hs-layout'>,</span> <span class='hs-varid'>null</span><span class='hs-layout'>)</span>
<a name="line-67"></a><span class='hs-keyword'>import</span> <span class='hs-keyword'>qualified</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Foldable</span> <span class='hs-keyword'>as</span> <span class='hs-conid'>Foldable</span>
<a name="line-68"></a><span class='hs-keyword'>import</span> <span class='hs-keyword'>qualified</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>HashMap</span><span class='hs-varop'>.</span><span class='hs-conid'>Lazy</span> <span class='hs-keyword'>as</span> <span class='hs-conid'>H</span>
<a name="line-69"></a><span class='hs-keyword'>import</span> <span class='hs-keyword'>qualified</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>List</span> <span class='hs-keyword'>as</span> <span class='hs-conid'>List</span>
<a name="line-70"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Typeable</span> <span class='hs-layout'>(</span><span class='hs-conid'>Typeable</span><span class='hs-layout'>)</span>
<a name="line-71"></a>
<a name="line-72"></a><span class='hs-cpp'>#if defined(__GLASGOW_HASKELL__)</span>
<a name="line-73"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Data</span> <span class='hs-varid'>hiding</span> <span class='hs-layout'>(</span><span class='hs-conid'>Typeable</span><span class='hs-layout'>)</span>
<a name="line-74"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>GHC</span><span class='hs-varop'>.</span><span class='hs-conid'>Exts</span> <span class='hs-layout'>(</span><span class='hs-varid'>build</span><span class='hs-layout'>)</span>
<a name="line-75"></a><span class='hs-cpp'>#endif</span>
<a name="line-76"></a>
<a name="line-77"></a><a name="HashSet"></a><span class='hs-comment'>-- | A set of values. A set cannot contain duplicate values.</span>
<a name="line-78"></a><a name="HashSet"></a><span class='hs-keyword'>newtype</span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HashSet</span> <span class='hs-layout'>{</span>
<a name="line-79"></a> <span class='hs-varid'>asMap</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>HashMap</span> <span class='hs-varid'>a</span> <span class='hs-conid'>()</span>
<a name="line-80"></a> <span class='hs-layout'>}</span> <span class='hs-keyword'>deriving</span> <span class='hs-layout'>(</span><span class='hs-conid'>Typeable</span><span class='hs-layout'>)</span>
<a name="line-81"></a>
<a name="line-82"></a><a name="instance%20NFData%20(HashSet%20a)"></a><span class='hs-keyword'>instance</span> <span class='hs-layout'>(</span><span class='hs-conid'>NFData</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-conid'>NFData</span> <span class='hs-layout'>(</span><span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-83"></a> <span class='hs-varid'>rnf</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>rnf</span> <span class='hs-varop'>.</span> <span class='hs-varid'>asMap</span>
<a name="line-84"></a> <span class='hs-comment'>{-# INLINE rnf #-}</span>
<a name="line-85"></a>
<a name="line-86"></a><a name="instance%20Eq%20(HashSet%20a)"></a><span class='hs-keyword'>instance</span> <span class='hs-layout'>(</span><span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-conid'>Eq</span> <span class='hs-layout'>(</span><span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-87"></a> <span class='hs-comment'>-- This performs two passes over the tree.</span>
<a name="line-88"></a> <span class='hs-varid'>a</span> <span class='hs-varop'>==</span> <span class='hs-varid'>b</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>foldr</span> <span class='hs-varid'>f</span> <span class='hs-conid'>True</span> <span class='hs-varid'>b</span> <span class='hs-varop'>&&</span> <span class='hs-varid'>size</span> <span class='hs-varid'>a</span> <span class='hs-varop'>==</span> <span class='hs-varid'>size</span> <span class='hs-varid'>b</span>
<a name="line-89"></a> <span class='hs-keyword'>where</span> <span class='hs-varid'>f</span> <span class='hs-varid'>i</span> <span class='hs-keyglyph'>=</span> <span class='hs-layout'>(</span><span class='hs-varop'>&&</span> <span class='hs-varid'>i</span> <span class='hs-varop'>`member`</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span>
<a name="line-90"></a> <span class='hs-comment'>{-# INLINE (==) #-}</span>
<a name="line-91"></a>
<a name="line-92"></a><a name="instance%20Foldable.Foldable%20HashSet"></a><span class='hs-keyword'>instance</span> <span class='hs-conid'>Foldable</span><span class='hs-varop'>.</span><span class='hs-conid'>Foldable</span> <span class='hs-conid'>HashSet</span> <span class='hs-keyword'>where</span>
<a name="line-93"></a> <span class='hs-varid'>foldr</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>HashSet</span><span class='hs-varop'>.</span><span class='hs-varid'>foldr</span>
<a name="line-94"></a> <span class='hs-comment'>{-# INLINE foldr #-}</span>
<a name="line-95"></a>
<a name="line-96"></a><a name="instance%20Monoid%20(HashSet%20a)"></a><span class='hs-keyword'>instance</span> <span class='hs-layout'>(</span><span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-conid'>Monoid</span> <span class='hs-layout'>(</span><span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-97"></a> <span class='hs-varid'>mempty</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>empty</span>
<a name="line-98"></a> <span class='hs-comment'>{-# INLINE mempty #-}</span>
<a name="line-99"></a> <span class='hs-varid'>mappend</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>union</span>
<a name="line-100"></a> <span class='hs-comment'>{-# INLINE mappend #-}</span>
<a name="line-101"></a>
<a name="line-102"></a><a name="instance%20Show%20(HashSet%20a)"></a><span class='hs-keyword'>instance</span> <span class='hs-layout'>(</span><span class='hs-conid'>Show</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-conid'>Show</span> <span class='hs-layout'>(</span><span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-103"></a> <span class='hs-varid'>showsPrec</span> <span class='hs-varid'>d</span> <span class='hs-varid'>m</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>showParen</span> <span class='hs-layout'>(</span><span class='hs-varid'>d</span> <span class='hs-varop'>></span> <span class='hs-num'>10</span><span class='hs-layout'>)</span> <span class='hs-varop'>$</span>
<a name="line-104"></a> <span class='hs-varid'>showString</span> <span class='hs-str'>"fromList "</span> <span class='hs-varop'>.</span> <span class='hs-varid'>shows</span> <span class='hs-layout'>(</span><span class='hs-varid'>toList</span> <span class='hs-varid'>m</span><span class='hs-layout'>)</span>
<a name="line-105"></a>
<a name="line-106"></a><span class='hs-cpp'>#if __GLASGOW_HASKELL__</span>
<a name="line-107"></a><a name="instance%20Data%20(HashSet%20a)"></a><span class='hs-keyword'>instance</span> <span class='hs-layout'>(</span><span class='hs-conid'>Data</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-conid'>Data</span> <span class='hs-layout'>(</span><span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-108"></a> <span class='hs-varid'>gfoldl</span> <span class='hs-varid'>f</span> <span class='hs-varid'>z</span> <span class='hs-varid'>m</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>z</span> <span class='hs-varid'>fromList</span> <span class='hs-varop'>`f`</span> <span class='hs-varid'>toList</span> <span class='hs-varid'>m</span>
<a name="line-109"></a> <span class='hs-varid'>toConstr</span> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromListConstr</span>
<a name="line-110"></a> <span class='hs-varid'>gunfold</span> <span class='hs-varid'>k</span> <span class='hs-varid'>z</span> <span class='hs-varid'>c</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-varid'>constrIndex</span> <span class='hs-varid'>c</span> <span class='hs-keyword'>of</span>
<a name="line-111"></a> <span class='hs-num'>1</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>k</span> <span class='hs-layout'>(</span><span class='hs-varid'>z</span> <span class='hs-varid'>fromList</span><span class='hs-layout'>)</span>
<a name="line-112"></a> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>error</span> <span class='hs-str'>"gunfold"</span>
<a name="line-113"></a> <span class='hs-varid'>dataTypeOf</span> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>hashSetDataType</span>
<a name="line-114"></a> <span class='hs-varid'>dataCast1</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>gcast1</span> <span class='hs-varid'>f</span>
<a name="line-115"></a>
<a name="line-116"></a><a name="fromListConstr"></a><span class='hs-definition'>fromListConstr</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Constr</span>
<a name="line-117"></a><span class='hs-definition'>fromListConstr</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mkConstr</span> <span class='hs-varid'>hashSetDataType</span> <span class='hs-str'>"fromList"</span> <span class='hs-conid'>[]</span> <span class='hs-conid'>Prefix</span>
<a name="line-118"></a>
<a name="line-119"></a><a name="hashSetDataType"></a><span class='hs-definition'>hashSetDataType</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>DataType</span>
<a name="line-120"></a><span class='hs-definition'>hashSetDataType</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>mkDataType</span> <span class='hs-str'>"Data.HashSet"</span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>fromListConstr</span><span class='hs-keyglyph'>]</span>
<a name="line-121"></a><span class='hs-cpp'>#endif</span>
<a name="line-122"></a>
<a name="line-123"></a><a name="empty"></a><span class='hs-comment'>-- | /O(1)/ Construct an empty set.</span>
<a name="line-124"></a><span class='hs-definition'>empty</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span>
<a name="line-125"></a><span class='hs-definition'>empty</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HashSet</span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>empty</span>
<a name="line-126"></a>
<a name="line-127"></a><a name="singleton"></a><span class='hs-comment'>-- | /O(1)/ Construct a set with a single element.</span>
<a name="line-128"></a><span class='hs-definition'>singleton</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span>
<a name="line-129"></a><span class='hs-definition'>singleton</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HashSet</span> <span class='hs-layout'>(</span><span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>singleton</span> <span class='hs-varid'>a</span> <span class='hs-conid'>()</span><span class='hs-layout'>)</span>
<a name="line-130"></a><span class='hs-cpp'>#if __GLASGOW_HASKELL__ >= 700</span>
<a name="line-131"></a><span class='hs-comment'>{-# INLINABLE singleton #-}</span>
<a name="line-132"></a><span class='hs-cpp'>#endif</span>
<a name="line-133"></a>
<a name="line-134"></a><a name="union"></a><span class='hs-comment'>-- | /O(n+m)/ Construct a set containing all elements from both sets.</span>
<a name="line-135"></a><span class='hs-comment'>--</span>
<a name="line-136"></a><span class='hs-comment'>-- To obtain good performance, the smaller set must be presented as</span>
<a name="line-137"></a><span class='hs-comment'>-- the first argument.</span>
<a name="line-138"></a><span class='hs-definition'>union</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span>
<a name="line-139"></a><span class='hs-definition'>union</span> <span class='hs-varid'>s1</span> <span class='hs-varid'>s2</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HashSet</span> <span class='hs-varop'>$</span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>union</span> <span class='hs-layout'>(</span><span class='hs-varid'>asMap</span> <span class='hs-varid'>s1</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-varid'>asMap</span> <span class='hs-varid'>s2</span><span class='hs-layout'>)</span>
<a name="line-140"></a><span class='hs-comment'>{-# INLINE union #-}</span>
<a name="line-141"></a>
<a name="line-142"></a><span class='hs-comment'>-- TODO: Figure out the time complexity of 'unions'.</span>
<a name="line-143"></a>
<a name="line-144"></a><a name="unions"></a><span class='hs-comment'>-- | Construct a set containing all elements from a list of sets.</span>
<a name="line-145"></a><span class='hs-definition'>unions</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-keyglyph'>[</span><span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span>
<a name="line-146"></a><span class='hs-definition'>unions</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>List</span><span class='hs-varop'>.</span><span class='hs-varid'>foldl'</span> <span class='hs-varid'>union</span> <span class='hs-varid'>empty</span>
<a name="line-147"></a><span class='hs-comment'>{-# INLINE unions #-}</span>
<a name="line-148"></a>
<a name="line-149"></a><a name="null"></a><span class='hs-comment'>-- | /O(1)/ Return 'True' if this set is empty, 'False' otherwise.</span>
<a name="line-150"></a><span class='hs-definition'>null</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Bool</span>
<a name="line-151"></a><span class='hs-definition'>null</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>null</span> <span class='hs-varop'>.</span> <span class='hs-varid'>asMap</span>
<a name="line-152"></a><span class='hs-comment'>{-# INLINE null #-}</span>
<a name="line-153"></a>
<a name="line-154"></a><a name="size"></a><span class='hs-comment'>-- | /O(n)/ Return the number of elements in this set.</span>
<a name="line-155"></a><span class='hs-definition'>size</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Int</span>
<a name="line-156"></a><span class='hs-definition'>size</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>size</span> <span class='hs-varop'>.</span> <span class='hs-varid'>asMap</span>
<a name="line-157"></a><span class='hs-comment'>{-# INLINE size #-}</span>
<a name="line-158"></a>
<a name="line-159"></a><a name="member"></a><span class='hs-comment'>-- | /O(min(n,W))/ Return 'True' if the given value is present in this</span>
<a name="line-160"></a><span class='hs-comment'>-- set, 'False' otherwise.</span>
<a name="line-161"></a><span class='hs-definition'>member</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Bool</span>
<a name="line-162"></a><span class='hs-definition'>member</span> <span class='hs-varid'>a</span> <span class='hs-varid'>s</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>lookup</span> <span class='hs-varid'>a</span> <span class='hs-layout'>(</span><span class='hs-varid'>asMap</span> <span class='hs-varid'>s</span><span class='hs-layout'>)</span> <span class='hs-keyword'>of</span>
<a name="line-163"></a> <span class='hs-conid'>Just</span> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>True</span>
<a name="line-164"></a> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>False</span>
<a name="line-165"></a><span class='hs-cpp'>#if __GLASGOW_HASKELL__ >= 700</span>
<a name="line-166"></a><span class='hs-comment'>{-# INLINABLE member #-}</span>
<a name="line-167"></a><span class='hs-cpp'>#endif</span>
<a name="line-168"></a>
<a name="line-169"></a><a name="insert"></a><span class='hs-comment'>-- | /O(min(n,W))/ Add the specified value to this set.</span>
<a name="line-170"></a><span class='hs-definition'>insert</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span>
<a name="line-171"></a><span class='hs-definition'>insert</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HashSet</span> <span class='hs-varop'>.</span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>insert</span> <span class='hs-varid'>a</span> <span class='hs-conid'>()</span> <span class='hs-varop'>.</span> <span class='hs-varid'>asMap</span>
<a name="line-172"></a><span class='hs-cpp'>#if __GLASGOW_HASKELL__ >= 700</span>
<a name="line-173"></a><span class='hs-comment'>{-# INLINABLE insert #-}</span>
<a name="line-174"></a><span class='hs-cpp'>#endif</span>
<a name="line-175"></a>
<a name="line-176"></a><a name="delete"></a><span class='hs-comment'>-- | /O(min(n,W))/ Remove the specified value from this set if</span>
<a name="line-177"></a><span class='hs-comment'>-- present.</span>
<a name="line-178"></a><span class='hs-definition'>delete</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span>
<a name="line-179"></a><span class='hs-definition'>delete</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HashSet</span> <span class='hs-varop'>.</span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>delete</span> <span class='hs-varid'>a</span> <span class='hs-varop'>.</span> <span class='hs-varid'>asMap</span>
<a name="line-180"></a><span class='hs-cpp'>#if __GLASGOW_HASKELL__ >= 700</span>
<a name="line-181"></a><span class='hs-comment'>{-# INLINABLE delete #-}</span>
<a name="line-182"></a><span class='hs-cpp'>#endif</span>
<a name="line-183"></a>
<a name="line-184"></a><a name="map"></a><span class='hs-comment'>-- | /O(n)/ Transform this set by applying a function to every value.</span>
<a name="line-185"></a><span class='hs-comment'>-- The resulting set may be smaller than the source.</span>
<a name="line-186"></a><span class='hs-definition'>map</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Hashable</span> <span class='hs-varid'>b</span><span class='hs-layout'>,</span> <span class='hs-conid'>Eq</span> <span class='hs-varid'>b</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-layout'>(</span><span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>b</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>b</span>
<a name="line-187"></a><span class='hs-definition'>map</span> <span class='hs-varid'>f</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>fromList</span> <span class='hs-varop'>.</span> <span class='hs-conid'>List</span><span class='hs-varop'>.</span><span class='hs-varid'>map</span> <span class='hs-varid'>f</span> <span class='hs-varop'>.</span> <span class='hs-varid'>toList</span>
<a name="line-188"></a><span class='hs-comment'>{-# INLINE map #-}</span>
<a name="line-189"></a>
<a name="line-190"></a><a name="difference"></a><span class='hs-comment'>-- | /O(n)/ Difference of two sets. Return elements of the first set</span>
<a name="line-191"></a><span class='hs-comment'>-- not existing in the second.</span>
<a name="line-192"></a><span class='hs-definition'>difference</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span>
<a name="line-193"></a><span class='hs-definition'>difference</span> <span class='hs-layout'>(</span><span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>HashSet</span> <span class='hs-varid'>b</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HashSet</span> <span class='hs-layout'>(</span><span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>difference</span> <span class='hs-varid'>a</span> <span class='hs-varid'>b</span><span class='hs-layout'>)</span>
<a name="line-194"></a><span class='hs-cpp'>#if __GLASGOW_HASKELL__ >= 700</span>
<a name="line-195"></a><span class='hs-comment'>{-# INLINABLE difference #-}</span>
<a name="line-196"></a><span class='hs-cpp'>#endif</span>
<a name="line-197"></a>
<a name="line-198"></a><a name="intersection"></a><span class='hs-comment'>-- | /O(n)/ Intersection of two sets. Return elements present in both</span>
<a name="line-199"></a><span class='hs-comment'>-- the first set and the second.</span>
<a name="line-200"></a><span class='hs-definition'>intersection</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span>
<a name="line-201"></a><span class='hs-definition'>intersection</span> <span class='hs-layout'>(</span><span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-layout'>(</span><span class='hs-conid'>HashSet</span> <span class='hs-varid'>b</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HashSet</span> <span class='hs-layout'>(</span><span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>intersection</span> <span class='hs-varid'>a</span> <span class='hs-varid'>b</span><span class='hs-layout'>)</span>
<a name="line-202"></a><span class='hs-cpp'>#if __GLASGOW_HASKELL__ >= 700</span>
<a name="line-203"></a><span class='hs-comment'>{-# INLINABLE intersection #-}</span>
<a name="line-204"></a><span class='hs-cpp'>#endif</span>
<a name="line-205"></a>
<a name="line-206"></a><a name="foldl'"></a><span class='hs-comment'>-- | /O(n)/ Reduce this set by applying a binary operator to all</span>
<a name="line-207"></a><span class='hs-comment'>-- elements, using the given starting value (typically the</span>
<a name="line-208"></a><span class='hs-comment'>-- left-identity of the operator). Each application of the operator</span>
<a name="line-209"></a><span class='hs-comment'>-- is evaluated before before using the result in the next</span>
<a name="line-210"></a><span class='hs-comment'>-- application. This function is strict in the starting value.</span>
<a name="line-211"></a><span class='hs-definition'>foldl'</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>b</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>b</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span>
<a name="line-212"></a><span class='hs-definition'>foldl'</span> <span class='hs-varid'>f</span> <span class='hs-varid'>z0</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>foldlWithKey'</span> <span class='hs-varid'>g</span> <span class='hs-varid'>z0</span> <span class='hs-varop'>.</span> <span class='hs-varid'>asMap</span>
<a name="line-213"></a> <span class='hs-keyword'>where</span> <span class='hs-varid'>g</span> <span class='hs-varid'>z</span> <span class='hs-varid'>k</span> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>f</span> <span class='hs-varid'>z</span> <span class='hs-varid'>k</span>
<a name="line-214"></a><span class='hs-comment'>{-# INLINE foldl' #-}</span>
<a name="line-215"></a>
<a name="line-216"></a><a name="foldr"></a><span class='hs-comment'>-- | /O(n)/ Reduce this set by applying a binary operator to all</span>
<a name="line-217"></a><span class='hs-comment'>-- elements, using the given starting value (typically the</span>
<a name="line-218"></a><span class='hs-comment'>-- right-identity of the operator).</span>
<a name="line-219"></a><span class='hs-definition'>foldr</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-varid'>b</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>b</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span>
<a name="line-220"></a><span class='hs-definition'>foldr</span> <span class='hs-varid'>f</span> <span class='hs-varid'>z0</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>foldrWithKey</span> <span class='hs-varid'>g</span> <span class='hs-varid'>z0</span> <span class='hs-varop'>.</span> <span class='hs-varid'>asMap</span>
<a name="line-221"></a> <span class='hs-keyword'>where</span> <span class='hs-varid'>g</span> <span class='hs-varid'>k</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>z</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>f</span> <span class='hs-varid'>k</span> <span class='hs-varid'>z</span>
<a name="line-222"></a><span class='hs-comment'>{-# INLINE foldr #-}</span>
<a name="line-223"></a>
<a name="line-224"></a><a name="filter"></a><span class='hs-comment'>-- | /O(n)/ Filter this set by retaining only elements satisfying a</span>
<a name="line-225"></a><span class='hs-comment'>-- predicate.</span>
<a name="line-226"></a><span class='hs-definition'>filter</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Bool</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span>
<a name="line-227"></a><span class='hs-definition'>filter</span> <span class='hs-varid'>p</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HashSet</span> <span class='hs-varop'>.</span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>filterWithKey</span> <span class='hs-varid'>q</span> <span class='hs-varop'>.</span> <span class='hs-varid'>asMap</span>
<a name="line-228"></a> <span class='hs-keyword'>where</span> <span class='hs-varid'>q</span> <span class='hs-varid'>k</span> <span class='hs-keyword'>_</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>p</span> <span class='hs-varid'>k</span>
<a name="line-229"></a><span class='hs-comment'>{-# INLINE filter #-}</span>
<a name="line-230"></a>
<a name="line-231"></a><a name="toList"></a><span class='hs-comment'>-- | /O(n)/ Return a list of this set's elements. The list is</span>
<a name="line-232"></a><span class='hs-comment'>-- produced lazily.</span>
<a name="line-233"></a><span class='hs-definition'>toList</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span>
<a name="line-234"></a><span class='hs-cpp'>#if defined(__GLASGOW_HASKELL__)</span>
<a name="line-235"></a><span class='hs-definition'>toList</span> <span class='hs-varid'>t</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>build</span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>\</span> <span class='hs-varid'>c</span> <span class='hs-varid'>z</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>foldrWithKey</span> <span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varid'>const</span> <span class='hs-varop'>.</span><span class='hs-layout'>)</span> <span class='hs-varid'>c</span><span class='hs-layout'>)</span> <span class='hs-varid'>z</span> <span class='hs-layout'>(</span><span class='hs-varid'>asMap</span> <span class='hs-varid'>t</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span>
<a name="line-236"></a><span class='hs-cpp'>#else</span>
<a name="line-237"></a><span class='hs-definition'>toList</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>foldrWithKey</span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>\</span> <span class='hs-varid'>k</span> <span class='hs-keyword'>_</span> <span class='hs-varid'>xs</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>k</span> <span class='hs-conop'>:</span> <span class='hs-varid'>xs</span><span class='hs-layout'>)</span> <span class='hs-conid'>[]</span> <span class='hs-varop'>.</span> <span class='hs-varid'>asMap</span>
<a name="line-238"></a><span class='hs-cpp'>#endif</span>
<a name="line-239"></a><span class='hs-comment'>{-# INLINE toList #-}</span>
<a name="line-240"></a>
<a name="line-241"></a><a name="fromList"></a><span class='hs-comment'>-- | /O(n*min(W, n))/ Construct a set from a list of elements.</span>
<a name="line-242"></a><span class='hs-definition'>fromList</span> <span class='hs-keyglyph'>::</span> <span class='hs-layout'>(</span><span class='hs-conid'>Eq</span> <span class='hs-varid'>a</span><span class='hs-layout'>,</span> <span class='hs-conid'>Hashable</span> <span class='hs-varid'>a</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=></span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>HashSet</span> <span class='hs-varid'>a</span>
<a name="line-243"></a><span class='hs-definition'>fromList</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>HashSet</span> <span class='hs-varop'>.</span> <span class='hs-conid'>List</span><span class='hs-varop'>.</span><span class='hs-varid'>foldl'</span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>\</span> <span class='hs-varid'>m</span> <span class='hs-varid'>k</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>insert</span> <span class='hs-varid'>k</span> <span class='hs-conid'>()</span> <span class='hs-varid'>m</span><span class='hs-layout'>)</span> <span class='hs-conid'>H</span><span class='hs-varop'>.</span><span class='hs-varid'>empty</span>
<a name="line-244"></a><span class='hs-comment'>{-# INLINE fromList #-}</span>
</pre></body>
</html>
|