- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 675 for charms (0.1 sec)
-
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) -
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) -
src/main/java/org/codelibs/fess/suggest/normalizer/FullWidthToHalfWidthAlphabetNormalizer.java
Registered: Fri Nov 08 09:08:12 UTC 2024 - Last Modified: Thu Feb 22 01:36:54 UTC 2024 - 1.4K 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/CharMatcher.java
private static final class AnyOf extends CharMatcher { private final char[] chars; public AnyOf(CharSequence chars) { this.chars = chars.toString().toCharArray(); Arrays.sort(this.chars); } @Override public boolean matches(char c) { return Arrays.binarySearch(chars, c) >= 0; } @Override
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 17 13:00:28 UTC 2024 - 53.9K 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) -
android/guava/src/com/google/common/escape/ArrayBasedUnicodeEscaper.java
* * @return the replacement characters, or {@code null} if no escaping was required */ @Override @CheckForNull protected final char[] escape(int cp) { if (cp < replacementsLength) { char[] chars = replacements[cp]; if (chars != null) { return chars; } } if (cp >= safeMin && cp <= safeMax) { return null; } return escapeUnsafe(cp); }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:26:48 UTC 2024 - 8.6K 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-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) -
android/guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java
final String allMatchingChars = allMatchingChars(bitSet); final char[] result = new char[STRING_LENGTH]; // Fill with matching chars. for (int i = 0; i < result.length; i++) { result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length())); } // Replace some of chars by non-matching. int remaining = (int) ((100 - percentMatching) * result.length / 100.0 + 0.5);
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed May 16 22:49:59 UTC 2018 - 3.9K bytes - Viewed (0)