1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0 .
*/
import com.sun.star.accessibility.XAccessible;
import com.sun.star.accessibility.XAccessibleContext;
import com.sun.star.lang.IndexOutOfBoundsException;
/**
* Map the tree of accessibility objects into their
* AccessibilityTreeModel counterparts.
*/
class AccessibleTreeHandler
extends NodeHandler
{
protected XAccessibleContext mxContext;
public NodeHandler createHandler (XAccessibleContext xContext)
{
if (xContext != null)
return new AccessibleTreeHandler (xContext);
else
return null;
}
public AccessibleTreeHandler ()
{
super();
mxContext = null;
}
public AccessibleTreeHandler (XAccessibleContext xContext)
{
super();
mxContext = xContext;
if (mxContext != null)
// Add one to the number of children to include the string node
// that tells you how many children there are.
synchronized (maChildList)
{
maChildList.setSize (1 + mxContext.getAccessibleChildCount());
}
}
public AccessibleTreeNode createChild (AccessibleTreeNode aParent, int nIndex)
{
AccessibleTreeNode aChild = null;
if (mxContext != null)
{
if (nIndex == 0)
aChild = new StringNode ("Child count: " + mxContext.getAccessibleChildCount(),
aParent);
else
{
// Lower index to skip the string node.
nIndex -= 1;
try
{
XAccessible xChild = mxContext.getAccessibleChild (nIndex);
aChild = NodeFactory.Instance().createDefaultNode (
xChild, aParent);
}
catch( IndexOutOfBoundsException e )
{
aChild = new StringNode ("ERROR: no child with index " + nIndex, aParent);
}
}
}
else
aChild = new StringNode ("XAccessibleContext interface not supported", aParent);
return aChild;
}
/** Try to add the specified accessible child into the lists of
children. The insertion position is determined from the
getIndexInParent method of the child.
*/
public AccessibleTreeNode addAccessibleChild (AccessibleTreeNode aParent, XAccessible xChild)
{
AccessibleTreeNode aChild = null;
if (xChild != null)
{
XAccessibleContext xContext = xChild.getAccessibleContext();
if (xContext != null)
{
int nIndex = xContext.getAccessibleIndexInParent() + 1;
synchronized (maChildList)
{
if ((nIndex >= 0) || (nIndex <= maChildList.size()))
{
aChild = NodeFactory.Instance().createDefaultNode (xChild, aParent);
maChildList.add (nIndex, aChild);
}
}
}
}
return aChild;
}
/** Update only the child count node. Trust on other ways to update the
accessible children.
*/
public void update (AccessibleTreeNode aNode)
{
synchronized (maChildList)
{
maChildList.set (0, null);
}
}
}
|
