Commit 818562da authored by simonmar's avatar simonmar

[project @ 2004-11-30 15:25:32 by simonmar]

The compiler now detects local modules that overlap with package
modules, so we must rename Random to avoid the clash.
parent 06ad94c3
......@@ -7,6 +7,10 @@
% RCS amended stuff
%$Log: Main.lhs,v $
%Revision 1.3 2004/11/30 15:25:32 simonmar
%The compiler now detects local modules that overlap with package
%modules, so we must rename Random to avoid the clash.
%
%Revision 1.2 1996/07/25 21:32:56 partain
%Bulk of final changes for 2.01
%
......@@ -19,10 +23,10 @@
%Revision 1.1 92/06/30 13:57:47 dlester
%Initial
%
%$Author: partain $
%$Author: simonmar $
%$State: Exp $
%$Revision: 1.2 $
%$Date: 1996/07/25 21:32:56 $
%$Revision: 1.3 $
%$Date: 2004/11/30 15:25:32 $
% Constant stuff (at the moment).
......@@ -41,7 +45,7 @@ Manchester M13 9PL, UK.}
> module Main where
> import IntLib
> import Random
> import MyRandom
> import Prime
Let's begin by giving Lester's line based command intepreter for
......
\section{Random Numbers}
%$Log: Random.lhs,v $
%$Log: MyRandom.lhs,v $
%Revision 1.1 2004/11/30 15:25:33 simonmar
%The compiler now detects local modules that overlap with package
%modules, so we must rename Random to avoid the clash.
%
%Revision 1.1 1996/01/08 20:04:20 partain
%Initial revision
%
......@@ -10,7 +14,7 @@
A call to @randomInts@ with two @Int@ arguments generates a
pseudo-random sequence of @Int@'s.
> module Random (randomInts) where
> module MyRandom (randomInts) where
Use seeds s1 in 1..2147483562 and s2 in 1..2147483398 to generate an
infinite list of random Ints. (Algorithm due to Lennart Augustsson)
......
\section{Probabalistic Primality Testing}
%$Log: Prime.lhs,v $
%Revision 1.3 2004/11/30 15:25:33 simonmar
%The compiler now detects local modules that overlap with package
%modules, so we must rename Random to avoid the clash.
%
%Revision 1.2 1996/07/25 21:32:57 partain
%Bulk of final changes for 2.01
%
......@@ -15,7 +19,7 @@
> module Prime (multiTest) where
> import IntLib
> import Random
> import MyRandom
The function @multiTest@ tests the integer @n@ for primality @k@ times
using the random numbers supplied in @rs@; it returns a @Bool@ and a
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment