/*
******************************************************************************
-* Copyright (C) 1996-2010, International Business Machines Corporation and *
+* Copyright (C) 1996-2011, International Business Machines Corporation and *
* others. All Rights Reserved. *
******************************************************************************
*/
* be updated.</p>
* @param element for storing the result codepoint and name
* @return true if we are not at the end of the iteration, false otherwise.
- * @see ValueIterator.Element
+ * @see com.ibm.icu.util.ValueIterator.Element
*/
public boolean next(ValueIterator.Element element)
{
/*
****************************************************************************
- * Copyright (C) 2005-2010, International Business Machines Corporation and *
+ * Copyright (C) 2005-2011, International Business Machines Corporation and *
* others. All Rights Reserved. *
****************************************************************************
*
* bits 8-15: The match reason, an enum-like value.
*/
int match(CharsetDetector det, int [] commonChars) {
- int singleByteCharCount = 0;
+ @SuppressWarnings("unused")
+ int singleByteCharCount = 0; //TODO Do we really need this?
int doubleByteCharCount = 0;
int commonCharCount = 0;
int badCharCount = 0;
/*
*******************************************************************************
- * Copyright (C) 1996-2010, International Business Machines Corporation and *
+ * Copyright (C) 1996-2011, International Business Machines Corporation and *
* others. All Rights Reserved. *
*******************************************************************************
*/
// compute the 'effective' base and prescale the value down
long n = result.longValue();
long d = 1;
- int pow = 0;
while (d <= n) {
d *= 10;
- ++pow;
}
// now add the zeros
while (zeroCount > 0) {
//
// printf("Number of scriptSets: %d\n", scriptSets.size());
{
- int duplicateCount = 0;
+ //int duplicateCount = 0;
rtScriptSetsCount = 2;
for (int outeri = 2; outeri < scriptSets.size(); outeri++) {
BuilderScriptSet outerSet = scriptSets.elementAt(outeri);
innerSet.sset = outerSet.sset;
innerSet.index = outeri;
innerSet.rindex = outerSet.rindex;
- duplicateCount++;
+ //duplicateCount++;
}
// But this doesn't get all. We need to fix the TRIE.
}
return 0;
}
- int len = 0;
-
int sign;
char signChar = text.charAt(start);
if (signChar == '+') {
pos.setErrorIndex(start);
return 0;
}
- len++;
-
// Parse digits
// Possible format (excluding sign char) are:
// HHmmss
/*
**********************************************************************
-* Copyright (c) 2001-2010, International Business Machines
+* Copyright (c) 2001-2011, International Business Machines
* Corporation and others. All Rights Reserved.
**********************************************************************
* Date Name Description
Position pos, boolean isIncremental) {
int start = pos.start;
int limit = pos.limit;
- int i, j, ipat;
+ int i, ipat;
loop:
while (start < limit) {
// Loop over the forms in spec[]. Exit this loop when we
// match one of the specs. Exit the outer loop if a
// partial match is detected and isIncremental is true.
- for (j=0, ipat=0; spec[ipat] != END; ++j) {
+ for (ipat = 0; spec[ipat] != END;) {
// Read the header
int prefixLen = spec[ipat++];
protected void init(){
try{
- if ("UTF-16".equals(m_encoding)) {
- int x = 2;
- x++;
- }
CharsetProviderICU provider = new CharsetProviderICU();
//Charset charset = CharsetICU.forName(encoding);
m_charset = provider.charsetForName(m_encoding);
final String ad = "\u897f\u66a6";
final String jstLong = "\u65e5\u672c\u6a19\u6e96\u6642";
final String jdtLong = "\u65e5\u672c\u590f\u6642\u9593";
- final String jstShort = "JST";
- final String jdtShort = "JDT";
+ final String jstShort = null; // "JST" is no longer available for locale en in CLDR 2.0.1+
+ final String jdtShort = null; // "JDT" is no longer available for locale en in CLDR 2.0.1+
final String tzID = "Asia/Tokyo";
DateFormatSymbols symbols = new DateFormatSymbols(Locale.JAPAN);
errln("could not find " + tzID);
} else {
assertEquals("Long zone name = ", jstLong, zones[index][1]);
-// assertEquals("Short zone name = ", jstShort, zones[index][2]);
+ assertEquals("Short zone name = ", jstShort, zones[index][2]);
assertEquals("Long zone name (3) = ", jdtLong, zones[index][3]);
-// assertEquals("Short zone name (4) = ", jdtShort, zones[index][4]);
+ assertEquals("Short zone name (4) = ", jdtShort, zones[index][4]);
}
}
}
/*
*******************************************************************************
- * Copyright (C) 2009-2010, International Business Machines Corporation and *
+ * Copyright (C) 2009-2011, International Business Machines Corporation and *
* others. All Rights Reserved. *
*******************************************************************************
*/
UnicodeSetWithStrings[] sets_with_str = new UnicodeSetWithStrings[SET_COUNT];
String testName = null;
+ @SuppressWarnings("unused")
String testNameLimit;
for (i = 0; i < testdata.length; ++i) {
String test = nfd.normalize("\u0104");
boolean DEBUG = true;
+ @SuppressWarnings("unused")
int count = 0; // for debugging
for (String s : toTest) {
if (s.equals(test)) {
// ===== CONVENIENCES =====
private class Join extends Visitor {
StringBuffer output = new StringBuffer();
+ @SuppressWarnings("unused")
int depth = 0;
String join (Object o) {
output.setLength(0);