aboutsummaryrefslogtreecommitdiff
path: root/src/planner-aggregate.cpp
blob: 23a1230e6973b644277c5284a6454f08611412e4 (plain)
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
/*
 * 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-aggregate.h>

namespace ayatana {
namespace indicator {
namespace datetime {

/***
****
***/

class AggregatePlanner::Impl
{
public:
    Impl(AggregatePlanner* owner):
        m_owner(owner)
    {
    }

    ~Impl() =default;

    core::Property<std::vector<Appointment>>& appointments()
    {
        return m_appointments;
    }

    void add(const std::shared_ptr<Planner>& planner)
    {
        m_planners.push_back(planner);

        auto on_changed = [this](const std::vector<Appointment>&){rebuild();};
        auto connection = planner->appointments().changed().connect(on_changed);
        m_connections.push_back(connection);
    }

private:

    void rebuild()
    {
      // use a sorted aggregate vector of all our planners
      std::vector<Appointment> all;
      for (const auto& planner : m_planners) {
          const auto& walk = planner->appointments().get();
          all.insert(std::end(all), std::begin(walk), std::end(walk));
      }
      m_owner->sort(all);
      m_appointments.set(all);
    }

    const AggregatePlanner* m_owner = nullptr;
    core::Property<std::vector<Appointment>> m_appointments;
    std::vector<std::shared_ptr<Planner>> m_planners;
    std::vector<core::ScopedConnection> m_connections;
};

/***
****
***/

AggregatePlanner::AggregatePlanner():
  impl(new Impl{this})
{
}

AggregatePlanner::~AggregatePlanner()
{
}

core::Property<std::vector<Appointment>>&
AggregatePlanner::appointments()
{
    return impl->appointments();
}

void
AggregatePlanner::add(const std::shared_ptr<Planner>& planner)
{
    return impl->add(planner);
}

/***
****
***/

} // namespace datetime
} // namespace indicator
} // namespace ayatana