diff options
| author | David Waern <david.waern@gmail.com> | 2008-11-04 23:55:21 +0000 |
|---|---|---|
| committer | David Waern <david.waern@gmail.com> | 2008-11-04 23:55:21 +0000 |
| commit | 8819faaa78a356feda414334a1c75aa3a27ac725 (patch) | |
| tree | 3ec3702f5069942316ac7c8a98948de127679f45 /tests/output/Hash.html.ref | |
| parent | 86538fda062b449d674646e1c28fa08725b7b0ed (diff) | |
Remove .ref files from tests/output/
Diffstat (limited to 'tests/output/Hash.html.ref')
| -rw-r--r-- | tests/output/Hash.html.ref | 453 |
1 files changed, 0 insertions, 453 deletions
diff --git a/tests/output/Hash.html.ref b/tests/output/Hash.html.ref deleted file mode 100644 index 0f359e3c..00000000 --- a/tests/output/Hash.html.ref +++ /dev/null @@ -1,453 +0,0 @@ -<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> -<!--Rendered using the Haskell Html Library v0.2--> -<HTML -><HEAD -><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=UTF-8" -><TITLE ->Hash</TITLE -><LINK HREF="haddock.css" REL="stylesheet" TYPE="text/css" -><SCRIPT SRC="haddock-util.js" TYPE="text/javascript" -></SCRIPT -><SCRIPT TYPE="text/javascript" ->window.onload = function () {setSynopsis("mini_Hash.html")};</SCRIPT -></HEAD -><BODY -><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" -><TR -><TD CLASS="topbar" -><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" -><TR -><TD -><IMG SRC="haskell_icon.gif" WIDTH="16" HEIGHT="16" ALT=" " -></TD -><TD CLASS="title" -></TD -><TD CLASS="topbut" -><A HREF="index.html" ->Contents</A -></TD -><TD CLASS="topbut" -><A HREF="doc-index.html" ->Index</A -></TD -></TR -></TABLE -></TD -></TR -><TR -><TD CLASS="modulebar" -><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" -><TR -><TD -><FONT SIZE="6" ->Hash</FONT -></TD -></TR -></TABLE -></TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD -><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" -><TR -><TD CLASS="section4" -><B ->Contents</B -></TD -></TR -><TR -><TD -><DL -><DT -><A HREF="#1" ->The <TT ->HashTable</TT -> type -</A -></DT -><DD -><DL -><DT -><A HREF="#2" ->Operations on <TT ->HashTable</TT ->s -</A -></DT -></DL -></DD -><DT -><A HREF="#3" ->The <TT ->Hash</TT -> class -</A -></DT -></DL -></TD -></TR -></TABLE -></TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="section1" ->Description</TD -></TR -><TR -><TD CLASS="doc" ->Implementation of fixed-size hash tables, with a type - class for constructing hash values for structured types. -</TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="section1" ->Synopsis</TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="body" -><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" -><TR -><TD CLASS="decl" -><SPAN CLASS="keyword" ->data</SPAN -> <A HREF="#t%3AHashTable" ->HashTable</A -> key val</TD -></TR -><TR -><TD CLASS="s8" -></TD -></TR -><TR -><TD CLASS="decl" -><A HREF="#v%3Anew" ->new</A -> :: (Eq key, <A HREF="Hash.html#t%3AHash" ->Hash</A -> key) => Int -> IO (<A HREF="Hash.html#t%3AHashTable" ->HashTable</A -> key val)</TD -></TR -><TR -><TD CLASS="s8" -></TD -></TR -><TR -><TD CLASS="decl" -><A HREF="#v%3Ainsert" ->insert</A -> :: (Eq key, <A HREF="Hash.html#t%3AHash" ->Hash</A -> key) => key -> val -> IO ()</TD -></TR -><TR -><TD CLASS="s8" -></TD -></TR -><TR -><TD CLASS="decl" -><A HREF="#v%3Alookup" ->lookup</A -> :: <A HREF="Hash.html#t%3AHash" ->Hash</A -> key => key -> IO (Maybe val)</TD -></TR -><TR -><TD CLASS="s8" -></TD -></TR -><TR -><TD CLASS="decl" -><SPAN CLASS="keyword" ->class</SPAN -> <A HREF="#t%3AHash" ->Hash</A -> a <SPAN CLASS="keyword" ->where</SPAN -></TD -></TR -><TR -><TD CLASS="body" -><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" -><TR -><TD CLASS="decl" -><A HREF="#v%3Ahash" ->hash</A -> :: a -> Int</TD -></TR -></TABLE -></TD -></TR -></TABLE -></TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="section1" -><A NAME="1" ->The <TT ->HashTable</TT -> type -</A -></TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="decl" -><SPAN CLASS="keyword" ->data</SPAN -> <A NAME="t%3AHashTable" -></A -><B ->HashTable</B -> key val </TD -></TR -><TR -><TD CLASS="body" -><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" -><TR -><TD CLASS="ndoc" ->A hash table with keys of type <TT ->key</TT -> and values of type <TT ->val</TT ->. - The type <TT ->key</TT -> should be an instance of <TT ->Eq</TT ->. -</TD -></TR -></TABLE -></TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="section2" -><A NAME="2" ->Operations on <TT ->HashTable</TT ->s -</A -></TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="decl" -><A NAME="v%3Anew" -></A -><B ->new</B -> :: (Eq key, <A HREF="Hash.html#t%3AHash" ->Hash</A -> key) => Int -> IO (<A HREF="Hash.html#t%3AHashTable" ->HashTable</A -> key val)</TD -></TR -><TR -><TD CLASS="doc" ->Builds a new hash table with a given size -</TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="decl" -><A NAME="v%3Ainsert" -></A -><B ->insert</B -> :: (Eq key, <A HREF="Hash.html#t%3AHash" ->Hash</A -> key) => key -> val -> IO ()</TD -></TR -><TR -><TD CLASS="doc" ->Inserts a new element into the hash table -</TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="decl" -><A NAME="v%3Alookup" -></A -><B ->lookup</B -> :: <A HREF="Hash.html#t%3AHash" ->Hash</A -> key => key -> IO (Maybe val)</TD -></TR -><TR -><TD CLASS="doc" ->Looks up a key in the hash table, returns <TT -><TT ->Just</TT -> val</TT -> if the key - was found, or <TT ->Nothing</TT -> otherwise. -</TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="section1" -><A NAME="3" ->The <TT ->Hash</TT -> class -</A -></TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="decl" -><SPAN CLASS="keyword" ->class</SPAN -> <A NAME="t%3AHash" -></A -><B ->Hash</B -> a <SPAN CLASS="keyword" ->where</SPAN -></TD -></TR -><TR -><TD CLASS="body" -><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" -><TR -><TD CLASS="ndoc" ->A class of types which can be hashed. -</TD -></TR -><TR -><TD CLASS="s8" -></TD -></TR -><TR -><TD CLASS="section4" ->Methods</TD -></TR -><TR -><TD CLASS="body" -><TABLE CLASS="vanilla" CELLSPACING="0" CELLPADDING="0" -><TR -><TD CLASS="decl" -><A NAME="v%3Ahash" -></A -><B ->hash</B -> :: a -> Int</TD -></TR -><TR -><TD CLASS="doc" ->hashes the value of type <TT ->a</TT -> into an <TT ->Int</TT -> -</TD -></TR -></TABLE -></TD -></TR -><TR -><TD CLASS="s8" -></TD -></TR -><TR -><TD CLASS="section4" -><IMG SRC="minus.gif" CLASS="coll" ONCLICK="toggle(this,'i:Hash')" ALT="show/hide" -> Instances</TD -></TR -><TR -><TD CLASS="body" -><DIV ID="i:Hash" STYLE="display:block;" -><TABLE CLASS="vanilla" CELLSPACING="1" CELLPADDING="0" -><TR -><TD CLASS="decl" -><A HREF="Hash.html#t%3AHash" ->Hash</A -> Float</TD -></TR -><TR -><TD CLASS="decl" -><A HREF="Hash.html#t%3AHash" ->Hash</A -> Int</TD -></TR -><TR -><TD CLASS="decl" ->(<A HREF="Hash.html#t%3AHash" ->Hash</A -> a, <A HREF="Hash.html#t%3AHash" ->Hash</A -> b) => <A HREF="Hash.html#t%3AHash" ->Hash</A -> ((,) a b)</TD -></TR -></TABLE -></DIV -></TD -></TR -></TABLE -></TD -></TR -><TR -><TD CLASS="s15" -></TD -></TR -><TR -><TD CLASS="botbar" ->Produced by <A HREF="http://www.haskell.org/haddock/" ->Haddock</A -> version 2.3.0</TD -></TR -></TABLE -></BODY -></HTML -> |