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
|
/*
* Copyright (c) 1998, 2016, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code 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 General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* @test
* @summary test International Date Format
* @bug 8008577
* @library /java/text/testlib
* @run main/othervm -Djava.locale.providers=COMPAT,SPI IntlTestDateFormat
* @key randomness
*/
/*
(C) Copyright Taligent, Inc. 1996, 1997 - All Rights Reserved
(C) Copyright IBM Corp. 1996, 1997 - All Rights Reserved
The original version of this source code and documentation is copyrighted and
owned by Taligent, Inc., a wholly-owned subsidiary of IBM. These materials are
provided under terms of a License Agreement between Taligent and Sun. This
technology is protected by multiple US and International patents. This notice and
attribution to Taligent may not be removed.
Taligent is a registered trademark of Taligent, Inc.
*/
import java.text.*;
import java.util.*;
public class IntlTestDateFormat extends IntlTest {
// Values in milliseconds (== Date)
private static final long ONESECOND = 1000;
private static final long ONEMINUTE = 60 * ONESECOND;
private static final long ONEHOUR = 60 * ONEMINUTE;
private static final long ONEDAY = 24 * ONEHOUR;
private static final double ONEYEAR = 365.25 * ONEDAY; // Approximate
// EModes
private static final byte GENERIC = 0;
private static final byte TIME = GENERIC + 1;
private static final byte DATE = TIME + 1;
private static final byte DATE_TIME = DATE + 1;
private DateFormat fFormat = DateFormat.getInstance();
private String fTestName = new String("getInstance");
private int fLimit = 3; // How many iterations it should take to reach convergence
public static void main(String[] args) throws Exception {
new IntlTestDateFormat().run(args);
}
public void TestLocale() {
localeTest(Locale.getDefault(), "Default Locale");
}
// This test does round-trip testing (format -> parse -> format -> parse -> etc.) of DateFormat.
public void localeTest(final Locale locale, final String localeName) {
int timeStyle, dateStyle;
// For patterns including only time information and a timezone, it may take
// up to three iterations, since the timezone may shift as the year number
// is determined. For other patterns, 2 iterations should suffice.
fLimit = 3;
for(timeStyle = 0; timeStyle < 4; timeStyle++) {
fTestName = new String("Time test " + timeStyle + " (" + localeName + ")");
try {
fFormat = DateFormat.getTimeInstance(timeStyle, locale);
}
catch(StringIndexOutOfBoundsException e) {
errln("FAIL: localeTest time getTimeInstance exception");
throw e;
}
TestFormat();
}
fLimit = 2;
for(dateStyle = 0; dateStyle < 4; dateStyle++) {
fTestName = new String("Date test " + dateStyle + " (" + localeName + ")");
try {
fFormat = DateFormat.getDateInstance(dateStyle, locale);
}
catch(StringIndexOutOfBoundsException e) {
errln("FAIL: localeTest date getTimeInstance exception");
throw e;
}
TestFormat();
}
for(dateStyle = 0; dateStyle < 4; dateStyle++) {
for(timeStyle = 0; timeStyle < 4; timeStyle++) {
fTestName = new String("DateTime test " + dateStyle + "/" + timeStyle + " (" + localeName + ")");
try {
fFormat = DateFormat.getDateTimeInstance(dateStyle, timeStyle, locale);
}
catch(StringIndexOutOfBoundsException e) {
errln("FAIL: localeTest date/time getDateTimeInstance exception");
throw e;
}
TestFormat();
}
}
}
public void TestFormat() {
if (fFormat == null) {
errln("FAIL: DateFormat creation failed");
return;
}
// logln("TestFormat: " + fTestName);
Date now = new Date();
tryDate(new Date(0));
tryDate(new Date((long) 1278161801778.0));
tryDate(now);
// Shift 6 months into the future, AT THE SAME TIME OF DAY.
// This will test the DST handling.
tryDate(new Date(now.getTime() + 6*30*ONEDAY));
Date limit = new Date(now.getTime() * 10); // Arbitrary limit
for (int i=0; i<2; ++i)
// tryDate(new Date(floor(randDouble() * limit)));
tryDate(new Date((long) (randDouble() * limit.getTime())));
}
private void describeTest() {
if (fFormat == null) {
errln("FAIL: no DateFormat");
return;
}
// Assume it's a SimpleDateFormat and get some info
SimpleDateFormat s = (SimpleDateFormat) fFormat;
logln(fTestName + " Pattern " + s.toPattern());
}
private void tryDate(Date theDate) {
final int DEPTH = 10;
Date[] date = new Date[DEPTH];
StringBuffer[] string = new StringBuffer[DEPTH];
int dateMatch = 0;
int stringMatch = 0;
boolean dump = false;
int i;
for (i=0; i<DEPTH; ++i) string[i] = new StringBuffer();
for (i=0; i<DEPTH; ++i) {
if (i == 0) date[i] = theDate;
else {
try {
date[i] = fFormat.parse(string[i-1].toString());
}
catch (ParseException e) {
describeTest();
errln("********** FAIL: Parse of " + string[i-1] + " failed.");
dump = true;
break;
}
}
FieldPosition position = new FieldPosition(0);
fFormat.format(date[i], string[i], position);
if (i > 0) {
if (dateMatch == 0 && date[i] == date[i-1]) dateMatch = i;
else if (dateMatch > 0 && date[i] != date[i-1]) {
describeTest();
errln("********** FAIL: Date mismatch after match.");
dump = true;
break;
}
if (stringMatch == 0 && string[i] == string[i-1]) stringMatch = i;
else if (stringMatch > 0 && string[i] != string[i-1]) {
describeTest();
errln("********** FAIL: String mismatch after match.");
dump = true;
break;
}
}
if (dateMatch > 0 && stringMatch > 0) break;
}
if (i == DEPTH) --i;
if (stringMatch > fLimit || dateMatch > fLimit) {
describeTest();
errln("********** FAIL: No string and/or date match within " + fLimit + " iterations.");
dump = true;
}
if (dump) {
for (int k=0; k<=i; ++k) {
logln("" + k + ": " + date[k] + " F> " + string[k] + " P> ");
}
}
}
// Return a random double from 0.01 to 1, inclusive
private double randDouble() {
// Assume 8-bit (or larger) rand values. Also assume
// that the system rand() function is very poor, which it always is.
// double d;
// int i;
// do {
// for (i=0; i < sizeof(double); ++i)
// {
// char poke = (char*)&d;
// poke[i] = (rand() & 0xFF);
// }
// } while (TPlatformUtilities.isNaN(d) || TPlatformUtilities.isInfinite(d));
// if (d < 0.0) d = -d;
// if (d > 0.0)
// {
// double e = floor(log10(d));
// if (e < -2.0) d *= pow(10.0, -e-2);
// else if (e > -1.0) d /= pow(10.0, e+1);
// }
// return d;
Random rand = new Random();
return rand.nextDouble();
}
public void TestAvailableLocales() {
final Locale[] locales = DateFormat.getAvailableLocales();
long count = locales.length;
logln("" + count + " available locales");
if (locales != null && count != 0) {
StringBuffer all = new StringBuffer();
for (int i=0; i<count; ++i) {
if (i!=0) all.append(", ");
all.append(locales[i].getDisplayName());
}
logln(all.toString());
}
else errln("********** FAIL: Zero available locales or null array pointer");
}
/* This test is too slow; we disable it for now
public void TestMonster() {
final Locale[] locales = DateFormat.getAvailableLocales();
long count = locales.length;
if (locales != null && count != 0) {
for (int i=0; i<count; ++i) {
String name = locales[i].getDisplayName();
logln("Testing " + name + "...");
try {
localeTest(locales[i], name);
}
catch(Exception e) {
errln("FAIL: TestMonster localeTest exception" + e);
}
}
}
}
*/
}
//eof
|