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
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
|
/*
* 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 com.sun.star.wizards.common;
import com.sun.star.util.DateTime;
import com.sun.star.beans.PropertyValue;
import java.util.*;
import java.io.File;
import com.sun.star.lib.util.UrlToFileMapper;
import java.net.MalformedURLException;
import java.net.URL;
public class JavaTools
{
/** Creates a new instance of JavaTools */
public JavaTools()
{
}
public static String[] copyStringArray(String[] FirstArray)
{
if (FirstArray != null)
{
String[] SecondArray = new String[FirstArray.length];
System.arraycopy(FirstArray, 0, SecondArray, 0, FirstArray.length);
return SecondArray;
}
else
{
return null;
}
}
public static Object[] initializeArray(Object[] olist, Object ovalue)
{
for (int i = 0; i < olist.length; i++)
{
olist[i] = ovalue;
}
return olist;
}
public static Object[][] initializeMultiDimArray(Object[][] olist, Object[] ovalue)
{
for (int i = 0; i < olist.length; i++)
{
olist[i] = ovalue;
}
return olist;
}
public static String[] ArrayOutOfMultiDimArray(String _sMultiDimArray[][], int _index)
{
String[] sRetArray = null;
if (_sMultiDimArray != null)
{
sRetArray = new String[_sMultiDimArray.length];
for (int i = 0; i < _sMultiDimArray.length; i++)
{
sRetArray[i] = _sMultiDimArray[i][_index];
}
}
return sRetArray;
}
public static int[] initializeintArray(int FieldCount, int nValue)
{
int[] LocintArray = new int[FieldCount];
for (int i = 0; i < LocintArray.length; i++)
{
LocintArray[i] = nValue;
}
return LocintArray;
}
/**converts a list of Integer values included in an Integer vector to a list of int values
*
*
* @param _aIntegerVector
* @return
*/
public static int[] IntegerTointList(Vector<Integer> _aIntegerVector)
{
try
{
Integer[] nIntegerValues = new Integer[_aIntegerVector.size()];
int[] nintValues = new int[_aIntegerVector.size()];
_aIntegerVector.toArray(nIntegerValues);
for (int i = 0; i < nIntegerValues.length; i++)
{
nintValues[i] = nIntegerValues[i].intValue();
}
return nintValues;
}
catch (RuntimeException e)
{
e.printStackTrace(System.err);
return null;
}
}
/**converts a list of Boolean values included in a Boolean vector to a list of boolean values
*
*
* @param _aBooleanVector
* @return
*/
public static boolean[] BooleanTobooleanList(Vector<Boolean> _aBooleanVector)
{
try
{
Boolean[] bBooleanValues = new Boolean[_aBooleanVector.size()];
boolean[] bbooleanValues = new boolean[_aBooleanVector.size()];
_aBooleanVector.toArray(bBooleanValues);
for (int i = 0; i < bBooleanValues.length; i++)
{
bbooleanValues[i] = bBooleanValues[i].booleanValue();
}
return bbooleanValues;
}
catch (RuntimeException e)
{
e.printStackTrace(System.err);
return null;
}
}
public static String[] multiDimListToArray(String[][] multidimlist)
{
String[] retlist = new String[]
{
};
retlist = new String[multidimlist.length];
for (int i = 0; i < multidimlist.length; i++)
{
retlist[i] = multidimlist[i][0];
}
return retlist;
}
public static String getlongestArrayItem(String[] StringArray)
{
String sLongestItem = PropertyNames.EMPTY_STRING;
int FieldCount = StringArray.length;
int iOldLength = 0;
int iCurLength = 0;
for (int i = 0; i < FieldCount; i++)
{
iCurLength = StringArray[i].length();
if (iCurLength > iOldLength)
{
iOldLength = iCurLength;
sLongestItem = StringArray[i];
}
}
return sLongestItem;
}
public static String ArraytoString(String[] LocArray)
{
StringBuilder ResultString = new StringBuilder(PropertyNames.EMPTY_STRING);
int iLen = LocArray.length;
for (int i = 0; i < iLen; i++)
{
ResultString.append(LocArray[i]);
if (i < iLen - 1)
{
ResultString.append(PropertyNames.SEMI_COLON);
}
}
return ResultString.toString();
}
/**
* @param SearchList
* @param SearchString
* @return the index of the field that contains the string 'SearchString' or '-1' if not it is
* not contained within the array
*/
public static int FieldInList(String[] SearchList, String SearchString)
{
int FieldLen = SearchList.length;
int retvalue = -1;
for (int i = 0; i < FieldLen; i++)
{
if (SearchList[i].compareTo(SearchString) == 0)
{
retvalue = i;
break;
}
}
return retvalue;
}
public static int FieldInList(String[] SearchList, String SearchString, int StartIndex)
{
int FieldLen = SearchList.length;
int retvalue = -1;
if (StartIndex < FieldLen)
{
for (int i = StartIndex; i < FieldLen; i++)
{
if (SearchList[i].compareTo(SearchString) == 0)
{
retvalue = i;
break;
}
}
}
return retvalue;
}
public static int FieldInTable(String[][] SearchList, String SearchString)
{
int retvalue;
if (SearchList.length > 0)
{
int FieldLen = SearchList.length;
retvalue = -1;
for (int i = 0; i < FieldLen; i++)
{
if (SearchList[i][0] != null)
{
if (SearchList[i][0].compareTo(SearchString) == 0)
{
retvalue = i;
break;
}
}
}
}
else
{
retvalue = -1;
}
return retvalue;
}
public static int FieldInIntTable(int[][] SearchList, int SearchValue)
{
int retvalue = -1;
for (int i = 0; i < SearchList.length; i++)
{
if (SearchList[i][0] == SearchValue)
{
retvalue = i;
break;
}
}
return retvalue;
}
public static int FieldInIntTable(int[] SearchList, int SearchValue, int _startindex)
{
int retvalue = -1;
for (int i = _startindex; i < SearchList.length; i++)
{
if (SearchList[i] == SearchValue)
{
retvalue = i;
break;
}
}
return retvalue;
}
public static int FieldInIntTable(int[] SearchList, int SearchValue)
{
return FieldInIntTable(SearchList, SearchValue, 0);
}
public static int getArraylength(Object[] MyArray)
{
int FieldCount = 0;
if (MyArray != null)
{
FieldCount = MyArray.length;
}
return FieldCount;
}
/**
* This function bubble sorts an array of with 2 dimensions.
* The default sorting order is the first dimension
* Only if sort2ndValue is True the second dimension is the relevant for the sorting order
*/
public static String[][] bubblesortList(String[][] SortList)
{
String DisplayDummy;
int SortCount = SortList[0].length;
int DimCount = SortList.length;
for (int s = 0; s < SortCount; s++)
{
for (int t = 0; t < SortCount - s - 1; t++)
{
if (SortList[0][t].compareTo(SortList[0][t + 1]) > 0)
{
for (int k = 0; k < DimCount; k++)
{
DisplayDummy = SortList[k][t];
SortList[k][t] = SortList[k][t + 1];
SortList[k][t + 1] = DisplayDummy;
}
}
}
}
return SortList;
}
/**
* @param MainString
* @param Token
* @return
*/
public static String[] ArrayoutofString(String MainString, String Token)
{
String[] StringArray;
if (!MainString.equals(PropertyNames.EMPTY_STRING))
{
ArrayList<String> StringVector = new ArrayList<String>();
String LocString = null;
int iIndex;
do
{
iIndex = MainString.indexOf(Token);
if (iIndex < 0)
{
StringVector.add(MainString);
}
else
{
StringVector.add(MainString.substring(0, iIndex));
MainString = MainString.substring(iIndex + 1, MainString.length());
}
}
while (iIndex >= 0);
int FieldCount = StringVector.size();
StringArray = new String[FieldCount];
StringVector.toArray(StringArray);
}
else
{
StringArray = new String[0];
}
return StringArray;
}
public static String replaceSubString(String MainString, String NewSubString, String OldSubString)
{
try
{
int NewIndex = 0;
int OldIndex = 0;
int NewSubLen = NewSubString.length();
int OldSubLen = OldSubString.length();
while (NewIndex != -1)
{
NewIndex = MainString.indexOf(OldSubString, OldIndex);
if (NewIndex != -1)
{
MainString = MainString.substring(0, NewIndex) + NewSubString + MainString.substring(NewIndex + OldSubLen);
OldIndex = NewIndex + NewSubLen;
}
}
return MainString;
}
catch (Exception exception)
{
exception.printStackTrace(System.err);
return null;
}
}
public static String getFilenameOutOfPath(String sPath)
{
String[] Hierarchy = ArrayoutofString(sPath, "/");
return Hierarchy[Hierarchy.length - 1];
}
public static String getFileDescription(String sPath)
{
String sFilename = getFilenameOutOfPath(sPath);
String[] FilenameList = ArrayoutofString(sFilename, ".");
StringBuilder FileDescription = new StringBuilder(PropertyNames.EMPTY_STRING);
for (int i = 0; i < FilenameList.length - 1; i++)
{
FileDescription.append(FilenameList[i]);
}
return FileDescription.toString();
}
public static String convertfromURLNotation(String _sURLPath)
{
String sPath = PropertyNames.EMPTY_STRING;
try
{
URL oJavaURL = new URL(_sURLPath);
File oFile = UrlToFileMapper.mapUrlToFile(oJavaURL);
sPath = oFile.getAbsolutePath();
}
catch (MalformedURLException e)
{
e.printStackTrace(System.err);
}
return sPath;
}
public static DateTime getDateTime(long timeMillis)
{
java.util.Calendar cal = java.util.Calendar.getInstance();
setTimeInMillis(cal, timeMillis);
DateTime dt = new DateTime();
dt.Year = (short) cal.get(Calendar.YEAR);
dt.Day = (short) cal.get(Calendar.DAY_OF_MONTH);
dt.Month = (short) (cal.get(Calendar.MONTH) + 1);
dt.Hours = (short) cal.get(Calendar.HOUR);
dt.Minutes = (short) cal.get(Calendar.MINUTE);
dt.Seconds = (short) cal.get(Calendar.SECOND);
dt.HundredthSeconds = (short) cal.get(Calendar.MILLISECOND);
return dt;
}
public static long getTimeInMillis(Calendar _calendar)
{
java.util.Date dDate = _calendar.getTime();
return dDate.getTime();
}
public static void setTimeInMillis(Calendar _calendar, long _timemillis)
{
java.util.Date dDate = new java.util.Date();
dDate.setTime(_timemillis);
_calendar.setTime(dDate);
}
public static long getMillis(DateTime time)
{
java.util.Calendar cal = java.util.Calendar.getInstance();
cal.set(time.Year, time.Month, time.Day, time.Hours, time.Minutes, time.Seconds);
return getTimeInMillis(cal);
}
public static String[] removeOutdatedFields(String[] baselist, String[] _complist)
{
String[] retarray = new String[]
{
};
if ((baselist != null) && (_complist != null))
{
ArrayList<String> retvector = new ArrayList<String>();
for (int i = 0; i < baselist.length; i++)
{
if (FieldInList(_complist, baselist[i]) > -1)
{
retvector.add(baselist[i]);
// here you could call the method of a defined interface to notify the calling method
}
}
retarray = new String[retvector.size()];
retvector.toArray(retarray);
}
return (retarray);
}
public static String[][] removeOutdatedFields(String[][] baselist, String[] _complist, int _compindex)
{
String[][] retarray = new String[][] {};
if ((baselist != null) && (_complist != null))
{
if (baselist.length > 0)
{
ArrayList<String[]> retvector = new ArrayList<String[]>();
for (int i = 0; i < baselist.length; i++)
{
String sValue = baselist[i][_compindex];
if (FieldInList(_complist, sValue) != -1)
{
retvector.add(baselist[i]);
// here you could call the method of a defined interface to notify the calling method
}
}
retarray = new String[retvector.size()][2];
retvector.toArray(retarray);
}
}
return (retarray);
}
public static String[][] removeOutdatedFields(String[][] baselist, String[] _complist)
{
return removeOutdatedFields(baselist, _complist, 0);
}
public static PropertyValue[][] removeOutdatedFields(PropertyValue[][] baselist, String[] _complist)
{
if ((baselist != null) && (_complist != null))
{
ArrayList<PropertyValue[]> firstdimvector = new ArrayList<PropertyValue[]>();
for (int n = 0; n < baselist.length; n++)
{
ArrayList<PropertyValue> secdimvector = new ArrayList<PropertyValue>();
for (int m = 0; m < baselist[n].length; m++)
{
if (FieldInList(_complist, baselist[n][m].Name) > -1)
{
secdimvector.add(baselist[n][m]);
}
}
if (!secdimvector.isEmpty())
{
PropertyValue[] internalArray = new PropertyValue[secdimvector.size()];
secdimvector.toArray(internalArray);
firstdimvector.add(internalArray);
}
}
PropertyValue[][] retarray = new PropertyValue[firstdimvector.size()][];
return firstdimvector.toArray(retarray);
}
return new PropertyValue[][]
{
};
}
/**
* searches a multidimensional array for duplicate fields. According to the following example
* SlaveFieldName1 ;SlaveFieldName2; SlaveFieldName3
* MasterFieldName1;MasterFieldName2;MasterFieldName3
* The entries SlaveFieldNameX and MasterFieldNameX are grouped together and then the created groups are compared
* If a group is duplicate the entry of the second group is returned.
* @param _scomplist
* @return
*/
public static int getDuplicateFieldIndex(String[][] _scomplist)
{
int retvalue = -1;
if (_scomplist.length > 0)
{
int fieldcount = _scomplist[0].length;
String[] sDescList = new String[fieldcount];
for (int m = 0; m < fieldcount; m++)
{
for (int n = 0; n < _scomplist.length; n++)
{
if (n == 0)
{
sDescList[m] = "";
}
sDescList[m] += _scomplist[n][m];
}
}
return getDuplicateFieldIndex(sDescList);
}
return retvalue;
}
/**
* not tested!!!!!
* @param scomplist
* @return
*/
public static int getDuplicateFieldIndex(String[] scomplist)
{
for (int n = 0; n < scomplist.length; n++)
{
String scurvalue = scomplist[n];
for (int m = n; m < scomplist.length; m++)
{
if (m != n)
{
if (scurvalue.equals(scomplist[m]))
{
return m;
}
}
}
}
return -1;
}
public static int getDuplicateFieldIndex(String[] _scomplist, String _fieldname)
{
int iduplicate = 0;
for (int n = 0; n < _scomplist.length; n++)
{
if (_scomplist[n].equals(_fieldname))
{
iduplicate++;
if (iduplicate == 2)
{
return n;
}
}
}
return -1;
}
public static boolean isEqual(PropertyValue firstPropValue, PropertyValue secPropValue)
{
if (!firstPropValue.Name.equals(secPropValue.Name))
{
return false;
//TODO replace 'equals' with AnyConverter.getType(firstpropValue).equals(secPropValue) to check content and Type
}
if (!firstPropValue.Value.equals(secPropValue.Value))
{
return false;
}
return (firstPropValue.Handle == secPropValue.Handle);
}
public static int[] getDuplicateFieldIndex(PropertyValue[][] ocomplist)
{
for (int n = 0; n < ocomplist.length; n++)
{
PropertyValue[] ocurValue = ocomplist[n];
for (int m = n; m < ocurValue.length; m++)
{
PropertyValue odetValue = ocurValue[m];
for (int s = 0; s < ocurValue.length; s++)
{
if (s != m)
{
if (isEqual(odetValue, ocurValue[s]))
{
return new int[]
{
n, s
};
}
}
}
}
}
return new int[]
{
-1, -1
};
}
public static String getSuffixNumber(String _sbasestring)
{
int suffixcharcount = 0;
for (int i = _sbasestring.length() - 1; i >= 0; i--)
{
char b = _sbasestring.charAt(i);
if ((b >= '0') && (b <= '9'))
{
suffixcharcount++;
}
else
{
break;
}
}
int istart = _sbasestring.length() - suffixcharcount;
return _sbasestring.substring(istart, _sbasestring.length());
}
public static String[] removefromList(String[] _sbaselist, String[] _sdellist)
{
ArrayList<String> tempbaselist = new ArrayList<String>();
for (int i = 0; i < _sbaselist.length; i++)
{
if (FieldInList(_sdellist, _sbaselist[i]) == -1)
{
tempbaselist.add(_sbaselist[i]);
}
}
String[] sretlist = new String[tempbaselist.size()];
tempbaselist.toArray(sretlist);
return sretlist;
}
/**
* compares two strings. If one of them is empty and the other one is null it also returns true
* @param sFirstString
* @param sSecondString
* @return
*/
public static boolean isSame(String sFirstString, String sSecondString)
{
boolean bissame = false;
if (sFirstString == null)
{
if (sSecondString != null)
{
bissame = sSecondString.equals(PropertyNames.EMPTY_STRING);
}
else
{
bissame = true;
}
}
else
{
if (sFirstString.equals(PropertyNames.EMPTY_STRING))
{
bissame = (sSecondString == null);
}
else if (sSecondString != null)
{
bissame = sFirstString.equals(sSecondString);
}
}
return bissame;
}
}
|