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
|
// -*- Mode: C++; indent-tabs-mode: nil; tab-width: 2 -*-
/*
* Copyright (C) 2011 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 warranty of
* MERCHANTABILITY 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/>.
*
* Authored by: Andrea Azzarone <andrea.azzarone@canonical.com>
*/
#include "ShortcutModel.h"
namespace unity
{
namespace shortcut
{
Model::Model(std::list<AbstractHint::Ptr> const& hints)
: categories_per_column(3, [] (int& target, int const& new_value) {
int cat_per_col = std::max<int>(1, new_value);
if (cat_per_col != target)
{
target = cat_per_col;
return true;
}
return false;
})
{
for (auto const& hint : hints)
AddHint(hint);
}
void Model::AddHint(AbstractHint::Ptr const& hint)
{
if (!hint)
return;
if (hints_.find(hint->category()) == hints_.end())
categories_.push_back(hint->category());
hints_[hint->category()].push_back(hint);
}
void Model::Fill()
{
for (auto const& category : categories_)
for (auto const& item : hints_[category])
item->Fill();
}
}
}
|