| /device/generic/goldfish/opengl/shared/OpenglCodecCommon/ |
| glUtils.cpp | 436 // pack a list of strings into one.
437 void glUtilsPackStrings(char *ptr, char **strings, GLint *length, GLsizei count)
443 if (strings[i]!=NULL) {
445 l = strlen(strings[i]);
446 strcat(p, strings[i]);
449 strncat(p, strings[i], l);
456 // claculate the length of a list of strings
457 int glUtilsCalcShaderSourceLen( char **strings, GLint *length, GLsizei count)
463 l = strings[i]!=NULL ? strlen(strings[i]) : 0
[all...] |
| /external/skia/tools/flags/ |
| SkCommandLineFlags.cpp | 344 template <typename Strings>
345 bool ShouldSkipImpl(const Strings& strings, const char* name) {
346 int count = strings.count();
349 for (int i = 0; i < strings.count(); ++i) {
350 const char* matchName = strings[i];
378 bool SkCommandLineFlags::ShouldSkip(const SkTDArray<const char*>& strings, const char* name) {
379 return ShouldSkipImpl(strings, name);
381 bool SkCommandLineFlags::ShouldSkip(const StringArray& strings, const char* name) {
382 return ShouldSkipImpl(strings, name)
[all...] |
| /prebuilts/tools/common/fest/ |
| fest-util-1.1.3.jar | |
| /external/icu/icu4c/source/common/ |
| uniset.cpp | 147 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
174 bufferCapacity(0), patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
201 patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
225 patLen(0), pat(NULL), strings(NULL), stringSpan(NULL),
238 if (strings != NULL && o.strings != NULL) {
239 strings->assign(*o.strings, cloneUnicodeString, status);
240 } else { // Invalid strings.
264 delete strings;
[all...] |
| uresdata.h | 42 * All values are URES_STRING_V2 strings.
46 /** Resource type constant for 16-bit Unicode strings in formatVersion 2. */
51 * All values are URES_STRING_V2 strings.
93 URES_INDEX_KEYS_TOP, /* [1] contains the top of the key strings, */
94 /* same as the bottom of resources or UTF-16 strings, rounded up */
121 * A pool bundle provides key strings that are shared among several other bundles
134 * values stored in a new array of 16-bit units between the table key strings
138 * Multiple Unicode strings may use the same offset and string data,
141 * to the second character. (Short strings-v2 are NUL-terminated
148 * A resource bundle may use a special pool bundle. Some or all of the table key strings
[all...] |
| udataswp.h | 65 * output charset strings
121 * Compare invariant-character strings, one in the output data and the
123 * An output data string is compared because strings are usually swapped
126 * You can use -1 for the length parameters of NUL-terminated strings as usual.
249 * Swap a block of invariant, NUL-terminated strings, but not padding
268 * Swap invariant char * strings ASCII->EBCDIC.
277 * Copy invariant ASCII char * strings and verify they are invariant.
286 * Swap invariant char * strings EBCDIC->ASCII.
295 * Copy invariant EBCDIC char * strings and verify they are invariant.
|
| /external/icu/icu4c/source/common/unicode/ |
| unorm.h | 96 * It allows to work on strings that are not necessarily normalized
100 * It is not a normalization form because it does not provide for uniqueness of representation. Multiple strings
110 * return UNORM_YES for most strings in practice.
119 * Beyond collation and string search, normalized strings may be useful for string equivalence comparisons,
316 * Another example: When one wants to concatenate two normalized strings and get a
420 * Concatenate normalized strings, making sure that the result is normalized as well.
422 * If both the left and the right strings are in
430 * With the input strings already being normalized,
432 * to find the adjacent end pieces of the input strings.
434 * then concatenated with the remaining parts of the input strings
[all...] |
| /bionic/libc/arch-arm/cortex-a15/bionic/ |
| strcmp.S | 68 For example, if the strings are identical and the string-terminator
78 of strings separately. */
82 * The fast path: if both strings are double-word aligned,
84 * If the strings have the same offset from a word boundary,
87 This is optimized for quick return on short unaligned strings.
88 * If the strings have the same offset from a double-word boundary,
90 * If the strings do not have the same offset from a double-word boundary,
95 * If the strings do not have the same offset from a word boundary,
165 /* Are both strings double-word aligned? */
175 /* Get here when the strings to compare are double-word aligned. *
[all...] |
| /bionic/libc/arch-arm/krait/bionic/ |
| strcmp.S | 68 For example, if the strings are identical and the string-terminator
78 of strings separately. */
82 * The fast path: if both strings are double-word aligned,
84 * If the strings have the same offset from a word boundary,
87 This is optimized for quick return on short unaligned strings.
88 * If the strings have the same offset from a double-word boundary,
90 * If the strings do not have the same offset from a double-word boundary,
95 * If the strings do not have the same offset from a word boundary,
165 /* Are both strings double-word aligned? */
175 /* Get here when the strings to compare are double-word aligned. *
[all...] |
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| ASN1GeneralizedTime.java | 12 import org.bouncycastle.util.Strings;
93 this.time = Strings.toByteArray(time);
116 this.time = Strings.toByteArray(dateF.format(time));
134 this.time = Strings.toByteArray(dateF.format(time));
150 return Strings.fromByteArray(time);
168 String stime = Strings.fromByteArray(time);
247 String stime = Strings.fromByteArray(time);
|
| /external/google-breakpad/src/common/ |
| dwarf_cfi_to_module.h | 119 // Given STRINGS, an array of C strings with SIZE elements, return an
121 static vector<string> MakeVector(const char * const *strings, size_t size);
185 // popular ones). Many, many rules cite these strings.
188 // A set of strings used by this CFI. Before storing a string in one of
193 // strings from this set, even if passed by value, assigned, or held
195 // causes those strings to share a single instance of each distinct piece
|
| /external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
| CDL.java | 76 * Produce a JSONArray of strings from a row of comma delimited values.
78 * @return A JSONArray of strings.
107 * parallel JSONArray of strings to provides the names of the elements.
146 * @param names A JSONArray of strings.
159 * @param names A JSONArray of strings.
187 * @param ja A JSONArray of strings.
242 * @param names A JSONArray of strings.
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| UnicodeSetIterator.java | 15 * multicharacter strings of the UnicodSet, if any.
17 * <p>To iterate over code points and multicharacter strings,
103 * followed by all strings sorted order. <tt>codepointEnd</tt> is
148 * order, followed by all strings sorted order. Ranges are
212 if (set.strings != null) {
213 stringIterator = set.strings.iterator();
261 * Invariant: stringIterator is null when there are no (more) strings remaining
|
| /external/icu/icu4j/main/tests/framework/src/com/ibm/icu/dev/util/ |
| UnicodeMapIterator.java | 18 * multicharacter strings of the UnicodSet, if any.
107 * followed by all strings sorted order. <tt>codepointEnd</tt> is
148 * order, followed by all strings sorted order. Ranges are
208 Set<String> strings = map.getNonRangeStrings(); local
209 if (strings != null) {
210 stringIterator = strings.iterator();
237 * Invariant: stringIterator is null when there are no (more) strings remaining
|
| /frameworks/support/v14/preference/src/android/support/v14/preference/ |
| MultiSelectListPreference.java | 39 * This preference will store a set of strings into the SharedPreferences.
83 * Attempts to persist a set of Strings to the {@link android.content.SharedPreferences}.
86 * the {@link android.preference.PreferenceManager}, put in the strings, and check if we should
114 * Attempts to get a persisted set of Strings from the
297 String[] strings = new String[size]; local
298 source.readStringArray(strings);
300 Collections.addAll(values, strings);
|
| /external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
| MapsTest.java | 560 Set<String> strings = ImmutableSet.of("one", "two", "three"); local
561 Map<String, Integer> map = Maps.asMap(strings, LENGTH_FUNCTION);
572 Set<String> strings = Sets.newLinkedHashSet(); local
573 Collections.addAll(strings, "one", "two", "three");
574 Map<String, Integer> map = Maps.asMap(strings, LENGTH_FUNCTION);
577 strings.add("four");
583 Set<String> strings = Sets.newLinkedHashSet(); local
584 Collections.addAll(strings, "one", "two", "three");
585 Map<String, Integer> map = Maps.asMap(strings, LENGTH_FUNCTION);
588 ASSERT.that(strings).has().exactly("one", "three").inOrder()
592 Set<String> strings = ImmutableSet.of(); local
615 SortedSet<String> strings = new NonNavigableSortedSet(); local
634 SortedSet<String> strings = new NonNavigableSortedSet(); local
662 SortedSet<String> strings = new NonNavigableSortedSet(); local
696 SortedSet<String> strings = new NonNavigableSortedSet(); local
704 Iterable<String> strings = ImmutableList.of("one", "two", "three"); local
714 Iterator<String> strings = ImmutableList.of("one", "two", "three").iterator(); local
724 Iterable<String> strings = ImmutableList.of("one", "two", "three", "two", "one"); local
734 Iterable<String> strings = Arrays.asList("one", null, "three"); local
743 Iterable<String> strings = ImmutableList.of("one", "two", "three"); local
[all...] |
| /external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/ |
| ParcelTest.java | 148 final String[] strings = {"foo", "bar"}; local
149 parcel.writeStringArray(strings);
151 final String[] strings2 = new String[strings.length];
153 assertTrue(Arrays.equals(strings, strings2));
342 final String[] strings = { "foo", "bar" }; local
343 parcel.writeStringArray(strings);
346 assertTrue(Arrays.equals(strings, strings2));
351 final List<String> strings = Arrays.asList( "foo", "bar" ); local
352 parcel.writeStringList(strings);
356 assertEquals(strings, extractedStrings)
361 final List<String> strings = Arrays.asList( "foo", "bar" ); local
[all...] |
| /frameworks/base/docs/html-intl/intl/ko/distribute/tools/ |
| localization-checklist.jd | 15 <li><a href="#manage-strings">3. ???? ?? ??? ??</a></li>
16 <li><a href="#translate-strings">4. UI ??? ? ?? ??? ??</a></li>
226 <h2 id="manage-strings">
239 <strong>?? ???? strings.xml? ??</strong>
243 ?? ??? ? ???? ?????? ????. ?? <em>??</em> ???? ?? strings.xml ???? ???? ???? ???? ? ???? ?? ?????.
245 strings.xml ??? ???? ???? ??? ???? ?? (??? ???? ????) ???? ???? ?? ?? ??? ? ????.
251 ???? ??? ???? ???? ?? ?? ???? strings.xml? ?? ?? ?? ???? ?? ??????.
284 strings.xml ???? ???? ??? ?, ?? ???? ??? ????? ??????.
398 <h2 id="translate-strings">
422 ?? ??? ????? ??? ??? ????? strings.xml ??? ????? ???? ???? ??? ???? ??????
[all...] |
| /frameworks/base/docs/html-intl/intl/ru/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>
244 <em>???</em> ?????? ? ???????? ???????? ?????? ????? strings.xml
245 ? ??? ???????? ???????? ?????????? ? ???????????. ?????? ? ????? strings.xml ?????
252 strings.xml ? ???????? ??????????? ?????? ????? ????????.
284 ??? ?????????? ????? ? ????? strings.xml ??????????? ??????? ????????,
398 <h2 id="translate-strings">
423 ????? ??? ???? strings.xml ??? ?????? ???????????, ????? ? ??????
[all...] |
| /frameworks/base/docs/html-intl/intl/zh-tw/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...] |
| /cts/hostsidetests/devicepolicy/app/DeviceAndProfileOwner/src/com/android/cts/deviceandprofileowner/ |
| ApplicationRestrictionsTest.java | 155 String[] strings = bundle.getStringArray("string[]"); local
156 assertTrue(strings != null && strings.length == testStrings.length);
157 for (int i = 0; i < strings.length; i++) {
158 assertEquals(strings[i], testStrings[i]);
|
| /dalvik/dx/src/com/android/dx/command/findusages/ |
| FindUsages.java | 52 List<String> strings = dex.strings(); local
53 for (int i = 0; i < strings.size(); ++i) {
54 String string = strings.get(i);
104 return className + "." + dex.strings().get(methodId.getNameIndex());
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMStringPool.java | 28 /** <p>DTMStringPool is an "interning" mechanism for strings. It will
31 * uniquely identify (and when necessary retrieve) the strings.</p>
51 * .hashCode() and .equals() operations. The API enforces Strings because
76 // -sb Add this to force empty strings to be index 0.
139 * from zero, as new unique strings are encountered.
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| StringVector.java | 24 * A very simple table that stores a list of strings, optimized
35 /** @serial Array of strings this contains */
38 /** @serial Number of strings this contains */
72 * @return Number of strings in the list
82 * @return Number of strings in the list
|
| /external/e2fsprogs/po/ |
| at-expand.pl | 4 "#. The strings in e2fsck's problem.c can be very hard to translate,\n",
5 "#. since the strings are expanded in two different ways. First of all,\n",
6 "#. there is an \@-expansion, where strings like \"\@i\" are expanded to\n",
9 "#. the \@-expansion, for the strings in the problem.c file.\n",
12 "#. choose, by providing translations for strings in e2fsck/message.c.\n",
|
