HomeSort by relevance Sort by last modified time
    Searched refs:DIGITS (Results 1 - 25 of 46) sorted by null

1 2

  /external/jsilver/src/com/google/clearsilver/jsilver/functions/escape/
JsEscapeFunction.java 31 private static final char[] DIGITS = "0123456789ABCDEF".toCharArray();
70 return "\\x" + DIGITS[(c >> 4) & 0xF] + DIGITS[c & 0xF];
  /packages/providers/ContactsProvider/src/com/android/providers/contacts/util/
Hex.java 39 private static final byte[] DIGITS = new byte['f'+1];
42 DIGITS[i] = -1;
45 DIGITS['0' + i] = i;
48 DIGITS['A' + i] = (byte)(10 + i);
49 DIGITS['a' + i] = (byte)(10 + i);
98 final byte d1 = DIGITS[c1];
110 final byte d2 = DIGITS[c2];
  /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/
Hex.java 29 private static final char[] DIGITS = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'};
44 out[j++] = DIGITS[(0xF0 & data[i]) >>> 4];
45 out[j++] = DIGITS[0x0F & data[i]];
  /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/contenttype/parser/
ContentTypeParserConstants.java 25 int DIGITS = 20;
56 "<DIGITS>",
  /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/datetime/parser/
DateTimeParserConstants.java 26 int DIGITS = 46;
81 "<DIGITS>",
DateTimeParser.java 213 t = jj_consume_token(DIGITS);
278 t = jj_consume_token(DIGITS);
304 t = jj_consume_token(DIGITS);
311 t = jj_consume_token(DIGITS);
318 t = jj_consume_token(DIGITS);
328 u = jj_consume_token(DIGITS);
  /frameworks/base/tools/layoutlib/create/src/com/android/tools/layoutlib/java/
IntegralToString.java 95 * The digits for every supported radix.
97 private static final char[] DIGITS = {
144 buf[--cursor] = DIGITS[radix * q - i];
212 // Calculate digits two-at-a-time till remaining digits fit in 16 bits
222 // Calculate remaining digits one-at-a-time for performance
227 buf[--cursor] = DIGITS[r];
278 buf[--cursor] = DIGITS[(int) (radix * q - v)];
330 int low = (int) (n % 1000000000); // Extract low-order 9 digits
333 // Zero-pad Low order part to 9 digits
451 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
458 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
466 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
481 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
    [all...]
  /libcore/luni/src/main/java/java/lang/
IntegralToString.java 102 * The digits for every supported radix.
104 private static final char[] DIGITS = {
151 buf[--cursor] = DIGITS[radix * q - i];
219 // Calculate digits two-at-a-time till remaining digits fit in 16 bits
229 // Calculate remaining digits one-at-a-time for performance
234 buf[--cursor] = DIGITS[r];
285 buf[--cursor] = DIGITS[(int) (radix * q - v)];
337 int low = (int) (n % 1000000000); // Extract low-order 9 digits
340 // Zero-pad Low order part to 9 digits
458 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
465 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
473 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
488 char[] digits = upperCase ? UPPER_CASE_DIGITS : DIGITS; local
    [all...]
  /external/chromium_org/third_party/icu/source/common/
util.cpp 24 static const UChar DIGITS[] = {
44 // First determine the number of digits
52 // Now generate the digits
54 result.append(DIGITS[0]);
58 result.append(DIGITS[digit]);
83 result.append(DIGITS[0xF&(c>>28)]);
84 result.append(DIGITS[0xF&(c>>24)]);
85 result.append(DIGITS[0xF&(c>>20)]);
86 result.append(DIGITS[0xF&(c>>16)]);
90 result.append(DIGITS[0xF&(c>>12)])
    [all...]
  /external/icu/icu4c/source/common/
util.cpp 25 static const UChar DIGITS[] = {
45 // First determine the number of digits
53 // Now generate the digits
55 result.append(DIGITS[0]);
59 result.append(DIGITS[digit]);
84 result.append(DIGITS[0xF&(c>>28)]);
85 result.append(DIGITS[0xF&(c>>24)]);
86 result.append(DIGITS[0xF&(c>>20)]);
87 result.append(DIGITS[0xF&(c>>16)]);
91 result.append(DIGITS[0xF&(c>>12)])
    [all...]
  /cts/tests/tests/text/src/android/text/method/cts/
NumberKeyListenerTest.java 44 mMockNumberKeyListener = new MockNumberKeyListener(MockNumberKeyListener.DIGITS);
88 mMockNumberKeyListener = new MockNumberKeyListener(MockNumberKeyListener.DIGITS);
107 mMockNumberKeyListener = new MockNumberKeyListener(MockNumberKeyListener.DIGITS);
128 new MockNumberKeyListener(MockNumberKeyListener.DIGITS);
145 int keyCode = TextMethodUtils.getUnacceptedKeyCode(MockNumberKeyListener.DIGITS);
173 static final char[] DIGITS =
  /external/apache-http/src/org/apache/commons/codec/binary/
Hex.java 36 private static final char[] DIGITS = {
48 * @param data An array of characters containing hexidecimal digits
109 out[j++] = DIGITS[(0xF0 & data[i]) >>> 4 ];
110 out[j++] = DIGITS[ 0x0F & data[i] ];
123 * @param array An array of character bytes containing hexidecimal digits
141 * @param object A String or, an array of character bytes containing hexidecimal digits
  /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/
Python.g 479 : '.' DIGITS (Exponent)?
480 | DIGITS ('.' (DIGITS (Exponent)?)? | Exponent)
489 : ('e' | 'E') ( '+' | '-' )? DIGITS
496 '0' DIGITS*
497 | '1'..'9' DIGITS*
506 DIGITS : ( '0' .. '9' )+ ;
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
sre_parse.py 23 DIGITS = set("0123456789")
237 # hexadecimal escape (exactly two digits)
245 # octal escape (up to three digits)
250 elif c in DIGITS:
280 elif c in DIGITS:
282 if source.next in DIGITS:
286 # got three octal digits; this is an octal escape
489 while source.next in DIGITS:
492 while source.next in DIGITS:
758 elif c in DIGITS
    [all...]
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
sre_parse.py 23 DIGITS = set("0123456789")
237 # hexadecimal escape (exactly two digits)
245 # octal escape (up to three digits)
250 elif c in DIGITS:
280 elif c in DIGITS:
282 if source.next in DIGITS:
286 # got three octal digits; this is an octal escape
489 while source.next in DIGITS:
492 while source.next in DIGITS:
758 elif c in DIGITS
    [all...]
  /external/antlr/antlr-3.4/runtime/Ruby/test/functional/delegation/
import.rb 320 INTEGER: ('+'|'-')? DIGITS;
321 FLOAT: INTEGER '.' DIGITS (('e'|'E') INTEGER)?;
322 fragment DIGITS: ('0'..'9')+;
  /external/eigen/lapack/
dlamch.f 43 *> t = number of (base) digits in the mantissa
89 INTRINSIC DIGITS, EPSILON, HUGE, MAXEXPONENT,
123 RMACH = DIGITS(ZERO)
slamch.f 47 *> t = number of (base) digits in the mantissa
93 INTRINSIC DIGITS, EPSILON, HUGE, MAXEXPONENT,
127 RMACH = DIGITS(ZERO)
  /external/chromium_org/third_party/mesa/src/src/glsl/glcpp/
glcpp-lex.l 89 DIGITS [0-9][0-9]*
  /external/mesa3d/src/glsl/glcpp/
glcpp-lex.l 89 DIGITS [0-9][0-9]*
  /external/libphonenumber/java/src/com/android/i18n/phonenumbers/
PhoneNumberUtil.java 119 // includes digits, ASCII letters and number grouping symbols such as "-" and " ".
128 // Simple ASCII digits map used to populate ALPHA_PHONE_MAPPINGS and
211 // represented as a string that contains a sequence of ASCII digits. If there are multiple
213 // always contains character(s) other than ASCII digits.
227 private static final String DIGITS = "\\p{Nd}";
235 private static final Pattern CAPTURING_DIGIT_PATTERN = Pattern.compile("(" + DIGITS + ")");
239 // mistakenly given to us. This consists of digits, the plus symbol and arabic-indic digits. This
243 private static final String VALID_START_CHAR = "[" + PLUS_CHARS + DIGITS + "]";
261 // we treat it as a number where some phone-number digits are represented by letters
    [all...]
  /external/chromium_org/third_party/icu/source/test/intltest/
numfmtst.cpp 230 logln((UnicodeString)"Min integer digits = " + fmt.getMinimumIntegerDigits());
899 // expect "1,87,65,43,210", but with Hindi digits
926 " x hi_IN -> \"1,87,65,43,210\" (with Hindi digits), got \"" +
    [all...]
  /external/icu/icu4c/source/test/intltest/
numfmtst.cpp 253 logln((UnicodeString)"Min integer digits = " + fmt.getMinimumIntegerDigits());
    [all...]
  /external/qemu/android/
hw-events.h 358 KEY_CODE(DIGITS ,0x19d) \
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.apache.commons.codec_1.3.0.v20100518-1140.jar 

Completed in 870 milliseconds

1 2