HomeSort by relevance Sort by last modified time
    Searched full:strings (Results 251 - 275 of 3020) sorted by null

<<11121314151617181920>>

  /frameworks/base/tools/aapt/
XMLNode.cpp 854 StringPool strings = StringPool(false, mUTF8);
857 // First collect just the strings for attribute names that have a
861 collect_resid_strings(&strings, &resids);
863 // Next collect all remainibng strings.
864 collect_strings(&strings, &resids, stripComments, stripRawValues);
867 NOISY(printf("Found strings:\n");
868 const size_t N = strings.size();
870 printf("%s\n", String8(strings.entryAt(i).string).string());
875 sp<AaptFile> stringPool = strings.createStringBlock();
904 flatten_node(strings, dest, stripComments, stripRawValues)
    [all...]
  /dalvik/libcore/xml/src/main/java/org/apache/xpath/objects/
XNodeSet.java 735 * Compare two strings
741 * @return Whether the strings are equal or not
758 * Compare strings or numbers for less than.
764 * Compare two strings for less than.
794 * Compare strings or numbers for less than or equal.
800 * Compare two strings for less than or equal.
830 * Compare strings or numbers for greater than.
836 * Compare two strings for greater than.
866 * Compare strings or numbers for greater than or equal.
872 * Compare two strings for greater than or equal
    [all...]
  /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/
libiberty.h 122 /* Concatenate an arbitrary number of strings. You must pass NULL as
124 strings. Allocates memory using xmalloc. */
128 /* Concatenate an arbitrary number of strings. You must pass NULL as
130 strings. Allocates memory using xmalloc. The first argument is
131 not one of the strings to be concatenated, but if not NULL is a
138 strings. You must pass NULL as the last argument of this function,
139 to terminate the list of strings. */
143 /* Concatenate an arbitrary number of strings into a SUPPLIED area of
145 to terminate the list of strings. The supplied memory is assumed
150 /* Concatenate an arbitrary number of strings into a GLOBAL area o
    [all...]
  /external/icu4c/i18n/
reldtfmt.cpp 195 // Linear search the relative strings
247 // Linear search the held strings
378 UResourceBundle *strings = calData.getByKey3("fields", "day", "relative", status); local
388 fDatesLen = ures_getSize(strings);
396 while(ures_hasNext(strings) && U_SUCCESS(status)) { // iterate over items
397 subString = ures_getNextResource(strings, subString, &status);
uspoof_buildconf.cpp 49 // 2. Sort all of the strings encountered by length, since they will need to
103 // Comparison function for ordering strings in the string pool.
309 // This is done in two steps. First the data is assembled into vectors and strings,
315 // Strings of length one are not entered into the strings array.
318 // (Strings in the table are sorted by length)
332 // strings of length one do not get an entry in the string table.
388 // collections and strings. Copy it from there to the final flat
442 // The Strings Table.
447 UChar *strings
    [all...]
  /external/icu4c/i18n/unicode/
sortkey.h 28 * \brief C++ API: Keys for comparing strings multiple times.
45 * instead of Collator to compare strings multiple times. A CollationKey
47 * make the comparison faster. If you are not going to comparing strings
56 * CollationKeys, since you will be comparing strings multiple times.
84 * CollationKeys for the same set of strings. Locales have specific
87 * for same strings.
ucol.h 239 * Open a UCollator for comparing strings.
310 * strings are to be cached, should be set to FALSE.
334 * will contain only strings. If a tailoring explicitly suppresses contractions from
379 * Compare two strings.
380 * The strings will be compared using the options already specified.
386 * @return The result of comparing the strings; one of UCOL_EQUAL,
439 * Compare two strings for equality.
459 * The strings will be compared using the options already specified.
463 * @return The result of comparing the strings; one of UCOL_EQUAL,
477 * The strength influences how strings are compared
    [all...]
  /external/icu4c/tools/gennames/
gennames.c 43 * -- strings (groupStrings) are tokenized as follows:
56 * Different strings for a code point - normal name, 1.0 name, and ISO comment -
62 * uint16_t offsetHigh; -- group strings are at start of names data + groupStringsOffset + this 32 bit-offset
68 * -- The actual, tokenized group strings are not zero-terminated because
71 * For each of the 32 group strings, one or two nibbles are stored for its length.
77 * For the de-tokenizing, see token description above; the strings immediately follow the
109 * char strings[];
117 * The strings after the prefix are short pieces that are then appended to the result
307 addGroup(uint32_t groupMSB, uint8_t *strings, int16_t length);
810 /* store the groups like lines, with compressed data after raw strings */
    [all...]
  /external/webkit/JavaScriptCore/icu/unicode/
ucol.h 252 * Open a UCollator for comparing strings.
323 * strings are to be cached, should be set to FALSE.
347 * will contain only strings. If a tailoring explicitly suppresses contractions from
377 * Compare two strings.
378 * The strings will be compared using the options already specified.
384 * @return The result of comparing the strings; one of UCOL_EQUAL,
437 * Compare two strings for equality.
457 * The strings will be compared using the options already specified.
461 * @return The result of comparing the strings; one of UCOL_EQUAL,
475 * The strength influences how strings are compared
    [all...]
  /external/webkit/WebCore/icu/unicode/
ucol.h 252 * Open a UCollator for comparing strings.
323 * strings are to be cached, should be set to FALSE.
347 * will contain only strings. If a tailoring explicitly suppresses contractions from
377 * Compare two strings.
378 * The strings will be compared using the options already specified.
384 * @return The result of comparing the strings; one of UCOL_EQUAL,
437 * Compare two strings for equality.
457 * The strings will be compared using the options already specified.
461 * @return The result of comparing the strings; one of UCOL_EQUAL,
475 * The strength influences how strings are compared
    [all...]
  /external/libxml2/
dict.c 2 * dict.c: dictionary of reusable strings, just used to avoid allocation
98 xmlDictStringsPtr strings; member in struct:_xmlDict
166 pool = dict->strings;
188 pool->next = dict->strings;
189 dict->strings = pool;
228 pool = dict->strings;
250 pool->next = dict->strings;
251 dict->strings = pool;
303 * Calculate a hash key for two strings using a good hash function
309 * Neither of the two strings must be NULL
    [all...]
  /development/samples/RSSReader/src/com/example/android/rssreader/
RssReader.java 104 public static final String STRINGS_KEY = "strings";
389 * objects, such as Strings, Integers or lists of Strings. In this case, we
412 ArrayList<CharSequence> strings = new ArrayList<CharSequence>(); local
415 strings.add(item.getTitle());
416 strings.add(item.getLink());
417 strings.add(item.getDescription());
419 outState.putSerializable(STRINGS_KEY, strings);
447 List<CharSequence> strings = (ArrayList<CharSequence>)state.getSerializable(STRINGS_KEY);
449 for (int i = 0; i < strings.size(); i += 3)
    [all...]
  /external/openssl/crypto/ui/
ui_lib.c 91 ret->strings=NULL;
121 sk_UI_STRING_pop_free(ui->strings,free_string);
128 if (ui->strings == NULL)
130 ui->strings=sk_UI_STRING_new_null();
131 if (ui->strings == NULL)
180 ret=sk_UI_STRING_push(ui->strings, s);
229 ret=sk_UI_STRING_push(ui->strings, s);
465 if (i >= sk_UI_STRING_num(ui->strings))
470 return UI_get0_result_string(sk_UI_STRING_value(ui->strings, i));
499 for(i=0; i<sk_UI_STRING_num(ui->strings); i++
    [all...]
  /dalvik/libcore/icu/src/main/java/com/ibm/icu4jni/text/
Collator.java 26 * // Compare two strings in the default locale
53 * System.out.println("Strings are equivalent");
56 * For comparing Strings exactly once, the compare method provides the best
58 * When sorting a list of Strings however, it is generally necessary to compare
141 * <p>Decomposition mode value. With NO_DECOMPOSITION set, Strings
239 * Locale dependent equality check for the argument strings.
267 * different strings. Returns information about whether a string is less
301 * The normalization mode influences how strings are compared.
  /dalvik/libcore/security/src/main/java/org/bouncycastle/asn1/x509/
X509NameEntryConverter.java 8 import org.bouncycastle.util.Strings;
63 str = Strings.toLowerCase(str);
  /dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/
JCEDigestUtil.java 19 import org.bouncycastle.util.Strings;
84 digestName = Strings.toUpperCase(digestName);
  /dalvik/libcore/security/src/main/java/org/bouncycastle/x509/
X509Util.java 24 import org.bouncycastle.util.Strings;
83 algorithmName = Strings.toUpperCase(algorithmName);
  /dalvik/libcore/text/src/test/java/org/apache/harmony/text/tests/java/text/
DateFormatSymbolsTest.java 262 assertTrue("Failed to set strings", Arrays
304 assertTrue("Failed to set strings", retVal[i].equals(val[i]));
325 assertTrue("Failed to set strings", retVal[i].equals(val[i]));
373 assertTrue("Failed to set strings", retVal[i].equals(val[i]));
395 assertTrue("Failed to set strings", retVal[i].equals(val[i]));
417 assertTrue("Failed to set strings", retVal[i].equals(val[i]));
439 assertTrue("Failed to set strings", retVal[i].equals(val[i]));
464 assertTrue("Failed to set strings: " + retVal[i], Arrays.equals(
  /dalvik/vm/test/
TestHash.c 34 // (should verify strings)
66 // (should verify strings)
  /development/apps/launchperf/res/values/
strings.xml 3 /* //device/tests/ComplexLayout/res/values/strings.xml
21 <!-- This file contains resource definitions for displayed strings, allowing
  /external/dbus/dbus/
dbus-hash.h 60 DBUS_HASH_STRING, /**< Hash keys are strings. */
61 DBUS_HASH_TWO_STRINGS, /**< Hash key is two strings in one memory block, i.e. foo\\0bar\\0 */
  /external/elfcopy/
elfcopy.h 50 dynsymst: handle to the new symbol-strings section.
56 symbol table that stores the symbol name's index into the symbol-strings
  /external/emma/ant/ant14/com/vladium/emma/ant/
FilterTask.java 13 import com.vladium.util.Strings;
65 protected static final String COMMA_DELIMITERS = COMMA + Strings.WHITE_SPACE;
  /external/icu4c/common/unicode/
utrace.h 203 * Format Strings are passed to UTraceData functions, and define the
224 * ICU trace format strings contain plain text with argument inserts,
225 * much like standard printf format strings.
229 * The trace format strings need not have \n at the end.
255 * Note: %vS is a vector of (UChar *) strings. The strings must
259 * strings, not the length of the strings.
  /external/icu4c/samples/msgfmt/
README.TXT 61 idiomatic strings, such as "no arguments", "one argument", "two
70 of the "number" element, to display more idiomatic strings.

Completed in 2099 milliseconds

<<11121314151617181920>>