Home
last modified time | relevance | path

Searched refs:__map (Results 1 – 12 of 12) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__flat_map/
H A Dutils.h40 …_Map& __map, _IterK&& __it_key, _IterM&& __it_mapped, _KeyArg&& __key, _MArgs&&... __mapped_args) { in __emplace_exact_pos()
47 __map.clear() /* noexcept */; in __emplace_exact_pos()
50 auto __key_it = __map.__containers_.keys.emplace(__it_key, std::forward<_KeyArg>(__key)); in __emplace_exact_pos()
57 __map.clear() /* noexcept */; in __emplace_exact_pos()
64 __map.__containers_.keys.erase(__key_it); in __emplace_exact_pos()
72 __map.clear() /* noexcept */; in __emplace_exact_pos()
77 …auto __mapped_it = __map.__containers_.values.emplace(__it_mapped, std::forward<_MArgs>(__mapped_a… in __emplace_exact_pos()
85 __append(_Map& __map, _InputIterator __first, _Sentinel __last) { in __append()
89 __map.__containers_.keys.insert(__map.__containers_.keys.end(), std::move(__kv.first)); in __append()
90 __map.__containers_.values.insert(__map.__containers_.values.end(), std::move(__kv.second)); in __append()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dradix_sort.h126 __collect(_ForwardIterator __first, _ForwardIterator __last, _Map __map, _RandomAccessIterator __co… in __collect() argument
130 …std::for_each(__first, __last, [&__counters, &__map](const auto& __preimage) { ++__counters[__map(… in __collect()
141 _Map __map, in __dispose() argument
143 std::for_each(__first, __last, [&__result, &__counters, &__map](auto&& __preimage) { in __dispose()
144 auto __index = __counters[__map(__preimage)]++; in __dispose()
158 _Map __map, in __collect_impl() argument
168 …std::for_each(__first, __last, [&__counters, &__map, &__radix, &__previous, &__is_sorted](const au… in __collect_impl()
169 auto __current = __map(__value); in __collect_impl()
188 _Map __map, in __collect() argument
195 … __first, __last, __map, __radix, __counters, __maximums, make_index_sequence<__radix_count>()); in __collect()
[all …]
/freebsd/lib/libc/locale/
H A Drune.c193 rr[x].__map = frr[x].map; in _Read_RuneMagi()
194 if (rr[x].__map == 0) { in _Read_RuneMagi()
211 rr[x].__map = frr[x].map; in _Read_RuneMagi()
219 rr[x].__map = frr[x].map; in _Read_RuneMagi()
H A Dnextwctype.c84 } else if (re->__map & wct) in nextwctype_l()
93 } else if (re->__map & wct) in nextwctype_l()
H A Dtoupper.c63 return (re->__map + c - re->__min); in ___toupper_l()
H A Dtolower.c62 return (re->__map + c - re->__min); in ___tolower_l()
H A Drunetype.c65 return(re->__map); in ___runetype_l()
/freebsd/include/
H A Drunetype.h50 __rune_t __map; /* What first maps to in maps */ member
/freebsd/sys/contrib/dev/mediatek/mt76/mt7996/
H A Dregs.h9 struct __map { struct
23 const struct __map *map; argument
H A Dmmio.c151 static const struct __map mt7996_reg_map[] = {
204 static const struct __map mt7990_reg_map[] = {
/freebsd/contrib/llvm-project/libcxx/include/
H A Ddeque510 using __map _LIBCPP_NODEBUG = __split_buffer<pointer, __pointer_allocator>;
514 using __map_const_iterator _LIBCPP_NODEBUG = typename __map::const_iterator;
526 …// - __map: is a `__split_buffer`, see `__split_buffer` for more information on when it is trivial…
531 …__libcpp_is_trivially_relocatable<__map>::value && __libcpp_is_trivially_relocatable<allocator_typ…
535 …__conditional_t<__is_replaceable_v<__map> && __container_allocator_is_replaceable<__alloc_traits>:…
543 is_nothrow_move_constructible<typename __map::allocator_type>::value,
607 __map __map_;
621 typename __map::iterator __i = __map_.begin();
622 typename __map::iterator __e = __map_.end();
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A Ddeque445 using __map = __split_buffer<pointer, __pointer_allocator>;
449 using __map_const_iterator = typename __map::const_iterator;
461 …// - __map: is a `__split_buffer`, see `__split_buffer` for more information on when it is trivial…
466 …__libcpp_is_trivially_relocatable<__map>::value && __libcpp_is_trivially_relocatable<allocator_typ…
474 is_nothrow_move_constructible<typename __map::allocator_type>::value,
538 __map __map_;
549 typename __map::iterator __i = __map_.begin();
550 typename __map::iterator __e = __map_.end();