01: /*
02: * Copyright (c) 2001-2007, Jean Tessier
03: * All rights reserved.
04: *
05: * Redistribution and use in source and binary forms, with or without
06: * modification, are permitted provided that the following conditions
07: * are met:
08: *
09: * * Redistributions of source code must retain the above copyright
10: * notice, this list of conditions and the following disclaimer.
11: *
12: * * Redistributions in binary form must reproduce the above copyright
13: * notice, this list of conditions and the following disclaimer in the
14: * documentation and/or other materials provided with the distribution.
15: *
16: * * Neither the name of Jean Tessier nor the names of his contributors
17: * may be used to endorse or promote products derived from this software
18: * without specific prior written permission.
19: *
20: * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
21: * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
22: * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
23: * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR
24: * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
25: * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
26: * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
27: * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
28: * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
29: * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
30: * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31: */
32:
33: package com.jeantessier.metrics;
34:
35: import java.util.*;
36:
37: public class WordCounter {
38: public int countPackageName(String packageName) {
39: return new StringTokenizer(packageName, ".").countTokens();
40: }
41:
42: public int countIdentifier(String identifier) {
43: int result = 0;
44:
45: int pos = identifier.lastIndexOf("$");
46: identifier = identifier.substring(pos + 1);
47:
48: switch (identifier.length()) {
49: case 0:
50: // Do nothing
51: break;
52: case 1:
53: result = 1;
54: break;
55: default:
56: result = 1;
57: int p1 = 0;
58: int p2 = 1;
59: while (p2 < identifier.length()) {
60: char ch1 = identifier.charAt(p1);
61: char ch2 = identifier.charAt(p2);
62: if (isBeginWordTransition(ch1, ch2)) {
63: if (p2 - p1 > 1) {
64: result++;
65: }
66: p1 = p2;
67: } else {
68: if (isEndWordTransition(ch1, ch2)) {
69: result++;
70: }
71: if (!isUpperCase(ch1)) {
72: p1++;
73: }
74: }
75: p2++;
76: }
77: break;
78: }
79:
80: return result;
81: }
82:
83: private boolean isBeginWordTransition(char ch1, char ch2) {
84: return (isUpperCase(ch1) && !isUpperCase(ch2))
85: || (ch1 == '_' && isUpperCase(ch2));
86: }
87:
88: private boolean isEndWordTransition(char ch1, char ch2) {
89: return (!isUpperCase(ch1) && isUpperCase(ch2))
90: || (isUpperCase(ch1) && ch2 == '_');
91: }
92:
93: private boolean isUpperCase(char ch) {
94: return Character.isLetterOrDigit(ch)
95: && Character.isUpperCase(ch);
96: }
97: }
|