/*************************************************************************
*
* $RCSfile: _XSheetCellRangeContainer.java,v $
*
* $Revision: 1.1 $
*
* last change:$Date: 2003-01-27 18:12:20 $
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
*
* - GNU Lesser General Public License Version 2.1
* - Sun Industry Standards Source License Version 1.1
*
* Sun Microsystems Inc., October, 2000
*
* GNU Lesser General Public License Version 2.1
* =============================================
* Copyright 2000 by Sun Microsystems, Inc.
* 901 San Antonio Road, Palo Alto, CA 94303, USA
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software Foundation.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston,
* MA 02111-1307 USA
*
*
* Sun Industry Standards Source License Version 1.1
* =================================================
* The contents of this file are subject to the Sun Industry Standards
* Source License Version 1.1 (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.openoffice.org/license.html.
*
* Software provided under this License is provided on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
* See the License for the specific provisions governing your rights and
* obligations concerning the Software.
*
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
*
* Copyright: 2000 by Sun Microsystems, Inc.
*
* All Rights Reserved.
*
* Contributor(s): _______________________________________
*
*
************************************************************************/
package ifc.sheet;
import com.sun.star.sheet.XSheetCellRangeContainer;
import com.sun.star.table.CellRangeAddress;
import lib.MultiMethodTest;
import lib.StatusException;
/**
* Testing com.sun.star.sheet.XSheetCellRangeContainer
* interface methods :
*
*
addRangeAddress()
*
removeRangeAddress()
*
addRangeAddresses()
*
removeRangeAddresses()
*
* Test is NOT multithread compilant.
* @see com.sun.star.sheet.XSheetCellRangeContainer
*/
public class _XSheetCellRangeContainer extends MultiMethodTest {
public XSheetCellRangeContainer oObj = null;
public CellRangeAddress[] rAddr = new CellRangeAddress[3];
/**
* After method called, the new array of structures 'CellRangeAddress'
* is created. Then container is cleared.
*/
public void before() {
for ( short i=0; i<=2; i++ ) {
rAddr[i] = new CellRangeAddress();
rAddr[i].Sheet = i;
rAddr[i].StartColumn = i;
rAddr[i].StartRow = i;
rAddr[i].EndColumn = i + 3;
rAddr[i].EndRow = i + 3;
try {
oObj.removeRangeAddresses(oObj.getRangeAddresses());
} catch (com.sun.star.uno.Exception e) {
e.printStackTrace(log);
throw new StatusException("Error: Cannot remove "+
"range addresses." ,e);
}
}
}
/**
* The method called. Then new value is added to Container.
* Next we try to obtain back added value and check it.
*
* Has OK status if the range just added presents among
* all ranges in the container.
*/
public void _addRangeAddress() {
boolean result = true;
log.println("Elements before adding: " + oObj.getCount());
oObj.addRangeAddress(rAddr[0], false);
log.println("Elements after adding: " + oObj.getCount());
CellRangeAddress[] addr = oObj.getRangeAddresses();
boolean exist = false ;
for (int i=0; i<=oObj.getCount()-1; i++) {
if ( addr[i].Sheet == rAddr[0].Sheet &&
addr[i].StartColumn == rAddr[0].StartColumn &&
addr[i].StartRow == rAddr[0].StartRow &&
addr[i].EndColumn == rAddr[0].EndColumn &&
addr[i].EndRow == rAddr[0].EndRow) {
exist = true;
}
}
result &= exist ;
tRes.tested("addRangeAddress()" ,result);
}
/**
* The method called. Then a value added before is removed.
* Next we check Container for existence of removed value.
* Has OK status if the range just removed doesn't presents among
* all ranges in the container.
*/
public void _removeRangeAddress() {
boolean result = true;
log.println("Elements before removing: " + oObj.getCount());
try {
oObj.removeRangeAddress(rAddr[0]);
} catch (com.sun.star.container.NoSuchElementException e) {
e.printStackTrace(log);
result = false;
}
log.println("Elements after removing: " + oObj.getCount());
CellRangeAddress[] addr = oObj.getRangeAddresses();
for (int i=0; i<=oObj.getCount()-1; i++) {
if ( (addr[i].Sheet == rAddr[0].Sheet) &&
(addr[i].StartColumn == rAddr[0].StartColumn) &&
(addr[i].StartRow == rAddr[0].StartRow) &&
(addr[i].EndColumn == rAddr[0].EndColumn) &&
(addr[i].EndRow == rAddr[0].EndRow) ) {
result = false;
}
}
tRes.tested("removeRangeAddress()" ,result);
}
/**
* The method called. Then new values are added to Container.
* Next we try to obtain back all added values and check it.
*
* Has OK status if the count of ranges increases by
* number of added ranges - 1 (one of ranges already exists in the
* container). And if all of ranges added exist in the container.
*/
public void _addRangeAddresses() {
executeMethod("addRangeAddress()");
boolean result = true;
int cntBefore = oObj.getCount();
log.println("Elements before adding: " + cntBefore);
oObj.addRangeAddresses(rAddr, false);
log.println("Elements after adding: " + oObj.getCount());
CellRangeAddress[] addr = oObj.getRangeAddresses();
result &= cntBefore + rAddr.length == oObj.getCount();
for (int j = 0; j < rAddr.length; j++) {
boolean exist = false ;
for (int i=0; i < oObj.getCount(); i++) {
if ( addr[i].Sheet == rAddr[j].Sheet &&
addr[i].StartColumn == rAddr[j].StartColumn &&
addr[i].StartRow == rAddr[j].StartRow &&
addr[i].EndColumn == rAddr[j].EndColumn &&
addr[i].EndRow == rAddr[j].EndRow ) {
exist = true;
break;
}
}
result &= exist;
}
tRes.tested("addRangeAddresses()" ,result);
}
/**
* All ranges are remover from contaier.
*
* Has OK status if there are no more ranges in the container.
*/
public void _removeRangeAddresses() {
boolean result = false;
int cnt;
log.println("Elements before removing: " + oObj.getCount());
try {
oObj.removeRangeAddresses(oObj.getRangeAddresses());
} catch (com.sun.star.container.NoSuchElementException e) {
e.printStackTrace(log);
result = false;
}
if ( (cnt = oObj.getCount()) == 0) {
result = true;
}
log.println("Elements after removing: " + cnt);
tRes.tested("removeRangeAddresses()" ,result);
}
/**
* Forces environment recreation.
*/
protected void after() {
disposeEnvironment();
}
}
ctor-7.0-10.0