ModelSelection.cpp 2.8 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192
  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. for (auto& index : to_remove)
  39. m_indexes.remove(index);
  40. }
  41. void ModelSelection::set(const ModelIndex& index)
  42. {
  43. ASSERT(index.is_valid());
  44. if (m_indexes.size() == 1 && m_indexes.contains(index))
  45. return;
  46. m_indexes.clear();
  47. m_indexes.set(index);
  48. m_view.notify_selection_changed({});
  49. }
  50. void ModelSelection::add(const ModelIndex& index)
  51. {
  52. ASSERT(index.is_valid());
  53. if (m_indexes.contains(index))
  54. return;
  55. m_indexes.set(index);
  56. m_view.notify_selection_changed({});
  57. }
  58. void ModelSelection::toggle(const ModelIndex& index)
  59. {
  60. ASSERT(index.is_valid());
  61. if (m_indexes.contains(index))
  62. m_indexes.remove(index);
  63. else
  64. m_indexes.set(index);
  65. m_view.notify_selection_changed({});
  66. }
  67. bool ModelSelection::remove(const ModelIndex& index)
  68. {
  69. ASSERT(index.is_valid());
  70. if (!m_indexes.contains(index))
  71. return false;
  72. m_indexes.remove(index);
  73. m_view.notify_selection_changed({});
  74. return true;
  75. }
  76. void ModelSelection::clear()
  77. {
  78. if (m_indexes.is_empty())
  79. return;
  80. m_indexes.clear();
  81. m_view.notify_selection_changed({});
  82. }
  83. }