/usr/share/doc/libghc-fgl-doc/html/Data-Graph-Inductive-Internal-Heap.html is in libghc-fgl-doc 5.5.0.1-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 | <!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.Graph.Inductive.Internal.Heap</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-Graph-Inductive-Internal-Heap.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-Graph-Inductive-Internal-Heap.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">fgl-5.5.0.1: Martin Erwig's Functional Graph Library</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Safe Haskell</th><td>Safe-Inferred</td></tr></table><p class="caption">Data.Graph.Inductive.Internal.Heap</p></div><div id="table-of-contents"><p class="caption">Contents</p><ul><li><a href="#g:1">Type
</a></li><li><a href="#g:2">Operations
</a></li></ul></div><div id="description"><p class="caption">Description</p><div class="doc"><p>Pairing heap implementation of dictionary
</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="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="#t:Heap">Heap</a> a b<ul class="subs"><li>= <a href="#v:Empty">Empty</a> </li><li>| <a href="#v:Node">Node</a> a b [<a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b] </li></ul></li><li class="src short"><a href="#v:empty">empty</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b</li><li class="src short"><a href="#v:unit">unit</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => a -> b -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b</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-Ord.html#t:Ord">Ord</a> a => (a, b) -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b</li><li class="src short"><a href="#v:merge">merge</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b</li><li class="src short"><a href="#v:mergeAll">mergeAll</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => [<a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b] -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b</li><li class="src short"><a href="#v:isEmpty">isEmpty</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> <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:findMin">findMin</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> (a, b)</li><li class="src short"><a href="#v:deleteMin">deleteMin</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b</li><li class="src short"><a href="#v:splitMin">splitMin</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> (a, b, <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b)</li><li class="src short"><a href="#v:build">build</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => [(a, b)] -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b</li><li class="src short"><a href="#v:toList">toList</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> [(a, b)]</li><li class="src short"><a href="#v:heapsort">heapsort</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => [a] -> [a]</li></ul></div><div id="interface"><h1 id="g:1">Type
</h1><div class="top"><p class="src"><span class="keyword">data</span> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a name="t:Heap" class="def">Heap</a> a b <a href="src/Data-Graph-Inductive-Internal-Heap.html#Heap" class="link">Source</a></p><div class="subs constructors"><p class="caption">Constructors</p><table><tr><td class="src"><a name="v:Empty" class="def">Empty</a></td><td class="doc empty"> </td></tr><tr><td class="src"><a name="v:Node" class="def">Node</a> a b [<a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b]</td><td class="doc empty"> </td></tr></table></div><div class="subs instances"><p id="control.i:Heap" class="caption collapser" onclick="toggleSection('i:Heap')">Instances</p><div id="section.i:Heap" class="show"><table><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> b, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</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-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b)</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/Data-Ord.html#t:Ord">Ord</a> a, <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Text-Show.html#t:Show">Show</a> b) => <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Text-Show.html#t:Show">Show</a> (<a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b)</td><td class="doc empty"> </td></tr></table></div></div></div><h1 id="g:2">Operations
</h1><div class="top"><p class="src"><a name="v:empty" class="def">empty</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b<a href="src/Data-Graph-Inductive-Internal-Heap.html#empty" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:unit" class="def">unit</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => a -> b -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b<a href="src/Data-Graph-Inductive-Internal-Heap.html#unit" class="link">Source</a></p></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-Ord.html#t:Ord">Ord</a> a => (a, b) -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b<a href="src/Data-Graph-Inductive-Internal-Heap.html#insert" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:merge" class="def">merge</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b<a href="src/Data-Graph-Inductive-Internal-Heap.html#merge" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:mergeAll" class="def">mergeAll</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => [<a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b] -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b<a href="src/Data-Graph-Inductive-Internal-Heap.html#mergeAll" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:isEmpty" class="def">isEmpty</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> <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-Graph-Inductive-Internal-Heap.html#isEmpty" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:findMin" class="def">findMin</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> (a, b)<a href="src/Data-Graph-Inductive-Internal-Heap.html#findMin" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:deleteMin" class="def">deleteMin</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b<a href="src/Data-Graph-Inductive-Internal-Heap.html#deleteMin" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:splitMin" class="def">splitMin</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> (a, b, <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b)<a href="src/Data-Graph-Inductive-Internal-Heap.html#splitMin" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:build" class="def">build</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => [(a, b)] -> <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b<a href="src/Data-Graph-Inductive-Internal-Heap.html#build" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:toList" class="def">toList</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => <a href="Data-Graph-Inductive-Internal-Heap.html#t:Heap">Heap</a> a b -> [(a, b)]<a href="src/Data-Graph-Inductive-Internal-Heap.html#toList" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:heapsort" class="def">heapsort</a> :: <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Ord.html#t:Ord">Ord</a> a => [a] -> [a]<a href="src/Data-Graph-Inductive-Internal-Heap.html#heapsort" class="link">Source</a></p></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>
|