RomanAlphabetFactory.java

/*
 * $Id: RomanAlphabetFactory.java 4065 2009-09-16 23:09:11Z psoares33 $
 *
 * Copyright 2007 by Bruno Lowagie.
 *
 * The contents of this file are subject to the Mozilla Public License Version 1.1
 * (the "License"); you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at http://www.mozilla.org/MPL/
 *
 * Software distributed under the License is distributed on an "AS IS" basis,
 * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
 * for the specific language governing rights and limitations under the License.
 *
 * The Original Code is 'iText, a free JAVA-PDF library'.
 *
 * The Initial Developer of the Original Code is Bruno Lowagie. Portions created by
 * the Initial Developer are Copyright (C) 1999, 2000, 2001, 2002 by Bruno Lowagie.
 * All Rights Reserved.
 * Co-Developer of the code is Paulo Soares. Portions created by the Co-Developer
 * are Copyright (C) 2000, 2001, 2002 by Paulo Soares. All Rights Reserved.
 *
 * Contributor(s): all the names of the contributors are added in the source code
 * where applicable.
 *
 * Alternatively, the contents of this file may be used under the terms of the
 * LGPL license (the "GNU LIBRARY GENERAL PUBLIC LICENSE"), in which case the
 * provisions of LGPL are applicable instead of those above.  If you wish to
 * allow use of your version of this file only under the terms of the LGPL
 * License and not to allow others to use your version of this file under
 * the MPL, indicate your decision by deleting the provisions above and
 * replace them with the notice and other provisions required by the LGPL.
 * If you do not delete the provisions above, a recipient may use your version
 * of this file under either the MPL or the GNU LIBRARY GENERAL PUBLIC LICENSE.
 *
 * This library is free software; you can redistribute it and/or modify it
 * under the terms of the MPL as stated above or under the terms of the GNU
 * Library General Public License as published by the Free Software Foundation;
 * either version 2 of the License, or any later version.
 *
 * This library is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
 * FOR A PARTICULAR PURPOSE. See the GNU Library general Public License for more
 * details.
 *
 * If you didn't download this code from the following link, you should check if
 * you aren't using an obsolete version:
 * http://www.lowagie.com/iText/
 */

package com.lowagie.text.factories;

import com.lowagie.text.error_messages.MessageLocalization;

/**
 * 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".
 */
public class RomanAlphabetFactory {

    /**
     * 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) {
        if (index < 1) throw new NumberFormatException(MessageLocalization.getComposedMessage("you.can.t.translate.a.negative.number.into.an.alphabetical.value"));

        index--;
        int bytes = 1;
        int start = 0;
        int symbols = 26;
        while(index >= symbols + start) {
            bytes++;
            start += symbols;
            symbols *= 26;
        }

        int c = index - start;
        char[] value = new char[bytes];
        while(bytes > 0) {
            value[--bytes] = (char)( 'a' + (c % 26));
            c /= 26;
        }

        return new String(value);
    }

    /**
     * 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 getLowerCaseString(int index) {
        return getString(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 getUpperCaseString(int index) {
        return getString(index).toUpperCase();
    }


    /**
     * 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 getString(int index, boolean lowercase) {
        if (lowercase) {
            return getLowerCaseString(index);
        }
        else {
            return getUpperCaseString(index);
        }
    }
}


















Active mutators

INCREMENTS_MUTATOR
VOID_METHOD_CALL_MUTATOR
RETURN_VALS_MUTATOR
MATH_MUTATOR
NEGATE_CONDITIONALS_MUTATOR
INVERT_NEGS_MUTATOR
CONDITIONALS_BOUNDARY_MUTATOR

Tests examined

Report generated by PIT 1.4.2

1		/*
2		* $Id: RomanAlphabetFactory.java 4065 2009-09-16 23:09:11Z psoares33 $
3		*
4		* Copyright 2007 by Bruno Lowagie.
5		*
6		* The contents of this file are subject to the Mozilla Public License Version 1.1
7		* (the "License"); you may not use this file except in compliance with the License.
8		* You may obtain a copy of the License at http://www.mozilla.org/MPL/
9		*
10		* Software distributed under the License is distributed on an "AS IS" basis,
11		* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12		* for the specific language governing rights and limitations under the License.
13		*
14		* The Original Code is 'iText, a free JAVA-PDF library'.
15		*
16		* The Initial Developer of the Original Code is Bruno Lowagie. Portions created by
17		* the Initial Developer are Copyright (C) 1999, 2000, 2001, 2002 by Bruno Lowagie.
18		* All Rights Reserved.
19		* Co-Developer of the code is Paulo Soares. Portions created by the Co-Developer
20		* are Copyright (C) 2000, 2001, 2002 by Paulo Soares. All Rights Reserved.
21		*
22		* Contributor(s): all the names of the contributors are added in the source code
23		* where applicable.
24		*
25		* Alternatively, the contents of this file may be used under the terms of the
26		* LGPL license (the "GNU LIBRARY GENERAL PUBLIC LICENSE"), in which case the
27		* provisions of LGPL are applicable instead of those above. If you wish to
28		* allow use of your version of this file only under the terms of the LGPL
29		* License and not to allow others to use your version of this file under
30		* the MPL, indicate your decision by deleting the provisions above and
31		* replace them with the notice and other provisions required by the LGPL.
32		* If you do not delete the provisions above, a recipient may use your version
33		* of this file under either the MPL or the GNU LIBRARY GENERAL PUBLIC LICENSE.
34		*
35		* This library is free software; you can redistribute it and/or modify it
36		* under the terms of the MPL as stated above or under the terms of the GNU
37		* Library General Public License as published by the Free Software Foundation;
38		* either version 2 of the License, or any later version.
39		*
40		* This library is distributed in the hope that it will be useful, but WITHOUT
41		* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
42		* FOR A PARTICULAR PURPOSE. See the GNU Library general Public License for more
43		* details.
44		*
45		* If you didn't download this code from the following link, you should check if
46		* you aren't using an obsolete version:
47		* http://www.lowagie.com/iText/
48		*/
49
50		package com.lowagie.text.factories;
51
52		import com.lowagie.text.error_messages.MessageLocalization;
53
54		/**
55		* This class can produce String combinations representing a number.
56		* "a" to "z" represent 1 to 26, "AA" represents 27, "AB" represents 28,
57		* and so on; "ZZ" is followed by "AAA".
58		*/
59		public class RomanAlphabetFactory {
60
61		/**
62		* Translates a positive integer (not equal to zero)
63		* into a String using the letters 'a' to 'z';
64		* 1 = a, 2 = b, ..., 26 = z, 27 = aa, 28 = ab,...
65		*/
66		public static final String getString(int index) {
67	2 1. getString : changed conditional boundary → NO_COVERAGE 2. getString : negated conditional → NO_COVERAGE	if (index < 1) throw new NumberFormatException(MessageLocalization.getComposedMessage("you.can.t.translate.a.negative.number.into.an.alphabetical.value"));
68
69	1 1. getString : Changed increment from -1 to 1 → NO_COVERAGE	index--;
70		int bytes = 1;
71		int start = 0;
72		int symbols = 26;
73	3 1. getString : changed conditional boundary → NO_COVERAGE 2. getString : Replaced integer addition with subtraction → NO_COVERAGE 3. getString : negated conditional → NO_COVERAGE	while(index >= symbols + start) {
74	1 1. getString : Changed increment from 1 to -1 → NO_COVERAGE	bytes++;
75	1 1. getString : Replaced integer addition with subtraction → NO_COVERAGE	start += symbols;
76	1 1. getString : Replaced integer multiplication with division → NO_COVERAGE	symbols *= 26;
77		}
78
79	1 1. getString : Replaced integer subtraction with addition → NO_COVERAGE	int c = index - start;
80		char[] value = new char[bytes];
81	2 1. getString : changed conditional boundary → NO_COVERAGE 2. getString : negated conditional → NO_COVERAGE	while(bytes > 0) {
82	3 1. getString : Changed increment from -1 to 1 → NO_COVERAGE 2. getString : Replaced integer modulus with multiplication → NO_COVERAGE 3. getString : Replaced integer addition with subtraction → NO_COVERAGE	value[--bytes] = (char)( 'a' + (c % 26));
83	1 1. getString : Replaced integer division with multiplication → NO_COVERAGE	c /= 26;
84		}
85
86	1 1. getString : mutated return of Object value for com/lowagie/text/factories/RomanAlphabetFactory::getString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE	return new String(value);
87		}
88
89		/**
90		* Translates a positive integer (not equal to zero)
91		* into a String using the letters 'a' to 'z';
92		* 1 = a, 2 = b, ..., 26 = z, 27 = aa, 28 = ab,...
93		*/
94		public static final String getLowerCaseString(int index) {
95	1 1. getLowerCaseString : mutated return of Object value for com/lowagie/text/factories/RomanAlphabetFactory::getLowerCaseString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE	return getString(index);
96		}
97
98		/**
99		* Translates a positive integer (not equal to zero)
100		* into a String using the letters 'A' to 'Z';
101		* 1 = A, 2 = B, ..., 26 = Z, 27 = AA, 28 = AB,...
102		*/
103		public static final String getUpperCaseString(int index) {
104	1 1. getUpperCaseString : mutated return of Object value for com/lowagie/text/factories/RomanAlphabetFactory::getUpperCaseString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE	return getString(index).toUpperCase();
105		}
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	1 1. getString : negated conditional → NO_COVERAGE	if (lowercase) {
115	1 1. getString : mutated return of Object value for com/lowagie/text/factories/RomanAlphabetFactory::getString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE	return getLowerCaseString(index);
116		}
117		else {
118	1 1. getString : mutated return of Object value for com/lowagie/text/factories/RomanAlphabetFactory::getString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE	return getUpperCaseString(index);
119		}
120		}
121		}
		Mutations
67		1.1 Location : getString Killed by : none changed conditional boundary → NO_COVERAGE 2.2 Location : getString Killed by : none negated conditional → NO_COVERAGE
69		1.1 Location : getString Killed by : none Changed increment from -1 to 1 → NO_COVERAGE
73		1.1 Location : getString Killed by : none changed conditional boundary → NO_COVERAGE 2.2 Location : getString Killed by : none Replaced integer addition with subtraction → NO_COVERAGE 3.3 Location : getString Killed by : none negated conditional → NO_COVERAGE
74		1.1 Location : getString Killed by : none Changed increment from 1 to -1 → NO_COVERAGE
75		1.1 Location : getString Killed by : none Replaced integer addition with subtraction → NO_COVERAGE
76		1.1 Location : getString Killed by : none Replaced integer multiplication with division → NO_COVERAGE
79		1.1 Location : getString Killed by : none Replaced integer subtraction with addition → NO_COVERAGE
81		1.1 Location : getString Killed by : none changed conditional boundary → NO_COVERAGE 2.2 Location : getString Killed by : none negated conditional → NO_COVERAGE
82		1.1 Location : getString Killed by : none Changed increment from -1 to 1 → NO_COVERAGE 2.2 Location : getString Killed by : none Replaced integer modulus with multiplication → NO_COVERAGE 3.3 Location : getString Killed by : none Replaced integer addition with subtraction → NO_COVERAGE
83		1.1 Location : getString Killed by : none Replaced integer division with multiplication → NO_COVERAGE
86		1.1 Location : getString Killed by : none mutated return of Object value for com/lowagie/text/factories/RomanAlphabetFactory::getString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE
95		1.1 Location : getLowerCaseString Killed by : none mutated return of Object value for com/lowagie/text/factories/RomanAlphabetFactory::getLowerCaseString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE
104		1.1 Location : getUpperCaseString Killed by : none mutated return of Object value for com/lowagie/text/factories/RomanAlphabetFactory::getUpperCaseString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE
114		1.1 Location : getString Killed by : none negated conditional → NO_COVERAGE
115		1.1 Location : getString Killed by : none mutated return of Object value for com/lowagie/text/factories/RomanAlphabetFactory::getString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE
118		1.1 Location : getString Killed by : none mutated return of Object value for com/lowagie/text/factories/RomanAlphabetFactory::getString to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE

RomanAlphabetFactory.java

Mutations

Active mutators

Tests examined