.\" Automatically generated by Pod::Man 4.14 (Pod::Simple 3.42)
.\"
.\" Standard preamble:
.\" ========================================================================
.de Sp \" Vertical space (when we can't use .PP)
.if t .sp .5v
.if n .sp
..
.de Vb \" Begin verbatim text
.ft CW
.nf
.ne \\$1
..
.de Ve \" End verbatim text
.ft R
.fi
..
.\" Set up some character translations and predefined strings.  \*(-- will
.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
.\" double quote, and \*(R" will give a right double quote.  \*(C+ will
.\" give a nicer C++.  Capital omega is used to do unbreakable dashes and
.\" therefore won't be available.  \*(C` and \*(C' expand to `' in nroff,
.\" nothing in troff, for use with C<>.
.tr \(*W-
.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
.ie n \{\
.    ds -- \(*W-
.    ds PI pi
.    if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
.    if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\"  diablo 12 pitch
.    ds L" ""
.    ds R" ""
.    ds C` ""
.    ds C' ""
'br\}
.el\{\
.    ds -- \|\(em\|
.    ds PI \(*p
.    ds L" ``
.    ds R" ''
.    ds C`
.    ds C'
'br\}
.\"
.\" Escape single quotes in literal strings from groff's Unicode transform.
.ie \n(.g .ds Aq \(aq
.el       .ds Aq '
.\"
.\" If the F register is >0, we'll generate index entries on stderr for
.\" titles (.TH), headers (.SH), subsections (.SS), items (.Ip), and index
.\" entries marked with X<> in POD.  Of course, you'll have to process the
.\" output yourself in some meaningful fashion.
.\"
.\" Avoid warning from groff about undefined register 'F'.
.de IX
..
.nr rF 0
.if \n(.g .if rF .nr rF 1
.if (\n(rF:(\n(.g==0)) \{\
.    if \nF \{\
.        de IX
.        tm Index:\\$1\t\\n%\t"\\$2"
..
.        if !\nF==2 \{\
.            nr % 0
.            nr F 2
.        \}
.    \}
.\}
.rr rF
.\"
.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
.\" Fear.  Run.  Save yourself.  No user-serviceable parts.
.    \" fudge factors for nroff and troff
.if n \{\
.    ds #H 0
.    ds #V .8m
.    ds #F .3m
.    ds #[ \f1
.    ds #] \fP
.\}
.if t \{\
.    ds #H ((1u-(\\\\n(.fu%2u))*.13m)
.    ds #V .6m
.    ds #F 0
.    ds #[ \&
.    ds #] \&
.\}
.    \" simple accents for nroff and troff
.if n \{\
.    ds ' \&
.    ds ` \&
.    ds ^ \&
.    ds , \&
.    ds ~ ~
.    ds /
.\}
.if t \{\
.    ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
.    ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
.    ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
.    ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
.    ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
.    ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
.\}
.    \" troff and (daisy-wheel) nroff accents
.ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
.ds 8 \h'\*(#H'\(*b\h'-\*(#H'
.ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
.ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
.ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
.ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
.ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
.ds ae a\h'-(\w'a'u*4/10)'e
.ds Ae A\h'-(\w'A'u*4/10)'E
.    \" corrections for vroff
.if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
.if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
.    \" for low resolution devices (crt and lpr)
.if \n(.H>23 .if \n(.V>19 \
\{\
.    ds : e
.    ds 8 ss
.    ds o a
.    ds d- d\h'-1'\(ga
.    ds D- D\h'-1'\(hy
.    ds th \o'bp'
.    ds Th \o'LP'
.    ds ae ae
.    ds Ae AE
.\}
.rm #[ #] #H #V #F C
.\" ========================================================================
.\"
.IX Title "Set::Infinite::_recurrence 3pm"
.TH Set::Infinite::_recurrence 3pm "2022-06-13" "perl v5.34.0" "User Contributed Perl Documentation"
.\" For nroff, turn off justification.  Always turn off hyphenation; it makes
.\" way too many mistakes in technical documents.
.if n .ad l
.nh
.SH "NAME"
Set::Infinite::_recurrence \- Extends Set::Infinite with recurrence functions
.SH "SYNOPSIS"
.IX Header "SYNOPSIS"
.Vb 1
\&    $recurrence = $base_set\->_recurrence ( \e&next, \e&previous );
.Ve
.SH "DESCRIPTION"
.IX Header "DESCRIPTION"
This is an internal class used by the DateTime::Set module.
The \s-1API\s0 is subject to change.
.PP
It provides all functionality provided by Set::Infinite, plus the ability
to define recurrences with arbitrary objects, such as dates.
.SH "METHODS"
.IX Header "METHODS"
.IP "\(bu" 4
_recurrence ( \e&next, \e&previous )
.Sp
Creates a recurrence set. The set is defined inside a 'base set'.
.Sp
.Vb 1
\&   $recurrence = $base_set\->_recurrence ( \e&next, \e&previous );
.Ve
.Sp
The recurrence functions take one argument, and return the 'next' or 
the 'previous' occurrence.
.Sp
Example: defines the set of all 'integer numbers':
.Sp
.Vb 1
\&    use strict;
\&
\&    use Set::Infinite::_recurrence;
\&    use POSIX qw(floor);
\&
\&    # define the recurrence span
\&    my $forever = Set::Infinite::_recurrence\->new( 
\&        Set::Infinite::_recurrence::NEG_INFINITY, 
\&        Set::Infinite::_recurrence::INFINITY
\&    );
\&
\&    my $recurrence = $forever\->_recurrence(
\&        sub {   # next
\&                floor( $_[0] + 1 ) 
\&            },   
\&        sub {   # previous
\&                my $tmp = floor( $_[0] ); 
\&                $tmp < $_[0] ? $tmp : $_[0] \- 1
\&            },   
\&    );
\&
\&    print "sample recurrence ",
\&          $recurrence\->intersection( \-5, 5 ), "\en";
\&    # sample recurrence \-5,\-4,\-3,\-2,\-1,0,1,2,3,4,5
\&
\&    {
\&        my $x = 234.567;
\&        print "next occurrence after $x = ",
\&              $recurrence\->{param}[0]\->( $x ), "\en";  # 235
\&        print "previous occurrence before $x = ",
\&              $recurrence\->{param}[2]\->( $x ), "\en";  # 234
\&    }
\&
\&    {
\&        my $x = 234;
\&        print "next occurrence after $x = ",
\&              $recurrence\->{param}[0]\->( $x ), "\en";  # 235
\&        print "previous occurrence before $x = ",
\&              $recurrence\->{param}[2]\->( $x ), "\en";  # 233
\&    }
.Ve
.IP "\(bu" 4
is_forever
.Sp
Returns true if the set is a single span, 
ranging from \-Infinity to Infinity.
.IP "\(bu" 4
_is_recurrence
.Sp
Returns true if the set is an unbounded recurrence, 
ranging from \-Infinity to Infinity.
.SH "CONSTANTS"
.IX Header "CONSTANTS"
.IP "\(bu" 4
\&\s-1INFINITY\s0
.Sp
The \f(CW\*(C`Infinity\*(C'\fR value.
.IP "\(bu" 4
\&\s-1NEG_INFINITY\s0
.Sp
The \f(CW\*(C`\-Infinity\*(C'\fR value.
.SH "SUPPORT"
.IX Header "SUPPORT"
Support is offered through the \f(CW\*(C`datetime@perl.org\*(C'\fR mailing list.
.PP
Please report bugs using rt.cpan.org
.SH "AUTHOR"
.IX Header "AUTHOR"
Flavio Soibelmann Glock <fglock@gmail.com>
.PP
The recurrence generation algorithm is based on an idea from Dave Rolsky.
.SH "COPYRIGHT"
.IX Header "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.
.PP
The full text of the license can be found in the \s-1LICENSE\s0 file
included with this module.
.SH "SEE ALSO"
.IX Header "SEE ALSO"
Set::Infinite
.PP
DateTime::Set
.PP
For details on the Perl DateTime Suite project please see
<http://datetime.perl.org>.