ModelSelection.cpp 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117
  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. #include <AK/Badge.h>
  27. #include <LibGUI/AbstractView.h>
  28. #include <LibGUI/Model.h>
  29. #include <LibGUI/ModelSelection.h>
  30. namespace GUI {
  31. void ModelSelection::remove_matching(Function<bool(const ModelIndex&)> filter)
  32. {
  33. Vector<ModelIndex> to_remove;
  34. for (auto& index : m_indexes) {
  35. if (filter(index))
  36. to_remove.append(index);
  37. }
  38. if (!to_remove.is_empty()) {
  39. for (auto& index : to_remove)
  40. m_indexes.remove(index);
  41. notify_selection_changed();
  42. }
  43. }
  44. void ModelSelection::set(const ModelIndex& index)
  45. {
  46. ASSERT(index.is_valid());
  47. if (m_indexes.size() == 1 && m_indexes.contains(index))
  48. return;
  49. m_indexes.clear();
  50. m_indexes.set(index);
  51. notify_selection_changed();
  52. }
  53. void ModelSelection::add(const ModelIndex& index)
  54. {
  55. ASSERT(index.is_valid());
  56. if (m_indexes.contains(index))
  57. return;
  58. m_indexes.set(index);
  59. notify_selection_changed();
  60. }
  61. void ModelSelection::add_all(const Vector<ModelIndex>& indices)
  62. {
  63. {
  64. TemporaryChange notify_change { m_disable_notify, true };
  65. for (auto& index : indices)
  66. add(index);
  67. }
  68. if (m_notify_pending)
  69. notify_selection_changed();
  70. }
  71. void ModelSelection::toggle(const ModelIndex& index)
  72. {
  73. ASSERT(index.is_valid());
  74. if (m_indexes.contains(index))
  75. m_indexes.remove(index);
  76. else
  77. m_indexes.set(index);
  78. notify_selection_changed();
  79. }
  80. bool ModelSelection::remove(const ModelIndex& index)
  81. {
  82. ASSERT(index.is_valid());
  83. if (!m_indexes.contains(index))
  84. return false;
  85. m_indexes.remove(index);
  86. notify_selection_changed();
  87. return true;
  88. }
  89. void ModelSelection::clear()
  90. {
  91. if (m_indexes.is_empty())
  92. return;
  93. m_indexes.clear();
  94. notify_selection_changed();
  95. }
  96. void ModelSelection::notify_selection_changed()
  97. {
  98. if (!m_disable_notify) {
  99. m_view.notify_selection_changed({});
  100. m_notify_pending = false;
  101. } else {
  102. m_notify_pending = true;
  103. }
  104. }
  105. }