mirror of
https://github.com/mozilla/gecko-dev.git
synced 2024-10-25 11:15:34 +00:00
170 lines
6.0 KiB
C++
170 lines
6.0 KiB
C++
|
/* ***** BEGIN LICENSE BLOCK *****
|
||
|
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
|
||
|
*
|
||
|
* The contents of this file are subject to the Mozilla Public License Version
|
||
|
* 1.1 (the "License"); you may not use this file except in compliance with
|
||
|
* the License. You may obtain a copy of the License at
|
||
|
* http://www.mozilla.org/MPL/
|
||
|
*
|
||
|
* Software distributed under the License is distributed on an "AS IS" basis,
|
||
|
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
|
||
|
* for the specific language governing rights and limitations under the
|
||
|
* License.
|
||
|
*
|
||
|
* The Original Code is mozilla.org code.
|
||
|
*
|
||
|
* The Initial Developer of the Original Code is
|
||
|
* Mozilla Foundation.
|
||
|
* Portions created by the Initial Developer are Copyright (C) 2010
|
||
|
* the Initial Developer. All Rights Reserved.
|
||
|
*
|
||
|
* Contributor(s):
|
||
|
* Alexander Surkov <surkov.alexander@gmail.com> (original author)
|
||
|
*
|
||
|
* Alternatively, the contents of this file may be used under the terms of
|
||
|
* either the GNU General Public License Version 2 or later (the "GPL"), or
|
||
|
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
|
||
|
* in which case the provisions of the GPL or the LGPL are applicable instead
|
||
|
* of those above. If you wish to allow use of your version of this file only
|
||
|
* under the terms of either the GPL or the LGPL, and not to allow others to
|
||
|
* use your version of this file under the terms of the MPL, indicate your
|
||
|
* decision by deleting the provisions above and replace them with the notice
|
||
|
* and other provisions required by the GPL or the LGPL. If you do not delete
|
||
|
* the provisions above, a recipient may use your version of this file under
|
||
|
* the terms of any one of the MPL, the GPL or the LGPL.
|
||
|
*
|
||
|
* ***** END LICENSE BLOCK ***** */
|
||
|
|
||
|
#include "AccGroupInfo.h"
|
||
|
|
||
|
AccGroupInfo::AccGroupInfo(nsAccessible* aItem, PRUint32 aRole) :
|
||
|
mPosInSet(0), mSetSize(0), mParent(nsnull)
|
||
|
{
|
||
|
nsAccessible* parent = aItem->GetParent();
|
||
|
if (!parent)
|
||
|
return;
|
||
|
|
||
|
PRInt32 indexInParent = aItem->GetIndexInParent();
|
||
|
PRInt32 level = nsAccUtils::GetARIAOrDefaultLevel(aItem);
|
||
|
|
||
|
// Compute position in set.
|
||
|
mPosInSet = 1;
|
||
|
for (PRInt32 idx = indexInParent - 1; idx >=0 ; idx--) {
|
||
|
nsAccessible* sibling = parent->GetChildAt(idx);
|
||
|
PRUint32 siblingRole = nsAccUtils::Role(sibling);
|
||
|
|
||
|
// If the sibling is separator then the group is ended.
|
||
|
if (siblingRole == nsIAccessibleRole::ROLE_SEPARATOR)
|
||
|
break;
|
||
|
|
||
|
// If sibling is not visible and hasn't the same base role.
|
||
|
if (BaseRole(siblingRole) != aRole ||
|
||
|
nsAccUtils::State(sibling) & nsIAccessibleStates::STATE_INVISIBLE)
|
||
|
continue;
|
||
|
|
||
|
// Check if it's hierarchical flatten structure, i.e. if the sibling
|
||
|
// level is lesser than this one then group is ended, if the sibling level
|
||
|
// is greater than this one then the group is split by some child elements
|
||
|
// (group will be continued).
|
||
|
PRInt32 siblingLevel = nsAccUtils::GetARIAOrDefaultLevel(sibling);
|
||
|
if (siblingLevel < level) {
|
||
|
mParent = sibling;
|
||
|
break;
|
||
|
}
|
||
|
|
||
|
// Skip subset.
|
||
|
if (siblingLevel > level)
|
||
|
continue;
|
||
|
|
||
|
// If the previous item in the group has calculated group information then
|
||
|
// build group information for this item based on found one.
|
||
|
if (sibling->mGroupInfo) {
|
||
|
mPosInSet += sibling->mGroupInfo->mPosInSet;
|
||
|
mParent = sibling->mGroupInfo->mParent;
|
||
|
mSetSize = sibling->mGroupInfo->mSetSize;
|
||
|
return;
|
||
|
}
|
||
|
|
||
|
mPosInSet++;
|
||
|
}
|
||
|
|
||
|
// Compute set size.
|
||
|
mSetSize = mPosInSet;
|
||
|
|
||
|
PRInt32 siblingCount = parent->GetChildCount();
|
||
|
for (PRInt32 idx = indexInParent + 1; idx < siblingCount; idx++) {
|
||
|
nsAccessible* sibling = parent->GetChildAt(idx);
|
||
|
|
||
|
PRUint32 siblingRole = nsAccUtils::Role(sibling);
|
||
|
|
||
|
// If the sibling is separator then the group is ended.
|
||
|
if (siblingRole == nsIAccessibleRole::ROLE_SEPARATOR)
|
||
|
break;
|
||
|
|
||
|
// If sibling is visible and has the same base role
|
||
|
if (BaseRole(siblingRole) != aRole ||
|
||
|
nsAccUtils::State(sibling) & nsIAccessibleStates::STATE_INVISIBLE)
|
||
|
continue;
|
||
|
|
||
|
// and check if it's hierarchical flatten structure.
|
||
|
PRInt32 siblingLevel = nsAccUtils::GetARIAOrDefaultLevel(sibling);
|
||
|
if (siblingLevel < level)
|
||
|
break;
|
||
|
|
||
|
// Skip subset.
|
||
|
if (siblingLevel > level)
|
||
|
continue;
|
||
|
|
||
|
// If the next item in the group has calculated group information then
|
||
|
// build group information for this item based on found one.
|
||
|
if (sibling->mGroupInfo) {
|
||
|
mParent = sibling->mGroupInfo->mParent;
|
||
|
mSetSize = sibling->mGroupInfo->mSetSize;
|
||
|
return;
|
||
|
}
|
||
|
|
||
|
mSetSize++;
|
||
|
}
|
||
|
|
||
|
if (mParent)
|
||
|
return;
|
||
|
|
||
|
// Compute parent.
|
||
|
PRUint32 parentRole = nsAccUtils::Role(parent);
|
||
|
|
||
|
// In the case of ARIA row in treegrid, return treegrid since ARIA
|
||
|
// groups aren't used to organize levels in ARIA treegrids.
|
||
|
if (aRole == nsIAccessibleRole::ROLE_ROW &&
|
||
|
parentRole == nsIAccessibleRole::ROLE_TREE_TABLE) {
|
||
|
mParent = parent;
|
||
|
return;
|
||
|
}
|
||
|
|
||
|
// In the case of ARIA tree, a tree can be arranged by using ARIA groups
|
||
|
// to organize levels. In this case the parent of the tree item will be
|
||
|
// a group and the previous treeitem of that should be the tree item
|
||
|
// parent. Or, if the parent is something other than a tree we will
|
||
|
// return that.
|
||
|
|
||
|
if (parentRole != nsIAccessibleRole::ROLE_GROUPING) {
|
||
|
mParent = parent;
|
||
|
return;
|
||
|
}
|
||
|
|
||
|
nsAccessible* parentPrevSibling = parent->GetSiblingAtOffset(-1);
|
||
|
PRUint32 parentPrevSiblingRole = nsAccUtils::Role(parentPrevSibling);
|
||
|
if (parentPrevSiblingRole == nsIAccessibleRole::ROLE_TEXT_LEAF) {
|
||
|
// XXX Sometimes an empty text accessible is in the hierarchy here,
|
||
|
// although the text does not appear to be rendered, GetRenderedText()
|
||
|
// says that it is so we need to skip past it to find the true
|
||
|
// previous sibling.
|
||
|
parentPrevSibling = parentPrevSibling->GetSiblingAtOffset(-1);
|
||
|
parentPrevSiblingRole = nsAccUtils::Role(parentPrevSibling);
|
||
|
}
|
||
|
|
||
|
// Previous sibling of parent group is a tree item, this is the
|
||
|
// conceptual tree item parent.
|
||
|
if (parentPrevSiblingRole == nsIAccessibleRole::ROLE_OUTLINEITEM)
|
||
|
mParent = parentPrevSibling;
|
||
|
}
|