NAME
DateTime::Set - Date/time sets math
SYNOPSIS
use DateTime;
use DateTime::Set;
$date1 = DateTime->new( year => 2002, month => 3, day => 11 );
$set1 = DateTime::Set->from_datetimes( dates => [ $date1 ] );
# set1 = 2002-03-11
$date2 = DateTime->new( year => 2003, month => 4, day => 12 );
$set2 = DateTime::Set->from_datetimes( dates => [ $date1, $date2 ] );
# set2 = 2002-03-11, and 2003-04-12
# a 'monthly' recurrence:
$set = DateTime::Set->from_recurrence(
recurrence => sub {
$_[0]->truncate( to => 'month' )->add( months => 1 )
},
span => $date_span1, # optional span
);
$set = $set1->union( $set2 ); # like "OR", "insert", "both"
$set = $set1->complement( $set2 ); # like "delete", "remove"
$set = $set1->intersection( $set2 ); # like "AND", "while"
$set = $set1->complement; # like "NOT", "negate", "invert"
if ( $set1->intersects( $set2 ) ) { ... # like "touches", "interferes"
if ( $set1->contains( $set2 ) ) { ... # like "is-fully-inside"
# data extraction
$date = $set1->min; # first date of the set
$date = $set1->max; # last date of the set
$iter = $set1->iterator;
while ( $dt = $iter->next ) {
print $dt->ymd;
};
DESCRIPTION
DateTime::Set is a module for date/time sets. It can be used to handle two different types of sets.
The first is a fixed set of predefined datetime objects. For example, if we wanted to create a set of dates containing the birthdays of people in our family.
The second type of set that it can handle is one based on the idea of a recurrence, such as "every Wednesday", or "noon on the 15th day of every month". This type of set can be have a fixed start and end datetime, but neither is required. So our "every Wednesday set" could be "every Wednesday from the beginning of time until the end of time", or "every Wednesday after 2003-03-05 until the end of time", or "every Wednesday between 2003-03-05 and 2004-01-07".
METHODS
from_datetimes
Creates a new set from a list of dates.
$dates = DateTime::Set->from_datetimes( dates => [ $dt1, $dt2, $dt3 ] );
from_recurrence
Creates a new set specified via a "recurrence" callback.
$months = DateTime::Set->from_recurrence( span => $dt_span_this_year, # optional span recurrence => sub { $_[0]->truncate( to => 'month' )->add( months => 1 ) }, );
The
span
parameter is optional. It must be aDateTime::Span
object.The span can also be specified using
begin
/after
andend
/before
DateTime objects, as in theDateTime::Span
constructor. In this case, if there is aspan
parameter it will be ignored.$months = DateTime::Set->from_recurrence( after => $dt_now, recurrence => sub { $_[0]->truncate( to => 'month' )->add( months => 1 ) }, );
empty_set
Creates a new empty set.
add_duration( $duration )
$dtd = new DateTime::Duration( year => 1 ); $new_set = $set->add( duration => $dtd );
This method returns a new set which is the same as the existing set with the specified duration added to every element of the set.
add
$meetings_2004 = $meetings_2003->add( years => 1 );
This method creates a new
DateTime::Duration
object based on the parameters given and passes it to theadd_duration()
method.subtract_duration( $duration_object )
When given a
DateTime::Duration
object, this method simply callsinvert()
on that object and passes that new duration to theadd_duration
method.subtract( DateTime::Duration->new parameters )
Like
add()
, this is syntactic sugar for thesubtract_duration()
method.min / max
The first and last dates in the set. These methods may return
undef
if the set is empty.span
Returns the total span of the set, as a
DateTime::Span
object.iterator / next
These methods can be used to iterate over the dates in a set.
$iter = $set1->iterator; while ( $dt = $iter->next ) { print $dt->ymd; }
The
next()
orprevious()
method will returnundef
when there are no more datetimes in the iterator.Obviously, if a set is specified as a recurrence and has no fixed end datetime, then it may never stop returning datetimes. User beware!
as_list
Returns a list of
DateTime
objects.If a set is specified as a recurrence and has no fixed begin or end datetimes, then
as_list
will returnundef
. Please note that this is explicitly not an empty list, since an empty list is a valid return value for empty sets!union / intersection / complement
Set operations.
$set = $set1->union( $set2 ); # like "OR", "insert", "both" $set = $set1->complement( $set2 ); # like "delete", "remove" $set = $set1->intersection( $set2 ); # like "AND", "while" $set = $set1->complement; # like "NOT", "negate", "invert"
The
union
with aDateTime::Span
or aDateTime::SpanSet
object returns aDateTime::SpanSet
object.All other operations always return a
DateTime::Set
.intersects / contains
These set operations result in a boolean value.
if ( $set1->intersects( $set2 ) ) { ... # like "touches", "interferes" if ( $set1->contains( $set2 ) ) { ... # like "is-fully-inside"
SUPPORT
Support is offered through the datetime@perl.org
mailing list.
Please report bugs using rt.cpan.org
AUTHOR
Flavio Soibelmann Glock <fglock@pucrs.br>
The API was developed together with Dave Rolsky and the DateTime Community.
COPYRIGHT
Copyright (c) 2003 Flavio Soibelmann Glock. All rights reserved. This program is free software; you can distribute it and/or modify it under the same terms as Perl itself.
The full text of the license can be found in the LICENSE file included with this module.
SEE ALSO
Set::Infinite
For details on the Perl DateTime Suite project please see http://perl-date-time.sf.net.