Lines Matching full:void
54 void finish_vector();
59 inline const void* arrayImpl() const { return mStorage; }
60 void* editArrayImpl();
71 ssize_t insertArrayAt(const void* array, size_t index, size_t length);
72 ssize_t appendArray(const void* array, size_t length);
76 ssize_t insertAt(const void* item, size_t where, size_t numItems = 1);
77 void pop();
78 void push();
79 void push(const void* item);
81 ssize_t add(const void* item);
83 ssize_t replaceAt(const void* item, size_t index);
87 void clear();
89 const void* itemLocation(size_t index) const;
90 void* editItemLocation(size_t index);
92 typedef int (*compar_t)(const void* lhs, const void* rhs);
93 typedef int (*compar_r_t)(const void* lhs, const void* rhs, void* state);
95 status_t sort(compar_r_t cmp, void* state);
99 void release_storage();
101 virtual void do_construct(void* storage, size_t num) const = 0;
102 virtual void do_destroy(void* storage, size_t num) const = 0;
103 virtual void do_copy(void* dest, const void* from, size_t num) const = 0;
104 virtual void do_splat(void* dest, const void* item, size_t num) const = 0;
105 virtual void do_move_forward(void* dest, const void* from, size_t num) const = 0;
106 virtual void do_move_backward(void* dest, const void* from, size_t num) const = 0;
109 virtual void reservedVectorImpl1();
110 virtual void reservedVectorImpl2();
111 virtual void reservedVectorImpl3();
112 virtual void reservedVectorImpl4();
113 virtual void reservedVectorImpl5();
114 virtual void reservedVectorImpl6();
115 virtual void reservedVectorImpl7();
116 virtual void reservedVectorImpl8();
119 void* _grow(size_t where, size_t amount);
120 void _shrink(size_t where, size_t amount);
122 inline void _do_construct(void* storage, size_t num) const;
123 inline void _do_destroy(void* storage, size_t num) const;
124 inline void _do_copy(void* dest, const void* from, size_t num) const;
125 inline void _do_splat(void* dest, const void* item, size_t num) const;
126 inline void _do_move_forward(void* dest, const void* from, size_t num) const;
127 inline void _do_move_backward(void* dest, const void* from, size_t num) const;
131 void * mStorage; // base address of the vector
150 ssize_t indexOf(const void* item) const;
153 size_t orderOf(const void* item) const;
156 ssize_t add(const void* item);
163 ssize_t remove(const void* item);
166 virtual int do_compare(const void* lhs, const void* rhs) const = 0;
169 virtual void reservedSortedVectorImpl1();
170 virtual void reservedSortedVectorImpl2();
171 virtual void reservedSortedVectorImpl3();
172 virtual void reservedSortedVectorImpl4();
173 virtual void reservedSortedVectorImpl5();
174 virtual void reservedSortedVectorImpl6();
175 virtual void reservedSortedVectorImpl7();
176 virtual void reservedSortedVectorImpl8();
179 ssize_t _indexOrderOf(const void* item, size_t* order = 0) const;
184 void pop();
185 void push();
186 void push(const void* item);
189 ssize_t insertArrayAt(const void* array, size_t index, size_t length);
190 ssize_t appendArray(const void* array, size_t length);
192 ssize_t insertAt(const void* item, size_t where, size_t numItems = 1);
194 ssize_t replaceAt(const void* item, size_t index);
