EdisonAPI-1.2.1: A library of efficient, purely-functional data structures (API)Source codeContentsIndex
Data.Edison.Prelude
PortabilityGHC, Hugs (MPTC and FD)
Stabilitystable
Maintainerrobdockins AT fastmail DOT fm
Contents
Hashing classes
Description
This module is a central depository of common definitions used throughout Edison.
Synopsis
class Eq a => Hash a where
hash :: a -> Int
class Hash a => UniqueHash a
class UniqueHash a => ReversibleHash a where
unhash :: Int -> a
class Monoid v => Measured v a | a -> v where
measure :: a -> v
Hashing classes
class Eq a => Hash a whereSource

This class represents hashable objects. If obeys the following invariant: 

forall x,y :: a. (x == y) implies (hash x == hash y)
Methods
hash :: a -> IntSource
class Hash a => UniqueHash a Source

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)
class UniqueHash a => ReversibleHash a whereSource

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
unhash :: Int -> aSource
class Monoid v => Measured v a | a -> v whereSource
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
measure :: a -> vSource
Produced by Haddock version 2.6.0