svl/qa/complex/passwordcontainer/TestHelper.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 package complex.passwordcontainer;
  20
  21 import com.sun.star.task.UserRecord;
  22
  23 // import share.LogWriter;
  24
  25 public class TestHelper {
  26     // LogWriter m_aLogWriter;
  27     String m_sTestPrefix;
  28
  29     public TestHelper(  String sTestPrefix ) {
  30         // m_aLogWriter = aLogWriter;
  31         m_sTestPrefix = sTestPrefix;
  32     }
  33
  34     public void Error( String sError ) {
  35         System.out.println( m_sTestPrefix + "Error: " + sError );
  36     }
  37
  38     public void Message( String sMessage ) {
  39         System.out.println( m_sTestPrefix + sMessage );
  40     }
  41
  42     public boolean sameLists(UserRecord aUserList1[], UserRecord aUserList2[]) {
  43         // only works when every name is unique within the list containing it
  44
  45         if(aUserList1.length != aUserList2.length) {
  46             Message("User list lengths: " + aUserList1.length + " <--> " + aUserList2.length + " respectively ");
  47             return false;
  48         }
  49
  50         for(int i = 0; i < aUserList1.length; i++) {
  51             int j;
  52             for(j = 0; j < aUserList2.length; j++) {
  53                 if(!aUserList1[i].UserName.equals(aUserList2[j].UserName))
  54                 {
  55                     continue;
  56                 }
  57                 if(aUserList1[i].Passwords[0].equals(aUserList2[j].Passwords[0])) {
  58                     break;
  59                 }
  60             }
  61             if(j == aUserList2.length) {
  62                 for(int k = 0; k < aUserList1.length; k++) {
  63                     Message(aUserList1[k].UserName + " <--> " + aUserList2[i].UserName);
  64                 }
  65                 return false;
  66             }
  67         }
  68         return true;
  69     }
  70 }
  71
  72
  73
  74
  75
  76
  77
  78
  79
  80
  81