Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:pair (Results 401 - 425 of 1449) sorted by null

<<11121314151617181920>>

/external/stlport/etc/
autoexp.dat	425 ; stlport::pair 427 stlp_std::pair<*,*>|stlpx_std::pair<*,*>|stlpmtx_std::pair<*,*>|stlpxmtx_std::pair<*,*>|stlpd_std::pair<*,*>|stlpdx_std::pair<*,*>|stlpdmtx_std::pair<*,*>|stlpdxmtx_std::pair<*,*>{
/external/icu4c/common/unicode/
ucnv_err.h	335 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 341 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 347 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 353 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 359 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as
utf16.h	299 * If a surrogate pair is written, checks for sufficient space in the string. 399 * If the offset points to the trail surrogate of a surrogate pair, 418 * If the offset points to the trail surrogate of a surrogate pair, 576 * If the offset is behind the lead surrogate of a surrogate pair, 595 * If the offset is behind the lead surrogate of a surrogate pair,
/external/icu4c/common/
ustrcase.c	256 * #29, "Text Boundaries." Between each pair of word boundaries, find the first 821 /* advance beyond source surrogate pair if it case-folds */ 866 /* advance beyond source surrogate pair if it case-folds */ 928 /* part of a surrogate pair, leave >=d800 */ 938 /* part of a surrogate pair, leave >=d800 */
/external/jpeg/
jdmerge.c	15 * calculating all the output pixels corresponding to a pair of chroma 20 * only the Y term varies among the group of pixels corresponding to a pair 272 /* Loop for each pair of output pixels */ 333 /* Loop for each pair of output pixels */ 399 /* Loop for each pair of output pixels */
/external/qemu/hw/
bt-sdp.c	37 void *pair; member in struct:bt_l2cap_sdp_state_s::sdp_service_record_s::sdp_service_attribute_s 307 memcpy(lst + len, record->attribute_list[i].pair, 451 memcpy(lst + len, record->attribute_list[j].pair, 571 qemu_free(sdp->service_list[i].attribute_list->pair); 721 record->attribute_list[record->attributes].pair = data;
/external/webkit/JavaScriptCore/icu/unicode/
ucnv_err.h	328 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 334 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 340 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 346 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 352 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as
utf16.h	290 * If a surrogate pair is written, checks for sufficient space in the string. 390 * If the offset points to the trail surrogate of a surrogate pair, 409 * If the offset points to the trail surrogate of a surrogate pair, 567 * If the offset is behind the lead surrogate of a surrogate pair, 586 * If the offset is behind the lead surrogate of a surrogate pair,
/external/webkit/JavaScriptGlue/icu/unicode/
ucnv_err.h	328 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 334 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 340 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 346 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 352 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as
utf16.h	290 * If a surrogate pair is written, checks for sufficient space in the string. 390 * If the offset points to the trail surrogate of a surrogate pair, 409 * If the offset points to the trail surrogate of a surrogate pair, 567 * If the offset is behind the lead surrogate of a surrogate pair, 586 * If the offset is behind the lead surrogate of a surrogate pair,
/external/webkit/WebCore/icu/unicode/
ucnv_err.h	328 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 334 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 340 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 346 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as 352 * Note that codeUnit(32bit int eg: unit of a surrogate pair) is represented as
utf16.h	290 * If a surrogate pair is written, checks for sufficient space in the string. 390 * If the offset points to the trail surrogate of a surrogate pair, 409 * If the offset points to the trail surrogate of a surrogate pair, 567 * If the offset is behind the lead surrogate of a surrogate pair, 586 * If the offset is behind the lead surrogate of a surrogate pair,
/external/webkit/WebKit/mac/icu/unicode/
utf16.h	290 * If a surrogate pair is written, checks for sufficient space in the string. 390 * If the offset points to the trail surrogate of a surrogate pair, 409 * If the offset points to the trail surrogate of a surrogate pair, 567 * If the offset is behind the lead surrogate of a surrogate pair, 586 * If the offset is behind the lead surrogate of a surrogate pair,
/frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/
ualgo.h	63 /// Returns the pointer to the first pair of unequal elements. 67 pair<InputIterator,InputIterator> 421 /// Returns pair<lower_bound,upper_bound> 425 inline pair<ForwardIterator,ForwardIterator> equal_range (ForwardIterator first, ForwardIterator last, const LessThanComparable& value) 427 pair<ForwardIterator,ForwardIterator> rv;
upredalgo.h	64 /// Returns the pointer to the first pair of unequal elements. 69 inline pair<InputIterator,InputIterator> 258 /// Returns pair<lower_bound,upper_bound> 263 inline pair<ForwardIterator,ForwardIterator> equal_range (ForwardIterator first, ForwardIterator last, const T& value, StrictWeakOrdering comp) 265 pair<ForwardIterator,ForwardIterator> rv;
/dalvik/libcore/concurrent/src/test/java/tests/api/java/util/concurrent/
ConcurrentHashMapTest.java	255 * putIfAbsent does not add the pair if the key is already present 303 * remove removes the correct key-value pair from the map 313 * remove(key,value) removes only if pair present
/dalvik/vm/mterp/x86-atom/
header.S	261 * Macros pair attempts to speed up FETCH_INST, GET_INST_OPCODE and GOTO_OPCODE 276 * Macro pair attempts to speed up FETCH_INST, GET_INST_OPCODE and GOTO_OPCODE 330 * Macro pair attempts to speed up FETCH_INST, GET_INST_OPCODE and GOTO_OPCODE
/external/icu4c/i18n/
olsontz.h	53 * given by the offset list, which will contain exactly one pair. 55 * the associated offset pair is in effect. 58 * DST offset, in units of seconds. There will be at least one pair
transreg.h	326 * source-target pair. There is always at least one variant: If 333 * source-target pair. 340 * pair. If NO_VARIANT is one of the variants, then it will be
/external/skia/src/ports/
SkFontHost_android.cpp	226 NameFamilyPair* pair = &list[i]; local 227 if (pair->fFamily == emptyFamily) { 228 pair->destruct();
/external/stlport/test/unit/
set_test.cpp	72 pair<int_set::iterator, bool> p = s.insert(42); 131 pair<set<int>::iterator, set<int>::iterator> pit; 132 pair<set<int>::const_iterator, set<int>::const_iterator> pcit;
/external/webkit/WebCore/platform/network/qt/
QNetworkReplyHandler.cpp	321 foreach (const QNetworkReply::RawHeaderPair& pair, m_reply->rawHeaderPairs()) { 322 response.setHTTPHeaderField(QString::fromAscii(pair.first), QString::fromAscii(pair.second));
/external/webkit/WebKit/chromium/public/
WebKitClient.h	156 // generated key pair and the supplied challenge string. keySizeindex 212 // An event is identified by the pair (name, id). The extra parameter 217 // Generic callback for reporting histogram data. Range is identified by the min, max pair.
/system/core/adb/
jdwp_service.c	41 - first, it calls socketpair() to create a pair of equivalent 44 - it attaches the first socket in the pair to a local socket 389 D("%s: socket pair creation failed: %s\n",
/external/opencore/fileformats/id3parcom/include/
pv_id3_parcom.h	187 * @param aFrame Output parameter to store key-value pair containing data of requested ID3 frame. 669 * @brief allocate memeory for key value pair structure. 674 * @return shared pointer to key value pair structure 715 * @brief This function is costructing the key-value pair for AlbumArt(apic/pic) frame. It     [all...]

Completed in 88 milliseconds

<<11121314151617181920>>