(CharSequence value, int lo, int hi)
| 1114 | } |
| 1115 | |
| 1116 | public static int lowerCaseAsciiHashCode(CharSequence value, int lo, int hi) { |
| 1117 | if (hi == lo) { |
| 1118 | return 0; |
| 1119 | } |
| 1120 | |
| 1121 | int h = 0; |
| 1122 | for (int p = lo; p < hi; p++) { |
| 1123 | h = 31 * h + toLowerCaseAscii(value.charAt(p)); |
| 1124 | } |
| 1125 | return h; |
| 1126 | } |
| 1127 | |
| 1128 | public static int lowerCaseAsciiHashCode(CharSequence value) { |
| 1129 | int len = value.length(); |
no test coverage detected