RandomIndexPermutation Class

Provides methods to randomly permute the elements in an IndexCollection instance.

Definition

Namespace: Novacta.Analytics
Assembly: Novacta.Analytics (in Novacta.Analytics.dll) Version: 2.1.0+428f3840cfab98dda567bb0ed350b302533e273a

C#

public class RandomIndexPermutation : RandomDevice

VB

Public Class RandomIndexPermutation
	Inherits RandomDevice

C++

public ref class RandomIndexPermutation : public RandomDevice

F#

type RandomIndexPermutation = 
    class
        inherit RandomDevice
    end

The current implementation of the RandomIndexPermutation class is based on the Donald E. Knuth's Algorithm P (Shuffling, p. 145)^[1].

RandomIndexPermutation(IndexCollection)	Initializes a new instance of the RandomIndexPermutation class able to permute the specified IndexCollection.
RandomIndexPermutation(IndexCollection, Boolean)	Initializes a new instance of the RandomIndexPermutation class able to permute the specified IndexCollection, eventually copied.

Indexes	Gets the indexes to permute.
RandomNumberGenerator	Gets or sets the basic random generator for this instance. (Inherited from RandomDevice)

Equals	Determines whether the specified object is equal to the current object. (Inherited from Object)
Finalize	Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object)
GetHashCode	Serves as the default hash function. (Inherited from Object)
GetType	Gets the Type of the current instance. (Inherited from Object)
MemberwiseClone	Creates a shallow copy of the current Object. (Inherited from Object)
Next	Returns a random permutation of the Indexes of this instance.
ToString	Returns a string that represents the current object. (Inherited from Object)

[1] Knuth, D.E., The Art of Computer Programming, Volume 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA, third edition. (1997)