;ò
ðŒü?c           @   s+  d  Z  d k l Z d k l Z l Z l	 Z
 l Z d k l Z l Z l Z l Z d k l Z d d d d d	 d
 d d d d d d d d d d d d d d d d d d g Z d e d ƒ e d ƒ Z d e
 Z e d  ƒ Z d! e d" ƒ Z d# Z d$ k Z d e i f d% „  ƒ  YZ d e f d& „  ƒ  YZ d' „  Z  d( d) „ Z! e ƒ  Z" e" i# Z# e" i$ Z$ e" i% Z% e" i& Z& e" i' Z' e" i( Z( e" i) Z) e" i* Z* e" i+ Z+ e" i, Z, e" i- Z- e" i. Z. e" i/ Z/ e" i0 Z0 e" i1 Z1 e" i2 Z2 e" i3 Z3 e" i4 Z4 e" i5 Z5 e" i6 Z6 e" i7 Z7 e" i8 Z8 e9 d* j o e! ƒ  n d$ S(+   s;  Random variable generators.

    integers
    --------
           uniform within range

    sequences
    ---------
           pick random element
           pick random sample
           generate random permutation

    distributions on the real line:
    ------------------------------
           uniform
           normal (Gaussian)
           lognormal
           negative exponential
           gamma
           beta
           pareto
           Weibull

    distributions on the circle (angles 0 to 2pi)
    ---------------------------------------------
           circular uniform
           von Mises

General notes on the underlying Mersenne Twister core generator:

* The period is 2**19937-1.
* It is one of the most extensively tested generators in existence
* Without a direct way to compute N steps forward, the
  semantics of jumpahead(n) are weakened to simply jump
  to another distant state and rely on the large period
  to avoid overlapping sequences.
* The random() method is implemented in C, executes in
  a single Python step, and is, therefore, threadsafe.

(   s   BuiltinMethodType(   s   logs   exps   pis   e(   s   sqrts   acoss   coss   sin(   s   floors   Randoms   seeds   randoms   uniforms   randints   choices   samples	   randranges   shuffles   normalvariates   lognormvariates   cunifvariates   expovariates   vonmisesvariates   gammavariates   stdgammas   gausss   betavariates   paretovariates   weibullvariates   getstates   setstates	   jumpaheads   WichmannHilli   f0.5f2.0f4.0f1.0f4.5i5   Nc           B   s*  t  Z d  Z d Z e d „ Z e d „ Z d „  Z d „  Z d „  Z	 d „  Z
 d „  Z e d	 e e d
 e >e d „ Z d „  Z e d
 e >e e e d „ Z d „  Z e e d „ Z d „  Z d „  Z d „  Z d „  Z d „  Z d „  Z d „  Z d „  Z d „  Z d „  Z d „  Z  d „  Z! d „  Z" RS(   sb  Random number generator base class used by bound module functions.

    Used to instantiate instances of Random to get generators that don't
    share state.  Especially useful for multi-threaded programs, creating
    a different instance of Random for each thread, and using the jumpahead()
    method to ensure that the generated sequences seen by each thread don't
    overlap.

    Class Random can also be subclassed if you want to use a different basic
    generator of your own devising: in that case, override the following
    methods:  random(), seed(), getstate(), setstate() and jumpahead().

    i   c         C   s   |  i | ƒ t |  _ d S(   se   Initialize an instance.

        Optional argument x controls seeding, as for Random.seed().
        N(   s   selfs   seeds   xs   Nones
   gauss_next(   s   selfs   x(    (    s#   /mit/python/lib/python2.3/random.pys   __init__Q   s     c         C   sS   | t j o# d k } t | i ƒ  d ƒ } n t t |  ƒ i | ƒ t |  _ d S(   s´   Initialize internal state from hashable object.

        None or no argument seeds from current time.

        If a is not None or an int or long, hash(a) is used instead.
        Ni   (	   s   as   Nones   times   longs   supers   Randoms   selfs   seeds
   gauss_next(   s   selfs   as   time(    (    s#   /mit/python/lib/python2.3/random.pys   seedZ   s     	c         C   s&   |  i t t |  ƒ i ƒ  |  i f Sd S(   s9   Return internal state; can be passed to setstate() later.N(   s   selfs   VERSIONs   supers   Randoms   getstates
   gauss_next(   s   self(    (    s#   /mit/python/lib/python2.3/random.pys   getstateh   s     c         C   s`   | d } | d j o, | \ } } |  _ t t |  ƒ i | ƒ n t d | |  i	 f ƒ ‚ d S(   s:   Restore internal state from object returned by getstate().i    i   s?   state with version %s passed to Random.setstate() of version %sN(
   s   states   versions   internalstates   selfs
   gauss_nexts   supers   Randoms   setstates
   ValueErrors   VERSION(   s   selfs   states   versions   internalstate(    (    s#   /mit/python/lib/python2.3/random.pys   setstatel   s     
c         C   s   |  i ƒ  Sd  S(   N(   s   selfs   getstate(   s   self(    (    s#   /mit/python/lib/python2.3/random.pys   __getstate__|   s    c         C   s   |  i | ƒ d  S(   N(   s   selfs   setstates   state(   s   selfs   state(    (    s#   /mit/python/lib/python2.3/random.pys   __setstate__   s    c         C   s   |  i f  |  i ƒ  f Sd  S(   N(   s   selfs	   __class__s   getstate(   s   self(    (    s#   /mit/python/lib/python2.3/random.pys
   __reduce__‚   s    i   l    c         C   sD  | | ƒ } | | j o t d ‚ n | | j of | d j oL | | j o t |  i	 ƒ | j o |  i | ƒ Sn | |  i	 ƒ  | ƒ Sn t d ‚ n | | ƒ } | | j o t d ‚ n | | }	 | d j o
 |	 d j o` |	 | j o t |  i	 ƒ | j o | | |  i |	 ƒ ƒ Sn | | | |  i	 ƒ  |	 ƒ ƒ Sn | d j o t d ‚ n | | ƒ } | | j o t d ‚ n | d j o |	 | d | }
 n- | d j  o |	 | d | }
 n
 t d ‚ |
 d j o t d ‚ n |
 | j o t |  i	 ƒ | j o | |  i |
 ƒ Sn | | | |  i	 ƒ  |
 ƒ Sd S(	   s  Choose a random item from range(start, stop[, step]).

        This fixes the problem with randint() which includes the
        endpoint; in Python this is usually not what you want.
        Do not supply the 'int', 'default', and 'maxwidth' arguments.
        s!   non-integer arg 1 for randrange()i    s   empty range for randrange()s    non-integer stop for randrange()i   s    non-integer step for randrange()s   zero step for randrange()N(   s   ints   starts   istarts
   ValueErrors   stops   defaults   maxwidths   types   selfs   randoms   _BuiltinMethods
   _randbelows   istops   widths   steps   isteps   n(   s   selfs   starts   stops   steps   ints   defaults   maxwidths   _BuiltinMethods   istarts   widths   ns   istops   istep(    (    s#   /mit/python/lib/python2.3/random.pys	   randrange‡   sB     #
#"	#c         C   s   |  i | | d ƒ Sd S(   sJ   Return random integer in range [a, b], including both end points.
        i   N(   s   selfs	   randranges   as   b(   s   selfs   as   b(    (    s#   /mit/python/lib/python2.3/random.pys   randintÆ   s     c         C   sª   | d | | d d ƒ ƒ }
 |  i } | } xs | | j oe | | ƒ  | ƒ } | }	 x7 |	 |
 j  o) | | >| | ƒ  | ƒ B} |	 | 7}	 qX W| |	 |
 L} q/ W| Sd S(   s£   Return a random int in the range [0,n)

        Handles the case where n has more bits than returned
        by a single call to the underlying generator.
        f1.0000100000000001i   i   N(   s   ints   _logs   ns   ks   selfs   randoms   rs   longs   maxwidths   bpfs   bits(   s   selfs   ns   bpfs   maxwidths   longs   _logs   ints   randoms   rs   bitss   k(    (    s#   /mit/python/lib/python2.3/random.pys
   _randbelowÌ   s     	  c         C   s"   | t |  i ƒ  t | ƒ ƒ Sd S(   s2   Choose a random element from a non-empty sequence.N(   s   seqs   ints   selfs   randoms   len(   s   selfs   seq(    (    s#   /mit/python/lib/python2.3/random.pys   choiceå   s     c         C   s~   | t j o |  i  } n x] t t | ƒ d d d ƒ D]? } | | ƒ  | d ƒ } | | | | f \ | | <| | <q7 Wd S(   sÓ  x, random=random.random -> shuffle list x in place; return None.

        Optional arg random is a 0-argument function returning a random
        float in [0.0, 1.0); by default, the standard random.random.

        Note that for even rather small len(x), the total number of
        permutations of x is larger than the period of most random number
        generators; this implies that "most" permutations of a long
        sequence can never be generated.
        i   i    iÿÿÿÿN(	   s   randoms   Nones   selfs   xranges   lens   xs   is   ints   j(   s   selfs   xs   randoms   ints   js   i(    (    s#   /mit/python/lib/python2.3/random.pys   shuffleé   s    
  c         C   s—  t  | ƒ } d | j o
 | j n o t d ‚ n |  i } t } t	 g | } | d | j  ob t | ƒ }
 xt | ƒ D]A } | | ƒ  | | ƒ } |
 | | | <|
 | | d |
 | <q~ WnÉ y2 | d j o! | d | | d | | d f Wn% t t f j
 o t | ƒ } n Xh  }	 xe t | ƒ D]W } | | ƒ  | ƒ } x% | |	 j o | | ƒ  | ƒ } qPW| | | | <|	 | <q4W| Sd S(   s8  Chooses k unique random elements from a population sequence.

        Returns a new list containing elements from the population while
        leaving the original population unchanged.  The resulting list is
        in selection order so that all sub-slices will also be valid random
        samples.  This allows raffle winners (the sample) to be partitioned
        into grand prize and second place winners (the subslices).

        Members of the population need not be hashable or unique.  If the
        population contains repeats, then each occurrence is a possible
        selection in the sample.

        To choose a sample in a range of integers, use xrange as an argument.
        This is especially fast and space efficient for sampling from a
        large population:   sample(xrange(10000000), 60)
        i    s   sample larger than populationi   i   i   N(   s   lens
   populations   ns   ks
   ValueErrors   selfs   randoms   ints   _ints   Nones   results   lists   pools   xranges   is   js	   TypeErrors   KeyErrors   tuples   selected(   s   selfs
   populations   ks   js   _ints   randoms   ns   is   results   selecteds   pool(    (    s#   /mit/python/lib/python2.3/random.pys   sampleü   s6     	 2  c         C   s   | | | |  i ƒ  Sd S(   s(   Get a random number in the range [a, b).N(   s   as   bs   selfs   random(   s   selfs   as   b(    (    s#   /mit/python/lib/python2.3/random.pys   uniform6  s     c         C   sw   |  i } x[ t oS | ƒ  } d | ƒ  } t | d | } | | d } | t | ƒ j o Pq q W| | | Sd S(   s\   Normal distribution.

        mu is the mean, and sigma is the standard deviation.

        f1.0f0.5f4.0N(   s   selfs   randoms   Trues   u1s   u2s   NV_MAGICCONSTs   zs   zzs   _logs   mus   sigma(   s   selfs   mus   sigmas   randoms   u1s   u2s   zzs   z(    (    s#   /mit/python/lib/python2.3/random.pys   normalvariate<  s     	 	
c         C   s   t  |  i | | ƒ ƒ Sd S(   sû   Log normal distribution.

        If you take the natural logarithm of this distribution, you'll get a
        normal distribution with mean mu and standard deviation sigma.
        mu can have any value, and sigma must be greater than zero.

        N(   s   _exps   selfs   normalvariates   mus   sigma(   s   selfs   mus   sigma(    (    s#   /mit/python/lib/python2.3/random.pys   lognormvariateU  s     c         C   s:   d k  } | i d t d ƒ | | |  i ƒ  d t Sd S(   s¢  Circular uniform distribution.

        mean is the mean angle, and arc is the range of the distribution,
        centered around the mean angle.  Both values must be expressed in
        radians.  Returned values range between mean - arc/2 and
        mean + arc/2 and are normalized to between 0 and pi.

        Deprecated in version 2.3.  Use:
            (mean + arc * (Random.random() - 0.5)) % Math.pi

        Nsf   The cunifvariate function is deprecated; Use (mean + arc * (Random.random() - 0.5)) % Math.pi instead.i   f0.5(   s   warningss   warns   DeprecationWarnings   means   arcs   selfs   randoms   _pi(   s   selfs   means   arcs   warnings(    (    s#   /mit/python/lib/python2.3/random.pys   cunifvariatea  s
     		
c         C   sC   |  i } | ƒ  } x | d j o | ƒ  } q Wt | ƒ | Sd S(   sì   Exponential distribution.

        lambd is 1.0 divided by the desired mean.  (The parameter would be
        called "lambda", but that is a reserved word in Python.)  Returned
        values range from 0 to positive infinity.

        f9.9999999999999995e-08N(   s   selfs   randoms   us   _logs   lambd(   s   selfs   lambds   randoms   u(    (    s#   /mit/python/lib/python2.3/random.pys   expovariatex  s     		 c         C   sH  |  i } | d j o t | ƒ  Sn d t d d | | ƒ } | t d | ƒ d | } d | | d | } xˆ t o€ | ƒ  } t
 t | ƒ } d | | | | } | | | } | ƒ  }
 |
 | d | j o |
 | t d | ƒ j o Pqv qv W| ƒ  }	 |	 d j o | t t | ƒ } n | t t | ƒ } | Sd S(   sF  Circular data distribution.

        mu is the mean angle, expressed in radians between 0 and 2*pi, and
        kappa is the concentration parameter, which must be greater than or
        equal to zero.  If kappa is equal to zero, this distribution reduces
        to a uniform random angle over the range 0 to 2*pi.

        f9.9999999999999995e-07f1.0f4.0f2.0f0.5N(   s   selfs   randoms   kappas   TWOPIs   _sqrts   as   bs   rs   Trues   u1s   _coss   _pis   zs   fs   cs   u2s   _exps   u3s   mus   _acoss   theta(   s   selfs   mus   kappas   as   bs   fs   cs   randoms   u1s   u3s   u2s   rs   thetas   z(    (    s#   /mit/python/lib/python2.3/random.pys   vonmisesvariate‹  s*     	 		1
	c         C   sG  | d j p
 | d j o t d ‚ n |  i } | d j o÷ t d | d ƒ } | t } | | } xÛt
 oÀ | ƒ  } d | j  o
 d j  n o qh n d | ƒ  } t | d | ƒ | } | t | ƒ } | | | } | | | | }
 |
 t d | d j p |
 t | ƒ j o | | Sqh qh Wn| d j o: | ƒ  } x | d j o | ƒ  } qMWt | ƒ | SnÉ x½ t
 oµ | ƒ  } t | t } | | }	 |	 d j o t |	 d | ƒ } n t | |	 | ƒ } | ƒ  } |	 d j o | t | ƒ j p$ |	 d j o | t | | d ƒ j o Pq~q~W| | Sd	 S(
   sx   Gamma distribution.  Not the gamma function!

        Conditions on the parameters are alpha > 0 and beta > 0.

        f0.0s*   gammavariate: alpha and beta must be > 0.0f1.0f2.0f9.9999999999999995e-08f0.99999990000000005f4.5i   N(   s   alphas   betas
   ValueErrors   selfs   randoms   _sqrts   ainvs   LOG4s   bbbs   cccs   Trues   u1s   u2s   _logs   vs   _exps   xs   zs   rs   SG_MAGICCONSTs   us   _es   bs   ps   pow(   s   selfs   alphas   betas   randoms   ainvs   u1s   bbbs   u2s   bs   ps   rs   us   vs   xs   zs   ccc(    (    s#   /mit/python/lib/python2.3/random.pys   gammavariate½  sL     	

 	,	  	
	I
c         C   s0   d  k  } | i d t d ƒ |  i | d ƒ Sd  S(   Ns@   The stdgamma function is deprecated; use gammavariate() instead.i   f1.0(   s   warningss   warns   DeprecationWarnings   selfs   gammavariates   alpha(   s   selfs   alphas   ainvs   bbbs   cccs   warnings(    (    s#   /mit/python/lib/python2.3/random.pys   stdgammaý  s    		
c         C   s‰   |  i } |  i } t |  _ | t j oQ | ƒ  t } t d t d | ƒ  ƒ ƒ } t
 | ƒ | } t | ƒ | |  _ n | | | Sd S(   sØ   Gaussian distribution.

        mu is the mean, and sigma is the standard deviation.  This is
        slightly faster than the normalvariate() function.

        Not thread-safe without a lock around calls.

        f-2.0f1.0N(   s   selfs   randoms
   gauss_nexts   zs   Nones   TWOPIs   x2pis   _sqrts   _logs   g2rads   _coss   _sins   mus   sigma(   s   selfs   mus   sigmas   randoms   x2pis   zs   g2rad(    (    s#   /mit/python/lib/python2.3/random.pys   gauss  s     			c         C   sC   |  i | d ƒ } | d j o d Sn | | |  i | d ƒ Sd S(   s   Beta distribution.

        Conditions on the parameters are alpha > -1 and beta} > -1.
        Returned values range between 0 and 1.

        f1.0i    f0.0N(   s   selfs   gammavariates   alphas   ys   beta(   s   selfs   alphas   betas   y(    (    s#   /mit/python/lib/python2.3/random.pys   betavariateH  s
     c         C   s)   d |  i ƒ  } d t | d | ƒ Sd S(   s3   Pareto distribution.  alpha is the shape parameter.f1.0N(   s   selfs   randoms   us   pows   alpha(   s   selfs   alphas   u(    (    s#   /mit/python/lib/python2.3/random.pys   paretovariateZ  s     c         C   s0   d |  i ƒ  } | t t | ƒ d | ƒ Sd S(   sf   Weibull distribution.

        alpha is the scale parameter and beta is the shape parameter.

        f1.0N(   s   selfs   randoms   us   alphas   pows   _logs   beta(   s   selfs   alphas   betas   u(    (    s#   /mit/python/lib/python2.3/random.pys   weibullvariatec  s     (#   s   __name__s
   __module__s   __doc__s   VERSIONs   Nones   __init__s   seeds   getstates   setstates   __getstate__s   __setstate__s
   __reduce__s   ints   BPFs   _BuiltinMethodTypes	   randranges   randints   longs   _logs
   _randbelows   choices   shuffles   samples   uniforms   normalvariates   lognormvariates   cunifvariates   expovariates   vonmisesvariates   gammavariates   stdgammas   gausss   betavariates   paretovariates   weibullvariate(    (    (    s#   /mit/python/lib/python2.3/random.pys   Random@   s6    						?			:						2	@		5			c           B   s\   t  Z d Z e d „ Z d „  Z d „  Z d „  Z d „  Z d d d d „ Z	 e d	 „ Z
 RS(
   Ni   c         C   sÓ   | t j o# d k } t | i ƒ  d ƒ } n t | t t f ƒ o t | ƒ } n t | d ƒ \ } } t | d ƒ \ } } t | d ƒ \ } } t | ƒ d t | ƒ d t | ƒ d f |  _ t |  _ d S(   s°  Initialize internal state from hashable object.

        None or no argument seeds from current time.

        If a is not None or an int or long, hash(a) is used instead.

        If a is an int or long, a is used directly.  Distinct values between
        0 and 27814431486575L inclusive are guaranteed to yield distinct
        internal states (this guarantee is specific to the default
        Wichmann-Hill generator).
        Ni   i<v  ibv  irv  i   (   s   as   Nones   times   longs
   isinstances   ints   hashs   divmods   xs   ys   zs   selfs   _seeds
   gauss_next(   s   selfs   as   zs   times   ys   x(    (    s#   /mit/python/lib/python2.3/random.pys   seedt  s     	0c         C   sn   |  i \ } } } d | d } d | d } d | d } | | | f |  _ | d | d | d	 d
 Sd S(   s3   Get the next random number in the range [0.0, 1.0).i«   i=v  i¬   icv  iª   isv  f30269.0f30307.0f30323.0f1.0N(   s   selfs   _seeds   xs   ys   z(   s   selfs   ys   xs   z(    (    s#   /mit/python/lib/python2.3/random.pys   random  s     c         C   s   |  i |  i |  i f Sd S(   s9   Return internal state; can be passed to setstate() later.N(   s   selfs   VERSIONs   _seeds
   gauss_next(   s   self(    (    s#   /mit/python/lib/python2.3/random.pys   getstate¯  s     c         C   sM   | d } | d j o | \ } |  _ |  _ n t d | |  i f ƒ ‚ d S(   s:   Restore internal state from object returned by getstate().i    i   s?   state with version %s passed to Random.setstate() of version %sN(   s   states   versions   selfs   _seeds
   gauss_nexts
   ValueErrors   VERSION(   s   selfs   states   version(    (    s#   /mit/python/lib/python2.3/random.pys   setstate³  s
     
c         C   s¦   | d j o t d ƒ ‚ n |  i \ } } } t | t d | d ƒ ƒ d } t | t d | d ƒ ƒ d } t | t d | d ƒ ƒ d } | | | f |  _ d	 S(
   sÃ  Act as if n calls to random() were made, but quickly.

        n is an int, greater than or equal to 0.

        Example use:  If you have 2 threads and know that each will
        consume no more than a million random numbers, create two Random
        objects r1 and r2, then do
            r2.setstate(r1.getstate())
            r2.jumpahead(1000000)
        Then r1 and r2 will use guaranteed-disjoint segments of the full
        period.
        i    s   n must be >= 0i«   i=v  i¬   icv  iª   isv  N(	   s   ns
   ValueErrors   selfs   _seeds   xs   ys   zs   ints   pow(   s   selfs   ns   ys   xs   z(    (    s#   /mit/python/lib/python2.3/random.pys	   jumpahead½  s        i    c         C   s  t  | ƒ t  | ƒ j o t  | ƒ j o
 t j n o t d ƒ ‚ n d | j o
 d j  n o9 d | j o
 d j  n o d | j o
 d j  n o t d ƒ ‚ n d | j o | j o
 | j n oz d k } t | i ƒ  d ƒ } t | d @| d ?Aƒ } t
 | d ƒ \ } } t
 | d ƒ \ } } t
 | d ƒ \ } } n | p d | p d | p d f |  _ t |  _ d S(	   sj   Set the Wichmann-Hill seed from (x, y, z).

        These must be integers in the range [0, 256).
        s   seeds must be integersi    i   s   seeds must be in range(0, 256)Niÿÿÿ i   i   (   s   types   xs   ys   zs   ints	   TypeErrors
   ValueErrors   times   longs   ts   divmods   selfs   _seeds   Nones
   gauss_next(   s   selfs   xs   ys   zs   ts   time(    (    s#   /mit/python/lib/python2.3/random.pys   __whseedÓ  s     =[*	'c         C   sÀ   | t j o |  i ƒ  d Sn t | ƒ } t | d ƒ \ } } t | d ƒ \ } } t | d ƒ \ } } | | d p d } | | d p d } | | d p d } |  i | | | ƒ d S(   sb  Seed from hashable object's hash code.

        None or no argument seeds from current time.  It is not guaranteed
        that objects with distinct hash codes lead to distinct internal
        states.

        This is obsolete, provided for compatibility with the seed routine
        used prior to Python 2.1.  Use the .seed() method instead.
        Ni   i   (	   s   as   Nones   selfs   _WichmannHill__whseeds   hashs   divmods   xs   ys   z(   s   selfs   as   ys   xs   z(    (    s#   /mit/python/lib/python2.3/random.pys   whseedê  s    	 
(   s   __name__s
   __module__s   VERSIONs   Nones   seeds   randoms   getstates   setstates	   jumpaheads   _WichmannHill__whseeds   whseed(    (    (    s#   /mit/python/lib/python2.3/random.pys   WichmannHillp  s   			
	c         C   s  d  k  }
 |  Gd G| GHt | | d ƒ } d } d }	 d } d } |
 i  ƒ  } xV t
 |  ƒ D]H } t | ƒ } | | 7} |	 | | }	 t | | ƒ } t | | ƒ } qY W|
 i  ƒ  } t | | d ƒ Gd G| |  } t |	 |  | | ƒ } d | | | | f GHd  S(	   Ns   timess   evalf0.0f10000000000.0f-10000000000.0i   s   sec,s!   avg %g, stddev %g, min %g, max %g(   s   times   ns   funccalls   compiles   codes   totals   sqsums   smallests   largests   t0s   ranges   is   evals   xs   mins   maxs   t1s   rounds   avgs   _sqrts   stddev(   s   ns   funccalls   codes   stddevs   is   largests   avgs   t0s   smallests   sqsums   times   xs   totals   t1(    (    s#   /mit/python/lib/python2.3/random.pys   _test_generator  s(    	 

iÐ  c         C   sÔ   t  |  d ƒ t  |  d ƒ t  |  d ƒ t  |  d ƒ t  |  d ƒ t  |  d ƒ t  |  d ƒ t  |  d ƒ t  |  d	 ƒ t  |  d
 ƒ t  |  d ƒ t  |  d ƒ t  |  d ƒ t  |  d ƒ t  |  d ƒ t  |  d ƒ d  S(   Ns   random()s   normalvariate(0.0, 1.0)s   lognormvariate(0.0, 1.0)s   cunifvariate(0.0, 1.0)s   vonmisesvariate(0.0, 1.0)s   gammavariate(0.01, 1.0)s   gammavariate(0.1, 1.0)s   gammavariate(0.1, 2.0)s   gammavariate(0.5, 1.0)s   gammavariate(0.9, 1.0)s   gammavariate(1.0, 1.0)s   gammavariate(2.0, 1.0)s   gammavariate(20.0, 1.0)s   gammavariate(200.0, 1.0)s   gauss(0.0, 1.0)s   betavariate(3.0, 3.0)(   s   _test_generators   N(   s   N(    (    s#   /mit/python/lib/python2.3/random.pys   _test  s     s   __main__(:   s   __doc__s   typess   BuiltinMethodTypes   _BuiltinMethodTypes   maths   logs   _logs   exps   _exps   pis   _pis   es   _es   sqrts   _sqrts   acoss   _acoss   coss   _coss   sins   _sins   floors   _floors   __all__s   NV_MAGICCONSTs   TWOPIs   LOG4s   SG_MAGICCONSTs   BPFs   _randoms   Randoms   WichmannHills   _test_generators   _tests   _insts   seeds   randoms   uniforms   randints   choices	   randranges   samples   shuffles   normalvariates   lognormvariates   cunifvariates   expovariates   vonmisesvariates   gammavariates   stdgammas   gausss   betavariates   paretovariates   weibullvariates   getstates   setstates	   jumpaheads   __name__(,   s   WichmannHills   _sins   _exps	   randranges   BPFs   _acoss   _randoms   _tests   randoms   paretovariates   normalvariates   gammavariates   samples   seeds   weibullvariates   shuffles   _floors   TWOPIs   __all__s   randints   vonmisesvariates   _pis   uniforms   stdgammas   expovariates   betavariates   _es   setstates   lognormvariates   _coss   LOG4s   gausss   choices	   jumpaheads   _logs   _BuiltinMethodTypes   _insts   getstates   _test_generators   SG_MAGICCONSTs   Randoms   cunifvariates   _sqrts   NV_MAGICCONST(    (    s#   /mit/python/lib/python2.3/random.pys   ?(   sT   N
	ÿ ÿ 2“																								