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 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642
|
/*
* 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 java.util.ArrayList;
import lib.MultiMethodTest;
import com.sun.star.accessibility.XAccessible;
import com.sun.star.accessibility.XAccessibleComponent;
import com.sun.star.accessibility.XAccessibleContext;
import com.sun.star.awt.Point;
import com.sun.star.awt.Rectangle;
import com.sun.star.awt.Size;
import com.sun.star.uno.UnoRuntime;
/**
* Testing <code>com.sun.star.accessibility.XAccessibleComponent</code>
* interface methods :
* <ul>
* <li><code> containsPoint()</code></li>
* <li><code> getAccessibleAtPoint()</code></li>
* <li><code> getBounds()</code></li>
* <li><code> getLocation()</code></li>
* <li><code> getLocationOnScreen()</code></li>
* <li><code> getSize()</code></li>
* <li><code> grabFocus()</code></li>
* <li><code> getAccessibleKeyBinding()</code></li>
* </ul> <p>
*
* @see com.sun.star.accessibility.XAccessibleComponent
*/
public class _XAccessibleComponent extends MultiMethodTest {
public XAccessibleComponent oObj = null;
private Rectangle bounds = null;
private ArrayList<Rectangle> KnownBounds = new ArrayList<Rectangle>();
/**
* First checks 4 inner bounds (upper, lower, left and right)
* of component bounding box to contain
* at least one point of the component. Second 4 outer bounds
* are checked to not contain any component points.<p>
*
* Has <b> OK </b> status if inner bounds contain component points
* and outer bounds don't contain any component points. <p>
*
* The following method tests are to be completed successfully before :
* <ul>
* <li> <code> getBounds() </code> : to have size of a component.</li>
* </ul>
*/
public void _containsPoint() {
requiredMethod("getBounds()");
boolean result = true;
int curX = 0;
//while (!oObj.containsPoint(new Point(curX, bounds.Y)) && curX < bounds.Width+bounds.X) {
while (!oObj.containsPoint(new Point(curX, 0)) &&
(curX < bounds.Width)) {
curX++;
}
//if ((bounds.X <= curX) && (curX < bounds.Width+bounds.X)) {
if (curX < bounds.Width) {
log.println("Upper bound of box containsPoint point (" + curX +
",0) - OK");
} else {
log.println(
"Upper bound of box containsPoint no component points - FAILED");
result = false;
}
curX = 0;
//while (!oObj.containsPoint(new Point(curX, bounds.Y+bounds.Height - 1))
while (!oObj.containsPoint(new Point(curX, bounds.Height - 1)) &&
(curX < bounds.Width)) {
log.println("containsPoint returns false for (" + curX + "," +
bounds.Height + ")");
curX++;
}
//if ((bounds.X <= curX) && (curX < bounds.Width+bounds.X)) {
if (curX < bounds.Width) {
log.println("Lower bound of box containsPoint point (" + curX +
"," + (bounds.Height - 1) + ") - OK");
} else {
log.println(
"Lower bound of box containsPoint no component points - FAILED");
result = false;
}
int curY = 0;
//while (!oObj.containsPoint(new Point(bounds.X, curY)) && curY < bounds.Height+bounds.Y) {
while (!oObj.containsPoint(new Point(0, curY)) &&
(curY < bounds.Height)) {
curY++;
}
//if ((bounds.Y <= curY) && (curY < bounds.Height+bounds.Y)) {
if (curY < bounds.Height) {
log.println("Left bound of box containsPoint point (0," + curY +
") - OK");
} else {
log.println(
"Left bound of box containsPoint no component points - FAILED");
result = false;
}
curY = 0;
//while (!oObj.containsPoint(new Point(bounds.X+bounds.Width - 1, curY))
// && curY < bounds.Height+bounds.Y) {
while (!oObj.containsPoint(new Point(bounds.Width - 1, curY)) &&
(curY < bounds.Height)) {
curY++;
}
//if ((bounds.Y <= curY) && (curY < bounds.Height + bounds.Y)) {
if (curY < bounds.Height) {
log.println("Right bound of box containsPoint point (" +
(bounds.Width - 1) + "," + curY + ") - OK");
} else {
log.println(
"Right bound of box containsPoint no component points - FAILED");
result = false;
}
boolean locRes = true;
for (int x = -1; x <= bounds.Width; x++) {
if (oObj.containsPoint(new Point(x, -1))) {
log.println(
"Outer upper and lower bounds CONTAIN some component point"
+ " (" + x + ", -1) - FAILED");
locRes = false;
break;
}
if (oObj.containsPoint(new Point(x, bounds.Height + bounds.Y))) {
log.println(
"Outer upper and lower bounds CONTAIN some component point"
+ " (" + x + ", " + bounds.Height + bounds.Y
+ ") - FAILED");
locRes = false;
break;
}
}
if (locRes) {
log.println("Outer upper and lower bounds contain no component " +
"points - OK");
} else {
result = false;
}
locRes = true;
for (int y = -1; y <= bounds.Height; y++) {
if (oObj.containsPoint(new Point(-1, y))) {
log.println(
"Outer left and right bounds CONTAIN some component point"
+ " (-1, " + y + ") - FAILED");
locRes = false;
break;
}
if (oObj.containsPoint(new Point(bounds.X + bounds.Width, y))) {
log.println(
"Outer left and right bounds CONTAIN some component point"
+ " (" + bounds.X + bounds.Width + ", " + y + ") - FAILED");
locRes = false;
break;
}
}
if (locRes) {
log.println("Outer left and right bounds contain no component " +
"points - OK");
} else {
result = false;
}
tRes.tested("containsPoint()", result);
}
/**
* Iterates through all children which implement
* <code>XAccessibleComponent</code> (if they exist) determines their
* boundaries and tries to get each child by <code>getAccessibleAtPoint</code>
* passing point which belongs to the child.
* Also the point is checked which doesn't belong to child boundary
* box. <p>
*
* Has <b> OK </b> status if in the first cases the right children
* are returned, and in the second <code>null</code> or
* another child is returned.
*/
public void _getAccessibleAtPoint() {
boolean result = true;
XAccessibleComponent[] children = getChildrenComponents();
if (children.length > 0) {
for (int i = 0; i < children.length; i++) {
Rectangle chBnd = children[i].getBounds();
if (chBnd.X == -1) {
continue;
}
log.println("Checking child with bounds " + "(" + chBnd.X +
"," + chBnd.Y + "),(" + chBnd.Width + "," +
chBnd.Height + "): " +
util.AccessibilityTools.accessibleToString(
children[i]));
XAccessibleContext xAc = UnoRuntime.queryInterface(
XAccessibleContext.class,
children[i]);
boolean MightBeCovered = false;
boolean isShowing = xAc.getAccessibleStateSet()
.contains(com.sun.star.accessibility.AccessibleStateType.SHOWING);
log.println("\tStateType containsPoint SHOWING: " +
isShowing);
if (!isShowing) {
log.println("Child is invisible - OK");
continue;
}
log.println("finding the point which lies on the component");
int curX = chBnd.Width / 2;
int curY = chBnd.Height / 2;
while (!children[i].containsPoint(new Point(curX, curY)) &&
(curX > 0) && (curY > 0)) {
curX--;
curY--;
}
if ((curX == chBnd.Width) && isShowing) {
log.println("Couldn't find a point with containsPoint");
continue;
}
// trying the point laying on child
XAccessible xAcc = oObj.getAccessibleAtPoint(
new Point(chBnd.X + curX,
chBnd.Y + curY));
Point p = new Point(chBnd.X + curX,chBnd.X + curX);
if (isCovered(p) && isShowing) {
log.println(
"Child might be covered by another and can't be reached");
MightBeCovered = true;
}
KnownBounds.add(chBnd);
if (xAcc == null) {
log.println("The child not found at point (" +
(chBnd.X + curX) + "," + (chBnd.Y + curY) +
") - FAILED");
if (isShowing) {
result = false;
} else {
result &= true;
}
} else {
XAccessible xAccCh = UnoRuntime.queryInterface(
XAccessible.class,
children[i]);
XAccessibleContext xAccC = UnoRuntime.queryInterface(
XAccessibleContext.class,
children[i]);
log.println("Child found at point (" + (chBnd.X + curX) +
"," + (chBnd.Y + curY) + ") - OK");
boolean res = false;
int expIndex;
String expName;
String expDesc;
if (xAccCh != null) {
res = util.AccessibilityTools.equals(xAccCh, xAcc);
expIndex = xAccCh.getAccessibleContext()
.getAccessibleIndexInParent();
expName = xAccCh.getAccessibleContext()
.getAccessibleName();
expDesc = xAccCh.getAccessibleContext()
.getAccessibleDescription();
} else {
res = xAccC.getAccessibleName()
.equals(xAcc.getAccessibleContext()
.getAccessibleName());
expIndex = xAccC.getAccessibleIndexInParent();
expName = xAccC.getAccessibleName();
expDesc = xAccC.getAccessibleDescription();
}
if (!res) {
int gotIndex = xAcc.getAccessibleContext()
.getAccessibleIndexInParent();
if (expIndex < gotIndex) {
log.println("The children found is not the same");
log.println("The expected child " + expName);
log.print("is hidden behind the found Child ");
log.println(xAcc.getAccessibleContext()
.getAccessibleName() + " - OK");
} else {
log.println(
"The children found is not the same");
log.println("Expected: " + expName);
log.println("Description: " + expDesc);
log.println("Found: " +
xAcc.getAccessibleContext()
.getAccessibleName());
log.println("Description: " +
xAcc.getAccessibleContext()
.getAccessibleDescription());
if (MightBeCovered) {
log.println("... Child is covered by another - OK");
} else {
log.println("... FAILED");
result = false;
}
}
}
}
// trying the point NOT laying on child
xAcc = oObj.getAccessibleAtPoint(
new Point(chBnd.X - 1, chBnd.Y - 1));
if (xAcc == null) {
log.println("No children found at point (" +
(chBnd.X - 1) + "," + (chBnd.Y - 1) +
") - OK");
result &= true;
} else {
XAccessible xAccCh = UnoRuntime.queryInterface(
XAccessible.class,
children[i]);
boolean res = util.AccessibilityTools.equals(xAccCh, xAcc);
if (res) {
log.println("The same child found outside " +
"its bounds at (" + (chBnd.X - 1) + "," +
(chBnd.Y - 1) + ") - FAILED");
result = false;
}
}
}
} else {
log.println("There are no children supporting " +
"XAccessibleComponent");
}
tRes.tested("getAccessibleAtPoint()", result);
}
/**
* Retrieves the component bounds and stores it. <p>
*
* Has <b> OK </b> status if boundary position (x,y) is not negative
* and size (Width, Height) is greater than 0.
*/
public void _getBounds() {
boolean result = true;
bounds = oObj.getBounds();
result &= ((bounds != null) && (bounds.X >= 0) && (bounds.Y >= 0) && (bounds.Width > 0) && (bounds.Height > 0));
log.println("Bounds = " +
((bounds != null)
? ("(" + bounds.X + "," + bounds.Y + "),(" +
bounds.Width + "," + bounds.Height + ")") : "null"));
tRes.tested("getBounds()", result);
}
/**
* Gets the location. <p>
*
* Has <b> OK </b> status if the location is the same as location
* of boundary obtained by <code>getBounds()</code> method.
*
* The following method tests are to be completed successfully before :
* <ul>
* <li> <code> getBounds() </code> : to have bounds </li>
* </ul>
*/
public void _getLocation() {
requiredMethod("getBounds()");
boolean result = true;
Point loc = oObj.getLocation();
result &= ((loc.X == bounds.X) && (loc.Y == bounds.Y));
tRes.tested("getLocation()", result);
}
/**
* Get the screen location of the component and its parent
* (if it exists and supports <code>XAccessibleComponent</code>). <p>
*
* Has <b> OK </b> status if component screen location equals
* to screen location of its parent plus location of the component
* relative to the parent. <p>
*
* The following method tests are to be completed successfully before :
* <ul>
* <li> <code> getBounds() </code> : to have location of the component
* relative to its parent</li>
* </ul>
*/
public void _getLocationOnScreen() {
requiredMethod("getBounds()");
XAccessibleComponent parent = getParentComponent();
boolean result = true;
Point loc = oObj.getLocationOnScreen();
log.println("Location is (" + loc.X + "," + loc.Y + ")");
if (parent != null) {
Point parLoc = parent.getLocationOnScreen();
log.println("Parent location is (" + parLoc.X + "," + parLoc.Y +
")");
result &= ((parLoc.X + bounds.X) == loc.X);
result &= ((parLoc.Y + bounds.Y) == loc.Y);
}
tRes.tested("getLocationOnScreen()", result);
}
/**
* Obtains the size of the component. <p>
*
* Has <b> OK </b> status if the size is the same as in bounds. <p>
*
* The following method tests are to be completed successfully before :
* <ul>
* <li> <code> getBounds() </code> </li>
* </ul>
*/
public void _getSize() {
requiredMethod("getBounds()");
boolean result = false;
Size size = oObj.getSize();
for (int i = 0; i < 2 && !result; i++)
{
result = true;
result &= (size.Width == bounds.Width);
result &= (size.Height == bounds.Height);
if (!result) {
log.println( "potential race bounds " + bounds.Width + "x" + bounds.Height +
" vs. size " + size.Width + "x" + size.Height);
// Possibily we hit a race condition and it re-sized (?) ...
bounds = oObj.getBounds();
size = oObj.getSize();
}
}
tRes.tested("getSize()", result);
}
/**
* Just calls the method. <p>
*
* Has <b> OK </b> status if no runtime exceptions occurred.
*/
public void _grabFocus() {
boolean result = true;
oObj.grabFocus();
tRes.tested("grabFocus()", result);
}
/**
* Retrieves all children (not more than 50) of the current
* component which support <code>XAccessibleComponent</code>.
*
* @return The array of children. Empty array returned if
* such children were not found or some error occurred.
*/
private XAccessibleComponent[] getChildrenComponents() {
XAccessible xAcc = UnoRuntime.queryInterface(
XAccessible.class, oObj);
if (xAcc == null) {
log.println("Component doesn't support XAccessible.");
return new XAccessibleComponent[0];
}
XAccessibleContext xAccCon = xAcc.getAccessibleContext();
int cnt = xAccCon.getAccessibleChildCount();
// for cases when too many children exist checking only first 50
if (cnt > 50) {
cnt = 50;
}
ArrayList<XAccessibleComponent> childComp = new ArrayList<XAccessibleComponent>();
for (int i = 0; i < cnt; i++) {
try {
XAccessible child = xAccCon.getAccessibleChild(i);
XAccessibleContext xAccConCh = child.getAccessibleContext();
XAccessibleComponent xChAccComp = UnoRuntime.queryInterface(
XAccessibleComponent.class,
xAccConCh);
if (xChAccComp != null) {
childComp.add(xChAccComp);
}
} catch (com.sun.star.lang.IndexOutOfBoundsException e) {
}
}
return childComp.toArray(
new XAccessibleComponent[childComp.size()]);
}
/**
* Gets the parent of the current component which support
* <code>XAccessibleComponent</code>.
*
* @return The parent or <code>null</code> if the component
* has no parent or some errors occurred.
*/
private XAccessibleComponent getParentComponent() {
XAccessible xAcc = UnoRuntime.queryInterface(
XAccessible.class, oObj);
if (xAcc == null) {
log.println("Component doesn't support XAccessible.");
return null;
}
XAccessibleContext xAccCon = xAcc.getAccessibleContext();
XAccessible xAccPar = xAccCon.getAccessibleParent();
if (xAccPar == null) {
log.println("Component has no accessible parent.");
return null;
}
XAccessibleContext xAccConPar = xAccPar.getAccessibleContext();
XAccessibleComponent parent = UnoRuntime.queryInterface(
XAccessibleComponent.class,
xAccConPar);
if (parent == null) {
log.println(
"Accessible parent doesn't support XAccessibleComponent");
return null;
}
return parent;
}
/**
* Just calls the method.
*/
public void _getForeground() {
int forColor = oObj.getForeground();
log.println("getForeground(): " + forColor);
tRes.tested("getForeground()", true);
}
/**
* Just calls the method.
*/
public void _getBackground() {
int backColor = oObj.getBackground();
log.println("getBackground(): " + backColor);
tRes.tested("getBackground()", true);
}
/**
* Restores initial component text.
*/
protected void after() {
if (tEnv.getObjRelation("Destroy") != null) {
disposeEnvironment();
}
}
private boolean isCovered(Point p) {
int elements = KnownBounds.size();
boolean Covered = false;
for (int k=0;k<elements;k++) {
Rectangle known = KnownBounds.get(k);
Covered = (known.X < p.X);
Covered &= (known.Y < p.Y);
Covered &= (p.Y < known.Y+known.Height);
Covered &= (p.X < known.X+known.Width);
if (Covered) {
break;
}
}
return Covered;
}
}
|