jcs.org
Serenity Operating System
1/*
2 * Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are met:
7 *
8 * 1. Redistributions of source code must retain the above copyright notice, this
9 * list of conditions and the following disclaimer.
10 *
11 * 2. Redistributions in binary form must reproduce the above copyright notice,
12 * this list of conditions and the following disclaimer in the documentation
13 * and/or other materials provided with the distribution.
14 *
15 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
16 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
18 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
21 * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
22 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
23 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
24 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 */
26
27#pragma once
28
29#include <AK/HashTable.h>
30#include <AK/Vector.h>
31#include <LibGUI/ModelIndex.h>
32
33namespace GUI {
34
35class ModelSelection {
36public:
37 ModelSelection(AbstractView& view)
38 : m_view(view)
39 {
40 }
41
42 int size() const { return m_indexes.size(); }
43 bool is_empty() const { return m_indexes.is_empty(); }
44 bool contains(const ModelIndex& index) const { return m_indexes.contains(index); }
45 bool contains_row(int row) const
46 {
47 for (auto& index : m_indexes) {
48 if (index.row() == row)
49 return true;
50 }
51 return false;
52 }
53
54 void set(const ModelIndex&);
55 void add(const ModelIndex&);
56 void toggle(const ModelIndex&);
57 bool remove(const ModelIndex&);
58 void clear();
59
60 template<typename Callback>
61 void for_each_index(Callback callback)
62 {
63 for (auto& index : indexes())
64 callback(index);
65 }
66
67 template<typename Callback>
68 void for_each_index(Callback callback) const
69 {
70 for (auto& index : indexes())
71 callback(index);
72 }
73
74 Vector<ModelIndex> indexes() const
75 {
76 Vector<ModelIndex> selected_indexes;
77
78 for (auto& index : m_indexes)
79 selected_indexes.append(index);
80
81 return selected_indexes;
82 }
83
84 // FIXME: This doesn't guarantee that what you get is the lowest or "first" index selected..
85 ModelIndex first() const
86 {
87 if (m_indexes.is_empty())
88 return {};
89 return *m_indexes.begin();
90 }
91
92private:
93 AbstractView& m_view;
94 HashTable<ModelIndex> m_indexes;
95};
96
97}