Home
last modified time | relevance | path

Searched refs:__np (Results 1 – 15 of 15) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__locale_dir/
H A Dpad_and_output.h59 streamsize __np = __op - __ob; in __pad_and_output() local
60 if (__np > 0) { in __pad_and_output()
61 if (__s.__sbuf_->sputn(__ob, __np) != __np) { in __pad_and_output()
73 __np = __oe - __op; in __pad_and_output()
74 if (__np > 0) { in __pad_and_output()
75 if (__s.__sbuf_->sputn(__op, __np) != __np) { in __pad_and_output()
H A Dnum.h88 const numpunct<_CharT>& __np = use_facet<numpunct<_CharT> >(__loc); in __stage2_int_prep() local
89 __thousands_sep = __np.thousands_sep(); in __stage2_int_prep()
90 return __np.grouping(); in __stage2_int_prep()
117 const numpunct<_CharT>& __np = std::use_facet<numpunct<_CharT> >(__loc); in __stage2_float_prep() local
118 __decimal_point = __np.decimal_point(); in __stage2_float_prep()
119 __thousands_sep = __np.thousands_sep(); in __stage2_float_prep()
120 return __np.grouping(); in __stage2_float_prep()
644 const numpunct<_CharT>& __np = std::use_facet<numpunct<_CharT> >(__iob.getloc());
646 const string_type __names[2] = {__np.truename(), __np.falsename()};
706 …char* __nb, char* __np, char* __ne, _CharT* __ob, _CharT*& __op, _CharT*& __oe, const locale& __lo…
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__format/
H A Dformatter_integral.h303 const auto& __np = std::use_facet<numpunct<_CharT>>(__ctx.locale()); in __format_integer() local
304 string __grouping = __np.grouping(); in __format_integer()
317 __np.thousands_sep(), in __format_integer()
428 const auto& __np = std::use_facet<numpunct<_CharT>>(__ctx.locale());
429 basic_string<_CharT> __str = __value ? __np.truename() : __np.falsename();
H A Dformatter_floating_point.h503 const auto& __np = std::use_facet<numpunct<_CharT>>(__loc);
504 string __grouping = __np.grouping();
547 _CharT __sep = __np.thousands_sep();
568 *__out_it++ = __np.decimal_point();
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A D__hash_table929 _LIBCPP_HIDE_FROM_ABI void __deallocate_node(__next_pointer __np) _NOEXCEPT;
1044 void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__deallocate_node(__next_pointer __np) _NOEXCEPT {
1046 while (__np != nullptr) {
1047 __next_pointer __next = __np->__next_;
1048 __node_pointer __real_np = __np->__upcast();
1052 __np = __next;
1387 __next_pointer __np = __p.__node_;
1388 __cp->__hash_ = __np->__hash();
1397 while (__pp->__next_ != __np)
1399 __cp->__next_ = __np;
[all …]
H A Dlocale422 const numpunct<_CharT>& __np = use_facet<numpunct<_CharT> >(__loc);
423 __thousands_sep = __np.thousands_sep();
424 return __np.grouping();
462 const numpunct<_CharT>& __np = std::use_facet<numpunct<_CharT> >(__loc);
463 __thousands_sep = __np.thousands_sep();
464 return __np.grouping();
473 const numpunct<_CharT>& __np = std::use_facet<numpunct<_CharT> >(__loc);
474 __decimal_point = __np.decimal_point();
475 __thousands_sep = __np.thousands_sep();
476 return __np.grouping();
[all …]
H A D__tree1848 __node_pointer __np = __p.__get_np();
1849 iterator __r = __remove_node_pointer(__np);
1852 __node_traits::deallocate(__na, __np, 1);
2085 __node_pointer __np = __p.__get_np();
2087 if (__np->__right_ != nullptr)
2088 __begin_node() = static_cast<__iter_pointer>(__np->__right_);
2090 __begin_node() = static_cast<__iter_pointer>(__np->__parent_);
2093 std::__tree_remove(__end_node()->__left_, static_cast<__node_base_pointer>(__np));
2094 return __node_holder(__np, _Dp(__node_alloc(), true));
H A Dlist586 __node_pointer __np = __f->__as_node();
588 __delete_node(__np);
H A Dregex4832 ptrdiff_t __np = std::distance(__first, __last);
4867 if (__highest_j == __np)
4916 ptrdiff_t __np = std::distance(__first, __last);
4959 if (__highest_j == __np)
/freebsd/contrib/llvm-project/libcxx/include/
H A D__hash_table1045 _LIBCPP_HIDE_FROM_ABI void __deallocate_node(__next_pointer __np) _NOEXCEPT;
1199 void __hash_table<_Tp, _Hash, _Equal, _Alloc>::__deallocate_node(__next_pointer __np) _NOEXCEPT {
1201 while (__np != nullptr) {
1202 __next_pointer __next = __np->__next_;
1203 __node_pointer __real_np = __np->__upcast();
1207 __np = __next;
1544 __next_pointer __np = __p.__node_;
1545 __cp->__hash_ = __np->__hash();
1554 while (__pp->__next_ != __np)
1556 __cp->__next_ = __np;
[all …]
H A D__tree1882 __node_pointer __np = __p.__get_np();
1883 __remove_node_pointer(__np);
1884 return _NodeHandle(__np, __alloc());
1952 __node_pointer __np = __p.__get_np();
1953 iterator __r = __remove_node_pointer(__np);
1956 __node_traits::deallocate(__na, __np, 1);
2189 __node_pointer __np = __p.__get_np();
2191 if (__np->__right_ != nullptr)
2192 __begin_node() = static_cast<__end_node_pointer>(__np->__right_);
2194 __begin_node() = static_cast<__end_node_pointer>(__np->__parent_);
[all …]
H A Dvariant555 constexpr size_t __np = __remove_cvref_t<_Vp>::__size();
556 static_assert(__all<(__np == __remove_cvref_t<_Vs>::__size())...>::value);
557 return __make_fdiagonal_impl<_Fp, _Vp, _Vs...>(make_index_sequence<__np>{});
H A Dlist653 __node_pointer __np = __f->__as_node();
655 __delete_node(__np);
H A Dregex4924 ptrdiff_t __np = std::distance(__first, __last);
4959 if (__highest_j == __np)
5008 ptrdiff_t __np = std::distance(__first, __last);
5051 if (__highest_j == __np)
/freebsd/contrib/llvm-project/libcxx/src/
H A Dlocale.cpp5569 const numpunct<_CharT>& __np = std::use_facet<numpunct<_CharT> >(__loc); in __stage2_int_prep() local
5570 __thousands_sep = __np.thousands_sep(); in __stage2_int_prep()
5571 return __np.grouping(); in __stage2_int_prep()