periodical 0.3.0

Management of all kinds of time intervals, use it to manage schedules, find overlaps, and more!
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151

//! Interval splitting iterators
//!
//! See [`intervals::ops::split`](crate::intervals::ops::split) for more details.

use jiff::tz::TimeZone;

use crate::intervals::absolute::{
    AbsBoundPair,
    AbsFiniteBoundPos,
    AbsStartBound,
    BoundedAbsInterval,
    HalfBoundedAbsInterval,
    HasAbsBoundPair,
};
use crate::intervals::meta::BoundInclusivity;
use crate::intervals::ops::cut::{CutResult, CutType, Cuttable};
use crate::intervals::relative::BoundedRelInterval;
use crate::time::CalendarAnchorOffset;

/// Split by [`NaiveDuration`] iterator
#[derive(Debug, Clone, PartialEq, Eq)]
pub struct NaiveDurationSplit {
    remaining_interval: AbsBoundPair,
    calendar_anchor_offset: CalendarAnchorOffset,
    tz: TimeZone,
    exhausted: bool,
}

impl NaiveDurationSplit {
    #[must_use]
    pub fn new<I>(interval: &I, calendar_anchor_offset: CalendarAnchorOffset, tz: TimeZone) -> Self
    where
        I: HasAbsBoundPair,
    {
        NaiveDurationSplit {
            remaining_interval: interval.abs_bound_pair(),
            calendar_anchor_offset,
            tz,
            exhausted: false,
        }
    }
}

impl Iterator for NaiveDurationSplit {
    type Item = AbsBoundPair;

    fn next(&mut self) -> Option<Self::Item> {
        if self.exhausted {
            return None;
        }

        todo!()

        // match self.remaining_interval.start().finite() {
        //     None => {
        //         // If the start is infinite, then we create an interval that spans
        //         // from -inf to midnight (in the given timezone) of the minimum supported date (excluded)
        //         let Some(new_end) = NaiveDate::MIN
        //             .and_time(NAIVE_TIME_MIDNIGHT)
        //             .and_local_timezone(self.tz.clone())
        //             .earliest()
        //         else {
        //             self.exhausted = true;
        //             return None;
        //         };

        //         let CutResult::Cut(infinite_start, remaining_interval) = self.remaining_interval.cut_at(
        //             new_end.with_timezone(&Utc),
        //             CutType::new(BoundInclusivity::Exclusive, BoundInclusivity::Inclusive),
        //         ) else {
        //             self.exhausted = true;
        //             return None;
        //         };

        //         self.remaining_interval = remaining_interval;
        //         Some(infinite_start)
        //     },
        //     Some(start_bound) => {
        //         todo!()
        //     },
        // }
    }
}

// #[derive(Debug, Clone, PartialEq, Eq, Hash)]
// pub struct NaiveDurationRSplit<Tz> {
//     remaining_interval: AbsBoundPair,
//     calendar_anchor_offset: NaiveDuration,
//     splitting_strategy: SplittingStrategy,
//     tz: Tz,
//     exhausted: bool,
// }

// impl<Tz> NaiveDurationRSplit<Tz>
// where
//     Tz: TimeZone,
// {
//     #[must_use]
//     pub fn new<I>(interval: I, calendar_anchor_offset: NaiveDuration, splitting_strategy: SplittingStrategy, tz: Tz)
// -> Self     where
//         I: HasAbsBoundPair,
//     {
//         NaiveDurationRSplit {
//             remaining_interval: interval.abs_bound_pair(),
//             calendar_anchor_offset,
//             splitting_strategy,
//             tz,
//             exhausted: false,
//         }
//     }
// }

#[derive(Debug, Clone, PartialEq, Eq, Hash)]
pub struct IntervalSplit<I> {
    remaining_interval: I,
    splitter: BoundedRelInterval,
}

impl<I> IntervalSplit<I>
where
    I: HasAbsBoundPair,
{
    #[must_use]
    pub fn new(interval: I, splitter: BoundedRelInterval) -> Self {
        IntervalSplit {
            remaining_interval: interval,
            splitter,
        }
    }
}

// #[derive(Debug, Clone, PartialEq, Eq, Hash)]
// pub struct IntervalRSplit<I> {
//     remaining_interval: I,
//     splitter: BoundedRelInterval,
//     splitting_strategy: SplittingStrategy,
// }

// impl<I> IntervalRSplit<I>
// where
//     I: HasAbsBoundPair,
// {
//     #[must_use]
//     pub fn new(interval: I, splitter: BoundedRelInterval, splitting_strategy: SplittingStrategy) -> Self {
//         IntervalRSplit {
//             remaining_interval: interval,
//             splitter,
//             splitting_strategy,
//         }
//     }
// }