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 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341
|
/*
* 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 .
*/
package ifc.accessibility;
import com.sun.star.accessibility.IllegalAccessibleComponentStateException;
import com.sun.star.accessibility.XAccessible;
import com.sun.star.accessibility.XAccessibleContext;
import com.sun.star.accessibility.XAccessibleStateSet;
import com.sun.star.lang.Locale;
import lib.MultiMethodTest;
import util.AccessibilityTools;
/**
* Testing <code>com.sun.star.accessibility.XAccessibleContext</code>
* interface methods :
* <ul>
* <li><code> getAccessibleChildCount()</code></li>
* <li><code> getAccessibleChild()</code></li>
* <li><code> getAccessibleParent()</code></li>
* <li><code> getAccessibleIndexInParent()</code></li>
* <li><code> getAccessibleRole()</code></li>
* <li><code> getAccessibleDescription()</code></li>
* <li><code> getAccessibleName()</code></li>
* <li><code> getAccessibleRelationSet()</code></li>
* <li><code> getAccessibleStateSet()</code></li>
* <li><code> getLocale()</code></li>
* </ul> <p>
*
* @see com.sun.star.accessibility.XAccessibleContext
*/
public class _XAccessibleContext extends MultiMethodTest {
private static final String className = "com.sun.star.accessibility.XAccessibleContext";
public XAccessibleContext oObj = null;
private int childCount = 0;
private XAccessible parent = null;
// temporary while accessibility package is in com.sun.star
protected String getTestedClassName() {
return className;
}
/**
* Calls the method and stores the number of children. <p>
* Has <b> OK </b> status if non-negative number rutrned.
*/
public void _getAccessibleChildCount() {
childCount = oObj.getAccessibleChildCount();
log.println("" + childCount + " children found.");
tRes.tested("getAccessibleChildCount()", childCount > -1);
}
/**
* Tries to get every child and checks its parent. <p>
*
* Has <b> OK </b> status if parent of every child
* and the tested component are the same objects.
*
* The following method tests are to be completed successfully before :
* <ul>
* <li> <code> getAccessibleChildCount() </code> : to have a number of
* children </li>
* </ul>
*/
public void _getAccessibleChild() {
requiredMethod("getAccessibleChildCount()");
log.println("testing 'getAccessibleChild()'...");
boolean bOK = true;
int counter = childCount;
if (childCount > 500) {
counter = 500;
}
for (int i = 0; i < counter; i++) {
try {
XAccessible ch = oObj.getAccessibleChild(i);
XAccessibleContext chAC = ch.getAccessibleContext();
log.println("## Child " + i + ": " +
chAC.getAccessibleDescription());
if (!AccessibilityTools.equals(chAC.getAccessibleParent()
.getAccessibleContext(),
oObj)) {
log.println("The parent of child and component " +
"itself differ.");
log.println("\tRole:");
log.println("Getting: " +
chAC.getAccessibleParent()
.getAccessibleContext()
.getAccessibleRole());
log.println("Expected: " + oObj.getAccessibleRole());
log.println("\tImplementationName:");
log.println("Getting: " +
util.utils.getImplName(
chAC.getAccessibleParent()
.getAccessibleContext()));
log.println("Expected: " + util.utils.getImplName(oObj));
log.println("\tAccessibleDescription:");
log.println("Getting(Description): " +
chAC.getAccessibleParent()
.getAccessibleContext()
.getAccessibleDescription());
log.println("Expected(Description): " +
oObj.getAccessibleDescription());
log.println("\tAccessibleName:");
log.println("Getting(Name): " +
chAC.getAccessibleParent()
.getAccessibleContext()
.getAccessibleName());
log.println("Expected(Name): " +
oObj.getAccessibleName());
log.println("\tChildCount:");
log.println("Getting: " +
chAC.getAccessibleParent()
.getAccessibleContext()
.getAccessibleChildCount());
log.println("Expected: " +
oObj.getAccessibleChildCount());
log.println("\tParentName:");
log.println("Getting (Name): " +
chAC.getAccessibleParent()
.getAccessibleContext()
.getAccessibleParent()
.getAccessibleContext()
.getAccessibleName());
log.println("Expected(Name): " +
oObj.getAccessibleParent()
.getAccessibleContext()
.getAccessibleName());
log.println("##");
bOK = false;
} else {
log.println("Role: " + chAC.getAccessibleRole());
log.println("Name: " + chAC.getAccessibleName());
log.println("IndexInParent: " +
chAC.getAccessibleIndexInParent());
log.println("ImplementationName: " +
util.utils.getImplName(chAC));
}
} catch (com.sun.star.lang.IndexOutOfBoundsException e) {
e.printStackTrace(log);
bOK = false;
}
}
tRes.tested("getAccessibleChild()", bOK);
}
/**
* Just gets the parent. <p>
*
* Has <b> OK </b> status if parent is not null.
*/
public void _getAccessibleParent() {
// assume that the component is not ROOT
parent = oObj.getAccessibleParent();
tRes.tested("getAccessibleParent()", parent != null);
}
/**
* Retrieves the index of tested component in its parent.
* Then gets the parent's child by this index and compares
* it with tested component.<p>
*
* Has <b> OK </b> status if the parent's child and the tested
* component are the same objects.
*
* The following method tests are to be completed successfully before :
* <ul>
* <li> <code> getAccessibleParent() </code> : to have a parent </li>
* </ul>
*/
public void _getAccessibleIndexInParent() {
requiredMethod("getAccessibleParent()");
boolean bOK = true;
int idx = oObj.getAccessibleIndexInParent();
XAccessibleContext parentAC = parent.getAccessibleContext();
try {
XAccessible child = parentAC.getAccessibleChild(idx);
XAccessibleContext childAC = null;
if (child == null) {
log.println("Parent has no child with this index");
bOK &= false;
} else {
childAC = child.getAccessibleContext();
bOK &= AccessibilityTools.equals(childAC, oObj);
}
if (!bOK) {
log.println("Expected: " + util.utils.getImplName(oObj));
if (childAC != null) {
log.println("Getting: " + util.utils.getImplName(childAC));
}
}
} catch (com.sun.star.lang.IndexOutOfBoundsException e) {
e.printStackTrace(log);
bOK = false;
}
tRes.tested("getAccessibleIndexInParent()", bOK);
}
/**
* Get the accessible role of component. <p>
*
* Has <b> OK </b> status if non-negative number rutrned.
*/
public void _getAccessibleRole() {
short role = oObj.getAccessibleRole();
log.println("The role is " + role);
tRes.tested("getAccessibleRole()", role > -1);
}
/**
* Get the accessible name of the component. <p>
*
* Has <b> OK </b> status if the name has non-zero length.
*/
public void _getAccessibleName() {
String name = oObj.getAccessibleName();
log.println("The name is '" + name + "'");
tRes.tested("getAccessibleName()", name != null);
}
/**
* Get the accessible description of the component. <p>
*
* Has <b> OK </b> status if the description has non-zero length.
*/
public void _getAccessibleDescription() {
String descr = oObj.getAccessibleDescription();
log.println("The description is '" + descr + "'");
tRes.tested("getAccessibleDescription()", descr != null);
}
/**
* Just gets the set. <p>
*
* Has <b> OK </b> status if the set is not null.
*/
public void _getAccessibleRelationSet() {
oObj.getAccessibleRelationSet();
tRes.tested("getAccessibleRelationSet()", true);
}
/**
* Just gets the set. <p>
*
* Has <b> OK </b> status if the set is not null.
*/
public void _getAccessibleStateSet() {
XAccessibleStateSet set = oObj.getAccessibleStateSet();
boolean res = true;
String[] expectedStateNames = (String[]) tEnv.getObjRelation(
"expectedStateNames");
short[] expectedStates = (short[]) tEnv.getObjRelation(
"expectedStates");
if ((expectedStateNames != null) && (expectedStates != null)) {
res = checkStates(expectedStateNames, expectedStates, set);
} else {
res = set != null;
}
tRes.tested("getAccessibleStateSet()", res);
}
/**
* Gets the locale. <p>
*
* Has <b> OK </b> status if <code>Country</code> and
* <code>Language</code> fields of locale structure
* are not empty.
*/
public void _getLocale() {
Locale loc = null;
try {
loc = oObj.getLocale();
log.println("The locale is " + loc.Language + "," + loc.Country);
} catch (IllegalAccessibleComponentStateException e) {
e.printStackTrace(log);
}
tRes.tested("getLocale()",
(loc != null) && (loc.Language.length() > 0));
}
protected boolean checkStates(String[] expectedStateNames,
short[] expectedStates,
XAccessibleStateSet set) {
boolean works = true;
for (int k = 0; k < expectedStateNames.length; k++) {
boolean contains = set.contains(expectedStates[k]);
if (contains) {
log.println("Set contains " + expectedStateNames[k] +
" ... OK");
works &= true;
} else {
log.println("Set doesn't contain " + expectedStateNames[k] +
" ... FAILED");
works &= false;
}
}
return works;
}
}
|