001: /*
002: * $Id: RomanAlphabetFactory.java 2685 2007-04-16 12:09:48Z blowagie $
003: * $Name$
004: *
005: * Copyright 2007 by Bruno Lowagie.
006: *
007: * The contents of this file are subject to the Mozilla Public License Version 1.1
008: * (the "License"); you may not use this file except in compliance with the License.
009: * You may obtain a copy of the License at http://www.mozilla.org/MPL/
010: *
011: * Software distributed under the License is distributed on an "AS IS" basis,
012: * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
013: * for the specific language governing rights and limitations under the License.
014: *
015: * The Original Code is 'iText, a free JAVA-PDF library'.
016: *
017: * The Initial Developer of the Original Code is Bruno Lowagie. Portions created by
018: * the Initial Developer are Copyright (C) 1999, 2000, 2001, 2002 by Bruno Lowagie.
019: * All Rights Reserved.
020: * Co-Developer of the code is Paulo Soares. Portions created by the Co-Developer
021: * are Copyright (C) 2000, 2001, 2002 by Paulo Soares. All Rights Reserved.
022: *
023: * Contributor(s): all the names of the contributors are added in the source code
024: * where applicable.
025: *
026: * Alternatively, the contents of this file may be used under the terms of the
027: * LGPL license (the "GNU LIBRARY GENERAL PUBLIC LICENSE"), in which case the
028: * provisions of LGPL are applicable instead of those above. If you wish to
029: * allow use of your version of this file only under the terms of the LGPL
030: * License and not to allow others to use your version of this file under
031: * the MPL, indicate your decision by deleting the provisions above and
032: * replace them with the notice and other provisions required by the LGPL.
033: * If you do not delete the provisions above, a recipient may use your version
034: * of this file under either the MPL or the GNU LIBRARY GENERAL PUBLIC LICENSE.
035: *
036: * This library is free software; you can redistribute it and/or modify it
037: * under the terms of the MPL as stated above or under the terms of the GNU
038: * Library General Public License as published by the Free Software Foundation;
039: * either version 2 of the License, or any later version.
040: *
041: * This library is distributed in the hope that it will be useful, but WITHOUT
042: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
043: * FOR A PARTICULAR PURPOSE. See the GNU Library general Public License for more
044: * details.
045: *
046: * If you didn't download this code from the following link, you should check if
047: * you aren't using an obsolete version:
048: * http://www.lowagie.com/iText/
049: */
050:
051: package com.lowagie.text.factories;
052:
053: /**
054: * This class can produce String combinations representing a number.
055: * "a" to "z" represent 1 to 26, "AA" represents 27, "AB" represents 28,
056: * and so on; "ZZ" is followed by "AAA".
057: */
058: public class RomanAlphabetFactory {
059:
060: /**
061: * Translates a positive integer (not equal to zero)
062: * into a String using the letters 'a' to 'z';
063: * 1 = a, 2 = b, ..., 26 = z, 27 = aa, 28 = ab,...
064: */
065: public static final String getString(int index) {
066: if (index < 1)
067: throw new NumberFormatException(
068: "You can't translate a negative number into an alphabetical value.");
069:
070: index--;
071: int bytes = 1;
072: int start = 0;
073: int symbols = 26;
074: while (index >= symbols + start) {
075: bytes++;
076: start += symbols;
077: symbols *= 26;
078: }
079:
080: int c = index - start;
081: char[] value = new char[bytes];
082: while (bytes > 0) {
083: value[--bytes] = (char) ('a' + (c % 26));
084: c /= 26;
085: }
086:
087: return new String(value);
088: }
089:
090: /**
091: * Translates a positive integer (not equal to zero)
092: * into a String using the letters 'a' to 'z';
093: * 1 = a, 2 = b, ..., 26 = z, 27 = aa, 28 = ab,...
094: */
095: public static final String getLowerCaseString(int index) {
096: return getString(index);
097: }
098:
099: /**
100: * Translates a positive integer (not equal to zero)
101: * into a String using the letters 'A' to 'Z';
102: * 1 = A, 2 = B, ..., 26 = Z, 27 = AA, 28 = AB,...
103: */
104: public static final String getUpperCaseString(int index) {
105: return getString(index).toUpperCase();
106: }
107:
108: /**
109: * Translates a positive integer (not equal to zero)
110: * into a String using the letters 'a' to 'z'
111: * (a = 1, b = 2, ..., z = 26, aa = 27, ab = 28,...).
112: */
113: public static final String getString(int index, boolean lowercase) {
114: if (lowercase) {
115: return getLowerCaseString(index);
116: } else {
117: return getUpperCaseString(index);
118: }
119: }
120:
121: /**
122: * Test this class using this main method.
123: */
124: public static void main(String[] args) {
125: for (int i = 1; i < 32000; i++) {
126: System.out.println(getString(i));
127: }
128: }
129: }
|