/* ============================================================================== This file is part of the JUCE framework. Copyright (c) Raw Material Software Limited JUCE is an open source framework subject to commercial or open source licensing. By downloading, installing, or using the JUCE framework, or combining the JUCE framework with any other source code, object code, content or any other copyrightable work, you agree to the terms of the JUCE End User Licence Agreement, and all incorporated terms including the JUCE Privacy Policy and the JUCE Website Terms of Service, as applicable, which will bind you. If you do not agree to the terms of these agreements, we will not license the JUCE framework to you, and you must discontinue the installation or download process and cease use of the JUCE framework. JUCE End User Licence Agreement: https://juce.com/legal/juce-8-licence/ JUCE Privacy Policy: https://juce.com/juce-privacy-policy JUCE Website Terms of Service: https://juce.com/juce-website-terms-of-service/ Or: You may also use this code under the terms of the AGPLv3: https://www.gnu.org/licenses/agpl-3.0.en.html THE JUCE FRAMEWORK IS PROVIDED "AS IS" WITHOUT ANY WARRANTY, AND ALL WARRANTIES, WHETHER EXPRESSED OR IMPLIED, INCLUDING WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED. ============================================================================== */ namespace juce::detail { struct FocusHelpers { FocusHelpers() = delete; static int getOrder (const Component* c) { auto order = c->getExplicitFocusOrder(); return order > 0 ? order : std::numeric_limits::max(); } static void findAllComponents (const Component* parent, std::vector& components, bool (Component::* isFocusContainer)() const, FocusTraverser::SkipDisabledComponents skipDisabledComponents) { if (parent == nullptr || parent->getNumChildComponents() == 0) return; std::vector localComponents; for (auto* c : parent->getChildren()) { constexpr auto no = FocusTraverser::SkipDisabledComponents::no; if (c->isVisible() && (c->isEnabled() || skipDisabledComponents == no)) localComponents.push_back (c); } const auto compareComponents = [&] (const Component* a, const Component* b) { const auto getComponentOrderAttributes = [] (const Component* c) { return std::make_tuple (getOrder (c), c->isAlwaysOnTop() ? 0 : 1, c->getY(), c->getX()); }; return getComponentOrderAttributes (a) < getComponentOrderAttributes (b); }; // This will sort so that they are ordered in terms of explicit focus, // always on top, left-to-right, and then top-to-bottom. std::stable_sort (localComponents.begin(), localComponents.end(), compareComponents); for (auto* c : localComponents) { components.push_back (c); if (! (c->*isFocusContainer)()) findAllComponents (c, components, isFocusContainer, skipDisabledComponents); } } enum class NavigationDirection { forwards, backwards }; static Component* navigateFocus (const Component* current, const Component* focusContainer, NavigationDirection direction, bool (Component::* isFocusContainer)() const, FocusTraverser::SkipDisabledComponents skipDisabledComponents) { if (focusContainer == nullptr) return nullptr; std::vector components; findAllComponents (focusContainer, components, isFocusContainer, skipDisabledComponents); const auto iter = std::find (components.cbegin(), components.cend(), current); if (iter == components.cend()) return nullptr; switch (direction) { case NavigationDirection::forwards: if (iter != std::prev (components.cend())) return *std::next (iter); break; case NavigationDirection::backwards: if (iter != components.cbegin()) return *std::prev (iter); break; } return nullptr; } }; } // namespace juce::detail