Source code: javatools/util/OrdinalPostfix.java
1 /*
2 Javatools (modified version) - Some useful general classes.
3 Copyright (C) 2002-2003 Chris Bitmead (original) Antonio Petrelli (modified)
4
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
9
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
14
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18
19 Contact me at: brenmcguire@users.sourceforge.net
20 */
21 package javatools.util;
22
23 /**
24 * This class returns the bit that you tag onto the end of number. e.g. if you
25 * pass in the number "1" it will return "st", as in 1st. If you pass in
26 * "2" it will return "nd", as in "2nd". etc.
27 * Yes, the name is pretty wierd, but what can you name something like this?
28 * @author Chris Bitmead
29 * @version 0.7
30 * @commentedby Antonio Petrelli
31 */
32 public class OrdinalPostfix {
33 /** Contains "st".
34 */
35 final static String st = "st";
36 /** Contains "nd".
37 */
38 final static String nd = "nd";
39 /** Contains "rd".
40 */
41 final static String rd = "rd";
42 /** Contains "th".
43 */
44 final static String th = "th";
45
46 /** Returns the correct postfix string.
47 * @param number The number to base the choice from.
48 * @return The postfix to use.
49 */
50 public static String postfix(int number) {
51 int mod100 = number % 100;
52 int mod10 = number % 10;
53 if (mod100 == 11 || mod100 == 12 || mod100 == 13) {
54 return th;
55 } else if (mod10 == 1) {
56 return st;
57 } else if (mod10 == 2) {
58 return nd;
59 } else if (mod10 == 3) {
60 return rd;
61 } else {
62 return th;
63 }
64 }
65 }