1 | 2  Next
All Samples(10569)  |  Call(9444)  |  Derive(0)  |  Import(1125)
Return random integer in range [a, b], including both end points.
        


All Samples(8859)  |  Call(7670)  |  Derive(40)  |  Import(1149)
random() -> x in the interval [0, 1).

All Samples(5574)  |  Call(5046)  |  Derive(0)  |  Import(528)
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.

All Samples(5377)  |  Call(4752)  |  Derive(0)  |  Import(625)
Choose a random element from a non-empty sequence.

All Samples(2674)  |  Call(2571)  |  Derive(0)  |  Import(103)
Get a random number in the range [a, b) or [a, b] depending on rounding.

All Samples(2292)  |  Call(1933)  |  Derive(0)  |  Import(359)
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.

All Samples(1837)  |  Call(1513)  |  Derive(0)  |  Import(324)
Initialize internal state from hashable object.

None or no argument seeds from current time or from an operating
system specific randomness source if available.

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

All Samples(882)  |  Call(753)  |  Derive(0)  |  Import(129)
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(more...)

All Samples(694)  |  Call(533)  |  Derive(0)  |  Import(161)
Exponential distribution.

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

All Samples(550)  |  Call(514)  |  Derive(0)  |  Import(36)
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.

All Samples(148)  |  Call(139)  |  Derive(0)  |  Import(9)
Normal distribution.

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

All Samples(127)  |  Call(120)  |  Derive(0)  |  Import(7)
getrandbits(k) -> x.  Generates a long int with k random bits.

All Samples(77)  |  Call(59)  |  Derive(0)  |  Import(18)
Alternate random number generator using sources provided
by the operating system (such as /dev/urandom on Unix or
CryptGenRandom on Windows).

 Not available on all systems (see os.urandom() for details).

All Samples(70)  |  Call(69)  |  Derive(1)  |  Import(0)
No Document.

All Samples(74)  |  Call(74)  |  Derive(0)  |  Import(0)
No Document.

All Samples(26)  |  Call(26)  |  Derive(0)  |  Import(0)
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.

All Samples(20)  |  Call(16)  |  Derive(0)  |  Import(4)
Triangular distribution.

Continuous distribution bounded by given lower and upper limits,
and having a given mode value in-between.

http://en.wikipedia.org/wiki/Triangular_distribution

All Samples(12)  |  Call(12)  |  Derive(0)  |  Import(0)
Pareto distribution.  alpha is the shape parameter.

All Samples(11)  |  Call(11)  |  Derive(0)  |  Import(0)
Return internal state; can be passed to setstate() later.

  1 | 2  Next