/usr/share/doc/haskell-edison-api-doc/html/Data-Edison-Sym.html is in libghc-edison-api-doc 1.2.1-17.
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 | <!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.Edison.Sym</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-Edison-Sym.html");};
//]]>
</script></head><body><div id="package-header"><ul class="links" id="page-menu"><li><a href="src/Data-Edison-Sym.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">EdisonAPI-1.2.1: A library of efficient, purely-functional data structures (API)</p></div><div id="content"><div id="module-header"><table class="info"><tr><th>Portability</th><td>GHC, Hugs (MPTC and FD)</td></tr><tr><th>Stability</th><td>stable</td></tr><tr><th>Maintainer</th><td>robdockins AT fastmail DOT fm</td></tr><tr><th>Safe Haskell</th><td>Safe-Infered</td></tr></table><p class="caption">Data.Edison.Sym</p></div><div id="description"><p class="caption">Description</p><div class="doc"><p>This module introduces a number of infix symbols which are aliases
for some of the operations in the sequence and set abstractions.
For several, the argument orders are reversed to more closely
match usual symbolic usage.
</p><p>The symbols are intended to evoke the the operations they
represent. Unfortunately, ASCII is pretty limited, and Haskell 98
only allocates a few symbols to the operator lexical class.
Thus, some of the operators are less evocative than one would
like. A future version of Edison may introduce unicode operators, which
will allow a wider range of operations to be represented symbolicly.
</p><p>Unlike most of the modules in Edison, this module is intended to be
imported unqualified. However, the definition of <code>(++)</code> will conflict
with the Prelude definition. Either this definition or the Prelude
definition will need to be imported <code>hiding ( (++) )</code>. This definition
subsumes the Prelude definition, and can be safely used in place of it.
</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:-60--124-">(<|)</a> :: <a href="Data-Edison-Seq.html#t:Sequence">Sequence</a> seq => a -> seq a -> seq a</li><li class="src short"><a href="#v:-124--62-">(|>)</a> :: <a href="Data-Edison-Seq.html#t:Sequence">Sequence</a> seq => seq a -> a -> seq a</li><li class="src short"><a href="#v:-43--43-">(++)</a> :: <a href="Data-Edison-Seq.html#t:Sequence">Sequence</a> seq => seq a -> seq a -> seq a</li><li class="src short"><a href="#v:-33-">(!)</a> :: <a href="Data-Edison-Seq.html#t:Sequence">Sequence</a> seq => seq a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Int.html#t:Int">Int</a> -> a</li><li class="src short"><a href="#v:-124--61-">(|=)</a> :: <a href="Data-Edison-Coll.html#t:SetX">SetX</a> set a => set -> set -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Bool.html#t:Bool">Bool</a></li><li class="src short"><a href="#v:-92--92-">(\\)</a> :: <a href="Data-Edison-Coll.html#t:SetX">SetX</a> set a => set -> set -> set</li><li class="src short"><a href="#v:-47--92-">(/\)</a> :: <a href="Data-Edison-Coll.html#t:SetX">SetX</a> set a => set -> set -> set</li><li class="src short"><a href="#v:-92--47-">(\/)</a> :: <a href="Data-Edison-Coll.html#t:SetX">SetX</a> set a => set -> set -> set</li></ul></div><div id="interface"><h1>Documentation</h1><div class="top"><p class="src"><a name="v:-60--124-" class="def">(<|)</a> :: <a href="Data-Edison-Seq.html#t:Sequence">Sequence</a> seq => a -> seq a -> seq a<a href="src/Data-Edison-Sym.html#%3C%7C" class="link">Source</a></p><div class="doc"><p>Left (front) cons on a sequence. The new element appears on the left.
Identical to <code><a href="Data-Edison-Seq.html#v:lcons">lcons</a></code>.
</p></div></div><div class="top"><p class="src"><a name="v:-124--62-" class="def">(|>)</a> :: <a href="Data-Edison-Seq.html#t:Sequence">Sequence</a> seq => seq a -> a -> seq a<a href="src/Data-Edison-Sym.html#%7C%3E" class="link">Source</a></p><div class="doc"><p>Right (rear) cons on a sequence. The new element appears on the right.
Identical to <code><a href="Data-Edison-Seq.html#v:rcons">rcons</a></code> with reversed arguments.
</p></div></div><div class="top"><p class="src"><a name="v:-43--43-" class="def">(++)</a> :: <a href="Data-Edison-Seq.html#t:Sequence">Sequence</a> seq => seq a -> seq a -> seq a<a href="src/Data-Edison-Sym.html#%2B%2B" class="link">Source</a></p><div class="doc"><p>Append two sequences. Identical to <code><a href="Data-Edison-Seq.html#v:append">append</a></code>. Subsumes the Prelude
definition.
</p></div></div><div class="top"><p class="src"><a name="v:-33-" class="def">(!)</a> :: <a href="Data-Edison-Seq.html#t:Sequence">Sequence</a> seq => seq a -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Int.html#t:Int">Int</a> -> a<a href="src/Data-Edison-Sym.html#%21" class="link">Source</a></p><div class="doc"><p>Lookup an element in a sequence. Identical to <code><a href="Data-Edison-Seq.html#v:lookup">lookup</a></code> with
reversed arguments.
</p></div></div><div class="top"><p class="src"><a name="v:-124--61-" class="def">(|=)</a> :: <a href="Data-Edison-Coll.html#t:SetX">SetX</a> set a => set -> set -> <a href="/usr/share/doc/ghc-doc/html/libraries/base-4.5.0.0/Data-Bool.html#t:Bool">Bool</a><a href="src/Data-Edison-Sym.html#%7C%3D" class="link">Source</a></p><div class="doc"><p>Subset test operation. Identical to <code><a href="Data-Edison-Coll.html#v:subset">subset</a></code>.
</p></div></div><div class="top"><p class="src"><a name="v:-92--92-" class="def">(\\)</a> :: <a href="Data-Edison-Coll.html#t:SetX">SetX</a> set a => set -> set -> set<a href="src/Data-Edison-Sym.html#%5C%5C" class="link">Source</a></p><div class="doc"><p>Set difference. Identical to <code><a href="Data-Edison-Coll.html#v:difference">difference</a></code>.
</p></div></div><div class="top"><p class="src"><a name="v:-47--92-" class="def">(/\)</a> :: <a href="Data-Edison-Coll.html#t:SetX">SetX</a> set a => set -> set -> set<a href="src/Data-Edison-Sym.html#%2F%5C" class="link">Source</a></p><div class="doc"><p>Set intersection. Identical to <code><a href="Data-Edison-Coll.html#v:intersection">intersection</a></code>.
</p></div></div><div class="top"><p class="src"><a name="v:-92--47-" class="def">(\/)</a> :: <a href="Data-Edison-Coll.html#t:SetX">SetX</a> set a => set -> set -> set<a href="src/Data-Edison-Sym.html#%5C%2F" class="link">Source</a></p><div class="doc"><p>Set union. Identical to <code><a href="Data-Edison-Coll.html#v:union">union</a></code>.
</p></div></div></div></div><div id="footer"><p>Produced by <a href="http://www.haskell.org/haddock/">Haddock</a> version 2.10.0</p></div></body></html>
|