Upgrade ICU4J.

[Dictionary.git] / jars / icu4j-52_1 / main / classes / core / src / com / ibm / icu / text / BreakCTDictionary.java

diff --git a/jars/icu4j-4_8_1_1/main/classes/core/src/com/ibm/icu/text/BreakCTDictionary.java b/jars/icu4j-52_1/main/classes/core/src/com/ibm/icu/text/BreakCTDictionary.java
similarity index 98%
rename from jars/icu4j-4_8_1_1/main/classes/core/src/com/ibm/icu/text/BreakCTDictionary.java
rename to jars/icu4j-52_1/main/classes/core/src/com/ibm/icu/text/BreakCTDictionary.java
index 2ff5a257639d33b581b5ae3cf868de62d347d8e5..e033881f94980b1cd4239a537b19275b9858d88b 100644 (file)
--- a/jars/icu4j-4_8_1_1/main/classes/core/src/com/ibm/icu/text/BreakCTDictionary.java
+++ b/jars/icu4j-52_1/main/classes/core/src/com/ibm/icu/text/BreakCTDictionary.java
@@ -1,6 +1,6 @@
 /*
  *******************************************************************************
- * Copyright (C) 1996-2010, International Business Machines Corporation and    *
+ * Copyright (C) 1996-2011, International Business Machines Corporation and    *
  * others. All Rights Reserved.                                                *
  *******************************************************************************
  */
@@ -228,7 +228,7 @@ class BreakCTDictionary {
                 int middle;
                 node = null; // If we don't find a match, we'll fall out of the loop
                 while (high >= low) {
-                    middle = (high + low) / 2;
+                    middle = (high + low) >>> 1;
                     if (uc == hnode[middle].ch) {
                         // We hit a match; get the next node and next character
                         node = getCompactTrieNode(hnode[middle].equal);