blob: 69cff2c13edf6c65167d3692b9eb138890d1ee0d (
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
131
132
133
|
/*
* 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 java.util.Vector;
/**
* Map an arbitrary object into parts of a tree node.
*/
abstract class NodeHandler
{
/** This vector is used as cache for the child objects.
*/
protected Vector<AccessibleTreeNode> maChildList;
public abstract NodeHandler createHandler (
com.sun.star.accessibility.XAccessibleContext xContext);
public NodeHandler ()
{
maChildList = new Vector<AccessibleTreeNode> ();
}
/** return the number of children this object has */
public int getChildCount()
{
synchronized (maChildList)
{
return maChildList.size();
}
}
/**
* return a child object. Complex
* children have to be AccTreeNode instances.
* @see AccTreeNode
*/
public AccessibleTreeNode getChild (AccessibleTreeNode aParent, int nIndex)
{
synchronized (maChildList)
{
AccessibleTreeNode aChild = maChildList.get(nIndex);
if (aChild == null)
{
aChild = createChild (aParent, nIndex);
if (aChild == null)
aChild = new StringNode ("could not create child", aParent);
maChildList.set (nIndex, aChild);
}
return aChild;
}
}
public AccessibleTreeNode getChildNoCreate (int nIndex)
{
synchronized (maChildList)
{
return maChildList.get(nIndex);
}
}
/** Remove the specified child from the list of children.
*/
public boolean removeChild (int nIndex)
{
try
{
synchronized (maChildList)
{
System.out.println (" removing child at position " + nIndex + ": "
+ maChildList.get (nIndex));
maChildList.remove (nIndex);
}
}
catch (Exception e)
{
return false;
}
return true;
}
public int indexOf (AccessibleTreeNode aNode)
{
synchronized (maChildList)
{
return maChildList.indexOf (aNode);
}
}
/** Create a child object for the specified data. This method is called
usually from getChild and put there into the cache.
*/
public abstract AccessibleTreeNode createChild (
AccessibleTreeNode aParent, int nIndex);
// The following methods support editing of children and actions.
// They have default implementations for no actions and read-only.
/** get names of supported actions */
public String[] getActions (AccessibleTreeNode aNode)
{
return new String[] {};
}
/** perform action */
public void performAction (AccessibleTreeNode aNode, int nIndex)
{
}
/** Update all children.
*/
public void update (AccessibleTreeNode aNode)
{
}
}
|
