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

/freebsd-10.0-release/contrib/libc++/src/
H A Dvalarray.cpp22 size_t __k = __size_.size() != 0; local
24 __k *= __size_[__i];
25 __1d_.resize(__k);
28 __k = 0;
29 __1d_[__k] = __start;
37 ++__k;
38 __1d_[__k] = __1d_[__k-1] + __stride_[__i];
40 __1d_[__k] -= __stride_[__j] * (__size_[__j] - 1);
/freebsd-10.0-release/contrib/libstdc++/src/
H A Dvalarray-inst.cc91 for (size_t __k = 0; __k < __n; ++__k)
92 __a += __s[__k] * __t[__k];
H A Dlocale.cc270 for (size_t __k = 0; __k < _S_categories_size; ++__k)
271 _M_names[__k] = 0;
345 for (size_t __k = _M_facets_size; __k < __new_size; ++__k)
346 __newc[__k] = 0;
H A Dlocalename.cc196 for (size_t __k = 0; __k < _S_categories_size; ++__k)
197 _M_names[__k] = 0;
H A Dmt_allocator.cc505 const size_t __k = sizeof(_Thread_record) local
507 __v = ::operator new(__k);
698 const size_t __k = sizeof(_Thread_record) local
700 __v = ::operator new(__k);
/freebsd-10.0-release/contrib/libstdc++/config/locale/gnu/
H A Dctype_members.cc293 for (size_t __k = 0; __k <= 11; ++__k)
295 _M_bit[__k] = static_cast<mask>(_ISbit(__k));
296 _M_wmask[__k] = _M_convert_to_wmask(_M_bit[__k]);
/freebsd-10.0-release/contrib/libstdc++/include/bits/
H A Dstl_map.h342 operator[](const key_type& __k) argument
347 iterator __i = lower_bound(__k);
348 // __i->first is greater than or equivalent to __k.
349 if (__i == end() || key_comp()(__k, (*__i).first))
350 __i = insert(__i, value_type(__k, mapped_type()));
364 at(const key_type& __k) argument
366 iterator __i = lower_bound(__k);
367 if (__i == end() || key_comp()(__k, (*__i).first))
373 at(const key_type& __k) const
375 const_iterator __i = lower_bound(__k);
[all...]
H A Dboost_concept_check.h795 __i = __c.find(__k);
796 __r = __c.equal_range(__k);
797 __c.erase(__k);
803 __ci = __c.find(__k);
804 __n = __c.count(__k);
805 __cr = __c.equal_range(__k);
815 typename _AssociativeContainer::key_type __k;
896 __p = __c.upper_bound(__k);
897 __p = __c.lower_bound(__k);
898 __r = __c.equal_range(__k);
[all...]
H A Dstl_tree.h1387 find(const _Key& __k) argument
1390 _Link_type __y = _M_end(); // Last node which is not less than __k.
1393 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1400 || _M_impl._M_key_compare(__k,
1408 find(const _Key& __k) const
1411 _Const_Link_type __y = _M_end(); // Last node which is not less than __k.
1415 if (!_M_impl._M_key_compare(_S_key(__x), __k))
1422 || _M_impl._M_key_compare(__k,
1430 count(const _Key& __k) const
1432 pair<const_iterator, const_iterator> __p = equal_range(__k);
1441 lower_bound(const _Key& __k) argument
1477 upper_bound(const _Key& __k) argument
1516 equal_range(const _Key& __k) argument
[all...]
H A Dvalarray_array.h342 for (size_t __k = 0; __k < __n; ++__k)
625 for (size_t __k = 0; __k<__n; ++__k, ++__j) \
626 __a._M_data[*__j] _Op##= __e[__k]; \
H A Dstl_algo.h1848 const _Distance __k = __middle - __first; local
1849 const _Distance __l = __n - __k;
1851 if (__k == __l)
1857 const _Distance __d = __gcd(__n, __k);
1864 if (__k < __l)
1874 *__p = *(__p + __k);
1875 __p += __k;
1880 for (_Distance __j = 0; __j < __k / __d - 1; __j ++)
1882 if (__p < __last - __k)
1884 *__p = *(__p + __k);
2514 _Size __k; local
[all...]
/freebsd-10.0-release/contrib/libstdc++/include/tr1/
H A Dhashtable_policy.h631 operator[](const _Key& __k);
638 operator[](const _Key& __k) argument
641 typename _Hashtable::_Hash_code_type __code = __h->_M_hash_code(__k);
642 std::size_t __n = __h->_M_bucket_index(__k, __code,
646 __h->_M_find_node(__h->_M_buckets[__n], __k, __code);
648 return __h->_M_insert_bucket(std::make_pair(__k, mapped_type()),
714 _M_bucket_index(const _Key& __k, _Hash_code_type, argument
716 { return _M_ranged_hash(__k, __n); }
724 _M_compare(const _Key& __k, _Hash_code_type, argument
726 { return _M_eq(__k, _M_extrac
803 _M_compare(const _Key& __k, _Hash_code_type, _Hash_node<_Value, false>* __n) const argument
870 _M_compare(const _Key& __k, _Hash_code_type __c, _Hash_node<_Value, true>* __n) const argument
[all...]

Completed in 109 milliseconds