/external/clang/test/Sema/Inputs/ |
pragma-arc-cf-code-audited.h | 16 #pragma clang arc_cf_code_audited begin
|
/external/oprofile/libregex/ |
demangle_java_symbol.cpp | 40 string::const_iterator & begin, string::const_iterator end); 42 string::const_iterator & begin, string::const_iterator end); 46 string::const_iterator & begin, string::const_iterator end) 50 if (begin == end) 53 switch (*begin) { 66 ++begin; 72 string::const_iterator & begin, string::const_iterator end) 74 if (base_type(result, begin, end)) 77 if (object_type(result, begin, end)) 80 if (array_type(result, begin, end) [all...] |
/external/clang/test/Sema/ |
pragma-arc-cf-code-audited.c | 3 #pragma clang arc_cf_code_audited foo // expected-error {{expected 'begin' or 'end'}} 5 #pragma clang arc_cf_code_audited begin foo // expected-warning {{extra tokens at end of #pragma directive}} 10 #pragma clang arc_cf_code_audited begin // expected-note {{#pragma entered here}} 11 #pragma clang arc_cf_code_audited begin // expected-error {{already inside '#pragma clang arc_cf_code_audited'}} expected-note {{#pragma entered here}} 18 #pragma clang arc_cf_code_audited begin // expected-error {{'#pragma clang arc_cf_code_audited' was not ended within this file}}
|
/external/webkit/Source/JavaScriptCore/wtf/url/src/ |
URLComponent.h | 38 URLComponent(int begin, int length) : m_begin(begin), m_length(length) { } 40 // Helper that returns a component created with the given begin and ending 42 static inline URLComponent fromRange(int begin, int end) 44 return URLComponent(begin, end - begin); 62 int begin() const { return m_begin; } function in class:WTF::URLComponent 63 void setBegin(int begin) { m_begin = begin; }
|
URLSegments.cpp | 52 return scheme.begin(); 60 return username.begin(); 66 return password.begin(); 72 return host.begin(); 78 return port.begin() - 1; // Back over delimiter. 80 return port.begin(); // Don't want delimiter counted. 86 return path.begin(); 92 return query.begin() - 1; // Back over delimiter. 94 return query.begin(); // Don't want delimiter counted. 100 return fragment.begin(); // Back over delimiter [all...] |
/external/libusb-compat/libusb/ |
usbi.h | 25 #define LIST_ADD(begin, ent) \ 27 if (begin) { \ 28 ent->next = begin; \ 33 begin = ent; \ 36 #define LIST_DEL(begin, ent) \ 41 begin = ent->next; \
|
/external/valgrind/main/none/tests/ |
pth_mutexspeed.stdout.exp | 0 begin 100000 lock--unlocks
|
/external/icu4c/common/ |
chariter.cpp | 22 : textLength(0), pos(0), begin(0), end(0) { 26 : textLength(length), pos(0), begin(0), end(length) { 33 : textLength(length), pos(position), begin(0), end(length) { 45 : textLength(length), pos(position), begin(textBegin), end(textEnd) { 49 if(begin < 0) { 50 begin = 0; 51 } else if(begin > textLength) { 52 begin = textLength; 54 if(end < begin) { 55 end = begin; [all...] |
/external/linux-tools-perf/util/include/linux/ |
list.h | 18 * @begin: first element in the range to delete from the list. 23 static inline void list_del_range(struct list_head *begin, 26 begin->prev->next = end->next; 27 end->next->prev = begin->prev;
|
/external/astl/include/ |
algorithm | 128 // fill the range [begin, end) with copies of value, return nothing. 129 // fill_n the range [begin, begin + n) with copies of value, return 130 // the pointer at begin + n. 133 // begin and end params. Fix this when iterator are defined. 137 template<typename _T> static void fill(_T *begin, const _T *end, 140 for (; begin < end; ++begin) 141 *begin = value; 147 template<typename _T> static void fill(_T *begin, const _T *end [all...] |
/external/chromium/chrome/browser/extensions/ |
extension_i18n_api.cc | 34 size_t begin = 0; local 37 end = acceptLanguages.find(',', begin); 38 if (end > begin) { 40 string16 acceptLang = acceptLanguages.substr(begin, end - begin); 44 begin = end + 1; 45 // 'begin >= acceptLanguages.length()' to guard against a value 47 if (end == string16::npos || begin >= acceptLanguages.length())
|
/external/protobuf/src/google/protobuf/stubs/ |
stl_util-inl.h | 52 void STLDeleteContainerPointers(ForwardIterator begin, 54 while (begin != end) { 55 ForwardIterator temp = begin; 56 ++begin; 85 return str->empty() ? NULL : &*str->begin(); 90 // hash_set, or any other STL container which defines sensible begin(), end(), 101 STLDeleteContainerPointers(container->begin(), container->end()); 112 for (typename T::iterator i = v->begin(); i != v->end(); ++i) {
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
range_access.h | 48 begin(_Container& __cont) -> decltype(__cont.begin()) 49 { return __cont.begin(); } 58 begin(const _Container& __cont) -> decltype(__cont.begin()) 59 { return __cont.begin(); } 87 begin(_Tp (&__arr)[_Nm])
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
range_access.h | 48 begin(_Container& __cont) -> decltype(__cont.begin()) 49 { return __cont.begin(); } 58 begin(const _Container& __cont) -> decltype(__cont.begin()) 59 { return __cont.begin(); } 87 begin(_Tp (&__arr)[_Nm])
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
sort.h | 61 parallel_sort(RandomAccessIterator begin, RandomAccessIterator end, 67 * @param begin Begin iterator of input sequence. 74 parallel_sort(RandomAccessIterator begin, RandomAccessIterator end, 77 _GLIBCXX_CALL(end - begin) 81 (begin, end, comp, parallelism.get_num_threads()); 84 (begin, end, comp, parallelism.get_num_threads()); 90 * @param begin Begin iterator of input sequence. 97 parallel_sort(RandomAccessIterator begin, RandomAccessIterator end [all...] |
checkers.h | 42 * @brief Check whether @c [begin, @c end) is sorted according to @c comp. 43 * @param begin Begin iterator of sequence. 51 is_sorted(InputIterator begin, InputIterator end, 56 if (begin == end) 59 InputIterator current(begin), recent(begin); 78 * @brief Check whether @c [begin, @c end) is sorted according to @c comp. 80 * @param begin Begin iterator of sequence [all...] |
/external/stlport/test/unit/ |
perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0); 56 prev_permutation(v1.begin(), v1.end()); 60 prev_permutation(v1.begin(), v1.end()); 64 prev_permutation(v1.begin(), v1.end()); 68 prev_permutation(v1.begin(), v1.end()); 72 prev_permutation(v1.begin(), v1.end()); 76 prev_permutation(v1.begin(), v1.end()); 80 prev_permutation(v1.begin(), v1.end()); 84 prev_permutation(v1.begin(), v1.end()); 88 prev_permutation(v1.begin(), v1.end()) [all...] |
rndshf_test.cpp | 56 __iota(v1.begin(), v1.end(), 0); 61 random_shuffle(v1.begin(), v1.end(), r); 62 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 0)==1); 63 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 1)==1); 64 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 2)==1); 65 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 3)==1); 66 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 4)==1); 67 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 5)==1); 68 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 6)==1); 69 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 7)==1) [all...] |
/ndk/tests/device/test-gnustl-full/unit/ |
perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0); 56 prev_permutation(v1.begin(), v1.end()); 60 prev_permutation(v1.begin(), v1.end()); 64 prev_permutation(v1.begin(), v1.end()); 68 prev_permutation(v1.begin(), v1.end()); 72 prev_permutation(v1.begin(), v1.end()); 76 prev_permutation(v1.begin(), v1.end()); 80 prev_permutation(v1.begin(), v1.end()); 84 prev_permutation(v1.begin(), v1.end()); 88 prev_permutation(v1.begin(), v1.end()) [all...] |
rndshf_test.cpp | 56 __iota(v1.begin(), v1.end(), 0); 61 random_shuffle(v1.begin(), v1.end(), r); 62 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 0)==1); 63 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 1)==1); 64 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 2)==1); 65 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 3)==1); 66 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 4)==1); 67 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 5)==1); 68 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 6)==1); 69 CPPUNIT_ASSERT(count(v1.begin(), v1.end(), 7)==1) [all...] |
/ndk/tests/device/test-stlport/unit/ |
perm_test.cpp | 54 __iota(v1.begin(), v1.end(), 0); 56 prev_permutation(v1.begin(), v1.end()); 60 prev_permutation(v1.begin(), v1.end()); 64 prev_permutation(v1.begin(), v1.end()); 68 prev_permutation(v1.begin(), v1.end()); 72 prev_permutation(v1.begin(), v1.end()); 76 prev_permutation(v1.begin(), v1.end()); 80 prev_permutation(v1.begin(), v1.end()); 84 prev_permutation(v1.begin(), v1.end()); 88 prev_permutation(v1.begin(), v1.end()) [all...] |
/external/clang/test/PCH/ |
cxx-for-range.h | 4 int *begin(); 9 char *begin(T); 14 char *begin(U);
|
/external/elfutils/libdw/ |
dwarf_haspc.c | 65 Dwarf_Addr begin; local 69 &begin, &end)) > 0) 70 if (pc >= begin && pc < end)
|
/external/v8/src/ |
v8conversions.cc | 87 const char* begin = SeqAsciiString::cast(str)->GetChars(); local 88 const char* end = begin + str->length(); 89 return InternalStringToDouble(unicode_cache, begin, end, flags, 92 const uc16* begin = SeqTwoByteString::cast(str)->GetChars(); local 93 const uc16* end = begin + str->length(); 94 return InternalStringToDouble(unicode_cache, begin, end, flags, 112 const char* begin = SeqAsciiString::cast(str)->GetChars(); local 113 const char* end = begin + str->length(); 114 return InternalStringToInt(unicode_cache, begin, end, radix); 116 const uc16* begin = SeqTwoByteString::cast(str)->GetChars() local [all...] |
/external/webkit/Source/WebCore/platform/leveldb/ |
LevelDBSlice.h | 38 LevelDBSlice(const char* begin, const char* end) 39 : m_begin(begin) 56 const char* begin() const { return m_begin; } function in class:WebCore::LevelDBSlice
|