Did you know ... | Search Documentation: |
![]() | Pack logtalk -- logtalk-3.92.0/docs/apis/_sources/random_0.rst.txt |
.. index:: single: random .. _random/0:
.. rst-class:: right
object
random
Portable random number generator predicates. Core predicates originally written by Richard O'Keefe. Based on algorithm AS 183 from Applied Statistics.
| Availability:
| logtalk_load(random(loader))
| Author: Paulo Moura | Version: 2:12:1 | Date: 2025-04-07
| Compilation flags:
| static, context_switching_calls
| Implements:
| public
:ref:`pseudo_random_protocol <pseudo_random_protocol/0>`
| public
:ref:`sampling_protocol <sampling_protocol/0>`
| Uses:
| :ref:`list <list/0>`
| Remarks:
| Inherited public predicates:
| Â :ref:sampling_protocol/0::bernoulli/2
 :ref:sampling_protocol/0::beta/3
 :ref:random_protocol/0::between/3
 :ref:sampling_protocol/0::binomial/3
 :ref:sampling_protocol/0::chi_squared/2
 :ref:sampling_protocol/0::circular_uniform_cartesian/3
 :ref:sampling_protocol/0::circular_uniform_polar/3
 :ref:sampling_protocol/0::dirichlet/2
 :ref:random_protocol/0::enumerate/2
 :ref:sampling_protocol/0::exponential/2
 :ref:sampling_protocol/0::fisher/3
 :ref:sampling_protocol/0::gamma/3
 :ref:sampling_protocol/0::geometric/2
 :ref:pseudo_random_protocol/0::get_seed/1
 :ref:sampling_protocol/0::gumbel/3
 :ref:sampling_protocol/0::hypergeometric/4
 :ref:sampling_protocol/0::logistic/3
 :ref:sampling_protocol/0::lognormal/3
 :ref:sampling_protocol/0::logseries/2
 :ref:random_protocol/0::maybe/0
 :ref:random_protocol/0::maybe/1
 :ref:random_protocol/0::maybe/2
 :ref:random_protocol/0::maybe_call/1
 :ref:random_protocol/0::maybe_call/2
 :ref:random_protocol/0::member/2
 :ref:sampling_protocol/0::normal/3
 :ref:random_protocol/0::permutation/2
 :ref:sampling_protocol/0::poisson/2
 :ref:sampling_protocol/0::power/2
 :ref:random_protocol/0::random/1
 :ref:random_protocol/0::random/3
 :ref:random_protocol/0::randseq/4
 :ref:random_protocol/0::randset/4
 :ref:random_protocol/0::select/3
 :ref:random_protocol/0::select/4
 :ref:random_protocol/0::sequence/4
 :ref:random_protocol/0::set/4
 :ref:pseudo_random_protocol/0::set_seed/1
 :ref:sampling_protocol/0::standard_cauchy/3
 :ref:sampling_protocol/0::standard_exponential/1
 :ref:sampling_protocol/0::standard_gamma/2
 :ref:sampling_protocol/0::standard_normal/1
 :ref:sampling_protocol/0::standard_t/2
 :ref:random_protocol/0::swap/2
 :ref:random_protocol/0::swap_consecutive/2
 :ref:sampling_protocol/0::triangular/4
 :ref:sampling_protocol/0::uniform/1
 :ref:sampling_protocol/0::uniform/3
 :ref:sampling_protocol/0::von_mises/3
 :ref:sampling_protocol/0::wald/3
 :ref:sampling_protocol/0::weibull/3
Â
.. contents:: :local: :backlinks: top
.. index:: reset_seed/0 .. _random/0::reset_seed/0:
reset_seed/0 ^^^^^^^^^^^^^^^^
Resets the random generator seed to its default value. Use get_seed/1 and set_seed/1 instead if you need reproducibility.
| Compilation flags:
| static, synchronized
| Mode and number of proofs:
| reset_seed
- one
.. index:: randomize/1 .. _random/0::randomize/1:
randomize/1 ^^^^^^^^^^^^^^^
Randomizes the random generator using a positive integer to compute a new seed. Use of a large integer is recommended. In alternative, when using a small integer argument, discard the first dozen random values.
| Compilation flags:
| static, synchronized
| Template:
| randomize(Seed)
| Mode and number of proofs:
| randomize(+positive_integer)
- one
(no local declarations; see entity ancestors if any)
.. index:: seed_/3 .. _random/0::seed_/3:
seed_/3
^^^^^^^^^^^
Stores the current random generator seed values.
| Compilation flags:
| dynamic
| Template:
| seed_(S0,S1,S2)
| Mode and number of proofs:
| seed_(-integer,-integer,-integer)
- one
(none)
.. seealso::
:ref:`fast_random <fast_random/0>`, :ref:`backend_random <backend_random/0>`