|
Data.Edison.Prelude | Portability | GHC, Hugs (MPTC and FD) | Stability | stable | Maintainer | robdockins AT fastmail DOT fm |
|
|
|
|
|
Description |
This module is a central depository of common definitions
used throughout Edison.
|
|
Synopsis |
|
|
|
|
Hashing classes
|
|
|
This class represents hashable objects. If obeys the
following invariant:
forall x,y :: a. (x == y) implies (hash x == hash y) | | Methods | |
|
|
|
This class represents hashable objects where the hash function
is unique (injective). There are no new methods, just a
stronger invariant:
forall x,y :: a. (x == y) iff (hash x == hash y) |
|
|
|
This class represents hashable objects where the hash is
reversible.
forall x :: a. unhash (hash x) == x Note that:
hash (unhash i) == i does not necessarily hold because unhash is not necessarily
defined for all i, only for all i in the range of hash.
| | Methods | |
|
|
|
This class represents a quantity that can be measured. It is
calculated by an associative function with a unit (hence the
Monoid superclass, and by a function which gives the measurement
for an individual item. Some datastructures are able to speed up
the calculation of a measure by caching intermediate values of
the computation.
| | Methods | |
|
|
Produced by Haddock version 2.6.1 |