- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 251 for charms (0.07 sec)
-
android/guava/src/com/google/common/primitives/Chars.java
*/ public static char checkedCast(long value) { char result = (char) value; checkArgument(result == value, "Out of range: %s", value); return result; } /** * Returns the {@code char} nearest in value to {@code value}. * * @param value any {@code long} value * @return the same value cast to {@code char} if it is in the range of the {@code char} type,
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Aug 27 16:47:48 UTC 2024 - 23.9K bytes - Viewed (0) -
guava/src/com/google/common/primitives/Chars.java
*/ public static char checkedCast(long value) { char result = (char) value; checkArgument(result == value, "Out of range: %s", value); return result; } /** * Returns the {@code char} nearest in value to {@code value}. * * @param value any {@code long} value * @return the same value cast to {@code char} if it is in the range of the {@code char} type,
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Tue Aug 27 16:47:48 UTC 2024 - 23.9K bytes - Viewed (0) -
src/main/java/org/codelibs/core/lang/StringUtil.java
if (isEmpty(name)) { return name; } final char[] chars = name.toCharArray(); if (chars.length >= 2 && Character.isUpperCase(chars[0]) && Character.isUpperCase(chars[1])) { return name; } chars[0] = Character.toLowerCase(chars[0]); return new String(chars); } /**
Registered: Fri Nov 01 20:58:10 UTC 2024 - Last Modified: Thu Mar 07 01:59:08 UTC 2024 - 21.7K bytes - Viewed (0) -
guava/src/com/google/common/io/BaseEncoding.java
} } return chars.subSequence(0, l + 1); } @Override public boolean canDecode(CharSequence chars) { checkNotNull(chars); chars = trimTrailingPadding(chars); if (!alphabet.isValidPaddingStartPosition(chars.length())) { return false; } for (int i = 0; i < chars.length(); i++) { if (!alphabet.canDecode(chars.charAt(i))) { return false;
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 41.8K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Ascii.java
if (chars instanceof String) { return toLowerCase((String) chars); } char[] newChars = new char[chars.length()]; for (int i = 0; i < newChars.length; i++) { newChars[i] = toLowerCase(chars.charAt(i)); } return String.valueOf(newChars); } /** * If the argument is an {@linkplain #isUpperCase(char) uppercase ASCII character}, returns the
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Aug 02 13:50:22 UTC 2024 - 21.7K bytes - Viewed (0) -
guava/src/com/google/common/hash/Murmur3_32HashFunction.java
int i = 0; // This loop optimizes for pure ASCII. while (i + 4 <= utf16Length) { char c0 = input.charAt(i); char c1 = input.charAt(i + 1); char c2 = input.charAt(i + 2); char c3 = input.charAt(i + 3); if (c0 < 0x80 && c1 < 0x80 && c2 < 0x80 && c3 < 0x80) { update(4, c0 | (c1 << 8) | (c2 << 16) | (c3 << 24));
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Aug 02 13:50:22 UTC 2024 - 11.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/CharMatcherTest.java
Set<Character> positive = Sets.newHashSetWithExpectedSize(chars.length); for (char c : chars) { positive.add(c); } for (int c = 0; c <= Character.MAX_VALUE; c++) { assertFalse(positive.contains(Character.valueOf((char) c)) ^ m.matches((char) c)); } } static char[] randomChars(Random rand, int size) { Set<Character> chars = new HashSet<>(size);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Feb 21 18:32:41 UTC 2024 - 30.1K bytes - Viewed (0) -
guava/src/com/google/common/base/Ascii.java
if (chars instanceof String) { return toLowerCase((String) chars); } char[] newChars = new char[chars.length()]; for (int i = 0; i < newChars.length; i++) { newChars[i] = toLowerCase(chars.charAt(i)); } return String.valueOf(newChars); } /** * If the argument is an {@linkplain #isUpperCase(char) uppercase ASCII character}, returns the
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Aug 02 13:50:22 UTC 2024 - 21.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/base/CharMatcherTest.java
Set<Character> positive = Sets.newHashSetWithExpectedSize(chars.length); for (char c : chars) { positive.add(c); } for (int c = 0; c <= Character.MAX_VALUE; c++) { assertFalse(positive.contains(Character.valueOf((char) c)) ^ m.matches((char) c)); } } static char[] randomChars(Random rand, int size) { Set<Character> chars = new HashSet<>(size);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Feb 21 18:32:41 UTC 2024 - 30.1K bytes - Viewed (0) -
guava/src/com/google/common/io/CharSource.java
* Reader#skip(long) skip} to the end of the stream, and return the total number of chars that * were skipped. * * <p>Note that for sources that implement {@link #lengthIfKnown} to provide a more efficient * implementation, it is <i>possible</i> that this method will return a different number of chars * than would be returned by reading all of the chars. *
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 31 14:20:11 UTC 2024 - 25.5K bytes - Viewed (0)