tdf#150789 - FILEOPEN PPTX: fix text in SmartArt vertically off
[LibreOffice.git] / svl / qa / complex / passwordcontainer / TestHelper.java
blobb6f1f08425e6c47648d3a510b11419d713386232
1 /*
2 * This file is part of the LibreOffice project.
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/.
8 * This file incorporates work covered by the following license notice:
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 .
19 package complex.passwordcontainer;
21 import com.sun.star.task.UserRecord;
24 public class TestHelper {
25 private String m_sTestPrefix;
27 public TestHelper( String sTestPrefix ) {
28 m_sTestPrefix = sTestPrefix;
31 public void Error( String sError ) {
32 System.out.println( m_sTestPrefix + "Error: " + sError );
35 private void Message( String sMessage ) {
36 System.out.println( m_sTestPrefix + sMessage );
39 public boolean sameLists(UserRecord aUserList1[], UserRecord aUserList2[]) {
40 // only works when every name is unique within the list containing it
42 if(aUserList1.length != aUserList2.length) {
43 Message("User list lengths: " + aUserList1.length + " <--> " + aUserList2.length + " respectively ");
44 return false;
47 for(int i = 0; i < aUserList1.length; i++) {
48 int j;
49 for(j = 0; j < aUserList2.length; j++) {
50 if(!aUserList1[i].UserName.equals(aUserList2[j].UserName))
52 continue;
54 if(aUserList1[i].Passwords[0].equals(aUserList2[j].Passwords[0])) {
55 break;
58 if(j == aUserList2.length) {
59 for(int k = 0; k < aUserList1.length; k++) {
60 Message(aUserList1[k].UserName + " <--> " + aUserList2[i].UserName);
62 return false;
65 return true;