HomeSort by relevance Sort by last modified time
    Searched full:__n2 (Results 1 - 6 of 6) sorted by null

  /external/bluetooth/glib/glib/
gtestutils.h 40 #define g_assert_cmpint(n1, cmp, n2) do { gint64 __n1 = (n1), __n2 = (n2); \
41 if (__n1 cmp __n2) ; else \
43 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'i'); } while (0)
44 #define g_assert_cmpuint(n1, cmp, n2) do { guint64 __n1 = (n1), __n2 = (n2); \
45 if (__n1 cmp __n2) ; else \
47 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'i'); } while (0)
48 #define g_assert_cmphex(n1, cmp, n2) do { guint64 __n1 = (n1), __n2 = (n2); \
49 if (__n1 cmp __n2) ; else \
51 #n1 " " #cmp " " #n2, __n1, #cmp, __n2, 'x'); } while (0)
52 #define g_assert_cmpfloat(n1,cmp,n2) do { long double __n1 = (n1), __n2 = (n2);
    [all...]
  /external/stlport/stlport/stl/
_slist.c 74 const _Node_base* __n2 = __x._M_head._M_data._M_next;
75 while (__n1 && __n2) {
76 __STATIC_CAST(_Node*, __n1)->_M_data = __STATIC_CAST(const _Node*, __n2)->_M_data;
79 __n2 = __n2->_M_next;
81 if (__n2 == 0)
84 _M_insert_after_range(__p1, const_iterator(__CONST_CAST(_Node_base*, __n2)),
_string_sum.h 170 _BString& replace(size_type __pos1, size_type __n1, const _BString& __s, size_type __pos2, size_type __n2)
171 {return _M_get_storage().replace(__pos1, __n1, __s, __pos2, __n2);}
172 _BString& replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2)
173 {return _M_get_storage().replace(__pos, __n1, __s, __n2);}
176 _BString& replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c)
177 {return _M_get_storage().replace(__pos, __n1, __n2, __c);}
243 int compare(size_type __pos1, size_type __n1, const _Self& __s, size_type __pos2, size_type __n2) const
244 { return _M_get_storage().compare(__pos1, __n1, __s, __pos2, __n2); }
249 int compare(size_type __pos1, size_type __n1, const _CharT* __s, size_type __n2) const
250 { return _M_get_storage().compare(__pos1, __n1, __s, __n2); }
    [all...]
_string.h 825 size_type __pos2, size_type __n2) {
831 const size_type __len2 = (min) (__n2, __size2 - __pos2);
839 const _CharT* __s, size_type __n2) {
845 if (__n2 > max_size() - (__size - __len))
848 __s, __s + __n2, _M_inside(__s));
857 size_type __n2, _CharT __c) {
862 if (__n2 > max_size() - (__size - __len))
864 return replace(begin() + __pos, begin() + __pos + __len, __n2, __c);
1074 const ptrdiff_t __n2 = __l2 - __f2; local
    [all...]
_string_workaround.h 478 size_type __pos2, size_type __n2) {
479 _Base::replace(__pos1, __n1, __s, __pos2, __n2);
484 const _CharT* __s, size_type __n2) {
486 _Base::replace(__pos, __n1, __s, __n2);
497 size_type __n2, _CharT __c) {
498 _Base::replace(__pos, __n1, __n2, __c);
  /external/stlport/stlport/stl/debug/
_string.h 523 size_type __pos2, size_type __n2) {
525 _M_non_dbg_impl.replace(__pos1, __n1, __s._M_non_dbg_impl, __pos2, __n2);
530 _Self& replace(size_type __pos, size_type __n1, const _CharT* __s, size_type __n2) {
534 _M_non_dbg_impl.replace(__pos, __n1, __s, __n2);
548 _Self& replace(size_type __pos, size_type __n1, size_type __n2, _CharT __c) {
550 _M_non_dbg_impl.replace(__pos, __n1, __n2, __c);
656 size_type __pos2, size_type __n2) const
657 { return _M_non_dbg_impl.compare(__pos1, __n1, __s._M_non_dbg_impl, __pos2, __n2); }
667 size_type __n2) const {
669 return _M_non_dbg_impl.compare(__pos1, __n1, __s, __n2);
    [all...]

Completed in 196 milliseconds