Lines Matching refs:TYPE
33 template <typename TYPE>
42 template <class TYPE>
46 typedef TYPE value_type;
53 Vector(const Vector<TYPE>& rhs);
54 explicit Vector(const SortedVector<TYPE>& rhs);
58 const Vector<TYPE>& operator = (const Vector<TYPE>& rhs) const;
59 Vector<TYPE>& operator = (const Vector<TYPE>& rhs);
61 const Vector<TYPE>& operator = (const SortedVector<TYPE>& rhs) const;
62 Vector<TYPE>& operator = (const SortedVector<TYPE>& rhs);
88 inline const TYPE* array() const;
90 TYPE* editArray();
97 inline const TYPE& operator [] (size_t index) const;
99 inline const TYPE& itemAt(size_t index) const;
101 const TYPE& top() const;
108 TYPE& editItemAt(size_t index);
110 TYPE& editTop();
117 ssize_t insertVectorAt(const Vector<TYPE>& vector, size_t index);
120 ssize_t appendVector(const Vector<TYPE>& vector);
124 ssize_t insertArrayAt(const TYPE* array, size_t index, size_t length);
127 ssize_t appendArray(const TYPE* array, size_t length);
136 ssize_t insertAt(const TYPE& prototype_item, size_t index, size_t numItems = 1);
142 void push(const TYPE& item);
146 ssize_t add(const TYPE& item);
150 ssize_t replaceAt(const TYPE& item, size_t index);
165 typedef int (*compar_t)(const TYPE* lhs, const TYPE* rhs);
166 typedef int (*compar_r_t)(const TYPE* lhs, const TYPE* rhs, void* state);
179 typedef TYPE* iterator;
180 typedef TYPE const* const_iterator;
188 inline void push_back(const TYPE& item) { insertAt(item, size(), 1); }
189 inline void push_front(const TYPE& item) { insertAt(item, 0, 1); }
211 template<class TYPE> inline
212 Vector<TYPE>::Vector()
213 : VectorImpl(sizeof(TYPE),
214 ((traits<TYPE>::has_trivial_ctor ? HAS_TRIVIAL_CTOR : 0)
215 |(traits<TYPE>::has_trivial_dtor ? HAS_TRIVIAL_DTOR : 0)
216 |(traits<TYPE>::has_trivial_copy ? HAS_TRIVIAL_COPY : 0))
221 template<class TYPE> inline
222 Vector<TYPE>::Vector(const Vector<TYPE>& rhs)
226 template<class TYPE> inline
227 Vector<TYPE>::Vector(const SortedVector<TYPE>& rhs)
231 template<class TYPE> inline
232 Vector<TYPE>::~Vector() {
236 template<class TYPE> inline
237 Vector<TYPE>& Vector<TYPE>::operator = (const Vector<TYPE>& rhs) {
242 template<class TYPE> inline
243 const Vector<TYPE>& Vector<TYPE>::operator = (const Vector<TYPE>& rhs) const {
248 template<class TYPE> inline
249 Vector<TYPE>& Vector<TYPE>::operator = (const SortedVector<TYPE>& rhs) {
254 template<class TYPE> inline
255 const Vector<TYPE>& Vector<TYPE>::operator = (const SortedVector<TYPE>& rhs) const {
260 template<class TYPE> inline
261 const TYPE* Vector<TYPE>::array() const {
262 return static_cast<const TYPE *>(arrayImpl());
265 template<class TYPE> inline
266 TYPE* Vector<TYPE>::editArray() {
267 return static_cast<TYPE *>(editArrayImpl());
271 template<class TYPE> inline
272 const TYPE& Vector<TYPE>::operator[](size_t index) const {
279 template<class TYPE> inline
280 const TYPE& Vector<TYPE>::itemAt(size_t index) const {
284 template<class TYPE> inline
285 const TYPE& Vector<TYPE>::top() const {
289 template<class TYPE> inline
290 TYPE& Vector<TYPE>::editItemAt(size_t index) {
291 return *( static_cast<TYPE *>(editItemLocation(index)) );
294 template<class TYPE> inline
295 TYPE& Vector<TYPE>::editTop() {
296 return *( static_cast<TYPE *>(editItemLocation(size()-1)) );
299 template<class TYPE> inline
300 ssize_t Vector<TYPE>::insertVectorAt(const Vector<TYPE>& vector, size_t index) {
304 template<class TYPE> inline
305 ssize_t Vector<TYPE>::appendVector(const Vector<TYPE>& vector) {
309 template<class TYPE> inline
310 ssize_t Vector<TYPE>::insertArrayAt(const TYPE* array, size_t index, size_t length) {
314 template<class TYPE> inline
315 ssize_t Vector<TYPE>::appendArray(const TYPE* array, size_t length) {
319 template<class TYPE> inline
320 ssize_t Vector<TYPE>::insertAt(const TYPE& item, size_t index, size_t numItems) {
324 template<class TYPE> inline
325 void Vector<TYPE>::push(const TYPE& item) {
329 template<class TYPE> inline
330 ssize_t Vector<TYPE>::add(const TYPE& item) {
334 template<class TYPE> inline
335 ssize_t Vector<TYPE>::replaceAt(const TYPE& item, size_t index) {
339 template<class TYPE> inline
340 ssize_t Vector<TYPE>::insertAt(size_t index, size_t numItems) {
344 template<class TYPE> inline
345 void Vector<TYPE>::pop() {
349 template<class TYPE> inline
350 void Vector<TYPE>::push() {
354 template<class TYPE> inline
355 ssize_t Vector<TYPE>::add() {
359 template<class TYPE> inline
360 ssize_t Vector<TYPE>::replaceAt(size_t index) {
364 template<class TYPE> inline
365 ssize_t Vector<TYPE>::removeItemsAt(size_t index, size_t count) {
369 template<class TYPE> inline
370 status_t Vector<TYPE>::sort(Vector<TYPE>::compar_t cmp) {
374 template<class TYPE> inline
375 status_t Vector<TYPE>::sort(Vector<TYPE>::compar_r_t cmp, void* state) {
381 template<class TYPE>
382 void Vector<TYPE>::do_construct(void* storage, size_t num) const {
383 construct_type( reinterpret_cast<TYPE*>(storage), num );
386 template<class TYPE>
387 void Vector<TYPE>::do_destroy(void* storage, size_t num) const {
388 destroy_type( reinterpret_cast<TYPE*>(storage), num );
391 template<class TYPE>
392 void Vector<TYPE>::do_copy(void* dest, const void* from, size_t num) const {
393 copy_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(from), num );
396 template<class TYPE>
397 void Vector<TYPE>::do_splat(void* dest, const void* item, size_t num) const {
398 splat_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(item), num );
401 template<class TYPE>
402 void Vector<TYPE>::do_move_forward(void* dest, const void* from, size_t num) const {
403 move_forward_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(from), num );
406 template<class TYPE>
407 void Vector<TYPE>::do_move_backward(void* dest, const void* from, size_t num) const {
408 move_backward_type( reinterpret_cast<TYPE*>(dest), reinterpret_cast<const TYPE*>(from), num );