/usr/share/doc/libghc-fgl-doc/html/src/Data-Graph-Inductive-Internal-RootPath.html is in libghc-fgl-doc 5.5.2.3-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 | <?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/Graph/Inductive/Internal/RootPath.hs</title>
<link type='text/css' rel='stylesheet' href='hscolour.css' />
</head>
<body>
<pre><a name="line-1"></a><span class='hs-comment'>-- (c) 2000-2005 by Martin Erwig [see file COPYRIGHT]</span>
<a name="line-2"></a><span class='hs-comment'>-- | Inward directed trees as lists of paths.</span>
<a name="line-3"></a><span class='hs-keyword'>module</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Graph</span><span class='hs-varop'>.</span><span class='hs-conid'>Inductive</span><span class='hs-varop'>.</span><span class='hs-conid'>Internal</span><span class='hs-varop'>.</span><span class='hs-conid'>RootPath</span> <span class='hs-layout'>(</span>
<a name="line-4"></a> <span class='hs-comment'>-- * Types</span>
<a name="line-5"></a> <span class='hs-conid'>RTree</span><span class='hs-layout'>,</span><span class='hs-conid'>LRTree</span><span class='hs-layout'>,</span>
<a name="line-6"></a> <span class='hs-comment'>-- * Operations</span>
<a name="line-7"></a> <span class='hs-varid'>getPath</span><span class='hs-layout'>,</span><span class='hs-varid'>getLPath</span><span class='hs-layout'>,</span>
<a name="line-8"></a> <span class='hs-varid'>getDistance</span><span class='hs-layout'>,</span>
<a name="line-9"></a> <span class='hs-varid'>getLPathNodes</span>
<a name="line-10"></a><span class='hs-layout'>)</span> <span class='hs-keyword'>where</span>
<a name="line-11"></a>
<a name="line-12"></a><span class='hs-keyword'>import</span> <span class='hs-conid'>Data</span><span class='hs-varop'>.</span><span class='hs-conid'>Graph</span><span class='hs-varop'>.</span><span class='hs-conid'>Inductive</span><span class='hs-varop'>.</span><span class='hs-conid'>Graph</span>
<a name="line-13"></a>
<a name="line-14"></a><a name="LRTree"></a><span class='hs-keyword'>type</span> <span class='hs-conid'>LRTree</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>[</span><span class='hs-conid'>LPath</span> <span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span>
<a name="line-15"></a><a name="RTree"></a><span class='hs-keyword'>type</span> <span class='hs-conid'>RTree</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyglyph'>[</span><span class='hs-conid'>Path</span><span class='hs-keyglyph'>]</span>
<a name="line-16"></a>
<a name="line-17"></a><a name="first"></a><span class='hs-definition'>first</span> <span class='hs-keyglyph'>::</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-keyglyph'>-></span> <span class='hs-conid'>Bool</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>-></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-keyglyph'>-></span> <span class='hs-keyglyph'>[</span><span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span>
<a name="line-18"></a><span class='hs-definition'>first</span> <span class='hs-varid'>p</span> <span class='hs-varid'>xss</span> <span class='hs-keyglyph'>=</span> <span class='hs-keyword'>case</span> <span class='hs-varid'>filter</span> <span class='hs-varid'>p</span> <span class='hs-varid'>xss</span> <span class='hs-keyword'>of</span>
<a name="line-19"></a> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>[]</span>
<a name="line-20"></a> <span class='hs-varid'>x</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>x</span>
<a name="line-21"></a>
<a name="line-22"></a><a name="findP"></a><span class='hs-comment'>-- | Find the first path in a tree that starts with the given node</span>
<a name="line-23"></a><span class='hs-definition'>findP</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Node</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>LRTree</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-keyglyph'>[</span><span class='hs-conid'>LNode</span> <span class='hs-varid'>a</span><span class='hs-keyglyph'>]</span>
<a name="line-24"></a><span class='hs-definition'>findP</span> <span class='hs-keyword'>_</span> <span class='hs-conid'>[]</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>[]</span>
<a name="line-25"></a><span class='hs-definition'>findP</span> <span class='hs-varid'>v</span> <span class='hs-layout'>(</span><span class='hs-conid'>LP</span> <span class='hs-conid'>[]</span><span class='hs-conop'>:</span><span class='hs-varid'>ps</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>findP</span> <span class='hs-varid'>v</span> <span class='hs-varid'>ps</span>
<a name="line-26"></a><span class='hs-definition'>findP</span> <span class='hs-varid'>v</span> <span class='hs-layout'>(</span><span class='hs-conid'>LP</span> <span class='hs-layout'>(</span><span class='hs-varid'>p</span><span class='hs-keyglyph'>@</span><span class='hs-layout'>(</span><span class='hs-layout'>(</span><span class='hs-varid'>w</span><span class='hs-layout'>,</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-layout'>)</span><span class='hs-conop'>:</span><span class='hs-varid'>ps</span><span class='hs-layout'>)</span> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>v</span><span class='hs-varop'>==</span><span class='hs-varid'>w</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>p</span>
<a name="line-27"></a> <span class='hs-keyglyph'>|</span> <span class='hs-varid'>otherwise</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>findP</span> <span class='hs-varid'>v</span> <span class='hs-varid'>ps</span>
<a name="line-28"></a>
<a name="line-29"></a><a name="getPath"></a><span class='hs-definition'>getPath</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Node</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>RTree</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Path</span>
<a name="line-30"></a><span class='hs-definition'>getPath</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>reverse</span> <span class='hs-varop'>.</span> <span class='hs-varid'>first</span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>\</span><span class='hs-layout'>(</span><span class='hs-varid'>w</span><span class='hs-conop'>:</span><span class='hs-keyword'>_</span><span class='hs-layout'>)</span><span class='hs-keyglyph'>-></span><span class='hs-varid'>w</span><span class='hs-varop'>==</span><span class='hs-varid'>v</span><span class='hs-layout'>)</span>
<a name="line-31"></a>
<a name="line-32"></a><a name="getLPath"></a><span class='hs-definition'>getLPath</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Node</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>LRTree</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>LPath</span> <span class='hs-varid'>a</span>
<a name="line-33"></a><span class='hs-definition'>getLPath</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-conid'>LP</span> <span class='hs-varop'>.</span> <span class='hs-varid'>reverse</span> <span class='hs-varop'>.</span> <span class='hs-varid'>findP</span> <span class='hs-varid'>v</span>
<a name="line-34"></a>
<a name="line-35"></a><a name="getDistance"></a><span class='hs-definition'>getDistance</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Node</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>LRTree</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-varid'>a</span>
<a name="line-36"></a><span class='hs-definition'>getDistance</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-varid'>snd</span> <span class='hs-varop'>.</span> <span class='hs-varid'>head</span> <span class='hs-varop'>.</span> <span class='hs-varid'>findP</span> <span class='hs-varid'>v</span>
<a name="line-37"></a>
<a name="line-38"></a><a name="getLPathNodes"></a><span class='hs-definition'>getLPathNodes</span> <span class='hs-keyglyph'>::</span> <span class='hs-conid'>Node</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>LRTree</span> <span class='hs-varid'>a</span> <span class='hs-keyglyph'>-></span> <span class='hs-conid'>Path</span>
<a name="line-39"></a><span class='hs-definition'>getLPathNodes</span> <span class='hs-varid'>v</span> <span class='hs-keyglyph'>=</span> <span class='hs-layout'>(</span><span class='hs-keyglyph'>\</span><span class='hs-layout'>(</span><span class='hs-conid'>LP</span> <span class='hs-varid'>p</span><span class='hs-layout'>)</span><span class='hs-keyglyph'>-></span><span class='hs-varid'>map</span> <span class='hs-varid'>fst</span> <span class='hs-varid'>p</span><span class='hs-layout'>)</span> <span class='hs-varop'>.</span> <span class='hs-varid'>getLPath</span> <span class='hs-varid'>v</span>
</pre></body>
</html>
|