Home | History | Annotate | Download | only in utils

Lines Matching refs:TYPE

35 template <class TYPE>
38 friend class Vector<TYPE>;
41 typedef TYPE value_type;
48 SortedVector(const SortedVector<TYPE>& rhs);
52 const SortedVector<TYPE>& operator = (const SortedVector<TYPE>& rhs) const;
53 SortedVector<TYPE>& operator = (const SortedVector<TYPE>& rhs);
79 inline const TYPE* array() const;
83 TYPE* editArray();
86 ssize_t indexOf(const TYPE& item) const;
89 size_t orderOf(const TYPE& item) const;
97 inline const TYPE& operator [] (size_t index) const;
99 inline const TYPE& itemAt(size_t index) const;
101 const TYPE& top() const;
108 ssize_t add(const TYPE& item);
111 TYPE& editItemAt(size_t index) {
112 return *( static_cast<TYPE *>(VectorImpl::editItemLocation(index)) );
116 ssize_t merge(const Vector<TYPE>& vector);
117 ssize_t merge(const SortedVector<TYPE>& vector);
120 ssize_t remove(const TYPE&);
130 typedef TYPE* iterator;
131 typedef TYPE const* const_iterator;
158 template<class TYPE> inline
159 SortedVector<TYPE>::SortedVector()
160 : SortedVectorImpl(sizeof(TYPE),
161 ((traits<TYPE>::has_trivial_ctor ? HAS_TRIVIAL_CTOR : 0)
162 |(traits<TYPE>::has_trivial_dtor ? HAS_TRIVIAL_DTOR : 0)
163 |(traits<TYPE>::has_trivial_copy ? HAS_TRIVIAL_COPY : 0))
168 template<class TYPE> inline
169 SortedVector<TYPE>::SortedVector(const SortedVector<TYPE>& rhs)
173 template<class TYPE> inline
174 SortedVector<TYPE>::~SortedVector() {
178 template<class TYPE> inline
179 SortedVector<TYPE>& SortedVector<TYPE>::operator = (const SortedVector<TYPE>& rhs) {
184 template<class TYPE> inline
185 const SortedVector<TYPE>& SortedVector<TYPE>::operator = (const SortedVector<TYPE>& rhs) const {
190 template<class TYPE> inline
191 const TYPE* SortedVector<TYPE>::array() const {
192 return static_cast<const TYPE *>(arrayImpl());
195 template<class TYPE> inline
196 TYPE* SortedVector<TYPE>::editArray() {
197 return static_cast<TYPE *>(editArrayImpl());
201 template<class TYPE> inline
202 const TYPE& SortedVector<TYPE>::operator[](size_t index) const {
209 template<class TYPE> inline
210 const TYPE& SortedVector<TYPE>::itemAt(size_t index) const {
214 template<class TYPE> inline
215 const TYPE& SortedVector<TYPE>::top() const {
219 template<class TYPE> inline
220 ssize_t SortedVector<TYPE>::add(const TYPE& item) {
224 template<class TYPE> inline
225 ssize_t SortedVector<TYPE>::indexOf(const TYPE& item) const {
229 template<class TYPE> inline
230 size_t SortedVector<TYPE>::orderOf(const TYPE& item) const {
234 template<class TYPE> inline
235 ssize_t SortedVector<TYPE>::merge(const Vector<TYPE>& vector) {
239 template<class TYPE> inline
240 ssize_t SortedVector<TYPE>::merge(const SortedVector<TYPE>& vector) {
244 template<class TYPE> inline
245 ssize_t SortedVector<TYPE>::remove(const TYPE& item) {
249 template<class TYPE> inline
250 ssize_t SortedVector<TYPE>::removeItemsAt(size_t index, size_t count) {
256 template<class TYPE>
257 UTILS_VECTOR_NO_CFI void SortedVector<TYPE>::do_construct(void* storage, size_t num) const {
258 construct_type( reinterpret_cast<TYPE*>(storage), num );
261 template<class TYPE>
262 void SortedVector<TYPE>::do_destroy(void* storage, size_t num) const {
263 destroy_type( reinterpret_cast<TYPE*>(storage), num );
266 template<class TYPE>
267 UTILS_VECTOR_NO_CFI void SortedVector<TYPE>::do_copy(void* dest, const void* from, size_t num) const {
268 copy_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(from), num );
271 template<class TYPE>
272 UTILS_VECTOR_NO_CFI void SortedVector<TYPE>::do_splat(void* dest, const void* item, size_t num) const {
273 splat_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(item), num );
276 template<class TYPE>
277 UTILS_VECTOR_NO_CFI void SortedVector<TYPE>::do_move_forward(void* dest, const void* from, size_t num) const {
278 move_forward_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(from), num );
281 template<class TYPE>
282 UTILS_VECTOR_NO_CFI void SortedVector<TYPE>::do_move_backward(void* dest, const void* from, size_t num) const {
283 move_backward_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(from), num );
286 template<class TYPE>
287 int SortedVector<TYPE>::do_compare(const void* lhs, const void* rhs) const {
288 return compare_type( *reinterpret_cast<const TYPE*>(lhs), *reinterpret_cast<const TYPE*>(rhs) );