Save This Page
Home » iText-src-2.1.3 » com.lowagie » text » factories » [javadoc | source]
com.lowagie.text.factories
public class: RomanAlphabetFactory [javadoc | source]
java.lang.Object
   com.lowagie.text.factories.RomanAlphabetFactory
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 from com.lowagie.text.factories.RomanAlphabetFactory Summary:
getLowerCaseString,   getString,   getString,   getUpperCaseString,   main
Methods from java.lang.Object:
equals,   getClass,   hashCode,   notify,   notifyAll,   toString,   wait,   wait,   wait
Method from com.lowagie.text.factories.RomanAlphabetFactory Detail:
 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.