blob: 1c2fea0f8b36d5322927a4951a7ccb505f312407 (
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
|
/*
* 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.AccessibleEventObject;
import java.io.PrintStream;
import java.util.LinkedList;
class GeometryEventHandler
extends EventHandler
{
public GeometryEventHandler (AccessibleEventObject aEvent, AccessibilityTreeModel aTreeModel)
{
super (aEvent, aTreeModel);
}
public void PrintOldAndNew (PrintStream out)
{
out.println (" children not relevant");
}
public void Process ()
{
AccTreeNode aNode = maTreeModel.updateNode (mxEventSource,
AccessibleComponentHandler.class,
AccessibleExtendedComponentHandler.class);
// Update the graphical representation of aNode in the Canvas.
Canvas aCanvas = maTreeModel.getCanvas();
if (aCanvas != null)
{
// Iterate over all nodes in the sub-tree rooted in aNode.
LinkedList<Object> aShapeQueue = new LinkedList<Object>();
aShapeQueue.addLast (aNode);
while (aShapeQueue.size() > 0)
{
// Remove the first node from the queue and update its
// graphical representation.
AccTreeNode aShapeNode = (AccTreeNode) aShapeQueue.getFirst();
aShapeQueue.removeFirst();
aCanvas.updateNodeGeometry (aShapeNode);
// Add the node's children to the queue.
int nChildCount = maTreeModel.getChildCount (aShapeNode);
for (int i=0; i<nChildCount; i++)
{
Object aTreeNode = maTreeModel.getChildNoCreate (aShapeNode, i);
if (aTreeNode instanceof AccTreeNode)
aShapeQueue.addLast (aTreeNode);
}
}
aCanvas.repaint ();
}
}
}
|
