/external/clang/test/CXX/special/class.copy/ |
H A D | p15-0x.cpp | 9 void find_or_insert(const foo& __obj) { argument 10 foo x(__obj);
|
/external/stlport/src/ |
H A D | allocators.cpp | 766 typedef _Pthread_alloc_obj __obj; typedef in struct:_Pthread_alloc_per_thread_state 775 { memset((void *)__CONST_CAST(_Pthread_alloc_obj**, __free_list), 0, (size_t)_S_NFREELISTS * sizeof(__obj *)); } 854 typedef _Pthread_alloc_obj __obj; typedef 857 __obj * volatile * __my_free_list; 858 __obj * __result; 859 __obj * __current_obj, * __next_obj; 869 __result = (__obj *)__chunk; 870 *__my_free_list = __next_obj = (__obj *)(__chunk + __n); 873 __next_obj = (__obj *)((char *)__next_obj + __n); 936 typedef _Pthread_alloc_obj __obj; typedef 991 typedef _Pthread_alloc_obj __obj; typedef 1015 typedef _Pthread_alloc_obj __obj; typedef 1035 typedef _Pthread_alloc_obj __obj; typedef 1060 typedef _Pthread_alloc_obj __obj; typedef [all...] |
/external/stlport/stlport/stl/debug/ |
H A D | _hashtable.h | 209 pair<iterator, bool> insert_unique(const value_type& __obj) { argument 210 pair<_Base_iterator, bool> __res = _M_non_dbg_impl.insert_unique(__obj); 214 iterator insert_equal(const value_type& __obj) argument 215 { return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal(__obj)); } 217 pair<iterator, bool> insert_unique_noresize(const value_type& __obj) { argument 218 pair<_Base_iterator, bool> __res = _M_non_dbg_impl.insert_unique_noresize(__obj); 222 iterator insert_equal_noresize(const value_type& __obj) argument 223 { return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal_noresize(__obj)); } 313 reference _M_insert(const value_type& __obj) { return _M_non_dbg_impl._M_insert(__obj); } argument [all...] |
/external/stlport/stlport/stl/ |
H A D | _hashtable.h | 407 pair<iterator, bool> insert_unique(const value_type& __obj) { argument 409 return insert_unique_noresize(__obj); 412 iterator insert_equal(const value_type& __obj) { argument 414 return insert_equal_noresize(__obj); 418 iterator _M_insert_noresize(size_type __n, const value_type& __obj); 420 pair<iterator, bool> insert_unique_noresize(const value_type& __obj); 421 iterator insert_equal_noresize(const value_type& __obj); 494 //reference find_or_insert(const value_type& __obj); 585 reference _M_insert(const value_type& __obj); 605 size_type _M_bkt_num(const value_type& __obj) cons 612 _M_bkt_num(const value_type& __obj, size_t __n) const argument [all...] |
H A D | _hashtable.c | 183 ::_M_insert_noresize(size_type __n, const value_type& __obj) { argument 190 _M_elems.insert_after(__pos, __obj)._M_node); 199 ::insert_unique_noresize(const value_type& __obj) { argument 200 const size_type __n = _M_bkt_num(__obj); 206 if (_M_equals(_M_get_key(*__cur), _M_get_key(__obj))) { 209 _STLP_ASSERT(_M_hash(_M_get_key(*__cur)) == _M_hash(_M_get_key(__obj))) 218 __cur = _M_elems.insert_after(_ElemsIte(_M_buckets[__n]), __obj); 223 return pair<iterator, bool>(_M_insert_noresize(__n, __obj), true); 230 ::insert_equal_noresize(const value_type& __obj) { argument 231 const size_type __n = _M_bkt_num(__obj); 254 _M_insert(const value_type& __obj) argument [all...] |
H A D | _unordered_map.h | 133 pair<iterator,bool> insert(const value_type& __obj) argument 134 { return _M_ht.insert_unique(__obj); } 135 iterator insert(const_iterator /*__hint*/, const value_type& __obj) argument 136 { return _M_ht.insert_unique(__obj); } 301 iterator insert(const value_type& __obj) argument 302 { return _M_ht.insert_equal(__obj); } 303 iterator insert(const_iterator /*__hint*/, const value_type& __obj) argument 304 { return _M_ht.insert_equal(__obj); }
|
H A D | _unordered_set.h | 127 pair<iterator, bool> insert(const value_type& __obj) argument 128 { return _M_ht.insert_unique(__obj); } 129 iterator insert(const_iterator /*__hint*/, const value_type& __obj) argument 130 { return _M_ht.insert_unique(__obj); } 277 iterator insert(const value_type& __obj) argument 278 { return _M_ht.insert_equal(__obj); } 279 iterator insert(const_iterator /*__hint*/, const value_type& __obj) argument 280 { return _M_ht.insert_equal(__obj); }
|
H A D | _hash_map.h | 179 pair<iterator,bool> insert(const value_type& __obj) argument 180 { return _M_ht.insert_unique(__obj); } 191 pair<iterator,bool> insert_noresize(const value_type& __obj) argument 192 { return _M_ht.insert_unique_noresize(__obj); } 371 iterator insert(const value_type& __obj) argument 372 { return _M_ht.insert_equal(__obj); } 384 iterator insert_noresize(const value_type& __obj) argument 385 { return _M_ht.insert_equal_noresize(__obj); }
|
H A D | _hash_set.h | 181 pair<iterator, bool> insert(const value_type& __obj) argument 182 { return _M_ht.insert_unique(__obj); } 193 pair<iterator, bool> insert_noresize(const value_type& __obj) argument 194 { return _M_ht.insert_unique_noresize(__obj); } 363 iterator insert(const value_type& __obj) { return _M_ht.insert_equal(__obj); } argument 374 iterator insert_noresize(const value_type& __obj) argument 375 { return _M_ht.insert_equal_noresize(__obj); }
|
/external/chromium_org/third_party/jinja2/ |
H A D | sandbox.py | 343 def call(__self, __context, __obj, *args, **kwargs): 347 if not __self.is_safe_callable(__obj): 348 raise SecurityError('%r is not safely callable' % (__obj,)) 349 return __context.call(__obj, *args, **kwargs)
|
H A D | runtime.py | 164 def call(__self, __obj, *args, **kwargs): 172 if isinstance(__obj, _context_function_types): 173 if getattr(__obj, 'contextfunction', 0): 175 elif getattr(__obj, 'evalcontextfunction', 0): 177 elif getattr(__obj, 'environmentfunction', 0): 180 return __obj(*args, **kwargs)
|
/external/bison/lib/ |
H A D | obstack.h | 407 void *__obj = (OBJ); \ 408 if (__obj > (void *)__o->chunk && __obj < (void *)__o->chunk_limit) \ 409 __o->next_free = __o->object_base = (char *)__obj; \ 410 else (__obstack_free) (__o, __obj); })
|