Home
last modified time | relevance | path

Searched refs:__f (Results 1 – 13 of 13) sorted by relevance

/haiku/headers/cpp/
H A Dstl_hash_map.h93 hash_map(_InputIterator __f, _InputIterator __l) in hash_map() argument
95 { _M_ht.insert_unique(__f, __l); } in hash_map()
97 hash_map(_InputIterator __f, _InputIterator __l, size_type __n) in hash_map() argument
99 { _M_ht.insert_unique(__f, __l); } in hash_map()
101 hash_map(_InputIterator __f, _InputIterator __l, size_type __n, in hash_map() argument
104 { _M_ht.insert_unique(__f, __l); } in hash_map()
106 hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
110 { _M_ht.insert_unique(__f, __l); } in _M_ht()
113 hash_map(const value_type* __f, const value_type* __l) in hash_map() argument
115 { _M_ht.insert_unique(__f, __l); } in hash_map()
[all …]
H A Dstl_hash_set.h91 hash_set(_InputIterator __f, _InputIterator __l) in hash_set() argument
93 { _M_ht.insert_unique(__f, __l); } in hash_set()
95 hash_set(_InputIterator __f, _InputIterator __l, size_type __n) in hash_set() argument
97 { _M_ht.insert_unique(__f, __l); } in hash_set()
99 hash_set(_InputIterator __f, _InputIterator __l, size_type __n, in hash_set() argument
102 { _M_ht.insert_unique(__f, __l); } in hash_set()
104 hash_set(_InputIterator __f, _InputIterator __l, size_type __n,
108 { _M_ht.insert_unique(__f, __l); } in _M_ht()
111 hash_set(const value_type* __f, const value_type* __l) in hash_set() argument
113 { _M_ht.insert_unique(__f, __l); } in hash_set()
[all …]
H A Dstdiostream.h61 istdiostream (FILE* __f) : istream(), _file(__f) { init(&_file); } in istdiostream() argument
72 ostdiostream (FILE* __f) : ostream(), _file(__f) { init(&_file); } in ostdiostream() argument
H A Dstl_hashtable.h371 void insert_unique(_InputIterator __f, _InputIterator __l)
373 insert_unique(__f, __l, __ITERATOR_CATEGORY(__f));
377 void insert_equal(_InputIterator __f, _InputIterator __l)
379 insert_equal(__f, __l, __ITERATOR_CATEGORY(__f));
383 void insert_unique(_InputIterator __f, _InputIterator __l,
386 for ( ; __f != __l; ++__f)
387 insert_unique(*__f);
391 void insert_equal(_InputIterator __f, _InputIterator __l,
394 for ( ; __f != __l; ++__f)
395 insert_equal(*__f);
[all …]
H A Dstl_function.h645 inline mem_fun_t<_Ret,_Tp> mem_fun(_Ret (_Tp::*__f)()) in mem_fun() argument
646 { return mem_fun_t<_Ret,_Tp>(__f); } in mem_fun()
649 inline const_mem_fun_t<_Ret,_Tp> mem_fun(_Ret (_Tp::*__f)() const) in mem_fun()
650 { return const_mem_fun_t<_Ret,_Tp>(__f); } in mem_fun()
653 inline mem_fun_ref_t<_Ret,_Tp> mem_fun_ref(_Ret (_Tp::*__f)()) in mem_fun_ref() argument
654 { return mem_fun_ref_t<_Ret,_Tp>(__f); } in mem_fun_ref()
657 inline const_mem_fun_ref_t<_Ret,_Tp> mem_fun_ref(_Ret (_Tp::*__f)() const) in mem_fun_ref()
658 { return const_mem_fun_ref_t<_Ret,_Tp>(__f); } in mem_fun_ref()
661 inline mem_fun1_t<_Ret,_Tp,_Arg> mem_fun(_Ret (_Tp::*__f)(_Arg)) in mem_fun()
662 { return mem_fun1_t<_Ret,_Tp,_Arg>(__f); } in mem_fun()
[all …]
H A Dropeimpl.h349 _Rope_RopeFunction<_CharT,_Alloc>* __f in _M_free_tree() local
351 __f->_Rope_RopeFunction<_CharT,_Alloc>::~_Rope_RopeFunction(); in _M_free_tree()
352 _F_deallocate(__f, 1); in _M_free_tree()
719 _RopeFunction* __f = (_RopeFunction*)__base; in _S_substring() local
729 (*(__f->_M_fn))(__start, __result_len, __section); in _S_substring()
870 _RopeFunction* __f = (_RopeFunction*)__r; in _S_apply_to_pieces() local
876 (*(__f->_M_fn))(__begin, __end, __buffer); in _S_apply_to_pieces()
893 char __f = __o.fill(); in _Rope_fill() local
896 for (__i = 0; __i < __n; __i++) __o.put(__f); in _Rope_fill()
984 _RopeFunction* __f = (_RopeFunction*)__r; in _S_flatten() local
[all …]
H A Dstl_alloc.h178 static void (* __set_malloc_handler(void (*__f)()))() in __set_malloc_handler() argument
181 __malloc_alloc_oom_handler = __f; in __set_malloc_handler()
H A Dstl_rope.h630 _Rope_RopeFunction(char_producer<_CharT>* __f, size_t __size, in _Rope_RopeFunction()
633 _M_fn(__f) in _Rope_RopeFunction()
1450 static _RopeFunction* _S_new_RopeFunction(char_producer<_CharT>* __f,
1458 return new(__space) _RopeFunction(__f, __size, __d, __a);
H A Dstl_algo.h81 _Function for_each(_InputIter __first, _InputIter __last, _Function __f) { in for_each() argument
83 __f(*__first); in for_each()
84 return __f; in for_each()
/haiku/headers/cpp/std/
H A Dvalarray_meta.h56 _UnFunBase (const _Dom& __e, _Vt __f(_Vt)) in _UnFunBase()
57 : _M_expr(__e), _M_func(__f) {} in _UnFunBase()
74 _UnFunClos (const _Dom& __e, value_type __f(value_type))
75 : _Base (__e, __f) {}
83 _UnFunClos (const valarray<_Tp>& __v, _Tp __f(_Tp))
84 : _Base (__v, __f) {}
100 _Vt __f (_Vt, _Vt))
101 : _M_expr1 (__e1), _M_expr2 (__e2), _M_func (__f) {}
118 _BinFunBase1 (const _Vt& __c, const _Dom& __e, _Vt __f(_Vt, _Vt))
119 : _M_expr1 (__c), _M_expr2 (__e), _M_func (__f) {}
[all …]
/haiku/headers/posix/
H A Dmath.h61 # define __huge_valf_t union { unsigned char __c[4]; long __l; float __f; }
62 # define HUGE_VALF (((__huge_valf_t) { __l: __HUGE_VALF_v }).__f)
67 # define NAN (((__huge_valf_t) { __l: __NAN_VALF_v }).__f)
/haiku/src/system/libroot/posix/glibc/libio/
H A Dstdio.h342 extern int vasprintf (char **__restrict __ptr, __const char *__restrict __f,
/haiku/src/system/libroot/posix/glibc/stdlib/
H A Dlonglong.h274 UDItype __f; \
278 : "=x" (__t.__f) \