Home
last modified time | relevance | path

Searched refs:c_iterator (Results 1 – 13 of 13) sorted by relevance

/OK3568_Linux_fs/external/security/rk_tee_user/v2/ta/vector_util/
H A Dc_algo.h82 void c_iter_swap(c_iterator x, c_iterator y);
83 c_iterator c_copy(c_iterator first, c_iterator last, c_iterator result);
84 c_iterator c_copy_backward(c_iterator first, c_iterator last, c_iterator result);
85 c_bool c_lexicographical_compare(c_iterator first1,
86 c_iterator last1,
87 c_iterator first2,
88 c_iterator last2,
90 c_iterator c_uninitialized_copy(c_iterator first, c_iterator last, c_iterator result);
91 void c_fill(c_iterator first, c_iterator last, const value_type val);
92 c_iterator c_fill_n(c_iterator first, size_type n, const value_type val);
[all …]
H A Dc_algo.c55 void c_iter_swap(c_iterator x, c_iterator y) in c_iter_swap()
62 c_iterator c_copy(c_iterator first, c_iterator last, c_iterator result) in c_copy()
69 c_iterator c_copy_backward(c_iterator first, c_iterator last, c_iterator result) in c_copy_backward()
80 c_bool c_lexicographical_compare(c_iterator first1, in c_lexicographical_compare()
81 c_iterator last1, in c_lexicographical_compare()
82 c_iterator first2, in c_lexicographical_compare()
83 c_iterator last2, in c_lexicographical_compare()
98 c_iterator c_uninitialized_copy(c_iterator first, c_iterator last, c_iterator result) in c_uninitialized_copy()
103 void c_fill(c_iterator first, c_iterator last, const value_type val) in c_fill()
109 c_iterator c_fill_n(c_iterator first, size_type n, const value_type val) in c_fill_n()
[all …]
H A Dc_iterator.h62 #define c_iterator _c_iterator macro
83 typedef struct c_iterator c_iterator, * c_piterator; typedef
84 typedef const c_iterator c_const_iterator;
98 struct c_iterator struct
112 c_iterator (* assign)(c_piterator thiz, const c_piterator val); argument
115 c_iterator (* inc)(c_piterator thiz);
116 c_iterator (* inc_n)(c_piterator thiz, difference_type n);
117 c_iterator (* dec)(c_piterator thiz);
118 c_iterator (* dec_n)(c_piterator thiz, difference_type n);
121 c_iterator (* positive_n)(c_piterator thiz, difference_type n);
[all …]
H A Dc_iterator.c57 static c_iterator _c_array_iterator_assign(c_piterator thiz, const c_piterator val) in _c_array_iterator_assign()
74 static c_iterator _c_array_iterator_inc(c_piterator thiz) in _c_array_iterator_inc()
82 static c_iterator _c_array_iterator_inc_n(c_piterator thiz, difference_type n) in _c_array_iterator_inc_n()
90 static c_iterator _c_array_iterator_dec(c_piterator thiz) in _c_array_iterator_dec()
98 static c_iterator _c_array_iterator_dec_n(c_piterator thiz, difference_type n) in _c_array_iterator_dec_n()
116 static c_iterator _c_array_iterator_positive_n(c_piterator thiz, difference_type n) in _c_array_iterator_positive_n()
118 c_iterator iter; in _c_array_iterator_positive_n()
125 static c_iterator _c_array_iterator_negative_n(c_piterator thiz, difference_type n) in _c_array_iterator_negative_n()
127 c_iterator iter; in _c_array_iterator_negative_n()
162 c_iterator c_get_array_iterator(void ** ppt) in c_get_array_iterator()
[all …]
H A Dc_tree.h127 c_iterator c_rb_tree_begin(c_prb_tree thiz);
128 c_iterator c_rb_tree_end(c_prb_tree thiz);
136 c_iterator c_rb_tree_insert_equal(c_prb_tree thiz, const value_type val);
137 c_iterator c_rb_tree_insert_unique1(c_prb_tree thiz, c_iterator position, const value_type val);
138 c_iterator c_rb_tree_insert_equal1(c_prb_tree thiz, c_iterator position, const value_type val);
139 void c_rb_tree_insert_unique2(c_prb_tree thiz, c_iterator first, c_iterator last);
140 void c_rb_tree_insert_equal2(c_prb_tree thiz, c_iterator first, c_iterator last);
141 void c_rb_tree_erase(c_prb_tree thiz, c_iterator position);
143 void c_rb_tree_erase2(c_prb_tree thiz, c_iterator first, c_iterator last);
145 c_iterator c_rb_tree_find(c_prb_tree thiz, key_type key);
[all …]
H A Dc_vector.c67 static c_iterator _A_get_iterator(pnode_t pn);
74 static c_iterator _c_vector_iterator_assign(c_piterator thiz, const c_piterator val) in _c_vector_iterator_assign()
91 static c_iterator _c_vector_iterator_inc(c_piterator thiz) in _c_vector_iterator_inc()
99 static c_iterator _c_vector_iterator_inc_n(c_piterator thiz, difference_type n) in _c_vector_iterator_inc_n()
107 static c_iterator _c_vector_iterator_dec(c_piterator thiz) in _c_vector_iterator_dec()
115 static c_iterator _c_vector_iterator_dec_n(c_piterator thiz, difference_type n) in _c_vector_iterator_dec_n()
133 static c_iterator _c_vector_iterator_positive_n(c_piterator thiz, difference_type n) in _c_vector_iterator_positive_n()
135 c_iterator iter; in _c_vector_iterator_positive_n()
142 static c_iterator _c_vector_iterator_negative_n(c_piterator thiz, difference_type n) in _c_vector_iterator_negative_n()
144 c_iterator iter; in _c_vector_iterator_negative_n()
[all …]
H A Dc_map.c75 c_iterator c_map_begin(c_pmap thiz) in c_map_begin()
80 c_iterator c_map_end(c_pmap thiz) in c_map_end()
112 c_iterator iter = c_map_lower_bound(thiz, key); in c_map_at()
113 c_iterator end = c_map_end(thiz); in c_map_at()
131 c_iterator c_map_insert1(c_pmap thiz, c_iterator position, const value_type val) in c_map_insert1()
136 void c_map_insert2(c_pmap thiz, c_iterator first, c_iterator last) in c_map_insert2()
141 void c_map_erase(c_pmap thiz, c_iterator position) in c_map_erase()
151 void c_map_erase2(c_pmap thiz, c_iterator first, c_iterator last) in c_map_erase2()
161 c_iterator c_map_find(c_pmap thiz, key_type key) in c_map_find()
168 c_iterator key_iter = c_rb_tree_find((c_prb_tree)thiz->_l, key); in c_map_count()
[all …]
H A Dc_vector.h98 c_iterator c_vector_begin(c_pvector thiz);
99 c_iterator c_vector_end(c_pvector thiz);
114 c_iterator c_vector_insert(c_pvector thiz, c_iterator pos, const value_type val);
115 void c_vector_insert2(c_pvector thiz, c_iterator pos, c_iterator first, c_iterator last);
116 void c_vector_fill_insert(c_pvector thiz, c_iterator pos, size_type n, const value_type val);
117 c_iterator c_vector_erase(c_pvector thiz, c_iterator pos);
118 c_iterator c_vector_erase2(c_pvector thiz, c_iterator first, c_iterator last);
H A Dc_map.h97 c_iterator c_map_begin(c_pmap thiz);
98 c_iterator c_map_end(c_pmap thiz);
107 c_iterator c_map_insert1(c_pmap thiz, c_iterator position, const value_type val);
108 void c_map_insert2(c_pmap thiz, c_iterator first, c_iterator last);
109 void c_map_erase(c_pmap thiz, c_iterator position);
111 void c_map_erase2(c_pmap thiz, c_iterator first, c_iterator last);
113 c_iterator c_map_find(c_pmap thiz, key_type key);
115 c_iterator c_map_lower_bound(c_pmap thiz, key_type key);
116 c_iterator c_map_upper_bound(c_pmap thiz, key_type key);
H A Dc_pair.h90 c_iterator first;
99 c_iterator first;
100 c_iterator second;
105 c_iter_bool_pair c_make_iter_bool_pair(c_iterator x, c_bool y);
106 c_iter_iter_pair c_make_iter_iter_pair(c_iterator x, c_iterator y);
H A Dc_tree.c121 c_iterator iter; in _A_reverse_iterator_increment()
129 c_iterator iter; in _A_reverse_iterator_decrement()
135 static c_iterator _c_rb_tree_iterator_assign(c_piterator thiz, const c_piterator val) in _c_rb_tree_iterator_assign()
152 static c_iterator _c_rb_tree_iterator_inc(c_piterator thiz) in _c_rb_tree_iterator_inc()
158 static c_iterator _c_rb_tree_iterator_dec(c_piterator thiz) in _c_rb_tree_iterator_dec()
187 static c_iterator _A_get_iterator(_base_ptr val) in _A_get_iterator()
189 c_iterator iter; in _A_get_iterator()
205 c_iterator iter = _A_get_iterator(thiz->_i); in _c_rb_tree_reverse_iterator_ref()
212 c_iterator iter = _A_get_iterator(thiz->_i); in _c_rb_tree_reverse_iterator_ref_assign()
591 static c_iterator _A_insert(c_prb_tree thiz, _base_ptr x, _base_ptr y, const value_type val) in _A_insert()
[all …]
H A Dc_pair.c64 c_iter_bool_pair c_make_iter_bool_pair(c_iterator x, c_bool y) in c_make_iter_bool_pair()
72 c_iter_iter_pair c_make_iter_iter_pair(c_iterator x, c_iterator y) in c_make_iter_iter_pair()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/equals/
H A Dcollect_vectors.hpp374 typedef typename boost::range_iterator<Collection>::type c_iterator; in apply_impl() typedef
375 c_iterator first = range::pos(collection, c_old_size); in apply_impl()