using a recursive process. It starts by finding the rule whose range includes
the current value and applying that rule. If the rule so directs, it emits text,
including text obtained by recursing on new values as directed by the rule. As
-you can see, the rules are designed to accomodate recursive processing of
+you can see, the rules are designed to accommodate recursive processing of
numbers, and so are best suited for formatting numbers in ways that are
inherently recursive.
|:---|:---:|:---:|:---|
|`com.ibm.icu.impl.javaspi.ICULocaleServiceProvider.enableIcuVariants`|`"true"` or `"false"`|`"true"`|Whether if Locales with ICU's variant suffix will be included in `getAvailableLocales`. The current Java SE 6 locale sensitive service does not allow user provided provider implementations to override locales supported by JRE itself. When this property is `"true"` (default), ICU4J Locale Service Provider includes Locales with the suffix (`com.ibm.icu.impl.javaspi.ICULocaleServiceProvider.icuVariantSuffix`) in the variant field. For example, the ICU4J provider includes locales fr_FR and fr_FR_ICU4J in the available locale list. So JDK API user can still access the internationalization service object created by the ICU4J provider by the special locale fr_FR_ICU4J|
|`com.ibm.icu.impl.javaspi.ICULocaleServiceProvider.icuVariantSuffix`|*Any String*|`"ICU4J"` (49 or later) `"ICU"` (before 49)|Suffix string used in Locale's variant field to specify the ICU implementation.|
-|`com.ibm.icu.impl.javaspi.ICULocaleServiceProvider.enableIso3Languages`|`"true"` or `"false"`|`"true"`|Whether if 3-letter language locales are included in `getAvailabeLocales`. Use of 3-letter language codes in `java.util.Locale` is not supported by the API reference document. However, the implementation does not check the length of language code, so there is no practical problem with it.|
+|`com.ibm.icu.impl.javaspi.ICULocaleServiceProvider.enableIso3Languages`|`"true"` or `"false"`|`"true"`|Whether if 3-letter language locales are included in `getAvailableLocales`. Use of 3-letter language codes in `java.util.Locale` is not supported by the API reference document. However, the implementation does not check the length of language code, so there is no practical problem with it.|
|`com.ibm.icu.impl.javaspi.ICULocaleServiceProvider.useDecimalFormat`|`"true"` or `"false"`|`"false"`|Whether if `java.text.DecimalFormat` subclass is used for `NumberFormat#getXXXInstance`. `DecimalFormat#format(Object,StringBuffer,FieldPosition)` is declared as final, so ICU cannot override the implementation. As a result, some number types such as `BigInteger`/`BigDecimal` are not handled by the ICU implementation. If a client expects `NumberFormat#getXXXInstance` returns a `DecimalFormat` (for example, need to manipulate decimal format patterns), he/she can set true to this setting. However, in this case, `BigInteger`/`BigDecimal` support is not done by ICU's implementation.|
of the filter rules matters a great deal in how effective your data size
reduction can be, and the wildcard `*` can sometimes produce behavior that is
tricky to reason about. For example, these three lists of filter rules look
-similar on first glance but acutally produce different output:
+similar on first glance but actually produce different output:
<table>
<tr>
} /* end switch */
if (len>0) {
- /* we addeed a component, so add separator and write it if there's room. */
+ /* we added a component, so add separator and write it if there's room. */
if(len+sepLen<=cap) {
const UChar * plimit = p + len;
for (; p < plimit; p++) {
public:
/**
* The names of all the plural categories. NONE is not an actual plural
- * category, but rather represents the absense of a plural category.
+ * category, but rather represents the absence of a plural category.
*/
enum Category {
NONE = -1,
* on the destination pointer and capacity cannot overflow.
*
* The pinned capacity must fulfill the following conditions (for positive capacities):
- * - dest + capacity is a valid pointer according to the machine arcitecture (AS/400, 64-bit, etc.)
+ * - dest + capacity is a valid pointer according to the machine architecture (AS/400, 64-bit, etc.)
* - (dest + capacity) >= dest
* - The size (in bytes) of T[capacity] does not exceed 0x7fffffff
*
}
#endif
- // handleNext alway sets the break tag value.
+ // handleNext always sets the break tag value.
// Set the default for it.
fRuleStatusIndex = 0;
previous(status);
} else {
// seek() leaves the BreakCache positioned at the preceding boundary
- // if the requested position is between two bounaries.
+ // if the requested position is between two boundaries.
// current() pushes the BreakCache position out to the BreakIterator itself.
U_ASSERT(startPos > fTextIdx);
current();
case doEndAssign:
{
- // We have reached the end of an assignement statement.
+ // We have reached the end of an assignment statement.
// Current scan char is the ';' that terminates the assignment.
// Terminate expression, leaves expression parse tree rooted in TOS node.
//
// calculate the functions nullable, firstpos, lastpos and followpos on
// nodes in the parse tree.
- // See the alogrithm description in Aho.
+ // See the algorithm description in Aho.
// Understanding how this works by looking at the code alone will be
// nearly impossible.
//
/**
* Add a listener to be notified when notifyChanged is called.
* The listener must not be null. AcceptsListener must return
- * true for the listener. Attempts to concurrently
+ * true for the listener. Attempts to concurrently
* register the identical listener more than once will be
* silently ignored.
*/
/**
* Stop notifying this listener. The listener must
- * not be null. Attemps to remove a listener that is
+ * not be null. Attempts to remove a listener that is
* not registered will be silently ignored.
*/
virtual void removeListener(const EventListener* l, UErrorCode& status);
* KSC5601 : alias to ibm-949 mapping table
* GB2312 : alias to ibm-1386 mapping table
* ISO-8859-1 : Algorithmic implemented as LATIN1 case
-* ISO-8859-7 : alisas to ibm-9409 mapping table
+* ISO-8859-7 : alias to ibm-9409 mapping table
*/
/* preference order of JP charsets */
/***************************************************************
* Rules for ISO-2022-KR encoding
* i) The KSC5601 designator sequence should appear only once in a file,
-* at the begining of a line before any KSC5601 characters. This usually
+* at the beginning of a line before any KSC5601 characters. This usually
* means that it appears by itself on the first line of the file
* ii) There are only 2 shifting sequences SO to shift into double byte mode
* and SI to shift into single byte mode
#define UCNV_CACHE_LOAD_FACTOR 2
/* Puts the shared data in the static hashtable SHARED_DATA_HASHTABLE */
-/* Will always be called with the cnvCacheMutex alrady being held */
+/* Will always be called with the cnvCacheMutex already being held */
/* by the calling function. */
/* Stores the shared data in the SHARED_DATA_HASHTABLE
* @param data The shared data
case UCNV_PRV_ESCAPE_CSS2:
valueString[valueStringLength++] = (UChar) UNICODE_RS_CODEPOINT; /* adding \ */
valueStringLength += uprv_itou (valueString + valueStringLength, VALUE_STRING_LENGTH - valueStringLength, codePoint, 16, 0);
- /* Always add space character, becase the next character might be whitespace,
+ /* Always add space character, because the next character might be whitespace,
which would erroneously be considered the termination of the escape sequence. */
valueString[valueStringLength++] = (UChar) UNICODE_SPACE_CODEPOINT;
break;
/* is the code point valid in current script? */ \
if(sourceChar> ASCII_END && \
(validityTable[(targetUniChar & 0x7F)] & data->currentMaskToUnicode)==0){ \
- /* Vocallic RR is assigne in ISCII Telugu and Unicode */ \
+ /* Vocallic RR is assigned in ISCII Telugu and Unicode */ \
if(data->currentDeltaToUnicode!=(TELUGU_DELTA) || \
targetUniChar!=VOCALLIC_RR){ \
targetUniChar=missingCharMarker; \
goto CALLBACK;
} else if (*contextCharToUnicode==ISCII_INV) {
if (sourceChar==ISCII_HALANT) {
- targetUniChar = 0x0020; /* replace with space accoding to Indic FAQ */
+ targetUniChar = 0x0020; /* replace with space according to Indic FAQ */
} else {
targetUniChar = ZWJ;
}
/**
* UHashtable stores key-value pairs and does moderately fast lookup
* based on keys. It provides a good tradeoff between access time and
- * storage space. As elements are added to it, it grows to accomodate
+ * storage space. As elements are added to it, it grows to accommodate
* them. By default, the table never shrinks, even if all elements
* are removed from it.
*
* all available converters contained in the alias file. All converters
* in this list can be opened.
*
- * @param n the index to a converter available on the system (in the range <TT>[0..ucnv_countAvaiable()]</TT>)
+ * @param n the index to a converter available on the system (in the range <TT>[0..ucnv_countAvailable()]</TT>)
* @return a pointer a string (library owned), or <TT>NULL</TT> if the index is out of bounds.
* @see ucnv_countAvailable
* @stable ICU 2.0
// turn a bogus string into an empty one
void unBogus();
- // implements assigment operator, copy constructor, and fastCopyFrom()
+ // implements assignment operator, copy constructor, and fastCopyFrom()
UnicodeString ©From(const UnicodeString &src, UBool fastCopy=false);
// Copies just the fields without memory management.
}
/* we have found a null so convert the
- * chunk from begining of non-null char to null
+ * chunk from beginning of non-null char to null
*/
retVal = uprv_wcstombs(pCSrc,pSrc,remaining);
ψ ↔ ps ;
ω ↔ o $under ;
Ω ↔ O $under;
-# at begining or end of word, convert mp to b
+# at beginning or end of word, convert mp to b
[^[:L:]$accent] { μπ → b ;
μπ } [^[:L:]$accent] → b ;
[^[:L:]$accent] { [Μμ][Ππ] → B ;
if (U_FAILURE(ec)) return 0;
int32_t min = 0;
double startMs = getTimeInMillis(ec);
- // Always add from the start millis. This accomodates
+ // Always add from the start millis. This accommodates
// operations like adding years from February 29, 2000 up to
// February 29, 2004. If 1, 1, 1, 1 is added to the year
// field, the DOM gets pinned to 28 and stays there, giving an
// A Hangul syllable completely inside a contraction is ok.
}
// Note: If there is a prefix, then the parser checked that
- // both the prefix and the string beging with NFC boundaries (not Jamo V or T).
+ // both the prefix and the string begin with NFC boundaries (not Jamo V or T).
// Therefore: prefix.isEmpty() || !isJamoVOrT(nfdString.charAt(0))
// (While handling a Hangul syllable, prefixes on Jamo V or T
// would not see the previous Jamo of that syllable.)
/* if a negative power the constant 1 is needed, and if not subset */
/* invert the lhs now rather than inverting the result later */
if (decNumberIsNegative(rhs)) { /* was a **-n [hence digits>0] */
- decNumber *inv=invbuff; /* asssume use fixed buffer */
+ decNumber *inv=invbuff; /* assume use fixed buffer */
uprv_decNumberCopy(&dnOne, dac); /* dnOne=1; [needed now or later] */
#if DECSUBSET
if (set->extended) { /* need to calculate 1/lhs */
/* exp(-x) where x can be the tiniest number (Ntiny). */
/* */
/* 2. Normalizing x to be <=0.1 (instead of <=1) reduces loop */
-/* iterations by appoximately a third with additional (although */
+/* iterations by approximately a third with additional (although */
/* diminishing) returns as the range is reduced to even smaller */
/* fractions. However, h (the power of 10 used to correct the */
/* result at the end, see below) must be kept <=8 as otherwise */
/* ---------------------------------------------------------------- */
- /* Definitions for arbitary-precision modules (only valid after */
+ /* Definitions for arbitrary-precision modules (only valid after */
/* decNumber.h has been included) */
/* ---------------------------------------------------------------- */
// Returns an estimation of k such that 10^(k-1) <= v < 10^k where
// v = f * 2^exponent and 2^52 <= f < 2^53.
// v is hence a normalized double with the given exponent. The output is an
-// approximation for the exponent of the decimal approimation .digits * 10^k.
+// approximation for the exponent of the decimal approximation .digits * 10^k.
//
// The result might undershoot by 1 in which case 10^k <= v < 10^k+1.
// Note: this property holds for v's upper boundary m+ too.
//
// Let ep == estimated_power, then the returned values will satisfy:
// v / 10^ep = numerator / denominator.
-// v's boundarys m- and m+:
+// v's boundaries m- and m+:
// m- / 10^ep == v / 10^ep - delta_minus / denominator
// m+ / 10^ep == v / 10^ep + delta_plus / denominator
// Or in other words:
// If format/narrow not available, use standalone/narrow
assignArray(fNarrowMonths, fNarrowMonthsCount, fStandaloneNarrowMonths, fStandaloneNarrowMonthsCount);
} else if (narrowMonthsEC != U_MISSING_RESOURCE_ERROR && standaloneNarrowMonthsEC == U_MISSING_RESOURCE_ERROR) {
- // If standalone/narrow not availabe, use format/narrow
+ // If standalone/narrow not available, use format/narrow
assignArray(fStandaloneNarrowMonths, fStandaloneNarrowMonthsCount, fNarrowMonths, fNarrowMonthsCount);
} else if (narrowMonthsEC == U_MISSING_RESOURCE_ERROR && standaloneNarrowMonthsEC == U_MISSING_RESOURCE_ERROR) {
// If neither is available, use format/abbreviated
status = U_MEMORY_ALLOCATION_ERROR;
delete dtitvinf;
} else if ( U_FAILURE(status) ) {
- // safe to delete f, although nothing acutally is saved
+ // safe to delete f, although nothing actually is saved
delete f;
f = 0;
}
* Concrete class which provides the Indian calendar.
* <P>
* <code>IndianCalendar</code> is a subclass of <code>Calendar</code>
- * that numbers years since the begining of SAKA ERA. This is the civil calendar
+ * that numbers years since the beginning of SAKA ERA. This is the civil calendar
* which is accepted by government of India as Indian National Calendar.
* The two calendars most widely used in India today are the Vikrama calendar
* followed in North India and the Shalivahana or Saka calendar which is followed
* moon's illumination, and other factors, it is possible to determine the start
* of a lunar month with a fairly high degree of certainty. However, these
* calculations are extremely complicated and thus slow, so most algorithms,
- * including the one used here, are only approximations of the true astronical
+ * including the one used here, are only approximations of the true astronomical
* calculations. At present, the approximations used in this class are fairly
* simplistic; they will be improved in later versions of the code.
* <p>
return;
}
- // Accomodate the longest possible name
+ // Accommodate the longest possible name
++maxLen; // allow for temporary trailing space
char* cbuf = (char*) uprv_malloc(maxLen);
if (cbuf == NULL) {
// (this isn't a for loop because we might be deleting items from
// the vector-- we want to make sure we only increment i when
- // we _didn't_ delete aything from the vector)
+ // we _didn't_ delete anything from the vector)
int32_t rulesSize = rules.size();
for (int32_t i = 0; i < rulesSize; i++) {
NFRule* rule = rules[i];
* Date Name Description
* 02/19/97 aliu Converted from java.
* 03/18/97 clhuang Implemented with C++ APIs.
-* 04/17/97 aliu Enlarged MAX_INTEGER_DIGITS to fully accomodate the
+* 04/17/97 aliu Enlarged MAX_INTEGER_DIGITS to fully accommodate the
* largest double, by default.
* Changed DigitCount to int per code review.
* 07/20/98 stephen Changed operator== to check for grouping
if (finalZone->useDaylightTime()) {
/*
* Note: When an OlsonTimeZone is constructed, we should set the final year
- * as the start year of finalZone. However, the bounday condition used for
+ * as the start year of finalZone. However, the boundary condition used for
* getting offset from finalZone has some problems.
* For now, we do not set the valid start year when the construction time
* and create a clone and set the start year when extracting rules.
}
// Remove any strings from the set.
// There shoudn't be any, but just in case.
- // (Case Closure can add them; if we had a simple case closure avaialble that
+ // (Case Closure can add them; if we had a simple case closure available that
// ignored strings, that would be better.)
theSet->removeAllStrings();
int32_t setSize = theSet->size();
fRXPat->fCompiledPat->setElementAt(fIntervalLow, topOfBlock+2);
fRXPat->fCompiledPat->setElementAt(fIntervalUpper, topOfBlock+3);
- // Apend the CTR_LOOP op. The operand is the location of the CTR_INIT op.
+ // Append the CTR_LOOP op. The operand is the location of the CTR_INIT op.
// Goes at end of the block being looped over, so just append to the code so far.
appendOp(LoopOp, topOfBlock);
// First time through loop.
lbStartIdx = fp->fInputIdx - minML;
if (lbStartIdx > 0) {
- // move index to a code point boudary, if it's not on one already.
+ // move index to a code point boundary, if it's not on one already.
UTEXT_SETNATIVEINDEX(fInputText, lbStartIdx);
lbStartIdx = UTEXT_GETNATIVEINDEX(fInputText);
}
// First time through loop.
lbStartIdx = fp->fInputIdx - minML;
if (lbStartIdx > 0) {
- // move index to a code point boudary, if it's not on one already.
+ // move index to a code point boundary, if it's not on one already.
UTEXT_SETNATIVEINDEX(fInputText, lbStartIdx);
lbStartIdx = UTEXT_GETNATIVEINDEX(fInputText);
}
UOBJECT_DEFINE_RTTI_IMPLEMENTATION(SimpleTimeZone)
// Use only for decodeStartRule() and decodeEndRule() where the year is not
-// available. Set February to 29 days to accomodate rules with that date
+// available. Set February to 29 days to accommodate rules with that date
// and day-of-week-on-or-before-that-date mode (DOW_LE_DOM_MODE).
// The compareToRule() method adjusts to February 28 in non-leap years.
//
winidKey[winKeyLen] = 0;
ures_getByKey(zones, winidKey, zones, &tmperr); // use tmperr, because windows mapping might not
- // be avaiable by design
+ // be available by design
if (U_FAILURE(tmperr)) {
ures_close(zones);
return id;
return;
}
- // Accomodate the longest possible name plus padding
+ // Accommodate the longest possible name plus padding
char* buf = (char*) uprv_malloc(maxLen);
if (buf == NULL) {
offsets.start = offsets.limit;
* <li>messageText can contain quoted literal strings including syntax characters.
* A quoted literal string begins with an ASCII apostrophe and a syntax character
* (usually a {curly brace}) and continues until the next single apostrophe.
- * A double ASCII apostrohpe inside or outside of a quoted string represents
+ * A double ASCII apostrophe inside or outside of a quoted string represents
* one literal apostrophe.
* <li>Quotable syntax characters are the {curly braces} in all messageText parts,
* plus the '#' sign in a messageText immediately inside a pluralStyle,
* @param text the text to be transliterated
* @param index the position indices
* @param incremental if true, then assume more characters may be inserted
- * at index.limit, and postpone processing to accomodate future incoming
+ * at index.limit, and postpone processing to accommodate future incoming
* characters
* @stable ICU 2.4
*/
* @param text the text to be transliterated
* @param index the position indices
* @param incremental if true, then assume more characters may be inserted
- * at index.limit, and postpone processing to accomodate future incoming
+ * at index.limit, and postpone processing to accommodate future incoming
* characters
* @param rollback if true and if incremental is true, then perform special
* incremental processing, as described above, and undo partial
USPOOF_ALL_CHECKS = 0xFFFF,
/**
- * Enable the return of auxillary (non-error) information in the
+ * Enable the return of auxiliary (non-error) information in the
* upper bits of the check results value.
*
* If this "check" is not enabled, the results of {@link uspoof_check} will be
void write(UnicodeString& result, UErrorCode& status) const;
/**
- * Writes RFC2445 VTIMEZONE data for this time zone applicalbe
+ * Writes RFC2445 VTIMEZONE data for this time zone applicable
* for dates after the specified start time.
* @param start The start date.
* @param result Output param to filled in with the VTIMEZONE data.
void write(UDate start, UnicodeString& result, UErrorCode& status) const;
/**
- * Writes RFC2445 VTIMEZONE data applicalbe for the specified date.
+ * Writes RFC2445 VTIMEZONE data applicable for the specified date.
* Some common iCalendar implementations can only handle a single time
* zone property or a pair of standard and daylight time properties using
* BYDAY rule with day of week (such as BYDAY=1SUN). This method produce
* dow day of week in BYDAY, or 0 when not found
* wim day of week ordinal number in BYDAY, or 0 when not found
* dom an array of day of month
- * domCount number of availble days in dom (domCount is specifying the size of dom on input)
+ * domCount number of available days in dom (domCount is specifying the size of dom on input)
* until time defined by UNTIL attribute or MIN_MILLIS if not available
*/
static void parseRRULE(const UnicodeString& rrule, int32_t& month, int32_t& dow, int32_t& wim,
}
/*
- * Write the beggining part of RRULE line
+ * Write the beginning part of RRULE line
*/
void
VTimeZone::beginRRULE(VTZWriter& writer, int32_t month, UErrorCode& status) const {
vzone_write(VZone* zone, UChar* & result, int32_t & resultLength, UErrorCode& status);
/**
- * Writes RFC2445 VTIMEZONE data for this time zone applicalbe
+ * Writes RFC2445 VTIMEZONE data for this time zone applicable
* for dates after the specified start time.
* @param zone, the vzone to use
* @param start The start date.
vzone_writeFromStart(VZone* zone, UDate start, UChar* & result, int32_t & resultLength, UErrorCode& status);
/**
- * Writes RFC2445 VTIMEZONE data applicalbe for the specified date.
+ * Writes RFC2445 VTIMEZONE data applicable for the specified date.
* Some common iCalendar implementations can only handle a single time
* zone property or a pair of standard and daylight time properties using
* BYDAY rule with day of week (such as BYDAY=1SUN). This method produce
}
/*
- * Given the timezone icuid, fill in zoneInfo by calling auxillary functions that creates a timezone and extract the
+ * Given the timezone icuid, fill in zoneInfo by calling auxiliary functions that creates a timezone and extract the
* information to put into zoneInfo. This includes bias and standard time date and daylight saving date.
*/
U_CAPI UBool U_EXPORT2
wastes a lot of time and space.
* Test stdin and stdout with the u_f* functions
* Testing should be done for reading and writing multi-byte encodings,
- and make sure that a character that is contained across buffer boundries
+ and make sure that a character that is contained across buffer boundaries
works even for incomplete characters.
* Make sure that the last character is flushed when the file/string is closed.
* snprintf should follow the C99 standard for the return value, which is
virtual ~FontRuns();
/**
- * Get the <code>LEFontInstance</code> object assoicated with the given run
+ * Get the <code>LEFontInstance</code> object associated with the given run
* of text. Use <code>RunArray::getLimit(run)</code> to get the corresponding
* limit index.
*
virtual ~LocaleRuns();
/**
- * Get the <code>Locale</code> object assoicated with the given run
+ * Get the <code>Locale</code> object associated with the given run
* of text. Use <code>RunArray::getLimit(run)</code> to get the corresponding
* limit index.
*
virtual ~ValueRuns();
/**
- * Get the integer value assoicated with the given run
+ * Get the integer value associated with the given run
* of text. Use <code>RunArray::getLimit(run)</code> to get the corresponding
* limit index.
*
le_int32 run);
/**
- * Get the <code>le_font</code> object assoicated with the given run
+ * Get the <code>le_font</code> object associated with the given run
* of text. Use <code>pl_getFontRunLimit(run)</code> to get the corresponding
* limit index.
*
le_int32 run);
/**
- * Get the value assoicated with the given run * of text. Use
+ * Get the value associated with the given run * of text. Use
* <code>pl_getValueRunLimit(run)</code> to get the corresponding
* limit index.
*
le_int32 run);
/**
- * Get the <code>le_font</code> object assoicated with the given run
+ * Get the <code>le_font</code> object associated with the given run
* of text. Use <code>pl_getLocaleRunLimit(run)</code> to get the corresponding
* limit index.
*
virtual ~ULocRuns();
/**
- * Get the name of the locale assoicated with the given run
+ * Get the name of the locale associated with the given run
* of text. Use <code>RunArray::getLimit(run)</code> to get the corresponding
* limit index.
*
checkDate(cal, y, m, d);
ucal_roll(cal, (UCalendarDateFields)-1, 10, &status);
if(status==U_ILLEGAL_ARGUMENT_ERROR)
- log_verbose("Pass: illegal arguement error as expected\n");
+ log_verbose("Pass: illegal argument error as expected\n");
else{
log_err("Fail: no illegal argument error got..: %s\n", u_errorName(status));
return;
root = NULL;
addAllTests(&root);
- /* Tests acutally run HERE. TODO: separate command line option parsing & setting from test execution!! */
+ /* Tests actually run HERE. TODO: separate command line option parsing & setting from test execution!! */
nerrors = runTestRequest(root, argc, argv);
setTestOption(REPEAT_TESTS_OPTION, DECREMENT_OPTION_VALUE);
ucol_setAttribute(coll, UCOL_STRENGTH, UCOL_PRIMARY, &status);
ucol_setAttribute(coll, UCOL_NORMALIZATION_MODE, UCOL_ON, &status);
if (U_FAILURE(status)) {
- log_err("Failed setting atributes\n");
+ log_err("Failed setting attributes\n");
return;
}
sortkey_length = ucol_getSortKey(coll, ustr, ustr_length, NULL, 0);
ucol_setAttribute(coll, UCOL_STRENGTH, UCOL_PRIMARY, &status);
ucol_setAttribute(coll, UCOL_NORMALIZATION_MODE, UCOL_ON, &status);
if (U_FAILURE(status)) {
- log_err("Failed setting atributes\n");
+ log_err("Failed setting attributes\n");
return;
}
}
u_uastrcpy(unewpat, newpat[i]);
if(u_strcmp(unewp, unewpat) != 0)
- log_err("FAIL: Pattern %s should be transmute to %s; %s seen instead\n", pat[i], newpat[i], austrdup(unewp) );
+ log_err("FAIL: Pattern %s should be transmuted to %s; %s seen instead\n", pat[i], newpat[i], austrdup(unewp) );
lneed=0;
lneed=unum_format(fmt, 0, NULL, lneed, NULL, &status);
}
uBufferLen = u_unescape(strings[i], uBuffer, 256);
if(result==NULL || resultLen != uBufferLen || u_strncmp(result, uBuffer, resultLen) != 0) {
- log_err("(2) Didn't get correct string while accesing alias table by index (%s)\n", strings[i]);
+ log_err("(2) Didn't get correct string while accessing alias table by index (%s)\n", strings[i]);
}
}
for(i = 0; i < UPRV_LENGTHOF(strings); i++) {
}
uBufferLen = u_unescape(strings[i], uBuffer, 256);
if(result==NULL || resultLen != uBufferLen || u_strncmp(result, uBuffer, resultLen) != 0) {
- log_err("Didn't get correct string while accesing alias by index in an array (%s)\n", strings[i]);
+ log_err("Didn't get correct string while accessing alias by index in an array (%s)\n", strings[i]);
}
}
for(i = 0; i < UPRV_LENGTHOF(strings); i++) {
// ====== test constructor/copy constructor and assignment
/* they are protected, no test
- logln("Testing DateIntervalFormat constructor and assigment operator");
+ logln("Testing DateIntervalFormat constructor and assignment operator");
status = U_ZERO_ERROR;
DateFormat* constFmt = dtitvfmt->getDateFormat()->clone();
TESTCASE_AUTO(testOrdinal);
TESTCASE_AUTO(testSelect);
TESTCASE_AUTO(testSelectRange);
- TESTCASE_AUTO(testAvailbleLocales);
+ TESTCASE_AUTO(testAvailableLocales);
TESTCASE_AUTO(testParseErrors);
TESTCASE_AUTO(testFixedDecimal);
TESTCASE_AUTO(testSelectTrailingZeros);
}
-void PluralRulesTest::testAvailbleLocales() {
+void PluralRulesTest::testAvailableLocales() {
// Hash set of (char *) strings.
UErrorCode status = U_ZERO_ERROR;
void testOrdinal();
void testSelect();
void testSelectRange();
- void testAvailbleLocales();
+ void testAvailableLocales();
void testParseErrors();
void testFixedDecimal();
void testSelectTrailingZeros();
//
bi->first();
if (bi->isBoundary(3) != TRUE) {
- errln("%s:%d Incorrect value from bi->isBoudary(). Expected TRUE, got FALSE", __FILE__, __LINE__, i);
+ errln("%s:%d Incorrect value from bi->isBoundary(). Expected TRUE, got FALSE", __FILE__, __LINE__, i);
}
i = bi->current();
if (i != 3) {
if (bi->isBoundary(11) != FALSE) {
- errln("%s:%d Incorrect value from bi->isBoudary(). Expected FALSE, got TRUE", __FILE__, __LINE__, i);
+ errln("%s:%d Incorrect value from bi->isBoundary(). Expected FALSE, got TRUE", __FILE__, __LINE__, i);
}
i = bi->current();
if (i != 10) {
}
/**
- * Verify that MessageFormat accomodates more than 10 arguments and
+ * Verify that MessageFormat accommodates more than 10 arguments and
* more than 10 subformats.
*/
void TestMessageFormat::TestUnlimitedArgsAndSubformats() {
UnicodeString pattern ,Locale locale , UErrorCode& err, char* errMsg);
/**
- * Verify that MessageFormat accomodates more than 10 arguments
+ * Verify that MessageFormat accommodates more than 10 arguments
* and more than 10 subformats.
*/
void TestUnlimitedArgsAndSubformats();
/* STRING_STORE_SIZE + TAG_STORE_SIZE <= ((2^16 - 1) * 2)
That is the maximum size for the string stores combined
- because the strings are index at 16-bit boundries by a
+ because the strings are indexed at 16-bit boundaries by a
16-bit index, and there is only one section for the
strings.
*/
U_CFUNC int32_t
removeCmtText(UChar* source, int32_t srcLen, UErrorCode* status){
srcLen = trim(source, srcLen, status);
- UnicodeString patString("^\\s*?\\*\\s*?"); // remove pattern like " * " at the begining of the line
+ UnicodeString patString("^\\s*?\\*\\s*?"); // remove pattern like " * " at the beginning of the line
srcLen = removeText(source, srcLen, patString, UREGEX_MULTILINE, UnicodeString(), status);
return removeText(source, srcLen, UnicodeString("[ \\r\\n]+"), 0, UnicodeString(" "), status);// remove new lines;
}
/* TODO: this method will fail if at the
- * begining of buffer and the uchar to unget
+ * beginning of buffer and the uchar to unget
* is from the previous buffer. Need to implement
* system to take care of that situation.
*/
U_CAPI void U_EXPORT2
ucbuf_ungetc(int32_t c,UCHARBUF* buf){
/* decrement currentPos pointer
- * if not at the begining of buffer
+ * if not at the beginning of buffer
*/
if(buf->currentPos!=buf->buffer){
if(*(buf->currentPos-1)==c){
}
}
/*
- * Accoding to TR 13 readLine functions must interpret
+ * According to TR 13 readLine functions must interpret
* CR, CR+LF, LF, NEL, PS, LS or FF as line seperators
*/
/* Windows CR LF */
UnicodeString attValue = mAttrValue.group(2, errorCode);
// Trim the quotes from the att value. These are left over from the original regex
- // that parsed the attribue, which couldn't conveniently strip them.
+ // that parsed the attribute, which couldn't conveniently strip them.
attValue.remove(0,1); // one char from the beginning
attValue.truncate(attValue.length()-1); // and one from the end.
UnicodeString attValue = mAttrValue.group(2, status);
// Trim the quotes from the att value. These are left over from the original regex
- // that parsed the attribue, which couldn't conveniently strip them.
+ // that parsed the attribute, which couldn't conveniently strip them.
attValue.remove(0,1); // one char from the beginning
attValue.truncate(attValue.length()-1); // and one from the end.
* because the previous type is valid until the first
* transition defined by the final rule. Otherwise
* we may see unexpected offset shift at the
- * begining of the year when the final rule takes
+ * beginning of the year when the final rule takes
* effect.
*
* Note: This may results some 64bit second transitions
if (visibleWidth(fMtr, subject) <= width)
return len;
- // LIU: Remainder of this method rewritten to accomodate lines
+ // LIU: Remainder of this method rewritten to accommodate lines
// longer than the component width by first trying to break
// into lines; then words; finally chars.
int n = findFittingBreak(fMtr, subject, width, lineBreaker);
// beginning at 20, we use the >> to mark the position where
// the result of formatting the number's ones digit. Thus,
// we only need a new rule at every multiple of 10. Text in
- // backets is omitted if the value being formatted is an
+ // brackets is omitted if the value being formatted is an
// even multiple of 10.
+ " 20: twenty[->>];\n"
+ " 30: thirty[->>];\n"
+ " 40: quarante[->%%alt-ones>];\n"
+ " 50: cinquante[->%%alt-ones>];\n"
// rule for 60. The /20 causes this rule's multiplier to be
- // 20 rather than 10, allowinhg us to recurse for all values
+ // 20 rather than 10, allowing us to recurse for all values
// from 60 to 79...
+ " 60/20: soixante[->%%alt-ones>];\n"
// ...except for 71, which must be special-cased
+ " 1,000,000,000,000: << trillion[ >>];\n"
+ " 1,000,000,000,000,000: =#,##0=;\n"
// the rule set that formats the fractional part of the number.
- // The rule that is used is the one that, when its baase value is
+ // The rule that is used is the one that, when its base value is
// multiplied by the fractional part of the number being formatted,
// produces the result closest to zero. Thus, the base values are
// prospective denominators of the fraction. The << marks the place
// for values below 10,000, just use %%low-order
+ " =%%low-order=;\n"
// for values above 10,000, split into two groups of four digits
- // and format each with %%high-order (putting an M in betwen)
+ // and format each with %%high-order (putting an M in between)
+ " 10,000: <%%high-order<\u039c>%%high-order>;\n"
// for values above 100,000,000, add another group onto the front
// and another M
"Words for digits",
"Chinese place-value notation",
"Roman numerals",
- "Hebrew ahlphabetic numerals",
+ "Hebrew alphabetic numerals",
"Greek alphabetic numerals" };
/**
* numbers must be restricted to a 32-bit <code>int</code>. This
* restricts the overall supported range. Furthermore, restricting
* the supported range simplifies the computations by removing
- * special case code that was used to accomodate arithmetic overflow
+ * special case code that was used to accommodate arithmetic overflow
* at millis near <code>Long.MIN_VALUE</code> and
* <code>Long.MAX_VALUE</code>.</li>
*
int min = 0;
long startMs = getTimeInMillis();
long targetMs = when.getTime();
- // Always add from the start millis. This accomodates
+ // Always add from the start millis. This accommodates
// operations like adding years from February 29, 2000 up to
// February 29, 2004. If 1, 1, 1, 1 is added to the year
// field, the DOM gets pinned to 28 and stays there, giving an
// /**
// * {@icu}Sets the behavior for handling wall time repeating multiple times
// * at negative time zone offset transitions. For example, 1:30 AM on
-// * November 6, 2011 in US Eastern time (Ameirca/New_York) occurs twice;
+// * November 6, 2011 in US Eastern time (America/New_York) occurs twice;
// * 1:30 AM EDT, then 1:30 AM EST one hour later. When <code>WALLTIME_FIRST</code>
// * is used, the wall time 1:30AM in this example will be interpreted as 1:30 AM EDT
// * (first occurrence). When <code>WALLTIME_LAST</code> is used, it will be
/*
* FROM_U_CALLBACK_ESCAPE context option to escape the code unit according to C (\\uXXXX \\UXXXXXXXX)
- * TO_U_CALLBACK_ESCAPE option to escape the character value accoding to C (\\xXXXX)
+ * TO_U_CALLBACK_ESCAPE option to escape the character value according to C (\\xXXXX)
*/
private static final String ESCAPE_C = "C";
/*
* FROM_U_CALLBACK_ESCAPE context option to escape the code unit according to XML Decimal escape \htmlonly(&#DDDD;)\endhtmlonly
- * TO_U_CALLBACK_ESCAPE context option to escape the character value accoding to XML Decimal escape \htmlonly(&#DDDD;)\endhtmlonly
+ * TO_U_CALLBACK_ESCAPE context option to escape the character value according to XML Decimal escape \htmlonly(&#DDDD;)\endhtmlonly
*/
private static final String ESCAPE_XML_DEC = "D";
/* is the code point valid in current script? */
if (sourceChar > ASCII_END &&
(validityTable[targetUniChar & 0x7F] & data.currentMaskToUnicode) == 0) {
- /* Vocallic RR is assigne in ISCII Telugu and Unicode */
+ /* Vocallic RR is assigned in ISCII Telugu and Unicode */
if (data.currentDeltaToUnicode != (TELUGU_DELTA) || targetUniChar != VOCALLIC_RR) {
targetUniChar = UConverterConstants.missingCharMarker;
}
/*
* Rules for ISO-2022-KR encoding
* i) The KSC5601 designator sequence should appear only once in a file,
- * at the begining of a line before any KSC5601 characters. This usually
+ * at the beginning of a line before any KSC5601 characters. This usually
* means that it appears by itself on the first line of the file
* ii) There are only 2 shifting sequences SO to shift into double byte mode
* and SI to shift into single byte mode
private static final short ULMBCS_GRP_TW = 0x12; /* Chinese SC :ibm-950 */
private static final short ULMBCS_GRP_CN = 0x13; /* Chinese TC :ibm-1386 */
/*
- * So, the beginnning of understanding LMBCS is that IF the first byte of a LMBCS
+ * So, the beginning of understanding LMBCS is that IF the first byte of a LMBCS
* character is one of those 12 values, you can interpret the remaining bytes of
* that character as coming from one of those character sets. Since the lower
* ANSI bytes already are represented in singl bytes, using one of the chracter
// A Hangul syllable completely inside a contraction is ok.
}
// Note: If there is a prefix, then the parser checked that
- // both the prefix and the string beging with NFC boundaries (not Jamo V or T).
+ // both the prefix and the string begin with NFC boundaries (not Jamo V or T).
// Therefore: prefix.isEmpty() || !isJamoVOrT(nfdString.charAt(0))
// (While handling a Hangul syllable, prefixes on Jamo V or T
// would not see the previous Jamo of that syllable.)
* <p>There are basically 3 usage scenarios for porting:</p>
* <p>1) UTrieEnumValue is the only implemented callback then just implement a
* subclass of TrieIterator and override the extract(int) method. The
- * extract(int) method is analogus to UTrieEnumValue callback.
+ * extract(int) method is analogous to UTrieEnumValue callback.
* </p>
* <p>2) UTrieEnumValue and UTrieEnumRange both are implemented then implement
* a subclass of TrieIterator, override the extract method and iterate, e.g
* <p>Returns true if we are not at the end of the iteration, false
* otherwise.</p>
* <p>The next set of codepoints with the same value type will be
- * calculated during this call and returned in the arguement element.</p>
+ * calculated during this call and returned in the argument element.</p>
* @param element return result
* @return true if we are not at the end of the iteration, false otherwise.
* @exception NoSuchElementException - if no more elements exist.
* this character are not included in the output
* @param output an array to receive the substrings between
* instances of divider. It must be large enough on entry to
- * accomodate all output. Adjacent instances of the divider
+ * accommodate all output. Adjacent instances of the divider
* character will place empty strings into output. Before
* returning, output is padded out with empty strings.
*/
@Deprecated
UNIT("unit"),
/**
- * Style for units in abbrevated form
+ * Style for units in abbreviated form
* @internal
* @deprecated This API is ICU internal only.
*/
* <li>messageText can contain quoted literal strings including syntax characters.
* A quoted literal string begins with an ASCII apostrophe and a syntax character
* (usually a {curly brace}) and continues until the next single apostrophe.
- * A double ASCII apostrohpe inside or outside of a quoted string represents
+ * A double ASCII apostrophe inside or outside of a quoted string represents
* one literal apostrophe.
* <li>Quotable syntax characters are the {curly braces} in all messageText parts,
* plus the '#' sign in a messageText immediately inside a pluralStyle,
break;
case RBBIRuleParseTable.doEndAssign: {
- // We have reached the end of an assignement statement.
+ // We have reached the end of an assignment statement.
// Current scan char is the ';' that terminates the assignment.
// Terminate expression, leaves expression parse tree rooted in TOS
//
// calculate the functions nullable, firstpos, lastpos and followpos on
// nodes in the parse tree.
- // See the alogrithm description in Aho.
+ // See the algorithm description in Aho.
// Understanding how this works by looking at the code alone will be
// nearly impossible.
//
previous();
} else {
// seek() leaves the BreakCache positioned at the preceding boundary
- // if the requested position is between two bounaries.
+ // if the requested position is between two boundaries.
// current() pushes the BreakCache position out to the BreakIterator itself.
assert(startPos > fTextIdx);
current();
* numbers must be restricted to a 32-bit <code>int</code>. This
* restricts the overall supported range. Furthermore, restricting
* the supported range simplifies the computations by removing
- * special case code that was used to accomodate arithmetic overflow
+ * special case code that was used to accommodate arithmetic overflow
* at millis near <code>Long.MIN_VALUE</code> and
* <code>Long.MAX_VALUE</code>.</li>
*
int min = 0;
long startMs = getTimeInMillis();
long targetMs = when.getTime();
- // Always add from the start millis. This accomodates
+ // Always add from the start millis. This accommodates
// operations like adding years from February 29, 2000 up to
// February 29, 2004. If 1, 1, 1, 1 is added to the year
// field, the DOM gets pinned to 28 and stays there, giving an
/**
* {@icu}Sets the behavior for handling wall time repeating multiple times
* at negative time zone offset transitions. For example, 1:30 AM on
- * November 6, 2011 in US Eastern time (Ameirca/New_York) occurs twice;
+ * November 6, 2011 in US Eastern time (America/New_York) occurs twice;
* 1:30 AM EDT, then 1:30 AM EST one hour later. When <code>WALLTIME_FIRST</code>
* is used, the wall time 1:30AM in this example will be interpreted as 1:30 AM EDT
* (first occurrence). When <code>WALLTIME_LAST</code> is used, it will be
*/
public enum CalculationType {
/**
- * Religious calendar (atronomical simulation)
+ * Religious calendar (astronomical simulation)
* @stable ICU 52
*/
ISLAMIC ("islamic"),
}
// Use only for decodeStartRule() and decodeEndRule() where the year is not
- // available. Set February to 29 days to accomodate rules with that date
+ // available. Set February to 29 days to accommodate rules with that date
// and day-of-week-on-or-before-that-date mode (DOW_LE_DOM_MODE).
// The compareToRule() method adjusts to February 28 in non-leap years.
//
/**
* Constant for the Taiwan Era for years before Minguo 1.
- * Brefore Minuo 1 is Gregorian 1911, Before Minguo 2 is Gregorian 1910
+ * Before Minuo 1 is Gregorian 1911, Before Minguo 2 is Gregorian 1910
* and so on.
*
* @see com.ibm.icu.util.Calendar#ERA
# [default: ICU4J]
com.ibm.icu.impl.javaspi.ICULocaleServiceProvider.icuVariantSuffix = ICU4J
-# Whether if 3-letter language Locales are included in getAvailabeLocales.
+# Whether if 3-letter language Locales are included in getAvailableLocales.
# [default: true]
com.ibm.icu.impl.javaspi.ICULocaleServiceProvider.enableIso3Languages = true
* @param text the text to be transliterated
* @param index the position indices
* @param incremental if TRUE, then assume more characters may be inserted
- * at index.limit, and postpone processing to accomodate future incoming
+ * at index.limit, and postpone processing to accommodate future incoming
* characters
* @param rollback if TRUE and if incremental is TRUE, then perform special
* incremental processing, as described above, and undo partial
* @param text the text to be transliterated
* @param index the position indices
* @param incremental if TRUE, then assume more characters may be inserted
- * at index.limit, and postpone processing to accomodate future incoming
+ * at index.limit, and postpone processing to accommodate future incoming
* characters
* @stable ICU 2.0
*/
䰙 < an\-ancient\-unit\-of\-capacity\-with\-three\-feet\-and\-a\-big\-opening;
䔹 < a\-fungus\-which\-grows\-on\-rotten\-plants\-and\-is\-eaten\-when\-fresh;
㯣 < a\-kind\-of\-fragrant\-tree\-used\-to\-produce\-perfume\-by\-burning\-it;
-㯡 < to\-lacquer\-some\-kind\-of\-ashes\-on\-wooden\-articals\-or\-furniture;
+㯡 < to\-lacquer\-some\-kind\-of\-ashes\-on\-wooden\-articles\-or\-furniture;
悲天憫人 < bemoan\-the\-state\-of\-the\-universe\-and\-pity\-the\-fate\-of\-mankind;
惋惜 < to\-feel\-sorry\-for\-a\-person\-over\-sth\-that\-should\-have\-happened;
峋 < ranges\-of\-hills\-stretching\-on\-beyond\-another\-irregular\-peaks;
㶬 < bright\-lights\-and\-illuminations\-of\-the\-fire;
㶆 < name\-of\-a\-stream\-in\-hebei\-province\-hengshan;
斯佩林 < spelling\-\(eg\,\-spelling\-entertainment\-group\);
-㮫 < a\-wooden\-artical\-to\-be\-used\-to\-adjust\-a\-bow;
+㮫 < a\-wooden\-article\-to\-be\-used\-to\-adjust\-a\-bow;
㫍 < the\-scallops\-along\-the\-lower\-edge\-of\-a\-flag;
㧏 < to\-carry\-on\-the\-shouldersof\-two\-or\-more\-men;
星體 < celestial\-body\-\(eg\,\-planet\,\-satellite\,\-etc\);
經營 < engage\-in\-\(a\-business\-activity\,\-etc\.\);
集成 < integrated\-\(as\-in\-integrated\-circuit\);
麅 < a\-small\-spotted\-deer\-found\-in\-n\.china;
-內懮外患 < domestic\-strife\-and\-foreign\-agression;
+內懮外患 < domestic\-strife\-and\-foreign\-aggression;
安全與交換委員會 < securities\-and\-exchange\-communication;
政委 < political\-commissar\-\(within\-the\-army\);
沈國放 < chinese\-foreign\-ministry\-spokesperson;
媒體接口連接器 < medium\-interface\-connector;
底特律 < detroit\-\(a\-city\-in\-the\-us\);
䬱 < coarse\-grains\-such\-as\-corn;
-中國科學院 < chinese\-acadamy\-of\-science;
+中國科學院 < chinese\-academy\-of\-science;
䩲 < a\-tool\-used\-to\-cut\-leather;
䩚 < to\-mend\-the\-soles\-of\-shoes;
百發百中 < every\-shot\-hits\-the\-target;
憀 < to\-rely\-on;
引人注意 < attractive;
手稿 < manuscript;
-抹油 < to\-annoint;
+抹油 < to\-anoint;
愓 < profligate;
表尺 < rear\-sight;
惏 < avaricious;
願意不願意 > whether\-one\-wants\-to\-or\-not;
發展核武器 > to\-develop\-nuclear\-weapons;
叛變的省份 > renegade\-province\-\(taiwan\);
-中國科學院 > chinese\-acadamy\-of\-science;
+中國科學院 > chinese\-academy\-of\-science;
用戶端設備 > customer\-premise\-equipment;
不等價交換 > exchange\-of\-unequal\-values;
永久虛電路 > permanent\-virtual\-circuit;
不遠千里 > make\-light\-of\-travelling\-a\-thousand\-li;
安居樂業 > live\-and\-work\-in\-peace\-and\-contentment;
遍體鱗傷 > covered\-all\-over\-with\-cuts\-and\-bruises;
-內懮外患 > domestic\-strife\-and\-foreign\-agression;
+內懮外患 > domestic\-strife\-and\-foreign\-aggression;
治病救人 > cure\-the\-sickness\-to\-save\-the\-patient;
哀鴻遍野 > a\-land\-swarming\-with\-disaster\-victims;
病從口入 > illness\-finds\-its\-way\-in\-by\-the\-mouth;
聖靈 > holy\-ghost;
指控 > accusation;
手稿 > manuscript;
-抹油 > to\-annoint;
+抹油 > to\-anoint;
表尺 > rear\-sight;
畢業 > graduation;
固執 > persistent;
䰙 > an\-ancient\-unit\-of\-capacity\-with\-three\-feet\-and\-a\-big\-opening;
䔹 > a\-fungus\-which\-grows\-on\-rotten\-plants\-and\-is\-eaten\-when\-fresh;
㯣 > a\-kind\-of\-fragrant\-tree\-used\-to\-produce\-perfume\-by\-burning\-it;
-㯡 > to\-lacquer\-some\-kind\-of\-ashes\-on\-wooden\-articals\-or\-furniture;
+㯡 > to\-lacquer\-some\-kind\-of\-ashes\-on\-wooden\-articles\-or\-furniture;
峋 > ranges\-of\-hills\-stretching\-on\-beyond\-another\-irregular\-peaks;
歃 > smear\-one''s\-mouth\-with\-blood\-of\-a\-victim\-when\-taking\-an\-oath;
羗 > tribes\-in\-west\-china\-strong\.\-educated\.\-obstinate\.\-a\-particle;
㶬 > bright\-lights\-and\-illuminations\-of\-the\-fire;
㶡 > bright\-lights\-and\-illuminations\-of\-the\-fire;
㶆 > name\-of\-a\-stream\-in\-hebei\-province\-hengshan;
-㮫 > a\-wooden\-artical\-to\-be\-used\-to\-adjust\-a\-bow;
+㮫 > a\-wooden\-article\-to\-be\-used\-to\-adjust\-a\-bow;
㫍 > the\-scallops\-along\-the\-lower\-edge\-of\-a\-flag;
㧏 > to\-carry\-on\-the\-shouldersof\-two\-or\-more\-men;
㛶 > do\-not\-care\-about\-appearance\-and\-deportment;
}
/**
- * Verify that MessageFormat accomodates more than 10 arguments and
+ * Verify that MessageFormat accommodates more than 10 arguments and
* more than 10 subformats.
*/
@Test
// beginning at 20, we use the >> to mark the position where
// the result of formatting the number's ones digit. Thus,
// we only need a new rule at every multiple of 10. Text in
- // backets is omitted if the value being formatted is an
+ // brackets is omitted if the value being formatted is an
// even multiple of 10.
"20: twenty[->>];\n" +
"30: thirty[->>];\n" +
"40: quarante[->%%alt-ones>];\n" +
"50: cinquante[->%%alt-ones>];\n" +
// rule for 60. The /20 causes this rule's multiplier to be
- // 20 rather than 10, allowinhg us to recurse for all values
+ // 20 rather than 10, allowing us to recurse for all values
// from 60 to 79...
"60/20: soixante[->%%alt-ones>];\n" +
// ...except for 71, which must be special-cased
/**
* Add a gap from index to index+count-1.
* The values there are undefined, and must be set.
- * Logically grows arrays to accomodate. Actual growth is limited
+ * Logically grows arrays to accommodate. Actual growth is limited
* @param index
* @param count
*/
}
}
}
- return orgNames; // begining with 'test', keeping case
+ return orgNames; // beginning with 'test', keeping case
}
/**
*
* @see com.ibm.icu.util.UniversalTimeScale
*
- * @param args - the command line arugments
+ * @param args - the command line arguments
*/
public static void main(String[] args)
{
// Make sure the CaseEquivClass data can fit.
if (maxLen > 8) {
- throw new RuntimeException("Must adjust CaseEquivClass to accomodate " + maxLen + " UChars");
+ throw new RuntimeException("Must adjust CaseEquivClass to accommodate " + maxLen + " UChars");
}
// Also make sure that we can map into this array using a
Line *prevL = &prevTestLine;
// This can be further optimized, since we now know that we have a
// sorted list of expansions, so current can start from toMove, since all
- // the elements before it are already smaller. In the beggining it needs to
+ // the elements before it are already smaller. In the beginning it needs to
// be on gLines, though.
Line *current = *gLines;
while(current) {
for(k = 0; k < size; k++) { // k is index of a thing that is not doubled
current = *(gLines+k);
// see if we have moved to front
- // has it moved to the very beggining
+ // has it moved to the very beginning
if((startStrength = probeStrength((gLines+k), &startP, comparer)) != UCOL_OFF) {
continue; // this one is in the front
}
#
# @group General
#
-# @groupComment Some items that are common accross groups
+# @groupComment Some items that are common across groups
# @translated true @created 2000-11-10 @modified 2000-10-26 @creator Jared @modifier Jared
# @comment The file or class composed of the default translations for the bundle
# @comment Ability to export resource bundles in a variety of formats
menu_file_export=Export\ Resource\ Bundles
# @translated true @created 2002-05-17 @modified 2002-05-17 @creator George Rhoten @modifier George Rhoten
-# @comment Ablity to export to ICU Resource Bundle files
+# @comment Ability to export to ICU Resource Bundle files
menu_file_export_ICU=ICU\ Files...
# @translated true @created 2002-05-17 @modified 2002-05-17 @creator George Rhoten @modifier George Rhoten
# @comment
menu_file_export_ICU_trigger=i
# @translated true @created 2001-01-15 @modified 2001-01-15 @creator Jared Jackson @modifier Jared Jackson
-# @comment Ablity to export to TMX XML files
+# @comment Ability to export to TMX XML files
menu_file_export_TMX=TMX\ Files...
# @translated true @created 2001-01-15 @modified 2001-01-15 @creator Jared Jackson @modifier Jared Jackson
# @comment
# @comment Menu item for import and merging another resource file with the bundle being worked with
menu_file_import=Merge\ (Import\ into)\ To\ Resource\ Bundle
# @translated true @created 2001-01-15 @modified 2001-01-15 @creator Jared Jackson @modifier Jared Jackson
-# @comment Import abliity from XML TMX documents
+# @comment Import ability from XML TMX documents
menu_file_import_TMX=TMX\ Documents...
# @translated true @created 2001-01-15 @modified 2001-01-15 @creator Jared Jackson @modifier Jared Jackson
# @comment
#
# @group General
#
-# @groupComment Some items that are common accross groups
+# @groupComment Some items that are common across groups
# @translated true @created 2000-11-10 @modified 2000-11-08 @creator Jared @modifier Martin Gerlach
# @comment The file or class composed of the default translations for the bundle
# @comment Ability to export resource bundles in a variety of formats
menu_file_export=Resourcenb\u00FCndel\ exportieren
# @translated true @created 2002-05-17 @modified 2002-05-17 @creator George Rhoten @modifier George Rhoten
-# @comment Ablity to export to ICU Resource Bundle files
+# @comment Ability to export to ICU Resource Bundle files
menu_file_export_ICU=ICU\ Dokumente...
# @translated true @created 2002-05-17 @modified 2002-05-17 @creator George Rhoten @modifier George Rhoten
# @comment
menu_file_export_ICU_trigger=i
# @translated true @created 2001-01-15 @modified 2001-02-09 @creator Jared Jackson @modifier Jared Jackson
-# @comment Ablity to export to TMX XML files
+# @comment Ability to export to TMX XML files
menu_file_export_TMX=TMX\ Dateien...
# @translated true @created 2001-01-15 @modified 2001-02-09 @creator Jared Jackson @modifier Jared Jackson
# @comment
# @comment Menu item for import and merging another resource file with the bundle being worked with
menu_file_import=Resource-Bundle\ aus\ Datei\ importieren...
# @translated true @created 2001-01-15 @modified 2001-02-09 @creator Jared Jackson @modifier Jared Jackson
-# @comment Import abliity from XML TMX documents
+# @comment Import ability from XML TMX documents
menu_file_import_TMX=TMX\ Dokumente...
# @translated true @created 2001-01-15 @modified 2001-02-09 @creator Jared Jackson @modifier Jared Jackson
# @comment
#
# @group General
#
-# @groupComment Some items that are common accross groups
+# @groupComment Some items that are common across groups
# @translated true @created 2001-12-17 @modified 2000-11-09 @creator Jared @modifier Jussi Myllymäki
# @comment The file or class composed of the default translations for the bundle
# @comment Ability to export resource bundles in a variety of formats
menu_file_export=Resurssikokoelman\ siirto
# @translated true @created 2002-05-17 @modified 2002-05-17 @creator George Rhoten @modifier George Rhoten
-# @comment Ablity to export to ICU Resource Bundle files
+# @comment Ability to export to ICU Resource Bundle files
menu_file_export_ICU=ICU-tiedostot...
# @translated true @created 2002-05-17 @modified 2002-05-17 @creator George Rhoten @modifier George Rhoten
# @comment
menu_file_export_ICU_trigger=i
# @translated true @created 2001-12-17 @modified 2001-02-08 @creator Jared Jackson @modifier Jared Jackson
-# @comment Ablity to export to TMX XML files
+# @comment Ability to export to TMX XML files
menu_file_export_TMX=TMX-tiedostot...
# @translated true @created 2001-12-17 @modified 2001-02-08 @creator Jared Jackson @modifier Jared Jackson
# @comment
# @comment Menu item for import and merging another resource file with the bundle being worked with
menu_file_import=Lue\ resurssikokoelma\ tiedostosta...
# @translated true @created 2001-12-17 @modified 2001-02-08 @creator Jared Jackson @modifier Jared Jackson
-# @comment Import abliity from XML TMX documents
+# @comment Import ability from XML TMX documents
menu_file_import_TMX=TMX-tiedostot...
# @translated true @created 2001-12-17 @modified 2001-02-08 @creator Jared Jackson @modifier Jared Jackson
# @comment
#
# @group General
#
-# @groupComment Some items that are common accross groups
+# @groupComment Some items that are common across groups
# @translated true @created 2000-11-10 @modified 2000-11-08 @creator Jared @modifier Stefan Edlund
# @comment The file or class composed of the default translations for the bundle
# @comment Ability to export resource bundles in a variety of formats
menu_file_export=Exportera\ resursbunt
# @translated true @created 2002-05-17 @modified 2002-05-17 @creator George Rhoten @modifier George Rhoten
-# @comment Ablity to export to ICU Resource Bundle files
+# @comment Ability to export to ICU Resource Bundle files
menu_file_export_ICU=ICU\ Filer...
# @translated true @created 2002-05-17 @modified 2002-05-17 @creator George Rhoten @modifier George Rhoten
# @comment
menu_file_export_ICU_trigger=i
# @translated true @created 2001-01-15 @modified 2001-02-19 @creator Jared Jackson @modifier Jared Jackson
-# @comment Ablity to export to TMX XML files
+# @comment Ability to export to TMX XML files
menu_file_export_TMX=TMX\ Filer...
# @translated true @created 2001-01-15 @modified 2001-01-15 @creator Jared Jackson @modifier Jared Jackson
# @comment
# @comment Menu item for import and merging another resource file with the bundle being worked with
menu_file_import=Importera\ resursgrupp\ fran\ fil...
# @translated true @created 2001-01-15 @modified 2001-02-19 @creator Jared Jackson @modifier Jared Jackson
-# @comment Import abliity from XML TMX documents
+# @comment Import ability from XML TMX documents
menu_file_import_TMX=TMX\ document...
# @translated true @created 2001-01-15 @modified 2001-01-15 @creator Jared Jackson @modifier Jared Jackson
# @comment
// Returns an estimation of k such that 10^(k-1) <= v < 10^k where
// v = f * 2^exponent and 2^52 <= f < 2^53.
// v is hence a normalized double with the given exponent. The output is an
-// approximation for the exponent of the decimal approimation .digits * 10^k.
+// approximation for the exponent of the decimal approximation .digits * 10^k.
//
// The result might undershoot by 1 in which case 10^k <= v < 10^k+1.
// Note: this property holds for v's upper boundary m+ too.
//
// Let ep == estimated_power, then the returned values will satisfy:
// v / 10^ep = numerator / denominator.
-// v's boundarys m- and m+:
+// v's boundaries m- and m+:
// m- / 10^ep == v / 10^ep - delta_minus / denominator
// m+ / 10^ep == v / 10^ep + delta_plus / denominator
// Or in other words:
projects / icu / commitdiff