/ndk/sources/cxx-stl/stlport/stlport/stl/ |
H A D | _unordered_set.h | 147 size_type count(const _KT& __key) const { return _M_ht.count(__key); } function in class:unordered_set 297 size_type count(const _KT& __key) const { return _M_ht.count(__key); } function in class:unordered_multiset
|
H A D | _map.h | 214 size_type count(const _KT& __x) const { return _M_t.find(__x) == _M_t.end() ? 0 : 1; } function in class:map 390 size_type count(const _KT& __x) const { return _M_t.count(__x); } function in class:multimap
|
H A D | _set.h | 193 size_type count(const _KT& __x) const function in class:set 365 size_type count(const _KT& __x) const { return _M_t.count(__x); } function in class:multiset
|
H A D | _hash_map.h | 208 size_type count(const _KT& __key) const { return _M_ht.count(__key); } function in class:hash_map 393 size_type count(const _KT& __key) const { return _M_ht.count(__key); } function in class:hash_multimap
|
H A D | _hash_set.h | 202 size_type count(const _KT& __key) const { return _M_ht.count(__key); } function in class:hash_set 384 size_type count(const _KT& __key) const { return _M_ht.count(__key); } function in class:hash_multiset
|
H A D | _fstream.h | 91 : count(__first, __last, '\n') + (__last - __first);
|
H A D | _hashtable.h | 516 size_type count(const _KT& __key) const { function in class:hashtable
|
H A D | _algo.h | 106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { function
|
H A D | _algobase.h | 179 // a for loop with an explicit count. 653 // count 656 count(_InputIter __first, _InputIter __last, const _Tp& __val) { function
|
H A D | _bitset.h | 581 size_t count() const { return this->_M_do_count(); } function in class:bitset
|
H A D | _tree.h | 596 size_type count(const _KT& __x) const { function in class:_Rb_tree
|
/ndk/sources/host-tools/make-3.81/ |
H A D | implicit.c | 131 int count; 156 for (count = 0; *p != '\0'; ++p) 159 ++count; 160 else if (*p == closeparen && --count < 0) 129 int count; local
|
H A D | variable.c | 326 /* Remember how many variables are in our current count. Since we never 1289 int count; 1300 count = 0; 1304 ++count; 1305 else if (*p == closeparen && --count < 0) 1277 int count; local
|
H A D | job.c | 413 the dead children. In this case we don't need the dead_children count. 416 use the dead_children count to reap children as best we can. */ 497 child_handler() above, this count is completely unimportant for 500 pre-POSIX systems. We keep the count only because... it's there... 1545 int count; 1551 count = 0; 1554 if (*in == closeparen && --count < 0) 1592 ++count; 1539 int count; local
|
H A D | read.c | 1368 /* If this is another 'define', increment the level count. */ 1373 /* If this is an 'endef', decrement the count. If it's now 0, 1604 int count = 0; 1607 ++count; 1609 --count; 1610 else if (*line == ',' && count <= 0) 1649 register int count = 0; 1654 ++count; 1657 if (count <= 0) 1660 --count; 1598 int count = 0; local 1643 register int count = 0; local 2737 int count; local [all...] |
H A D | vmsjobs.c | 247 short int status, count; member in struct:__anon147
|
/ndk/sources/host-tools/sed-4.2.1/testsuite/ |
H A D | dc.sed | 63 /|?[XZz]/b count 146 : count
|
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
H A D | _hashtable.h | 268 size_type count(const _KT& __key) const { return _M_non_dbg_impl.count(__key); } function in class:hashtable
|
H A D | _tree.h | 170 size_type count(const _KT& __x) const { return _M_non_dbg_impl.count(__x); } function in class:_Rb_tree
|
/ndk/sources/host-tools/sed-4.2.1/lib/ |
H A D | unistd.in.h | 564 extern ssize_t write (int fd, const void *buf, size_t count);
|
/ndk/sources/host-tools/sed-4.2.1/sed/ |
H A D | execute.c | 1185 countT count = 0; /* number of matches found */ 1240 if ((matched > 0 || count == 0 || offset > last_end) 1241 && ++count >= sub->numb) 1287 if (count < sub->numb) 1178 countT count = 0; /* number of matches found */ local
|
/ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
H A D | _set.h | 269 size_type count(const _KT& __x) const function in class:set 524 size_type count(const _KT& __x) const function in class:multiset 525 { return _M_t.count(cast_traits::to_storage_type_crefT(__x)); }
|
/ndk/sources/host-tools/sed-4.2.1/build-aux/ |
H A D | texinfo.tex | 1531 \dopdfoutline{##1}{count-\expnumber{chap##2}}{##3}{##4}}% 1533 \dopdfoutline{##1}{count-\expnumber{sec##2}}{##3}{##4}}% 1535 \dopdfoutline{##1}{count-\expnumber{subsec##2}}{##3}{##4}}% 1536 \def\numsubsubsecentry##1##2##3##4{% count is always zero 3860 % A count to remember the depth of nesting. 3892 % example, to count as an @ifset for nesting.) 4966 % \unnumberedno is an oxymoron, of course. But we count the unnumbered 5031 \newcount\secbase\secbase=0 % @raisesections/@lowersections modify this count 6323 % make each space count 6360 % make each space count [all...] |