Cross Reference: /frameworks/native/include/utils/Vector.h

Lines Matching defs:Vector
43 class Vector : private VectorImpl
52                             Vector();
53                             Vector(const Vector<TYPE>& rhs);
54     explicit                Vector(const SortedVector<TYPE>& rhs);
55     virtual                 ~Vector();
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);
117             ssize_t         insertVectorAt(const Vector<TYPE>& vector, size_t index);
120             ssize_t         appendVector(const Vector<TYPE>& vector);
203 // Vector<T> can be trivially moved using memcpy() because moving does not
205 template<typename T> struct trait_trivial_move<Vector<T> > { enum { value = true }; };
212 Vector<TYPE>::Vector()
222 Vector<TYPE>::Vector(const Vector<TYPE>& rhs)
227 Vector<TYPE>::Vector(const SortedVector<TYPE>& rhs)
232 Vector<TYPE>::~Vector() {
237 Vector<TYPE>& Vector<TYPE>::operator = (const Vector<TYPE>& rhs) {
243 const Vector<TYPE>& Vector<TYPE>::operator = (const Vector<TYPE>& rhs) const {
249 Vector<TYPE>& Vector<TYPE>::operator = (const SortedVector<TYPE>& rhs) {
255 const Vector<TYPE>& Vector<TYPE>::operator = (const SortedVector<TYPE>& rhs) const {
261 const TYPE* Vector<TYPE>::array() const {
266 TYPE* Vector<TYPE>::editArray() {
272 const TYPE& Vector<TYPE>::operator[](size_t index) const {
280 const TYPE& Vector<TYPE>::itemAt(size_t index) const {
285 const TYPE& Vector<TYPE>::top() const {
290 TYPE& Vector<TYPE>::editItemAt(size_t index) {
295 TYPE& Vector<TYPE>::editTop() {
300 ssize_t Vector<TYPE>::insertVectorAt(const Vector<TYPE>& vector, size_t index) {
305 ssize_t Vector<TYPE>::appendVector(const Vector<TYPE>& vector) {
310 ssize_t Vector<TYPE>::insertArrayAt(const TYPE* array, size_t index, size_t length) {
315 ssize_t Vector<TYPE>::appendArray(const TYPE* array, size_t length) {
320 ssize_t Vector<TYPE>::insertAt(const TYPE& item, size_t index, size_t numItems) {
325 void Vector<TYPE>::push(const TYPE& item) {
330 ssize_t Vector<TYPE>::add(const TYPE& item) {
335 ssize_t Vector<TYPE>::replaceAt(const TYPE& item, size_t index) {
340 ssize_t Vector<TYPE>::insertAt(size_t index, size_t numItems) {
345 void Vector<TYPE>::pop() {
350 void Vector<TYPE>::push() {
355 ssize_t Vector<TYPE>::add() {
360 ssize_t Vector<TYPE>::replaceAt(size_t index) {
365 ssize_t Vector<TYPE>::removeItemsAt(size_t index, size_t count) {
370 status_t Vector<TYPE>::sort(Vector<TYPE>::compar_t cmp) {
375 status_t Vector<TYPE>::sort(Vector<TYPE>::compar_r_t cmp, void* state) {
382 void Vector<TYPE>::do_construct(void* storage, size_t num) const {
387 void Vector<TYPE>::do_destroy(void* storage, size_t num) const {
392 void Vector<TYPE>::do_copy(void* dest, const void* from, size_t num) const {
397 void Vector<TYPE>::do_splat(void* dest, const void* item, size_t num) const {
402 void Vector<TYPE>::do_move_forward(void* dest, const void* from, size_t num) const {
407 void Vector<TYPE>::do_move_backward(void* dest, const void* from, size_t num) const {