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
|
/*
* Copyright 2014 Canonical Ltd.
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 3, as published
* by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranties of
* MERCHANTABILITY, SATISFACTORY QUALITY, or FITNESS FOR A PARTICULAR
* PURPOSE. See the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Authors:
* Charles Kerr <charles.kerr@canonical.com>
*/
#include <datetime/planner.h>
#include <algorithm>
namespace unity {
namespace indicator {
namespace datetime {
/***
****
***/
Planner::Planner()
{
}
Planner::~Planner()
{
}
#if 0
void
Planner::set_range_to_calendar_month(const DateTime& dt)
{
// use appointments that occur in dt's calendar month
impl->set_range_to_upcoming_month(dt.add_full(0, // no years
0, // no months
-(dt.day_of_month()-1),
-dt.hour(),
-dt.minute(),
-dt.seconds());
}
void
Planner::set_range_to_upcoming_month(const DateTime& begin)
{
// use appointments that occur in [dt...dt+1month]
const auto end = begin.add_full(0, 1, 0, 0, 0, -0.1);
const char * fmt = "%F %T";
g_debug("RangePlanner %p setting range [%s..%s]",
this,
begin.format(fmt).c_str(),
end.format(fmt).c_str());
range().set(std::make_pair(begin,end));
}
#endif
void
Planner::sort(std::vector<Appointment>& appts)
{
std::sort(std::begin(appts),
std::end(appts),
[](const Appointment& a, const Appointment& b){return a.begin < b.begin;});
}
void
Planner::trim(std::vector<Appointment>& appts,
const DateTime& begin,
const DateTime& end)
{
std::vector<Appointment> tmp;
auto predicate = [begin,end](const Appointment& a){return begin<=a.begin && a.begin<=end;};
std::copy_if(std::begin(appts), std::end(appts), std::back_inserter(tmp), predicate);
appts.swap(tmp);
}
/***
****
***/
} // namespace datetime
} // namespace indicator
} // namespace unity
|
