Libraries/LibGUI/GModelSelection.h


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

#pragma once

#include <AK/HashTable.h>
#include <LibGUI/GModelIndex.h>

class GAbstractView;

class GModelSelection {
public:
    GModelSelection(GAbstractView& view)
        : m_view(view)
    {
    }

    int size() const { return m_indexes.size(); }
    bool is_empty() const { return m_indexes.is_empty(); }
    bool contains(const GModelIndex& index) const { return m_indexes.contains(index); }
    bool contains_row(int row) const
    {
        for (auto& index : m_indexes) {
            if (index.row() == row)
                return true;
        }
        return false;
    }

    void set(const GModelIndex&);
    void add(const GModelIndex&);
    void toggle(const GModelIndex&);
    bool remove(const GModelIndex&);
    void clear();

    template<typename Callback>
    void for_each_index(Callback callback)
    {
        for (auto& index : indexes())
            callback(index);
    }

    template<typename Callback>
    void for_each_index(Callback callback) const
    {
        for (auto& index : indexes())
            callback(index);
    }

    Vector<GModelIndex> indexes() const
    {
        Vector<GModelIndex> selected_indexes;

        for (auto& index : m_indexes)
            selected_indexes.append(index);
            
        return selected_indexes;
    }

    // FIXME: This doesn't guarantee that what you get is the lowest or "first" index selected..
    GModelIndex first() const
    {
        if (m_indexes.is_empty())
            return {};
        return *m_indexes.begin();
    }

private:
    GAbstractView& m_view;
    HashTable<GModelIndex> m_indexes;
};