A LegalTshegBar is a simple Tibetan syllable or a syllable with * syntactically legal {@link #getPossibleSuffixParticles() suffix * particles}. A legal tsheg-bar is not a transliteration of Chinese * or some other language. It obeys the following properties:
* *\u0F71)"\u0F60\u0F72").David, It is a particle that means "or" as opposed to "dang" that means and. "sgom pa'am" would mean "... or meditation" You can also have "'ang" which would be equivalent to "yang" (also) "sgom pa'ang" : even/also meditation. And also there are cases where they combine. For ex you can have "le'u'i'o". "le'u" means chapter. "le'u'i" means "of this chapter". 'o would mark the end of the sentence. Andres* * *
"\u0F60\u0F72") (DLC FIXME: 'o and
* 'am maybe? I asked in the "Embarrasing error in wylie conversion"
* bug report.).Note that this class uses only a subset of Unicode to represent * consonants and vowels. You should always use the nominal form of * a letter, e.g. {@link #EWC_wa}, not {@link #EWSUB_wa_zur}, to * represent letters. (What if you mean to subscribe a fixed-form * wa? Well, that's not a legal tsheg-bar, so you don't mean to do * that.)
* *For a pretty good, concise summary of the rules this class * knows about, see Joe B. Wilson's Translating Buddhism from * Tibetan from Snow Lion Publications, Appendix 1, * e.g. p. 548.
* * @author David Chandler */ public class LegalTshegBar extends TshegBar implements UnicodeConstants { /** the prefixed consonant or EW_ABSENT */ private char prefix; /** the consonant superscribed over the {@link #rootLetter} or * EW_ABSENT */ private char headLetter; /** the root consonant, never EW_ABSENT */ private char rootLetter; /** subscribed letter, or EW_ABSENT */ private char subjoinedLetter; /** true iff EWSUB_wa_zur is under the root syllable. */ private boolean hasWaZur; /** true iff EW_wa_zur is under the root syllable. */ private boolean hasAChung; /** If this is a string, it is of a single codepoint or is equal * to {@link #getConnectiveCaseSuffix()} */ private String suffix; /** EW_da, EW_sa, or EW_ABSENT */ private char postsuffix; /** EWV_i, EWV_u, EWV_e, EWV_o, or EW_ABSENT */ private char vowel; /** Do not use this constructor. */ private LegalTshegBar() { super(); } /** Constructs a valid Tibetan syllable or throws an exception. * Use EW_ABSENT (or null in the case ofsuffix) for
* those parts of the syllable that are absent. The root letter
* must not be absent. To learn about the arguments, and to be
* sure that your input won't cause an exception to be thrown,
* see {@link
* #formsLegalTshegBar(char,char,char,char,boolean,boolean,String,char,char)}.
*
* @exception IllegalArgumentException if the rootLetter is not
* one of the thirty consonants (and represented nominally, at
* that), or if one of the other arguments is not valid, or if
* postsuffix is present but suffix is absent, etc. */
public LegalTshegBar(char prefix, char headLetter, char rootLetter,
char subjoinedLetter,
boolean hasWaZur,
boolean hasAChung,
String suffix, char postsuffix, char vowel)
throws IllegalArgumentException
{
super();
throwIfNotLegalTshegBar(prefix, headLetter, rootLetter,
subjoinedLetter, hasWaZur, hasAChung,
suffix, postsuffix, vowel);
this.prefix = prefix;
this.headLetter = headLetter;
this.rootLetter = rootLetter;
this.subjoinedLetter = subjoinedLetter;
this.hasWaZur = hasWaZur;
this.hasAChung = hasAChung;
// copying is slightly inefficient because it is unnecessary
// since Java strings are read-only, but translating this code
// to C++ is easier this way.
this.suffix = (suffix == null) ? null : new String(suffix);
this.postsuffix = postsuffix;
this.vowel = vowel;
}
/** Like {@link
* #LegalTshegBar(char,char,char,char,boolean,boolean,String,char,char)}
* but geared for the common case where the suffix is simply a
* consonant. */
public LegalTshegBar(char prefix, char headLetter, char rootLetter,
char subjoinedLetter,
boolean hasWaZur,
boolean hasAChung,
char suffix, char postsuffix, char vowel)
throws IllegalArgumentException
{
this(prefix, headLetter, rootLetter, subjoinedLetter,
hasWaZur, hasAChung,
(suffix == EW_ABSENT) ? null : new String(new char[] { suffix }),
postsuffix, vowel);
}
/** Returns the prefixed consonant, or EW_ABSENT if there is no
* prefix. */
public char getPrefix() {
return prefix;
}
/** Returns true iff this syllable contains a prefixed
* consonant. */
public boolean hasPrefix() {
return (EW_ABSENT != prefix);
}
/** Returns the non-EWSUB_wa_zur consonant subscribed to the root
* consonant, or EW_ABSENT if none is. If you want to know if
* there is a wa-zur, use {@link
* #hasWaZurSubjoinedToRootLetter()}. This returns EWC_ra, not
* EWSUB_ra_btags, etc. */
public char getSubjoinedLetter() {
return subjoinedLetter;
}
/** Returns true iff the root letter possesses a subscribed
* consonant ya-btags, ra-btags, la-btags, or wa-zur. */
public boolean hasSubjoinedLetter() {
return (EW_ABSENT != subjoinedLetter);
}
public boolean hasWaZurSubjoinedToRootLetter() {
return hasWaZur;
}
public boolean hasAChungOnRootLetter() {
return hasAChung;
}
/** Returns null if there is no suffix, or a string containing the
* one consonant or a string "\u0F60\u0F72"
* containing two codepoints in the special case that the suffix
* is that connective case marker {@link
* #getConnectiveCaseSuffix()}. */
public String getSuffix() {
return suffix;
}
/** Returns true iff there is a suffixed consonant or a suffixed
* 'i (DLC FIXME). */
public boolean hasSuffix() {
return (null != suffix);
}
/** Returns true iff there is a single, suffixed consonant. This
means that suffixes like 'am, 'i,
'u, and 'o are not present, but this
does not rule out the presence of a postsuffix. */
public boolean hasSimpleSuffix() {
return ((null != suffix) && (1 == suffix.length()));
}
/** If this syllable {@link #hasSimpleSuffix() has a simple
suffix}, this returns it.
@exception Exception if {@link #hasSimpleSuffix()} is not true */
public char getSimpleSuffix() throws Exception {
if (!hasSimpleSuffix())
throw new Exception("there isn't a simple suffix");
return getSuffix().charAt(0);
}
/** Returns the secondary suffix, which is either
* EWC_da or EWC_sa, or EW_ABSENT if
* there is no postsuffix. */
public char getPostsuffix() {
return postsuffix;
}
/** Returns true iff there is a secondary suffix EWC_da or
* EWC_sa. */
public boolean hasPostsuffix() {
return (EW_ABSENT != postsuffix);
}
/** Returns true iff this syllable has a 'i
* suffix. */
public boolean hasConnectiveCaseMarkerSuffix() {
return getSuffix().equals(getConnectiveCaseSuffix());
}
/** Returns the root consonant. */
public char getRootLetter() {
return rootLetter;
}
/** Returns the head letter of the root stack if it has one, or
* EW_ABSENT otherwise. */
public char getHeadLetter() {
return headLetter;
}
/** Returns true iff this syllable has a head letter. */
public boolean hasHeadLetter() {
return (EW_ABSENT != headLetter);
}
/** Returns the vowel, or EW_ABSENT if there is no {@link
* #hasExplicitVowel() explicit vowel} (the syllable has the
* built-in "ah" sound in this case). */
public char getVowel() {
// DLC assert this is one of { EWV_i, EWV_u, EWV_e, EWV_o }
return vowel;
}
/** Returns false iff the implicit, built-in "ah" sound is the
only vowel for the root stack. */
public boolean hasExplicitVowel() {
return (EW_ABSENT != vowel);
}
/** Returns a string of two codepoints, da and sa. */
public static String getPossiblePostsuffixes() {
return new String(new char[] { EWC_da, EWC_sa });
}
private final static String possibleSuffixes
= new String(new char[] {
EWC_ga, EWC_nga, EWC_da, EWC_na, EWC_ba, EWC_ma, EWC_achen,
EWC_ra, EWC_la, EWC_sa
});
/** Returns a string of ten codepoints, each of which can be a
* suffix in Tibetan. */
public static String getPossibleSuffixes() {
return possibleSuffixes;
// DLC unit test that each EWC is a nominal form of a consonant
// you could use either \u0F62 or \u0F6A, but we won't confuse
// this ra for a ra-mgo, so we use \u0F62, EWC_ra, not
// EWSUB_ra_btags.
}
private final static String connectiveCaseSuffix
= new String(new char[] {
EWC_achen, EWV_i
});
/** Returns a two-codepoint string consisting of the Unicode
* representation of what THDL Extended Wylie calls
* 'i. */
public static String getConnectiveCaseSuffix() {
return connectiveCaseSuffix;
}
private final static String thirtyConsonants
= new String(new char[] {
EWC_ga, EWC_kha, EWC_ga, EWC_nga,
EWC_ca, EWC_cha, EWC_ja, EWC_nya,
EWC_ta, EWC_tha, EWC_da, EWC_na,
EWC_pa, EWC_pha, EWC_ba, EWC_ma,
EWC_tsa, EWC_tsha, EWC_dza, EWC_wa,
EWC_zha, EWC_za, EWC_achen, EWC_ya,
EWC_ra, EWC_la, EWC_sha, EWC_sa,
EWC_ha, EWC_a
});
/** Returns a String containing the nominal Unicode
* representations of the thirty consonants. The consonants are
* in the usual order you find them in the 8 row by 4 column
* table that students of the language memorize.
* @see org.thdl.tib.text.tshegbar.UnicodeConstants */
public static String getTheThirtyConsonants() {
ThdlDebug.verify(thirtyConsonants.length() == 30); // DLC put this into a JUnit test to avoid the slow-down.
return thirtyConsonants;
}
/** Returns true iff x is the preferred, nominal Unicode
* representation of one the thirty consonants. */
public static boolean isNominalRepresentationOfConsonant(char x) {
return (-1 != getTheThirtyConsonants().indexOf(x));
}
/** Returns an array of Unicode strings, all the legal suffix
particles. In THDL Extended Wylie, these are: This is not very efficient.
*/ public static String[] getPossibleSuffixParticles() { return new String[] { new String(new char[] { EWC_achen, EWV_i }), new String(new char[] { EWC_achen, EWV_o }), new String(new char[] { EWC_achen, EWV_u }), new String(new char[] { EWC_achen, EWC_ma }), }; } /** Returns a String containing the nominal Unicode * representations of the five prefixes. The prefixes are in * dictionary order. * @see org.thdl.tib.text.tshegbar.UnicodeConstants */ public static String getTheFivePrefixes() { final String s = new String(new char[] { EWC_ga, EWC_da, EWC_ba, EWC_ma, EWC_achen }); ThdlDebug.verify(s.length() == 5); // DLC put this into a JUnit test to avoid the slow-down. return s; } /** Returns true iff x is the preferred, nominal Unicode * representation of one of the five prefixes. */ public static boolean isNominalRepresentationOfPrefix(char x) { return (-1 != getTheFivePrefixes().indexOf(x)); } /** Returns a String containing the nominal Unicode * representations of the ten suffixes. The suffixes are in * dictionary order. * @see #getConnectiveCaseSuffix() * @see org.thdl.tib.text.tshegbar.UnicodeConstants */ public static String getTheTenSuffixes() { final String s = new String(new char[] { EWC_ga, EWC_nga, EWC_da, EWC_na, EWC_ba, EWC_ma, EWC_achen, EWC_ra, EWC_la, EWC_sa }); ThdlDebug.verify(s.length() == 10); // DLC put this into a JUnit test to avoid the slow-down. return s; } /** Returns true iff x is the preferred, nominal Unicode * representation of one of the ten suffixes. * @see #getConnectiveCaseSuffix() */ public static boolean isNominalRepresentationOfSimpleSuffix(char x) { return (-1 != getTheTenSuffixes().indexOf(x)); } /** Returns true iff the given (rootLetter, subjoinedLetter) combination can accept an additional wa-zur. Only g-r-w, d-r-w, and ph-y-w fall into this category according to tibwn.ini. (DLC FIXME: are these all legal? are any others?) @param rootLetter the root consonant (in {@link UnicodeUtils#isPreferredFormOfConsonant(char) preferred form} in you expect true to be returned) @param subjoinedLetter the letter subscribed to rootLetter, which should not {@link UnicodeUtils#isWa(char) be wa} if you expect true to be returned @return true iff (rootLetter, subjoinedLetter, wa-zur) is a legal stack. */ public static boolean takesWaZur(char rootLetter, char subjoinedLetter) { // DLC NOW use this test if (EW_ABSENT == subjoinedLetter) { return isConsonantThatTakesWaZur(rootLetter); } if (EWC_ra == subjoinedLetter) { if (EWC_ga == rootLetter || EWC_da == rootLetter) return true; } else if (EWC_ya == subjoinedLetter) { if (EWC_pha == rootLetter) return true; } return false; } /** Returns true iff rootLetter is a consonant to which wa-zur can * be subjoined (perhaps in addition to another subjoined * ra-btags or ya-btags. */ public static boolean isConsonantThatTakesWaZur(char rootLetter) { return !(EWC_ka != rootLetter && EWC_kha != rootLetter && EWC_ga != rootLetter && EWC_nya != rootLetter && EWC_da != rootLetter && EWC_tsa != rootLetter && EWC_tsha != rootLetter && EWC_zha != rootLetter && EWC_za != rootLetter && EWC_ra != rootLetter && EWC_la != rootLetter && EWC_sha != rootLetter && EWC_pha != rootLetter /* ph-y-w is legal. */ && EWC_ha != rootLetter); } /** Returns true iff rootLetter is a consonant to which ya-btags * can be subjoined. */ public static boolean isConsonantThatTakesYaBtags(char rootLetter) { return !(EWC_ka != rootLetter && EWC_kha != rootLetter && EWC_ga != rootLetter && EWC_pa != rootLetter && EWC_pha != rootLetter && EWC_ba != rootLetter && EWC_ma != rootLetter && EWC_ha != rootLetter); } /** Returns true iff rootLetter is a consonant to which la-btags * can be subjoined. */ public static boolean isConsonantThatTakesLaBtags(char rootLetter) { return !(EWC_ka != rootLetter && EWC_ga != rootLetter && EWC_ba != rootLetter && EWC_ra != rootLetter && EWC_sa != rootLetter // this combination is pronounced as a // prenasaling, low-tone da in my opinion: && EWC_za != rootLetter); } /** Returns true iff rootLetter is a consonant to which ra-btags * can be subjoined. */ public static boolean isConsonantThatTakesRaBtags(char rootLetter) { return !(EWC_ka != rootLetter && EWC_kha != rootLetter && EWC_ga != rootLetter && EWC_ta != rootLetter && EWC_tha != rootLetter && EWC_da != rootLetter && EWC_na != rootLetter && EWC_pa != rootLetter && EWC_pha != rootLetter && EWC_ba != rootLetter && EWC_ma != rootLetter && EWC_sa != rootLetter && EWC_ha != rootLetter); } /** Returns true iff rootLetter is a consonant that takes a ra-mgo * (pronounced rango because ma is a prenasaling prefix) * head letter */ public static boolean isConsonantThatTakesRaMgo(char rootLetter) { return !(EWC_ka != rootLetter && EWC_ga != rootLetter && EWC_nga != rootLetter && EWC_ja != rootLetter && EWC_nya != rootLetter && EWC_ta != rootLetter && EWC_da != rootLetter && EWC_na != rootLetter && EWC_ba != rootLetter && EWC_ma != rootLetter && EWC_tsa != rootLetter && EWC_dza != rootLetter); } /** Returns true iff rootLetter is a consonant that takes a la-mgo * (pronounced lango because ma is a prenasaling prefix) * head letter */ public static boolean isConsonantThatTakesLaMgo(char rootLetter) { return !(EWC_ka != rootLetter && EWC_ga != rootLetter && EWC_nga != rootLetter && EWC_ca != rootLetter && EWC_ja != rootLetter && EWC_ta != rootLetter && EWC_da != rootLetter && EWC_pa != rootLetter && EWC_ba != rootLetter && EWC_ha != rootLetter); // pronunciation exception, btw } /** Returns true iff rootLetter is a consonant that takes a sa-mgo * (pronounced sango because ma is a prenasaling prefix) * head letter */ public static boolean isConsonantThatTakesSaMgo(char rootLetter) { return !(EWC_ka != rootLetter && EWC_ga != rootLetter && EWC_nga != rootLetter && EWC_nya != rootLetter && EWC_ta != rootLetter && EWC_da != rootLetter && EWC_na != rootLetter && EWC_pa != rootLetter && EWC_ba != rootLetter && EWC_ma != rootLetter && EWC_tsa != rootLetter); } /** Returns true iff the given arguments form a legal Tibetan * syllable. * * @param prefix the optional, prefixed consonant * @param headLetter the optional superscribed consonant * @param rootLetter the mandatory root consonant * @param subjoinedLetter the optional, subscribed consonant * @param suffix the optional suffix, which is null, a String * consisting of a single consonant (i.e. a single, * nondecomposable codepoint) except in the special case that * this is {@link #getConnectiveCaseSuffix()} * @param postsuffix the optional postsuffix, which should be * EWC_sa or EWC_da * @param errorBuffer if non-null, and if the return code is * false, then the reason that this is not a legal tsheg-bar will * be appended to errorBuffer. * @param vowel the optional vowel */ public static boolean formsLegalTshegBar(char prefix, char headLetter, char rootLetter, char subjoinedLetter, boolean hasWaZur, boolean hasAChung, String suffix, char postsuffix, char vowel, StringBuffer errorBuffer) { try { return internalLegalityTest(prefix, headLetter, rootLetter, subjoinedLetter, hasWaZur, hasAChung, suffix, postsuffix, vowel, false, errorBuffer); } catch (IllegalArgumentException e) { throw new Error("This simply cannot happen, but it did."); } } /** Like {@link * #formsLegalTshegBar(char,char,char,char,boolean,boolean,String,char,char)} * but geared for the common case where the suffix is simply a * consonant. */ public static boolean formsLegalTshegBar(char prefix, char headLetter, char rootLetter, char subjoinedLetter, boolean hasWaZur, boolean hasAChung, char suffix, char postsuffix, char vowel, StringBuffer errorBuffer) { return formsLegalTshegBar(prefix, headLetter, rootLetter, subjoinedLetter, hasWaZur, hasAChung, ((suffix == EW_ABSENT) ? null : new String(new char[] { suffix })), postsuffix, vowel, errorBuffer); } /** If you get through this gauntlet without having an exception * thrown, then this combination makes a legal Tibetan syllable. * @exception IllegalArgumentException if the syllable does not * follow the rules of a Tibetan syllable. To learn about the * arguments, see {@link * #formsLegalTshegBar(char,char,char,char,boolean,boolean,String,char,char)}. */ private static void throwIfNotLegalTshegBar(char prefix, char headLetter, char rootLetter, char subjoinedLetter, boolean hasWaZur, boolean hasAChung, String suffix, char postsuffix, char vowel) throws IllegalArgumentException { internalLegalityTest(prefix, headLetter, rootLetter, subjoinedLetter, hasWaZur, hasAChung, suffix, postsuffix, vowel, true, null); } /** Voodoo. Stand back. */ private static boolean internalThrowThing(boolean doThrow, StringBuffer errorBuf, String msg) { if (errorBuf != null) { errorBuf.append(msg); } if (doThrow) throw new IllegalArgumentException(msg); return false; } /** If you get through this gauntlet without having an exception * thrown, then this combination makes a legal Tibetan syllable. * To learn about the arguments, see {@link * #formsLegalTshegBar(char,char,char,char,boolean,boolean,String,char,char)}. * @param errorBuf if non-null, the reason this is illegal will * be written here, if this is illegal * @return true if this syllable is legal, false if this syllable * is illegal and throwIfIllegal is false, does not return if * this syllable is illegal and throwIfIllegal is true * @exception IllegalArgumentException if the syllable does not * follow the rules of a Tibetan syllable and throwIfIllegal is * true */ private static boolean internalLegalityTest(char prefix, char headLetter, char rootLetter, char subjoinedLetter, boolean hasWaZur, boolean hasAChung, String suffix, char postsuffix, char vowel, boolean throwIfIllegal, StringBuffer errorBuf) throws IllegalArgumentException { if (!isNominalRepresentationOfConsonant(rootLetter)) return internalThrowThing(throwIfIllegal, errorBuf, "The root letter must be one of the standard thirty Tibetan consonants, and must be represented nominally, not, for example, by FIXED-FORM RA (\u0F6A)"); if (EW_ABSENT != prefix) { // Ensure that this prefix is one of the five prefixes, // and that it can go with this root letter: if (!isNominalRepresentationOfPrefix(prefix)) return internalThrowThing(throwIfIllegal, errorBuf, "The prefix is not absent, so it must be one of the five possible prefixes."); // DLC test that it can go with the root letter. } if (EW_ABSENT != subjoinedLetter) { if (EWC_ya == subjoinedLetter) { if (!isConsonantThatTakesYaBtags(rootLetter)) { return internalThrowThing(throwIfIllegal, errorBuf, "Cannot subscribe ya-btags to that root letter."); } } else if (EWC_ra == subjoinedLetter) { if (!isConsonantThatTakesRaBtags(rootLetter)) { return internalThrowThing(throwIfIllegal, errorBuf, "Cannot subscribe ra-btags to that root letter."); } } else if (EWC_la == subjoinedLetter) { if (!isConsonantThatTakesLaBtags(rootLetter)) { return internalThrowThing(throwIfIllegal, errorBuf, "Cannot subscribe la-btags to that root letter."); } } else if (EWC_wa == subjoinedLetter) { return internalThrowThing(throwIfIllegal, errorBuf, "The presence of wa-zur must be specified via a boolean parameter."); } else { // check for a common mistake: if ('\u0FBA' == subjoinedLetter || '\u0FBB' == subjoinedLetter || '\u0FBC' == subjoinedLetter) { return internalThrowThing(throwIfIllegal, errorBuf, "The subjoined letter given is subjoinable, but you gave the fixed-form variant, which is not used in Tibetan syllables but is sometimes used in Tibetan transliteration of Sanskrit, Chinese, or some non-Tibetan language."); } return internalThrowThing(throwIfIllegal, errorBuf, "The subjoined letter given is not one of the four consonants that may be subscribed."); } } // subjoinedLetter tests // Suffix tests: // DLC NOW -- allow 'o, 'u, 'am, etc. if (null != suffix) { if (!getConnectiveCaseSuffix().equals(suffix)) { if (suffix.length() != 1) { return internalThrowThing(throwIfIllegal, errorBuf, "Illegal suffix -- not one of the legal complex suffixes like 'u, 'o, 'i, 'am."); } if (!isNominalRepresentationOfSimpleSuffix(suffix.charAt(0))) { return internalThrowThing(throwIfIllegal, errorBuf, "Illegal suffix -- not one of the ten legal suffixes: " + UnicodeUtils.unicodeCodepointToString(suffix.charAt(0))); } } } if (EW_ABSENT != postsuffix) { if (null == suffix) return internalThrowThing(throwIfIllegal, errorBuf, "You cannot have a postsuffix unless you also have a suffix."); } if (EW_ABSENT != headLetter) { if (EWC_ra == headLetter) { if (!isConsonantThatTakesRaMgo(rootLetter)) { return internalThrowThing(throwIfIllegal, errorBuf, "The head letter ra cannot be used with that root letter."); } } else if (EWC_la == headLetter) { if (!isConsonantThatTakesLaMgo(rootLetter)) { return internalThrowThing(throwIfIllegal, errorBuf, "The head letter la cannot be used with that root letter."); } } else if (EWC_sa == headLetter) { if (!isConsonantThatTakesSaMgo(rootLetter)) { // handle a common error specially: if (EWC_la == rootLetter) return internalThrowThing(throwIfIllegal, errorBuf, "sa cannot be a head letter atop the root letter la. You probably meant to have sa the root letter and la the subjoined letter."); return internalThrowThing(throwIfIllegal, errorBuf, "The head letter sa cannot be used with that root letter."); } } else { // '\u0F6A' is not a valid head letter, even for // "rnya". Use EWC_ra instead. return internalThrowThing(throwIfIllegal, errorBuf, "The head letter given is not valid."); } } // headLetter tests // Now see if the vowel is valid: if (EW_ABSENT /* built-in "ah" sound */ != vowel) { if (EWV_i != vowel && EWV_u != vowel && EWV_e != vowel && EWV_o != vowel) { if (EWC_achen == vowel) return internalThrowThing(throwIfIllegal, errorBuf, "The vowel given is not valid. Use EW_ABSENT for the EWC_achen sound."); if ('\u0F71' == vowel) return internalThrowThing(throwIfIllegal, errorBuf, "a-chung cannot be used in a simple Tibetan syllable."); // DLC FIXME: what about pA? return internalThrowThing(throwIfIllegal, errorBuf, "The vowel given is not valid."); } } // Phew. We got here, so this combination of inputs is valid. // Do nothing to errorBuf. return true; } /* DLC add a method giving the correct connective case thingy or throwing error if the 'i suffix already appears. DLC put in a method that gets pronunciation using Unicode diacritical marks. And another using just US Roman. Note that pronunciation is contextual, so have these methods return all valid pronunciations, such as both "pa" and "wa" for EWC_ba. DLC would be nice in the appropriate class: boolean isTransliteratedSanskrit(), boolean isTransliteratedChinese() (design: contains fa or va, maybe?). */ /** Returns a StringBuffer that holds the THDL extended wylie * representation of this syllable. */ public StringBuffer getThdlWylie() { StringBuffer sb = new StringBuffer(); char rootLetter = getRootLetter(); if (hasPrefix()) { // if there is a prefix but no head letter and (prefix, // rootLetter) is ambiguous, i.e. if it could be mistaken // for a legal (rootLetter, subjoinedLetter) combination, // then put out prefix,disambiguator. else just put out // prefix. boolean disambiguatorNeeded = false; char prefix = getPrefix(); sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(prefix)); if (!hasHeadLetter()) { if (EWC_ya == rootLetter) { if (isConsonantThatTakesYaBtags(prefix)) disambiguatorNeeded = true; } else if (EWC_ra == rootLetter) { if (isConsonantThatTakesRaBtags(prefix)) disambiguatorNeeded = true; } else if (EWC_la == rootLetter) { if (isConsonantThatTakesLaBtags(prefix)) disambiguatorNeeded = true; } else if (EWC_wa == rootLetter) { if (isConsonantThatTakesWaZur(prefix)) disambiguatorNeeded = true; } } if (disambiguatorNeeded) sb.append(TibetanMachineWeb.WYLIE_DISAMBIGUATING_KEY); } if (hasHeadLetter()) sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(getHeadLetter())); sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(rootLetter)); if (hasSubjoinedLetter()) sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(getSubjoinedLetter())); if (hasWaZurSubjoinedToRootLetter()) sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(EWSUB_wa_zur)); // a-chung is treated, in THDL Extended Wylie, like a vowel. // I.e., you don't have 'pAa', you have 'pA'. if (hasAChungOnRootLetter()) { if (hasExplicitVowel()) { if (EWV_i == getVowel()) { sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint('\u0F73')); } else if (EWV_u == getVowel()) { sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint('\u0F75')); } else if (EWV_e == getVowel() || EWV_o == getVowel()) { // The exception to the rule for a-chung and vowels... // DLC FIXME: are these allowed in legal Tibetan? // EWTS would have special cases for them if so, // I'd wager... sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(EW_achung)); sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(getVowel())); } else { ThdlDebug.abort("only simple vowels occur in this class, how did this get past internalLegalityTest(..)?"); } } else { sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(EW_achung)); } } else { if (hasExplicitVowel()) sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(getVowel())); else sb.append("a"); } if (hasSuffix()) { String suf = getSuffix(); sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(suf.charAt(0))); if (suf.length() > 1) { // DLC assert, don't verify, that the length is two. // This could change if I learn of more suffix // particles. ThdlDebug.verify(2 == suf.length()); sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(suf.charAt(1))); } } if (hasPostsuffix()) sb.append(UnicodeCodepointToThdlWylie.getThdlWylieForUnicodeCodepoint(getPostsuffix())); return sb; } /** Returns a