[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]

For a crontab-like schedule, this class computes the next occurance given a Start time and a specification of what the schedule looks like. The resolution at which this works is at the second level. The next occurance is always at least 1 second ahead. The class implements an algorithm that Starts at the highest precision (seconds) and continues to the lowest precicion (month). For each precision level the algorithm looks at the list of valid values and finds a value for each that is equal to or greater then the valid values supplied. If no equal or greater value was supplied, it will reset all higher precision elements to its minimum value.

The following tables list the members exposed by the ScheduleComputeHelper type.

Public Methods

  NameDescription
static memberComputeNextOccurance
Computes the next lowest date in milliseconds based on a specification and the from-time passed in.

Equals
Determines whether the specified Object is equal to the current Object.
(Inherited from Object.)
GetHashCode
Serves as a hash function for a particular type. GetHashCode() is suitable for use in hashing algorithms and data structures like a hash table.
(Inherited from Object.)
GetType
Gets the Type of the current instance.
(Inherited from Object.)
ToString
Returns a String that represents the current Object.
(Inherited from Object.)

Protected Methods

  NameDescription
Finalize
Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection.
(Inherited from Object.)
MemberwiseClone
Creates a shallow copy of the current Object.
(Inherited from Object.)