toolkit/test/accessibility/VectorNode.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 java.util.ArrayList;
  20
  21 import com.sun.star.lang.IndexOutOfBoundsException;
  22
  23 /** The VectorNode class is a simple container whose list of children is
  24     managed entirely by its owner.
  25 */
  26 class VectorNode
  27     extends StringNode
  28 {
  29     private ArrayList<AccessibleTreeNode> maChildren;
  30
  31     public VectorNode (String sDisplayObject, AccessibleTreeNode aParent)
  32     {
  33         super (sDisplayObject, aParent);
  34
  35         maChildren = new ArrayList<AccessibleTreeNode> ();
  36     }
  37
  38     public void addChild (AccessibleTreeNode aChild)
  39     {
  40         maChildren.add (aChild);
  41     }
  42
  43     public int getChildCount ()
  44     {
  45         return maChildren.size();
  46     }
  47
  48     public AccessibleTreeNode getChild (int nIndex)
  49         throws IndexOutOfBoundsException
  50     {
  51         return maChildren.get(nIndex);
  52     }
  53
  54     public boolean removeChild (int nIndex)
  55         throws IndexOutOfBoundsException
  56     {
  57         return maChildren.remove (nIndex) != null;
  58     }
  59
  60     public int indexOf (AccessibleTreeNode aNode)
  61     {
  62         return maChildren.indexOf (aNode);
  63     }
  64
  65     public boolean isLeaf()
  66     {
  67         return maChildren.isEmpty();
  68     }
  69 }