| /external/icu4c/i18n/unicode/ |
| format.h | 48 * localized or contain localized characters or strings. For example,
57 * govern the interconversion between values and strings. For example,
60 * currency values, yielding strings such as "$1,234.45" for 1234.45,
71 * as strings. For instance, 0 may be represented as "no files", 1 as
166 * polymorphic parsing of strings into Formattable objects.
|
| /external/icu4c/tools/genrb/ |
| read.c | 111 merge adjacent strings. It looks forward a bit, and if the next
113 well. If two adjacent strings are quoted, they are merged without
167 /* Unterminated quoted strings */
220 warning(lineCount, "Mixing quoted and unquoted strings");
231 * quoted and unquoted strings
|
| /external/v8/src/ |
| heap-inl.h | 200 // Heap numbers and sequential strings are promoted to old data space, all
212 // There are three string representations: sequential strings, cons
213 // strings, and external strings. Only cons strings contain
|
| /hardware/msm7k/librpc/ |
| xdr.c | 350 /* like strings, arrays are really counted arrays */
474 * XDR null terminated ASCII strings
475 * xdr_string deals with "C strings" - arrays of bytes that are
487 * first deal with the length since xdr strings are counted-strings
|
| /external/icu4c/common/ |
| unormcmp.cpp | 39 * Compare two strings for canonical equivalence.
44 * If canonical equivalence is tested, then both strings must fulfill
51 * String comparisons almost always yield results before processing both strings
55 * on the entire strings first.
112 * un-FCD any strings.
115 * This requires that case-folding does not un-NFD strings either.
119 * If this happens, then a simple solution is to case-fold both strings up front
121 * We already do this when not both strings are in FCD because makeFCD
267 return 0; /* c1==c2==-1 indicating end of strings */
579 * both strings are in FCD) for the inner normalization
[all...] |
| locutil.cpp | 136 * Problem: Locale ID strings may contain '@' which is a variant
187 // are path strings ('bundleID') passed to
189 // second-level hashes. The second-level keys are result strings
|
| ustrenum.cpp | 305 uenum_openCharStringsEnumeration(const char* const* strings, int32_t count,
308 if (U_SUCCESS(*ec) && count >= 0 && (count == 0 || strings != 0)) {
315 result->uenum.context = (void*)strings;
|
| /external/webkit/JavaScriptCore/icu/unicode/ |
| uset.h | 440 * the multicharacter strings, if any.
471 * strings.
539 * Returns the number of characters and strings contained in the given
542 * @return a non-negative integer counting the characters and strings
554 * and/or strings contained in set
585 * Returns true if set1 contains all the characters and strings
596 * Returns true if set1 contains none of the characters and strings
607 * Returns true if set1 contains some of the characters and strings
618 * Returns true if set1 contains all of the characters and strings
635 * strings are ignored
[all...] |
| /external/webkit/WebCore/icu/unicode/ |
| uset.h | 440 * the multicharacter strings, if any.
471 * strings.
539 * Returns the number of characters and strings contained in the given
542 * @return a non-negative integer counting the characters and strings
554 * and/or strings contained in set
585 * Returns true if set1 contains all the characters and strings
596 * Returns true if set1 contains none of the characters and strings
607 * Returns true if set1 contains some of the characters and strings
618 * Returns true if set1 contains all of the characters and strings
635 * strings are ignored
[all...] |
| /external/bluetooth/glib/gio/tests/ |
| g-file.c | 262 const struct TestPathsWithOper strings[] = local
272 for (i = 0; i < G_N_ELEMENTS (strings); i++)
274 gboolean equal = parse_check_utf8 (strings[i].use_uri, strings[i].path1, strings[i].path2);
516 /* Testing whether the g_file_new_for_path() correctly canonicalizes strings and two files equals (g_file_equal()) */
519 /* Testing whether the g_file_new_for_uri() correctly canonicalizes strings and two files equals (g_file_equal()) */
|
| /external/icu4c/common/unicode/ |
| normlzr.h | 37 * - static functions that normalize strings or test if strings are normalized
335 * Concatenate normalized strings, making sure that the result is normalized as well.
337 * If both the left and the right strings are in
370 * Compare two strings for canonical equivalence.
374 * Canonical equivalence between two strings is defined as their normalized
376 * This function compares strings incrementally instead of normalizing
377 * (and optionally case-folding) both strings entirely,
380 * Bulk normalization is only necessary if the strings do not fulfill the FCD
381 * conditions. Only in this case, and only if the strings are relatively long
[all...] |
| /external/openssl/crypto/ui/ |
| ui.h | 87 /* The following functions are used to add strings to be printed and prompt
88 strings to prompt for data. The names are UI_{add,dup}_<function>_string
95 to the collection of strings in the user interface.
120 characters to mean OK and to mean Cancel. The two last strings are checked
124 the answer, the first character from the OK or the Cancel character strings
208 /* When all strings have been added, process the whole thing. */
274 strings, then the flusher, then the reader for all strings and finally the
281 them back into the UI strings.
293 /* The different types of strings that are currently supported
[all...] |
| /external/openssl/include/openssl/ |
| ui.h | 87 /* The following functions are used to add strings to be printed and prompt
88 strings to prompt for data. The names are UI_{add,dup}_<function>_string
95 to the collection of strings in the user interface.
120 characters to mean OK and to mean Cancel. The two last strings are checked
124 the answer, the first character from the OK or the Cancel character strings
208 /* When all strings have been added, process the whole thing. */
274 strings, then the flusher, then the reader for all strings and finally the
281 them back into the UI strings.
293 /* The different types of strings that are currently supported
[all...] |
| /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/x509/ |
| X509Name.java | 10 import org.bouncycastle.util.Strings;
188 * determines whether or not strings should be processed and printed
433 * The passed in converter will be used to convert the strings into their
498 * The passed in converter will be used to convert the strings into their
576 * should provide a table of lookups, indexed by lowercase only strings and
598 if (Strings.toUpperCase(name).startsWith("OID."))
607 DERObjectIdentifier oid = (DERObjectIdentifier)lookUp.get(Strings.toLowerCase(name));
619 * should provide a table of lookups, indexed by lowercase only strings and
813 _val = Strings.toLowerCase(_val.trim());
814 _oVal = Strings.toLowerCase(_oVal.trim())
[all...] |
| /external/bluetooth/glib/glib/ |
| gstring.c | 64 * Compares two strings for byte-by-byte equality and returns %TRUE
66 * @key_equal_func parameter, when using strings as keys in a #GHashTable.
86 * parameter, when using strings as keys in a #GHashTable.
130 * allocated to store the strings. If a particular string
161 * access any of the strings which were contained within it.
188 * Frees all strings contained within the #GStringChunk.
190 * access any of the strings which were contained within it.
229 * does not check for duplicates. Also strings added
256 * of strings but do not want to waste space storing duplicates.
258 * the same string, and so any changes made to the strings
[all...] |
| /external/icu4c/test/cintltst/ |
| callcoll.c | 286 log_err("different results in iterative comparison for UTF-16 encoded strings. %s, %s\n", aescstrdup(source,-1), aescstrdup(target,-1));
289 /* convert the strings to UTF-8 and do try comparing with char iterator */
301 /*log_verbose("Strings converted to UTF-8:%s, %s\n", aescstrdup(source,-1), aescstrdup(target,-1));*/
313 log_err("different results in iterative comparison for UTF-16 and UTF-8 encoded strings. %s, %s\n", aescstrdup(source,-1), aescstrdup(target,-1));
316 log_err("different results in iterative when normalization is turned on with UTF-8 strings. %s, %s\n", aescstrdup(source,-1), aescstrdup(target,-1));
365 log_err("ucol_strcoll result from null terminated and explicit length strings differs.\n");
388 log_err("Sort Keys from null terminated and explicit length strings differ.\n");
860 log_err("Comparing two strings with only secondary differences in C failed.\n");
868 log_err("Comparing two strings with no differences in C failed.\n");
876 log_err("Comparing two strings with sort keys in C failed.\n")
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xalan/templates/ |
| ElemSort.java | 132 * strings to be sorted.
140 * strings; the following values are allowed:
177 * strings; the following values are allowed:
212 * order specifies whether the strings should be sorted in ascending
220 * order specifies whether the strings should be sorted in ascending
233 * order specifies whether the strings should be sorted in ascending
|
| /external/icu4c/i18n/ |
| zstrfmt.h | 121 // Name type index, these constants are used for index in the zone strings array.
185 ZoneStringFormat(const UnicodeString* const* strings, int32_t rowCount, int32_t columnCount, UErrorCode &status);
192 * Create a snapshot of old zone strings array for the given date
362 * ZooneStrings is a container of localized zone strings used by ZoneStringFormat
366 ZoneStrings(UnicodeString *strings, int32_t stringsCount, UBool commonlyUsed,
392 * for collecting search results for localized zone strings.
|
| /external/webkit/JavaScriptCore/runtime/ |
| Operations.h | 97 ALWAYS_INLINE JSValue jsString(ExecState* exec, Register* strings, unsigned count)
103 JSValue v = strings[i].jsValue();
112 return new (globalData) JSString(exec, strings[0].jsValue(), strings[1].jsValue(), strings[2].jsValue());
120 JSValue v = strings[i].jsValue();
|
| /external/zlib/ |
| algorithm.txt | 4 LZ77 (Lempel-Ziv 1977, see reference below). It finds duplicated strings in
21 Duplicated strings are found using a hash table. All input strings of
24 strings in the chain are compared with the current input string, and
27 The hash chains are searched starting with the most recent strings, to
52 modes (level parameter 1 to 3). For these fast modes, new strings
|
| /external/v8/test/mjsunit/ |
| string-add.js | 177 // Generate ascii and non ascii strings from length 0 to 20.
189 // Add ascii and non-ascii strings generating strings with length from 0 to 20.
|
| /external/webkit/JavaScriptCore/tests/mozilla/ecma_3/RegExp/ |
| 15.10.2-1.js | 53 var strings = new Array();
162 strings[i] = string;
174 testRegExp(statusmessages, patterns, strings, actualmatches, expectedmatches);
|
| regress-100199.js | 41 var strings = new Array();
272 strings[i] = string;
284 testRegExp(statusmessages, patterns, strings, actualmatches, expectedmatches);
|
| regress-191479.js | 52 var strings = new Array();
179 strings[i] = string;
191 testRegExp(statusmessages, patterns, strings, actualmatches, expectedmatches);
|
| regress-209919.js | 52 var strings = new Array();
155 strings[i] = string;
167 testRegExp(statusmessages, patterns, strings, actualmatches, expectedmatches);
|
