Home
last modified time | relevance | path

Searched refs:size_type (Results 1 – 25 of 167) sorted by relevance

1234567

/src/contrib/llvm-project/libcxx/include/__string/
H A Dextern_template_lists.h33 …tring<_CharType>& basic_string<_CharType>::replace(size_type, size_type, value_type const*, size_t…
34 …D_FROM_ABI basic_string<_CharType>::size_type basic_string<_CharType>::rfind(value_type const*, si…
35 …_EXPORTED_FROM_ABI void basic_string<_CharType>::__init(value_type const*, size_type, size_type)) \
37 …ROM_ABI basic_string<_CharType>& basic_string<_CharType>::replace(size_type, size_type, value_type…
39 …M_ABI basic_string<_CharType>::size_type basic_string<_CharType>::find_last_not_of(value_type cons…
41 …_ABI basic_string<_CharType>::size_type basic_string<_CharType>::find_first_not_of(value_type cons…
42 …FROM_ABI basic_string<_CharType>& basic_string<_CharType>::insert(size_type, size_type, value_type…
44 …_Func(_LIBCPP_EXPORTED_FROM_ABI void basic_string<_CharType>::__init(value_type const*, size_type)…
45 _Func(_LIBCPP_EXPORTED_FROM_ABI const _CharType& basic_string<_CharType>::at(size_type) const) \
46 …basic_string<_CharType>& basic_string<_CharType>::insert(size_type, value_type const*, size_type))…
[all …]
/src/contrib/llvm-project/libcxx/include/
H A Dstring_view85 typedef size_t size_type;
87 static constexpr size_type npos = size_type(-1);
96 constexpr basic_string_view(const charT* str, size_type len);
113 constexpr size_type size() const noexcept;
114 constexpr size_type length() const noexcept;
115 constexpr size_type max_size() const noexcept;
119 constexpr const_reference operator[](size_type pos) const;
120 constexpr const_reference at(size_type pos) const;
126 constexpr void remove_prefix(size_type n);
127 constexpr void remove_suffix(size_type n);
[all …]
H A Dstring91 typedef typename allocator_type::size_type size_type;
102 static const size_type npos = -1;
110 basic_string(const basic_string& str, size_type pos,
112 basic_string(const basic_string& str, size_type pos, size_type n,
115 …basic_string&& str, size_type pos, const Allocator& a = Allocator()); // since C…
117 …basic_string&& str, size_type pos, size_type n, const Allocator& a = Allocator()); // since C…
119 …basic_string(const T& t, size_type pos, size_type n, const Allocator& a = Allocator()); // C++17, …
123 …basic_string(const value_type* s, size_type n, const allocator_type& a = allocator_type()); // con…
125 …basic_string(size_type n, value_type c, const allocator_type& a = allocator_type()); // con…
166 …size_type size() const noexcept; // con…
[all …]
H A Dunordered_set39 typedef typename allocator_traits<allocator_type>::size_type size_type;
55 explicit unordered_set(size_type n, const hasher& hf = hasher(),
60 size_type n = 0, const hasher& hf = hasher(),
64 unordered_set(from_range_t, R&& rg, size_type n = see below,
76 unordered_set(initializer_list<value_type>, size_type n = 0,
79 unordered_set(size_type n, const allocator_type& a); // C++14
80 unordered_set(size_type n, const hasher& hf, const allocator_type& a); // C++14
82 … unordered_set(InputIterator f, InputIterator l, size_type n, const allocator_type& a); // C++14
84 unordered_set(InputIterator f, InputIterator l, size_type n,
87 unordered_set(from_range_t, R&& rg, size_type n, const allocator_type& a)
[all …]
H A Dvector31 typedef typename allocator_type::size_type size_type;
41 explicit vector(size_type n);
42 explicit vector(size_type n, const allocator_type&); // C++14
43 vector(size_type n, const value_type& value, const allocator_type& = allocator_type());
64 void assign(size_type n, const value_type& u);
84 size_type size() const noexcept;
85 size_type max_size() const noexcept;
86 size_type capacity() const noexcept;
88 void reserve(size_type n);
91 reference operator[](size_type n);
[all …]
H A Dunordered_map38 typedef typename allocator_traits<allocator_type>::size_type size_type;
54 explicit unordered_map(size_type n, const hasher& hf = hasher(),
59 size_type n = 0, const hasher& hf = hasher(),
63 unordered_map(from_range_t, R&& rg, size_type n = see below,
76 unordered_map(initializer_list<value_type>, size_type n = 0,
79 unordered_map(size_type n, const allocator_type& a)
81 unordered_map(size_type n, const hasher& hf, const allocator_type& a)
84 unordered_map(InputIterator f, InputIterator l, size_type n, const allocator_type& a)
87 unordered_map(InputIterator f, InputIterator l, size_type n, const hasher& hf,
91 unordered_map(from_range_t, R&& rg, size_type n, const allocator_type& a)
[all …]
H A D__split_buffer62 using size_type = typename __alloc_traits::size_type;
100 __split_buffer(size_type __cap, size_type __start, __alloc_rr& __a);
132 _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type size() const {
133 return static_cast<size_type>(__end_ - __begin_);
138 _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type capacity() const {
139 return static_cast<size_type>(__end_cap() - __first_);
142 _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type __front_spare() const {
143 return static_cast<size_type>(__begin_ - __first_);
146 _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI size_type __back_spare() const {
147 return static_cast<size_type>(__end_cap() - __end_);
[all …]
H A Ddeque31 typedef typename allocator_type::size_type size_type;
42 explicit deque(size_type n);
43 explicit deque(size_type n, const allocator_type& a); // C++14
44 deque(size_type n, const value_type& v);
45 deque(size_type n, const value_type& v, const allocator_type& a);
71 void assign(size_type n, const value_type& v);
94 size_type size() const noexcept;
95 size_type max_size() const noexcept;
96 void resize(size_type n);
97 void resize(size_type n, const value_type& v);
[all …]
H A Dspan61 using size_type = size_t;
69 static constexpr size_type extent = Extent;
74 constexpr explicit(Extent != dynamic_extent) span(It first, size_type count);
99 constexpr span<element_type, dynamic_extent> first(size_type count) const;
100 constexpr span<element_type, dynamic_extent> last(size_type count) const;
101 …constexpr span<element_type, dynamic_extent> subspan(size_type offset, size_type count = dynamic_e…
104 constexpr size_type size() const noexcept;
105 constexpr size_type size_bytes() const noexcept;
109 constexpr reference operator[](size_type idx) const;
110 constexpr reference at(size_type idx) const; // since C++26
[all …]
H A D__hash_table225 typedef size_t size_type;
555 typedef typename __alloc_traits::size_type size_type;
557 __compressed_pair<size_type, allocator_type> __data_;
565 _LIBCPP_HIDE_FROM_ABI __bucket_list_deallocator(const allocator_type& __a, size_type __size)
575 _LIBCPP_HIDE_FROM_ABI size_type& size() _NOEXCEPT { return __data_.first(); }
576 _LIBCPP_HIDE_FROM_ABI size_type size() const _NOEXCEPT { return __data_.first(); }
680 typedef typename __alloc_traits::size_type size_type;
682 typedef typename _NodeTypes::size_type size_type;
720 __compressed_pair<size_type, hasher> __p2_;
724 _LIBCPP_HIDE_FROM_ABI size_type& size() _NOEXCEPT { return __p2_.first(); }
[all …]
/src/contrib/llvm-project/llvm/lib/Target/X86/
H A DImmutableGraph.h45 using size_type = int; variable
81 size_type NodesSize, size_type EdgesSize) in ImmutableGraph()
98 size_type nodes_size() const { return NodesSize; } in nodes_size()
99 size_type edges_size() const { return EdgesSize; } in edges_size()
102 size_type getNodeIndex(const Node &N) const { in getNodeIndex()
106 size_type getEdgeIndex(const Edge &E) const { in getEdgeIndex()
119 size_type Idx = G.getNodeIndex(N); in insert()
125 size_type Idx = G.getNodeIndex(N); in erase()
129 size_type Idx = G.getNodeIndex(N); in contains()
133 size_type empty() const { return V.none(); } in empty()
[all …]
/src/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set35 typedef typename allocator_traits<allocator_type>::size_type size_type;
41 explicit hash_set(size_type n = 193, const hasher& hf = hasher(),
46 size_type n = 193, const hasher& hf = hasher(),
56 size_type size() const;
57 size_type max_size() const;
69 size_type erase(const key_type& k);
80 size_type count(const key_type& k) const;
84 size_type bucket_count() const;
85 size_type max_bucket_count() const;
87 size_type elems_in_bucket(size_type n) const;
[all …]
H A Dhash_map36 typedef typename allocator_traits<allocator_type>::size_type size_type;
43 explicit hash_map(size_type n, const hasher& hf = hasher(),
50 size_type n, const hasher& hf = hasher(),
60 size_type size() const;
61 size_type max_size() const;
73 size_type erase(const key_type& k);
84 size_type count(const key_type& k) const;
90 size_type bucket_count() const;
91 size_type max_bucket_count() const;
93 size_type elems_in_bucket(size_type n) const;
[all …]
/src/contrib/kyua/utils/text/
H A Dtable.cpp63 for (text::widths_vector::size_type i = 0; i < user_widths.size(); ++i) { in override_column_widths()
86 static text::widths_vector::size_type
89 text::widths_vector::size_type i = 0; in find_refill_column()
123 const text::widths_vector::size_type refill_column = in refill_widths()
128 for (text::widths_vector::size_type i = 0; i < widths.size(); ++i) { in refill_widths()
172 const text::table_row::size_type column, in refill_cell()
181 for (std::vector< std::string >::size_type i = 0; i < rows.size(); ++i) { in refill_cell()
182 for (text::table_row::size_type j = 0; j < row.size(); ++j) { in refill_cell()
212 for (text::table_row::size_type column = 0; column < row.size(); ++column) { in format_row()
235 text::table::table(const table_row::size_type ncolumns_) in table()
[all …]
H A Doperations.cpp74 quoted << "&amp;#" << static_cast< std::string::size_type >(*it) in escape_xml()
96 std::string::size_type start_pos = 0; in quote()
97 std::string::size_type last_pos = text.find(quote); in quote()
126 std::string::size_type start = 0; in refill()
128 std::string::size_type width; in refill()
135 const std::string::size_type pos = input.find_last_of( in refill()
193 std::string::size_type pos, lastpos = 0; in replace_all()
217 std::string::size_type pos = str.find(delimiter); in split()
221 const std::string::size_type next = str.find(delimiter, pos); in split()
H A Dtable.hpp68 table(const table_row::size_type);
70 widths_vector::size_type ncolumns(void) const;
71 widths_vector::value_type column_width(const widths_vector::size_type)
113 table_formatter& set_column_width(const table_row::size_type,
/src/contrib/kyua/utils/format/
H A Dformatter.cpp64 static std::pair< std::string::size_type, std::string >
67 std::string::size_type begin) in find_next_placeholder()
77 std::string::size_type end = begin + 1; in find_next_placeholder()
138 const std::string::size_type dot = partial.find('.'); in new_ostringstream()
161 strip_double_percent(const std::string& in, const std::string::size_type begin, in strip_double_percent()
162 std::string::size_type end) in strip_double_percent()
167 std::string::size_type pos = part.find("%%"); in strip_double_percent()
188 const std::pair< std::string::size_type, std::string > placeholder = in init()
211 const std::string::size_type last_pos) : in formatter()
H A Dformatter.hpp90 std::string::size_type _last_pos;
93 std::string::size_type _placeholder_pos;
105 const std::string::size_type);
/src/contrib/llvm-project/compiler-rt/lib/orc/
H A Dadt.h31 typedef std::size_t size_type; typedef
43 constexpr span(T *first, size_type count) noexcept in span()
52 constexpr reference operator[](size_type idx) const { return Data[idx]; }
53 constexpr size_type size() const noexcept { return Size; } in size()
58 size_type Size = 0;
/src/contrib/llvm-project/libcxx/include/__memory/
H A Dallocator_destructor.h27 typedef _LIBCPP_NODEBUG typename __alloc_traits::size_type size_type; typedef
31 size_type __s_;
34 …_LIBCPP_HIDE_FROM_ABI __allocator_destructor(_Alloc& __a, size_type __s) _NOEXCEPT : __alloc_(__a)… in __allocator_destructor()
H A Dallocator_traits.h104 _LIBCPP_ALLOCATOR_TRAITS_HAS_XXX(__has_size_type, size_type);
109 using type _LIBCPP_NODEBUG = typename _Alloc::size_type;
256 using size_type = typename __size_type<allocator_type, difference_type>::type;
281 allocate(allocator_type& __a, size_type __n) {
285 …template <class _Ap = _Alloc, __enable_if_t<__has_allocate_hint<_Ap, size_type, const_void_pointer…
287 allocate(allocator_type& __a, size_type __n, const_void_pointer __hint) {
294 __enable_if_t<!__has_allocate_hint<_Ap, size_type, const_void_pointer>::value, int> = 0>
296 allocate(allocator_type& __a, size_type __n, const_void_pointer) {
302 [[nodiscard]] _LIBCPP_HIDE_FROM_ABI static constexpr allocation_result<pointer, size_type>
303 allocate_at_least(_Ap& __alloc, size_type __n) {
[all …]
/src/contrib/llvm-project/libcxx/src/include/
H A Dsso_allocator.h41 typedef size_t size_type; typedef
59 …_LIBCPP_HIDE_FROM_ABI pointer allocate(size_type __n, typename __sso_allocator<void, _Np>::const_p…
66 _LIBCPP_HIDE_FROM_ABI void deallocate(pointer __p, size_type __n) { in deallocate()
72 _LIBCPP_HIDE_FROM_ABI size_type max_size() const throw() { return size_type(~0) / sizeof(_Tp); } in max_size()
/src/sys/contrib/openzfs/cmd/zpool_influxdb/
H A Dzpool_influxdb.c487 struct size_lookup size_type[] = { in print_vdev_size_stats() local
514 for (int i = 0; size_type[i].name; i++) { in print_vdev_size_stats()
515 if (nvlist_lookup_uint64_array(nv_ex, size_type[i].name, in print_vdev_size_stats()
516 &size_type[i].array, &c) != 0) { in print_vdev_size_stats()
518 size_type[i].name); in print_vdev_size_stats()
528 for (int i = 0; size_type[i].name; i++) { in print_vdev_size_stats()
529 size_type[i].sum += size_type[i].array[bucket]; in print_vdev_size_stats()
543 for (int i = 0; size_type[i].name; i++) { in print_vdev_size_stats()
545 size_type[i].sum += size_type[i].array[bucket]; in print_vdev_size_stats()
547 size_type[i].sum = size_type[i].array[bucket]; in print_vdev_size_stats()
[all …]
/src/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dedit_distance.h60 typename ArrayRef<T>::size_type m = FromArray.size();
61 typename ArrayRef<T>::size_type n = ToArray.size();
67 typename ArrayRef<T>::size_type AbsDiff = m > n ? m - n : n - m;
76 for (typename ArrayRef<T>::size_type y = 1; y <= m; ++y) {
82 for (typename ArrayRef<T>::size_type x = 1; x <= n; ++x) {
H A DSmallBitVector.h64 using size_type = uintptr_t;
100 void switchToSmall(uintptr_t NewSmallBits, size_type NewSize) { in switchToSmall()
124 size_type getSmallSize() const { in getSmallSize()
128 void setSmallSize(size_type Size) { in setSmallSize()
195 size_type size() const { in size()
200 size_type count() const { in count()
342 for (size_type I = 0, E = getSmallSize(); I != E; ++I)
352 size_type SmallSize = getSmallSize(); in reserve()
354 for (size_type I = 0; I < SmallSize; ++I) in reserve()
509 for (size_type I = 0, E = size(); I != E; ++I) {
[all …]

1234567