Searched refs:__k (Results 1 - 6 of 6) sorted by relevance

/haiku/src/libs/stdc++/legacy/
H A Dvalarray.cc31 for (size_t __k=0; __k<__n; ++__k)
32 __i[__j] += __s[__k]*__t[__k];
34 for (size_t __k=__n-1; __k; --__k) {
35 if (__t[__k] >= __l[__k]) {
[all...]
/haiku/headers/cpp/
H A Dstl_tree.h1115 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k) argument
1117 _Link_type __y = _M_header; // Last node which is not less than __k.
1121 if (!_M_key_compare(_S_key(__x), __k))
1127 return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ?
1134 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k) const
1136 _Link_type __y = _M_header; /* Last node which is not less than __k. */
1140 if (!_M_key_compare(_S_key(__x), __k))
1146 return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ?
1154 ::count(const _Key& __k) const
1156 pair<const_iterator, const_iterator> __p = equal_range(__k);
1166 lower_bound(const _Key& __k) argument
1202 upper_bound(const _Key& __k) argument
1240 equal_range(const _Key& __k) argument
[all...]
H A Dstl_map.h150 _Tp& operator[](const key_type& __k) { argument
151 iterator __i = lower_bound(__k);
152 // __i->first is greater than or equivalent to __k.
153 if (__i == end() || key_comp()(__k, (*__i).first))
154 __i = insert(__i, value_type(__k, _Tp()));
H A Dstl_function.h441 unsigned int __k = 1; local
446 _M_table[__ii] = __k;
447 __k = __seed - __k;
H A Dstl_algo.h772 _Distance __k = __middle - __first; local
773 _Distance __l = __n - __k;
776 if (__k == __l) {
781 _Distance __d = __gcd(__n, __k);
787 if (__k < __l) {
794 *__p = *(__p + __k);
795 __p += __k;
800 for (_Distance __j = 0; __j < __k/__d - 1; __j ++) {
801 if (__p < __last - __k) {
802 *__p = *(__p + __k);
1267 _Size __k; local
[all...]
/haiku/headers/cpp/std/
H A Dvalarray_array.h270 for (size_t __k=0; __k<__n; ++__k, ++__j) \
271 __a._M_data[*__j] _Op##= __e[__k]; \

Completed in 58 milliseconds