/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/include/cloog/ |
names.h | 54 * names (as strings). 61 char ** scalars ; /**< The scalar names (an array of strings). */ 62 char ** scattering ; /**< The scattering names (an array of strings). */ 63 char ** iterators ; /**< The iterator names (an array of strings). */ 64 char ** parameters ; /**< The parameter names (an array of strings). */
|
/external/icu/icu4c/source/common/unicode/ |
uenum.h | 104 * uenum_next() or uenum_unext(). When all strings have been 137 * uenum_next() or uenum_unext(). When all strings have been 175 * Given an array of const UChar* strings, return a UEnumeration. String pointers from 0..count-1 must not be null. 178 * @param strings array of const UChar* strings (each null terminated). All storage is owned by the caller. 186 uenum_openUCharStringsEnumeration(const UChar* const strings[], int32_t count, 192 * Given an array of const char* strings (invariant chars only), return a UEnumeration. String pointers from 0..count-1 must not be null. 195 * @param strings array of char* strings (each null terminated). All storage is owned by the caller. 203 uenum_openCharStringsEnumeration(const char* const strings[], int32_t count [all...] |
/external/protobuf/src/google/protobuf/stubs/ |
substitute.h | 32 // from google3/strings/substitute.h 43 namespace strings { namespace in namespace:google::protobuf 46 // strings::Substitute() 47 // strings::SubstituteAndAppend() 52 // return strings::Substitute("My name is $0 $1 and I am $2 years old.", 66 // * Strings (const char*, const string&) 68 // your strings. In fact, you shouldn't; it will be slower. 77 // strings::SubstituteAndAppend(&str, 82 // large strings, it may be orders of magnitude faster. 166 } // namespace strings [all...] |
/frameworks/base/docs/html-intl/intl/ja/distribute/tools/ |
localization-checklist.jd | 15 <li><a href="#manage-strings">3.????????????????</a></li> 16 <li><a href="#translate-strings">4.UI ?????????????????</a></li> 159 <h2 id="manage-strings"> 171 <strong>?????????? strings.xml ?????</strong> 175 ????????????????????? ?????????????????????? ???????<em>????</em>???????????? strings.xml ?????????????????????????????????????strings.xml ????????????????????????????????????????????????????????????????? 179 ?????????????????????????????? strings.xml ??????????????????? 203 strings.xml ??????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????? 304 <h2 id="translate-strings"> 324 ???????????????????????????????strings.xml ????????????????????????????????????????? [all...] |
/frameworks/base/docs/html-intl/intl/zh-cn/distribute/tools/ |
localization-checklist.jd | 15 <li><a href="#manage-strings">3. ????????</a></li> 16 <li><a href="#translate-strings">4. ????????????</a></li> 226 <h2 id="manage-strings"> 239 <strong>???????? strings.xml ?</strong> 243 ??????????????????????????? strings.xml ????<em>??</em>?????????????????????? 245 Strings.xml ?????????????????????????????????????????????????????? 251 ??????????????????????? strings.xml?????????????? 284 ? strings.xml ??????????????????????????? 398 <h2 id="translate-strings"> 422 ????????????????????????????? strings.xml ?????????????????? [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/share/man/man1/ |
x86_64-w64-mingw32-strings.1 | 18 .\" Set up some character translations and predefined strings. \*(-- will 43 .\" Escape single quotes in literal strings from groff's Unicode transform. 126 .IX Title "STRINGS 1" 127 .TH STRINGS 1 "2011-11-21" "binutils-2.21.90" "GNU Development Tools" 133 strings \- print the strings of printable characters in files. 136 strings [\fB\-afovV\fR] [\fB\-\fR\fImin-len\fR] 148 character. By default, it only prints the strings from the initialized 150 the strings from the whole file. 206 Select the character encoding of the strings that are to be found [all...] |
/external/pcre/dist/doc/html/ |
pcreunicode.html | 27 In order process UTF-8 strings, you must build PCRE's 8-bit library with UTF 32 subject strings that are matched against it are treated as UTF-8 strings 33 instead of strings of individual 1-byte characters. 39 In order process UTF-16 or UTF-32 strings, you must build PCRE's 16-bit or 47 pattern and any subject strings that are matched against it are treated as 48 UTF-16 or UTF-32 strings instead of strings of individual 16-bit or 32-bit 78 Validity of UTF-8 strings 81 When you set the PCRE_UTF8 flag, the byte strings passed as patterns an [all...] |
/external/pcre/dist/doc/ |
pcreunicode.3 | 15 In order process UTF-8 strings, you must build PCRE's 8-bit library with UTF 22 subject strings that are matched against it are treated as UTF-8 strings 23 instead of strings of individual 1-byte characters. 29 In order process UTF-16 or UTF-32 strings, you must build PCRE's 16-bit or 41 pattern and any subject strings that are matched against it are treated as 42 UTF-16 or UTF-32 strings instead of strings of individual 16-bit or 32-bit 77 .SS "Validity of UTF-8 strings" 80 When you set the PCRE_UTF8 flag, the byte strings passed as patterns an [all...] |
/external/apache-http/src/org/apache/commons/codec/language/ |
SoundexUtils.java | 63 * Encodes the Strings and returns the number of characters in the two 64 * encoded Strings that are the same. 73 * The encoder to use to encode the Strings. 78 * @return The number of characters in the two Soundex encoded Strings that 86 * if an error occurs encoding one of the strings 93 * Returns the number of characters in the two Soundex encoded Strings that 106 * @return The number of characters in the two Soundex encoded Strings that
|
/external/icu/icu4c/source/test/cintltst/ |
sorttest.c | 88 * Fill an array with semi-random short strings. 90 * With CYCLE=10 characters per STR_LEN=3 string positions there are only 1000 unique strings. 128 /* compare the strings but not the record number */ 177 /* Binary comparison first, for speed. In this case, equal strings must be identical. */ 181 log_err("equal strings %d and %d out of order at sorted index %d\n", 186 /* Compare unequal strings with the collator. */ 189 log_err("unequal strings %d and %d out of order at sorted index %d\n",
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
DateFormatSymbols.java | 333 * Era strings. For example: "AD" and "BC". An array of 2 strings, 340 * Era name strings. For example: "Anno Domini" and "Before Christ". An array of 2 strings, 347 * Narrow era names. For example: "A" and "B". An array of 2 strings, 354 * Month strings. For example: "January", "February", etc. An array 355 * of 13 strings (some calendars have 13 months), indexed by 362 * Short month strings. For example: "Jan", "Feb", etc. An array of 363 * 13 strings (some calendars have 13 months), indexed by 371 * Narrow month strings. For example: "J", "F", etc. An array o [all...] |
/external/mesa3d/src/gallium/state_trackers/clover/api/ |
program.cpp | 30 const char **strings, const size_t *lengths, 37 if (!count || !strings || 38 any_of(is_zero<const char *>(), strings, strings + count)) 44 std::string(strings[i], strings[i] + lengths[i]) : 45 std::string(strings[i]));
|
/sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/relative/ |
GuidelinePainter.java | 97 List<String> strings = new ArrayList<String>(); local 99 showMatch(gc, state.mCurrentLeftMatch, state, strings, 101 showMatch(gc, state.mCurrentRightMatch, state, strings, 103 showMatch(gc, state.mCurrentTopMatch, state, strings, 105 showMatch(gc, state.mCurrentBottomMatch, state, strings, 108 if (strings.size() > 0) { 111 for (String s : strings) { 144 private void showMatch(IGraphics gc, Match m, GuidelineHandler state, List<String> strings, 163 strings.add(description);
|
/art/runtime/ |
intern_table.h | 44 * Used to intern strings. 46 * There are actually two tables: one that holds strong references to its strings, and one that 48 * reference from the constant pool. The latter is used for strings interned at runtime via 50 * arbitrarily many strings for the duration of a parse without permanently increasing the memory 76 // Total number of interned strings. 78 // Total number of weakly live interned strings. 80 // Total number of strongly live interned strings. 92 // Adds all of the resolved image strings from the image space into the intern table. The 131 // Table which holds pre zygote and post zygote interned strings. There is one instance for 171 // interned strings which were interned before we created the zygote space. Post zygote is sel [all...] |
/cts/tests/tests/content/src/android/content/res/cts/ |
ArrayTest.java | 67 checkStringArray(R.array.strings, new String[] {"zero", "1", "here"}); 68 checkTextArray(R.array.strings, new String[] {"zero", "1", "here"}); 75 checkIntArray(R.array.strings, new int[] {0, 0, 0});
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
DERT61String.java | 6 import org.bouncycastle.util.Strings; 93 this(Strings.toByteArray(string)); 102 return Strings.fromByteArray(string);
|
DERVisibleString.java | 6 import org.bouncycastle.util.Strings; 91 this.string = Strings.toByteArray(string); 96 return Strings.fromByteArray(string);
|
/external/clang/include/clang-c/ |
CXString.h | 1 /*===-- clang-c/CXString.h - C Index strings --------------------*- C -*-===*\ 10 |* This header provides the interface to C Index strings. *| 33 * The \c CXString type is used to return strings from the interface when
|
/external/freetype/src/autofit/ |
afblue.hin | 5 /* Auto-fitter data for blue strings (specification). */ 64 /* At the bottommost level, we define strings for finding blue zones. */ 93 /* The next level is to group blue strings into style-specific sets. */
|
/external/icu/icu4c/source/common/ |
uniset_closure.cpp | 52 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL), 73 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL), 199 // USET_CASE: remove strings because the strings will actually be reduced (folded); 200 // therefore, start with no strings and add only those needed 202 foldSet.strings->removeAllElements(); 237 if (strings != NULL && strings->size() > 0) { 239 for (int32_t j=0; j<strings->size(); ++j) { 240 str = *(const UnicodeString *) strings->elementAt(j) [all...] |
/external/lldb/include/lldb/Core/ |
StringList.h | 46 AppendList (StringList strings); 86 operator << (StringList strings); 89 // strings, and the "s" is passed in. "matches" is filled in
|
/external/lldb/source/API/ |
SBStringList.cpp | 99 SBStringList::AppendList (const SBStringList &strings) 101 if (strings.IsValid()) 105 m_opaque_ap->AppendList (*(strings.m_opaque_ap));
|
/external/owasp/sanitizer/src/main/org/owasp/html/ |
StandardUrlAttributePolicy.java | 52 if (!Strings.regionMatchesIgnoreCase("http", 0, s, 0, 4)) { 57 if (!Strings.regionMatchesIgnoreCase("https", 0, s, 0, 5)) { 62 if (!Strings.regionMatchesIgnoreCase("mailto", 0, s, 0, 6)) {
|
/external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/ |
AssetManagerTest.java | 7 import com.xtremelabs.robolectric.util.Strings; 79 fileContents = Strings.fromStream(inputStream); 84 fileContents = Strings.fromStream(inputStream);
|
/frameworks/base/core/java/android/os/ |
PooledStringWriter.java | 22 * Helper class for writing pooled strings into a Parcel. It must be used 31 * Book-keeping for writing pooled string objects, mapping strings we have 42 * how many strings are in the pool.
|