If there is no matching time before the end of the next instance of the next higher component to the highest specified component in the DateComponents argument, the algorithm will return the next existing time which exists.
case nextTimes20FoundationEssentials8CalendarV14MatchingPolicyO8nextTimeyA2EmF What are these?4AIOBFor example, during a daylight saving transition there may be no 2:37am. The result would then be 3:00am, if that does exist.
import FoundationEssentialsenum MatchingPolicyA hint to the search algorithm to control the method used for searching for dates.
struct CalendarCalendar encapsulates information about systems of reckoning time in which the beginning, length, and divisions of a year are defined. It provides information about the calendar and support for calendrical computations such as determining the range of a given calendrical unit and adding units to a given absolute time.
case nextTimePreservingSmallerComponentsIf specified, and there is no matching time before the end of the next instance of the next higher component to the highest specified component in the DateComponents argument, the method will return the next existing value of the missing component and preserves the lower components’ values (e.g., no 2:37am results in 3:37am, if that exists).
case previousTimePreservingSmallerComponentsIf there is no matching time before the end of the next instance of the next higher component to the highest specified component in the DateComponents argument, the algorithm will return the previous existing value of the missing component and preserves the lower components’ values.
case strictIf specified, the algorithm travels as far forward or backward as necessary looking for a match.