com.lowagie.text.factories
Class RomanAlphabetFactory
public
class
RomanAlphabetFactory
extends Object
This class can produce String combinations representing a number.
"a" to "z" represent 1 to 26, "AA" represents 27, "AB" represents 28,
and so on; "ZZ" is followed by "AAA".
Method Summary |
static String | getLowerCaseString(int index)
Translates a positive integer (not equal to zero)
into a String using the letters 'a' to 'z';
1 = a, 2 = b, ..., 26 = z, 27 = aa, 28 = ab,... |
static String | getString(int index)
Translates a positive integer (not equal to zero)
into a String using the letters 'a' to 'z';
1 = a, 2 = b, ..., 26 = z, 27 = aa, 28 = ab,... |
static String | getString(int index, boolean lowercase)
Translates a positive integer (not equal to zero)
into a String using the letters 'a' to 'z'
(a = 1, b = 2, ..., z = 26, aa = 27, ab = 28,...). |
static String | getUpperCaseString(int index)
Translates a positive integer (not equal to zero)
into a String using the letters 'A' to 'Z';
1 = A, 2 = B, ..., 26 = Z, 27 = AA, 28 = AB,... |
static void | main(String[] args)
Test this class using this main method. |
public static final String getLowerCaseString(int index)
Translates a positive integer (not equal to zero)
into a String using the letters 'a' to 'z';
1 = a, 2 = b, ..., 26 = z, 27 = aa, 28 = ab,...
public static final String getString(int index)
Translates a positive integer (not equal to zero)
into a String using the letters 'a' to 'z';
1 = a, 2 = b, ..., 26 = z, 27 = aa, 28 = ab,...
public static final String getString(int index, boolean lowercase)
Translates a positive integer (not equal to zero)
into a String using the letters 'a' to 'z'
(a = 1, b = 2, ..., z = 26, aa = 27, ab = 28,...).
public static final String getUpperCaseString(int index)
Translates a positive integer (not equal to zero)
into a String using the letters 'A' to 'Z';
1 = A, 2 = B, ..., 26 = Z, 27 = AA, 28 = AB,...
public static void main(String[] args)
Test this class using this main method.