toolkit/test/accessibility/NodeMap.java

   1 /*
   2  * This file is part of the LibreOffice project.
   3  *
   4  * This Source Code Form is subject to the terms of the Mozilla Public
   5  * License, v. 2.0. If a copy of the MPL was not distributed with this
   6  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   7  *
   8  * This file incorporates work covered by the following license notice:
   9  *
  10  *   Licensed to the Apache Software Foundation (ASF) under one or more
  11  *   contributor license agreements. See the NOTICE file distributed
  12  *   with this work for additional information regarding copyright
  13  *   ownership. The ASF licenses this file to you under the Apache
  14  *   License, Version 2.0 (the "License"); you may not use this file
  15  *   except in compliance with the License. You may obtain a copy of
  16  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
  17  */
  18
  19 import com.sun.star.accessibility.XAccessibleContext;
  20
  21 import java.util.HashMap;
  22
  23 abstract class NodeMapCallback
  24 {
  25     public abstract void Apply (AccTreeNode aNode);
  26 }
  27
  28 /** This map translates from XAccessible objects to our internal
  29     representations.
  30 */
  31 class NodeMap
  32 {
  33     public NodeMap ()
  34     {
  35         maXAccessibleToNode = new HashMap<XAccessibleContext, AccessibleTreeNode> ();
  36     }
  37
  38     /** Clear the whole map.
  39     */
  40     public void Clear ()
  41     {
  42         maXAccessibleToNode.clear();
  43     }
  44
  45     /** @return
  46             whether the new node was different from a previous one
  47             respectively was the first one set.
  48     */
  49     public boolean InsertNode (XAccessibleContext xContext, AccessibleTreeNode aNode)
  50     {
  51         AccessibleTreeNode aPreviousNode = maXAccessibleToNode.put (
  52             xContext,
  53             aNode);
  54         return aPreviousNode != aNode;
  55     }
  56
  57     protected void RemoveNode (AccessibleTreeNode aNode)
  58     {
  59         try
  60         {
  61             if ((aNode != null) && (aNode instanceof AccTreeNode))
  62             {
  63                 maXAccessibleToNode.remove (((AccTreeNode)aNode).getContext());
  64             }
  65         }
  66         catch (Exception e)
  67         {
  68             System.out.println ("caught exception while removing node "
  69                 + aNode + " : " + e);
  70             e.printStackTrace();
  71         }
  72     }
  73
  74
  75     public void ForEach (NodeMapCallback aFunctor)
  76     {
  77         Object[] aNodes = maXAccessibleToNode.values().toArray();
  78         for (int i=0; i<aNodes.length; i++)
  79         {
  80             if (aNodes[i] != null && (aNodes[i] instanceof AccTreeNode))
  81             {
  82                 try
  83                 {
  84                     aFunctor.Apply ((AccTreeNode)aNodes[i]);
  85                 }
  86                 catch (Exception e)
  87                 {
  88                     System.out.println ("caught exception applying functor to "
  89                         + i + "th node " + aNodes[i] + " : " + e);
  90                     e.printStackTrace();
  91                 }
  92             }
  93         }
  94     }
  95
  96     AccessibleTreeNode GetNode (XAccessibleContext xContext)
  97     {
  98         return maXAccessibleToNode.get (xContext);
  99     }
 100
 101     AccessibleTreeNode GetNode (Object aObject)
 102     {
 103         if (aObject instanceof XAccessibleContext)
 104             return GetNode ((XAccessibleContext)aObject);
 105         else
 106             return null;
 107     }
 108
 109     boolean ValueIsMember (AccessibleTreeNode aNode)
 110     {
 111         return maXAccessibleToNode.containsValue(aNode);
 112     }
 113
 114
 115
 116     private final HashMap<XAccessibleContext, AccessibleTreeNode> maXAccessibleToNode;
 117 }