|
Data.Edison.Sym | Portability | GHC, Hugs (MPTC and FD) | Stability | stable | Maintainer | robdockins AT fastmail DOT fm |
|
|
|
Description |
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.
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.
Unlike most of the modules in Edison, this module is intended to be
imported unqualified. However, the definition of (++) will conflict
with the Prelude definition. Either this definition or the Prelude
definition will need to be imported hiding ( (++) ). This definition
subsumes the Prelude definition, and can be safely used in place of it.
|
|
Synopsis |
|
|
|
Documentation |
|
|
Left (front) cons on a sequence. The new element appears on the left.
Identical to lcons.
|
|
|
Right (rear) cons on a sequence. The new element appears on the right.
Identical to rcons with reversed arguments.
|
|
|
Append two sequences. Identical to append. Subsumes the Prelude
definition.
|
|
|
Lookup an element in a sequence. Identical to lookup with
reversed arguments.
|
|
|
Subset test operation. Identical to subset.
|
|
|
Set difference. Identical to difference.
|
|
|
Set intersection. Identical to intersection.
|
|
|
Set union. Identical to union.
|
|
Produced by Haddock version 2.6.0 |