View source code
Display the source code in std/datetime/interval.d from which this page was generated on github.
Report a bug
If you spot a problem with this page, click here to create a Bugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using local clone.

std.datetime.interval.PosInfInterval.merge - multiple declarations

Function PosInfInterval.merge

Returns the union of two intervals

PosInfInterval merge (
  scope const Interval!TP interval
) const;

Parameters

NameDescription
interval The interval to merge with this interval.

Throws

DateTimeException if the two intervals do not intersect and are not adjacent or if the given interval is empty.

Note

There is no overload for merge which takes a NegInfInterval, because an interval going from negative infinity to positive infinity is not possible.

Example

assert(PosInfInterval!Date(Date(1996, 1, 2)).merge(
            Interval!Date(Date(1990, 7, 6), Date(2000, 8, 2))) ==
       PosInfInterval!Date(Date(1990, 7 , 6)));

assert(PosInfInterval!Date(Date(1996, 1, 2)).merge(
            Interval!Date(Date(1999, 1, 12), Date(2011, 9, 17))) ==
       PosInfInterval!Date(Date(1996, 1 , 2)));

Function PosInfInterval.merge

Returns the union of two intervals

PosInfInterval merge (
  scope const PosInfInterval interval
) const pure nothrow;

Parameters

NameDescription
interval The interval to merge with this interval.

Note

There is no overload for merge which takes a NegInfInterval, because an interval going from negative infinity to positive infinity is not possible.

Example

assert(PosInfInterval!Date(Date(1996, 1, 2)).merge(
            PosInfInterval!Date(Date(1990, 7, 6))) ==
       PosInfInterval!Date(Date(1990, 7 , 6)));

assert(PosInfInterval!Date(Date(1996, 1, 2)).merge(
            PosInfInterval!Date(Date(1999, 1, 12))) ==
       PosInfInterval!Date(Date(1996, 1 , 2)));

Authors

Jonathan M Davis

License

Boost License 1.0.