2 * Copyright (c) 2021 Samsung Electronics Co., Ltd.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
19 #include <dali/internal/accessibility/bridge/bridge-accessible.h>
25 //comment out 2 lines below to get more logs
27 #define LOG() _LoggerEmpty()
29 using namespace Dali::Accessibility;
31 #define GET_NAVIGABLE_AT_POINT_MAX_RECURSION_DEPTH 10000
36 bool SortVertically(Component* lhs, Component* rhs)
38 auto leftRect = lhs->GetExtents(CoordinateType::WINDOW);
39 auto rightRect = rhs->GetExtents(CoordinateType::WINDOW);
41 return leftRect.y < rightRect.y;
44 bool SortHorizontally(Component* lhs, Component* rhs)
46 auto leftRect = lhs->GetExtents(CoordinateType::WINDOW);
47 auto rightRect = rhs->GetExtents(CoordinateType::WINDOW);
49 return leftRect.x < rightRect.x;
52 std::vector<std::vector<Component*>> SplitLines(const std::vector<Component*>& children)
54 // Find first with non-zero area
55 auto first = std::find_if(children.begin(), children.end(), [](Component* component) -> bool {
56 auto extents = component->GetExtents(CoordinateType::WINDOW);
57 return extents.height != 0.0f && extents.width != 0.0f;
60 if(first == children.end())
65 std::vector<std::vector<Component*>> lines(1);
66 Dali::Rect<> lineRect = (*first)->GetExtents(CoordinateType::WINDOW);
70 for(auto it = first; it != children.end(); ++it)
74 rect = child->GetExtents(CoordinateType::WINDOW);
75 if(rect.height == 0.0f || rect.width == 0.0f)
81 if(lineRect.y + (0.25 * lineRect.height) >= rect.y)
84 lines.back().push_back(child);
91 lines.back().push_back(child);
98 static bool AcceptObjectCheckRelations(Component* obj)
100 auto relations = obj->GetRelationSet();
102 for(const auto& it : relations)
104 if(it.relationType == RelationType::CONTROLLED_BY)
112 static Component* GetScrollableParent(Accessible* obj)
116 obj = obj->GetParent();
117 auto comp = dynamic_cast<Component*>(obj);
118 if(comp && comp->IsScrollable())
126 static bool IsObjectItem(Component* obj)
132 auto role = obj->GetRole();
133 return role == Role::LIST_ITEM || role == Role::MENU_ITEM;
136 static bool IsObjectCollapsed(Component* obj)
142 const auto states = obj->GetStates();
143 return states[State::EXPANDABLE] && !states[State::EXPANDED];
146 static bool IsObjectZeroSize(Component* obj)
152 auto extents = obj->GetExtents(CoordinateType::WINDOW);
153 return extents.height == 0 || extents.width == 0;
156 static bool IsObjectAcceptable(Component* obj)
163 const auto states = obj->GetStates();
164 if(!states[State::VISIBLE])
168 if(!AcceptObjectCheckRelations(obj))
172 if(!states[State::HIGHLIGHTABLE])
177 if(GetScrollableParent(obj) != nullptr)
179 auto parent = dynamic_cast<Component*>(obj->GetParent());
183 return !IsObjectItem(obj) || !IsObjectCollapsed(parent);
188 if(IsObjectZeroSize(obj))
192 if(!states[State::SHOWING])
200 static bool IsObjectAcceptable(Accessible* obj)
202 auto component = dynamic_cast<Component*>(obj);
203 return IsObjectAcceptable(component);
206 static int32_t GetItemCountOfList(Accessible* obj)
208 int32_t itemCount = 0;
209 if(obj && obj->GetRole() == Role::LIST)
211 for(auto i = 0u; i < static_cast<size_t>(obj->GetChildCount()); ++i)
213 auto child = obj->GetChildAtIndex(i);
214 if(child && child->GetRole() == Role::LIST_ITEM)
223 static int32_t GetItemCountOfFirstDescendantList(Accessible* obj)
225 int32_t itemCount = 0;
226 itemCount = GetItemCountOfList(obj);
227 if(itemCount > 0 || !obj)
232 for(auto i = 0u; i < static_cast<size_t>(obj->GetChildCount()); ++i)
234 auto child = obj->GetChildAtIndex(i);
235 itemCount = GetItemCountOfFirstDescendantList(child);
244 static std::string GetComponentInfo(Component* obj)
251 std::ostringstream object;
252 auto extent = obj->GetExtents(CoordinateType::SCREEN);
253 object << "name: " << obj->GetName() << " extent: (" << extent.x << ", "
254 << extent.y << "), [" << extent.width << ", " << extent.height << "]";
258 static std::string MakeIndent(unsigned int maxRecursionDepth)
260 return std::string(GET_NAVIGABLE_AT_POINT_MAX_RECURSION_DEPTH - maxRecursionDepth, ' ');
263 static bool IsDeputy(Accessible* obj)
269 static Accessible* GetProxyInParent(Accessible* obj)
276 auto children = obj->GetChildren();
277 for(auto& child : children)
287 static bool IsRoleAcceptableWhenNavigatingNextPrev(Accessible* obj)
293 auto role = obj->GetRole();
294 return role != Role::POPUP_MENU && role != Role::DIALOG;
297 static Accessible* FindNonDefunctChild(const std::vector<Accessible*>& children, unsigned int currentIndex, unsigned char forward)
299 unsigned int childrenCount = children.size();
300 for(; currentIndex < childrenCount; forward ? ++currentIndex : --currentIndex)
302 Accessible* object = children[currentIndex];
303 if(object && !object->GetStates()[State::DEFUNCT])
311 // The auxiliary method for Depth-First Search (DFS) algorithm to find non defunct child directionally
312 static Accessible* FindNonDefunctChildWithDepthFirstSearch(Accessible* node, const std::vector<Accessible*>& children, unsigned char forward)
319 auto childrenCount = children.size();
320 if(childrenCount > 0)
322 const bool isShowing = GetScrollableParent(node) == nullptr ? node->GetStates()[State::SHOWING] : true;
325 return FindNonDefunctChild(children, forward ? 0 : childrenCount - 1, forward);
331 static bool CheckChainEndWithAttribute(Accessible* obj, unsigned char forward)
338 auto attrs = obj->GetAttributes();
339 for(auto& attr : attrs)
341 if(attr.first == "relation_chain_end")
343 if((attr.second == "prev,end" && forward == 0) || (attr.second == "next,end" && forward == 1) || attr.second == "prev,next,end")
352 static Accessible* GetDeputyOfProxyInParent(Accessible* obj)
358 } // anonymous namespace
361 BridgeAccessible::BridgeAccessible()
365 void BridgeAccessible::RegisterInterfaces()
367 DBus::DBusInterfaceDescription desc{AtspiDbusInterfaceAccessible};
368 AddGetPropertyToInterface(desc, "ChildCount", &BridgeAccessible::GetChildCount);
369 AddGetPropertyToInterface(desc, "Name", &BridgeAccessible::GetName);
370 AddGetPropertyToInterface(desc, "Description", &BridgeAccessible::GetDescription);
371 AddGetPropertyToInterface(desc, "Parent", &BridgeAccessible::GetParent);
372 AddFunctionToInterface(desc, "GetRole", &BridgeAccessible::GetRole);
373 AddFunctionToInterface(desc, "GetRoleName", &BridgeAccessible::GetRoleName);
374 AddFunctionToInterface(desc, "GetLocalizedRoleName", &BridgeAccessible::GetLocalizedRoleName);
375 AddFunctionToInterface(desc, "GetState", &BridgeAccessible::GetStates);
376 AddFunctionToInterface(desc, "GetAttributes", &BridgeAccessible::GetAttributes);
377 AddFunctionToInterface(desc, "GetInterfaces", &BridgeAccessible::GetInterfaces);
378 AddFunctionToInterface(desc, "GetChildAtIndex", &BridgeAccessible::GetChildAtIndex);
379 AddFunctionToInterface(desc, "GetChildren", &BridgeAccessible::GetChildren);
380 AddFunctionToInterface(desc, "GetIndexInParent", &BridgeAccessible::GetIndexInParent);
381 AddFunctionToInterface(desc, "GetNavigableAtPoint", &BridgeAccessible::GetNavigableAtPoint);
382 AddFunctionToInterface(desc, "GetNeighbor", &BridgeAccessible::GetNeighbor);
383 AddFunctionToInterface(desc, "GetDefaultLabelInfo", &BridgeAccessible::GetDefaultLabelInfo);
384 AddFunctionToInterface(desc, "DoGesture", &BridgeAccessible::DoGesture);
385 AddFunctionToInterface(desc, "GetReadingMaterial", &BridgeAccessible::GetReadingMaterial);
386 AddFunctionToInterface(desc, "GetRelationSet", &BridgeAccessible::GetRelationSet);
387 mDbusServer.addInterface("/", desc, true);
390 Component* BridgeAccessible::GetObjectInRelation(Accessible* obj, RelationType relationType)
397 for(auto& relation : obj->GetRelationSet())
399 if(relation.relationType == relationType)
401 for(auto& address : relation.targets)
403 auto component = dynamic_cast<Component*>(Find(address));
414 Component* BridgeAccessible::CalculateNavigableAccessibleAtPoint(Accessible* root, Point point, CoordinateType type, unsigned int maxRecursionDepth)
416 if(!root || maxRecursionDepth == 0)
421 auto rootComponent = dynamic_cast<Component*>(root);
422 LOG() << "CalculateNavigableAccessibleAtPoint: checking: " << MakeIndent(maxRecursionDepth) << GetComponentInfo(rootComponent);
424 if(rootComponent && !rootComponent->IsAccessibleContainingPoint(point, type))
429 auto children = root->GetChildren();
430 for(auto childIt = children.rbegin(); childIt != children.rend(); childIt++)
432 //check recursively all children first
433 auto result = CalculateNavigableAccessibleAtPoint(*childIt, point, type, maxRecursionDepth - 1);
442 //Found a candidate, all its children are already checked
443 auto controledBy = GetObjectInRelation(rootComponent, RelationType::CONTROLLED_BY);
446 controledBy = rootComponent;
449 if(controledBy->IsProxy() || IsObjectAcceptable(controledBy))
451 LOG() << "CalculateNavigableAccessibleAtPoint: found: " << MakeIndent(maxRecursionDepth) << GetComponentInfo(rootComponent);
458 BridgeAccessible::ReadingMaterialType BridgeAccessible::GetReadingMaterial()
460 auto self = FindSelf();
461 auto findObjectByRelationType = [this, &self](RelationType relationType) {
462 auto relations = self->GetRelationSet();
463 auto relation = std::find_if(relations.begin(),
465 [relationType](const Dali::Accessibility::Relation& relation) -> bool {
466 return relation.relationType == relationType;
468 return relations.end() != relation && !relation->targets.empty() ? Find(relation->targets.back()) : nullptr;
471 auto labellingObject = findObjectByRelationType(RelationType::LABELLED_BY);
472 std::string labeledByName = labellingObject ? labellingObject->GetName() : "";
474 auto describedByObject = findObjectByRelationType(RelationType::DESCRIBED_BY);
476 double currentValue = 0.0;
477 double minimumIncrement = 0.0;
478 double maximumValue = 0.0;
479 double minimumValue = 0.0;
480 auto* valueInterface = dynamic_cast<Dali::Accessibility::Value*>(self);
483 currentValue = valueInterface->GetCurrent();
484 minimumIncrement = valueInterface->GetMinimumIncrement();
485 maximumValue = valueInterface->GetMaximum();
486 minimumValue = valueInterface->GetMinimum();
489 int32_t firstSelectedChildIndex = -1;
490 int32_t selectedChildCount = 0;
491 auto* selfSelectionInterface = dynamic_cast<Dali::Accessibility::Selection*>(self);
492 if(selfSelectionInterface)
494 selectedChildCount = selfSelectionInterface->GetSelectedChildrenCount();
495 auto firstSelectedChild = selfSelectionInterface->GetSelectedChild(0);
496 if(firstSelectedChild)
498 firstSelectedChildIndex = firstSelectedChild->GetIndexInParent();
502 auto childCount = static_cast<int32_t>(self->GetChildCount());
503 bool hasCheckBoxChild = false;
504 for(auto i = 0u; i < static_cast<size_t>(childCount); ++i)
506 auto child = self->GetChildAtIndex(i);
507 if(child->GetRole() == Role::CHECK_BOX)
509 hasCheckBoxChild = true;
514 auto role = static_cast<uint32_t>(self->GetRole());
515 int32_t listChildrenCount = 0;
516 if(role == static_cast<uint32_t>(Role::DIALOG))
518 listChildrenCount = GetItemCountOfFirstDescendantList(self);
521 auto* textInterface = dynamic_cast<Dali::Accessibility::Text*>(self);
522 std::string nameFromTextInterface = "";
525 nameFromTextInterface = textInterface->GetText(0, textInterface->GetCharacterCount());
528 auto description = self->GetDescription();
529 auto attributes = self->GetAttributes();
530 auto states = self->GetStates();
531 auto name = self->GetName();
532 auto localizedRoleName = self->GetLocalizedRoleName();
533 auto indexInParent = static_cast<int32_t>(self->GetIndexInParent());
535 auto parent = self->GetParent();
536 auto parentRole = static_cast<uint32_t>(parent ? parent->GetRole() : Role{});
537 auto parentChildCount = parent ? static_cast<int32_t>(parent->GetChildCount()) : 0;
538 auto parentStateSet = parent ? parent->GetStates() : States{};
539 bool isSelectedInParent = false;
540 auto* parentSelectionInterface = dynamic_cast<Dali::Accessibility::Selection*>(parent);
541 if(parentSelectionInterface)
543 isSelectedInParent = parentSelectionInterface->IsChildSelected(indexInParent);
550 nameFromTextInterface,
564 firstSelectedChildIndex,
573 void BridgeAccessible::SuppressScreenReader(bool suppress)
575 mIsScreenReaderSuppressed = suppress;
578 DBus::ValueOrError<bool> BridgeAccessible::DoGesture(Dali::Accessibility::Gesture type, int32_t startPositionX, int32_t startPositionY, int32_t endPositionX, int32_t endPositionY, Dali::Accessibility::GestureState state, uint32_t eventTime)
580 // Please be aware of sending GestureInfo point in the different order with parameters
581 return FindSelf()->DoGesture(Dali::Accessibility::GestureInfo{type, startPositionX, endPositionX, startPositionY, endPositionY, state, eventTime});
584 DBus::ValueOrError<Accessible*, uint8_t, Accessible*> BridgeAccessible::GetNavigableAtPoint(int32_t x, int32_t y, uint32_t coordinateType)
586 Accessible* deputy = nullptr;
587 auto accessible = FindSelf();
588 auto cType = static_cast<CoordinateType>(coordinateType);
589 LOG() << "GetNavigableAtPoint: " << x << ", " << y << " type: " << coordinateType;
590 auto component = CalculateNavigableAccessibleAtPoint(accessible, {x, y}, cType, GET_NAVIGABLE_AT_POINT_MAX_RECURSION_DEPTH);
591 bool recurse = false;
594 recurse = component->IsProxy();
597 return {component, recurse, deputy};
600 Accessible* BridgeAccessible::GetCurrentlyHighlighted()
602 //TODO: add currently highlighted object
606 std::vector<Accessible*> BridgeAccessible::GetValidChildren(const std::vector<Accessible*>& children, Accessible* start, Accessible* root)
608 std::vector<Component*> vec;
609 std::vector<Accessible*> ret;
611 for(auto child : children)
613 if(auto* component = dynamic_cast<Component*>(child); component)
615 vec.push_back(component);
619 std::sort(vec.begin(), vec.end(), &SortVertically);
621 for(auto& line : SplitLines(vec))
623 std::sort(line.begin(), line.end(), &SortHorizontally);
624 ret.insert(ret.end(), line.begin(), line.end());
632 struct CycleDetection
634 CycleDetection(const T value)
636 mCurrentSearchSize(1),
641 bool Check(const T value)
650 mCurrentSearchSize <<= 1;
651 if(mCurrentSearchSize == 0)
653 return true; // UNDEFINED BEHAVIOR
655 mCounter = mCurrentSearchSize;
662 unsigned int mCurrentSearchSize;
663 unsigned int mCounter;
666 Accessible* BridgeAccessible::GetNextNonDefunctSibling(Accessible* obj, Accessible* start, Accessible* root, unsigned char forward)
673 auto parent = obj->GetParent();
679 auto children = GetValidChildren(parent->GetChildren(), start, root);
681 unsigned int childrenCount = children.size();
682 if(childrenCount == 0)
687 unsigned int current = 0;
688 for(; current < childrenCount && children[current] != obj; ++current)
692 if(current >= childrenCount)
697 forward ? ++current : --current;
698 auto ret = FindNonDefunctChild(children, current, forward);
702 Accessible* BridgeAccessible::FindNonDefunctSibling(bool& areAllChildrenVisited, Accessible* node, Accessible* start, Accessible* root, unsigned char forward)
706 Accessible* sibling = GetNextNonDefunctSibling(node, start, root, forward);
710 areAllChildrenVisited = false; // Note that this is passed by non-const reference, so it is the caller that can determine whether this search exhausted all children.
714 node = node->GetParent();
715 if(node == nullptr || node == root)
720 // in backward traversing stop the walk up on parent
730 Accessible* BridgeAccessible::CalculateNeighbor(Accessible* root, Accessible* start, unsigned char forward, BridgeAccessible::NeighborSearchMode searchMode)
732 if(start && CheckChainEndWithAttribute(start, forward))
736 if(root && root->GetStates()[State::DEFUNCT])
740 if(start && start->GetStates()[State::DEFUNCT])
746 if(searchMode == BridgeAccessible::NeighborSearchMode::RECURSE_TO_OUTSIDE)
748 // This only works if we navigate backward, and it is not possible to
749 // find in embedded process. In this case the deputy should be used */
750 return GetDeputyOfProxyInParent(start);
753 Accessible* node = start ? start : root;
759 // initialization of all-children-visited flag for start node - we assume
760 // that when we begin at start node and we navigate backward, then all children
761 // are visited, so navigation will ignore start's children and go to
762 // previous sibling available.
763 // Regarding condtion (start != root):
764 // The last object can be found only if areAllChildrenVisited is false.
765 // The start is same with root, when looking for the last object.
766 bool areAllChildrenVisited = (start != root) && (searchMode != BridgeAccessible::NeighborSearchMode::RECURSE_FROM_ROOT && !forward);
768 // true, if starting element should be ignored. this is only used in rare case of
769 // recursive search failing to find an object.
770 // consider tree, where element A on bus BUS_A has child B on bus BUS_B. when going "next" from
771 // element A algorithm has to descend into BUS_B and search element B and its children. this is done
772 // by returning to our caller object B with special flag set (meaning - continue the search from B on bus BUS_B).
773 // if next object will be found there (on BUS_B), then search ends. but if not, then our caller will find it out
774 // and will call us again with object A and flag searchMode set to NEIGHBOR_SEARCH_MODE_CONTINUE_AFTER_FAILED_RECURSING.
775 // this flag means, that object A was already checked previously and we should skip it and its children.
776 bool forceNext = (searchMode == BridgeAccessible::NeighborSearchMode::CONTINUE_AFTER_FAILED_RECURSION);
778 CycleDetection<Accessible*> cycleDetection(node);
781 if(node->GetStates()[State::DEFUNCT])
786 // always accept proxy object from different world
787 if(!forceNext && node->IsProxy())
792 auto children = node->GetChildren();
793 children = GetValidChildren(children, start, root);
797 // 2. parent after all children in backward traversing
798 // 3. Nodes with roles: ATSPI_ROLE_PAGE_TAB, ATSPI_ROLE_POPUP_MENU and ATSPI_ROLE_DIALOG, only when looking for first or last element.
799 // Objects with those roles shouldnt be reachable, when navigating next / prev.
800 bool areAllChildrenVisitedOrMovingForward= (children.size() == 0 || forward || areAllChildrenVisited);
802 if(!forceNext && node != start && areAllChildrenVisitedOrMovingForward && IsObjectAcceptable(node))
804 if(start == NULL || IsRoleAcceptableWhenNavigatingNextPrev(node))
810 Accessible* nextRelatedInDirection = !forceNext ? GetObjectInRelation(node, forward ? RelationType::FLOWS_TO : RelationType::FLOWS_FROM) : nullptr;
811 // forceNext means that the searchMode is NEIGHBOR_SEARCH_MODE_CONTINUE_AFTER_FAILED_RECURSING
812 // in this case the node is elm_layout which is parent of proxy object.
813 // There is an access object working for the proxy object, and the access
814 // object could have relation information. This relation information should
815 // be checked first before using the elm_layout as a node.
816 if(forceNext && forward)
818 auto deputy = GetDeputyOfProxyInParent(node);
819 nextRelatedInDirection = GetObjectInRelation(deputy, RelationType::FLOWS_TO);
822 if(nextRelatedInDirection && start && start->GetStates()[State::DEFUNCT])
824 nextRelatedInDirection = NULL;
827 unsigned char wantCycleDetection = 0;
828 if(nextRelatedInDirection)
830 // Check whether nextRelatedInDirection is deputy object or not
834 // If the prev object is deputy, then go to inside of its proxy first
835 if(IsDeputy(nextRelatedInDirection))
837 parent = nextRelatedInDirection->GetParent();
838 nextRelatedInDirection = GetProxyInParent(parent);
843 // If current object is deputy, and it has relation next object,
844 // then do not use the relation next object, and use proxy first
847 parent = node->GetParent();
848 nextRelatedInDirection = GetProxyInParent(parent);
851 node = nextRelatedInDirection;
852 wantCycleDetection = 1;
856 auto child = !forceNext && !areAllChildrenVisited ? FindNonDefunctChildWithDepthFirstSearch(node, children, forward) : nullptr;
859 wantCycleDetection = 1;
863 if(!forceNext && node == root)
867 areAllChildrenVisited = true;
868 child = FindNonDefunctSibling(areAllChildrenVisited, node, start, root, forward);
874 if(wantCycleDetection && cycleDetection.Check(node))
882 DBus::ValueOrError<Accessible*, uint8_t> BridgeAccessible::GetNeighbor(std::string rootPath, int32_t direction, int32_t searchMode)
884 auto start = FindSelf();
885 rootPath = StripPrefix(rootPath);
886 auto root = !rootPath.empty() ? Find(rootPath) : nullptr;
887 auto accessible = CalculateNeighbor(root, start, direction == 1, static_cast<NeighborSearchMode>(searchMode));
888 unsigned char recurse = 0;
891 recurse = accessible->IsProxy();
893 return {accessible, recurse};
896 Accessible* BridgeAccessible::GetParent()
898 // NOTE: currently bridge supports single application root element.
899 // only element set as application root might return nullptr from GetParent
900 // if you want more, then you need to change setApplicationRoot to
901 // add/remove ApplicationRoot and make roots a vector.
902 auto parent = FindSelf()->GetParent();
907 DBus::ValueOrError<std::vector<Accessible*>> BridgeAccessible::GetChildren()
909 return FindSelf()->GetChildren();
912 std::string BridgeAccessible::GetDescription()
914 return FindSelf()->GetDescription();
917 DBus::ValueOrError<uint32_t> BridgeAccessible::GetRole()
919 return static_cast<unsigned int>(FindSelf()->GetRole());
922 DBus::ValueOrError<std::string> BridgeAccessible::GetRoleName()
924 return FindSelf()->GetRoleName();
927 DBus::ValueOrError<std::string> BridgeAccessible::GetLocalizedRoleName()
929 return FindSelf()->GetLocalizedRoleName();
932 DBus::ValueOrError<int32_t> BridgeAccessible::GetIndexInParent()
934 return FindSelf()->GetIndexInParent();
937 DBus::ValueOrError<std::array<uint32_t, 2>> BridgeAccessible::GetStates()
939 return FindSelf()->GetStates().GetRawData();
942 DBus::ValueOrError<std::unordered_map<std::string, std::string>> BridgeAccessible::GetAttributes()
944 std::unordered_map<std::string, std::string> attributes = FindSelf()->GetAttributes();
946 if(mIsScreenReaderSuppressed)
948 attributes.insert({"suppress-screen-reader", "true"});
954 DBus::ValueOrError<std::vector<std::string>> BridgeAccessible::GetInterfaces()
956 return FindSelf()->GetInterfaces();
959 int BridgeAccessible::GetChildCount()
961 return FindSelf()->GetChildCount();
964 DBus::ValueOrError<Accessible*> BridgeAccessible::GetChildAtIndex(int index)
968 throw std::domain_error{"negative index (" + std::to_string(index) + ")"};
970 return FindSelf()->GetChildAtIndex(static_cast<size_t>(index));
973 std::string BridgeAccessible::GetName()
975 return FindSelf()->GetName();
978 DBus::ValueOrError<Accessible*, uint32_t, std::unordered_map<std::string, std::string>> BridgeAccessible::GetDefaultLabelInfo()
980 auto defaultLabel = FindSelf()->GetDefaultLabel();
981 // By default, the text is taken from navigation context root's accessibility properties name and description.
982 return {defaultLabel, static_cast<uint32_t>(defaultLabel->GetRole()), defaultLabel->GetAttributes()};
985 DBus::ValueOrError<std::vector<BridgeAccessible::Relation>> BridgeAccessible::GetRelationSet()
987 auto relations = FindSelf()->GetRelationSet();
988 std::vector<BridgeAccessible::Relation> ret;
990 for(auto& it : relations)
992 ret.emplace_back(Relation{static_cast<uint32_t>(it.relationType), it.targets});