Searched defs:__on_left (Results 1 - 8 of 8) sorted by relevance

/prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/
H A D_tree.c344 // act like __on_left and ignore a portion of the if conditions -- specify
345 // __on_right != 0 to bypass comparison as false or __on_left != 0 to bypass
352 _Rb_tree_node_base * __on_left,
365 ( __on_left != 0 || // If __on_left != 0, the remainder succeeds to true
350 _M_insert(_Rb_tree_node_base * __parent, const _Value& __val, _Rb_tree_node_base * __on_left, _Rb_tree_node_base * __on_right) argument
H A D_string_sum.h80 struct __on_left {}; struct
123 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __bstr_wrapper<_CharT, _Traits, _Alloc>, __on_left> _BStrOnLeft;
126 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __cstr_wrapper<_CharT>, __on_left> _CStrOnLeft;
129 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __char_wrapper<_CharT>, __on_left> _CharOnLeft;
259 __on_left const& /*StorageDir*/)
277 bool __do_init, __on_left const& /*StorageDir*/) const
/prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/
H A D_tree.c344 // act like __on_left and ignore a portion of the if conditions -- specify
345 // __on_right != 0 to bypass comparison as false or __on_left != 0 to bypass
352 _Rb_tree_node_base * __on_left,
365 ( __on_left != 0 || // If __on_left != 0, the remainder succeeds to true
350 _M_insert(_Rb_tree_node_base * __parent, const _Value& __val, _Rb_tree_node_base * __on_left, _Rb_tree_node_base * __on_right) argument
H A D_string_sum.h80 struct __on_left {}; struct
123 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __bstr_wrapper<_CharT, _Traits, _Alloc>, __on_left> _BStrOnLeft;
126 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __cstr_wrapper<_CharT>, __on_left> _CStrOnLeft;
129 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __char_wrapper<_CharT>, __on_left> _CharOnLeft;
259 __on_left const& /*StorageDir*/)
277 bool __do_init, __on_left const& /*StorageDir*/) const
/prebuilts/ndk/r11/sources/cxx-stl/stlport/stlport/stl/
H A D_tree.c344 // act like __on_left and ignore a portion of the if conditions -- specify
345 // __on_right != 0 to bypass comparison as false or __on_left != 0 to bypass
352 _Rb_tree_node_base * __on_left,
365 ( __on_left != 0 || // If __on_left != 0, the remainder succeeds to true
350 _M_insert(_Rb_tree_node_base * __parent, const _Value& __val, _Rb_tree_node_base * __on_left, _Rb_tree_node_base * __on_right) argument
H A D_string_sum.h80 struct __on_left {}; struct
123 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __bstr_wrapper<_CharT, _Traits, _Alloc>, __on_left> _BStrOnLeft;
126 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __cstr_wrapper<_CharT>, __on_left> _CStrOnLeft;
129 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __char_wrapper<_CharT>, __on_left> _CharOnLeft;
259 __on_left const& /*StorageDir*/)
277 bool __do_init, __on_left const& /*StorageDir*/) const
/prebuilts/ndk/r13/sources/cxx-stl/stlport/stlport/stl/
H A D_tree.c344 // act like __on_left and ignore a portion of the if conditions -- specify
345 // __on_right != 0 to bypass comparison as false or __on_left != 0 to bypass
352 _Rb_tree_node_base * __on_left,
365 ( __on_left != 0 || // If __on_left != 0, the remainder succeeds to true
350 _M_insert(_Rb_tree_node_base * __parent, const _Value& __val, _Rb_tree_node_base * __on_left, _Rb_tree_node_base * __on_right) argument
H A D_string_sum.h80 struct __on_left {}; struct
123 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __bstr_wrapper<_CharT, _Traits, _Alloc>, __on_left> _BStrOnLeft;
126 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __cstr_wrapper<_CharT>, __on_left> _CStrOnLeft;
129 typedef __bstr_sum<_CharT, _Traits, _Alloc, _Self, __char_wrapper<_CharT>, __on_left> _CharOnLeft;
259 __on_left const& /*StorageDir*/)
277 bool __do_init, __on_left const& /*StorageDir*/) const

Completed in 170 milliseconds