/usr/share/doc/libghc-unordered-containers-doc/html/src/Data-HashMap-Lazy.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 | <?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/HashMap/Lazy.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 #-}</span>
<a name="line-2"></a>
<a name="line-3"></a><span class='hs-cpp'>#if __GLASGOW_HASKELL__ >= 702</span>
<a name="line-4"></a><span class='hs-comment'>{-# LANGUAGE Trustworthy #-}</span>
<a name="line-5"></a><span class='hs-cpp'>#endif</span>
<a name="line-6"></a>
<a name="line-7"></a><span class='hs-comment'>------------------------------------------------------------------------</span>
<a name="line-8"></a><span class='hs-comment'>-- |</span>
<a name="line-9"></a><span class='hs-comment'>-- Module : Data.HashMap.Lazy</span>
<a name="line-10"></a><span class='hs-comment'>-- Copyright : 2010-2012 Johan Tibell</span>
<a name="line-11"></a><span class='hs-comment'>-- License : BSD-style</span>
<a name="line-12"></a><span class='hs-comment'>-- Maintainer : johan.tibell@gmail.com</span>
<a name="line-13"></a><span class='hs-comment'>-- Stability : provisional</span>
<a name="line-14"></a><span class='hs-comment'>-- Portability : portable</span>
<a name="line-15"></a><span class='hs-comment'>--</span>
<a name="line-16"></a><span class='hs-comment'>-- A map from /hashable/ keys to values. A map cannot contain</span>
<a name="line-17"></a><span class='hs-comment'>-- duplicate keys; each key can map to at most one value. A 'HashMap'</span>
<a name="line-18"></a><span class='hs-comment'>-- makes no guarantees as to the order of its elements.</span>
<a name="line-19"></a><span class='hs-comment'>--</span>
<a name="line-20"></a><span class='hs-comment'>-- This map is strict in the keys and lazy in the values; keys are</span>
<a name="line-21"></a><span class='hs-comment'>-- evaluated to /weak head normal form/ before they are added to the</span>
<a name="line-22"></a><span class='hs-comment'>-- map.</span>
<a name="line-23"></a><span class='hs-comment'>--</span>
<a name="line-24"></a><span class='hs-comment'>-- The implementation is based on /hash array mapped tries/. A</span>
<a name="line-25"></a><span class='hs-comment'>-- 'HashMap' is often faster than other tree-based set types,</span>
<a name="line-26"></a><span class='hs-comment'>-- especially when key comparison is expensive, as in the case of</span>
<a name="line-27"></a><span class='hs-comment'>-- strings.</span>
<a name="line-28"></a><span class='hs-comment'>--</span>
<a name="line-29"></a><span class='hs-comment'>-- Many operations have a average-case complexity of /O(log n)/. The</span>
<a name="line-30"></a><span class='hs-comment'>-- implementation uses a large base (i.e. 16) so in practice these</span>
<a name="line-31"></a><span class='hs-comment'>-- operations are constant time.</span>
<a name="line-32"></a><span class='hs-keyword'>module</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>
<a name="line-33"></a> <span class='hs-layout'>(</span>
<a name="line-34"></a> <span class='hs-conid'>HashMap</span>
<a name="line-35"></a>
<a name="line-36"></a> <span class='hs-comment'>-- * Construction</span>
<a name="line-37"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>empty</span>
<a name="line-38"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>singleton</span>
<a name="line-39"></a>
<a name="line-40"></a> <span class='hs-comment'>-- * Basic interface</span>
<a name="line-41"></a> <span class='hs-layout'>,</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>null</span>
<a name="line-42"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>size</span>
<a name="line-43"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>member</span>
<a name="line-44"></a> <span class='hs-layout'>,</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>lookup</span>
<a name="line-45"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>lookupDefault</span>
<a name="line-46"></a> <span class='hs-layout'>,</span> <span class='hs-layout'>(</span><span class='hs-varop'>!</span><span class='hs-layout'>)</span>
<a name="line-47"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>insert</span>
<a name="line-48"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>insertWith</span>
<a name="line-49"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>delete</span>
<a name="line-50"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>adjust</span>
<a name="line-51"></a>
<a name="line-52"></a> <span class='hs-comment'>-- * Combine</span>
<a name="line-53"></a> <span class='hs-comment'>-- ** Union</span>
<a name="line-54"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>union</span>
<a name="line-55"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>unionWith</span>
<a name="line-56"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>unions</span>
<a name="line-57"></a>
<a name="line-58"></a> <span class='hs-comment'>-- * Transformations</span>
<a name="line-59"></a> <span class='hs-layout'>,</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>map</span>
<a name="line-60"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>traverseWithKey</span>
<a name="line-61"></a>
<a name="line-62"></a> <span class='hs-comment'>-- * Difference and intersection</span>
<a name="line-63"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>difference</span>
<a name="line-64"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>intersection</span>
<a name="line-65"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>intersectionWith</span>
<a name="line-66"></a>
<a name="line-67"></a> <span class='hs-comment'>-- * Folds</span>
<a name="line-68"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>foldl'</span>
<a name="line-69"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>foldlWithKey'</span>
<a name="line-70"></a> <span class='hs-layout'>,</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>foldr</span>
<a name="line-71"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>foldrWithKey</span>
<a name="line-72"></a>
<a name="line-73"></a> <span class='hs-comment'>-- * Filter</span>
<a name="line-74"></a> <span class='hs-layout'>,</span> <span class='hs-conid'>HM</span><span class='hs-varop'>.</span><span class='hs-varid'>filter</span>
<a name="line-75"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>filterWithKey</span>
<a name="line-76"></a>
<a name="line-77"></a> <span class='hs-comment'>-- * Conversions</span>
<a name="line-78"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>keys</span>
<a name="line-79"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>elems</span>
<a name="line-80"></a>
<a name="line-81"></a> <span class='hs-comment'>-- ** Lists</span>
<a name="line-82"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>toList</span>
<a name="line-83"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>fromList</span>
<a name="line-84"></a> <span class='hs-layout'>,</span> <span class='hs-varid'>fromListWith</span>
<a name="line-85"></a> <span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-86"></a>
<a name="line-87"></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-keyword'>as</span> <span class='hs-conid'>HM</span>
</pre></body>
</html>
|