/usr/share/doc/libghc-gloss-doc/html/Graphics-Gloss-Algorithms-RayCast.html is in libghc-gloss-doc 1.7.8.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 | <!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>Graphics.Gloss.Algorithms.RayCast</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_Graphics-Gloss-Algorithms-RayCast.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Graphics-Gloss-Algorithms-RayCast.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">gloss-1.7.8.3: Painless 2D vector graphics, animations and simulations.</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Safe Haskell</th><td>None</td></tr></table><p class="caption">Graphics.Gloss.Algorithms.RayCast</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>Various ray casting algorithms.
</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"><a href="#v:castSegIntoCellularQuadTree">castSegIntoCellularQuadTree</a> :: <span class="keyword">forall</span> a. <a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a> -> <a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a> -> <a href="Graphics-Gloss-Data-Extent.html#t:Extent">Extent</a> -> <a href="Graphics-Gloss-Data-QuadTree.html#t:QuadTree">QuadTree</a> a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Maybe.html#t:Maybe">Maybe</a> (<a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a>, <a href="Graphics-Gloss-Data-Extent.html#t:Extent">Extent</a>, a)</li><li class="src short"><a href="#v:traceSegIntoCellularQuadTree">traceSegIntoCellularQuadTree</a> :: <span class="keyword">forall</span> a. <a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a> -> <a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a> -> <a href="Graphics-Gloss-Data-Extent.html#t:Extent">Extent</a> -> <a href="Graphics-Gloss-Data-QuadTree.html#t:QuadTree">QuadTree</a> a -> [(<a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a>, <a href="Graphics-Gloss-Data-Extent.html#t:Extent">Extent</a>, a)]</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><a name="v:castSegIntoCellularQuadTree" class="def">castSegIntoCellularQuadTree</a><a href="src/Graphics-Gloss-Algorithms-RayCast.html#castSegIntoCellularQuadTree" class="link">Source</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: <span class="keyword">forall</span> a . </td><td class="doc empty"> </td></tr><tr><td class="src">=> <a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a></td><td class="doc"><p>(P1) Starting point of seg.
</p></td></tr><tr><td class="src">-> <a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a></td><td class="doc"><p>(P2) Final point of seg.
</p></td></tr><tr><td class="src">-> <a href="Graphics-Gloss-Data-Extent.html#t:Extent">Extent</a></td><td class="doc"><p>Extent convering the whole tree.
</p></td></tr><tr><td class="src">-> <a href="Graphics-Gloss-Data-QuadTree.html#t:QuadTree">QuadTree</a> a</td><td class="doc"><p>The tree.
</p></td></tr><tr><td class="src">-> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.6.0.1/Data-Maybe.html#t:Maybe">Maybe</a> (<a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a>, <a href="Graphics-Gloss-Data-Extent.html#t:Extent">Extent</a>, a)</td><td class="doc"><p>Intersection point, extent of cell, value of cell (if any).
</p></td></tr></table></div><div class="doc"><p>The quadtree contains cells of unit extent (NetHack style).
Given a line segement (P1-P2) through the tree, get the cell
closest to P1 that intersects the segment, if any.
</p><p>TODO: This currently uses a naive algorithm. It just calls
<code><a href="Graphics-Gloss-Algorithms-RayCast.html#v:traceSegIntoCellularQuadTree">traceSegIntoCellularQuadTree</a></code> and sorts the results
to get the one closest to P1. It'd be better to do a
proper walk over the tree in the direction of the ray.
</p></div></div><div class="top"><p class="src"><a name="v:traceSegIntoCellularQuadTree" class="def">traceSegIntoCellularQuadTree</a><a href="src/Graphics-Gloss-Algorithms-RayCast.html#traceSegIntoCellularQuadTree" class="link">Source</a></p><div class="subs arguments"><p class="caption">Arguments</p><table><tr><td class="src">:: <span class="keyword">forall</span> a . </td><td class="doc empty"> </td></tr><tr><td class="src">=> <a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a></td><td class="doc"><p>(P1) Starting point of seg.
</p></td></tr><tr><td class="src">-> <a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a></td><td class="doc"><p>(P2) Final point of seg.
</p></td></tr><tr><td class="src">-> <a href="Graphics-Gloss-Data-Extent.html#t:Extent">Extent</a></td><td class="doc"><p>Extent covering the whole tree.
</p></td></tr><tr><td class="src">-> <a href="Graphics-Gloss-Data-QuadTree.html#t:QuadTree">QuadTree</a> a</td><td class="doc"><p>The tree.
</p></td></tr><tr><td class="src">-> [(<a href="Graphics-Gloss-Data-Point.html#t:Point">Point</a>, <a href="Graphics-Gloss-Data-Extent.html#t:Extent">Extent</a>, a)]</td><td class="doc"><p>Intersection point, extent of cell, value of cell.
</p></td></tr></table></div><div class="doc"><p>The quadtree contains cells of unit extent (NetHack style).
Given a line segment (P1-P2) through the tree, return the list of cells
that intersect the segment.
</p></div></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>
|