blob: aaf4baafff0275b0e03a441d92e4989ea7845ecb (
plain)
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
128
129
130
|
/*
* 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.XAccessibleContext;
import java.util.HashMap;
abstract class NodeMapCallback
{
public abstract void Apply (AccTreeNode aNode);
}
/** This map translates from XAccessible objects to our internal
representations.
*/
class NodeMap
{
public NodeMap ()
{
maXAccessibleToNode = new HashMap<XAccessibleContext, AccessibleTreeNode> ();
}
/** Clear the whole map.
*/
public void Clear ()
{
maXAccessibleToNode.clear();
}
/** @return
whether the new node was different from a previous one
repspectively was the first one set.
*/
public boolean InsertNode (XAccessibleContext xContext, AccessibleTreeNode aNode)
{
AccessibleTreeNode aPreviousNode = maXAccessibleToNode.put (
xContext,
aNode);
return aPreviousNode != aNode;
}
protected void RemoveNode (AccessibleTreeNode aNode)
{
try
{
if ((aNode != null) && (aNode instanceof AccTreeNode))
{
maXAccessibleToNode.remove (((AccTreeNode)aNode).getContext());
}
}
catch (Exception e)
{
System.out.println ("caught exception while removing node "
+ aNode + " : " + e);
e.printStackTrace();
}
}
public void ForEach (NodeMapCallback aFunctor)
{
Object[] aNodes = maXAccessibleToNode.values().toArray();
for (int i=0; i<aNodes.length; i++)
{
if (aNodes[i] != null && (aNodes[i] instanceof AccTreeNode))
{
try
{
aFunctor.Apply ((AccTreeNode)aNodes[i]);
}
catch (Exception e)
{
System.out.println ("caught exception applying functor to "
+ i + "th node " + aNodes[i] + " : " + e);
e.printStackTrace();
}
}
}
}
AccessibleTreeNode GetNode (XAccessibleContext xContext)
{
return maXAccessibleToNode.get (xContext);
}
AccessibleTreeNode GetNode (Object aObject)
{
if (aObject instanceof XAccessibleContext)
return GetNode ((XAccessibleContext)aObject);
else
return null;
}
XAccessibleContext GetAccessible (AccessibleTreeNode aNode)
{
if ((aNode != null) && (aNode instanceof AccTreeNode))
return ((AccTreeNode)aNode).getContext();
else
return null;
}
boolean IsMember (XAccessibleContext xContext)
{
return maXAccessibleToNode.containsKey(xContext);
}
boolean ValueIsMember (AccessibleTreeNode aNode)
{
return maXAccessibleToNode.containsValue(aNode);
}
private final HashMap<XAccessibleContext, AccessibleTreeNode> maXAccessibleToNode;
}
|
