Packages

c

scalation.random

RandomSet

case class RandomSet(count: Int = 10, max: Int = 20, skip: Int = -1, stream: Int = 0) extends VariateSet with Product with Serializable

The RandomSet class generates a random set/subset of integers.

count

the size of the set (number of integer elements)

max

generate integers in the range 0 (inclusive) to max (inclusive)

skip

skip this number, i.e, do not use it

stream

the random number stream

Linear Supertypes
Serializable, Serializable, Product, Equals, VariateSet, Error, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. RandomSet
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. VariateSet
  7. Error
  8. AnyRef
  9. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new RandomSet(count: Int = 10, max: Int = 20, skip: Int = -1, stream: Int = 0)

    count

    the size of the set (number of integer elements)

    max

    generate integers in the range 0 (inclusive) to max (inclusive)

    skip

    skip this number, i.e, do not use it

    stream

    the random number stream

Value Members

  1. val count: Int
  2. def discrete: Boolean

    Determine whether the distribution is discrete or continuous.

    Determine whether the distribution is discrete or continuous.

    Definition Classes
    VariateSet
  3. final def flaw(method: String, message: String): Unit

    Show the flaw by printing the error message.

    Show the flaw by printing the error message.

    method

    the method where the error occurred

    message

    the error message

    Definition Classes
    Error
  4. def gen: Set[Double]

    Determine the next random double set for the particular distribution.

    Determine the next random double set for the particular distribution.

    Definition Classes
    RandomSetVariateSet
  5. def igen(s: Set[Int], n: Int): Set[Int]

    Generate a set of unique integers 'r' that is a random subset of set 's'.

    Generate a set of unique integers 'r' that is a random subset of set 's'.

    s

    the given set

    n

    the size of the resultant random subset r

  6. def igen(n: Int, mx: Int, skp: Int = -1): Set[Int]

    Generate a random set of unique integers 'r' in the range '0 to mx'.

    Generate a random set of unique integers 'r' in the range '0 to mx'.

    n

    the size of the resultant random subset r

    mx

    generate integers in the range 0 (inclusive) to 'mx' (inclusive)

    skp

    skip this number, i.e, do not use it

  7. def igen: Set[Int]

    Generate a random set of unique integers 'r' in the range '0 to max'.

    Generate a random set of unique integers 'r' in the range '0 to max'. The size of the set is given by 'count'.

    Definition Classes
    RandomSetVariateSet
  8. val max: Int
  9. def mean: Double

    Compute the mean for the particular distribution.

    Compute the mean for the particular distribution.

    Definition Classes
    RandomSetVariateSet
  10. def pf(s: Set[Int]): Double

    Compute the probability function (pf): The probability density function (pdf) for continuous RVV's or the probability mass function (pmf) for discrete RVV's.

    Compute the probability function (pf): The probability density function (pdf) for continuous RVV's or the probability mass function (pmf) for discrete RVV's.

    Definition Classes
    RandomSetVariateSet
  11. val skip: Int
  12. val stream: Int