/usr/share/doc/libghc-uulib-doc/html/UU-Util-BinaryTrees.html is in libghc-uulib-doc 0.9.20-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 | <!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>UU.Util.BinaryTrees</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_UU-Util-BinaryTrees.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/UU-Util-BinaryTrees.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">uulib-0.9.20: Haskell Utrecht Tools Library</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Safe Haskell</th><td>Safe</td></tr><tr><th>Language</th><td>Haskell98</td></tr></table><p class="caption">UU.Util.BinaryTrees</p></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><span class="keyword">data</span> <a name="t:BinSearchTree" class="def">BinSearchTree</a> av <a href="src/UU-Util-BinaryTrees.html#BinSearchTree" class="link">Source</a></p><div class="subs constructors"><p class="caption">Constructors</p><table><tr><td class="src"><a name="v:Node" class="def">Node</a> (<a href="UU-Util-BinaryTrees.html#t:BinSearchTree">BinSearchTree</a> av) av (<a href="UU-Util-BinaryTrees.html#t:BinSearchTree">BinSearchTree</a> av)</td><td class="doc empty"> </td></tr><tr><td class="src"><a name="v:Nil" class="def">Nil</a></td><td class="doc empty"> </td></tr></table></div></div><div class="top"><p class="src"><a name="v:tab2tree" class="def">tab2tree</a> :: [av] -> <a href="UU-Util-BinaryTrees.html#t:BinSearchTree">BinSearchTree</a> av <a href="src/UU-Util-BinaryTrees.html#tab2tree" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:btFind" class="def">btFind</a> :: (a -> b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.8.2.0/Data-Ord.html#t:Ordering">Ordering</a>) -> <a href="UU-Util-BinaryTrees.html#t:BinSearchTree">BinSearchTree</a> (a, c) -> b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.8.2.0/Data-Maybe.html#t:Maybe">Maybe</a> c <a href="src/UU-Util-BinaryTrees.html#btFind" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:btLocateIn" class="def">btLocateIn</a> :: (a -> b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.8.2.0/Data-Ord.html#t:Ordering">Ordering</a>) -> <a href="UU-Util-BinaryTrees.html#t:BinSearchTree">BinSearchTree</a> a -> b -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.8.2.0/Data-Maybe.html#t:Maybe">Maybe</a> a <a href="src/UU-Util-BinaryTrees.html#btLocateIn" class="link">Source</a></p></div><div class="top"><p class="src"><a name="v:btLookup" class="def">btLookup</a> :: (a -> b) -> (a -> c) -> (b -> d -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.8.2.0/Data-Ord.html#t:Ordering">Ordering</a>) -> <a href="UU-Util-BinaryTrees.html#t:BinSearchTree">BinSearchTree</a> a -> d -> <a href="file:///usr/share/doc/ghc-doc/html/libraries/base-4.8.2.0/Data-Maybe.html#t:Maybe">Maybe</a> c <a href="src/UU-Util-BinaryTrees.html#btLookup" 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.16.1</p></div></body></html>
|