1999-12-28 23:57:50 +00:00
|
|
|
/*
|
2001-03-22 00:09:10 +00:00
|
|
|
* Copyright (C) 1999-2001, International Business Machines Corporation and others. All Rights Reserved.
|
1999-12-28 23:57:50 +00:00
|
|
|
**********************************************************************
|
|
|
|
* Date Name Description
|
|
|
|
* 11/17/99 aliu Creation.
|
|
|
|
**********************************************************************
|
|
|
|
*/
|
|
|
|
#ifndef TRANSLIT_H
|
|
|
|
#define TRANSLIT_H
|
|
|
|
|
|
|
|
#include "unicode/unistr.h"
|
2000-03-18 01:19:39 +00:00
|
|
|
#include "unicode/parseerr.h"
|
2000-06-27 19:00:38 +00:00
|
|
|
#include "unicode/utrans.h" // UTransPosition, UTransDirection
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
class Replaceable;
|
|
|
|
class UnicodeFilter;
|
2001-07-16 20:48:46 +00:00
|
|
|
class UnicodeSet;
|
1999-12-28 23:57:50 +00:00
|
|
|
class TransliterationRuleData;
|
2000-03-28 22:12:14 +00:00
|
|
|
class Hashtable;
|
2000-01-11 17:26:46 +00:00
|
|
|
class U_I18N_API UVector;
|
2000-01-18 19:57:46 +00:00
|
|
|
class CompoundTransliterator;
|
1999-12-28 23:57:50 +00:00
|
|
|
|
2001-09-19 16:50:06 +00:00
|
|
|
U_CFUNC UBool transliterator_cleanup();
|
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
/**
|
|
|
|
* <code>Transliterator</code> is an abstract class that
|
|
|
|
* transliterates text from one format to another. The most common
|
|
|
|
* kind of transliterator is a script, or alphabet, transliterator.
|
|
|
|
* For example, a Russian to Latin transliterator changes Russian text
|
|
|
|
* written in Cyrillic characters to phonetically equivalent Latin
|
|
|
|
* characters. It does not <em>translate</em> Russian to English!
|
|
|
|
* Transliteration, unlike translation, operates on characters, without
|
|
|
|
* reference to the meanings of words and sentences.
|
|
|
|
*
|
|
|
|
* <p>Although script conversion is its most common use, a
|
|
|
|
* transliterator can actually perform a more general class of tasks.
|
|
|
|
* In fact, <code>Transliterator</code> defines a very general API
|
|
|
|
* which specifies only that a segment of the input text is replaced
|
|
|
|
* by new text. The particulars of this conversion are determined
|
|
|
|
* entirely by subclasses of <code>Transliterator</code>.
|
|
|
|
*
|
|
|
|
* <p><b>Transliterators are stateless</b>
|
|
|
|
*
|
|
|
|
* <p><code>Transliterator</code> objects are <em>stateless</em>; they
|
|
|
|
* retain no information between calls to
|
|
|
|
* <code>transliterate()</code>. (However, this does <em>not</em>
|
|
|
|
* mean that threads may share transliterators without synchronizing
|
|
|
|
* them. Transliterators are not immutable, so they must be
|
|
|
|
* synchronized when shared between threads.) This1 might seem to
|
|
|
|
* limit the complexity of the transliteration operation. In
|
|
|
|
* practice, subclasses perform complex transliterations by delaying
|
|
|
|
* the replacement of text until it is known that no other
|
|
|
|
* replacements are possible. In other words, although the
|
|
|
|
* <code>Transliterator</code> objects are stateless, the source text
|
|
|
|
* itself embodies all the needed information, and delayed operation
|
|
|
|
* allows arbitrary complexity.
|
|
|
|
*
|
|
|
|
* <p><b>Batch transliteration</b>
|
|
|
|
*
|
|
|
|
* <p>The simplest way to perform transliteration is all at once, on a
|
|
|
|
* string of existing text. This is referred to as <em>batch</em>
|
|
|
|
* transliteration. For example, given a string <code>input</code>
|
|
|
|
* and a transliterator <code>t</code>, the call
|
|
|
|
*
|
|
|
|
* <blockquote><code>String result = t.transliterate(input);
|
|
|
|
* </code></blockquote>
|
|
|
|
*
|
|
|
|
* will transliterate it and return the result. Other methods allow
|
|
|
|
* the client to specify a substring to be transliterated and to use
|
|
|
|
* {@link Replaceable} objects instead of strings, in order to
|
|
|
|
* preserve out-of-band information (such as text styles).
|
|
|
|
*
|
|
|
|
* <p><b>Keyboard transliteration</b>
|
|
|
|
*
|
|
|
|
* <p>Somewhat more involved is <em>keyboard</em>, or incremental
|
|
|
|
* transliteration. This is the transliteration of text that is
|
|
|
|
* arriving from some source (typically the user's keyboard) one
|
|
|
|
* character at a time, or in some other piecemeal fashion.
|
|
|
|
*
|
|
|
|
* <p>In keyboard transliteration, a <code>Replaceable</code> buffer
|
|
|
|
* stores the text. As text is inserted, as much as possible is
|
|
|
|
* transliterated on the fly. This means a GUI that displays the
|
|
|
|
* contents of the buffer may show text being modified as each new
|
|
|
|
* character arrives.
|
|
|
|
*
|
|
|
|
* <p>Consider the simple <code>RuleBasedTransliterator</code>:
|
|
|
|
*
|
|
|
|
* <blockquote><code>
|
|
|
|
* th>{theta}<br>
|
|
|
|
* t>{tau}
|
|
|
|
* </code></blockquote>
|
|
|
|
*
|
|
|
|
* When the user types 't', nothing will happen, since the
|
|
|
|
* transliterator is waiting to see if the next character is 'h'. To
|
|
|
|
* remedy this, we introduce the notion of a cursor, marked by a '|'
|
|
|
|
* in the output string:
|
|
|
|
*
|
|
|
|
* <blockquote><code>
|
|
|
|
* t>|{tau}<br>
|
|
|
|
* {tau}h>{theta}
|
|
|
|
* </code></blockquote>
|
|
|
|
*
|
|
|
|
* Now when the user types 't', tau appears, and if the next character
|
|
|
|
* is 'h', the tau changes to a theta. This is accomplished by
|
|
|
|
* maintaining a cursor position (independent of the insertion point,
|
|
|
|
* and invisible in the GUI) across calls to
|
2000-01-18 18:27:27 +00:00
|
|
|
* <code>transliterate()</code>. Typically, the cursor will
|
1999-12-28 23:57:50 +00:00
|
|
|
* be coincident with the insertion point, but in a case like the one
|
|
|
|
* above, it will precede the insertion point.
|
|
|
|
*
|
|
|
|
* <p>Keyboard transliteration methods maintain a set of three indices
|
|
|
|
* that are updated with each call to
|
2000-01-18 18:27:27 +00:00
|
|
|
* <code>transliterate()</code>, including the cursor, start,
|
1999-12-28 23:57:50 +00:00
|
|
|
* and limit. Since these indices are changed by the method, they are
|
|
|
|
* passed in an <code>int[]</code> array. The <code>START</code> index
|
|
|
|
* marks the beginning of the substring that the transliterator will
|
|
|
|
* look at. It is advanced as text becomes committed (but it is not
|
|
|
|
* the committed index; that's the <code>CURSOR</code>). The
|
|
|
|
* <code>CURSOR</code> index, described above, marks the point at
|
|
|
|
* which the transliterator last stopped, either because it reached
|
|
|
|
* the end, or because it required more characters to disambiguate
|
|
|
|
* between possible inputs. The <code>CURSOR</code> can also be
|
|
|
|
* explicitly set by rules in a <code>RuleBasedTransliterator</code>.
|
|
|
|
* Any characters before the <code>CURSOR</code> index are frozen;
|
|
|
|
* future keyboard transliteration calls within this input sequence
|
|
|
|
* will not change them. New text is inserted at the
|
|
|
|
* <code>LIMIT</code> index, which marks the end of the substring that
|
|
|
|
* the transliterator looks at.
|
|
|
|
*
|
|
|
|
* <p>Because keyboard transliteration assumes that more characters
|
|
|
|
* are to arrive, it is conservative in its operation. It only
|
|
|
|
* transliterates when it can do so unambiguously. Otherwise it waits
|
|
|
|
* for more characters to arrive. When the client code knows that no
|
|
|
|
* more characters are forthcoming, perhaps because the user has
|
|
|
|
* performed some input termination operation, then it should call
|
2000-01-18 18:27:27 +00:00
|
|
|
* <code>finishTransliteration()</code> to complete any
|
1999-12-28 23:57:50 +00:00
|
|
|
* pending transliterations.
|
|
|
|
*
|
|
|
|
* <p><b>Inverses</b>
|
|
|
|
*
|
|
|
|
* <p>Pairs of transliterators may be inverses of one another. For
|
|
|
|
* example, if transliterator <b>A</b> transliterates characters by
|
|
|
|
* incrementing their Unicode value (so "abc" -> "def"), and
|
|
|
|
* transliterator <b>B</b> decrements character values, then <b>A</b>
|
|
|
|
* is an inverse of <b>B</b> and vice versa. If we compose <b>A</b>
|
|
|
|
* with <b>B</b> in a compound transliterator, the result is the
|
|
|
|
* indentity transliterator, that is, a transliterator that does not
|
|
|
|
* change its input text.
|
|
|
|
*
|
|
|
|
* The <code>Transliterator</code> method <code>getInverse()</code>
|
|
|
|
* returns a transliterator's inverse, if one exists, or
|
|
|
|
* <code>null</code> otherwise. However, the result of
|
|
|
|
* <code>getInverse()</code> usually will <em>not</em> be a true
|
|
|
|
* mathematical inverse. This is because true inverse transliterators
|
|
|
|
* are difficult to formulate. For example, consider two
|
|
|
|
* transliterators: <b>AB</b>, which transliterates the character 'A'
|
|
|
|
* to 'B', and <b>BA</b>, which transliterates 'B' to 'A'. It might
|
|
|
|
* seem that these are exact inverses, since
|
|
|
|
*
|
|
|
|
* <blockquote>"A" x <b>AB</b> -> "B"<br>
|
|
|
|
* "B" x <b>BA</b> -> "A"</blockquote>
|
|
|
|
*
|
|
|
|
* where 'x' represents transliteration. However,
|
|
|
|
*
|
|
|
|
* <blockquote>"ABCD" x <b>AB</b> -> "BBCD"<br>
|
|
|
|
* "BBCD" x <b>BA</b> -> "AACD"</blockquote>
|
|
|
|
*
|
|
|
|
* so <b>AB</b> composed with <b>BA</b> is not the
|
|
|
|
* identity. Nonetheless, <b>BA</b> may be usefully considered to be
|
|
|
|
* <b>AB</b>'s inverse, and it is on this basis that
|
|
|
|
* <b>AB</b><code>.getInverse()</code> could legitimately return
|
|
|
|
* <b>BA</b>.
|
|
|
|
*
|
|
|
|
* <p><b>IDs and display names</b>
|
|
|
|
*
|
|
|
|
* <p>A transliterator is designated by a short identifier string or
|
|
|
|
* <em>ID</em>. IDs follow the format <em>source-destination</em>,
|
|
|
|
* where <em>source</em> describes the entity being replaced, and
|
|
|
|
* <em>destination</em> describes the entity replacing
|
|
|
|
* <em>source</em>. The entities may be the names of scripts,
|
|
|
|
* particular sequences of characters, or whatever else it is that the
|
|
|
|
* transliterator converts to or from. For example, a transliterator
|
|
|
|
* from Russian to Latin might be named "Russian-Latin". A
|
|
|
|
* transliterator from keyboard escape sequences to Latin-1 characters
|
|
|
|
* might be named "KeyboardEscape-Latin1". By convention, system
|
|
|
|
* entity names are in English, with the initial letters of words
|
|
|
|
* capitalized; user entity names may follow any format so long as
|
|
|
|
* they do not contain dashes.
|
|
|
|
*
|
|
|
|
* <p>In addition to programmatic IDs, transliterator objects have
|
|
|
|
* display names for presentation in user interfaces, returned by
|
|
|
|
* {@link #getDisplayName}.
|
|
|
|
*
|
|
|
|
* <p><b>Factory methods and registration</b>
|
|
|
|
*
|
|
|
|
* <p>In general, client code should use the factory method
|
|
|
|
* <code>getInstance()</code> to obtain an instance of a
|
|
|
|
* transliterator given its ID. Valid IDs may be enumerated using
|
|
|
|
* <code>getAvailableIDs()</code>. Since transliterators are mutable,
|
|
|
|
* multiple calls to <code>getInstance()</code> with the same ID will
|
|
|
|
* return distinct objects.
|
|
|
|
*
|
|
|
|
* <p>In addition to the system transliterators registered at startup,
|
|
|
|
* user transliterators may be registered by calling
|
|
|
|
* <code>registerInstance()</code> at run time. A registered instance
|
|
|
|
* acts a template; future calls to <tt>getInstance()</tt> with the ID
|
|
|
|
* of the registered object return clones of that object. Thus any
|
|
|
|
* object passed to <tt>registerInstance()</tt> must implement
|
|
|
|
* <tt>clone()</tt> propertly. To register a transliterator subclass
|
|
|
|
* without instantiating it (until it is needed), users may call
|
|
|
|
* <code>registerClass()</code>. In this case, the objects are
|
|
|
|
* instantiated by invoking the zero-argument public constructor of
|
|
|
|
* the class.
|
|
|
|
*
|
|
|
|
* <p><b>Subclassing</b>
|
|
|
|
*
|
2000-01-18 18:27:27 +00:00
|
|
|
* Subclasses must implement the abstract method
|
|
|
|
* <code>handleTransliterate()</code>. <p>Subclasses should override
|
|
|
|
* the <code>transliterate()</code> method taking a
|
|
|
|
* <code>Replaceable</code> and the <code>transliterate()</code>
|
|
|
|
* method taking a <code>String</code> and <code>StringBuffer</code>
|
|
|
|
* if the performance of these methods can be improved over the
|
|
|
|
* performance obtained by the default implementations in this class.
|
1999-12-28 23:57:50 +00:00
|
|
|
*
|
|
|
|
* @author Alan Liu
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
|
|
|
class U_I18N_API Transliterator {
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Programmatic name, e.g., "Latin-Arabic".
|
|
|
|
*/
|
|
|
|
UnicodeString ID;
|
|
|
|
|
2001-03-22 00:09:10 +00:00
|
|
|
/**
|
1999-12-28 23:57:50 +00:00
|
|
|
* This transliterator's filter. Any character for which
|
2000-01-18 20:00:56 +00:00
|
|
|
* <tt>filter.contains()</tt> returns <tt>false</tt> will not be
|
1999-12-28 23:57:50 +00:00
|
|
|
* altered by this transliterator. If <tt>filter</tt> is
|
|
|
|
* <tt>null</tt> then no filtering is applied.
|
|
|
|
*/
|
|
|
|
UnicodeFilter* filter;
|
|
|
|
|
2000-01-18 18:27:27 +00:00
|
|
|
int32_t maximumContextLength;
|
|
|
|
|
2001-07-09 16:33:09 +00:00
|
|
|
public:
|
|
|
|
|
2001-07-03 20:01:56 +00:00
|
|
|
/**
|
2001-07-03 23:44:59 +00:00
|
|
|
* A function that creates and returns a Transliterator.
|
2001-07-03 20:01:56 +00:00
|
|
|
*/
|
2001-07-09 16:45:09 +00:00
|
|
|
typedef Transliterator* (*Factory)(void);
|
2001-07-03 20:01:56 +00:00
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
protected:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Default constructor.
|
|
|
|
* @param ID the string identifier for this transliterator
|
|
|
|
* @param adoptedFilter the filter. Any character for which
|
2000-01-18 20:00:56 +00:00
|
|
|
* <tt>filter.contains()</tt> returns <tt>false</tt> will not be
|
1999-12-28 23:57:50 +00:00
|
|
|
* altered by this transliterator. If <tt>filter</tt> is
|
|
|
|
* <tt>null</tt> then no filtering is applied.
|
|
|
|
*/
|
|
|
|
Transliterator(const UnicodeString& ID, UnicodeFilter* adoptedFilter);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Copy constructor.
|
|
|
|
*/
|
|
|
|
Transliterator(const Transliterator&);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Assignment operator.
|
|
|
|
*/
|
|
|
|
Transliterator& operator=(const Transliterator&);
|
2001-07-13 21:17:11 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Internal factory method.
|
|
|
|
*/
|
|
|
|
static Transliterator* createInstance(const UnicodeString& ID,
|
|
|
|
UTransDirection dir,
|
|
|
|
int32_t idSplitPoint,
|
|
|
|
Transliterator *adoptedSplitTrans,
|
2001-08-31 03:23:39 +00:00
|
|
|
UParseError& parseError,
|
2001-07-13 21:17:11 +00:00
|
|
|
UErrorCode& status);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Internal parsing method.
|
|
|
|
*/
|
|
|
|
static void parseCompoundID(const UnicodeString& ID,
|
2001-07-16 20:48:46 +00:00
|
|
|
UnicodeString& regenID,
|
2001-07-13 21:17:11 +00:00
|
|
|
UTransDirection dir,
|
|
|
|
int32_t idSplitPoint,
|
|
|
|
Transliterator *adoptedSplitTrans,
|
|
|
|
UVector& result,
|
|
|
|
int32_t& splitTransIndex,
|
2001-08-31 03:23:39 +00:00
|
|
|
UParseError& parseError,
|
2001-07-13 21:17:11 +00:00
|
|
|
UErrorCode& status);
|
|
|
|
/**
|
|
|
|
* Internal parsing method for subclasses.
|
|
|
|
*/
|
|
|
|
static Transliterator* parseID(const UnicodeString& ID,
|
2001-07-16 20:48:46 +00:00
|
|
|
UnicodeString& regenID,
|
2001-07-13 21:17:11 +00:00
|
|
|
int32_t& pos,
|
|
|
|
UBool& sawDelimiter,
|
|
|
|
UTransDirection dir,
|
2001-08-31 03:23:39 +00:00
|
|
|
UParseError& parseError,
|
|
|
|
UBool create,
|
|
|
|
UErrorCode& status);
|
2001-07-13 21:17:11 +00:00
|
|
|
|
2001-07-16 20:48:46 +00:00
|
|
|
/**
|
|
|
|
* Internal parsing method for parseID.
|
|
|
|
*/
|
|
|
|
static UBool parseIDBounds(const UnicodeString& ID,
|
|
|
|
int32_t pos,
|
|
|
|
UBool withinParens,
|
|
|
|
int32_t& limit,
|
|
|
|
int32_t& setStart,
|
|
|
|
int32_t& setLimit,
|
|
|
|
int32_t& revStart,
|
|
|
|
UnicodeSet*& filter);
|
|
|
|
|
|
|
|
static void skipSpaces(const UnicodeString& str,
|
|
|
|
int32_t& pos);
|
|
|
|
|
2001-07-13 21:17:11 +00:00
|
|
|
friend class TransliteratorParser; // for parseID()
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Destructor.
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
|
|
|
virtual ~Transliterator();
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Implements Cloneable.
|
|
|
|
* All subclasses are encouraged to implement this method if it is
|
|
|
|
* possible and reasonable to do so. Subclasses that are to be
|
|
|
|
* registered with the system using <tt>registerInstance()<tt>
|
|
|
|
* are required to implement this method. If a subclass does not
|
|
|
|
* implement clone() properly and is registered with the system
|
|
|
|
* using registerInstance(), then the default clone() implementation
|
|
|
|
* will return null, and calls to createInstance() will fail.
|
|
|
|
*
|
|
|
|
* @see #registerInstance
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
|
|
|
virtual Transliterator* clone() const { return 0; }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Transliterates a segment of a string, with optional filtering.
|
|
|
|
*
|
|
|
|
* @param text the string to be transliterated
|
|
|
|
* @param start the beginning index, inclusive; <code>0 <= start
|
|
|
|
* <= limit</code>.
|
|
|
|
* @param limit the ending index, exclusive; <code>start <= limit
|
|
|
|
* <= text.length()</code>.
|
|
|
|
* @param filter the filter. Any character for which
|
2000-01-18 20:00:56 +00:00
|
|
|
* <tt>filter.contains()</tt> returns <tt>false</tt> will not be
|
1999-12-28 23:57:50 +00:00
|
|
|
* altered by this transliterator. If <tt>filter</tt> is
|
|
|
|
* <tt>null</tt> then no filtering is applied.
|
|
|
|
* @return The new limit index. The text previously occupying <code>[start,
|
|
|
|
* limit)</code> has been transliterated, possibly to a string of a different
|
|
|
|
* length, at <code>[start, </code><em>new-limit</em><code>)</code>, where
|
|
|
|
* <em>new-limit</em> is the return value.
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
|
|
|
virtual int32_t transliterate(Replaceable& text,
|
2000-01-18 18:27:27 +00:00
|
|
|
int32_t start, int32_t limit) const;
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Transliterates an entire string in place. Convenience method.
|
|
|
|
* @param text the string to be transliterated
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
|
|
|
virtual void transliterate(Replaceable& text) const;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Transliterates the portion of the text buffer that can be
|
|
|
|
* transliterated unambiguosly after new text has been inserted,
|
|
|
|
* typically as a result of a keyboard event. The new text in
|
|
|
|
* <code>insertion</code> will be inserted into <code>text</code>
|
2000-01-19 19:02:10 +00:00
|
|
|
* at <code>index.limit</code>, advancing
|
|
|
|
* <code>index.limit</code> by <code>insertion.length()</code>.
|
1999-12-28 23:57:50 +00:00
|
|
|
* Then the transliterator will try to transliterate characters of
|
2000-01-19 19:02:10 +00:00
|
|
|
* <code>text</code> between <code>index.cursor</code> and
|
|
|
|
* <code>index.limit</code>. Characters before
|
|
|
|
* <code>index.cursor</code> will not be changed.
|
1999-12-28 23:57:50 +00:00
|
|
|
*
|
2000-01-19 19:02:10 +00:00
|
|
|
* <p>Upon return, values in <code>index</code> will be updated.
|
|
|
|
* <code>index.start</code> will be advanced to the first
|
1999-12-28 23:57:50 +00:00
|
|
|
* character that future calls to this method will read.
|
2000-01-19 19:02:10 +00:00
|
|
|
* <code>index.cursor</code> and <code>index.limit</code> will
|
1999-12-28 23:57:50 +00:00
|
|
|
* be adjusted to delimit the range of text that future calls to
|
|
|
|
* this method may change.
|
|
|
|
*
|
|
|
|
* <p>Typical usage of this method begins with an initial call
|
2000-01-19 19:02:10 +00:00
|
|
|
* with <code>index.start</code> and <code>index.limit</code>
|
1999-12-28 23:57:50 +00:00
|
|
|
* set to indicate the portion of <code>text</code> to be
|
2000-01-19 19:02:10 +00:00
|
|
|
* transliterated, and <code>index.cursor == index.start</code>.
|
|
|
|
* Thereafter, <code>index</code> can be used without
|
1999-12-28 23:57:50 +00:00
|
|
|
* modification in future calls, provided that all changes to
|
|
|
|
* <code>text</code> are made via this method.
|
|
|
|
*
|
|
|
|
* <p>This method assumes that future calls may be made that will
|
|
|
|
* insert new text into the buffer. As a result, it only performs
|
|
|
|
* unambiguous transliterations. After the last call to this
|
|
|
|
* method, there may be untransliterated text that is waiting for
|
|
|
|
* more input to resolve an ambiguity. In order to perform these
|
|
|
|
* pending transliterations, clients should call {@link
|
2000-01-18 18:27:27 +00:00
|
|
|
* #finishTransliteration} after the last call to this
|
1999-12-28 23:57:50 +00:00
|
|
|
* method has been made.
|
2001-03-22 00:09:10 +00:00
|
|
|
*
|
1999-12-28 23:57:50 +00:00
|
|
|
* @param text the buffer holding transliterated and untransliterated text
|
|
|
|
* @param index an array of three integers.
|
|
|
|
*
|
2000-01-19 19:02:10 +00:00
|
|
|
* <ul><li><code>index.start</code>: the beginning index,
|
|
|
|
* inclusive; <code>0 <= index.start <= index.limit</code>.
|
1999-12-28 23:57:50 +00:00
|
|
|
*
|
2000-01-19 19:02:10 +00:00
|
|
|
* <li><code>index.limit</code>: the ending index, exclusive;
|
|
|
|
* <code>index.start <= index.limit <= text.length()</code>.
|
1999-12-28 23:57:50 +00:00
|
|
|
* <code>insertion</code> is inserted at
|
2000-01-19 19:02:10 +00:00
|
|
|
* <code>index.limit</code>.
|
1999-12-28 23:57:50 +00:00
|
|
|
*
|
2000-01-19 19:02:10 +00:00
|
|
|
* <li><code>index.cursor</code>: the next character to be
|
|
|
|
* considered for transliteration; <code>index.start <=
|
|
|
|
* index.cursor <= index.limit</code>. Characters before
|
|
|
|
* <code>index.cursor</code> will not be changed by future calls
|
1999-12-28 23:57:50 +00:00
|
|
|
* to this method.</ul>
|
|
|
|
*
|
|
|
|
* @param insertion text to be inserted and possibly
|
|
|
|
* transliterated into the translation buffer at
|
2000-01-19 19:02:10 +00:00
|
|
|
* <code>index.limit</code>. If <code>null</code> then no text
|
1999-12-28 23:57:50 +00:00
|
|
|
* is inserted.
|
2000-01-18 18:27:27 +00:00
|
|
|
* @see #handleTransliterate
|
2000-01-19 19:02:10 +00:00
|
|
|
* @exception IllegalArgumentException if <code>index</code>
|
1999-12-28 23:57:50 +00:00
|
|
|
* is invalid
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2000-06-27 19:00:38 +00:00
|
|
|
virtual void transliterate(Replaceable& text, UTransPosition& index,
|
2000-01-18 18:27:27 +00:00
|
|
|
const UnicodeString& insertion,
|
|
|
|
UErrorCode& status) const;
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Transliterates the portion of the text buffer that can be
|
|
|
|
* transliterated unambiguosly after a new character has been
|
|
|
|
* inserted, typically as a result of a keyboard event. This is a
|
|
|
|
* convenience method; see {@link
|
2000-01-18 18:27:27 +00:00
|
|
|
* #transliterate(Replaceable, int[], String)} for details.
|
1999-12-28 23:57:50 +00:00
|
|
|
* @param text the buffer holding transliterated and
|
|
|
|
* untransliterated text
|
|
|
|
* @param index an array of three integers. See {@link
|
2000-01-18 18:27:27 +00:00
|
|
|
* #transliterate(Replaceable, int[], String)}.
|
1999-12-28 23:57:50 +00:00
|
|
|
* @param insertion text to be inserted and possibly
|
|
|
|
* transliterated into the translation buffer at
|
2000-01-19 19:02:10 +00:00
|
|
|
* <code>index.limit</code>.
|
2000-01-18 18:27:27 +00:00
|
|
|
* @see #transliterate(Replaceable, int[], String)
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2000-06-27 19:00:38 +00:00
|
|
|
virtual void transliterate(Replaceable& text, UTransPosition& index,
|
2001-07-25 18:50:09 +00:00
|
|
|
UChar32 insertion,
|
2000-01-18 18:27:27 +00:00
|
|
|
UErrorCode& status) const;
|
2001-03-22 00:09:10 +00:00
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
/**
|
|
|
|
* Transliterates the portion of the text buffer that can be
|
|
|
|
* transliterated unambiguosly. This is a convenience method; see
|
2000-01-18 18:27:27 +00:00
|
|
|
* {@link #transliterate(Replaceable, int[], String)} for
|
1999-12-28 23:57:50 +00:00
|
|
|
* details.
|
|
|
|
* @param text the buffer holding transliterated and
|
|
|
|
* untransliterated text
|
|
|
|
* @param index an array of three integers. See {@link
|
2000-01-18 18:27:27 +00:00
|
|
|
* #transliterate(Replaceable, int[], String)}.
|
|
|
|
* @see #transliterate(Replaceable, int[], String)
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2000-06-27 19:00:38 +00:00
|
|
|
virtual void transliterate(Replaceable& text, UTransPosition& index,
|
2000-01-18 18:27:27 +00:00
|
|
|
UErrorCode& status) const;
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Finishes any pending transliterations that were waiting for
|
|
|
|
* more characters. Clients should call this method as the last
|
|
|
|
* call after a sequence of one or more calls to
|
2000-01-18 18:27:27 +00:00
|
|
|
* <code>transliterate()</code>.
|
1999-12-28 23:57:50 +00:00
|
|
|
* @param text the buffer holding transliterated and
|
|
|
|
* untransliterated text.
|
|
|
|
* @param index the array of indices previously passed to {@link
|
2000-01-18 18:27:27 +00:00
|
|
|
* #transliterate}
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2000-01-18 18:27:27 +00:00
|
|
|
virtual void finishTransliteration(Replaceable& text,
|
2000-06-27 19:00:38 +00:00
|
|
|
UTransPosition& index) const;
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
/**
|
2000-01-18 18:27:27 +00:00
|
|
|
* This internal method does incremental transliteration. If the
|
1999-12-28 23:57:50 +00:00
|
|
|
* 'insertion' is non-null then we append it to 'text' before
|
|
|
|
* proceeding. This method calls through to the pure virtual
|
2000-01-18 18:27:27 +00:00
|
|
|
* framework method handleTransliterate() to do the actual
|
1999-12-28 23:57:50 +00:00
|
|
|
* work.
|
|
|
|
*/
|
2000-01-18 18:27:27 +00:00
|
|
|
void _transliterate(Replaceable& text,
|
2000-06-27 19:00:38 +00:00
|
|
|
UTransPosition& index,
|
2000-01-18 18:27:27 +00:00
|
|
|
const UnicodeString* insertion,
|
|
|
|
UErrorCode &status) const;
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
protected:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Abstract method that concrete subclasses define to implement
|
|
|
|
* keyboard transliteration. This method should transliterate all
|
2000-01-19 19:02:10 +00:00
|
|
|
* characters between <code>index.cursor</code> and
|
|
|
|
* <code>index.limit</code> that can be unambiguously
|
1999-12-28 23:57:50 +00:00
|
|
|
* transliterated, regardless of future insertions of text at
|
2000-01-19 19:02:10 +00:00
|
|
|
* <code>index.limit</code>. <code>index.cursor</code> should
|
1999-12-28 23:57:50 +00:00
|
|
|
* be advanced past committed characters (those that will not
|
|
|
|
* change in future calls to this method).
|
2000-01-19 19:02:10 +00:00
|
|
|
* <code>index.limit</code> should be updated to reflect text
|
1999-12-28 23:57:50 +00:00
|
|
|
* replacements that shorten or lengthen the text between
|
2000-01-19 19:02:10 +00:00
|
|
|
* <code>index.cursor</code> and <code>index.limit</code>. Upon
|
|
|
|
* return, neither <code>index.cursor</code> nor
|
|
|
|
* <code>index.limit</code> should be less than the initial value
|
|
|
|
* of <code>index.cursor</code>. <code>index.start</code>
|
1999-12-28 23:57:50 +00:00
|
|
|
* should <em>not</em> be changed.
|
|
|
|
*
|
2001-07-17 23:36:41 +00:00
|
|
|
* <p>Subclasses may safely assume that all characters in
|
|
|
|
* [index.start, index.limit) are unfiltered. In other words, the
|
|
|
|
* filter has already been applied by the time this method is
|
|
|
|
* called. See filteredTransliterate().
|
|
|
|
*
|
|
|
|
* <p>This method is <b>not</b> for public consumption. Calling
|
|
|
|
* this method directly will transliterate [index.start,
|
|
|
|
* index.limit) without applying the filter. End user code that
|
|
|
|
* wants to call this method should be calling transliterate().
|
|
|
|
* Subclass code that wants to call this method should probably be
|
|
|
|
* calling filteredTransliterate().
|
|
|
|
*
|
1999-12-28 23:57:50 +00:00
|
|
|
* @param text the buffer holding transliterated and
|
|
|
|
* untransliterated text
|
|
|
|
* @param index an array of three integers. See {@link
|
2000-01-18 18:27:27 +00:00
|
|
|
* #transliterate(Replaceable, int[], String)}.
|
|
|
|
* @see #transliterate
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2000-01-18 18:27:27 +00:00
|
|
|
virtual void handleTransliterate(Replaceable& text,
|
2000-06-27 19:00:38 +00:00
|
|
|
UTransPosition& index,
|
2000-05-18 22:08:39 +00:00
|
|
|
UBool incremental) const = 0;
|
1999-12-28 23:57:50 +00:00
|
|
|
|
2001-07-17 23:36:41 +00:00
|
|
|
/**
|
|
|
|
* Core transliteration method called by all other methods in
|
|
|
|
* Tranliterator. This method splits up the input text into
|
|
|
|
* segments of unfiltered text and passes those to
|
|
|
|
* handleTransliterate(). For most subclasses this is convenient
|
|
|
|
* and efficient. Subclasses that can more efficiently handle the
|
|
|
|
* filter logic on their own (rare) can override
|
|
|
|
* filteredTransliterate(). Such subclasses must still implement
|
|
|
|
* handleTransliterate() but they can do so with an empty body,
|
|
|
|
* since filteredTransliterate() is the only method that calls
|
|
|
|
* handleTransliterate().
|
|
|
|
*/
|
|
|
|
virtual void filteredTransliterate(Replaceable& text,
|
|
|
|
UTransPosition& index,
|
|
|
|
UBool incremental) const;
|
1999-12-28 23:57:50 +00:00
|
|
|
|
2001-07-17 23:55:42 +00:00
|
|
|
friend class CompoundTransliterator; // for filteredTransliterate
|
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
public:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns the length of the longest context required by this transliterator.
|
|
|
|
* This is <em>preceding</em> context. The default implementation supplied
|
|
|
|
* by <code>Transliterator</code> returns zero; subclasses
|
|
|
|
* that use preceding context should override this method to return the
|
|
|
|
* correct value. For example, if a transliterator translates "ddd" (where
|
|
|
|
* d is any digit) to "555" when preceded by "(ddd)", then the preceding
|
|
|
|
* context length is 5, the length of "(ddd)".
|
|
|
|
*
|
|
|
|
* @return The maximum number of preceding context characters this
|
|
|
|
* transliterator needs to examine
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2000-01-18 18:27:27 +00:00
|
|
|
int32_t getMaximumContextLength(void) const;
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Method for subclasses to use to set the maximum context length.
|
|
|
|
* @see #getMaximumContextLength
|
|
|
|
*/
|
|
|
|
void setMaximumContextLength(int32_t maxContextLength);
|
|
|
|
|
|
|
|
public:
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns a programmatic identifier for this transliterator.
|
|
|
|
* If this identifier is passed to <code>getInstance()</code>, it
|
|
|
|
* will return this object, if it has been registered.
|
|
|
|
* @see #registerInstance
|
|
|
|
* @see #registerClass
|
|
|
|
* @see #getAvailableIDs
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
|
|
|
virtual const UnicodeString& getID(void) const;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns a name for this transliterator that is appropriate for
|
|
|
|
* display to the user in the default locale. See {@link
|
|
|
|
* #getDisplayName(Locale)} for details.
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2000-01-11 19:39:06 +00:00
|
|
|
static UnicodeString& getDisplayName(const UnicodeString& ID,
|
|
|
|
UnicodeString& result);
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns a name for this transliterator that is appropriate for
|
|
|
|
* display to the user in the given locale. This name is taken
|
|
|
|
* from the locale resource data in the standard manner of the
|
|
|
|
* <code>java.text</code> package.
|
|
|
|
*
|
|
|
|
* <p>If no localized names exist in the system resource bundles,
|
|
|
|
* a name is synthesized using a localized
|
|
|
|
* <code>MessageFormat</code> pattern from the resource data. The
|
|
|
|
* arguments to this pattern are an integer followed by one or two
|
|
|
|
* strings. The integer is the number of strings, either 1 or 2.
|
|
|
|
* The strings are formed by splitting the ID for this
|
|
|
|
* transliterator at the first '-'. If there is no '-', then the
|
|
|
|
* entire ID forms the only string.
|
|
|
|
* @param inLocale the Locale in which the display name should be
|
|
|
|
* localized.
|
|
|
|
* @see java.text.MessageFormat
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2000-01-11 19:39:06 +00:00
|
|
|
static UnicodeString& getDisplayName(const UnicodeString& ID,
|
|
|
|
const Locale& inLocale,
|
|
|
|
UnicodeString& result);
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/**
|
2000-02-05 00:24:24 +00:00
|
|
|
* Returns the filter used by this transliterator, or <tt>NULL</tt>
|
1999-12-28 23:57:50 +00:00
|
|
|
* if this transliterator uses no filter.
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2001-07-17 23:36:41 +00:00
|
|
|
const UnicodeFilter* getFilter(void) const;
|
1999-12-28 23:57:50 +00:00
|
|
|
|
2000-02-05 00:24:24 +00:00
|
|
|
/**
|
|
|
|
* Returns the filter used by this transliterator, or <tt>NULL</tt> if this
|
|
|
|
* transliterator uses no filter. The caller must eventually delete the
|
|
|
|
* result. After this call, this transliterator's filter is set to
|
|
|
|
* <tt>NULL</tt>. Calls adoptFilter().
|
|
|
|
*/
|
|
|
|
UnicodeFilter* orphanFilter(void);
|
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
/**
|
|
|
|
* Changes the filter used by this transliterator. If the filter
|
|
|
|
* is set to <tt>null</tt> then no filtering will occur.
|
|
|
|
*
|
|
|
|
* <p>Callers must take care if a transliterator is in use by
|
|
|
|
* multiple threads. The filter should not be changed by one
|
|
|
|
* thread while another thread may be transliterating.
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
|
|
|
virtual void adoptFilter(UnicodeFilter* adoptedFilter);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns this transliterator's inverse. See the class
|
|
|
|
* documentation for details. This implementation simply inverts
|
|
|
|
* the two entities in the ID and attempts to retrieve the
|
|
|
|
* resulting transliterator. That is, if <code>getID()</code>
|
|
|
|
* returns "A-B", then this method will return the result of
|
|
|
|
* <code>getInstance("B-A")</code>, or <code>null</code> if that
|
|
|
|
* call fails.
|
|
|
|
*
|
|
|
|
* <p>This method does not take filtering into account. The
|
|
|
|
* returned transliterator will have no filter.
|
|
|
|
*
|
|
|
|
* <p>Subclasses with knowledge of their inverse may wish to
|
|
|
|
* override this method.
|
|
|
|
*
|
|
|
|
* @return a transliterator that is an inverse, not necessarily
|
|
|
|
* exact, of this transliterator, or <code>null</code> if no such
|
|
|
|
* transliterator is registered.
|
|
|
|
* @see #registerInstance
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2001-08-31 03:23:39 +00:00
|
|
|
Transliterator* createInverse(UErrorCode& status) const;
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns a <code>Transliterator</code> object given its ID.
|
|
|
|
* The ID must be either a system transliterator ID or a ID registered
|
|
|
|
* using <code>registerInstance()</code>.
|
|
|
|
*
|
|
|
|
* @param ID a valid ID, as enumerated by <code>getAvailableIDs()</code>
|
|
|
|
* @return A <code>Transliterator</code> object with the given ID
|
|
|
|
* @exception IllegalArgumentException if the given ID is invalid.
|
|
|
|
* @see #registerInstance
|
|
|
|
* @see #getAvailableIDs
|
|
|
|
* @see #getID
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2000-01-14 21:15:25 +00:00
|
|
|
static Transliterator* createInstance(const UnicodeString& ID,
|
2001-08-31 03:23:39 +00:00
|
|
|
UTransDirection dir,
|
|
|
|
UParseError& parseError,
|
|
|
|
UErrorCode& status);
|
1999-12-28 23:57:50 +00:00
|
|
|
|
2001-08-31 03:23:39 +00:00
|
|
|
static Transliterator* createInstance(const UnicodeString& ID,
|
|
|
|
UTransDirection dir,
|
|
|
|
UErrorCode& status);
|
2001-07-13 21:17:11 +00:00
|
|
|
/**
|
|
|
|
* Returns a <code>Transliterator</code> object constructed from
|
|
|
|
* the given rule string. This will be a RuleBasedTransliterator,
|
|
|
|
* if the rule string contains only rules, or a
|
|
|
|
* CompoundTransliterator, if it contains ID blocks, or a
|
|
|
|
* NullTransliterator, if it contains ID blocks which parse as
|
|
|
|
* empty for the given direction.
|
|
|
|
*/
|
|
|
|
static Transliterator* createFromRules(const UnicodeString& ID,
|
|
|
|
const UnicodeString& rules,
|
2001-08-31 03:23:39 +00:00
|
|
|
UTransDirection dir,
|
|
|
|
UParseError& parseError,
|
|
|
|
UErrorCode& status);
|
2001-07-13 21:17:11 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Create a rule string that can be passed to createFromRules()
|
|
|
|
* to recreate this transliterator.
|
|
|
|
* @param result the string to receive the rules. Previous
|
|
|
|
* contents will be deleted.
|
|
|
|
* @param escapeUnprintable if TRUE then convert unprintable
|
|
|
|
* character to their hex escape representations, \uxxxx or
|
|
|
|
* \Uxxxxxxxx. Unprintable characters are those other than
|
|
|
|
* U+000A, U+0020..U+007E.
|
|
|
|
*/
|
|
|
|
virtual UnicodeString& toRules(UnicodeString& result,
|
|
|
|
UBool escapeUnprintable) const;
|
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
public:
|
|
|
|
|
2001-07-03 20:01:56 +00:00
|
|
|
/**
|
|
|
|
* Registers a factory function that creates transliterators of
|
|
|
|
* a given ID.
|
|
|
|
* @param id the ID being registered
|
|
|
|
* @param factory a function pointer that will be copied and
|
|
|
|
* called later when the given ID is passed to createInstance()
|
|
|
|
*/
|
|
|
|
static void registerFactory(const UnicodeString& id,
|
2001-08-15 19:06:40 +00:00
|
|
|
Factory factory);
|
2001-07-03 20:01:56 +00:00
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
/**
|
|
|
|
* Registers a instance <tt>obj</tt> of a subclass of
|
|
|
|
* <code>Transliterator</code> with the system. When
|
|
|
|
* <tt>createInstance()</tt> is called with an ID string that is
|
|
|
|
* equal to <tt>obj->getID()</tt>, then <tt>obj->clone()</tt> is
|
|
|
|
* returned.
|
|
|
|
*
|
|
|
|
* After this call the Transliterator class owns the adoptedObj
|
|
|
|
* and will delete it.
|
|
|
|
*
|
|
|
|
* @param obj an instance of subclass of
|
|
|
|
* <code>Transliterator</code> that defines <tt>clone()</tt>
|
|
|
|
* @see #getInstance
|
|
|
|
* @see #registerClass
|
|
|
|
* @see #unregister
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
2001-08-15 19:06:40 +00:00
|
|
|
static void registerInstance(Transliterator* adoptedObj);
|
1999-12-28 23:57:50 +00:00
|
|
|
|
|
|
|
private:
|
|
|
|
|
2001-07-03 23:44:59 +00:00
|
|
|
friend class NormalizationTransliterator;
|
|
|
|
|
2001-08-15 19:06:40 +00:00
|
|
|
static void _registerFactory(const UnicodeString& id,
|
|
|
|
Factory factory);
|
2001-08-01 17:37:08 +00:00
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
public:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Unregisters a transliterator or class. This may be either
|
|
|
|
* a system transliterator or a user transliterator or class.
|
2001-03-22 00:09:10 +00:00
|
|
|
*
|
1999-12-28 23:57:50 +00:00
|
|
|
* @param ID the ID of the transliterator or class
|
|
|
|
* @return the <code>Object</code> that was registered with
|
|
|
|
* <code>ID</code>, or <code>null</code> if none was
|
|
|
|
* @see #registerInstance
|
|
|
|
* @see #registerClass
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
|
|
|
static void unregister(const UnicodeString& ID);
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Return the number of IDs currently registered with the system.
|
|
|
|
* To retrieve the actual IDs, call getAvailableID(i) with
|
|
|
|
* i from 0 to countAvailableIDs() - 1.
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
|
|
|
static int32_t countAvailableIDs(void);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Return the index-th available ID. index must be between 0
|
|
|
|
* and countAvailableIDs() - 1, inclusive. If index is out of
|
|
|
|
* range, the result of getAvailableID(0) is returned.
|
2000-03-22 19:19:33 +00:00
|
|
|
* @draft
|
1999-12-28 23:57:50 +00:00
|
|
|
*/
|
|
|
|
static const UnicodeString& getAvailableID(int32_t index);
|
|
|
|
|
2001-08-01 17:37:08 +00:00
|
|
|
/**
|
|
|
|
* Return the number of registered source specifiers.
|
|
|
|
*/
|
|
|
|
static int32_t countAvailableSources(void);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Return a registered source specifier.
|
|
|
|
* @param index which specifier to return, from 0 to n-1, where
|
|
|
|
* n = countAvailableSources()
|
|
|
|
* @param result fill-in paramter to receive the source specifier.
|
|
|
|
* If index is out of range, result will be empty.
|
|
|
|
* @return reference to result
|
|
|
|
*/
|
|
|
|
static UnicodeString& getAvailableSource(int32_t index,
|
|
|
|
UnicodeString& result);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Return the number of registered target specifiers for a given
|
|
|
|
* source specifier.
|
|
|
|
*/
|
|
|
|
static int32_t countAvailableTargets(const UnicodeString& source);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Return a registered target specifier for a given source.
|
|
|
|
* @param index which specifier to return, from 0 to n-1, where
|
|
|
|
* n = countAvailableTargets(source)
|
|
|
|
* @param source the source specifier
|
|
|
|
* @param result fill-in paramter to receive the target specifier.
|
|
|
|
* If source is invalid or if index is out of range, result will
|
|
|
|
* be empty.
|
|
|
|
* @return reference to result
|
|
|
|
*/
|
|
|
|
static UnicodeString& getAvailableTarget(int32_t index,
|
|
|
|
const UnicodeString& source,
|
|
|
|
UnicodeString& result);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Return the number of registered variant specifiers for a given
|
|
|
|
* source-target pair.
|
|
|
|
*/
|
|
|
|
static int32_t countAvailableVariants(const UnicodeString& source,
|
|
|
|
const UnicodeString& target);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Return a registered variant specifier for a given source-target
|
|
|
|
* pair.
|
|
|
|
* @param index which specifier to return, from 0 to n-1, where
|
|
|
|
* n = countAvailableVariants(source, target)
|
|
|
|
* @param source the source specifier
|
|
|
|
* @param target the target specifier
|
|
|
|
* @param result fill-in paramter to receive the variant
|
|
|
|
* specifier. If source is invalid or if target is invalid or if
|
|
|
|
* index is out of range, result will be empty.
|
|
|
|
* @return reference to result
|
|
|
|
*/
|
|
|
|
static UnicodeString& getAvailableVariant(int32_t index,
|
|
|
|
const UnicodeString& source,
|
|
|
|
const UnicodeString& target,
|
|
|
|
UnicodeString& result);
|
|
|
|
|
2001-06-12 17:10:10 +00:00
|
|
|
/**
|
|
|
|
* Return the class ID for this class. This is useful only for
|
|
|
|
* comparing to a return value from getDynamicClassID(). For example:
|
|
|
|
* <pre>
|
|
|
|
* . Base* polymorphic_pointer = createPolymorphicObject();
|
|
|
|
* . if (polymorphic_pointer->getDynamicClassID() ==
|
|
|
|
* . Derived::getStaticClassID()) ...
|
|
|
|
* </pre>
|
|
|
|
* @return The class ID for all objects of this class.
|
|
|
|
* @stable
|
|
|
|
*/
|
|
|
|
static UClassID getStaticClassID(void) { return (UClassID)&fgClassID; }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Returns a unique class ID <b>polymorphically</b>. This method
|
|
|
|
* is to implement a simple version of RTTI, since not all C++
|
|
|
|
* compilers support genuine RTTI. Polymorphic operator==() and
|
|
|
|
* clone() methods call this method.
|
|
|
|
*
|
|
|
|
* <p>Concrete subclasses of Transliterator that wish clients to
|
|
|
|
* be able to identify them should implement getDynamicClassID()
|
|
|
|
* and also a static method and data member:
|
|
|
|
*
|
|
|
|
* <pre>
|
|
|
|
* static UClassID getStaticClassID() { return (UClassID)&fgClassID; }
|
|
|
|
* static char fgClassID;
|
|
|
|
* </pre>
|
|
|
|
*
|
|
|
|
* Subclasses that do not implement this method will have a
|
|
|
|
* dynamic class ID of Transliterator::getStatisClassID().
|
|
|
|
*
|
|
|
|
* @return The class ID for this object. All objects of a given
|
|
|
|
* class have the same class ID. Objects of other classes have
|
|
|
|
* different class IDs.
|
|
|
|
*/
|
|
|
|
virtual UClassID getDynamicClassID(void) const { return getStaticClassID(); };
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Class identifier for subclasses of Transliterator that do not
|
|
|
|
* define their class (anonymous subclasses).
|
|
|
|
*/
|
|
|
|
static char fgClassID;
|
|
|
|
|
2000-01-18 18:27:27 +00:00
|
|
|
protected:
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Method for subclasses to use to obtain a character in the given
|
2000-08-31 17:12:45 +00:00
|
|
|
* string, with filtering. If the character at the given offset
|
|
|
|
* is excluded by this transliterator's filter, then U+FFFE is returned.
|
2001-07-31 22:43:47 +00:00
|
|
|
* @deprecated the new architecture provides filtering at the top
|
|
|
|
* level. This method will be removed Dec 31 2001.
|
2000-01-18 18:27:27 +00:00
|
|
|
*/
|
|
|
|
UChar filteredCharAt(const Replaceable& text, int32_t i) const;
|
|
|
|
|
2000-03-31 00:32:00 +00:00
|
|
|
/**
|
|
|
|
* Set the ID of this transliterators. Subclasses shouldn't do
|
|
|
|
* this, unless the underlying script behavior has changed.
|
|
|
|
*/
|
|
|
|
void setID(const UnicodeString& id);
|
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
private:
|
2001-08-15 19:06:40 +00:00
|
|
|
static void initializeRegistry(void);
|
1999-12-28 23:57:50 +00:00
|
|
|
};
|
|
|
|
|
2000-01-18 18:27:27 +00:00
|
|
|
inline int32_t Transliterator::getMaximumContextLength(void) const {
|
|
|
|
return maximumContextLength;
|
|
|
|
}
|
|
|
|
|
2000-03-31 00:32:00 +00:00
|
|
|
inline void Transliterator::setID(const UnicodeString& id) {
|
|
|
|
ID = id;
|
|
|
|
}
|
|
|
|
|
1999-12-28 23:57:50 +00:00
|
|
|
#endif
|