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 (); } /** 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 = (AccessibleTreeNode)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